default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYossi Shiloach
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[c5]Amir Nahir, Yossi Shiloach, Avi Ziv:
Using Linear Programming Techniques for Scheduling-Based Random Test-Case Generation. Haifa Verification Conference 2006: 16-33
1980 – 1989
- 1987
- [j22]Baruch Awerbuch, Yossi Shiloach:
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM. IEEE Trans. Computers 36(10): 1258-1263 (1987) - 1986
- [j21]Amos Israeli, Yossi Shiloach:
An Improved Parallel Algorithm for Maximal Matching. Inf. Process. Lett. 22(2): 57-60 (1986) - 1984
- [c4]Baruch Awerbuch, Amos Israeli, Yossi Shiloach:
Finding Euler Circuits in Logarithmic Parallel Time. STOC 1984: 249-257 - 1982
- [j20]Yossi Shiloach, Uzi Vishkin, Shmuel Zaks:
Golden ratios in a pairs covering problem. Discret. Math. 41(1): 57-65 (1982) - [j19]Yossi Shiloach, Uzi Vishkin:
An O(log n) Parallel Connectivity Algorithm. J. Algorithms 3(1): 57-67 (1982) - [j18]Yossi Shiloach, Uzi Vishkin:
An O(n² log n) Parallel MAX-FLOW Algorithm. J. Algorithms 3(2): 128-146 (1982) - [j17]Alon Itai, Yehoshua Perl, Yossi Shiloach:
The complexity of finding maximum disjoint paths with length constraints. Networks 12(3): 277-286 (1982) - 1981
- [j16]Yossi Shiloach:
Another Look at the Degree Constrained Subgraph Problem. Inf. Process. Lett. 12(2): 89-92 (1981) - [j15]Shimon Even, Yossi Shiloach:
An On-Line Edge-Deletion Problem. J. ACM 28(1): 1-4 (1981) - [j14]Yossi Shiloach, Uzi Vishkin:
Finding the Maximum, Merging, and Sorting in a Parallel Computation Model. J. Algorithms 2(1): 88-102 (1981) - [j13]Yossi Shiloach:
Fast Canonization of Circular Strings. J. Algorithms 2(2): 107-121 (1981) - [c3]Yehoshua Perl, Yossi Shiloach:
Efficient Optimization of Monotonic Functions on Trees. CAAP 1981: 332-339 - [c2]Yossi Shiloach, Uzi Vishkin:
Finding the maximum, merging and sorting in a parallel computation model. CONPAR 1981: 314-327 - 1980
- [j12]Yossi Shiloach:
A Polynomial Solution to the Undirected Two Paths Problem. J. ACM 27(3): 445-456 (1980) - [j11]Yossi Shiloach:
A Multi-Terminal Minimum Cut Algorithm for Planar Graphs. SIAM J. Comput. 9(2): 219-224 (1980) - [j10]Bengt Aspvall, Yossi Shiloach:
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality. SIAM J. Comput. 9(4): 827-845 (1980)
1970 – 1979
- 1979
- [j9]Yossi Shiloach:
Edge-Disjoint Branching in Directed Multigraphs. Inf. Process. Lett. 8(1): 24-27 (1979) - [j8]Yossi Shiloach:
Strong Linear Orderings of a Directed Network. Inf. Process. Lett. 8(3): 146-148 (1979) - [j7]Yossi Shiloach:
A Fast Equivalence-Checking Algorithm for Circular Lists. Inf. Process. Lett. 8(5): 236-238 (1979) - [j6]Tomas H. Varkony, Yossi Shiloach, Dennis H. Smith:
Computer-Assisted Examination of Chemical Compounds for Structural Similarities. J. Chem. Inf. Comput. Sci. 19(2): 104-111 (1979) - [j5]Yossi Shiloach:
A Minimum Linear Arrangement Algorithm for Undirected Trees. SIAM J. Comput. 8(1): 15-32 (1979) - [j4]Alon Itai, Yossi Shiloach:
Maximum Flow in Planar Networks. SIAM J. Comput. 8(2): 135-150 (1979) - [j3]Yossi Shiloach:
Multi-Terminal 0-1 Flow. SIAM J. Comput. 8(3): 422-430 (1979) - [c1]Bengt Aspvall, Yossi Shiloach:
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality. FOCS 1979: 205-217 - 1978
- [j2]Yehoshua Perl, Yossi Shiloach:
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph. J. ACM 25(1): 1-9 (1978) - [j1]M. Cutler, Yossi Shiloach:
Permutation layout. Networks 8(3): 253-278 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
