The following pages link to Leighton, Tom (Q161500):
Displaying 28 items.
- (Q222797) (redirect page) (← links)
- Some results on greedy embeddings in metric spaces (Q603850) (← links)
- On the Max-flow min-cut ratio for directed multicommodity flows (Q818146) (← links)
- A tight lower bound for the train reversal problem (Q912613) (← links)
- (Q1262766) (redirect page) (← links)
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (Q1262767) (← links)
- Methods for message routing in parallel machines (Q1330418) (← links)
- Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults (Q1356885) (← links)
- On the design of reliable Boolean circuits that contain partially unreliable gates (Q1384528) (← links)
- On probabilistic networks for selection, merging, and sorting (Q1384688) (← links)
- Fast approximation algorithms for multicommodity flow problems (Q1892218) (← links)
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules (Q1964594) (← links)
- (Q2768372) (← links)
- Scalable expanders (Q2817605) (← links)
- Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks (Q2817640) (← links)
- Basic Network Creation Games (Q2848528) (← links)
- (Q2921671) (← links)
- (Q2921741) (← links)
- (Q2934683) (← links)
- Correction: Basic Network Creation Games (Q2935293) (← links)
- Resource discovery in distributed networks (Q2942766) (← links)
- (Q3138971) (← links)
- Reconstructing a three-dimensional model with arbitrary errors (Q3158536) (← links)
- Tight Bounds on the Complexity of Parallel Sorting (Q3219774) (← links)
- (Q3341891) (← links)
- Wafer-Scale Integration of Systolic Arrays (Q3347792) (← links)
- Generalized planar matching (Q3357535) (← links)
- Greedy Dynamic Routing on Arrays (Q4225869) (← links)
