Uri Zwick - RankMe

222 papers A* 74A 10B 14C 2Misc 2Journal 104Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes. CoRR Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick
2026	A*	`conf`	MAX BISECTION might be harder to approximate than MAX CUT. SODA Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick
2025	A*	`conf`	All-Hops Shortest Paths. SODA Virginia Vassilevska Williams, Zoe Xi, Yinzhan Xu, Uri Zwick
2025	A*	`conf`	Faster All-Pairs Optimal Electric Car Routing. ICALP Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2025	J	`jnl`	Faster All-Pairs Optimal Electric Car Routing. CoRR Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2025	J	`jnl`	Improved girth approximation in weighted undirected graphs. CoRR Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick
2025	J	`jnl`	MAX BISECTION might be harder to approximate than MAX CUT. CoRR Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick
2025	J	`jnl`	On the Mysteries of MAX NAE-SAT. SIAM J. Discret. Math. Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick
2025	J	`jnl`	Search Trees on Trees via LP. CoRR Yaniv Sadeh, Haim Kaplan, Uri Zwick
2024	J	`jnl`	All-Hops Shortest Paths. CoRR Virginia Vassilevska Williams, Zoe Xi, Yinzhan Xu, Uri Zwick
2024	J	`jnl`	Finding strong components using depth-first search. Eur. J. Comb. Robert E. Tarjan, Uri Zwick
2024	—	`conf`	Minimum-cost paths for electric cars. SOSA Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2024	J	`jnl`	Minimum-cost paths for electric cars. CoRR Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2024	J	`jnl`	Optimal Resizable Arrays. SIAM J. Comput. Robert E. Tarjan, Uri Zwick
2024	A*	`conf`	Tight approximability of MAX 2-SAT and relatives, under UGC. SODA Joshua Brakensiek, Neng Huang, Uri Zwick
2023	A*	`conf`	Improved girth approximation in weighted undirected graphs. SODA Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick
2023	A	`conf`	Optimal Energetic Paths for Electric Cars. ESA Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick
2023	J	`jnl`	Optimal energetic paths for electric cars. CoRR Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick
2023	—	`conf`	Optimal resizable arrays. SOSA Robert E. Tarjan, Uri Zwick
2023	A*	`conf`	Separating MAX 2-AND, MAX DI-CUT and MAX CUT. FOCS Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick
2023	J	`jnl`	Tight approximability of MAX 2-SAT and relatives, under UGC. CoRR Joshua Brakensiek, Neng Huang, Uri Zwick
2022	A*	`conf`	Algorithmic trade-offs for girth approximation in undirected graphs. SODA Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick
2022	J	`jnl`	Finding Strong Components Using Depth-First Search. CoRR Robert E. Tarjan, Uri Zwick
2022	J	`jnl`	Optimal resizable arrays. CoRR Robert E. Tarjan, Uri Zwick
2022	J	`jnl`	Separating MAX 2-AND, MAX DI-CUT and MAX CUT. CoRR Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick
2022	A*	`conf`	Simulating a stack using queues. SODA Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick
2021	A*	`conf`	On the Mysteries of MAX NAE-SAT. SODA Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick
2021	J	`jnl`	TheoretiCS. Bull. EATCS Javier Esparza, Uri Zwick
2020	J	`jnl`	On the Mysteries of MAX NAE-SAT. CoRR Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick
2020	J	`jnl`	Public vs. private randomness in simultaneous multi-party communication complexity. Theor. Comput. Sci. Orr Fischer, Rotem Oshman, Uri Zwick
2019	A*	`conf`	A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games. ICALP Dani Dorfman, Haim Kaplan, Uri Zwick
2019	A*	`conf`	A sort of an adversary. SODA Haim Kaplan, Or Zamir, Uri Zwick
2019	J	`jnl`	Adjacency Labeling Schemes and Induced-Universal Graphs. SIAM J. Discret. Math. Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
2019	A*	`conf`	Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. ICALP Mikkel Thorup, Or Zamir, Uri Zwick
2019	A*	`conf`	Faster STOC Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick
2019	A*	`conf`	Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. FOCS Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick
2019	J	`jnl`	Random k-out subgraph leaves only O(n/k) inter-component edges. CoRR Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick
2019	—	`conf`	Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. SOSA Haim Kaplan, László Kozma, Or Zamir, Uri Zwick
2018	A	`conf`	Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. ESA Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick
2018	J	`jnl`	Improved bounds for multipass pairing heaps and path-balanced binary search trees. CoRR Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick
2018	B	`conf`	Pairing heaps: the forward variant. MFCS Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick
2018	J	`jnl`	Selection from heaps, row-sorted matrices and X+Y using soft heaps. CoRR Haim Kaplan, László Kozma, Or Zamir, Uri Zwick
2017	J	`jnl`	Hollow Heaps. ACM Trans. Algorithms Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick
2017	J	`jnl`	Pairing heaps: the forward variant. CoRR Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick
2016	J	`jnl`	A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time. SIAM J. Comput. Liam Roditty, Uri Zwick
2016	A	`conf`	Bottleneck Paths and Trees and Deterministic Graphical Games. STACS Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick
2016	—	`ch.`	Color Coding. Encyclopedia of Algorithms Noga Alon, Raphael Yuster, Uri Zwick
2016	B	`conf`	Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity. SIROCCO Orr Fischer, Rotem Oshman, Uri Zwick
2016	A*	`conf`	Random-Edge Is Slower Than Random-Facet on Abstract Cubes. ICALP Thomas Dueholm Hansen, Uri Zwick
2015	J	`jnl`	A Forward-Backward Single-Source Shortest Paths Algorithm. SIAM J. Comput. David Bruce Wilson, Uri Zwick
2015	A*	`conf`	Adjacency Labeling Schemes and Induced-Universal Graphs. STOC Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
2015	A*	`conf`	An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm. STOC Thomas Dueholm Hansen, Uri Zwick
2015	—	`conf`	Hollow Heaps. ICALP (1) Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick
2015	J	`jnl`	Hollow Heaps. CoRR Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick
2015	A*	`conf`	The amortized cost of finding the minimum. SODA Haim Kaplan, Or Zamir, Uri Zwick
2014	J	`jnl`	A forward-backward single-source shortest paths algorithm. CoRR David Bruce Wilson, Uri Zwick
2014	J	`jnl`	Adjacency labeling schemes and induced-universal graphs. CoRR Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
2014	A*	`conf`	Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. SODA Thomas Dueholm Hansen, Haim Kaplan, Uri Zwick
2014	J	`jnl`	Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences. ACM Trans. Algorithms Amnon Ta-Shma, Uri Zwick
2014	J	`jnl`	Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games. CoRR Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
2014	J	`jnl`	Fibonacci Heaps Revisited. CoRR Haim Kaplan, Robert Endre Tarjan, Uri Zwick
2014	A*	`conf`	Improved upper bounds for Random-Edge and Random-Jump on abstract cubes. SODA Thomas Dueholm Hansen, Mike Paterson, Uri Zwick
2014	—	`conf`	Listing Triangles. ICALP (1) Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick
2014	J	`jnl`	Random-Facet and Random-Bland require subexponential time even for shortest paths. CoRR Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
2014	J	`jnl`	Union-Find with Constant Time Deletions. ACM Trans. Algorithms Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick
2013	A*	`conf`	A Forward-Backward Single-Source Shortest Paths Algorithm. FOCS David B. Wilson, Uri Zwick
2013	J	`jnl`	All-pairs shortest paths in J. ACM Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick
2013	J	`jnl`	Soft Heaps Simplified. SIAM J. Comput. Haim Kaplan, Robert Endre Tarjan, Uri Zwick
2013	J	`jnl`	Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor. J. ACM Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick
2012	J	`jnl`	Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. SIAM J. Comput. Liam Roditty, Uri Zwick
2012	J	`jnl`	Replacement paths and ACM Trans. Algorithms Liam Roditty, Uri Zwick
2011	A*	`conf`	A subexponential lower bound for the Random Facet algorithm for Parity Games. SODA Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
2011	J	`jnl`	All-Pairs Bottleneck Paths in Vertex Weighted Graphs. Algorithmica Asaf Shapira, Raphael Yuster, Uri Zwick
2011	J	`jnl`	All-Pairs Shortest Paths in O(n CoRR Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick
2011	A*	`conf`	Collapse. SODA Günter Rote, Uri Zwick
2011	J	`jnl`	On Dynamic Shortest Paths Problems. Algorithmica Liam Roditty, Uri Zwick
2011	J	`jnl`	On the Approximability of Reachability-Preserving Network Orientations. Internet Math. Michael Elberfeld, Vineet Bafna, Iftah Gamzu, Alexander Medvedovsky, Danny Segev, Dana Silverbush, Uri Zwick, Roded Sharan
2011	A	`conf`	Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. ICS Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick
2011	A*	`conf`	Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. STOC Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
2010	A*	`conf`	All-Pairs Shortest Paths in O(n FOCS Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick
2010	J	`jnl`	Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. ACM Trans. Algorithms Omid Madani, Mikkel Thorup, Uri Zwick
2010	J	`jnl`	Efficient algorithms for the 2-gathering problem. ACM Trans. Algorithms Alon Shalita, Uri Zwick
2010	—	`conf`	Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles. ISAAC (1) Thomas Dueholm Hansen, Uri Zwick
2010	J	`jnl`	Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor CoRR Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick
2009	A*	`conf`	A simpler implementation and analysis of Chazelle's soft heaps. SODA Haim Kaplan, Uri Zwick
2009	A*	`conf`	Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. SODA Omid Madani, Mikkel Thorup, Uri Zwick
2009	A*	`conf`	Efficient algorithms for the 2-gathering problem. SODA Alon Shalita, Uri Zwick
2009	J	`jnl`	Maximum Overhang. Am. Math. Mon. Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick
2009	J	`jnl`	Overhang. Am. Math. Mon. Mike Paterson, Uri Zwick
2008	J	`jnl`	A Deterministic Subexponential Algorithm for Solving Parity Games. SIAM J. Comput. Marcin Jurdzinski, Mike Paterson, Uri Zwick
2008	C	`conf`	An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks. WABI Alexander Medvedovsky, Vineet Bafna, Uri Zwick, Roded Sharan
2008	J	`jnl`	An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem. J. Graph Algorithms Appl. Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick
2008	—	`ch.`	Color Coding. Encyclopedia of Algorithms Noga Alon, Raphael Yuster, Uri Zwick
2008	J	`jnl`	Improved Dynamic Reachability Algorithms for Directed Graphs. SIAM J. Comput. Liam Roditty, Uri Zwick
2008	A*	`conf`	Maximum overhang. SODA Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick
2008	J	`jnl`	Roundtrip spanners and roundtrip routing in directed graphs. ACM Trans. Algorithms Liam Roditty, Mikkel Thorup, Uri Zwick
2008	Misc	`conf`	Simple Stochastic Games, Mean Payoff Games, Parity Games. CSR Uri Zwick
2007	A*	`conf`	All-pairs bottleneck paths in vertex weighted graphs. SODA Asaf Shapira, Raphael Yuster, Uri Zwick
2007	A*	`conf`	Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. SODA Amnon Ta-Shma, Uri Zwick
2007	A*	`conf`	Maximum matching in graphs with an excluded minor. SODA Raphael Yuster, Uri Zwick
2007	B	`conf`	New Bounds for the Nearly Equitable Edge Coloring Problem. ISAAC Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick
2006	J	`jnl`	A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths. Algorithmica Uri Zwick
2006	A*	`conf`	A deterministic subexponential algorithm for solving parity games. SODA Marcin Jurdzinski, Mike Paterson, Uri Zwick
2006	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings APPROX-RANDOM Josep Díaz, Klaus Jansen, José D. P. Rolim, Uri Zwick
2006	J	`jnl`	Melding priority queues. ACM Trans. Algorithms Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
2006	J	`jnl`	Multicriteria Global Minimum Cuts. Algorithmica Amitai Armon, Uri Zwick
2006	A*	`conf`	Overhang. SODA Mike Paterson, Uri Zwick
2006	A*	`conf`	Spanners and emulators with sublinear distance errors. SODA Mikkel Thorup, Uri Zwick
2005	A*	`conf`	Answering distance queries in directed graphs using fast matrix multiplication. FOCS Raphael Yuster, Uri Zwick
2005	J	`jnl`	Approximate distance oracles. J. ACM Mikkel Thorup, Uri Zwick
2005	J	`jnl`	Approximating MIN 2-SAT and MIN 3-SAT. Theory Comput. Syst. Adi Avidor, Uri Zwick
2005	A*	`conf`	Deterministic Constructions of Approximate Distance Oracles and Spanners. ICALP Liam Roditty, Mikkel Thorup, Uri Zwick
2005	J	`jnl`	Fast sparse matrix multiplication. ACM Trans. Algorithms Raphael Yuster, Uri Zwick
2005	B	`conf`	Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT. WAOA Adi Avidor, Ido Berkovitch, Uri Zwick
2005	A*	`conf`	Replacement Paths and ICALP Liam Roditty, Uri Zwick
2005	—	`conf`	Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT. APPROX-RANDOM Adi Avidor, Uri Zwick
2005	A*	`conf`	Union-Find with Constant Time Deletions. ICALP Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick
2004	B	`conf`	A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths. ISAAC Uri Zwick
2004	A*	`conf`	A fully dynamic reachability algorithm for directed graphs with an almost linear update time. STOC Liam Roditty, Uri Zwick
2004	A*	`conf`	Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. SODA Raphael Yuster, Uri Zwick
2004	A*	`conf`	Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. FOCS Liam Roditty, Uri Zwick
2004	A	`conf`	Fast Sparse Matrix Multiplication. ESA Raphael Yuster, Uri Zwick
2004	J	`jnl`	MAX CUT in cubic graphs. J. Algorithms Eran Halperin, Dror Livnat, Uri Zwick
2004	A*	`conf`	Meldable RAM priority queues and minimum directed spanning trees. SODA Ran Mendelson, Mikkel Thorup, Uri Zwick
2004	—	`conf`	Melding Priority Queues. SWAT Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
2004	B	`conf`	Multicriteria Global Minimum Cuts. ISAAC Amitai Armon, Uri Zwick
2004	A	`conf`	On Dynamic Shortest Paths Problems. ESA Liam Roditty, Uri Zwick
2003	A	`ed.`	Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings ESA Giuseppe Di Battista, Uri Zwick
2003	J	`jnl`	Connection caching: model and algorithms. J. Comput. Syst. Sci. Edith Cohen, Haim Kaplan, Uri Zwick
2003	J	`jnl`	Reachability and Distance Queries via 2-Hop Labels. SIAM J. Comput. Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick
2002	J	`jnl`	A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Random Struct. Algorithms Eran Halperin, Uri Zwick
2002	J	`jnl`	All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM Uri Zwick
2002	B	`conf`	Approximating MIN k-SAT. ISAAC Adi Avidor, Uri Zwick
2002	J	`jnl`	Cell Identification Codes for Tracking Mobile Users. Wirel. Networks Zohar Naor, Hanoch Levy, Uri Zwick
2002	J	`jnl`	Coloring k-colorable graphs using relatively small palettes. J. Algorithms Eran Halperin, Ram Nathaniel, Uri Zwick
2002	J	`jnl`	Competitive Analysis of the LRFU Paging Algorithm. Algorithmica Edith Cohen, Haim Kaplan, Uri Zwick
2002	A*	`conf`	Computer assisted proof of optimal approximability results. SODA Uri Zwick
2002	A*	`conf`	Improved Dynamic Reachability Algorithms for Directed Graphs. FOCS Liam Roditty, Uri Zwick
2002	B	`conf`	Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. IPCO Michael Lewin, Dror Livnat, Uri Zwick
2002	A*	`conf`	Jenga. SODA Uri Zwick
2002	A*	`conf`	MAX CUT in cubic graphs. SODA Eran Halperin, Dror Livnat, Uri Zwick
2002	A*	`conf`	Reachability and distance queries via 2-hop labels. SODA Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick
2002	A*	`conf`	Roundtrip spanners and roundtrip routing in directed graphs. SODA Liam Roditty, Mikkel Thorup, Uri Zwick
2001	B	`conf`	A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. IPCO Eran Halperin, Uri Zwick
2001	J	`jnl`	All-Pairs Small-Stretch Paths. J. Algorithms Edith Cohen, Uri Zwick
2001	A*	`conf`	Approximate distance oracles. STOC Mikkel Thorup, Uri Zwick
2001	J	`jnl`	Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. J. Algorithms Eran Halperin, Uri Zwick
2001	J	`jnl`	Coloring k-colorable graphs using relatively small palettes CoRR Eran Halperin, Ram Nathaniel, Uri Zwick
2001	A*	`conf`	Coloring k-colorable graphs using smaller palettes. SODA Eran Halperin, Ram Nathaniel, Uri Zwick
2001	A*	`conf`	Combinatorial approximation algorithms for the maximum directed cut problem. SODA Eran Halperin, Uri Zwick
2001	B	`conf`	Compact routing schemes. SPAA Mikkel Thorup, Uri Zwick
2001	B	`conf`	Competitive Analysis of the LRFU Paging Algorithm. WADS Edith Cohen, Haim Kaplan, Uri Zwick
2001	J	`jnl`	Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms. SIAM J. Discret. Math. Noga Alon, Benny Sudakov, Uri Zwick
2001	A*	`conf`	Constructing worst case instances for semidefinite programming based approximation algorithms. SODA Noga Alon, Benny Sudakov, Uri Zwick
2001	A	`conf`	Exact and Approximate Distances in Graphs - A Survey. ESA Uri Zwick
2001	J	`jnl`	Median Selection Requires (2+epsilon)n Comparisons. SIAM J. Discret. Math. Dorit Dor, Uri Zwick
2001	J	`jnl`	On Lower Bounds for Selecting the Median. SIAM J. Discret. Math. Dorit Dor, Johan Håstad, Staffan Ulfberg, Uri Zwick
2001	J	`jnl`	Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests. J. Algorithms Shay Halperin, Uri Zwick
2001	—	`conf`	Semidefinite Programming Based Approximation Algorithms. FSTTCS Uri Zwick
2001	J	`jnl`	Which bases admit non-trivial shrinkage of formulae? Comput. Complex. Hana Chockler, Uri Zwick
2001	A*	`conf`	Which formulae shrink under random restrictions? SODA Hana Chockler, Uri Zwick
2000	J	`jnl`	All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication CoRR Uri Zwick
2000	J	`jnl`	All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication Electron. Colloquium Comput. Complex. Uri Zwick
2000	J	`jnl`	All-Pairs Almost Shortest Paths. SIAM J. Comput. Dorit Dor, Shay Halperin, Uri Zwick
2000	B	`conf`	Connection caching under vaious models of communication. SPAA Edith Cohen, Haim Kaplan, Uri Zwick
1999	A*	`conf`	All Pairs Lightest Shortest Paths. STOC Uri Zwick
1999	A*	`conf`	All Pairs Shortest Paths in Undirected Graphs with Integer Weights. FOCS Avi Shoshan, Uri Zwick
1999	B	`conf`	Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. IPCO Eran Halperin, Uri Zwick
1999	A*	`conf`	Connection Caching. STOC Edith Cohen, Haim Kaplan, Uri Zwick
1999	A*	`conf`	Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems. STOC Uri Zwick
1999	J	`jnl`	SOKOBAN and other motion planning problems. Comput. Geom. Dorit Dor, Uri Zwick
1999	J	`jnl`	Selecting the Median. SIAM J. Comput. Dorit Dor, Uri Zwick
1999	J	`jnl`	Spatial Codes and the Hardness of String Folding Problems. J. Comput. Biol. Ashwin Nayak, Alistair Sinclair, Uri Zwick
1998	A*	`conf`	All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms. FOCS Uri Zwick
1998	A*	`conf`	Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint. SODA Uri Zwick
1998	A*	`conf`	Finding Almost-Satisfying Assignments. STOC Uri Zwick
1998	A*	`conf`	Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). SODA Ashwin Nayak, Alistair Sinclair, Uri Zwick
1997	A*	`conf`	A 7/8-Approximation Algorithm for MAX 3SAT? FOCS Howard J. Karloff, Uri Zwick
1997	J	`jnl`	All Pairs Almost Shortest Paths Electron. Colloquium Comput. Complex. Dorit Dor, Shay Halperin, Uri Zwick
1997	A*	`conf`	All-Pairs Small-Stretch Paths. SODA Edith Cohen, Uri Zwick
1997	J	`jnl`	Amplification by Read-Once Formulas. SIAM J. Comput. Moshe Dubiner, Uri Zwick
1997	J	`jnl`	Finding Even Cycles Even Faster. SIAM J. Discret. Math. Raphael Yuster, Uri Zwick
1997	J	`jnl`	Finding and Counting Given Length Cycles. Algorithmica Noga Alon, Raphael Yuster, Uri Zwick
1997	A	`conf`	The Communication Complexity of the Universal Relation. CCC Gábor Tardos, Uri Zwick
1996	J	`jnl`	A Note on Busy Beavers and Other Creatures. Math. Syst. Theory Amir M. Ben-Amram, Bryant A. Julstrom, Uri Zwick
1996	A*	`conf`	All Pairs Almost Shortest Paths. FOCS Dorit Dor, Shay Halperin, Uri Zwick
1996	J	`jnl`	An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM. J. Comput. Syst. Sci. Shay Halperin, Uri Zwick
1996	J	`jnl`	Finding The alpha n-Th Largest Element. Comb. Dorit Dor, Uri Zwick
1996	J	`jnl`	Growth Functions and Automatic Groups. Exp. Math. David B. A. Epstein, Anthony R. lano-Fletcher, Uri Zwick
1996	A*	`conf`	Median Selection Requires (2+epsilon)n Comparisons. FOCS Dorit Dor, Uri Zwick
1996	J	`jnl`	On the Number of ANDs Versus the Number of ORs in Monotone Boolean Circuits. Inf. Process. Lett. Uri Zwick
1996	A*	`conf`	Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems. SODA Shay Halperin, Uri Zwick
1996	J	`jnl`	The Complexity of Mean Payoff Games on Graphs. Theor. Comput. Sci. Uri Zwick, Mike Paterson
1995	J	`jnl`	Color-Coding. J. ACM Noga Alon, Raphael Yuster, Uri Zwick
1995	—	`conf`	Finding percentile elements. ISTCS Dorit Dor, Uri Zwick
1995	—	`conf`	Looking for MUM and DAD: Text-Text Comparisons Do Help. FSTTCS Mike Paterson, Shlomit Tassa, Uri Zwick
1995	—	`conf`	Optimal deterministic approximate parallel prefix sums and their applications. ISTCS Tal Goldberg, Uri Zwick
1995	J	`jnl`	Selecting the Median Electron. Colloquium Comput. Complex. Dorit Dor, Uri Zwick
1995	A*	`conf`	Selecting the Median. SODA Dorit Dor, Uri Zwick
1995	J	`jnl`	The Complexity of Mean Payoff Games on Graphs Electron. Colloquium Comput. Complex. Uri Zwick, Mike Paterson
1995	Misc	`conf`	The Complexity of Mean Payoff Games. COCOON Uri Zwick, Mike Paterson
1995	J	`jnl`	The Smallest Networks on Which the Ford-Fulkerson Maximum Flow Procedure may Fail to Terminate. Theor. Comput. Sci. Uri Zwick
1995	J	`jnl`	Tighter Lower Bounds on the Exact Complexity of String Matching. SIAM J. Comput. Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick
1994	B	`conf`	An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract). SPAA Shay Halperin, Uri Zwick
1994	J	`jnl`	Color-Coding Electron. Colloquium Comput. Complex. Noga Alon, Raphael Yuster, Uri Zwick
1994	A*	`conf`	Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. STOC Noga Alon, Raphael Yuster, Uri Zwick
1994	J	`jnl`	Faster Parallel String Matching via Larger Deterministic Samples. J. Algorithms Tal Goldberg, Uri Zwick
1994	A*	`conf`	Finding Even Cycles Even Faster. ICALP Raphael Yuster, Uri Zwick
1994	A	`conf`	Finding and Counting Given Length Cycles (Extended Abstract). ESA Noga Alon, Raphael Yuster, Uri Zwick
1994	J	`jnl`	How Do Read-Once Formulae Shrink? Comb. Probab. Comput. Moshe Dubiner, Uri Zwick
1993	J	`jnl`	Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication. Comput. Complex. Mike Paterson, Uri Zwick
1993	J	`jnl`	Shrinkage of de Morgan Formulae under Restriction. Random Struct. Algorithms Mike Paterson, Uri Zwick
1993	J	`jnl`	The Memory Game. Theor. Comput. Sci. Uri Zwick, Mike Paterson
1993	—	`conf`	Which Patterns are Hard to Find? ISTCS Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick
1992	A*	`conf`	Amplification and Percolation FOCS Moshe Dubiner, Uri Zwick
1992	A*	`conf`	Shallow Multiplication Circuits and Wise Financial Investments STOC Mike Paterson, Uri Zwick
1991	J	`jnl`	A 4n Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions. SIAM J. Comput. Uri Zwick
1991	J	`jnl`	An Extension of Khrapchenko's Theorem. Inf. Process. Lett. Uri Zwick
1991	C	`conf`	Shallow multiplication circuits. IEEE Symposium on Computer Arithmetic Michael S. Paterson, Uri Zwick
1991	A*	`conf`	Shrinkage of de~Morgan formulae under restriction FOCS Mike Paterson, Uri Zwick
1990	A*	`conf`	Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions FOCS Mike Paterson, Nicholas Pippenger, Uri Zwick
1989	J	`jnl`	On Neciporuk's Theorem for Branching Programs. Theor. Comput. Sci. Noga Alon, Uri Zwick