default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUri Zwick
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j70]Robert E. Tarjan, Uri Zwick:
Finding strong components using depth-first search. Eur. J. Comb. 119: 103815 (2024)- [c111]Joshua Brakensiek, Neng Huang, Uri Zwick:
Tight approximability of MAX 2-SAT and relatives, under UGC. SODA 2024: 1328-1344 - [c110]Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick:
Minimum-cost paths for electric cars. SOSA 2024: 374-382 - [i26]Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick:
Minimum-cost paths for electric cars. CoRR abs/2403.16936 (2024) - 2023
- [c109]Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Optimal Energetic Paths for Electric Cars. ESA 2023: 42:1-42:17 - [c108]Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
Separating MAX 2-AND, MAX DI-CUT and MAX CUT. FOCS 2023: 234-252 - [c107]Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick:
Improved girth approximation in weighted undirected graphs. SODA 2023: 2242-2255 - [c106]Robert E. Tarjan, Uri Zwick:
Optimal resizable arrays. SOSA 2023: 285-304 - [i25]Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Optimal energetic paths for electric cars. CoRR abs/2305.19015 (2023) - [i24]Joshua Brakensiek, Neng Huang, Uri Zwick:
Tight approximability of MAX 2-SAT and relatives, under UGC. CoRR abs/2310.12911 (2023) - 2022
- [c105]Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick:
Algorithmic trade-offs for girth approximation in undirected graphs. SODA 2022: 1471-1492 - [c104]Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick:
Simulating a stack using queues. SODA 2022: 1901-1924 - [i23]Robert E. Tarjan, Uri Zwick:
Finding Strong Components Using Depth-First Search. CoRR abs/2201.07197 (2022) - [i22]Robert E. Tarjan, Uri Zwick:
Optimal resizable arrays. CoRR abs/2211.11009 (2022) - [i21]Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
Separating MAX 2-AND, MAX DI-CUT and MAX CUT. CoRR abs/2212.11191 (2022) - 2021
- [j69]Javier Esparza, Uri Zwick:
TheoretiCS. Bull. EATCS 135 (2021) - [c103]Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
On the Mysteries of MAX NAE-SAT. SODA 2021: 484-503 - 2020
- [j68]Orr Fischer, Rotem Oshman, Uri Zwick:
Public vs. private randomness in simultaneous multi-party communication complexity. Theor. Comput. Sci. 810: 72-81 (2020) - [i20]Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
On the Mysteries of MAX NAE-SAT. CoRR abs/2009.10677 (2020)
2010 – 2019
- 2019
- [j67]Stephen Alstrup, Haim Kaplan, Mikkel Thorup
, Uri Zwick:
Adjacency Labeling Schemes and Induced-Universal Graphs. SIAM J. Discret. Math. 33(1): 116-137 (2019) - [c102]Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick:
Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. FOCS 2019: 896-909 - [c101]Mikkel Thorup, Or Zamir, Uri Zwick:
Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. ICALP 2019: 95:1-95:13 - [c100]Dani Dorfman, Haim Kaplan, Uri Zwick:
A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games. ICALP 2019: 114:1-114:14 - [c99]Haim Kaplan, László Kozma, Or Zamir, Uri Zwick:
Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. SOSA 2019: 5:1-5:21 - [c98]Haim Kaplan, Or Zamir, Uri Zwick:
A sort of an adversary. SODA 2019: 1291-1310 - [c97]Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick:
Faster k-SAT algorithms using biased-PPSZ. STOC 2019: 578-589 - [i19]Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick:
Random k-out subgraph leaves only O(n/k) inter-component edges. CoRR abs/1909.11147 (2019) - 2018
- [c96]Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick:
Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. ESA 2018: 24:1-24:13 - [c95]Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick:
Pairing heaps: the forward variant. MFCS 2018: 13:1-13:14 - [i18]Haim Kaplan, László Kozma, Or Zamir, Uri Zwick:
Selection from heaps, row-sorted matrices and X+Y using soft heaps. CoRR abs/1802.07041 (2018) - [i17]Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick:
Improved bounds for multipass pairing heaps and path-balanced binary search trees. CoRR abs/1806.08692 (2018) - 2017
- [j66]Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Hollow Heaps. ACM Trans. Algorithms 13(3): 42:1-42:27 (2017) - [i16]Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick:
Pairing heaps: the forward variant. CoRR abs/1709.01152 (2017) - 2016
- [j65]Liam Roditty, Uri Zwick:
A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time. SIAM J. Comput. 45(3): 712-733 (2016) - [c94]Thomas Dueholm Hansen, Uri Zwick:
Random-Edge Is Slower Than Random-Facet on Abstract Cubes. ICALP 2016: 51:1-51:14 - [c93]Orr Fischer, Rotem Oshman, Uri Zwick:
Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity. SIROCCO 2016: 60-74 - [c92]Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick:
Bottleneck Paths and Trees and Deterministic Graphical Games. STACS 2016: 27:1-27:13 - [r2]Noga Alon, Raphael Yuster, Uri Zwick:
Color Coding. Encyclopedia of Algorithms 2016: 335-338 - 2015
- [j64]David Bruce Wilson, Uri Zwick:
A Forward-Backward Single-Source Shortest Paths Algorithm. SIAM J. Comput. 44(3): 698-739 (2015) - [c91]Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick:
Hollow Heaps. ICALP (1) 2015: 689-700 - [c90]Haim Kaplan, Or Zamir, Uri Zwick:
The amortized cost of finding the minimum. SODA 2015: 757-768 - [c89]Thomas Dueholm Hansen, Uri Zwick:
An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm. STOC 2015: 209-218 - [c88]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency Labeling Schemes and Induced-Universal Graphs. STOC 2015: 625-634 - [i15]Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Hollow Heaps. CoRR abs/1510.06535 (2015) - 2014
- [j63]Amnon Ta-Shma, Uri Zwick:
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences. ACM Trans. Algorithms 10(3): 12:1-12:15 (2014) - [j62]Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick:
Union-Find with Constant Time Deletions. ACM Trans. Algorithms 11(1): 6:1-6:28 (2014) - [c87]Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick:
Listing Triangles. ICALP (1) 2014: 223-234 - [c86]Thomas Dueholm Hansen, Haim Kaplan, Uri Zwick:
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. SODA 2014: 847-860 - [c85]Thomas Dueholm Hansen, Mike Paterson, Uri Zwick:
Improved upper bounds for Random-Edge and Random-Jump on abstract cubes. SODA 2014: 874-881 - [i14]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency labeling schemes and induced-universal graphs. CoRR abs/1404.3391 (2014) - [i13]David Bruce Wilson, Uri Zwick:
A forward-backward single-source shortest paths algorithm. CoRR abs/1405.7619 (2014) - [i12]Haim Kaplan, Robert Endre Tarjan, Uri Zwick:
Fibonacci Heaps Revisited. CoRR abs/1407.5750 (2014) - [i11]Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick:
Random-Facet and Random-Bland require subexponential time even for shortest paths. CoRR abs/1410.7530 (2014) - [i10]Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick:
Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games. CoRR abs/1410.7871 (2014) - 2013
- [j61]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. J. ACM 60(1): 1:1-1:16 (2013) - [j60]Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-pairs shortest paths in O(n2) time with high probability. J. ACM 60(4): 26:1-26:25 (2013) - [j59]Haim Kaplan, Robert Endre Tarjan, Uri Zwick:
Soft Heaps Simplified. SIAM J. Comput. 42(4): 1660-1673 (2013) - [c84]David B. Wilson, Uri Zwick:
A Forward-Backward Single-Source Shortest Paths Algorithm. FOCS 2013: 707-716 - 2012
- [j58]Liam Roditty, Uri Zwick:
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. SIAM J. Comput. 41(3): 670-683 (2012) - [j57]Liam Roditty, Uri Zwick:
Replacement paths and k simple shortest paths in unweighted directed graphs. ACM Trans. Algorithms 8(4): 33:1-33:11 (2012) - 2011
- [j56]Asaf Shapira, Raphael Yuster, Uri Zwick:
All-Pairs Bottleneck Paths in Vertex Weighted Graphs. Algorithmica 59(4): 621-633 (2011) - [j55]Liam Roditty, Uri Zwick:
On Dynamic Shortest Paths Problems. Algorithmica 61(2): 389-401 (2011) - [j54]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 Math. 7(4): 209-232 (2011) - [c83]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: 253-263 - [c82]Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick:
A subexponential lower bound for the Random Facet algorithm for Parity Games. SODA 2011: 202-216 - [c81]Günter Rote, Uri Zwick:
Collapse. SODA 2011: 603-613 - [c80]Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick:
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. STOC 2011: 283-292 - [i9]Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-Pairs Shortest Paths in O(n2) time with high probability. CoRR abs/1105.3770 (2011) - 2010
- [j53]Omid Madani, Mikkel Thorup, Uri Zwick:
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. ACM Trans. Algorithms 6(2): 33:1-33:25 (2010) - [j52]Alon Shalita, Uri Zwick:
Efficient algorithms for the 2-gathering problem. ACM Trans. Algorithms 6(2): 34:1-34:20 (2010) - [c79]Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-Pairs Shortest Paths in O(n2) Time with High Probability. FOCS 2010: 663-672 - [c78]Thomas Dueholm Hansen, Uri Zwick:
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles. ISAAC (1) 2010: 415-426 - [i8]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 abs/1008.0530 (2010)
2000 – 2009
- 2009
- [j51]Mike Paterson, Uri Zwick:
Overhang. Am. Math. Mon. 116(1): 19-44 (2009) - [j50]Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick:
Maximum Overhang. Am. Math. Mon. 116(9): 763-787 (2009) - [c77]Alon Shalita, Uri Zwick:
Efficient algorithms for the 2-gathering problem. SODA 2009: 96-105 - [c76]Haim Kaplan, Uri Zwick:
A simpler implementation and analysis of Chazelle's soft heaps. SODA 2009: 477-485 - [c75]Omid Madani, Mikkel Thorup, Uri Zwick:
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. SODA 2009: 958-967 - 2008
- [j49]Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick:
An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem. J. Graph Algorithms Appl. 12(4): 383-399 (2008) - [j48]Liam Roditty, Uri Zwick:
Improved Dynamic Reachability Algorithms for Directed Graphs. SIAM J. Comput. 37(5): 1455-1471 (2008) - [j47]Marcin Jurdzinski, Mike Paterson, Uri Zwick:
A Deterministic Subexponential Algorithm for Solving Parity Games. SIAM J. Comput. 38(4): 1519-1532 (2008) - [j46]Liam Roditty, Mikkel Thorup, Uri Zwick:
Roundtrip spanners and roundtrip routing in directed graphs. ACM Trans. Algorithms 4(3): 29:1-29:17 (2008) - [c74]Uri Zwick:
Simple Stochastic Games, Mean Payoff Games, Parity Games. CSR 2008: 29 - [c73]Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick:
Maximum overhang. SODA 2008: 756-765 - [c72]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: 222-232 - [r1]Noga Alon, Raphael Yuster, Uri Zwick:
Color Coding. Encyclopedia of Algorithms 2008 - 2007
- [c71]Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick:
New Bounds for the Nearly Equitable Edge Coloring Problem. ISAAC 2007: 280-291 - [c70]Raphael Yuster, Uri Zwick:
Maximum matching in graphs with an excluded minor. SODA 2007: 108-117 - [c69]Amnon Ta-Shma, Uri Zwick:
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. SODA 2007: 599-608 - [c68]Asaf Shapira, Raphael Yuster, Uri Zwick:
All-pairs bottleneck paths in vertex weighted graphs. SODA 2007: 978-985 - 2006
- [j45]Amitai Armon, Uri Zwick:
Multicriteria Global Minimum Cuts. Algorithmica 46(1): 15-26 (2006) - [j44]Uri Zwick:
A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths. Algorithmica 46(2): 181-192 (2006) - [j43]Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick:
Melding priority queues. ACM Trans. Algorithms 2(4): 535-556 (2006) - [c67]Marcin Jurdzinski, Mike Paterson, Uri Zwick:
A deterministic subexponential algorithm for solving parity games. SODA 2006: 117-123 - [c66]Mike Paterson, Uri Zwick:
Overhang. SODA 2006: 231-240 - [c65]Mikkel Thorup, Uri Zwick:
Spanners and emulators with sublinear distance errors. SODA 2006: 802-809 - [e2]Josep Díaz, Klaus Jansen, José D. P. Rolim, Uri Zwick:
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. Lecture Notes in Computer Science 4110, Springer 2006, ISBN 3-540-38044-2 [contents] - 2005
- [j42]Mikkel Thorup, Uri Zwick:
Approximate distance oracles. J. ACM 52(1): 1-24 (2005) - [j41]Adi Avidor, Uri Zwick:
Approximating MIN 2-SAT and MIN 3-SAT. Theory Comput. Syst. 38(3): 329-345 (2005) - [j40]Raphael Yuster, Uri Zwick:
Fast sparse matrix multiplication. ACM Trans. Algorithms 1(1): 2-13 (2005) - [c64]Adi Avidor, Uri Zwick:
Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT. APPROX-RANDOM 2005: 14-25 - [c63]Raphael Yuster, Uri Zwick:
Answering distance queries in directed graphs using fast matrix multiplication. FOCS 2005: 389-396 - [c62]Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick:
Union-Find with Constant Time Deletions. ICALP 2005: 78-89 - [c61]Liam Roditty, Uri Zwick:
Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. ICALP 2005: 249-260 - [c60]Liam Roditty, Mikkel Thorup, Uri Zwick:
Deterministic Constructions of Approximate Distance Oracles and Spanners. ICALP 2005: 261-272 - [c59]Adi Avidor, Ido Berkovitch, Uri Zwick:
Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT. WAOA 2005: 27-40 - 2004
- [j39]Eran Halperin, Dror Livnat, Uri Zwick:
MAX CUT in cubic graphs. J. Algorithms 53(2): 169-185 (2004) - [c58]Liam Roditty, Uri Zwick:
On Dynamic Shortest Paths Problems. ESA 2004: 580-591 - [c57]Raphael Yuster, Uri Zwick:
Fast Sparse Matrix Multiplication. ESA 2004: 604-615 - [c56]Liam Roditty, Uri Zwick:
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. FOCS 2004: 499-508 - [c55]Amitai Armon, Uri Zwick:
Multicriteria Global Minimum Cuts. ISAAC 2004: 65-76 - [c54]Uri Zwick:
A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths. ISAAC 2004: 921-932 - [c53]Ran Mendelson, Mikkel Thorup, Uri Zwick:
Meldable RAM priority queues and minimum directed spanning trees. SODA 2004: 40-48 - [c52]Raphael Yuster, Uri Zwick:
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. SODA 2004: 254-260 - [c51]Liam Roditty, Uri Zwick:
A fully dynamic reachability algorithm for directed graphs with an almost linear update time. STOC 2004: 184-191 - [c50]Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick:
Melding Priority Queues. SWAT 2004: 223-235 - 2003
- [j38]Edith Cohen, Haim Kaplan, Uri Zwick:
Connection caching: model and algorithms. J. Comput. Syst. Sci. 67(1): 92-126 (2003) - [j37]Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick:
Reachability and Distance Queries via 2-Hop Labels. SIAM J. Comput. 32(5): 1338-1355 (2003) - [e1]Giuseppe Di Battista, Uri Zwick:
Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings. Lecture Notes in Computer Science 2832, Springer 2003, ISBN 3-540-20064-9 [contents] - 2002
- [j36]Edith Cohen, Haim Kaplan, Uri Zwick:
Competitive Analysis of the LRFU Paging Algorithm. Algorithmica 33(4): 511-516 (2002) - [j35]Uri Zwick:
All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM 49(3): 289-317 (2002) - [j34]