A Forward-Backward Single-Source Shortest Paths Algorithm

A Forward-Backward Single-Source Shortest Paths Algorithm

All pairs lightest shortest paths

All pairs shortest paths using bridging sets and rectangular matrix multiplication

All-Pairs Small-Stretch Paths

An extension of Khrapchenko's theorem

Approximate distance oracles

Collapse

Color Coding

Compact routing schemes

Competitive Analysis of the LRFU Paging Algorithm

Connection caching

article published in 1999

Efficient algorithms for the 2-gathering problem

scholarly article by Alon Shalita & Uri Zwick published 1 March 2010 in ACM Transactions on Algorithms

Exact and Approximate Distances in Graphs — A Survey

Finding almost-satisfying assignments

scholarly article published 1998

Finding and counting given length cycles

Finding even cycles even faster

Hollow Heaps

article

How Do Read-Once Formulae Shrink?

Listing Triangles

MAX CUT in cubic graphs

Maximum Overhang

Multicriteria Global Minimum Cuts

Multicriteria Global Minimum Cuts

On Dynamic Shortest Paths Problems

Optimal Carry Save Networks

Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests

scholarly article by Shay Halperin & Uri Zwick published April 2001 in Journal of Algorithms

Overhang

Overhang

SOKOBAN and other motion planning problems

Shallow multiplication circuits and wise financial investments

Simple Stochastic Games, Mean Payoff Games, Parity Games

scholarly article

Soft Heaps Simplified

Spanners and emulators with sublinear distance errors

The memory game

Union-Find with Constant Time Deletions