Uri Zwick
Affiliations: Tel Aviv University, Israel
According to our database^{1},
Uri Zwick
authored at least 150 papers
between 1989 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on orcid.org
On csauthors.net:
Bibliography
2023
CoRR, 2023
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023
Proceedings of the 2023 ACMSIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
CoRR, 2022
Proceedings of the 2022 ACMSIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 2022 ACMSIAM Symposium on Discrete Algorithms, 2022
2021
Bull. EATCS, 2021
Proceedings of the 2021 ACMSIAM Symposium on Discrete Algorithms, 2021
2020
Public vs. private randomness in simultaneous multiparty communication complexity.
Theor. Comput. Sci., 2020
2019
SIAM J. Discret. Math., 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
Improved Bounds for Multipass Pairing Heaps and PathBalanced Binary Search Trees.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
ACM Trans. Algorithms, 2017
2016
Encyclopedia of Algorithms, 2016
A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time.
SIAM J. Comput., 2016
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
SIAM J. Comput., 2015
Proceedings of the FortySeventh Annual ACM on Symposium on Theory of Computing, 2015
Proceedings of the TwentySixth Annual ACMSIAM Symposium on Discrete Algorithms, 2015
2014
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences.
ACM Trans. Algorithms, 2014
ACM Trans. Algorithms, 2014
CoRR, 2014
Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games.
CoRR, 2014
RandomFacet and RandomBland require subexponential time even for shortest paths.
CoRR, 2014
Proceedings of the TwentyFifth Annual ACMSIAM Symposium on Discrete Algorithms, 2014
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles.
Proceedings of the TwentyFifth Annual ACMSIAM Symposium on Discrete Algorithms, 2014
Proceedings of the Automata, Languages, and Programming  41st International Colloquium, 2014
2013
SIAM J. Comput., 2013
Allpairs shortest paths in <i>O</i>(<i>n</i><sup>2</sup>) time with high probability.
J. ACM, 2013
Strategy Iteration Is Strongly Polynomial for 2Player TurnBased Stochastic Games with a Constant Discount Factor.
J. ACM, 2013
2012
Replacement paths and <i>k</i> simple shortest paths in unweighted directed graphs.
ACM Trans. Algorithms, 2012
SIAM J. Comput., 2012
2011
Internet Math., 2011
Algorithmica, 2011
Algorithmica, 2011
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
2010
ACM Trans. Algorithms, 2010
Discounted deterministic Markov decision processes and discounted allpairs shortest paths.
ACM Trans. Algorithms, 2010
Proceedings of the Algorithms and Computation  21st International Symposium, 2010
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
2009
Am. Math. Mon., 2009
Am. Math. Mon., 2009
Proceedings of the Twentieth Annual ACMSIAM Symposium on Discrete Algorithms, 2009
2008
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
ACM Trans. Algorithms, 2008
SIAM J. Comput., 2008
SIAM J. Comput., 2008
J. Graph Algorithms Appl., 2008
An Algorithm for Orienting Graphs Based on CauseEffect Pairs and Its Applications to Orienting Protein Networks.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008
Proceedings of the Computer Science, 2008
2007
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
2006
ACM Trans. Algorithms, 2006
A Slightly Improved SubCubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths.
Algorithmica, 2006
Algorithmica, 2006
Proceedings of the Seventeenth Annual ACMSIAM Symposium on Discrete Algorithms, 2006
2005
ACM Trans. Algorithms, 2005
Theory Comput. Syst., 2005
J. ACM, 2005
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
Proceedings of the Approximation, 2005
2004
J. Algorithms, 2004
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming.
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
A Slightly Improved SubCubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
2003
SIAM J. Comput., 2003
J. Comput. Syst. Sci., 2003
2002
Wirel. Networks, 2002
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems.
Random Struct. Algorithms, 2002
J. Algorithms, 2002
All pairs shortest paths using bridging sets and rectangular matrix multiplication.
J. ACM, 2002
Algorithmica, 2002
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
Proceedings of the Integer Programming and Combinatorial Optimization, 2002
2001
SIAM J. Discret. Math., 2001
SIAM J. Discret. Math., 2001
Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms.
SIAM J. Discret. Math., 2001
Approximation Algorithms for MAX 4SAT and Rounding Procedures for Semidefinite Programs.
J. Algorithms, 2001
J. Algorithms, 2001
J. Algorithms, 2001
Comput. Complex., 2001
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001
Proceedings of the Algorithms, 2001
2000
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000
1999
J. Comput. Biol., 1999
Comput. Geom., 1999
Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems.
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999
1998
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint.
Proceedings of the Ninth Annual ACMSIAM Symposium on Discrete Algorithms, 1998
Proceedings of the Ninth Annual ACMSIAM Symposium on Discrete Algorithms, 1998
All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998
1997
SIAM J. Discret. Math., 1997
SIAM J. Comput., 1997
Electron. Colloquium Comput. Complex., 1997
Algorithmica, 1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997
1996
Theor. Comput. Sci., 1996
Math. Syst. Theory, 1996
J. Comput. Syst. Sci., 1996
Inf. Process. Lett., 1996
Exp. Math., 1996
Comb., 1996
Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems.
Proceedings of the Seventh Annual ACMSIAM Symposium on Discrete Algorithms, 1996
1995
The Smallest Networks on Which the FordFulkerson Maximum Flow Procedure may Fail to Terminate.
Theor. Comput. Sci., 1995
SIAM J. Comput., 1995
J. ACM, 1995
Electron. Colloquium Comput. Complex., 1995
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
1994
J. Algorithms, 1994
Comb. Probab. Comput., 1994
Colorcoding: a new method for finding simple paths, cycles and other small subgraphs within large graphs.
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract).
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994
Proceedings of the Algorithms, 1994
1993
Theor. Comput. Sci., 1993
Random Struct. Algorithms, 1993
Comput. Complex., 1993
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993
1992
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992
1991
A 4n Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions.
SIAM J. Comput., 1991
Inf. Process. Lett., 1991
Proceedings of the 10th IEEE Symposium on Computer Arithmetic, 1991
1990
Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
Theor. Comput. Sci., 1989