Peter Winkler

Am. Math. Mon., 2011

2010

Building Graphs from Colored Trees.

[BibT_eX]

[DOI]

Rachel M. Esselstein

Electron. J. Comb., 2010

Breaking chocolate bars.

[BibT_eX]

[DOI]

Commun. ACM, 2010

2009

Branched Polymers.

[BibT_eX]

[DOI]

Richard W. Kenyon

Am. Math. Mon., 2009

Submodular Percolation.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Puzzled - Covering the plane.

[BibT_eX]

[DOI]

Commun. ACM, 2009

Puzzled - Probability and intuition.

[BibT_eX]

[DOI]

Commun. ACM, 2009

Puzzled - Understanding relationships among numbers.

[BibT_eX]

[DOI]

Commun. ACM, 2009

Puzzled - Will my algorithm terminate?

[BibT_eX]

[DOI]

Commun. ACM, 2009

Sorting by placement and shift.

[BibT_eX]

[DOI]

Sergi Elizalde

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

2008

On a Form of Coordinate Percolation.

[BibT_eX]

[DOI]

Elizabeth R. Moseman

Comb. Probab. Comput., 2008

Puzzled: Circular food.

[BibT_eX]

[DOI]

Commun. ACM, 2008

Maximum overhang.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Luck vs. Skill.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006

A Solidification Phenomenon in Random Packings.

[BibT_eX]

[DOI]

SIAM J. Math. Anal., 2006

Dominating sets in k-majority tournaments.

[BibT_eX]

[DOI]

Noga Alon

Hal A. Kierstead

Alexandr V. Kostochka

J. Comb. Theory B, 2006

Data Synchronization Methods Based on ShuffleNet and Hypercube for Networked Information Systems.

[BibT_eX]

[DOI]

David J. Houck

Kin K. Leung

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

2005

Mixing Points on a Circle.

[BibT_eX]

[DOI]

Dana Randall

Proceedings of the Approximation, 2005

Mixing Points on an Interval.

[BibT_eX]

[DOI]

Dana Randall

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

Counting Eulerian Circuits is #P-Complete.

[BibT_eX]

[DOI]

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

Building uniformly random subtrees.

[BibT_eX]

[DOI]

Malwina J. Luczak

Random Struct. Algorithms, 2004

A second threshold for the hard-core model on a Bethe lattice.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

Note on Counting Eulerian Circuits

[BibT_eX]

[DOI]

CoRR, 2004

How random is the human genome?

[BibT_eX]

[DOI]

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

2003

On Playing Golf with Two Balls.

[BibT_eX]

[DOI]

Ioana Dumitriu

SIAM J. Discret. Math., 2003

Wavelength assignment and generalized interval graph coloring.

[BibT_eX]

[DOI]

Lisa Zhang

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

Packing rectangles in a strip.

[BibT_eX]

[DOI]

Edward G. Coffman Jr.

Peter J. Downey

Acta Informatica, 2002

Clustering and Server Selection using Passive Monitoring.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

Wide-Sense Nonblocking WDM Cross-Connects.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

Rapid Mixing.

[BibT_eX]

[DOI]

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001

Optimal Carrier Sharing in Wireless TDMA.

[BibT_eX]

[DOI]

Sem C. Borst

Edward G. Coffman Jr.

Edgar N. Gilbert

Philip A. Whiting

J. Interconnect. Networks, 2001

Optimality and Greed in Dynamic Allocation.

[BibT_eX]

[DOI]

J. Algorithms, 2001

Universal configurations in light-flipping games.

[BibT_eX]

[DOI]

Yevgeniy Dodis

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Graph Homomorphisms and Long Range Action.

[BibT_eX]

[DOI]

Proceedings of the Graphs, 2001

2000

Dependent percolation and colliding random walks.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

Gibbs Measures and Dismantlable Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2000

Optimal linear arrangement of a rectangular grid.

[BibT_eX]

[DOI]

Peter C. Fishburn

Discret. Math., 2000

Average-Case Analysis of Retangle Packings.

[BibT_eX]

[DOI]

Edward G. Coffman Jr.

George S. Lueker

Joel Spencer

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

Erratum: Mean distance and minimum degree.

[BibT_eX]

[DOI]

Mekkia Kouider

J. Graph Theory, 1999

Graph Homomorphisms and Phase Transitions.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

1998

The Ring Loading Problem.

[BibT_eX]

[DOI]

Alexander Schrijver

Paul D. Seymour

SIAM J. Discret. Math., 1998

Ramsey Theory and Sequences of Random Variables.

[BibT_eX]

[DOI]

William T. Trotter

Comb. Probab. Comput., 1998

Reversal of Markov Chains and the Forget Time.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1998

Ring Routing and Wavelength Translation.

[BibT_eX]

[DOI]

Gordon T. Wilfong

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

1997

Mean distance and minimum degree.

[BibT_eX]

[DOI]

Mekkia Kouider

J. Graph Theory, 1997

Computing with Snakes in Directed Networks of Automata.

[BibT_eX]

[DOI]

Shimon Even

Ami Litman

J. Algorithms, 1997

Mixing times.

[BibT_eX]

[DOI]

Proceedings of the Microsurveys in Discrete Probability, 1997

1996

Multiple cover time.

[BibT_eX]

[DOI]

David Zuckerman

Random Struct. Algorithms, 1996

Shuffling Biological Sequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

Comparing Information Without Leaking It.

[BibT_eX]

[DOI]

Ronald Fagin

Moni Naor

Commun. ACM, 1996

On the Number of Eulerian Orientations of a Graph.

[BibT_eX]

[DOI]

Milena Mihail

Algorithmica, 1996

1995

On the Size of a Random Maximal Graph.

[BibT_eX]

[DOI]

Paul Erdös

Stephen Suen

Random Struct. Algorithms, 1995

Monotone Gray Codes and the Middle Levels Problem.

[BibT_eX]

Carla D. Savage

J. Comb. Theory A, 1995

Exact Mixing in an Unknown Markov Chain.

[BibT_eX]

[DOI]

Electron. J. Comb., 1995

Efficient stopping rules for Markov chains.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

A Key Escrow System with Warrant Bounds.

[BibT_eX]

[DOI]

Arjen K. Lenstra

Yacov Yacobi

Proceedings of the Advances in Cryptology, 1995

1994

Bounding the Vertex Cover Number of a Hypergraph.

[BibT_eX]

[DOI]

Guoli Ding

Paul D. Seymour

Comb., 1994

1993

Collisions Among Random Walks on a Graph.

[BibT_eX]

[DOI]

Don Coppersmith

SIAM J. Discret. Math., 1993

A note on the last new vertex visited by a random walk.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

Fast Information Sharing in a Complete Network.

[BibT_eX]

[DOI]

Vaidy S. Sunderam

Discret. Appl. Math., 1993

1992

Three Thresholds for a Liar.

[BibT_eX]

[DOI]

Joel Spencer

Comb. Probab. Comput., 1992

Target Shooting with Programmed Random Variables

[BibT_eX]

[DOI]

Teunis J. Ott

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

On the Number of Eularian Orientations of a Graph.

[BibT_eX]

[DOI]

Milena Mihail

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

On Playing "Twenty Questions" with a Liar.

[BibT_eX]

[DOI]

Aditi Dhagat

Péter Gács

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

1991

The number of t-wise balance designs.

[BibT_eX]

[DOI]

Comb., 1991

Counting Linear Extensions is #P-Complete

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

On a Random Walk Problem Arising in Self-Stabilizing Token Management.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

1990

Maximal Chains and Antichains in Boolean Lattices.

[BibT_eX]

[DOI]

Dwight Duffus

Bill Sands

SIAM J. Discret. Math., 1990

Maximum itting Time for Random Walks on Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

Extremal cover times for random walks on trees.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

Mean distance in a tree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

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

[BibT_eX]

[DOI]

Shimon Even

Ami Litman

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

1989

A Ramsey-Type Theorem for Orderings of a Graph.

[BibT_eX]

[DOI]

Vojtech Rödl

SIAM J. Discret. Math., 1989

1988

The Complexity of Metric Realization.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

1987

Every connected graph is a query graph.

[BibT_eX]

[DOI]

J. Graph Theory, 1987

Factoring a Graph in Polynomial Time.

[BibT_eX]

[DOI]

Eur. J. Comb., 1987

1986

Collapse of the Metric Hierarchy for Bipartite Graphs.

[BibT_eX]

[DOI]

R. L. Roth

Eur. J. Comb., 1986

1985

On the addressing problem for directed graphs.

[BibT_eX]

[DOI]

Fan R. K. Chung

Ronald L. Graham

Graphs Comb., 1985

1984

Isometric embedding in products of complete graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1984

1983

Existence of graphs with a given set of <i>r</i>-neighborhoods.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

Vertex-to-vertex pursuit in a graph.

[BibT_eX]

[DOI]

Richard J. Nowakowski

Discret. Math., 1983

On families of finite sets with bounds on unions and intersections.

[BibT_eX]

[DOI]

Chang M. Bang

Henry Sharp Jr.

Discret. Math., 1983

The Advent of Cryptology in the Game of Bridge.

[BibT_eX]

[DOI]

Cryptologia, 1983

Proof of the squashed cube conjecture.

[BibT_eX]

[DOI]

Comb., 1983

1982

On Computability of the Mean Deviation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

Average height in a partially ordered set.

[BibT_eX]

[DOI]

Discret. Math., 1982

1980

On connectivity of triangulations of manifolds.

[BibT_eX]

[DOI]