The following pages link to Eli Upfal (Q477097):
Displaying 50 items.
- Fast distributed PageRank computation (Q477098) (← links)
- Sorting and selection on dynamic data (Q541657) (← links)
- The generalized packet routing problem (Q580964) (← links)
- The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
- A simple and deterministic competitive algorithm for online facility location (Q703850) (← links)
- Commitment under uncertainty: Two-stage stochastic matching problems (Q959814) (← links)
- (Q1103638) (redirect page) (← links)
- Constructing a perfect matching is in random NC (Q1103639) (← links)
- The complexity of parallel search (Q1106664) (← links)
- A tradeoff between search and update time for the implicit dictionary problem (Q1108806) (← links)
- Constructing disjoint paths on expander graphs (Q1262782) (← links)
- A steady state analysis of diffracting trees (Q1265162) (← links)
- Tolerating a linear number of faults in networks of bounded degree (Q1342521) (← links)
- A wait-free sorting algorithm (Q1348691) (← links)
- On-line routing of random calls in networks (Q1396752) (← links)
- Online stochastic optimization under time constraints (Q1958625) (← links)
- Efficient approximation for restricted biclique cover problems (Q2331611) (← links)
- Distributed agreement in dynamic peer-to-peer networks (Q2353391) (← links)
- Optimizing static and adaptive probing schedules for rapid event detection (Q2424874) (← links)
- (Q2768373) (← links)
- On the Sample Complexity of Cancer Pathways Identification (Q2814593) (← links)
- Efficient routing in all-optical networks (Q2817603) (← links)
- Balanced allocations (extended abstract) (Q2817654) (← links)
- Static and dynamic evaluation of QoS properties (Q2819588) (← links)
- Algorithms on evolving graphs (Q2826051) (← links)
- (Q2833177) (← links)
- Tight bounds on information dissemination in sparse mobile networks (Q2943410) (← links)
- Entropy-based bounds for online algorithms (Q2944543) (← links)
- (Q2959893) (← links)
- (Q3128923) (← links)
- (Q3138977) (← links)
- (Q3140436) (← links)
- Randomized broadcast in networks (Q3197297) (← links)
- (Q3217612) (← links)
- Using PageRank to Characterize Web Structure (Q3431003) (← links)
- A Time-Randomness Trade-Off for Oblivious Routing (Q3468611) (← links)
- The Hiring Problem and Lake Wobegon Strategies (Q3586178) (← links)
- Sort Me If You Can: How to Sort Dynamic Data (Q3638104) (← links)
- (Q3670591) (← links)
- Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces (Q3677786) (← links)
- (Q3678667) (← links)
- Random hypergraph coloring algorithms and the weak chromatic number (Q3708840) (← links)
- (Q3725558) (← links)
- (Q3745272) (← links)
- Efficient Schemes for Parallel Communication (Q3765230) (← links)
- How to share memory in a distributed system (Q3766836) (← links)
- A Time-Space Tradeoff for Element Distinctness (Q3776617) (← links)
- Parallel hashing (Q3813281) (← links)
- Fault Tolerance in Networks of Bounded Degree (Q3823119) (← links)
- The Token Distribution Problem (Q3833622) (← links)
