Uzi Vishkin

	2012
154		James A. Edwards, Uzi Vishkin: Better speedups using simpler parallel programming for graph connectivity and biconnectivity. PMAM 2012: 103-114
	2011
153		Fuat Keceli, Tali Moreshet, Uzi Vishkin: Power-Performance Comparison of Single-Task Driven Many-Cores. ICPADS 2011: 348-355
152		Yves Robert, William J. Dally, Jack Dongarra, Satoshi Matsuoka, Robert Schreiber, Horst D. Simon, Uzi Vishkin: Panel Statement. IPDPS 2011: 505
151		Fuat Keceli, Alexandros Tzannes, George C. Caragea, Rajeev Barua, Uzi Vishkin: Toolchain for Programming, Simulating and Studying the XMT Many-Core Architecture. IPDPS Workshops 2011: 1282-1291
150		Alexandros Tzannes, Rajeev Barua, Uzi Vishkin: Improving Run-Time Scheduling for General-Purpose Parallel Code. PACT 2011: 216
149		George Constantin Caragea, Uzi Vishkin: Brief announcement: better speedups for parallel max-flow. SPAA 2011: 131-134
148		Uzi Vishkin: Using simple abstraction to reinvent computing for parallelism. Commun. ACM 54(1): 75-85 (2011)
147		Michael N. Horak, Steven M. Nowick, Matthew Carlberg, Uzi Vishkin: A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors. IEEE Trans. on CAD of Integrated Circuits and Systems 30(4): 494-507 (2011)
146		George C. Caragea, Alexandros Tzannes, Fuat Keceli, Rajeev Barua, Uzi Vishkin: Resource-Aware Compiler Prefetching for Fine-Grained Many-Cores. International Journal of Parallel Programming 39(5): 615-638 (2011)
	2010
145		Fuat Keceli, Tali Moreshet, Uzi Vishkin: Thermal Management of a Many-Core Processor under Fine-Grained Parallelism. Euro-Par Workshops (1) 2010: 249-259
144		George C. Caragea, Alexandros Tzannes, Fuat Keceli, Rajeev Barua, Uzi Vishkin: Resource-Aware Compiler Prefetching for Many-Cores. ISPDC 2010: 133-140
143		Michael N. Horak, Steven M. Nowick, Matthew Carlberg, Uzi Vishkin: A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors. NOCS 2010: 43-50
142		Alexandros Tzannes, George C. Caragea, Rajeev Barua, Uzi Vishkin: Lazy binary-splitting: a run-time adaptive work-stealing scheduler. PPOPP 2010: 179-190
141		Shane Torbert, Uzi Vishkin, Ron Tzur, David J. Ellison: Is teaching parallel algorithmic thinking to high school students possible?: one teacher's experience. SIGCSE 2010: 290-294
	2009
140		Martti Forsell, Peter Hofstee, Ahmed Jerraya, Chris R. Jesshope, Uzi Vishkin, Jesper Larsson Träff: HPPC 2009 Panel: Are Many-Core Computer Vendors on Track? Euro-Par Workshops 2009: 9-15
139		Uzi Vishkin: Algorithmic approach to designing an easy-to-program system: Can it lead to a HW-enhanced programmer's workflow add-on? ICCD 2009: 60-63
138		George C. Caragea, A. Beliz Saybasili, Xingzhi Wen, Uzi Vishkin: Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor. SPAA 2009: 163-165
137		Aydin O. Balkan, Gang Qu, Uzi Vishkin: Mesh-of-Trees and Alternative Interconnection Networks for Single-Chip Parallelism. IEEE Trans. VLSI Syst. 17(10): 1419-1432 (2009)
	2008
136		Xingzhi Wen, Uzi Vishkin: Fpga-based prototype of a pram-on-chip processor. Conf. Computing Frontiers 2008: 55-66
135		Aydin O. Balkan, Gang Qu, Uzi Vishkin: An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing. DAC 2008: 435-440
134		Thomas M. DuBois, Bryant Lee, Yi Wang, Marc Olano, Uzi Vishkin: XMT-GPU: A PRAM Architecture for Graphics Computation. ICPP 2008: 364-372
133		Lorin Hochstein, Victor R. Basili, Uzi Vishkin, John Gilbert: A pilot study to compare programming effort for two parallel programming models. Journal of Systems and Software 81(11): 1920-1930 (2008)
	2007
132		Uzi Vishkin: Toward Realizing a PRAM-on-a-Chip Vision. Euro-Par Workshops 2007: 5-6
131		Aydin O. Balkan, Michael N. Horak, Gang Qu, Uzi Vishkin: Layout-Accurate Design and Implementation of a High-Throughput Interconnection Network for Single-Chip Parallel Processing. Hot Interconnects 2007: 21-28
130		Xingzhi Wen, Uzi Vishkin: PRAM-on-chip: first commitment to silicon. SPAA 2007: 301-302
	2006
129		Phillip B. Gibbons, Uzi Vishkin: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006 ACM 2006
128		Aydin O. Balkan, Gang Qu, Uzi Vishkin: A Mesh-of-Trees Interconnection Network for Single-Chip Parallel Processing. ASAP 2006: 73-80
127		Stuart D. Milner, Jaime Llorca, Archana Anibha, Uzi Vishkin: A bootstrapping model for directional wireless networks. IEEE Communications Letters 10(12): 840-842 (2006)
126		Fang Liu, Uzi Vishkin, Stuart D. Milner: Bootstrapping Free-Space Optical Networks. IEEE Journal on Selected Areas in Communications 24(S-12): 13-22 (2006)
125		Pei Gu, Uzi Vishkin: Case study of gate-level logic simulation on an extremely fine-grained chip multiprocessor. J. Embedded Computing 2(2): 181-190 (2006)
	2005
124		Fang Liu, Uzi Vishkin, Stuart D. Milner: Bootstrapping Free-Space Optical Networks. IPDPS 2005
	2004
123		Aydin O. Balkan, Gang Qu, Uzi Vishkin: Arbitrate-and-move primitives for high throughput on-chip interconnection networks. ISCAS (2) 2004: 441-444
122		Uzi Vishkin: PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness. MFCS 2004: 104-105
	2003
121		Shay Kutten, David Peleg, Uzi Vishkin: Deterministic Resource Discovery in Distributed Networks. Theory Comput. Syst. 36(5): 479-495 (2003)
120		Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin: Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach. Theory Comput. Syst. 36(5): 521-552 (2003)
	2002
119		Uzi Vishkin: Two techniques for reconciling algorithm parallelism with memory constraints. SPAA 2002: 95-98
118		Samir Khuller, Uzi Vishkin, Neal E. Young: A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover CoRR cs.DS/0205037: (2002)
	2001
117		Uzi Vishkin: What to Do with All this Hardware? (Invited Lecture). CPM 2001: 50
116		Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin: Evaluating the XMT Parallel Programming Model. HIPS 2001: 95-108
115		Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin: Evaluating the XMT Parallel Programming Model. IPDPS 2001: 105
114		Shay Kutten, David Peleg, Uzi Vishkin: Deterministic resource discovery in distributed networks. SPAA 2001: 77-83
113		Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin: Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. SPAA 2001: 93-102
	2000
112		Graham Cormode, Mike Paterson, Süleyman Cenk Sahinalp, Uzi Vishkin: Communication complexity of document exchange. SODA 2000: 197-206
111		Uzi Vishkin: A no-busy-wait balanced tree parallel algorithmic paradigm. SPAA 2000: 147-155
110		Uzi Vishkin: A PRAM-on-Chip Vision (invited abstract). SPIRE 2000: 260
109		Shlomit Dascal, Uzi Vishkin: Experiments With List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. ACM Journal of Experimental Algorithmics 5: 10 (2000)
	1999
108		Shlomit Dascal, Uzi Vishkin: Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. Algorithm Engineering 1999: 43-59
107		Yishay Mansour, Noam Nisan, Uzi Vishkin: Trade-offs between Communication Throughput and Parallel Time. J. Complexity 15(1): 148-166 (1999)
	1998
106		Uzi Vishkin, Shlomit Dascal, Efraim Berkovich, Joseph Nuzman: Explicit Multi-Threading (XMT) Bridging Models for Instruction Parallelism (Extended Abstract). SPAA 1998: 140-151
	1997
105		Silvia M. Müller, Uzi Vishkin: Conflict-Free Access to Multiple Single-Ported Register Files. IPPS 1997: 672-678
104		Uzi Vishkin: From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum. SPAA 1997: 260-271
	1996
103		Süleyman Cenk Sahinalp, Uzi Vishkin: Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract). FOCS 1996: 320-328
102		Uzi Vishkin: Can Parallel Algorithms Enhance Seriel Implementation? Commun. ACM 39(9): 88-91 (1996)
101		Omer Berkman, Baruch Schieber, Uzi Vishkin: A fast parallel algorithm for finding the convex hull of a sorted point set. Int. J. Comput. Geometry Appl. 6(2): 231-242 (1996)
100		Joseph JáJá, Kwan Woo Ryu, Uzi Vishkin: Sorting Strings and Constructing Digital Search Trees in Parallel. Theor. Comput. Sci. 154(2): 225-245 (1996)
	1995
99		Uzi Vishkin: On a Technique for Parsing a String (Abstract). CPM 1995: 386
98		Rajeev Raman, Uzi Vishkin: Parallel algorithms for database operations and a database operation for parallel algorithms. IPPS 1995: 173-
97		Yossi Matias, Uzi Vishkin: A note on reducing parallel model simulations to integer sorting. IPPS 1995: 208-212
96		Omer Berkman, Uzi Vishkin: Almost Fully-parallel Parentheses Matching. Discrete Applied Mathematics 57(1): 11-28 (1995)
	1994
95		Süleyman Cenk Sahinalp, Uzi Vishkin: On a Parallel-Algorithms Method for String Matching Problems. CIAC 1994: 22-32
94		Joseph JáJá, Kwan Woo Ryu, Uzi Vishkin: Sorting Strings and Constructing Digital Search Trees in Parallel. IPPS 1994: 349-356
93		Uzi Vishkin: Can Parallel Algorithms Enhance Serial Implementation? IPPS 1994: 376-385
92		Michael T. Goodrich, Yossi Matias, Uzi Vishkin: Optimal Parallel Approximation for Prefix Sums and Integer Sorting. SODA 1994: 241-250
91		Rajeev Raman, Uzi Vishkin: Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix. SODA 1994: 613-621
90		Süleyman Cenk Sahinalp, Uzi Vishkin: Symmetry breaking for suffix tree construction. STOC 1994: 300-309
89		Yishay Mansour, Noam Nisan, Uzi Vishkin: Trade-offs between communication throughput and parallel time. STOC 1994: 372-381
88		Gad M. Landau, Uzi Vishkin: Pattern Matching in a Digitized Image. Algorithmica 12(4/5): 375-408 (1994)
87		Richard Cole, Uzi Vishkin: On the Detection of Robust Curves. CVGIP: Graphical Model and Image Processing 56(3): 189-204 (1994)
86		Samir Khuller, Uzi Vishkin: On the Parallel Complexity of Digraph Reachability. Inf. Process. Lett. 52(5): 239-241 (1994)
85		Samir Khuller, Uzi Vishkin: Biconnectivity Approximations and Graph Carvings. J. ACM 41(2): 214-235 (1994)
84		Samir Khuller, Uzi Vishkin, Neal E. Young: A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers. J. Algorithms 17(2): 280-289 (1994)
83		Omer Berkman, Uzi Vishkin: Finding Level-Ancestors in Trees. J. Comput. Syst. Sci. 48(2): 214-230 (1994)
82		Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin: Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima. SIAM J. Comput. 23(3): 449-465 (1994)
	1993
81		Gad M. Landau, Uzi Vishkin: Two Dimensional Pattern Matching in a Digitized Image. CPM 1993: 134-151
80		Samir Khuller, Uzi Vishkin, Neal E. Young: A primal-dual parallel approximation technique applied to weighted set and vertex cover. IPCO 1993: 333-341
79		Michael T. Goodrich, Yossi Matias, Uzi Vishkin: Approximate Parallel Prefix Computation and its Applications. IPPS 1993: 318-325
78		Omer Berkman, Uzi Vishkin: On Parallel Integer Merging Inf. Comput. 106(2): 266-285 (1993)
77		Omer Berkman, Baruch Schieber, Uzi Vishkin: Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. J. Algorithms 14(3): 344-370 (1993)
76		Omer Berkman, Uzi Vishkin: Recursive Star-Tree Parallel Data Structure. SIAM J. Comput. 22(2): 221-242 (1993)
	1992
75		Uzi Vishkin: A Case for the PRAM As a Standard Programmer's Model. Heinz Nixdorf Symposium 1992: 11-19
74		Uzi Vishkin: Methods in Parallel Algorithmics and Who May Need to Know Them? ISAAC 1992: 1-5
73		Omer Berkman, Yossi Matias, Uzi Vishkin: Randomized Range-Maxima inNearly-Constant Parallel Time. ISAAC 1992: 135-144
72		Uzi Vishkin: Methods in Parallel Algorithmics (Abstract). MFCS 1992: 81
71		Gad M. Landau, Uzi Vishkin: Pattern Matching in a Digitized Image. SODA 1992: 453-462
70		Samir Khuller, Uzi Vishkin: Biconnectivity Approximations and Graph Carvings STOC 1992: 759-770
69		Omer Berkman, Yossi Matias, Uzi Vishkin: Randomized Range-Maxima in Nearly-Constant Parallel Time. Computational Complexity 2: 350-373 (1992)
68		Amihood Amir, Gad M. Landau, Uzi Vishkin: Efficient Pattern Matching with Scaling. J. Algorithms 13(1): 2-32 (1992)
67		Uzi Vishkin: A Parallel Blocking Flow Algorithm for Acyclic Networks. J. Algorithms 13(3): 489-501 (1992)
	1991
66		Joseph Gil, Yossi Matias, Uzi Vishkin: Towards a Theory of Nearly Constant Time Parallel Algorithms FOCS 1991: 698-710
65		Uzi Vishkin: Strutural Parallel Algorithmics. ICALP 1991: 363-380
64		Yossi Matias, Uzi Vishkin: Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract) STOC 1991: 307-316
63		Richard Cole, Uzi Vishkin: Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms Inf. Comput. 92(1): 1-47 (1991)
62		Yossi Matias, Uzi Vishkin: On Parallel Hashing and Integer Sorting. J. Algorithms 12(4): 573-606 (1991)
61		Uzi Vishkin: Deterministic Sampling - A New Technique for Fast Pattern Matching. SIAM J. Comput. 20(1): 22-40 (1991)
	1990
60		Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin: Some Triply-Logarithmic Parallel Algorithms (Extended Abstract) FOCS 1990: 871-881
59		Yossi Matias, Uzi Vishkin: On Parallel Hashing and Integer Sorting (Extended Summary). ICALP 1990: 729-743
58		Amihood Amir, Gad M. Landau, Uzi Vishkin: Efficient Pattern Matching with Scaling. SODA 1990: 344-357
57		Uzi Vishkin: Deterministic Sampling-A New Technique for Fast Pattern Matching STOC 1990: 170-180
56		Baruch Schieber, Uzi Vishkin: Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm. Discrete Applied Mathematics 29(1): 97-111 (1990)
	1989
55		Omer Berkman, Uzi Vishkin: Recursive *-Tree Parallel Data-Structure (Extended Abstract) FOCS 1989: 196-202
54		Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin: Highly Parallelizable Problems (Extended Abstract) STOC 1989: 309-319
53		Richard Cole, Uzi Vishkin: Faster Optimal Parallel Prefix Sums and List Ranking Inf. Comput. 81(3): 334-352 (1989)
52		Gad M. Landau, Uzi Vishkin: Fast Parallel and Serial Approximate String Matching. J. Algorithms 10(2): 157-169 (1989)
	1988
51		Baruch Schieber, Uzi Vishkin: On Finding Lowest Common Ancestors: Simplification and Parallelization. AWOC 1988: 111-123
50		Vijaya Ramachandran, Uzi Vishkin: Efficient Parallel Triconnectivity in Logarithmic Time. AWOC 1988: 33-42
49		Richard Cole, Uzi Vishkin: Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking. AWOC 1988: 91-100
48		Richard Cole, Uzi Vishkin: The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time. Algorithmica 3: 329-346 (1988)
47		Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin: Parallel Construction of a Suffix Tree with Applications. Algorithmica 3: 347-365 (1988)
46		Gad M. Landau, Uzi Vishkin, Ruth Nussinov: Locating alignments with k differences for nucleotide and amino acid sequences. Computer Applications in the Biosciences 4(1): 19-24 (1988)
45		Gad M. Landau, Uzi Vishkin: Fast String Matching with k Differences. J. Comput. Syst. Sci. 37(1): 63-78 (1988)
44		Richard Cole, Uzi Vishkin: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. SIAM J. Comput. 17(1): 128-142 (1988)
43		Baruch Schieber, Uzi Vishkin: On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM J. Comput. 17(6): 1253-1262 (1988)
42		Tali Eilam-Tzoreff, Uzi Vishkin: Matching Patterns in Strings Subject to Multi-Linear Transformations. Theor. Comput. Sci. 60: 231-254 (1988)
41		Nimrod Megiddo, Uzi Vishkin: On Finding a Minimum Dominating Set in a Tournament. Theor. Comput. Sci. 61: 307-316 (1988)
	1987
40		Gad M. Landau, Baruch Schieber, Uzi Vishkin: Parallel Construction of a Suffix Tree (Extended Abstract). ICALP 1987: 314-325
39		Uzi Vishkin: Randomized Parallel Speedups for List Ranking. J. Parallel Distrib. Comput. 4(3): 319-333 (1987)
38		Yossi Azar, Uzi Vishkin: Tight Comparison Bounds on the Complexity of Parallel Sorting. SIAM J. Comput. 16(3): 458-464 (1987)
	1986
37		Yael Maon, Baruch Schieber, Uzi Vishkin: Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract). Aegean Workshop on Computing 1986: 34-45
36		Richard Cole, Uzi Vishkin: Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems FOCS 1986: 478-491
35		Noga Alon, Yossi Azar, Uzi Vishkin: Tight Complexity Bounds for Parallel Comparison Sorting FOCS 1986: 502-510
34		Richard Cole, Uzi Vishkin: Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms STOC 1986: 206-219
33		Gad M. Landau, Uzi Vishkin: Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm STOC 1986: 220-230
32		Richard Cole, Uzi Vishkin: Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking Information and Control 70(1): 32-53 (1986)
31		Gad M. Landau, Uzi Vishkin, Ruth Nussinov: An efficient string matching algorithm with k differences for nucleotide and amino acid sequences. Nucleic Acids Research 14(1): 31-46 (1986)
30		Gad M. Landau, Uzi Vishkin: Efficient String Matching with k Mismatches. Theor. Comput. Sci. 43: 239-249 (1986)
29		Yael Maon, Baruch Schieber, Uzi Vishkin: Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs. Theor. Comput. Sci. 47(3): 277-298 (1986)
	1985
28		Gad M. Landau, Uzi Vishkin: Efficient String Matching in the Presence of Errors FOCS 1985: 126-136
27		Uzi Vishkin: Optimal Parallel Pattern Matching in Strings (Extended Summary). ICALP 1985: 497-508
26		Ilan Bar-On, Uzi Vishkin: Optimal Parallel Generation of a Computation Tree Form. ACM Trans. Program. Lang. Syst. 7(2): 348-357 (1985)
25		Uzi Vishkin: On Efficient Parallel Strong Orientation. Inf. Process. Lett. 20(5): 235-240 (1985)
24		Uzi Vishkin: Optimal Parallel Pattern Matching in Strings Information and Control 67(1-3): 91-113 (1985)
23		Uzi Vishkin, Avi Wigderson: Trade-Offs Between Depth and Width in Parallel Computation. SIAM J. Comput. 14(2): 303-314 (1985)
22		Robert Endre Tarjan, Uzi Vishkin: An Efficient Parallel Biconnectivity Algorithm. SIAM J. Comput. 14(4): 862-874 (1985)
	1984
21		Robert Endre Tarjan, Uzi Vishkin: Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) FOCS 1984: 12-20
20		Uzi Vishkin: Randomized Speed-Ups in Parallel Computation STOC 1984: 230-239
19		Kurt Mehlhorn, Uzi Vishkin: Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. Acta Inf. 21: 339-374 (1984)
18		Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin: Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems. J. ACM 31(3): 459-473 (1984)
17		Mikhail J. Atallah, Uzi Vishkin: Finding Euler Tours in Parallel. J. Comput. Syst. Sci. 29(3): 330-337 (1984)
16		Larry J. Stockmeyer, Uzi Vishkin: Simulation of Parallel Random Access Machines by Circuits. SIAM J. Comput. 13(2): 409-422 (1984)
15		Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin: Constant Depth Reducibility. SIAM J. Comput. 13(2): 423-439 (1984)
14		Uzi Vishkin: A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer. Theor. Comput. Sci. 32: 157-172 (1984)
	1983
13		Uzi Vishkin, Avi Wigderson: Trade-Offs between Depth and Width in Parallel Computation (Preliminary Version) FOCS 1983: 146-153
12		Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener: Parallel Dictionaries in 2-3 Trees. ICALP 1983: 597-609
11		Uzi Vishkin: An efficient distributed orientation algorithm. IEEE Transactions on Information Theory 29(4): 624-629 (1983)
10		Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener: Parallel Computation on 2-3-Trees. ITA 17(4): 397-404 (1983)
9		Uzi Vishkin, Avi Wigderson: Dynamic Parallel Memories Information and Control 56(3): 174-182 (1983)
8		Uzi Vishkin: Implementation of Simultaneous Memory Address Access in Models That Forbid It. J. Algorithms 4(1): 45-50 (1983)
	1982
7		Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin: A Complexity Theory for Unbounded Fan-In Parallelism FOCS 1982: 1-13
6		Yossi Shiloach, Uzi Vishkin, Shmuel Zaks: Golden ratios in a pairs covering problem. Discrete Mathematics 41(1): 57-65 (1982)
5		Reuven Bar-Yehuda, Uzi Vishkin: Complexity of Finding k-Path-Free Dominating Sets in Graphs. Inf. Process. Lett. 14(5): 228-232 (1982)
4		Yossi Shiloach, Uzi Vishkin: An O(log n) Parallel Connectivity Algorithm. J. Algorithms 3(1): 57-67 (1982)
3		Yossi Shiloach, Uzi Vishkin: An O(n² log n) Parallel MAX-FLOW Algorithm. J. Algorithms 3(2): 128-146 (1982)
	1981
2		Yossi Shiloach, Uzi Vishkin: Finding the maximum, merging and sorting in a parallel computation model. CONPAR 1981: 314-327
1		Yossi Shiloach, Uzi Vishkin: Finding the Maximum, Merging, and Sorting in a Parallel Computation Model. J. Algorithms 2(1): 88-102 (1981)

Coauthor Index

1	Noga Alon	[35]
2	Amihood Amir	[58] [68]
3	Archana Anibha	[127]
4	Alberto Apostolico	[47]
5	Mikhail J. Atallah	[17]
6	Yossi Azar	[35] [38]
7	Aydin O. Balkan	[123] [128] [131] [135] [137]
8	Ilan Bar-On	[26]
9	Reuven Bar-Yehuda	[5]
10	Rajeev Barua	[142] [144] [146] [150] [151]
11	Victor R. Basili	[133]
12	Omer Berkman	[54] [55] [60] [69] [73] [76] [77] [78] [82] [83] [96] [101]
13	Efraim Berkovich	[106]
14	Dany Breslauer	[54]
15	George C. Caragea (George Constantin Caragea)	[138] [142] [144] [146] [149] [151]
16	Matthew Carlberg	[143] [147]
17	Ashok K. Chandra	[7] [15]
18	Richard Cole	[32] [34] [36] [44] [48] [49] [53] [63] [87]
19	Graham Cormode	[112]
20	William J. Dally	[152]
21	Shlomit Dascal	[106] [108] [109]
22	Jack Dongarra (Jack J. Dongarra)	[152]
23	Thomas M. DuBois	[134]
24	James A. Edwards	[154]
25	Tali Eilam-Tzoreff	[42]
26	David J. Ellison	[141]
27	Martti Forsell	[140]
28	Zvi Galil	[54]
29	Phillip B. Gibbons	[129]
30	Joseph Gil (Yossi Gil)	[66]
31	John Gilbert	[133]
32	Michael T. Goodrich	[79] [92]
33	Pei Gu	[125]
34	Yuri Gurevich	[18]
35	Lorin Hochstein	[133]
36	Peter Hofstee	[140]
37	Michael N. Horak	[131] [143] [147]
38	Costas S. Iliopoulos	[47]
39	Joseph JáJá	[60] [82] [94] [100]
40	Ahmed Jerraya	[140]
41	Chris R. Jesshope	[140]
42	Fuat Keceli	[144] [145] [146] [151] [153]
43	Samir Khuller	[70] [80] [84] [85] [86] [118]
44	Sridhar Krishnamurthy	[60] [82]
45	Shay Kutten	[114] [121]
46	Gad M. Landau	[28] [30] [31] [33] [40] [45] [46] [47] [52] [58] [68] [71] [81] [88]
47	Bryant Lee	[134]
48	Fang Liu	[124] [126]
49	Jaime Llorca	[127]
50	Yishay Mansour	[89] [107]
51	Yael Maon	[29] [37]
52	Yossi Matias	[59] [62] [64] [66] [69] [73] [79] [92] [97]
53	Satoshi Matsuoka	[152]
54	Nimrod Megiddo	[41]
55	Kurt Mehlhorn	[19]
56	Stuart D. Milner	[124] [126] [127]
57	Tali Moreshet	[145] [153]
58	Silvia M. Müller (Silvia Melitta Müller)	[105]
59	Dorit Naishlos	[113] [115] [116] [120]
60	Noam Nisan	[89] [107]
61	Steven M. Nowick	[143] [147]
62	Ruth Nussinov	[31] [46]
63	Joseph Nuzman	[106] [113] [115] [116] [120]
64	Marc Olano	[134]
65	Mike Paterson	[112]
66	Wolfgang J. Paul	[10] [12]
67	David Peleg	[114] [121]
68	Gang Qu	[123] [128] [131] [135] [137]
69	Vijaya Ramachandran	[50]
70	Rajeev Raman	[91] [98]
71	Yves Robert	[152]
72	Kwan Woo Ryu	[94] [100]
73	Süleyman Cenk Sahinalp	[90] [95] [103] [112]
74	A. Beliz Saybasili	[138]
75	Baruch Schieber	[29] [37] [40] [43] [47] [51] [54] [56] [77] [101]
76	Robert Schreiber	[152]
77	Yossi Shiloach	[1] [2] [3] [4] [6]
78	Horst D. Simon	[152]
79	Larry J. Stockmeyer	[7] [15] [16] [18]
80	Robert Endre Tarjan	[21] [22]
81	Ramakrishna Thurimella (Ramki Thurimella)	[60] [82]
82	Shane Torbert	[141]
83	Jesper Larsson Träff	[140]
84	Chau-Wen Tseng	[113] [115] [116] [120]
85	Alexandros Tzannes	[142] [144] [146] [150] [151]
86	Ron Tzur	[141]
87	Hubert Wagener	[10] [12]
88	Yi Wang	[134]
89	Xingzhi Wen	[130] [136] [138]
90	Avi Wigderson	[9] [13] [23]
91	Neal E. Young	[80] [84] [118]
92	Shmuel Zaks	[6]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page