Uri Zwick

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 43

Top Venues

Publications

Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
Minimum-cost paths for electric cars. SOSA (2024)
Joshua Brakensiek, Neng Huang, Uri Zwick
Tight approximability of MAX 2-SAT and relatives, under UGC. SODA (2024)
Robert E. Tarjan, Uri Zwick
Finding strong components using depth-first search. Eur. J. Comb. 119 (2024)
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
Minimum-cost paths for electric cars. CoRR (2024)
Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick
Improved girth approximation in weighted undirected graphs. SODA (2023)
Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick
Separating MAX 2-AND, MAX DI-CUT and MAX CUT. FOCS (2023)
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick
Optimal Energetic Paths for Electric Cars. ESA (2023)
Robert E. Tarjan, Uri Zwick
Optimal resizable arrays. SOSA (2023)
Joshua Brakensiek, Neng Huang, Uri Zwick
Tight approximability of MAX 2-SAT and relatives, under UGC. CoRR (2023)
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick
Optimal energetic paths for electric cars. CoRR (2023)
Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick
Simulating a stack using queues. SODA (2022)
Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick
Separating MAX 2-AND, MAX DI-CUT and MAX CUT. CoRR (2022)
Robert E. Tarjan, Uri Zwick
Finding Strong Components Using Depth-First Search. CoRR (2022)
Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick
Algorithmic trade-offs for girth approximation in undirected graphs. SODA (2022)
Robert E. Tarjan, Uri Zwick
Optimal resizable arrays. CoRR (2022)
Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick
On the Mysteries of MAX NAE-SAT. SODA (2021)
Javier Esparza, Uri Zwick
TheoretiCS. Bull. EATCS 135 (2021)
Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick
On the Mysteries of MAX NAE-SAT. CoRR (2020)
Orr Fischer, Rotem Oshman, Uri Zwick
Public vs. private randomness in simultaneous multi-party communication complexity. Theor. Comput. Sci. 810 (2020)
Mikkel Thorup, Or Zamir, Uri Zwick
Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. ICALP (2019)
Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick
-SAT algorithms using biased-PPSZ. STOC (2019)
Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick
Random k-out subgraph leaves only O(n/k) inter-component edges. CoRR (2019)
Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick
Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. FOCS (2019)
Haim Kaplan, Or Zamir, Uri Zwick
A sort of an adversary. SODA (2019)
Haim Kaplan, László Kozma, Or Zamir, Uri Zwick
Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. SOSA (2019)
Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
Adjacency Labeling Schemes and Induced-Universal Graphs. SIAM J. Discret. Math. 33 (1) (2019)
Dani Dorfman, Haim Kaplan, Uri Zwick
A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games. ICALP (2019)
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)
Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick
Pairing heaps: the forward variant. MFCS (2018)
Haim Kaplan, László Kozma, Or Zamir, Uri Zwick
Selection from heaps, row-sorted matrices and X+Y using soft heaps. CoRR (2018)
Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick
Improved bounds for multipass pairing heaps and path-balanced binary search trees. CoRR (2018)
Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick
Pairing heaps: the forward variant. CoRR (2017)
Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick
Hollow Heaps. ACM Trans. Algorithms 13 (3) (2017)
Orr Fischer, Rotem Oshman, Uri Zwick
Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity. SIROCCO (2016)
Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick
Bottleneck Paths and Trees and Deterministic Graphical Games. STACS (2016)
Liam Roditty, Uri Zwick
A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time. SIAM J. Comput. 45 (3) (2016)
Thomas Dueholm Hansen, Uri Zwick
Random-Edge Is Slower Than Random-Facet on Abstract Cubes. ICALP (2016)
Haim Kaplan, Or Zamir, Uri Zwick
The amortized cost of finding the minimum. SODA (2015)
Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick
Hollow Heaps. CoRR (2015)
Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
Adjacency Labeling Schemes and Induced-Universal Graphs. STOC (2015)
David Bruce Wilson, Uri Zwick
A Forward-Backward Single-Source Shortest Paths Algorithm. SIAM J. Comput. 44 (3) (2015)
Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick
Hollow Heaps. ICALP (1) (2015)
Thomas Dueholm Hansen, Uri Zwick
An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm. STOC (2015)
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
Random-Facet and Random-Bland require subexponential time even for shortest paths. CoRR (2014)
Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick
Union-Find with Constant Time Deletions. ACM Trans. Algorithms 11 (1) (2014)
Amnon Ta-Shma, Uri Zwick
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences. ACM Trans. Algorithms 10 (3) (2014)
Haim Kaplan, Robert Endre Tarjan, Uri Zwick
Fibonacci Heaps Revisited. CoRR (2014)
Thomas Dueholm Hansen, Mike Paterson, Uri Zwick
Improved upper bounds for Random-Edge and Random-Jump on abstract cubes. SODA (2014)
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)
David Bruce Wilson, Uri Zwick
A forward-backward single-source shortest paths algorithm. CoRR (2014)
Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick
Listing Triangles. ICALP (1) (2014)
Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
Adjacency labeling schemes and induced-universal graphs. CoRR (2014)
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games. CoRR (2014)
Haim Kaplan, Robert Endre Tarjan, Uri Zwick
Soft Heaps Simplified. SIAM J. Comput. 42 (4) (2013)
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) (2013)
Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick
) time with high probability. J. ACM 60 (4) (2013)
David B. Wilson, Uri Zwick
A Forward-Backward Single-Source Shortest Paths Algorithm. FOCS (2013)
Liam Roditty, Uri Zwick
simple shortest paths in unweighted directed graphs. ACM Trans. Algorithms 8 (4) (2012)
Liam Roditty, Uri Zwick
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. SIAM J. Comput. 41 (3) (2012)
Liam Roditty, Uri Zwick
On Dynamic Shortest Paths Problems. Algorithmica 61 (2) (2011)
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
A subexponential lower bound for the Random Facet algorithm for Parity Games. SODA (2011)
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) (2011)
Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick
) time with high probability CoRR (2011)
Günter Rote, Uri Zwick
Collapse. SODA (2011)
Asaf Shapira, Raphael Yuster, Uri Zwick
All-Pairs Bottleneck Paths in Vertex Weighted Graphs. Algorithmica 59 (4) (2011)
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)
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. STOC (2011)
Alon Shalita, Uri Zwick
Efficient algorithms for the 2-gathering problem. ACM Trans. Algorithms 6 (2) (2010)
Thomas Dueholm Hansen, Uri Zwick
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles. ISAAC (1) (2010)
Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick
) Time with High Probability. FOCS (2010)
Omid Madani, Mikkel Thorup, Uri Zwick
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. ACM Trans. Algorithms 6 (2) (2010)
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)
Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick
Maximum Overhang. Am. Math. Mon. 116 (9) (2009)
Mike Paterson, Uri Zwick
Overhang. Am. Math. Mon. 116 (1) (2009)
Omid Madani, Mikkel Thorup, Uri Zwick
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. SODA (2009)
Alon Shalita, Uri Zwick
Efficient algorithms for the 2-gathering problem. SODA (2009)
Haim Kaplan, Uri Zwick
A simpler implementation and analysis of Chazelle's soft heaps. SODA (2009)
Marcin Jurdzinski, Mike Paterson, Uri Zwick
A Deterministic Subexponential Algorithm for Solving Parity Games. SIAM J. Comput. 38 (4) (2008)
Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick
Maximum overhang. SODA (2008)
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)
Uri Zwick
Simple Stochastic Games, Mean Payoff Games, Parity Games. CSR (2008)
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) (2008)
Liam Roditty, Mikkel Thorup, Uri Zwick
Roundtrip spanners and roundtrip routing in directed graphs. ACM Trans. Algorithms 4 (3) (2008)
Liam Roditty, Uri Zwick
Improved Dynamic Reachability Algorithms for Directed Graphs. SIAM J. Comput. 37 (5) (2008)
Amnon Ta-Shma, Uri Zwick
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. SODA (2007)
Raphael Yuster, Uri Zwick
Maximum matching in graphs with an excluded minor. SODA (2007)
Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick
New Bounds for the Nearly Equitable Edge Coloring Problem. ISAAC (2007)
Asaf Shapira, Raphael Yuster, Uri Zwick
All-pairs bottleneck paths in vertex weighted graphs. SODA (2007)
Mikkel Thorup, Uri Zwick
Spanners and emulators with sublinear distance errors. SODA (2006)
Mike Paterson, Uri Zwick
Overhang. SODA (2006)
Marcin Jurdzinski, Mike Paterson, Uri Zwick
A deterministic subexponential algorithm for solving parity games. SODA (2006)
Uri Zwick
A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths. Algorithmica 46 (2) (2006)
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
Melding priority queues. ACM Trans. Algorithms 2 (4) (2006)
Amitai Armon, Uri Zwick
Multicriteria Global Minimum Cuts. Algorithmica 46 (1) (2006)
Mikkel Thorup, Uri Zwick
Approximate distance oracles. J. ACM 52 (1) (2005)
Liam Roditty, Mikkel Thorup, Uri Zwick
Deterministic Constructions of Approximate Distance Oracles and Spanners. ICALP (2005)
Adi Avidor, Uri Zwick
Approximating MIN 2-SAT and MIN 3-SAT. Theory Comput. Syst. 38 (3) (2005)
Adi Avidor, Ido Berkovitch, Uri Zwick
Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT. WAOA (2005)
Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick
Union-Find with Constant Time Deletions. ICALP (2005)
Raphael Yuster, Uri Zwick
Answering distance queries in directed graphs using fast matrix multiplication. FOCS (2005)

Uri Zwick.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Uri Zwick