On Neciporuk's Theorem for Branching Programs. - Noga Alon; Uri Zwick (Theor. Comput. Sci., 1989)

Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions - Mike Paterson; Nicholas Pippenger; Uri Zwick (FOCS, 1990)

Shallow multiplication circuits. - Michael S. Paterson; Uri Zwick (IEEE Symposium on Computer Arithmetic, 1991)

Shrinkage of de Morgan formulae under restriction - Mike Paterson; Uri Zwick (FOCS, 1991)

An Extension of Khrapchenko's Theorem. - Uri Zwick (Inf. Process. Lett., 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)

Amplification and Percolation - Moshe Dubiner; Uri Zwick (FOCS, 1992)

Shallow Multiplication Circuits and Wise Financial Investments - Mike Paterson; Uri Zwick (STOC, 1992)

Which Patterns are Hard to Find? - Richard Cole 001; Ramesh Hariharan; Mike Paterson; Uri Zwick (ISTCS, 1993)

Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication. - Mike Paterson; Uri Zwick (Comput. Complex., 1993)

The Memory Game. - Uri Zwick; Mike Paterson (Theor. Comput. Sci., 1993)

Finding and Counting Given Length Cycles (Extended Abstract). - Noga Alon; Raphael Yuster; Uri Zwick (ESA, 1994)

Finding Even Cycles Even Faster. - Raphael Yuster; Uri Zwick (ICALP, 1994)

An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract). - Shay Halperin; Uri Zwick (SPAA, 1994)

Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. - Noga Alon; Raphael Yuster; Uri Zwick (STOC, 1994)

How Do Read-Once Formulae Shrink? - Moshe Dubiner; Uri Zwick (Comb. Probab. Comput., 1994)

Color-Coding - Noga Alon; Raphael Yuster; Uri Zwick (Electron. Colloquium Comput. Complex., 1994)

Faster Parallel String Matching via Larger Deterministic Samples. - Tal Goldberg; Uri Zwick (J. Algorithms, 1994)

The Complexity of Mean Payoff Games. - Uri Zwick; Mike Paterson (COCOON, 1995)

Looking for MUM and DAD: Text-Text Comparisons Do Help. - Mike Paterson; Shlomit Tassa; Uri Zwick (FSTTCS, 1995)

Finding percentile elements. - Dorit Dor; Uri Zwick (ISTCS, 1995)

Optimal deterministic approximate parallel prefix sums and their applications. - Tal Goldberg; Uri Zwick (ISTCS, 1995)

Selecting the Median. - Dorit Dor; Uri Zwick (SODA, 1995)

The Complexity of Mean Payoff Games on Graphs - Uri Zwick; Mike Paterson (Electron. Colloquium Comput. Complex., 1995)

Tighter Lower Bounds on the Exact Complexity of String Matching. - Richard Cole 001; Ramesh Hariharan; Mike Paterson; Uri Zwick (SIAM J. Comput., 1995)

The Smallest Networks on Which the Ford-Fulkerson Maximum Flow Procedure may Fail to Terminate. - Uri Zwick (Theor. Comput. Sci., 1995)

All Pairs Almost Shortest Paths. - Dorit Dor; Shay Halperin; Uri Zwick (FOCS, 1996)

Median Selection Requires (2+epsilon)n Comparisons. - Dorit Dor; Uri Zwick (FOCS, 1996)

Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems. - Shay Halperin; Uri Zwick (SODA, 1996)

Finding The alpha n-Th Largest Element. - Dorit Dor; Uri Zwick (Comb., 1996)

Growth Functions and Automatic Groups. - David B. A. Epstein; Anthony R. lano-Fletcher; Uri Zwick (Exp. Math., 1996)

On the Number of ANDs Versus the Number of ORs in Monotone Boolean Circuits. - Uri Zwick (Inf. Process. Lett., 1996)

An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM. - Shay Halperin; Uri Zwick (J. Comput. Syst. Sci., 1996)

A Note on Busy Beavers and Other Creatures. - Amir M. Ben-Amram; Bryant A. Julstrom; Uri Zwick (Math. Syst. Theory, 1996)

The Communication Complexity of the Universal Relation. - Gábor Tardos; Uri Zwick (CCC, 1997)

A 7/8-Approximation Algorithm for MAX 3SAT? - Howard J. Karloff; Uri Zwick (FOCS, 1997)

All-Pairs Small-Stretch Paths. - Edith Cohen; Uri Zwick (SODA, 1997)

Finding and Counting Given Length Cycles. - Noga Alon; Raphael Yuster; Uri Zwick (Algorithmica, 1997)

Amplification by Read-Once Formulas. - Moshe Dubiner; Uri Zwick (SIAM J. Comput., 1997)

All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms. - Uri Zwick (FOCS, 1998)

Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). - Ashwin Nayak 001; Alistair Sinclair; Uri Zwick (SODA, 1998)

Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint. - Uri Zwick (SODA, 1998)

Finding Almost-Satisfying Assignments. - Uri Zwick (STOC, 1998)

All Pairs Shortest Paths in Undirected Graphs with Integer Weights. - Avi Shoshan; Uri Zwick (FOCS, 1999)

Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. - Eran Halperin; Uri Zwick (IPCO, 1999)

Connection Caching. - Edith Cohen; Haim Kaplan; Uri Zwick (STOC, 1999)

All Pairs Lightest Shortest Paths. - Uri Zwick (STOC, 1999)

Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems. - Uri Zwick (STOC, 1999)

SOKOBAN and other motion planning problems. - Dorit Dor; Uri Zwick (Comput. Geom., 1999)

Spatial Codes and the Hardness of String Folding Problems. - Ashwin Nayak 001; Alistair Sinclair; Uri Zwick (J. Comput. Biol., 1999)

Connection caching under vaious models of communication. - Edith Cohen; Haim Kaplan; Uri Zwick (SPAA, 2000)

All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication - Uri Zwick (Electron. Colloquium Comput. Complex., 2000)

Exact and Approximate Distances in Graphs - A Survey. - Uri Zwick (ESA, 2001)

Semidefinite Programming Based Approximation Algorithms. - Uri Zwick (FSTTCS, 2001)

A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. - Eran Halperin; Uri Zwick (IPCO, 2001)

Constructing worst case instances for semidefinite programming based approximation algorithms. - Noga Alon; Benny Sudakov; Uri Zwick (SODA, 2001)

Which formulae shrink under random restrictions? - Hana Chockler; Uri Zwick (SODA, 2001)

Coloring k-colorable graphs using smaller palettes. - Eran Halperin; Ram Nathaniel; Uri Zwick (SODA, 2001)

Combinatorial approximation algorithms for the maximum directed cut problem. - Eran Halperin; Uri Zwick (SODA, 2001)

Compact routing schemes. - Mikkel Thorup; Uri Zwick (SPAA, 2001)

Approximate distance oracles. - Mikkel Thorup; Uri Zwick (STOC, 2001)

Competitive Analysis of the LRFU Paging Algorithm. - Edith Cohen; Haim Kaplan; Uri Zwick (WADS, 2001)

Which bases admit non-trivial shrinkage of formulae? - Hana Chockler; Uri Zwick (Comput. Complex., 2001)

Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests. - Shay Halperin; Uri Zwick (J. Algorithms, 2001)

On Lower Bounds for Selecting the Median. - Dorit Dor; Johan Håstad; Staffan Ulfberg; Uri Zwick (SIAM J. Discret. Math., 2001)

Improved Dynamic Reachability Algorithms for Directed Graphs. - Liam Roditty; Uri Zwick (FOCS, 2002)

Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. - Michael Lewin; Dror Livnat; Uri Zwick (IPCO, 2002)

Approximating MIN k-SAT. - Adi Avidor; Uri Zwick (ISAAC, 2002)

Reachability and distance queries via 2-hop labels. - Edith Cohen; Eran Halperin; Haim Kaplan; Uri Zwick (SODA, 2002)

MAX CUT in cubic graphs. - Eran Halperin; Dror Livnat; Uri Zwick (SODA, 2002)

Roundtrip spanners and roundtrip routing in directed graphs. - Liam Roditty; Mikkel Thorup; Uri Zwick (SODA, 2002)

Jenga. - Uri Zwick (SODA, 2002)

Computer assisted proof of optimal approximability results. - Uri Zwick (SODA, 2002)

Coloring k-colorable graphs using relatively small palettes. - Eran Halperin; Ram Nathaniel; Uri Zwick (J. Algorithms, 2002)

Cell Identification Codes for Tracking Mobile Users. - Zohar Naor; Hanoch Levy; Uri Zwick (Wirel. Networks, 2002)

Connection caching: model and algorithms. - Edith Cohen; Haim Kaplan; Uri Zwick (J. Comput. Syst. Sci., 2003)

On Dynamic Shortest Paths Problems. - Liam Roditty; Uri Zwick (ESA, 2004)

Fast Sparse Matrix Multiplication. - Raphael Yuster; Uri Zwick (ESA, 2004)

Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. - Liam Roditty; Uri Zwick (FOCS, 2004)

Multicriteria Global Minimum Cuts. - Amitai Armon; Uri Zwick (ISAAC, 2004)

A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths. - Uri Zwick (ISAAC, 2004)

Meldable RAM priority queues and minimum directed spanning trees. - Ran Mendelson; Mikkel Thorup; Uri Zwick (SODA, 2004)

Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. - Raphael Yuster; Uri Zwick (SODA, 2004)

A fully dynamic reachability algorithm for directed graphs with an almost linear update time. - Liam Roditty; Uri Zwick (STOC, 2004)

Melding Priority Queues. - Ran Mendelson; Robert Endre Tarjan; Mikkel Thorup; Uri Zwick (SWAT, 2004)

Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT. - Adi Avidor; Uri Zwick (APPROX-RANDOM, 2005)

Answering distance queries in directed graphs using fast matrix multiplication. - Raphael Yuster; Uri Zwick (FOCS, 2005)

Union-Find with Constant Time Deletions. - Stephen Alstrup; Inge Li Gørtz; Theis Rauhe; Mikkel Thorup; Uri Zwick (ICALP, 2005)

Deterministic Constructions of Approximate Distance Oracles and Spanners. - Liam Roditty; Mikkel Thorup; Uri Zwick (ICALP, 2005)

Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. - Liam Roditty; Uri Zwick (ICALP, 2005)

Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT. - Adi Avidor; Ido Berkovitch; Uri Zwick (WAOA, 2005)

Approximating MIN 2-SAT and MIN 3-SAT. - Adi Avidor; Uri Zwick (Theory Comput. Syst., 2005)

A deterministic subexponential algorithm for solving parity games. - Marcin Jurdzinski; Mike Paterson; Uri Zwick (SODA, 2006)

Overhang. - Mike Paterson; Uri Zwick (SODA, 2006)

Spanners and emulators with sublinear distance errors. - Mikkel Thorup; Uri Zwick (SODA, 2006)

A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths. - Uri Zwick (Algorithmica, 2006)

New Bounds for the Nearly Equitable Edge Coloring Problem. - Xuzhen Xie; Mutsunori Yagiura; Takao Ono; Tomio Hirata; Uri Zwick (ISAAC, 2007)

All-pairs bottleneck paths in vertex weighted graphs. - Asaf Shapira; Raphael Yuster; Uri Zwick (SODA, 2007)

Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. - Amnon Ta-Shma; Uri Zwick (SODA, 2007)

Maximum matching in graphs with an excluded minor. - Raphael Yuster; Uri Zwick (SODA, 2007)

Simple Stochastic Games, Mean Payoff Games, Parity Games. - Uri Zwick (CSR, 2008)

Maximum overhang. - Mike Paterson; Yuval Peres; Mikkel Thorup; Peter Winkler 001; Uri Zwick (SODA, 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 (WABI, 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)

Color Coding. - Noga Alon; Raphael Yuster; Uri Zwick (Encyclopedia of Algorithms, 2008)

A simpler implementation and analysis of Chazelle's soft heaps. - Haim Kaplan; Uri Zwick (SODA, 2009)

Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. - Omid Madani; Mikkel Thorup; Uri Zwick (SODA, 2009)

Efficient algorithms for the 2-gathering problem. - Alon Shalita; Uri Zwick (SODA, 2009)

All-Pairs Shortest Paths in O(n2) Time with High Probability. - Yuval Peres; Dmitry Sotnikov; Benny Sudakov; Uri Zwick (FOCS, 2010)

Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles. - Thomas Dueholm Hansen; Uri Zwick (ISAAC (1), 2010)

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 (ICS, 2011)

A subexponential lower bound for the Random Facet algorithm for Parity Games. - Oliver Friedmann; Thomas Dueholm Hansen; Uri Zwick (SODA, 2011)

Collapse. - Günter Rote; Uri Zwick (SODA, 2011)

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. - Oliver Friedmann; Thomas Dueholm Hansen; Uri Zwick (STOC, 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)

A Forward-Backward Single-Source Shortest Paths Algorithm. - David B. Wilson 002; Uri Zwick (FOCS, 2013)

All-pairs shortest paths in O(n2) time with high probability. - Yuval Peres; Dmitry Sotnikov; Benny Sudakov; Uri Zwick (J. ACM, 2013)

Soft Heaps Simplified. - Haim Kaplan; Robert Endre Tarjan; Uri Zwick (SIAM J. Comput., 2013)

Listing Triangles. - Andreas Björklund; Rasmus Pagh; Virginia Vassilevska Williams; Uri Zwick (ICALP (1), 2014)

Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. - Thomas Dueholm Hansen; Haim Kaplan; Uri Zwick (SODA, 2014)

Improved upper bounds for Random-Edge and Random-Jump on abstract cubes. - Thomas Dueholm Hansen; Mike Paterson; Uri Zwick (SODA, 2014)

Random-Facet and Random-Bland require subexponential time even for shortest paths. - Oliver Friedmann; Thomas Dueholm Hansen; 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)

Fibonacci Heaps Revisited. - Haim Kaplan; Robert Endre Tarjan; Uri Zwick (CoRR, 2014)

Hollow Heaps. - Thomas Dueholm Hansen; Haim Kaplan; Robert Endre Tarjan; Uri Zwick (ICALP (1), 2015)

The amortized cost of finding the minimum. - Haim Kaplan; Or Zamir; Uri Zwick (SODA, 2015)

Adjacency Labeling Schemes and Induced-Universal Graphs. - Stephen Alstrup; Haim Kaplan; Mikkel Thorup; Uri Zwick (STOC, 2015)

An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm. - Thomas Dueholm Hansen; Uri Zwick (STOC, 2015)

Random-Edge Is Slower Than Random-Facet on Abstract Cubes. - Thomas Dueholm Hansen; Uri Zwick (ICALP, 2016)

Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity. - Orr Fischer; Rotem Oshman; Uri Zwick (SIROCCO, 2016)

Bottleneck Paths and Trees and Deterministic Graphical Games. - Shiri Chechik; Haim Kaplan; Mikkel Thorup; Or Zamir; Uri Zwick (STACS, 2016)

Color Coding. - Noga Alon; Raphael Yuster; Uri Zwick (Encyclopedia of Algorithms, 2016)

Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. - Dani Dorfman; Haim Kaplan; László Kozma 002; Seth Pettie; Uri Zwick (ESA, 2018)

Pairing heaps: the forward variant. - Dani Dorfman; Haim Kaplan; László Kozma 002; Uri Zwick (MFCS, 2018)

Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. - Jacob Holm; Valerie King; Mikkel Thorup; Or Zamir; Uri Zwick (FOCS, 2019)

A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games. - Dani Dorfman; Haim Kaplan; Uri Zwick (ICALP, 2019)

Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. - Mikkel Thorup; Or Zamir; Uri Zwick (ICALP, 2019)

Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. - Haim Kaplan; László Kozma 002; Or Zamir; Uri Zwick (SOSA, 2019)

A sort of an adversary. - Haim Kaplan; Or Zamir; Uri Zwick (SODA, 2019)

Faster k-SAT algorithms using biased-PPSZ. - Thomas Dueholm Hansen; Haim Kaplan; Or Zamir; Uri Zwick (STOC, 2019)

On the Mysteries of MAX NAE-SAT. - Joshua Brakensiek; Neng Huang; Aaron Potechin; Uri Zwick (SODA, 2021)

TheoretiCS. - Javier Esparza; Uri Zwick (Bull. EATCS, 2021)

Algorithmic trade-offs for girth approximation in undirected graphs. - Avi Kadria; Liam Roditty; Aaron Sidford; Virginia Vassilevska Williams; Uri Zwick (SODA, 2022)

Simulating a stack using queues. - Haim Kaplan; Robert E. Tarjan; Or Zamir; Uri Zwick (SODA, 2022)

Optimal Energetic Paths for Electric Cars. - Dani Dorfman; Haim Kaplan; Robert E. Tarjan; Uri Zwick (ESA, 2023)

Separating MAX 2-AND, MAX DI-CUT and MAX CUT. - Joshua Brakensiek; Neng Huang; Aaron Potechin; Uri Zwick (FOCS, 2023)

Improved girth approximation in weighted undirected graphs. - Avi Kadria; Liam Roditty; Aaron Sidford; Virginia Vassilevska Williams; Uri Zwick (SODA, 2023)

Optimal resizable arrays. - Robert E. Tarjan; Uri Zwick (SOSA, 2023)

Tight approximability of MAX 2-SAT and relatives, under UGC. - Joshua Brakensiek; Neng Huang; Uri Zwick (SODA, 2024)

Minimum-cost paths for electric cars. - Dani Dorfman; Haim Kaplan; Robert E. Tarjan; Mikkel Thorup; Uri Zwick (SOSA, 2024)

Finding strong components using depth-first search. - Robert E. Tarjan; Uri Zwick (Eur. J. Comb., 2024)

Faster All-Pairs Optimal Electric Car Routing. - Dani Dorfman; Haim Kaplan; Robert E. Tarjan; Mikkel Thorup; Uri Zwick (ICALP, 2025)

All-Hops Shortest Paths. - Virginia Vassilevska Williams; Zoe Xi; Yinzhan Xu; Uri Zwick (SODA, 2025)

Search Trees on Trees via LP. - Yaniv Sadeh; Haim Kaplan; Uri Zwick (CoRR, 2025)