Eli Upfal

	2012
150		John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal: Towards robust and efficient computation in dynamic peer-to-peer networks. SODA 2012: 551-569
	2011
149		Mert Akdere, Ugur Çetintemel, Matteo Riondato, Eli Upfal, Stanley B. Zdonik: The Case for Predictive Database Systems: Opportunities and Challenges. CIDR 2011: 167-174
148		Matteo Riondato, Mert Akdere, Ugur Çetintemel, Stanley B. Zdonik, Eli Upfal: The VC-Dimension of SQL Queries and Selectivity Estimation through Sampling. ECML/PKDD (2) 2011: 661-676
147		Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal: Tight bounds on information dissemination in sparse mobile networks. PODC 2011: 355-362
146		Fabio Vandin, Eli Upfal, Benjamin J. Raphael: De Novo Discovery of Mutated Driver Pathways in Cancer. RECOMB 2011: 499-500
145		Jennie Duggan, Ugur Çetintemel, Olga Papaemmanouil, Eli Upfal: Performance prediction for concurrent database workloads. SIGMOD Conference 2011: 337-348
144		Fabio Vandin, Eli Upfal, Benjamin J. Raphael: Finding Driver Pathways in Cancer: Models and Algorithms. WABI 2011: 314-325
143		Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal: Tight Bounds on Information Dissemination in Sparse Mobile Networks CoRR abs/1101.4609: (2011)
142		Matteo Riondato, Mert Akdere, Ugur Çetintemel, Stanley B. Zdonik, Eli Upfal: The VC-Dimension of Queries and Selectivity Estimation Through Sampling CoRR abs/1101.5805: (2011)
141		John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal: Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks CoRR abs/1108.0809: (2011)
140		Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal: Space-Round Tradeoffs for MapReduce Computations CoRR abs/1111.2228: (2011)
139		Matteo Riondato, Eli Upfal: Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees CoRR abs/1111.6937: (2011)
138		Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal: Sorting and selection on dynamic data. Theor. Comput. Sci. 412(24): 2564-2576 (2011)
	2010
137		Fabio Vandin, Eli Upfal, Benjamin J. Raphael: Algorithms for Detecting Significantly Mutated Pathways in Cancer. RECOMB 2010: 506-521
136		Pascal Van Hentenryck, Russell Bent, Eli Upfal: Online stochastic optimization under time constraints. Annals OR 177(1): 151-183 (2010)
135		Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin: MADMX: A Novel Strategy for Maximal Dense Motif Extraction CoRR abs/1002.0874: (2010)
134		Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin: An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets CoRR abs/1002.1104: (2010)
133		Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin: Mining Top-K Frequent Itemsets Through Progressive Sampling CoRR abs/1006.5235: (2010)
132		Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal: Infectious Random Walks CoRR abs/1007.1604: (2010)
131		Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin: Mining top-K frequent itemsets through progressive sampling. Data Min. Knowl. Discov. 21(2): 310-326 (2010)
130		Mert Akdere, Ugur Çetintemel, Eli Upfal: Database-support for Continuous Prediction Queries over Streaming Data. PVLDB 3(1): 1291-1301 (2010)
	2009
129		Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal: Sort Me If You Can: How to Sort Dynamic Data. ICALP (2) 2009: 339-350
128		Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin: An efficient rigorous approach for identifying statistically significant frequent itemsets. PODS 2009: 117-126
127		Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin: MADMX: A Novel Strategy for Maximal Dense Motif Extraction. WABI 2009: 362-374
126		Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii: The Hiring Problem and Lake Wobegon Strategies. SIAM J. Comput. 39(4): 1233-1255 (2009)
	2008
125		Aleksandrs Slivkins, Eli Upfal: Adapting to a Changing Environment: the Brownian Restless Bandits. COLT 2008: 343-354
124		Deepayan Chakrabarti, Ravi Kumar, Filip Radlinski, Eli Upfal: Mortal Multi-Armed Bandits. NIPS 2008: 273-280
123		Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii: The hiring problem and Lake Wobegon strategies. SODA 2008: 1184-1193
122		Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal: Multi-armed bandits in metric spaces. STOC 2008: 681-690
121		Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal: Multi-Armed Bandits in Metric Spaces CoRR abs/0809.4882: (2008)
120		Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal: Commitment under uncertainty: Two-stage stochastic matching problems. Theor. Comput. Sci. 408(2-3): 213-223 (2008)
	2007
119		Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking: Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
118		Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck: Propagating Knapsack Constraints in Sublinear Time. AAAI 2007: 231-236
117		Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal: Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. ICALP 2007: 171-182
116		Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal: Finding near neighbors through cluster pruning. PODS 2007: 103-112
115		Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking: 07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. Probabilistic Methods in the Design and Analysis of Algorithms 2007
114		Gopal Pandurangan, Eli Upfal: Entropy-based bounds for online algorithms. ACM Transactions on Algorithms 3(1): (2007)
	2006
113		Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal: Using PageRank to Characterize Web Structure. Internet Mathematics 3(1): (2006)
	2005
112		Michael Mitzenmacher, Eli Upfal: Probability and computing - randomized algorithms and probabilistic analysis. Cambridge University Press 2005: I-XVI, 1-352
111		Will Sheffler, Eli Upfal, John Sedivy, William Stafford Noble: A Learned Comparative Expression Measure for Affymetrix GeneChip DNA Microarrays. CSB 2005: 144-154
110		Aris Anagnostopoulos, Ioannis Kontoyiannis, Eli Upfal: Steady state analysis of balanced-allocation routing. Random Struct. Algorithms 26(4): 446-467 (2005)
109		Aris Anagnostopoulos, Adam Kirsch, Eli Upfal: Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input. SIAM J. Comput. 34(3): 616-639 (2005)
	2004
108		Aris Anagnostopoulos, Russell Bent, Eli Upfal, Pascal Van Hentenryck: A simple and deterministic competitive algorithm for online facility location. Inf. Comput. 194(2): 175-202 (2004)
107		Abraham Flaxman, Alan M. Frieze, Eli Upfal: Efficient communication in an ad-hoc network. J. Algorithms 52(1): 1-7 (2004)
	2003
106		Eli Upfal: Performance Analysis of Dynamic Network Processes. FOCS 2003: 18
105		Aris Anagnostopoulos, Adam Kirsch, Eli Upfal: Stability and Efficiency of a Random Local Load Balancing Protocol. FOCS 2003: 472-481
	2002
104		Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal: Using PageRank to Characterize Web Structure. COCOON 2002: 330-339
	2001
103		Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal: Building Low-Diameter P2P Networks. FOCS 2001: 492-499
102		Gopal Pandurangan, Eli Upfal: Can entropy characterize performance of online algorithms?. SODA 2001: 727-734
101		Milos Hauskrecht, Eli Upfal: A Clustering Approach to Solving Large Stochastic Matching Problems. UAI 2001: 219-226
100		Milos Hauskrecht, Luis E. Ortiz, Ioannis Tsochantaridis, Eli Upfal: Efficient Methods for Computing Investment Strategies for Multi-Market Commodity Trading. Applied Artificial Intelligence 15(5): 429-452 (2001)
99		Andrei Z. Broder, Alan M. Frieze, Eli Upfal: A general approach to dynamic packet routing with bounded buffers. J. ACM 48(2): 324-349 (2001)
	2000
98		Milos Hauskrecht, Luis E. Ortiz, Ioannis Tsochantaridis, Eli Upfal: Computing Global Strategies for Multi-Market Commodity Trading. AIPS 2000: 159-166
97		Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal: Random graph models for the web graph. FOCS 2000: 57-65
96		Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal: The Web as a Graph. PODS 2000: 1-10
95		Franco P. Preparata, Eli Upfal: Sequencing-by-hybridization at the information-theory bound: an optimal algorithm. RECOMB 2000: 245-253
94		Franco P. Preparata, Eli Upfal: Sequencing-by-Hybridization at the Information-Theory Bound: An Optimal Algorithm. Journal of Computational Biology 7(3-4): 621-630 (2000)
93		Gopal Pandurangan, Eli Upfal: Static and Dynamic Evaluation of QoS Properties. Journal of Interconnection Networks 1(2): 135-150 (2000)
	1999
92		Malwina J. Luczak, Eli Upfal: Reducing Network Congestion and Blocking Probability Through Balanced Allocation. FOCS 1999: 587-595
91		Milos Hauskrecht, Gopal Pandurangan, Eli Upfal: Computing Near Optimal Strategies for Stochastic Investment Planning Problems. IJCAI 1999: 1310-1315
90		Franco P. Preparata, Alan M. Frieze, Eli Upfal: On the power of universal bases in sequencing by hybridization. RECOMB 1999: 295-301
89		Gopal Pandurangan, Eli Upfal: Static and Dynamic Evaluation of QoS Properties. STOC 1999: 566-573
88		A. L. Narasimha Reddy, Eli Upfal: Real-Time Communication Scheduling in a Multicomputer Video Server. J. Parallel Distrib. Comput. 58(3): 425-445 (1999)
87		Alan M. Frieze, Franco P. Preparata, Eli Upfal: Optimal Reconstruction of a Sequence from its Probes. Journal of Computational Biology 6(3/4): (1999)
86		Andrei Z. Broder, Alan M. Frieze, Eli Upfal: Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. Random Struct. Algorithms 14(1): 87-109 (1999)
85		Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal: Balanced Allocations. SIAM J. Comput. 29(1): 180-200 (1999)
	1998
84		Eli Upfal: Design and Analysis of Dynamic Processes: A Stocastic Approach. ESA 1998: 26-34
83		Andrei Z. Broder, Alan M. Frieze, Eli Upfal: Dynamic Packet Routing on Arrays with Bounded Buffers. LATIN 1998: 273-281
82		Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal: On Balls and Bins with Deletions. RANDOM 1998: 145-158
81		Wayne Niblack, Xiaoming Zhu, James L. Hafner, Thomas M. Breuel, Dulce B. Ponceleon, Dragutin Petkovic, Myron Flickner, Eli Upfal, Sigfredo I. Nin, Sanghoon Sull, Byron Dom, Boon-Lock Yeo, Savitha Srinivasan, Dan Zivkovic, Mike Penner: Updates to the QBIC System. Storage and Retrieval for Image and Video Databases (SPIE) 1998: 150-161
80		Andrzej Pelc, Eli Upfal: Reliable Fault Diagnosis with Few Tests. Combinatorics, Probability & Computing 7(3): 323-333 (1998)
79		Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal: Optimal Construction of Edge-Disjoint Paths in Random Graphs. SIAM J. Comput. 28(2): 541-573 (1998)
78		Prabhakar Raghavan, Eli Upfal: Stochastic Contention Resolution With Short Delays. SIAM J. Comput. 28(2): 709-719 (1998)
77		Nir Shavit, Eli Upfal, Asaph Zemach: A Steady State Analysis of Diffracting Trees. Theory Comput. Syst. 31(4): 403-423 (1998)
	1997
76		Eli Upfal: Stochastic Analysis of Dynamic Processes. FCT 1997: 85-92
75		Nir Shavit, Eli Upfal, Asaph Zemach: A Wait-Free Sorting Algorithm. PODC 1997: 121-128
74		Andrei Z. Broder, Alan M. Frieze, Eli Upfal: Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). STOC 1997: 531-539
73		Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Eli Upfal, Derrick Weathersby: Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems. IEEE Trans. Parallel Distrib. Syst. 8(11): 1143-1156 (1997)
72		Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal: How much can hardware help routing? J. ACM 44(5): 726-741 (1997)
	1996
71		Andrei Z. Broder, Alan M. Frieze, Eli Upfal: A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). FOCS 1996: 390-399
70		Sonne Preminger, Eli Upfal: Efficient Traffic Laws for Mobile Robots - Work in Progress (Avstract). PODC 1996: 155
69		Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal: An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. SODA 1996: 261-268
68		Nir Shavit, Eli Upfal, Asaph Zemach: A Steady State Analysis of Diffracting Trees (Extended Abstract). SPAA 1996: 33-41
67		Andrei Z. Broder, Eli Upfal: Dynamic Deflection Routing on Arrays (Preliminary Version). STOC 1996: 348-355
66		Sonne Preminger, Eli Upfal: Safe and Efficient Traffic Laws for Mobile Robots. SWAT 1996: 357-367
65		Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal: A Theory of Wormhole Routing in Parallel Computers. IEEE Trans. Computers 45(6): 704-713 (1996)
64		Eli Upfal, Sergio A. Felperin, Marc Snir: Randomized Routing with Shorter Paths. IEEE Trans. Parallel Distrib. Syst. 7(4): 356-362 (1996)
	1995
63		Prabhakar Raghavan, Eli Upfal: Stochastic contention resolution with short delays. STOC 1995: 229-237
62		Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal: The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. Inf. Process. Lett. 56(2): 79-81 (1995)
	1994
61		Eli Upfal: On the Theory of Interconnection Networks for Parallel Computers. ICALP 1994: 473-486
60		Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal: Optimal Construction of Edge-Disjoint Paths in Random Graphs. SODA 1994: 603-612
59		Prabhakar Raghavan, Eli Upfal: Efficient routing in all-optical networks. STOC 1994: 134-143
58		Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal: Balanced allocations (extended abstract). STOC 1994: 593-602
57		Eli Upfal: Tolerating a Linear Number of Faults in Networks of Bounded Degree Inf. Comput. 115(2): 312-320 (1994)
56		Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal: Near-perfect Token Distribution. Random Struct. Algorithms 5(4): 559-572 (1994)
55		Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal: Trading Space for Time in Undirected s-t Connectivity. SIAM J. Comput. 23(2): 324-334 (1994)
54		Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal: Computing with Noisy Information. SIAM J. Comput. 23(5): 1001-1018 (1994)
53		Andrei Z. Broder, Alan M. Frieze, Eli Upfal: Existence and Construction of Edge-Disjoint Paths on Expander Graphs. SIAM J. Comput. 23(5): 976-989 (1994)
	1993
52		Andrei Z. Broder, Alan M. Frieze, Eli Upfal: On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. SODA 1993: 322-330
51		Eli Upfal, Sergio Feleprin, Marc Snir: Randomized routing with shorter paths. SPAA 1993: 273-282
50		Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal: How much can hardware help routing? STOC 1993: 573-582
	1992
49		Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal: A Theory of Wormhole Routing in Parallel Computers (Extended Abstract) FOCS 1992: 563-572
48		Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal: An Experimental Study of Wormhole Routing in Parallel Computers. Heinz Nixdorf Symposium 1992: 156-165
47		Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal: Near-perfect Token Distribution. ICALP 1992: 308-317
46		Eli Upfal: Tolerating Linear Number of Faults in Networks of Bounded Degree. PODC 1992: 83-89
45		Andrei Z. Broder, Alan M. Frieze, Eli Upfal: Existence and Construction of Edge Disjoint Paths on Expander Graphs STOC 1992: 140-149
44		Eli Upfal: An O(log(N)) Deterministic Packet-Routing Scheme. J. ACM 39(1): 55-70 (1992)
	1991
43		Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal: On the Parallel Complexity of Evaluating Game Trees. SODA 1991: 404-413
42		Larry Rudolph, Miriam Slivkin-Allalouf, Eli Upfal: A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. SPAA 1991: 237-245
41		Shay Assaf, Eli Upfal: Fault Tolerant Sorting Networks. SIAM J. Discrete Math. 4(4): 472-480 (1991)
	1990
40		Shay Assaf, Eli Upfal: Fault Tolerant Sorting Network FOCS 1990: 275-284
39		Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal: Randomized Broadcast in Networks. SIGAL International Symposium on Algorithms 1990: 128-137
38		Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal: Computing with Unreliable Information (Preliminary Version) STOC 1990: 128-137
37		Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal: Randomized Broadcast in Networks. Random Struct. Algorithms 1(4): 447-460 (1990)
36		David Peleg, Eli Upfal: A Time-Randomness Trade-Off for Oblivious Routing. SIAM J. Comput. 19(2): 256-266 (1990)
	1989
35		Eli Upfal: An O(log N) Deterministic Packet Routing Scheme (Preliminary Version) STOC 1989: 241-250
34		Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal: Trading Space for Time in Undirected s-t Connectivity STOC 1989: 543-549
33		David Peleg, Eli Upfal: Constructng disjoint paths on expander graphs. Combinatorica 9(3): 289-313 (1989)
32		David Peleg, Eli Upfal: A trade-off between space and efficiency for routing tables. J. ACM 36(3): 510-530 (1989)
31		David Peleg, Eli Upfal: The Token Distribution Problem. SIAM J. Comput. 18(2): 229-243 (1989)
	1988
30		David Peleg, Eli Upfal: A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract) STOC 1988: 43-52
29		Danny Krizanc, David Peleg, Eli Upfal: A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract) STOC 1988: 93-102
28		Anna R. Karlin, Eli Upfal: Parallel hashing: an efficient implementation of shared memory. J. ACM 35(4): 876-892 (1988)
27		Richard M. Karp, Eli Upfal, Avi Wigderson: The Complexity of Parallel Search. J. Comput. Syst. Sci. 36(2): 225-253 (1988)
26		Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal: Fault Tolerance in Networks of Bounded Degree. SIAM J. Comput. 17(5): 975-988 (1988)
25		Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson: A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. Theor. Comput. Sci. 58: 57-68 (1988)
	1987
24		David Peleg, Eli Upfal: Constructing Disjoint Paths on Expander Graphs (Extended Abstract) STOC 1987: 264-273
23		Eli Upfal, Avi Wigderson: How to share memory in a distributed system. J. ACM 34(1): 116-127 (1987)
22		Eli Shamir, Eli Upfal: A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems. J. Parallel Distrib. Comput. 4(5): 521-530 (1987)
21		Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson: A Time-Space Tradeoff for Element Distinctness. SIAM J. Comput. 16(1): 97-99 (1987)
20		David Peleg, Eli Upfal: The Generalized Packet Routing Problem. Theor. Comput. Sci. 53: 281-293 (1987)
	1986
19		David Peleg, Eli Upfal: The Token Distribution Problem (Preliminary Version) FOCS 1986: 418-427
18		Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson: A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. ICALP 1986: 50-59
17		Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson: A Time-Space Tradeoff for Element Distinctness. STACS 1986: 353-358
16		Anna R. Karlin, Eli Upfal: Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version) STOC 1986: 160-168
15		Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal: Fault Tolerance in Networks of Bounded Degree (Preliminary Version) STOC 1986: 370-379
14		Richard M. Karp, Eli Upfal, Avi Wigderson: Constructing a perfect matching is in random NC. Combinatorica 6(1): 35-48 (1986)
13		Danny Dolev, Eli Upfal, Manfred K. Warmuth: The Parallel Complexity of Scheduling with Precedence Constraints. J. Parallel Distrib. Comput. 3(4): 553-576 (1986)
	1985
12		Richard M. Karp, Eli Upfal, Avi Wigderson: The Complexity of Parallel Computation on Matroids FOCS 1985: 541-550
11		Richard M. Karp, Eli Upfal, Avi Wigderson: Constructing a Perfect Matching is in Random NC STOC 1985: 22-32
10		Richard M. Karp, Eli Upfal, Avi Wigderson: Are Search and Decision Problems Computationally Equivalent? STOC 1985: 464-475
	1984
9		Eli Upfal, Avi Wigderson: How to Share Memory in a Distributed System (A Preliminary Version) FOCS 1984: 171-180
8		Eli Upfal: A Probabilistic Relation between Desirable and Feasible Models of Parallel Computation (A Preliminary Version) STOC 1984: 258-265
7		Eli Upfal: Efficient Schemes for Parallel Communication. J. ACM 31(3): 507-517 (1984)
6		Eli Shamir, Eli Upfal: Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces. J. Algorithms 5(4): 488-501 (1984)
	1983
5		Eli Shamir, Eli Upfal: A Fast Construction oF Disjoint Paths in Communication Networks. FCT 1983: 428-438
	1982
4		Eli Shamir, Eli Upfal: N-Processors Graph Distributively Achieve Perfect Matchings in O(log²N) Beats. PODC 1982: 238-241
3		Eli Upfal: Efficient Schemes for Parallel Communication. PODC 1982: 55-59
2		Eli Shamir, Eli Upfal: One-factor in random graphs based on vertex choice. Discrete Mathematics 41(3): 281-286 (1982)
1		Eli Upfal: Formal Correctness Proofs of a Nondeterministic Program. Inf. Process. Lett. 14(2): 86-92 (1982)

Coauthor Index

1	Mert Akdere	[130] [142] [148] [149]
2	Miriam Allalouf (Miriam Slivkin-Allalouf)	[42]
3	Aris Anagnostopoulos	[105] [108] [109] [110] [129] [138]
4	Shay Assaf	[40] [41]
5	John Augustine	[141] [150]
6	Yossi Azar	[58] [85]
7	Russell Bent	[108] [136]
8	Allan Borodin	[17] [18] [21] [25] [50] [72]
9	Thomas M. Breuel	[81]
10	Andrei Z. Broder	[34] [43] [45] [47] [52] [53] [55] [56] [58] [60] [62] [67] [69] [71] [74] [79] [83] [85] [86] [99] [123] [126]
11	Jehoshua Bruck	[73]
12	Ugur Çetintemel	[130] [142] [145] [148] [149]
13	Deepayan Chakrabarti	[124]
14	Flavio Chierichetti	[116]
15	Richard Cole	[82]
16	Martin Dietzfelbinger	[115] [119]
17	Danny Dolev	[13]
18	Byron Dom	[81]
19	Jennie Duggan (Jennie Rogers)	[145]
20	Cynthia Dwork	[15] [26]
21	Martin E. Dyer	[62]
22	Faith Ellen (Faith Ellen Fich, Faith E. Fich)	[17] [18] [21] [25]
23	Uriel Feige	[37] [38] [39] [54]
24	Sergio Feleprin	[51]
25	Sergio A. Felperin	[48] [49] [64] [65]
26	Abraham D. Flaxman (Abraham Flaxman)	[107]
27	Myron Flickner	[81]
28	Alan M. Frieze	[45] [47] [52] [53] [56] [60] [62] [69] [71] [74] [79] [82] [83] [86] [87] [90] [99] [107]
29	Roberto Grossi	[127] [135]
30	James Lee Hafner (James L. Hafner)	[81]
31	Milos Hauskrecht	[91] [98] [100] [101]
32	Friedhelm Meyer auf der Heide	[17] [18] [21] [25]
33	Pascal Van Hentenryck	[108] [118] [136]
34	C. T. Howard Ho (Howard Ho, Ching-Tien Ho)	[73]
35	Anna R. Karlin	[16] [28] [34] [43] [55] [58] [85]
36	Richard M. Karp	[10] [11] [12] [14] [27]
37	Irit Katriel	[117] [118] [120]
38	Shlomo Kipnis	[73]
39	Adam Kirsch	[105] [109] [123] [126] [128] [134]
40	Robert D. Kleinberg (Robert Kleinberg)	[121] [122]
41	Ioannis Kontoyiannis	[110]
42	Danny Krizanc	[29]
43	Ravi Kumar (S. Ravi Kumar)	[96] [97] [123] [124] [126] [129] [138]
44	Malwina J. Luczak	[92]
45	Bruce M. Maggs	[82]
46	Mohammad Mahdian	[129] [138]
47	Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu)	[117] [120]
48	Michael Mitzenmacher	[82] [112] [123] [126] [128] [134]
49	Wayne Niblack	[81]
50	Sigfredo I. Nin	[81]
51	William Stafford Noble	[111]
52	Luis E. Ortiz	[98] [100]
53	Alessandro Panconesi	[116]
54	Gopal Pandurangan	[89] [91] [93] [102] [103] [104] [113] [114] [141] [150]
55	Olga Papaemmanouil	[145]
56	Andrzej Pelc	[80]
57	David Peleg	[15] [19] [20] [24] [26] [29] [30] [31] [32] [33] [36] [37] [38] [39] [54]
58	Mike Penner	[81]
59	Dragutin Petkovic	[81]
60	Alberto Pettarin	[132] [143] [147]
61	Andrea Pietracaprina	[127] [128] [131] [132] [133] [134] [135] [140] [143] [147]
62	Nicholas Pippenger	[15] [26]
63	Nadia Pisanti	[127] [135]
64	Dulce B. Ponceleon	[81]
65	Sonne Preminger	[66] [70]
66	Franco P. Preparata	[87] [90] [94] [95]
67	Geppino Pucci	[127] [128] [132] [134] [135] [140] [143] [147]
68	Filip Radlinski	[124]
69	Prabhakar Raghavan	[34] [37] [38] [39] [43] [48] [49] [50] [54] [55] [59] [62] [63] [65] [72] [78] [96] [97] [103] [104] [113] [116]
70	Sridhar Rajagopalan	[96] [97]
71	Benjamin J. Raphael	[137] [144] [146]
72	A. L. Narasimha Reddy	[88]
73	Andréa W. Richa	[82]
74	Matteo Riondato	[131] [133] [139] [140] [142] [148] [149]
75	Peter Robinson	[141] [150]
76	Larry Rudolph	[42]
77	Baruch Schieber	[50] [72]
78	John Sedivy	[111]
79	Meinolf Sellmann	[118]
80	Eli Shamir	[2] [4] [5] [6] [22] [47] [56]
81	Nir Shavit	[68] [75] [77]
82	Will Sheffler	[111]
83	Francesco Silvestri	[140]
84	Ramesh K. Sitaraman	[82]
85	D. Sivakumar	[96] [97]
86	Aleksandrs Slivkins	[121] [122] [125]
87	Marc Snir	[51] [64]
88	Mauro Sozio	[116]
89	Savitha Srinivasan	[81]
90	Stephen Suen	[60] [69] [79]
91	Sanghoon Sull	[81]
92	Shang-Hua Teng	[115] [119]
93	Alessandro Tiberi	[116]
94	Andrew Tomkins	[96] [97]
95	Ioannis Tsochantaridis	[98] [100]
96	Fabio Vandin	[127] [128] [131] [133] [134] [135] [137] [144] [146]
97	Sergei Vassilvitskii	[123] [126]
98	Berthold Vöcking	[115] [119]
99	Manfred K. Warmuth	[13]
100	Derrick Weathersby	[73]
101	Avi Wigderson	[9] [10] [11] [12] [14] [17] [18] [21] [23] [25] [27]
102	Boon-Lock Yeo	[81]
103	Stanley B. Zdonik	[142] [148] [149]
104	Asaph Zemach	[68] [75] [77]
105	Xiaoming Zhu	[81]
106	Dan Zivkovic	[81]

Colors in the list of coauthors

Last update Tue Feb 14 23:09:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page