Uri Zwick

According to our database, Uri Zwick authored at least 151 papers between 1989 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Minimum-cost paths for electric cars.

Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Tight approximability of MAX 2-SAT and relatives, under UGC.

Joshua Brakensiek, Neng Huang, Uri Zwick

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Optimal resizable arrays.

Robert E. Tarjan, Uri Zwick

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Improved girth approximation in weighted undirected graphs.

Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Separating MAX 2-AND, MAX DI-CUT and MAX CUT.

Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Optimal Energetic Paths for Electric Cars.

Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Finding Strong Components Using Depth-First Search.

Robert E. Tarjan, Uri Zwick

CoRR, 2022

Simulating a stack using queues.

Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Algorithmic trade-offs for girth approximation in undirected graphs.

Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

TheoretiCS.

Javier Esparza, Uri Zwick

Bull. EATCS, 2021

On the Mysteries of MAX NAE-SAT.

Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Public vs. private randomness in simultaneous multi-party communication complexity.

Orr Fischer, Rotem Oshman, Uri Zwick

Theor. Comput. Sci., 2020

2019

Adjacency Labeling Schemes and Induced-Universal Graphs.

Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick

SIAM J. Discret. Math., 2019

Faster <i>k</i>-SAT algorithms using biased-PPSZ.

Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

A sort of an adversary.

Haim Kaplan, Or Zamir, Uri Zwick

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps.

Haim Kaplan, László Kozma, Or Zamir, Uri Zwick

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps.

Mikkel Thorup, Or Zamir, Uri Zwick

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.

Dani Dorfman, Haim Kaplan, Uri Zwick

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges.

Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Pairing heaps: the forward variant.

Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees.

Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Hollow Heaps.

Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick

ACM Trans. Algorithms, 2017

2016

Color Coding.

Noga Alon, Raphael Yuster, Uri Zwick

Encyclopedia of Algorithms, 2016

A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time.

Liam Roditty, Uri Zwick

SIAM J. Comput., 2016

Bottleneck Paths and Trees and Deterministic Graphical Games.

Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Random-Edge Is Slower Than Random-Facet on Abstract Cubes.

Thomas Dueholm Hansen, Uri Zwick

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

A Forward-Backward Single-Source Shortest Paths Algorithm.

David Bruce Wilson, Uri Zwick

SIAM J. Comput., 2015

An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm.

Thomas Dueholm Hansen, Uri Zwick

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

The amortized cost of finding the minimum.

Haim Kaplan, Or Zamir, Uri Zwick

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences.

Amnon Ta-Shma, Uri Zwick

ACM Trans. Algorithms, 2014

Union-Find with Constant Time Deletions.

Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick

ACM Trans. Algorithms, 2014

Fibonacci Heaps Revisited.

Haim Kaplan, Robert Endre Tarjan, Uri Zwick

CoRR, 2014

Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games.

Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick

CoRR, 2014

Random-Facet and Random-Bland require subexponential time even for shortest paths.

Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick

CoRR, 2014

Improved upper bounds for Random-Edge and Random-Jump on abstract cubes.

Thomas Dueholm Hansen, Mike Paterson, Uri Zwick

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles.

Thomas Dueholm Hansen, Haim Kaplan, Uri Zwick

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Listing Triangles.

Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Soft Heaps Simplified.

Haim Kaplan, Robert Endre Tarjan, Uri Zwick

SIAM J. Comput., 2013

All-pairs shortest paths in <i>O</i>(<i>n</i>²) time with high probability.

Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick

J. ACM, 2013

Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor.

Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick

J. ACM, 2013

2012

Replacement paths and <i>k</i> simple shortest paths in unweighted directed graphs.

Liam Roditty, Uri Zwick

ACM Trans. Algorithms, 2012

Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs.

Liam Roditty, Uri Zwick

SIAM J. Comput., 2012

2011

On the Approximability of Reachability-Preserving Network Orientations.

Michael Elberfeld, Vineet Bafna, Iftah Gamzu, Alexander Medvedovsky, Danny Segev, Dana Silverbush, Uri Zwick, Roded Sharan

Internet Math., 2011

All-Pairs Bottleneck Paths in Vertex Weighted Graphs.

Asaf Shapira, Raphael Yuster, Uri Zwick

Algorithmica, 2011

On Dynamic Shortest Paths Problems.

Liam Roditty, Uri Zwick

Algorithmica, 2011

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm.

Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Collapse.

Günter Rote, Uri Zwick

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

A subexponential lower bound for the Random Facet algorithm for Parity Games.

Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Efficient algorithms for the 2-gathering problem.

Alon Shalita, Uri Zwick

ACM Trans. Algorithms, 2010

Discounted deterministic Markov decision processes and discounted all-pairs shortest paths.

Omid Madani, Mikkel Thorup, Uri Zwick

ACM Trans. Algorithms, 2010

Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles.

Thomas Dueholm Hansen, Uri Zwick

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

All-Pairs Shortest Paths in O(n²) Time with High Probability.

Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

Overhang.

Mike Paterson, Uri Zwick

Am. Math. Mon., 2009

Maximum Overhang.

Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick

Am. Math. Mon., 2009

A simpler implementation and analysis of Chazelle's soft heaps.

Haim Kaplan, Uri Zwick

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Color Coding.

Noga Alon, Raphael Yuster, Uri Zwick

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Roundtrip spanners and roundtrip routing in directed graphs.

Liam Roditty, Mikkel Thorup, Uri Zwick

ACM Trans. Algorithms, 2008

Improved Dynamic Reachability Algorithms for Directed Graphs.

Liam Roditty, Uri Zwick

SIAM J. Comput., 2008

A Deterministic Subexponential Algorithm for Solving Parity Games.

Marcin Jurdzinski, Mike Paterson, Uri Zwick

SIAM J. Comput., 2008

An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem.

Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick

J. Graph Algorithms Appl., 2008

An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks.

Alexander Medvedovsky, Vineet Bafna, Uri Zwick, Roded Sharan

Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Simple Stochastic Games, Mean Payoff Games, Parity Games.

Uri Zwick

Proceedings of the Computer Science, 2008

2007

Maximum matching in graphs with an excluded minor.

Raphael Yuster, Uri Zwick

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

New Bounds for the Nearly Equitable Edge Coloring Problem.

Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

Melding priority queues.

Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick

ACM Trans. Algorithms, 2006

A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths.

Uri Zwick

Algorithmica, 2006

Multicriteria Global Minimum Cuts.

Amitai Armon, Uri Zwick

Algorithmica, 2006

Spanners and emulators with sublinear distance errors.

Mikkel Thorup, Uri Zwick

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Fast sparse matrix multiplication.

Raphael Yuster, Uri Zwick

ACM Trans. Algorithms, 2005

Approximating MIN 2-SAT and MIN 3-SAT.

Adi Avidor, Uri Zwick

Theory Comput. Syst., 2005

Approximate distance oracles.

Mikkel Thorup, Uri Zwick

J. ACM, 2005

Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT.

Adi Avidor, Ido Berkovitch, Uri Zwick

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Deterministic Constructions of Approximate Distance Oracles and Spanners.

Liam Roditty, Mikkel Thorup, Uri Zwick

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Answering distance queries in directed graphs using fast matrix multiplication.

Raphael Yuster, Uri Zwick

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT.

Adi Avidor, Uri Zwick

Proceedings of the Approximation, 2005

2004

MAX CUT in cubic graphs.

Eran Halperin, Dror Livnat, Uri Zwick

J. Algorithms, 2004

Detecting short directed cycles using rectangular matrix multiplication and dynamic programming.

Raphael Yuster, Uri Zwick

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Meldable RAM priority queues and minimum directed spanning trees.

Ran Mendelson, Mikkel Thorup, Uri Zwick

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths.

Uri Zwick

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

Reachability and Distance Queries via 2-Hop Labels.

Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick

SIAM J. Comput., 2003

Connection caching: model and algorithms.

Edith Cohen, Haim Kaplan, Uri Zwick

J. Comput. Syst. Sci., 2003

2002

Cell Identification Codes for Tracking Mobile Users.

Zohar Naor, Hanoch Levy, Uri Zwick

Wirel. Networks, 2002

A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems.

Eran Halperin, Uri Zwick

Random Struct. Algorithms, 2002

Coloring k-colorable graphs using relatively small palettes.

Eran Halperin, Ram Nathaniel, Uri Zwick

J. Algorithms, 2002

All pairs shortest paths using bridging sets and rectangular matrix multiplication.

Uri Zwick

J. ACM, 2002

Competitive Analysis of the LRFU Paging Algorithm.

Edith Cohen, Haim Kaplan, Uri Zwick

Algorithmica, 2002

Computer assisted proof of optimal approximability results.

Uri Zwick

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Jenga.

Uri Zwick

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Approximating MIN k-SAT.

Adi Avidor, Uri Zwick

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems.

Michael Lewin, Dror Livnat, Uri Zwick

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

Median Selection Requires (2+epsilon)n Comparisons.

Dorit Dor, Uri Zwick

SIAM J. Discret. Math., 2001

On Lower Bounds for Selecting the Median.

Dorit Dor, Johan Håstad, Staffan Ulfberg, Uri Zwick

SIAM J. Discret. Math., 2001

Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms.

Noga Alon, Benny Sudakov, Uri Zwick

SIAM J. Discret. Math., 2001

Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs.

Eran Halperin, Uri Zwick

J. Algorithms, 2001

Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests.

Shay Halperin, Uri Zwick

J. Algorithms, 2001

All-Pairs Small-Stretch Paths.

Edith Cohen, Uri Zwick

J. Algorithms, 2001

Which bases admit non-trivial shrinkage of formulae?

Hana Chockler, Uri Zwick

Comput. Complex., 2001

Compact routing schemes.

Mikkel Thorup, Uri Zwick

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Combinatorial approximation algorithms for the maximum directed cut problem.

Eran Halperin, Uri Zwick

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Coloring k-colorable graphs using smaller palettes.

Eran Halperin, Ram Nathaniel, Uri Zwick

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Which formulae shrink under random restrictions?

Hana Chockler, Uri Zwick

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Semidefinite Programming Based Approximation Algorithms.

Uri Zwick

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Exact and Approximate Distances in Graphs - A Survey.

Uri Zwick

Proceedings of the Algorithms, 2001

2000

Connection caching under vaious models of communication.

Edith Cohen, Haim Kaplan, Uri Zwick

Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

1999

Spatial Codes and the Hardness of String Folding Problems.

Ashwin Nayak, Alistair Sinclair, Uri Zwick

J. Comput. Biol., 1999

SOKOBAN and other motion planning problems.

Dorit Dor, Uri Zwick

Comput. Geom., 1999

Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems.

Uri Zwick

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

All Pairs Lightest Shortest Paths.

Uri Zwick

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Connection Caching.

Edith Cohen, Haim Kaplan, Uri Zwick

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

All Pairs Shortest Paths in Undirected Graphs with Integer Weights.

Avi Shoshan, Uri Zwick

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998

Finding Almost-Satisfying Assignments.

Uri Zwick

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.

Uri Zwick

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Spatial Codes and the Hardness of String Folding Problems (Extended Abstract).

Ashwin Nayak, Alistair Sinclair, Uri Zwick

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms.

Uri Zwick

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Finding Even Cycles Even Faster.

Raphael Yuster, Uri Zwick

SIAM J. Discret. Math., 1997

Amplification by Read-Once Formulas.

Moshe Dubiner, Uri Zwick

SIAM J. Comput., 1997

All Pairs Almost Shortest Paths

Dorit Dor, Shay Halperin, Uri Zwick

Electron. Colloquium Comput. Complex., 1997

Finding and Counting Given Length Cycles.

Noga Alon, Raphael Yuster, Uri Zwick

Algorithmica, 1997

A 7/8-Approximation Algorithm for MAX 3SAT?

Howard J. Karloff, Uri Zwick

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

The Communication Complexity of the Universal Relation.

Gábor Tardos, Uri Zwick

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996

The Complexity of Mean Payoff Games on Graphs.

Uri Zwick, Mike Paterson

Theor. Comput. Sci., 1996

A Note on Busy Beavers and Other Creatures.

Amir M. Ben-Amram, Bryant A. Julstrom, Uri Zwick

Math. Syst. Theory, 1996

An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM.

Shay Halperin, Uri Zwick

J. Comput. Syst. Sci., 1996

On the Number of ANDs Versus the Number of ORs in Monotone Boolean Circuits.

Uri Zwick

Inf. Process. Lett., 1996

Growth Functions and Automatic Groups.

David B. A. Epstein, Anthony R. lano-Fletcher, Uri Zwick

Exp. Math., 1996

Finding The alpha n-Th Largest Element.

Dorit Dor, Uri Zwick

Comb., 1996

Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems.

Shay Halperin, Uri Zwick

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995

The Smallest Networks on Which the Ford-Fulkerson Maximum Flow Procedure may Fail to Terminate.

Uri Zwick

Theor. Comput. Sci., 1995

Tighter Lower Bounds on the Exact Complexity of String Matching.

Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick

SIAM J. Comput., 1995

Color-Coding.

Noga Alon, Raphael Yuster, Uri Zwick

J. ACM, 1995

Selecting the Median

Dorit Dor, Uri Zwick

Electron. Colloquium Comput. Complex., 1995

Optimal deterministic approximate parallel prefix sums and their applications.

Tal Goldberg, Uri Zwick

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

Finding percentile elements.

Dorit Dor, Uri Zwick

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

Looking for MUM and DAD: Text-Text Comparisons Do Help.

Mike Paterson, Shlomit Tassa, Uri Zwick

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

The Complexity of Mean Payoff Games.

Uri Zwick, Mike Paterson

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Faster Parallel String Matching via Larger Deterministic Samples.

Tal Goldberg, Uri Zwick

J. Algorithms, 1994

How Do Read-Once Formulae Shrink?

Moshe Dubiner, Uri Zwick

Comb. Probab. Comput., 1994

Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs.

Noga Alon, Raphael Yuster, Uri Zwick

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract).

Shay Halperin, Uri Zwick

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

Finding and Counting Given Length Cycles (Extended Abstract).

Noga Alon, Raphael Yuster, Uri Zwick

Proceedings of the Algorithms, 1994

1993

The Memory Game.

Uri Zwick, Mike Paterson

Theor. Comput. Sci., 1993

Shrinkage of de Morgan Formulae under Restriction.

Mike Paterson, Uri Zwick

Random Struct. Algorithms, 1993

Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication.

Mike Paterson, Uri Zwick

Comput. Complex., 1993

Which Patterns are Hard to Find?

Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

1992

Shallow Multiplication Circuits and Wise Financial Investments

Mike Paterson, Uri Zwick

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Amplification and Percolation

Moshe Dubiner, Uri Zwick

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.

Uri Zwick

SIAM J. Comput., 1991

An Extension of Khrapchenko's Theorem.

Uri Zwick

Inf. Process. Lett., 1991

Shallow multiplication circuits.

Michael S. Paterson, Uri Zwick

Proceedings of the 10th IEEE Symposium on Computer Arithmetic, 1991

1990

Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions

Mike Paterson, Nicholas Pippenger, Uri Zwick

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

On Neciporuk's Theorem for Branching Programs.

Noga Alon, Uri Zwick

Theor. Comput. Sci., 1989