Search results for "Uri Zwick"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Asaf Shapira, Raphael Yuster, Uri Zwick	All-Pairs Bottleneck Paths in Vertex Weighted Graphs.	Algorithmica	2011	DBLP DOI BibTeX RDF
1	Liam Roditty, Uri Zwick	On Dynamic Shortest Paths Problems.	Algorithmica	2011	DBLP DOI BibTeX RDF
1	Michael Elberfeld, Vineet Bafna, Iftah Gamzu, Alexander Medvedovsky, Danny Segev, Dana Silverbush, Uri Zwick, Roded Sharan	On the Approximability of Reachability-Preserving Network Orientations.	Internet Mathematics	2011	DBLP DOI BibTeX RDF
1	Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick	All-Pairs Shortest Paths in $O(n^2)$ time with high probability	CoRR	2011	DBLP BibTeX RDF
1	Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick	A subexponential lower bound for the Random Facet algorithm for Parity Games.	SODA	2011	DBLP BibTeX RDF
1	Günter Rote, Uri Zwick	Collapse.	SODA	2011	DBLP BibTeX RDF
1	Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick	Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor.	ICS	2011	DBLP BibTeX RDF
1	Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick	Subexponential lower bounds for randomized pivoting rules for the simplex algorithm.	STOC	2011	DBLP DOI BibTeX RDF
1	Alon Shalita, Uri Zwick	Efficient algorithms for the 2-gathering problem.	ACM Transactions on Algorithms	2010	DBLP DOI BibTeX RDF
1	Omid Madani, Mikkel Thorup, Uri Zwick	Discounted deterministic Markov decision processes and discounted all-pairs shortest paths.	ACM Transactions on Algorithms	2010	DBLP DOI BibTeX RDF
1	Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick	Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor	CoRR	2010	DBLP BibTeX RDF
1	Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick	All-Pairs Shortest Paths in O(n2) Time with High Probability.	FOCS	2010	DBLP DOI BibTeX RDF
1	Thomas Dueholm Hansen, Uri Zwick	Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles.	ISAAC	2010	DBLP DOI BibTeX RDF
1	Alon Shalita, Uri Zwick	Efficient algorithms for the 2-gathering problem.	SODA	2009	DBLP DOI BibTeX RDF
1	Haim Kaplan, Uri Zwick	A simpler implementation and analysis of Chazelle's soft heaps.	SODA	2009	DBLP DOI BibTeX RDF
1	Omid Madani, Mikkel Thorup, Uri Zwick	Discounted deterministic Markov decision processes and discounted all-pairs shortest paths.	SODA	2009	DBLP DOI BibTeX RDF
1	Liam Roditty, Mikkel Thorup, Uri Zwick	Roundtrip spanners and roundtrip routing in directed graphs.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	roundtrip, Routing, shortest paths, distances, spanners
1	Liam Roditty, Uri Zwick	Improved Dynamic Reachability Algorithms for Directed Graphs.	SIAM J. Comput.	2008	DBLP DOI BibTeX RDF
1	Marcin Jurdzinski, Mike Paterson, Uri Zwick	A Deterministic Subexponential Algorithm for Solving Parity Games.	SIAM J. Comput.	2008	DBLP DOI BibTeX RDF
1	Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick	An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem.	J. Graph Algorithms Appl.	2008	DBLP BibTeX RDF
1	Noga Alon, Raphael Yuster, Uri Zwick	Color Coding.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	Uri Zwick	Simple Stochastic Games, Mean Payoff Games, Parity Games.	CSR	2008	DBLP DOI BibTeX RDF
1	Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick	Maximum overhang.	SODA	2008	DBLP DOI BibTeX RDF
1	Alexander Medvedovsky, Vineet Bafna, Uri Zwick, Roded Sharan	An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks.	WABI	2008	DBLP DOI BibTeX RDF
1	Raphael Yuster, Uri Zwick	Maximum matching in graphs with an excluded minor.	SODA	2007	DBLP DOI BibTeX RDF
1	Asaf Shapira, Raphael Yuster, Uri Zwick	All-pairs bottleneck paths in vertex weighted graphs.	SODA	2007	DBLP DOI BibTeX RDF
1	Amnon Ta-Shma, Uri Zwick	Deterministic rendezvous, treasure hunts and strongly universal exploration sequences.	SODA	2007	DBLP DOI BibTeX RDF
1	Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick	New Bounds for the Nearly Equitable Edge Coloring Problem.	ISAAC	2007	DBLP DOI BibTeX RDF
1	Uri Zwick	A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths.	Algorithmica	2006	DBLP DOI BibTeX RDF
1	Amitai Armon, Uri Zwick	Multicriteria Global Minimum Cuts.	Algorithmica	2006	DBLP DOI BibTeX RDF
1	Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick	Melding priority queues.	ACM Transactions on Algorithms	2006	DBLP DOI BibTeX RDF	disjoint set union, minimum directed spanning trees, optimum branchings, word RAM model, Priority queues, heaps, union-find
1	Mikkel Thorup, Uri Zwick	Spanners and emulators with sublinear distance errors.	SODA	2006	DBLP DOI BibTeX RDF
1	Mike Paterson, Uri Zwick	Overhang.	SODA	2006	DBLP DOI BibTeX RDF
1	Marcin Jurdzinski, Mike Paterson, Uri Zwick	A deterministic subexponential algorithm for solving parity games.	SODA	2006	DBLP DOI BibTeX RDF
1	Josep Díaz, Klaus Jansen, José D. P. Rolim, Uri Zwick (eds.)	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	2006	DBLP BibTeX RDF
1	Raphael Yuster, Uri Zwick	Fast sparse matrix multiplication.	ACM Transactions on Algorithms	2005	DBLP DOI BibTeX RDF	Matrix multiplication, sparse matrices
1	Mikkel Thorup, Uri Zwick	Approximate distance oracles.	J. ACM	2005	DBLP DOI BibTeX RDF	Approximate distance oracles, distance queries, shortest paths, distances, spanners, distance labelings
1	Adi Avidor, Uri Zwick	Approximating MIN 2-SAT and MIN 3-SAT.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
1	Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick	Union-Find with Constant Time Deletions.	ICALP	2005	DBLP DOI BibTeX RDF
1	Liam Roditty, Mikkel Thorup, Uri Zwick	Deterministic Constructions of Approximate Distance Oracles and Spanners.	ICALP	2005	DBLP DOI BibTeX RDF
1	Liam Roditty, Uri Zwick	Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs.	ICALP	2005	DBLP DOI BibTeX RDF
1	Adi Avidor, Ido Berkovitch, Uri Zwick	Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT.	WAOA	2005	DBLP DOI BibTeX RDF
1	Adi Avidor, Uri Zwick	Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
1	Raphael Yuster, Uri Zwick	Answering distance queries in directed graphs using fast matrix multiplication.	FOCS	2005	DBLP DOI BibTeX RDF
1	Eran Halperin, Dror Livnat, Uri Zwick	MAX CUT in cubic graphs.	J. Algorithms	2004	DBLP DOI BibTeX RDF
1	Raphael Yuster, Uri Zwick	Fast Sparse Matrix Multiplication.	ESA	2004	DBLP DOI BibTeX RDF
1	Liam Roditty, Uri Zwick	On Dynamic Shortest Paths Problems.	ESA	2004	DBLP DOI BibTeX RDF
1	Raphael Yuster, Uri Zwick	Detecting short directed cycles using rectangular matrix multiplication and dynamic programming.	SODA	2004	DBLP DOI BibTeX RDF
1	Ran Mendelson, Mikkel Thorup, Uri Zwick	Meldable RAM priority queues and minimum directed spanning trees.	SODA	2004	DBLP DOI BibTeX RDF
1	Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick	Melding Priority Queues.	SWAT	2004	DBLP DOI BibTeX RDF
1	Liam Roditty, Uri Zwick	Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs.	FOCS	2004	DBLP DOI BibTeX RDF
1	Uri Zwick	A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths.	ISAAC	2004	DBLP DOI BibTeX RDF
1	Amitai Armon, Uri Zwick	Multicriteria Global Minimum Cuts.	ISAAC	2004	DBLP DOI BibTeX RDF
1	Liam Roditty, Uri Zwick	A fully dynamic reachability algorithm for directed graphs with an almost linear update time.	STOC	2004	DBLP DOI BibTeX RDF	directed graphs, reachability, transitive closure, dynamic graphs algorithms
1	Edith Cohen, Haim Kaplan, Uri Zwick	Connection caching: model and algorithms.	J. Comput. Syst. Sci.	2003	DBLP DOI BibTeX RDF
1	Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick	Reachability and Distance Queries via 2-Hop Labels.	SIAM J. Comput.	2003	DBLP DOI BibTeX RDF
1	Giuseppe Di Battista, Uri Zwick (eds.)	Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings	ESA	2003	DBLP BibTeX RDF
1	Edith Cohen, Haim Kaplan, Uri Zwick	Competitive Analysis of the LRFU Paging Algorithm.	Algorithmica	2002	DBLP DOI BibTeX RDF
1	Zohar Naor, Hanoch Levy, Uri Zwick	Cell Identification Codes for Tracking Mobile Users.	Wireless Networks	2002	DBLP DOI BibTeX RDF
1	Eran Halperin, Uri Zwick	A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems.	Random Struct. Algorithms	2002	DBLP DOI BibTeX RDF
1	Eran Halperin, Ram Nathaniel, Uri Zwick	Coloring k-colorable graphs using relatively small palettes.	J. Algorithms	2002	DBLP DOI BibTeX RDF
1	Uri Zwick	All pairs shortest paths using bridging sets and rectangular matrix multiplication.	J. ACM	2002	DBLP DOI BibTeX RDF	shortest paths, Matrix multiplication
1	Eran Halperin, Dror Livnat, Uri Zwick	MAX CUT in cubic graphs.	SODA	2002	DBLP DOI BibTeX RDF
1	Liam Roditty, Mikkel Thorup, Uri Zwick	Roundtrip spanners and roundtrip routing in directed graphs.	SODA	2002	DBLP DOI BibTeX RDF
1	Uri Zwick	Computer assisted proof of optimal approximability results.	SODA	2002	DBLP DOI BibTeX RDF
1	Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick	Reachability and distance queries via 2-hop labels.	SODA	2002	DBLP DOI BibTeX RDF
1	Uri Zwick	Jenga.	SODA	2002	DBLP DOI BibTeX RDF
1	Michael Lewin, Dror Livnat, Uri Zwick	Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems.	IPCO	2002	DBLP BibTeX RDF
1	Liam Roditty, Uri Zwick	Improved Dynamic Reachability Algorithms for Directed Graphs.	FOCS	2002	DBLP DOI BibTeX RDF
1	Adi Avidor, Uri Zwick	Approximating MIN k-SAT.	ISAAC	2002	DBLP DOI BibTeX RDF
1	Shay Halperin, Uri Zwick	Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests.	J. Algorithms	2001	DBLP DOI BibTeX RDF
1	Eran Halperin, Uri Zwick	Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs.	J. Algorithms	2001	DBLP DOI BibTeX RDF
1	Edith Cohen, Uri Zwick	All-Pairs Small-Stretch Paths.	J. Algorithms	2001	DBLP DOI BibTeX RDF
1	Hana Chockler, Uri Zwick	Which bases admit non-trivial shrinkage of formulae?	Computational Complexity	2001	DBLP DOI BibTeX RDF
1	Eran Halperin, Ram Nathaniel, Uri Zwick	Coloring k-colorable graphs using relatively small palettes	CoRR	2001	DBLP BibTeX RDF
1	Dorit Dor, Uri Zwick	Median Selection Requires (2+epsilon)n Comparisons.	SIAM J. Discrete Math.	2001	DBLP DOI BibTeX RDF
1	Noga Alon, Benny Sudakov, Uri Zwick	Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms.	SIAM J. Discrete Math.	2001	DBLP DOI BibTeX RDF
1	Dorit Dor, Johan Håstad, Staffan Ulfberg, Uri Zwick	On Lower Bounds for Selecting the Median.	SIAM J. Discrete Math.	2001	DBLP DOI BibTeX RDF
1	Uri Zwick	Exact and Approximate Distances in Graphs - A Survey.	ESA	2001	DBLP DOI BibTeX RDF
1	Hana Chockler, Uri Zwick	Which formulae shrink under random restrictions?	SODA	2001	DBLP DOI BibTeX RDF
1	Eran Halperin, Ram Nathaniel, Uri Zwick	Coloring k-colorable graphs using smaller palettes.	SODA	2001	DBLP DOI BibTeX RDF
1	Eran Halperin, Uri Zwick	Combinatorial approximation algorithms for the maximum directed cut problem.	SODA	2001	DBLP DOI BibTeX RDF
1	Noga Alon, Benny Sudakov, Uri Zwick	Constructing worst case instances for semidefinite programming based approximation algorithms.	SODA	2001	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan, Uri Zwick	Competitive Analysis of the LRFU Paging Algorithm.	WADS	2001	DBLP DOI BibTeX RDF
1	Mikkel Thorup, Uri Zwick	Compact routing schemes.	SPAA	2001	DBLP DOI BibTeX RDF
1	Eran Halperin, Uri Zwick	A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems.	IPCO	2001	DBLP DOI BibTeX RDF
1	Uri Zwick	Semidefinite Programming Based Approximation Algorithms.	FSTTCS	2001	DBLP DOI BibTeX RDF
1	Mikkel Thorup, Uri Zwick	Approximate distance oracles.	STOC	2001	DBLP DOI BibTeX RDF
1	Uri Zwick	All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication	Electronic Colloquium on Computational Complexity (ECCC)	2000	DBLP BibTeX RDF
1	Uri Zwick	All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication	CoRR	2000	DBLP BibTeX RDF
1	Dorit Dor, Shay Halperin, Uri Zwick	All-Pairs Almost Shortest Paths.	SIAM J. Comput.	2000	DBLP DOI BibTeX RDF
1	Edith Cohen, Haim Kaplan, Uri Zwick	Connection caching under vaious models of communication.	SPAA	2000	DBLP DOI BibTeX RDF
1	Ashwin Nayak, Alistair Sinclair, Uri Zwick	Spatial Codes and the Hardness of String Folding Problems.	Journal of Computational Biology	1999	DBLP BibTeX RDF
1	Dorit Dor, Uri Zwick	SOKOBAN and other motion planning problems.	Comput. Geom.	1999	DBLP DOI BibTeX RDF
1	Dorit Dor, Uri Zwick	Selecting the Median.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Eran Halperin, Uri Zwick	Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs.	IPCO	1999	DBLP DOI BibTeX RDF
1	Avi Shoshan, Uri Zwick	All Pairs Shortest Paths in Undirected Graphs with Integer Weights.	FOCS	1999	DBLP DOI BibTeX RDF	shortest paths, graph algorithms, matrix multiplication
1	Edith Cohen, Haim Kaplan, Uri Zwick	Connection Caching.	STOC	1999	DBLP DOI BibTeX RDF
1	Uri Zwick	All Pairs Lightest Shortest Paths.	STOC	1999	DBLP DOI BibTeX RDF
1	Uri Zwick	Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems.	STOC	1999	DBLP DOI BibTeX RDF

Publications of "Uri Zwick" ( http://dblp.L3S.de/Authors/Uri_Zwick )