Peter Winkler 0001

SODA Conference 2009 Conference Paper

Sorting by placement and shift

• Sergi Elizalde
• Peter Winkler 0001

SODA Conference 2008 Conference Paper

Maximum overhang

• Mike Paterson
• Yuval Peres
• Mikkel Thorup
• Peter Winkler 0001
• Uri Zwick

SODA Conference 2004 Invited Paper

How random is the human genome?

• Peter Winkler 0001

SODA Conference 2003 Conference Paper

Wavelength assignment and generalized interval graph coloring

• Peter Winkler 0001
• Lisa Zhang 0001

SODA Conference 2001 Conference Paper

Universal configurations in light-flipping games

• Yevgeniy Dodis
• Peter Winkler 0001

SODA Conference 1998 Conference Paper

Ring Routing and Wavelength Translation

• Gordon T. Wilfong
• Peter Winkler 0001

STOC Conference 1995 Conference Paper

Efficient stopping rules for Markov chains

• László Lovász 0001
• Peter Winkler 0001

SODA Conference 1992 Conference Paper

On Playing "Twenty Questions" with a Liar

• Aditi Dhagat
• Péter Gács
• Peter Winkler 0001

SODA Conference 1992 Conference Paper

On the Number of Eularian Orientations of a Graph

• Milena Mihail
• Peter Winkler 0001

STOC Conference 1992 Conference Paper

Target Shooting with Programmed Random Variables

• Graham R. Brightwell
• Teunis J. Ott
• Peter Winkler 0001

STOC Conference 1991 Conference Paper

Counting Linear Extensions is #P-Complete

• Graham R. Brightwell
• Peter Winkler 0001

FOCS Conference 1990 Conference Paper

Computing with Snakes in Directed Networks of Automata (Extended Abstract)

• Shimon Even
• Ami Litman
• Peter Winkler 0001

Directed, strongly connected networks of finite-state automata, of bounded in- and outdegree but unknown topology and unbounded size n, are considered. Protocols that are quadratic or linear in n and accomplish the following tasks are provided: waking up and reporting when done, constructing smart spanning trees out from the root and in to the root, conducting breadth-first and depth-first searches, sending a message from the endpoint of a (directed) edge to its startpoint, running a slow clock, and solving the firing squad synchronization problem. The protocols are highly parallel and entail the use of sequences of signals called 'snakes''. All the tasks are accomplished in less time than is possible with any previously known techniques. >