The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Eli Upfal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (2, 0)][DBLP]
    Storage and Retrieval for Image and Video Databases (SPIE), 1998, pp:150-161 [Conf]
  2. Anna R. Karlin, Eli Upfal
    Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version) [Citation Graph (2, 0)][DBLP]
    STOC, 1986, pp:160-168 [Conf]
  3. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. [Citation Graph (1, 0)][DBLP]
    SODA, 1993, pp:322-330 [Conf]
  4. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
    Balanced allocations (extended abstract). [Citation Graph (1, 0)][DBLP]
    STOC, 1994, pp:593-602 [Conf]
  5. Richard M. Karp, Eli Upfal, Avi Wigderson
    Constructing a Perfect Matching is in Random NC [Citation Graph (1, 0)][DBLP]
    STOC, 1985, pp:22-32 [Conf]
  6. Milos Hauskrecht, Luis E. Ortiz, Ioannis Tsochantaridis, Eli Upfal
    Computing Global Strategies for Multi-Market Commodity Trading. [Citation Graph (0, 0)][DBLP]
    AIPS, 2000, pp:159-166 [Conf]
  7. Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
    Using PageRank to Characterize Web Structure. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:330-339 [Conf]
  8. Will Sheffler, Eli Upfal, John Sedivy, William Stafford Noble
    A Learned Comparative Expression Measure for Affymetrix GeneChip DNA Microarrays. [Citation Graph (0, 0)][DBLP]
    CSB, 2005, pp:144-154 [Conf]
  9. Eli Upfal
    Design and Analysis of Dynamic Processes: A Stocastic Approach. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:26-34 [Conf]
  10. Eli Upfal
    Stochastic Analysis of Dynamic Processes. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:85-92 [Conf]
  11. Eli Shamir, Eli Upfal
    A Fast Construction oF Disjoint Paths in Communication Networks. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:428-438 [Conf]
  12. Aris Anagnostopoulos, Adam Kirsch, Eli Upfal
    Stability and Efficiency of a Random Local Load Balancing Protocol. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:472-481 [Conf]
  13. Shay Assaf, Eli Upfal
    Fault Tolerant Sorting Network [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:275-284 [Conf]
  14. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:390-399 [Conf]
  15. Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal
    A Theory of Wormhole Routing in Parallel Computers (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:563-572 [Conf]
  16. Richard M. Karp, Eli Upfal, Avi Wigderson
    The Complexity of Parallel Computation on Matroids [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:541-550 [Conf]
  17. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal
    Random graph models for the web graph. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:57-65 [Conf]
  18. Malwina J. Luczak, Eli Upfal
    Reducing Network Congestion and Blocking Probability Through Balanced Allocation. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:587-595 [Conf]
  19. Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
    Building Low-Diameter P2P Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:492-499 [Conf]
  20. David Peleg, Eli Upfal
    The Token Distribution Problem (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:418-427 [Conf]
  21. Eli Upfal
    Performance Analysis of Dynamic Network Processes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:18-0 [Conf]
  22. Eli Upfal, Avi Wigderson
    How to Share Memory in a Distributed System (A Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:171-180 [Conf]
  23. Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
    Near-perfect Token Distribution. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:308-317 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:50-59 [Conf]
  25. Eli Upfal
    On the Theory of Interconnection Networks for Parallel Computers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:473-486 [Conf]
  26. Milos Hauskrecht, Gopal Pandurangan, Eli Upfal
    Computing Near Optimal Strategies for Stochastic Investment Planning Problems. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:1310-1315 [Conf]
  27. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Dynamic Packet Routing on Arrays with Bounded Buffers. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:273-281 [Conf]
  28. Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal
    An Experimental Study of Wormhole Routing in Parallel Computers. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:156-165 [Conf]
  29. Sonne Preminger, Eli Upfal
    Efficient Traffic Laws for Mobile Robots - Work in Progress (Avstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:155- [Conf]
  30. Eli Shamir, Eli Upfal
    N-Processors Graph Distributively Achieve Perfect Matchings in O(log²N) Beats. [Citation Graph (0, 0)][DBLP]
    PODC, 1982, pp:238-241 [Conf]
  31. Nir Shavit, Eli Upfal, Asaph Zemach
    A Wait-Free Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:121-128 [Conf]
  32. Eli Upfal
    Efficient Schemes for Parallel Communication. [Citation Graph (0, 0)][DBLP]
    PODC, 1982, pp:55-59 [Conf]
  33. Eli Upfal
    Tolerating Linear Number of Faults in Networks of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    PODC, 1992, pp:83-89 [Conf]
  34. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal
    The Web as a Graph. [Citation Graph (0, 18)][DBLP]
    PODS, 2000, pp:1-10 [Conf]
  35. 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. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:145-158 [Conf]
  36. Franco P. Preparata, Alan M. Frieze, Eli Upfal
    On the power of universal bases in sequencing by hybridization. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1999, pp:295-301 [Conf]
  37. Franco P. Preparata, Eli Upfal
    Sequencing-by-hybridization at the information-theory bound: an optimal algorithm. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2000, pp:245-253 [Conf]
  38. Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
    Randomized Broadcast in Networks. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:128-137 [Conf]
  39. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
    Optimal Construction of Edge-Disjoint Paths in Random Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:603-612 [Conf]
  40. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
    An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:261-268 [Conf]
  41. Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal
    On the Parallel Complexity of Evaluating Game Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:404-413 [Conf]
  42. Gopal Pandurangan, Eli Upfal
    Can entropy characterize performance of online algorithms?. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:727-734 [Conf]
  43. Larry Rudolph, Miriam Slivkin-Allalouf, Eli Upfal
    A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:237-245 [Conf]
  44. Nir Shavit, Eli Upfal, Asaph Zemach
    A Steady State Analysis of Diffracting Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:33-41 [Conf]
  45. Eli Upfal, Sergio Feleprin, Marc Snir
    Randomized routing with shorter paths. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:273-282 [Conf]
  46. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
    A Time-Space Tradeoff for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:353-358 [Conf]
  47. Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal
    How much can hardware help routing? [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:573-582 [Conf]
  48. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Existence and Construction of Edge Disjoint Paths on Expander Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:140-149 [Conf]
  49. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:531-539 [Conf]
  50. Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal
    Trading Space for Time in Undirected s-t Connectivity [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:543-549 [Conf]
  51. Andrei Z. Broder, Eli Upfal
    Dynamic Deflection Routing on Arrays (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:348-355 [Conf]
  52. Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
    Fault Tolerance in Networks of Bounded Degree (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:370-379 [Conf]
  53. Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
    Computing with Unreliable Information (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:128-137 [Conf]
  54. Richard M. Karp, Eli Upfal, Avi Wigderson
    Are Search and Decision Problems Computationally Equivalent? [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:464-475 [Conf]
  55. Danny Krizanc, David Peleg, Eli Upfal
    A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:93-102 [Conf]
  56. Gopal Pandurangan, Eli Upfal
    Static and Dynamic Evaluation of QoS Properties. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:566-573 [Conf]
  57. David Peleg, Eli Upfal
    Constructing Disjoint Paths on Expander Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:264-273 [Conf]
  58. David Peleg, Eli Upfal
    A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:43-52 [Conf]
  59. Prabhakar Raghavan, Eli Upfal
    Efficient routing in all-optical networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:134-143 [Conf]
  60. Prabhakar Raghavan, Eli Upfal
    Stochastic contention resolution with short delays. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:229-237 [Conf]
  61. Eli Upfal
    A Probabilistic Relation between Desirable and Feasible Models of Parallel Computation (A Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:258-265 [Conf]
  62. Eli Upfal
    An O(log N) Deterministic Packet Routing Scheme (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:241-250 [Conf]
  63. Sonne Preminger, Eli Upfal
    Safe and Efficient Traffic Laws for Mobile Robots. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:357-367 [Conf]
  64. Milos Hauskrecht, Eli Upfal
    A Clustering Approach to Solving Large Stochastic Matching Problems. [Citation Graph (0, 0)][DBLP]
    UAI, 2001, pp:219-226 [Conf]
  65. Milos Hauskrecht, Luis E. Ortiz, Ioannis Tsochantaridis, Eli Upfal
    Efficient Methods for Computing Investment Strategies for Multi-Market Commodity Trading. [Citation Graph (0, 0)][DBLP]
    Applied Artificial Intelligence, 2001, v:15, n:5, pp:429-452 [Journal]
  66. Richard M. Karp, Eli Upfal, Avi Wigderson
    Constructing a perfect matching is in random NC. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:35-48 [Journal]
  67. David Peleg, Eli Upfal
    Constructng disjoint paths on expander graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:3, pp:289-313 [Journal]
  68. Andrzej Pelc, Eli Upfal
    Reliable Fault Diagnosis with Few Tests. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:3, pp:323-333 [Journal]
  69. Aris Anagnostopoulos, Russell Bent, Eli Upfal, Pascal Van Hentenryck
    A simple and deterministic competitive algorithm for online facility location. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:194, n:2, pp:175-202 [Journal]
  70. Eli Upfal
    Tolerating a Linear Number of Faults in Networks of Bounded Degree [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:115, n:2, pp:312-320 [Journal]
  71. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:2, pp:79-81 [Journal]
  72. Eli Upfal
    Formal Correctness Proofs of a Nondeterministic Program. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:2, pp:86-92 [Journal]
  73. Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal
    How much can hardware help routing? [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:5, pp:726-741 [Journal]
  74. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    A general approach to dynamic packet routing with bounded buffers. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:2, pp:324-349 [Journal]
  75. Anna R. Karlin, Eli Upfal
    Parallel hashing: an efficient implementation of shared memory. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:876-892 [Journal]
  76. David Peleg, Eli Upfal
    A trade-off between space and efficiency for routing tables. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:3, pp:510-530 [Journal]
  77. Eli Upfal
    Efficient Schemes for Parallel Communication. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:3, pp:507-517 [Journal]
  78. Eli Upfal
    An O(log(N)) Deterministic Packet-Routing Scheme. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:1, pp:55-70 [Journal]
  79. Eli Upfal, Avi Wigderson
    How to share memory in a distributed system. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:1, pp:116-127 [Journal]
  80. Abraham Flaxman, Alan M. Frieze, Eli Upfal
    Efficient communication in an ad-hoc network. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:1, pp:1-7 [Journal]
  81. Eli Shamir, Eli Upfal
    Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:4, pp:488-501 [Journal]
  82. Alan M. Frieze, Franco P. Preparata, Eli Upfal
    Optimal Reconstruction of a Sequence from its Probes. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1999, v:6, n:3/4, pp:- [Journal]
  83. Franco P. Preparata, Eli Upfal
    Sequencing-by-Hybridization at the Information-Theory Bound: An Optimal Algorithm. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2000, v:7, n:3-4, pp:621-630 [Journal]
  84. Richard M. Karp, Eli Upfal, Avi Wigderson
    The Complexity of Parallel Search. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:36, n:2, pp:225-253 [Journal]
  85. Gopal Pandurangan, Eli Upfal
    Static and Dynamic Evaluation of QoS Properties. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2000, v:1, n:2, pp:135-150 [Journal]
  86. Danny Dolev, Eli Upfal, Manfred K. Warmuth
    The Parallel Complexity of Scheduling with Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1986, v:3, n:4, pp:553-576 [Journal]
  87. A. L. Narasimha Reddy, Eli Upfal
    Real-Time Communication Scheduling in a Multicomputer Video Server. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:58, n:3, pp:425-445 [Journal]
  88. Eli Shamir, Eli Upfal
    A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1987, v:4, n:5, pp:521-530 [Journal]
  89. Nir Shavit, Eli Upfal, Asaph Zemach
    A Steady State Analysis of Diffracting Trees. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:4, pp:403-423 [Journal]
  90. Aris Anagnostopoulos, Ioannis Kontoyiannis, Eli Upfal
    Steady state analysis of balanced-allocation routing. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:4, pp:446-467 [Journal]
  91. Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
    Near-perfect Token Distribution. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:4, pp:559-572 [Journal]
  92. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:1, pp:87-109 [Journal]
  93. Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
    Randomized Broadcast in Networks. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:4, pp:447-460 [Journal]
  94. Aris Anagnostopoulos, Adam Kirsch, Eli Upfal
    Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:616-639 [Journal]
  95. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
    Balanced Allocations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:180-200 [Journal]
  96. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
    A Time-Space Tradeoff for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:97-99 [Journal]
  97. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
    Optimal Construction of Edge-Disjoint Paths in Random Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:541-573 [Journal]
  98. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Existence and Construction of Edge-Disjoint Paths on Expander Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:5, pp:976-989 [Journal]
  99. Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal
    Trading Space for Time in Undirected s-t Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:324-334 [Journal]
  100. Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
    Fault Tolerance in Networks of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:5, pp:975-988 [Journal]
  101. Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal
    Computing with Noisy Information. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:5, pp:1001-1018 [Journal]
  102. David Peleg, Eli Upfal
    The Token Distribution Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:229-243 [Journal]
  103. David Peleg, Eli Upfal
    A Time-Randomness Trade-Off for Oblivious Routing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:2, pp:256-266 [Journal]
  104. Prabhakar Raghavan, Eli Upfal
    Stochastic Contention Resolution With Short Delays. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:709-719 [Journal]
  105. Shay Assaf, Eli Upfal
    Fault Tolerant Sorting Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:4, pp:472-480 [Journal]
  106. Gopal Pandurangan, Eli Upfal
    Entropy-based bounds for online algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  107. Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal
    A Theory of Wormhole Routing in Parallel Computers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:6, pp:704-713 [Journal]
  108. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:58, n:, pp:57-68 [Journal]
  109. David Peleg, Eli Upfal
    The Generalized Packet Routing Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:281-293 [Journal]
  110. Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Eli Upfal, Derrick Weathersby
    Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:11, pp:1143-1156 [Journal]
  111. Eli Upfal, Sergio A. Felperin, Marc Snir
    Randomized Routing with Shorter Paths. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:4, pp:356-362 [Journal]
  112. Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck
    Propagating Knapsack Constraints in Sublinear Time. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:231-236 [Conf]
  113. Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
    Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:171-182 [Conf]
  114. Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal
    Finding near neighbors through cluster pruning. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:103-112 [Conf]
  115. Eli Shamir, Eli Upfal
    One-factor in random graphs based on vertex choice. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:3, pp:281-286 [Journal]

  116. Adapting to a Changing Environment: the Brownian Restless Bandits. [Citation Graph (, )][DBLP]


  117. 07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. [Citation Graph (, )][DBLP]


  118. Sort Me If You Can: How to Sort Dynamic Data. [Citation Graph (, )][DBLP]


  119. Mortal Multi-Armed Bandits. [Citation Graph (, )][DBLP]


  120. An efficient rigorous approach for identifying statistically significant frequent itemsets. [Citation Graph (, )][DBLP]


  121. Algorithms for Detecting Significantly Mutated Pathways in Cancer. [Citation Graph (, )][DBLP]


  122. The hiring problem and Lake Wobegon strategies. [Citation Graph (, )][DBLP]


  123. Multi-armed bandits in metric spaces. [Citation Graph (, )][DBLP]


  124. MADMX: A Novel Strategy for Maximal Dense Motif Extraction. [Citation Graph (, )][DBLP]


  125. Multi-Armed Bandits in Metric Spaces [Citation Graph (, )][DBLP]


  126. MADMX: A Novel Strategy for Maximal Dense Motif Extraction [Citation Graph (, )][DBLP]


  127. An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets [Citation Graph (, )][DBLP]


  128. Mining Top-K Frequent Itemsets Through Progressive Sampling [Citation Graph (, )][DBLP]


  129. Infectious Random Walks [Citation Graph (, )][DBLP]


Search in 3.238secs, Finished in 3.242secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002