Eli Upfal

Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal: Fast Distributed PageRank Computation. ICDCN 2013: 11-26

Fabio Vandin, Alexandra Papoutsaki, Benjamin J. Raphael, Eli Upfal: Genome-Wide Survival Analysis of Somatic Mutations in Cancer. RECOMB 2013: 285-286

Hubertus Franke, Alexander Heinecke, Krishna V. Palem, Eli Upfal (Eds.): Computing Frontiers Conference, CF'13, Ischia, Italy, May 14 - 16, 2013. ACM 2013, isbn 978-1-4503-2053-5

Milos Hauskrecht, Eli Upfal: A Clustering Approach to Solving Large Stochastic Matching Problems. CoRR abs/1301.2277 (2013)

Fabio Vandin, Eli Upfal, Benjamin J. Raphael: Finding Driver Pathways in Cancer: Models and Algorithms. Algorithms for Molecular Biology 7: 23 (2012)

Fabio Vandin, Eli Upfal, Benjamin J. Raphael: Algorithms and Genome Sequencing: Identifying Driver Pathways in Cancer. IEEE Computer 45(3): 39-46 (2012)

Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin: An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. J. ACM 59(3): 12 (2012)

Matteo Riondato, Justin A. DeBrabant, Rodrigo Fonseca, Eli Upfal: PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce. CIKM 2012: 85-94

Fabio Vandin, Eli Upfal, Benjamin J. Raphael: Workshop: Algorithms for discovery of mutated pathways in cancer. ICCABS 2012: 1

Mert Akdere, Ugur Çetintemel, Matteo Riondato, Eli Upfal, Stanley B. Zdonik: Learning-based Query Performance Modeling and Prediction. ICDE 2012: 390-401

Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal: Space-round tradeoffs for MapReduce computations. ICS 2012: 235-244

Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal, Fabio Vandin: Algorithms on evolving graphs. ITCS 2012: 149-160

Bahman Bahmani, Ravi Kumar, Mohammad Mahdian, Eli Upfal: PageRank on an evolving graph. KDD 2012: 24-32

Matteo Riondato, Eli Upfal: Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees. ECML/PKDD (1) 2012: 25-41

John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal: Towards robust and efficient computation in dynamic peer-to-peer networks. SODA 2012: 551-569

Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal: Fast Distributed PageRank Computation. CoRR abs/1208.3071 (2012)

Fabio Vandin, Eli Upfal, Benjamin J. Raphael: Algorithms for Detecting Significantly Mutated Pathways in Cancer. Journal of Computational Biology 18(3): 507-522 (2011)

Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin: MADMX: A Strategy for Maximal Dense Motif Extraction. Journal of Computational Biology 18(4): 535-545 (2011)

Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal: Sorting and selection on dynamic data. Theor. Comput. Sci. 412(24): 2564-2576 (2011)

Mert Akdere, Ugur Çetintemel, Matteo Riondato, Eli Upfal, Stanley B. Zdonik: The Case for Predictive Database Systems: Opportunities and Challenges. CIDR 2011: 167-174

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

Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal: Tight bounds on information dissemination in sparse mobile networks. PODC 2011: 355-362

Fabio Vandin, Eli Upfal, Benjamin J. Raphael: De Novo Discovery of Mutated Driver Pathways in Cancer. RECOMB 2011: 499-500

Jennie Duggan, Ugur Çetintemel, Olga Papaemmanouil, Eli Upfal: Performance prediction for concurrent database workloads. SIGMOD Conference 2011: 337-348

Fabio Vandin, Eli Upfal, Benjamin J. Raphael: Finding Driver Pathways in Cancer: Models and Algorithms. WABI 2011: 314-325

Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal: Tight Bounds on Information Dissemination in Sparse Mobile Networks. CoRR abs/1101.4609 (2011)

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)

John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal: Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks. CoRR abs/1108.0809 (2011)

Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal: Space-Round Tradeoffs for MapReduce Computations. CoRR abs/1111.2228 (2011)

Matteo Riondato, Eli Upfal: Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees. CoRR abs/1111.6937 (2011)

Pascal Van Hentenryck, Russell Bent, Eli Upfal: Online stochastic optimization under time constraints. Annals OR 177(1): 151-183 (2010)

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)

Mert Akdere, Ugur Çetintemel, Eli Upfal: Database-support for Continuous Prediction Queries over Streaming Data. PVLDB 3(1): 1291-1301 (2010)

Fabio Vandin, Eli Upfal, Benjamin J. Raphael: Algorithms for Detecting Significantly Mutated Pathways in Cancer. RECOMB 2010: 506-521

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)

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)

Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin: Mining Top-K Frequent Itemsets Through Progressive Sampling. CoRR abs/1006.5235 (2010)

Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal: Infectious Random Walks. CoRR abs/1007.1604 (2010)

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)

Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal: Sort Me If You Can: How to Sort Dynamic Data. ICALP (2) 2009: 339-350

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

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

Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal: Commitment under uncertainty: Two-stage stochastic matching problems. Theor. Comput. Sci. 408(2-3): 213-223 (2008)

Aleksandrs Slivkins, Eli Upfal: Adapting to a Changing Environment: the Brownian Restless Bandits. COLT 2008: 343-354

Deepayan Chakrabarti, Ravi Kumar, Filip Radlinski, Eli Upfal: Mortal Multi-Armed Bandits. NIPS 2008: 273-280

Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii: The hiring problem and Lake Wobegon strategies. SODA 2008: 1184-1193

Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal: Multi-armed bandits in metric spaces. STOC 2008: 681-690

Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal: Multi-Armed Bandits in Metric Spaces. CoRR abs/0809.4882 (2008)

Gopal Pandurangan, Eli Upfal: Entropy-based bounds for online algorithms. ACM Transactions on Algorithms 3(1) (2007)

Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck: Propagating Knapsack Constraints in Sublinear Time. AAAI 2007: 231-236

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

Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal: Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. ICALP 2007: 171-182

Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal: Finding near neighbors through cluster pruning. PODS 2007: 103-112

Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking (Eds.): Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007. Dagstuhl Seminar Proceedings 07391, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007

Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal: Using PageRank to Characterize Web Structure. Internet Mathematics 3(1): 1-20 (2006)

Michael Mitzenmacher, Eli Upfal: Probability and computing - randomized algorithms and probabilistic analysis. Cambridge University Press 2005, isbn 978-0-521-83540-4, pp. I-XVI, 1-352

Aris Anagnostopoulos, Ioannis Kontoyiannis, Eli Upfal: Steady state analysis of balanced-allocation routing. Random Struct. Algorithms 26(4): 446-467 (2005)

Aris Anagnostopoulos, Adam Kirsch, Eli Upfal: Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input. SIAM J. Comput. 34(3): 616-639 (2005)

Will Sheffler, Eli Upfal, John Sedivy, William Stafford Noble: A Learned Comparative Expression Measure for Affymetrix GeneChip DNA Microarrays. CSB 2005: 144-154

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)

Abraham Flaxman, Alan M. Frieze, Eli Upfal: Efficient communication in an ad-hoc network. J. Algorithms 52(1): 1-7 (2004)

Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal: Building low-diameter peer-to-peer networks. IEEE Journal on Selected Areas in Communications 21(6): 995-1002 (2003)

Eli Upfal: Performance Analysis of Dynamic Network Processes. FOCS 2003: 18

Aris Anagnostopoulos, Adam Kirsch, Eli Upfal: Stability and Efficiency of a Random Local Load Balancing Protocol. FOCS 2003: 472-481

Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal: Using PageRank to Characterize Web Structure. COCOON 2002: 330-339

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)

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)

Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal: Building Low-Diameter P2P Networks. FOCS 2001: 492-499

Gopal Pandurangan, Eli Upfal: Can entropy characterize performance of online algorithms?. SODA 2001: 727-734

Milos Hauskrecht, Eli Upfal: A Clustering Approach to Solving Large Stochastic Matching Problems. UAI 2001: 219-226

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)

Gopal Pandurangan, Eli Upfal: Static and Dynamic Evaluation of QoS Properties. Journal of Interconnection Networks 1(2): 135-150 (2000)

Milos Hauskrecht, Luis E. Ortiz, Ioannis Tsochantaridis, Eli Upfal: Computing Global Strategies for Multi-Market Commodity Trading. AIPS 2000: 159-166

Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal: Random graph models for the web graph. FOCS 2000: 57-65

Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal: The Web as a Graph. PODS 2000: 1-10

Franco P. Preparata, Eli Upfal: Sequencing-by-hybridization at the information-theory bound: an optimal algorithm. RECOMB 2000: 245-253

Alan M. Frieze, Franco P. Preparata, Eli Upfal: Optimal Reconstruction of a Sequence from its Probes. Journal of Computational Biology 6(3/4): 361-368 (1999)

A. L. Narasimha Reddy, Eli Upfal: Real-Time Communication Scheduling in a Multicomputer Video Server. J. Parallel Distrib. Comput. 58(3): 425-445 (1999)

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)

Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal: Balanced Allocations. SIAM J. Comput. 29(1): 180-200 (1999)

Malwina J. Luczak, Eli Upfal: Reducing Network Congestion and Blocking Probability Through Balanced Allocation. FOCS 1999: 587-595

Milos Hauskrecht, Gopal Pandurangan, Eli Upfal: Computing Near Optimal Strategies for Stochastic Investment Planning Problems. IJCAI 1999: 1310-1315

Franco P. Preparata, Alan M. Frieze, Eli Upfal: On the power of universal bases in sequencing by hybridization. RECOMB 1999: 295-301

Gopal Pandurangan, Eli Upfal: Static and Dynamic Evaluation of QoS Properties. STOC 1999: 566-573

Andrzej Pelc, Eli Upfal: Reliable Fault Diagnosis with Few Tests. Combinatorics, Probability & Computing 7(3): 323-333 (1998)

Nir Shavit, Eli Upfal, Asaph Zemach: A Steady State Analysis of Diffracting Trees. Theory Comput. Syst. 31(4): 403-423 (1998)

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)

Prabhakar Raghavan, Eli Upfal: Stochastic Contention Resolution With Short Delays. SIAM J. Comput. 28(2): 709-719 (1998)

Eli Upfal: Design and Analysis of Dynamic Processes: A Stochastic Approach. ESA 1998: 26-34

Andrei Z. Broder, Alan M. Frieze, Eli Upfal: Dynamic Packet Routing on Arrays with Bounded Buffers. LATIN 1998: 273-281

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

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

Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal: How much can hardware help routing? J. ACM 44(5): 726-741 (1997)

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)

Eli Upfal: Stochastic Analysis of Dynamic Processes. FCT 1997: 85-92

Nir Shavit, Eli Upfal, Asaph Zemach: A Wait-Free Sorting Algorithm. PODC 1997: 121-128

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

Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal: A Theory of Wormhole Routing in Parallel Computers. IEEE Trans. Computers 45(6): 704-713 (1996)

Eli Upfal, Sergio A. Felperin, Marc Snir: Randomized Routing with Shorter Paths. IEEE Trans. Parallel Distrib. Syst. 7(4): 356-362 (1996)

Andrei Z. Broder, Alan M. Frieze, Eli Upfal: A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). FOCS 1996: 390-399

Sonne Preminger, Eli Upfal: Efficient Traffic Laws for Mobile Robots - Work in Progress (Avstract). PODC 1996: 155

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

Nir Shavit, Eli Upfal, Asaph Zemach: A Steady State Analysis of Diffracting Trees (Extended Abstract). SPAA 1996: 33-41

Andrei Z. Broder, Eli Upfal: Dynamic Deflection Routing on Arrays (Preliminary Version). STOC 1996: 348-355

Sonne Preminger, Eli Upfal: Safe and Efficient Traffic Laws for Mobile Robots. SWAT 1996: 357-367

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)

Prabhakar Raghavan, Eli Upfal: Stochastic contention resolution with short delays. STOC 1995: 229-237

Eli Upfal: Tolerating a Linear Number of Faults in Networks of Bounded Degree. Inf. Comput. 115(2): 312-320 (1994)

Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal: Near-perfect Token Distribution. Random Struct. Algorithms 5(4): 559-572 (1994)

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)

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)

Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal: Computing with Noisy Information. SIAM J. Comput. 23(5): 1001-1018 (1994)

Eli Upfal: On the Theory of Interconnection Networks for Parallel Computers. ICALP 1994: 473-486

Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal: Optimal Construction of Edge-Disjoint Paths in Random Graphs. SODA 1994: 603-612

Prabhakar Raghavan, Eli Upfal: Efficient routing in all-optical networks. STOC 1994: 134-143

Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal: Balanced allocations (extended abstract). STOC 1994: 593-602

Andrei Z. Broder, Alan M. Frieze, Eli Upfal: On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. SODA 1993: 322-330

Eli Upfal, Sergio Feleprin, Marc Snir: Randomized routing with shorter paths. SPAA 1993: 273-282

Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal: How much can hardware help routing? STOC 1993: 573-582

Eli Upfal: An O(log(N)) Deterministic Packet-Routing Scheme. J. ACM 39(1): 55-70 (1992)

Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal: A Theory of Wormhole Routing in Parallel Computers (Extended Abstract). FOCS 1992: 563-572

Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal: Near-perfect Token Distribution. ICALP 1992: 308-317

Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal: An Experimental Study of Wormhole Routing in Parallel Computers. Heinz Nixdorf Symposium 1992: 156-165

Eli Upfal: Tolerating Linear Number of Faults in Networks of Bounded Degree. PODC 1992: 83-89

Andrei Z. Broder, Alan M. Frieze, Eli Upfal: Existence and Construction of Edge Disjoint Paths on Expander Graphs. STOC 1992: 140-149

Shay Assaf, Eli Upfal: Fault Tolerant Sorting Networks. SIAM J. Discrete Math. 4(4): 472-480 (1991)

Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal: On the Parallel Complexity of Evaluating Game Trees. SODA 1991: 404-413

Larry Rudolph, Miriam Slivkin-Allalouf, Eli Upfal: A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. SPAA 1991: 237-245

Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal: Randomized Broadcast in Networks. Random Struct. Algorithms 1(4): 447-460 (1990)

David Peleg, Eli Upfal: A Time-Randomness Trade-Off for Oblivious Routing. SIAM J. Comput. 19(2): 256-266 (1990)

Shay Assaf, Eli Upfal: Fault Tolerant Sorting Network. FOCS 1990: 275-284

Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal: Randomized Broadcast in Networks. SIGAL International Symposium on Algorithms 1990: 128-137

Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal: Computing with Unreliable Information (Preliminary Version). STOC 1990: 128-137

David Peleg, Eli Upfal: Constructng disjoint paths on expander graphs. Combinatorica 9(3): 289-313 (1989)

David Peleg, Eli Upfal: A trade-off between space and efficiency for routing tables. J. ACM 36(3): 510-530 (1989)

David Peleg, Eli Upfal: The Token Distribution Problem. SIAM J. Comput. 18(2): 229-243 (1989)

Eli Upfal: An O(log N) Deterministic Packet Routing Scheme (Preliminary Version). STOC 1989: 241-250

Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal: Trading Space for Time in Undirected s-t Connectivity. STOC 1989: 543-549

Anna R. Karlin, Eli Upfal: Parallel hashing: an efficient implementation of shared memory. J. ACM 35(4): 876-892 (1988)

Richard M. Karp, Eli Upfal, Avi Wigderson: The Complexity of Parallel Search. J. Comput. Syst. Sci. 36(2): 225-253 (1988)

Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal: Fault Tolerance in Networks of Bounded Degree. SIAM J. Comput. 17(5): 975-988 (1988)

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)

David Peleg, Eli Upfal: A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract). STOC 1988: 43-52

Danny Krizanc, David Peleg, Eli Upfal: A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract). STOC 1988: 93-102

Eli Upfal, Avi Wigderson: How to share memory in a distributed system. J. ACM 34(1): 116-127 (1987)

Eli Shamir, Eli Upfal: A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems. J. Parallel Distrib. Comput. 4(5): 521-530 (1987)

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)

David Peleg, Eli Upfal: The Generalized Packet Routing Problem. Theor. Comput. Sci. 53: 281-293 (1987)

David Peleg, Eli Upfal: Constructing Disjoint Paths on Expander Graphs (Extended Abstract). STOC 1987: 264-273

Richard M. Karp, Eli Upfal, Avi Wigderson: Constructing a perfect matching is in random NC. Combinatorica 6(1): 35-48 (1986)

Danny Dolev, Eli Upfal, Manfred K. Warmuth: The Parallel Complexity of Scheduling with Precedence Constraints. J. Parallel Distrib. Comput. 3(4): 553-576 (1986)

David Peleg, Eli Upfal: The Token Distribution Problem (Preliminary Version). FOCS 1986: 418-427

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

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

Anna R. Karlin, Eli Upfal: Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version). STOC 1986: 160-168

Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal: Fault Tolerance in Networks of Bounded Degree (Preliminary Version). STOC 1986: 370-379

Richard M. Karp, Eli Upfal, Avi Wigderson: The Complexity of Parallel Computation on Matroids. FOCS 1985: 541-550

Richard M. Karp, Eli Upfal, Avi Wigderson: Constructing a Perfect Matching is in Random NC. STOC 1985: 22-32

Richard M. Karp, Eli Upfal, Avi Wigderson: Are Search and Decision Problems Computationally Equivalent? STOC 1985: 464-475

Eli Upfal: Efficient Schemes for Parallel Communication. J. ACM 31(3): 507-517 (1984)

Eli Shamir, Eli Upfal: Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces. J. Algorithms 5(4): 488-501 (1984)

Eli Upfal, Avi Wigderson: How to Share Memory in a Distributed System (A Preliminary Version). FOCS 1984: 171-180

Eli Upfal: A Probabilistic Relation between Desirable and Feasible Models of Parallel Computation (A Preliminary Version). STOC 1984: 258-265

Eli Shamir, Eli Upfal: A Fast Construction oF Disjoint Paths in Communication Networks. FCT 1983: 428-438

Eli Shamir, Eli Upfal: One-factor in random graphs based on vertex choice. Discrete Mathematics 41(3): 281-286 (1982)

Eli Upfal: Formal Correctness Proofs of a Nondeterministic Program. Inf. Process. Lett. 14(2): 86-92 (1982)

Eli Upfal: Efficient Schemes for Parallel Communication. PODC 1982: 55-59

Eli Shamir, Eli Upfal: N-Processors Graph Distributively Achieve Perfect Matchings in O(log²N) Beats. PODC 1982: 238-241