Stop the war!Остановите войну!
for scientists:
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
Journal Articles
- 2021
[j69]Javier Esparza, Uri Zwick:
TheoretiCS. Bull. EATCS 135 (2021)- 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) - 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) - 2017
- [j66]Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Hollow Heaps. ACM Trans. Algorithms 13(3): 42:1-42:27 (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) - 2015
- [j64]David Bruce Wilson, Uri Zwick:
A Forward-Backward Single-Source Shortest Paths Algorithm. SIAM J. Comput. 44(3): 698-739 (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) - 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) - 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) - 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) - 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) - 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) - 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) - 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) - 2004
- [j39]Eran Halperin, Dror Livnat, Uri Zwick:
MAX CUT in cubic graphs. J. Algorithms 53(2): 169-185 (2004) - 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) - 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]Eran Halperin, Ram Nathaniel, Uri Zwick:
Coloring k-colorable graphs using relatively small palettes. J. Algorithms 45(1): 72-90 (2002) - [j33]Eran Halperin, Uri Zwick:
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Random Struct. Algorithms 20(3): 382-402 (2002) - [j32]Zohar Naor, Hanoch Levy, Uri Zwick:
Cell Identification Codes for Tracking Mobile Users. Wirel. Networks 8(1): 73-84 (2002) - 2001
- [j31]Hana Chockler, Uri Zwick:
Which bases admit non-trivial shrinkage of formulae? Comput. Complex. 10(1): 28-40 (2001) - [j30]Edith Cohen, Uri Zwick:
All-Pairs Small-Stretch Paths. J. Algorithms 38(2): 335-353 (2001) - [j29]Shay Halperin, Uri Zwick:
Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests. J. Algorithms 39(1): 1-46 (2001) - [j28]Eran Halperin, Uri Zwick:
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. J. Algorithms 40(2): 184-211 (2001) - [j27]Dorit Dor, Johan Håstad, Staffan Ulfberg, Uri Zwick:
On Lower Bounds for Selecting the Median. SIAM J. Discret. Math. 14(3): 299-311 (2001) - [j26]Dorit Dor, Uri Zwick:
Median Selection Requires (2+epsilon)n Comparisons. SIAM J. Discret. Math. 14(3): 312-325 (2001) - [j25]Noga Alon, Benny Sudakov, Uri Zwick:
Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms. SIAM J. Discret. Math. 15(1): 58-72 (2001) - 2000
- [j24]Dorit Dor, Shay Halperin, Uri Zwick:
All-Pairs Almost Shortest Paths. SIAM J. Comput. 29(5): 1740-1759 (2000) - 1999
- [j23]Dorit Dor, Uri Zwick:
SOKOBAN and other motion planning problems. Comput. Geom. 13(4): 215-228 (1999) - [j22]Ashwin Nayak, Alistair Sinclair, Uri Zwick:
Spatial Codes and the Hardness of String Folding Problems. J. Comput. Biol. 6(1): 13-36 (1999) - [j21]Dorit Dor, Uri Zwick:
Selecting the Median. SIAM J. Comput. 28(5): 1722-1758 (1999) - 1997
- [j20]Noga Alon, Raphael Yuster, Uri Zwick:
Finding and Counting Given Length Cycles. Algorithmica 17(3): 209-223 (1997) - [j19]Moshe Dubiner, Uri Zwick:
Amplification by Read-Once Formulas. SIAM J. Comput. 26(1): 15-38 (1997) - [j18]Raphael Yuster, Uri Zwick:
Finding Even Cycles Even Faster. SIAM J. Discret. Math. 10(2): 209-222 (1997) - 1996
- [j17]Dorit Dor, Uri Zwick:
Finding The alpha n-Th Largest Element. Comb. 16(1): 41-58 (1996) - [j16]David B. A. Epstein, Anthony R. lano-Fletcher, Uri Zwick:
Growth Functions and Automatic Groups. Exp. Math. 5(4): 297-315 (1996) - [j15]Uri Zwick:
On the Number of ANDs Versus the Number of ORs in Monotone Boolean Circuits. Inf. Process. Lett. 59(1): 29-30 (1996) - [j14]Shay Halperin, Uri Zwick:
An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM. J. Comput. Syst. Sci. 53(3): 395-416 (1996) - [j13]Amir M. Ben-Amram, Bryant A. Julstrom, Uri Zwick:
A Note on Busy Beavers and Other Creatures. Math. Syst. Theory 29(4): 375-386 (1996) - [j12]Uri Zwick, Mike Paterson:
The Complexity of Mean Payoff Games on Graphs. Theor. Comput. Sci. 158(1&2): 343-359 (1996) - 1995
- [j11]Noga Alon, Raphael Yuster, Uri Zwick:
Color-Coding. J. ACM 42(4): 844-856 (1995) - [j10]Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick:
Tighter Lower Bounds on the Exact Complexity of String Matching. SIAM J. Comput. 24(1): 30-45 (1995) - [j9]Uri Zwick:
The Smallest Networks on Which the Ford-Fulkerson Maximum Flow Procedure may Fail to Terminate. Theor. Comput. Sci. 148(1): 165-170 (1995) - 1994
- [j8]Moshe Dubiner, Uri Zwick:
How Do Read-Once Formulae Shrink? Comb. Probab. Comput. 3: 455-469 (1994) - [j7]Tal Goldberg, Uri Zwick:
Faster Parallel String Matching via Larger Deterministic Samples. J. Algorithms 16(2): 295-308 (1994) - 1993
- [j6]Mike Paterson, Uri Zwick:
Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication. Comput. Complex. 3: 262-291 (1993) - [j5]Mike Paterson, Uri Zwick:
Shrinkage of de Morgan Formulae under Restriction. Random Struct. Algorithms 4(2): 135-150 (1993) - [j4]Uri Zwick, Mike Paterson:
The Memory Game. Theor. Comput. Sci. 110(1): 169-196 (1993) - 1991
- [j3]Uri Zwick:
An Extension of Khrapchenko's Theorem. Inf. Process. Lett. 37(4): 215-217 (1991) - [j2]Uri Zwick:
A 4n Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions. SIAM J. Comput. 20(3): 499-505 (1991) - 1989
- [j1]Noga Alon, Uri Zwick:
On Neciporuk's Theorem for Branching Programs. Theor. Comput. Sci. 64(3): 331-342 (1989)
Conference and Workshop Papers
- 2023
- [c108]Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Optimal Energetic Paths for Electric Cars. ESA 2023: 42:1-42:17 - [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 - 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 - 2021
- [c103]Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
On the Mysteries of MAX NAE-SAT. SODA 2021: 484-503 - 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 - 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 - 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 - 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 - 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 - 2013
- [c84]David B. Wilson, Uri Zwick:
A Forward-Backward Single-Source Shortest Paths Algorithm. FOCS 2013: 707-716 - 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 - 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 - 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
- [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 - 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
- [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 - 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
- [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