The following pages link to Eli Upfal (Q477097):
Displaying 44 items.
- Fault Tolerant Sorting Networks (Q3985534) (← links)
- Optimal Construction of Edge-Disjoint Paths in Random Graphs (Q4210165) (← links)
- Stochastic Contention Resolution With Short Delays (Q4210173) (← links)
- Reliable Fault Diagnosis with Few Tests (Q4228208) (← links)
- (Q4228430) (← links)
- (Q4228488) (← links)
- (Q4234069) (← links)
- Balanced Allocations (Q4268876) (← links)
- Trading Space for Time in Undirected <i>s</i>-<i>t</i> Connectivity (Q4291560) (← links)
- An <i>O</i> (log <i>N</i> ) deterministic packet-routing scheme (Q4302818) (← links)
- Existence and Construction of Edge-Disjoint Paths on Expander Graphs (Q4312418) (← links)
- Computing with Noisy Information (Q4312419) (← links)
- Near‐perfect token distribution (Q4312747) (← links)
- How much can hardware help routing? (Q4377594) (← links)
- Concurrent threads and optimal parallel minimum spanning trees algorithm (Q4406286) (← links)
- A theory of wormhole routing in parallel computers (Q4406346) (← links)
- (Q4527020) (← links)
- Balanced Allocation: Patience is not a Virtue (Q4575626) (← links)
- On the theory of interconnection networks for parallel computers (Q4632449) (← links)
- (Q4705352) (← links)
- A trade-off between space and efficiency for routing tables (Q4710684) (← links)
- (Q4808653) (← links)
- Efficient communication in an ad-hoc network (Q4828561) (← links)
- (Q4875193) (← links)
- (Q5002833) (← links)
- Safe and efficient traffic laws for mobile robots (Q5054827) (← links)
- Stochastic analysis of dynamic processes (Q5055922) (← links)
- Differentially Mutated Subnetworks Discovery (Q5090352) (← links)
- The Melbourne Shuffle: Improving Oblivious Storage in the Cloud (Q5167869) (← links)
- Near-perfect token distribution (Q5204326) (← links)
- Bandits and Experts in Metric Spaces (Q5215459) (← links)
- How much can hardware help routing? (Q5248528) (← links)
- (Q5302093) (← links)
- Steady state analysis of balanced‐allocation routing (Q5311900) (← links)
- Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input (Q5317166) (← links)
- Tolerating linear number of faults in networks of bounded degree (Q5348837) (← links)
- A wait-free sorting algorithm (Q5361475) (← links)
- An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets (Q5395683) (← links)
- Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems (Q5428807) (← links)
- Probability and Computing (Q5463630) (← links)
- (Q5743420) (← links)
- Balanced Allocation: Patience Is Not a Virtue (Q5885582) (← links)
- On the complexity of anonymous communication through public networks (Q6107258) (← links)
- Reducing polarization and increasing diverse navigability in graphs by inserting edges and swapping edge weights (Q6486092) (← links)
