| |
 |      |
                                |
Note: Links lead to the DBLP on the Web. Eli Upfal 81 Milos Hauskrecht , Luis Ortiz , Ioannis Tsochantaridis , Eli Upfal: Computing Global Strategies for Multi-Market Commodity Trading. AIPS 2000 : 159-166 80 S. Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , D. Sivakumar , Andrew Tomkins , Eli Upfal: The Web as a Graph. PODS 2000 : 1-10 79 Malwina J. Luczak , Eli Upfal: Reducing Network Congestion and Blocking Probability Through Balanced Allocation. FOCS 1999 : 587-595 78 Milos Hauskrecht , Gopal Pandurangan , Eli Upfal: Computing Near Optimal Strategies for Stochastic Investment Planning Problems. IJCAI 1999 : 1310-1315 77 Franco P. Preparata , Alan M. Frieze , Eli Upfal: On the power of universal bases in sequencing by hybridization. RECOMB 1999 : 295-301 76 Gopal Pandurangan , Eli Upfal: Static and Dynamic Evaluation of QoS Properties. STOC 1999 : 566-573 75 Alan M. Frieze , Franco P. Preparata , Eli Upfal: Optimal Reconstruction of a Sequence from its Probes. Journal of Computational Biology 6 (3/4): (1999) 74 A. L. Narasimha Reddy , Eli Upfal: Real-Time Communication Scheduling in a Multicomputer Video Server. Journal of Parallel and Distributed Computing 58 (3): 425-445 (1999) 73 Yossi Azar , Andrei Z. Broder , Anna R. Karlin , Eli Upfal: Balanced Allocations. SIAM J. Comput. 29 (1): 180-200 (1999) 72 Eli Upfal: Design and Analysis of Dynamic Processes: A Stocastic Approach. ESA 1998 : 26-34 71 Andrei Z. Broder , Alan M. Frieze , Eli Upfal: Dynamic Packet Routing on Arrays with Bounded Buffers. LATIN 1998 : 273-281 70 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 69 Wayne Niblack , Xiaoming Zhu , James L. Hafner , Tom 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 : Srinivasan, Savitha; Zivkovic, Dan; Updates to the QBIC System. Storage and Retrieval for Image and Video Databases (SPIE) 1998 : 150-161 68 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) 67 Prabhakar Raghavan , Eli Upfal: Stochastic Contention Resolution With Short Delays. SIAM J. Comput. 28 (2): 709-719 (1998) 66 Nir Shavit , Eli Upfal, Asaph Zemach : A Steady State Analysis of Diffracting Trees. Theory of Computing Systems 31 (4): 403-423 (1998) 65 Eli Upfal: Stochastic Analysis of Dynamic Processes. FCT 1997 : 85-92 64 Nir Shavit , Eli Upfal, Asaph Zemach : A Wait-Free Sorting Algorithm. PODC 1997 : 121-128 63 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 62 Jehoshua Bruck , Ching-Tien Ho , Shlomo Kipnis , Eli Upfal, Derrick Weathersby : Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems. IEEE Transactions on Parallel and Distributed Systems 8 (11): 1143-1156 (1997) 61 Allan Borodin , Prabhakar Raghavan , Baruch Schieber , Eli Upfal: How Much Can Hardware Help Routing? JACM 44 (5): 726-741 (1997) 60 Andrei Z. Broder , Alan M. Frieze , Eli Upfal: A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). FOCS 1996 : 390-399 59 Sonne Preminger , Eli Upfal: Efficient Traffic Laws for Mobile Robots - Work in Progress (Avstract). PODC 1996 : 155 58 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 57 Nir Shavit , Eli Upfal, Asaph Zemach : A Steady State Analysis of Diffracting Trees (Extended Abstract). SPAA 1996 : 33-41 56 Andrei Z. Broder , Eli Upfal: Dynamic Deflection Routing on Arrays (Preliminary Version). STOC 1996 : 348-355 55 Sonne Preminger , Eli Upfal: Safe and Efficient Traffic Laws for Mobile Robots. SWAT 1996 : 357-367 54 Sergio Felperin , Prabhakar Raghavan , Eli Upfal: A Theory of Wormhole Routing in Parallel Computers. IEEE Transactions on Computers 45 (6): 704-713 (1996) 53 Prabhakar Raghavan , Eli Upfal: Stochastic contention resolution with short delays. STOC 1995 : 229-237 52 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. IPL 56 (2): 79-81 (1995) 51 Eli Upfal: On the Theory of Interconnection Networks for Parallel Computers. ICALP 1994 : 473-486 50 Andrei Z. Broder , Alan M. Frieze , Stephen Suen , Eli Upfal: Optimal Construction of Edge-Disjoint Paths in Random Graphs. SODA 1994 : 603-612 49 Prabhakar Raghavan , Eli Upfal: Efficient Routing in All-Optical Networks. STOC 1994 : 134-143 48 Yossi Azar , Andrei Z. Broder , Anna R. Karlin , Eli Upfal: Balanced Allocations (Extended Abstract). STOC 1994 : 593-602 47 Eli Upfal: Tolerating a Linear Number of Faults in Networks of Bounded Degree. Information and Computation 115 (2): 312-320 (1994) 46 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) 45 Uriel Feige , Prabhakar Raghavan , David Peleg , Eli Upfal: Computing with Noisy Information. SIAM J. Comput. 23 (5): 1001-1018 (1994) 44 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) 43 Andrei Z. Broder , Alan M. Frieze , Eli Upfal: On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. SODA 1993 : 322-330 42 Eli Upfal, Sergio Feleprin , Marc Snir : Randomized routing with shorter paths. SPAA 1993 : 273-282 41 Allan Borodin , Prabhakar Raghavan , Baruch Schieber , Eli Upfal: How Much Can Hardware Help Routing? (Extended Abstract). STOC 1993 : 573-582 40 Sergio Felperin , Prabhakar Raghavan , Eli Upfal: A Theory of Wormhole Routing in Parallel Computers (Extended Abstract). FOCS 1992 : 563-572 39 Andrei Z. Broder , Alan M. Frieze , Eli Shamir , Eli Upfal: Near-perfect Token Distribution. ICALP 1992 : 308-317 38 Eli Upfal: Tolerating Linear Number of Faults in Networks of Bounded Degree. PODC 1992 : 83-89 37 Andrei Z. Broder , Alan M. Frieze , Eli Upfal: Existence and Construction of Edge Disjoint Paths on Expander Graphs. STOC 1992 : 140-149 36 Eli Upfal: An O(log(N)) Deterministic Packet-Routing Scheme. JACM 39 (1): 55-70 (1992) 35 Andrei Z. Broder , Anna R. Karlin , Prabhakar Raghavan , Eli Upfal: On the Parallel Complexity of Evaluating Game Trees. SODA 1991 : 404-413 34 Larry Rudolph , Miriam Slivkin-Allalouf , Eli Upfal: A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. SPAA 1991 : 237-245 33 Shay Assaf , Eli Upfal: Fault Tolerant Sorting Network. FOCS 1990 : 275-284 32 Uriel Feige , David Peleg , Prabhakar Raghavan , Eli Upfal: Computing with Unreliable Information (Preliminary Version). STOC 1990 : 128-137 31 David Peleg , Eli Upfal: A Time-Randomness Trade-Off for Oblivious Routing. SIAM J. Comput. 19 (2): 256-266 (1990) 30 Eli Upfal: An O(log N) Deterministic Packet Routing Scheme (Preliminary Version). STOC 1989 : 241-250 29 Andrei Z. Broder , Anna R. Karlin , Prabhakar Raghavan , Eli Upfal: Trading Space for Time in Undirected s-t Connectivity. STOC 1989 : 543-549 28 David Peleg , Eli Upfal: A Trade-Off between Space and Efficiency for Routing Tables. JACM 36 (3): 510-530 (1989) 27 David Peleg , Eli Upfal: The Token Distribution Problem. SIAM J. Comput. 18 (2): 229-243 (1989) 26 David Peleg , Eli Upfal: A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract). STOC 1988 : 43-52 25 Danny Krizanc , David Peleg , Eli Upfal: A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract). STOC 1988 : 93-102 24 Anna R. Karlin , Eli Upfal: Parallel Hashing: An Efficient Implementation of Shared Memory. JACM 35 (4): 876-892 (1988) 23 Richard M. Karp , Eli Upfal, Avi Wigderson : The Complexity of Parallel Search. JCSS 36 (2): 225-253 (1988) 22 Cynthia Dwork , David Peleg , Nicholas Pippenger , Eli Upfal: Fault Tolerance in Networks of Bounded Degree. SIAM J. Comput. 17 (5): 975-988 (1988) 21 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. TCS 58 : 57-68 (1988) 20 David Peleg , Eli Upfal: Constructing Disjoint Paths on Expander Graphs (Extended Abstract). STOC 1987 : 264-273 19 Eli Upfal, Avi Wigderson : How to Share Memory in a Distributed System. JACM 34 (1): 116-127 (1987) 18 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) 17 David Peleg , Eli Upfal: The Generalized Packet Routing Problem. TCS 53 : 281-293 (1987) 16 David Peleg , Eli Upfal: The Token Distribution Problem (Preliminary Version). FOCS 1986 : 418-427 15 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 14 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 13 Anna R. Karlin , Eli Upfal: Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version). STOC 1986 : 160-168 12 Cynthia Dwork , David Peleg , Nicholas Pippenger , Eli Upfal: Fault Tolerance in Networks of Bounded Degree (Preliminary Version). STOC 1986 : 370-379 11 Richard M. Karp , Eli Upfal, Avi Wigderson : The Complexity of Parallel Computation on Matroids. FOCS 1985 : 541-550 10 Richard M. Karp , Eli Upfal, Avi Wigderson : Constructing a Perfect Matching is in Random NC. STOC 1985 : 22-32 9 Richard M. Karp , Eli Upfal, Avi Wigderson : Are Search and Decision Problems Computationally Equivalent? STOC 1985 : 464-475 8 Eli Upfal, Avi Wigderson : How to Share Memory in a Distributed System (A Preliminary Version). FOCS 1984 : 171-180 7 Eli Upfal: A Probabilistic Relation between Desirable and Feasible Models of Parallel Computation (A Preliminary Version). STOC 1984 : 258-265 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) 5 Eli Upfal: Efficient Schemes for Parallel Communication. JACM 31 (3): 507-517 (1984) 4 Eli Shamir , Eli Upfal: A Fast Construction oF Disjoint Paths in Communication Networks. FCT 1983 : 428-438 3 Eli Shamir , Eli Upfal: N-Processors Graph Distributively Achieve Perfect Matchings in O(log²N) Beats. PODC 1982 : 238-241 2 Eli Upfal: Efficient Schemes for Parallel Communication. PODC 1982 : 55-59 1 Eli Upfal: Formal Correctness Proofs of a Nondeterministic Program. IPL 14 (2): 86-92 (1982) DiSC'01 Copyright ©2002 ACM Inc. |
