The following pages link to Uri Zwick (Q233001):
Displaying 50 items.
- All-pairs bottleneck paths in vertex weighted graphs (Q633850) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (Q672389) (← links)
- Finding and counting given length cycles (Q675293) (← links)
- An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM (Q676443) (← links)
- An extension of Khrapchenko's theorem (Q753798) (← links)
- A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths (Q850796) (← links)
- On Nečiporuk's theorem for branching programs (Q1121017) (← links)
- The memory game (Q1210544) (← links)
- Shallow circuits and concise formulae for multiple addition and multiplication (Q1312182) (← links)
- The complexity of mean payoff games on graphs (Q1351468) (← links)
- Connection caching: Model and algorithms. (Q1401982) (← links)
- Approximating MIN 2-SAT and MIN 3-SAT (Q1780843) (← links)
- SOKOBAN and other motion planning problems (Q1818116) (← links)
- On the number of ANDs versus the number of ORs in monotone Boolean circuits (Q1847364) (← links)
- Competitive analysis of the LRFU paging algorithm (Q1849588) (← links)
- Cell identification codes for tracking mobile users (Q1859455) (← links)
- Finding the \(\alpha n\)-th largest element (Q1912751) (← links)
- Public vs. private randomness in simultaneous multi-party communication complexity (Q2292918) (← links)
- Multicriteria global minimum cuts (Q2509022) (← links)
- On lower bounds for selecting the median (Q2719173) (← links)
- Median selection requires \((2+\varepsilon)n\) comparisons (Q2719174) (← links)
- All-pairs small-stretch paths (Q2729642) (← links)
- Optimal randomized EREW PRAM algorithms for finding spanning forests (Q2731600) (← links)
- Approximation algorithms for MAX-4-SAT and rounding procedures for semidefinite programs (Q2746433) (← links)
- Combinatorial approximation algorithms for the maximum directed cut problem (Q2768265) (← links)
- Constructing worst case instances for semidefinite programming based approximation algorithms (Q2768278) (← links)
- Coloring \(k\)-colorable graphs using smaller palettes (Q2768312) (← links)
- Which formulae shrink under random restrictions? (Q2768368) (← links)
- Constructing worst case instances for semidefinite programming based approximation algorithms (Q2784501) (← links)
- Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences (Q2799477) (← links)
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time (Q2810272) (← links)
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract) (Q2817625) (← links)
- All pairs lightest shortest paths (Q2819534) (← links)
- Connection caching (Q2819591) (← links)
- Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems (Q2819597) (← links)
- Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity (Q2835017) (← links)
- Soft heaps simplified (Q2862206) (← links)
- On the approximability of reachability-preserving network orientations (Q2909122) (← links)
- Dynamic approximate all-pairs shortest paths in undirected graphs (Q2910856) (← links)
- Discounted deterministic Markov decision processes and discounted all-pairs shortest paths (Q2930309) (← links)
- Efficient algorithms for the 2-gathering problem (Q2930311) (← links)
- (Q2934588) (← links)
- (Q2934643) (← links)
- (Q2934690) (← links)
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm (Q2941509) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q2941558) (← links)
- Fast sparse matrix multiplication (Q2944486) (← links)
- Melding priority queues (Q2944529) (← links)
- Looking for MUM and DAD: Text-text comparisons do help (Q2956669) (← links)
