Peter Winkler

According to our database1, Peter Winkler
  • authored at least 149 papers between 1980 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Firefighting on Geometric Graphs with Density Bounds.
Ars Comb., 2017

Mixing of Permutations by Biased Transposition.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016
Cop vs. Gambler.
Discrete Mathematics, 2016

Mixing of Permutations by Biased Transposition.
CoRR, 2016

2015
Firefighting on a random geometric graph.
Random Struct. Algorithms, 2015

Abelian logic gates.
CoRR, 2015

2014
Performance evaluation of fragmented structures: A theoretical study.
Perform. Eval., 2014

Mixing Times and Moving Targets.
Combinatorics, Probability & Computing, 2014

New Bounds for Edge-Cover by Random Walk.
Combinatorics, Probability & Computing, 2014

Capturing the Drunk Robber on a Graph.
Electr. J. Comb., 2014

Puzzled: Solutions and sources.
Commun. ACM, 2014

Puzzled: Paths and Matchings.
Commun. ACM, 2014

Puzzled: Solutions and sources.
Commun. ACM, 2014

Puzzled: A Sort, of Sorts.
Commun. ACM, 2014

Puzzled: Solutions and sources.
Commun. ACM, 2014

Puzzled: Lowest Number Wins.
Commun. ACM, 2014

Cryptogenography.
Proceedings of the Innovations in Theoretical Computer Science, 2014

2013
Cops vs. Gambler.
CoRR, 2013

Puzzled: Solutions and sources.
Commun. ACM, 2013

Puzzled: Coin flipping.
Commun. ACM, 2013

Puzzled.
Commun. ACM, 2013

Puzzled.
Commun. ACM, 2013

Puzzled answers.
Commun. ACM, 2013

Puzzled.
Commun. ACM, 2013

Puzzled.
Commun. ACM, 2013

Puzzled.
Commun. ACM, 2013

Impeding forgers at photo inception.
Proceedings of the Media Watermarking, 2013

On the Isolation of a Common Secret.
Proceedings of the Mathematics of Paul Erdős II, 2013

2012
Puzzled.
Commun. ACM, 2012

Puzzled.
Commun. ACM, 2012

Puzzled.
Commun. ACM, 2012

Puzzled.
Commun. ACM, 2012

Puzzled.
Commun. ACM, 2012

Puzzled.
Commun. ACM, 2012

Puzzled.
Commun. ACM, 2012

Puzzled.
Commun. ACM, 2012

2011
Review: Famous Puzzles of Great Mathematicians. American Mathematical Society, Providence, RI, 2009, xviii + 325 pp., ISBN 978-0-8218-4814-2, $36. by Miodrag S. Petkovič.
The American Mathematical Monthly, 2011

Two-Color Babylon
CoRR, 2011

New Bounds for Edge-Cover by Random Walk
CoRR, 2011

Puzzled.
Commun. ACM, 2011

Puzzled.
Commun. ACM, 2011

Puzzled.
Commun. ACM, 2011

Puzzled.
Commun. ACM, 2011

Puzzled.
Commun. ACM, 2011

Puzzled.
Commun. ACM, 2011

Puzzled.
Commun. ACM, 2011

Puzzled.
Commun. ACM, 2011

2010
Building Graphs from Colored Trees.
Electr. J. Comb., 2010

Puzzled: Solutions and sources.
Commun. ACM, 2010

Puzzled.
Commun. ACM, 2010

Puzzled.
Commun. ACM, 2010

Puzzled.
Commun. ACM, 2010

Puzzled.
Commun. ACM, 2010

Puzzled.
Commun. ACM, 2010

Puzzled.
Commun. ACM, 2010

Breaking chocolate bars.
Commun. ACM, 2010

2009
Maximum Overhang.
The American Mathematical Monthly, 2009

Branched Polymers.
The American Mathematical Monthly, 2009

Submodular Percolation.
SIAM J. Discrete Math., 2009

Puzzled - Solutions and sources.
Commun. ACM, 2009

Puzzled - Covering the plane.
Commun. ACM, 2009

Puzzled - Solutions and sources.
Commun. ACM, 2009

Puzzled - Probability and intuition.
Commun. ACM, 2009

Puzzled - Solutions and sources.
Commun. ACM, 2009

Puzzled - Understanding relationships among numbers.
Commun. ACM, 2009

Puzzled - Solutions and sources.
Commun. ACM, 2009

Puzzled - Will my algorithm terminate?
Commun. ACM, 2009

Sorting by placement and shift.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
On a Form of Coordinate Percolation.
Combinatorics, Probability & Computing, 2008

Sorting by Placement and Shift
CoRR, 2008

Puzzled - Solutions and sources.
Commun. ACM, 2008

Puzzled: Circular food.
Commun. ACM, 2008

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

2007
Luck vs. Skill.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006
A Solidification Phenomenon in Random Packings.
SIAM J. Math. Analysis, 2006

Dominating sets in k-majority tournaments.
J. Comb. Theory, Ser. B, 2006

Data Synchronization Methods Based on ShuffleNet and Hypercube for Networked Information Systems.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

2005
Mixing Points on a Circle.
Proceedings of the Approximation, 2005

Mixing Points on an Interval.
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.
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.
Random Struct. Algorithms, 2004

A second threshold for the hard-core model on a Bethe lattice.
Random Struct. Algorithms, 2004

Note on Counting Eulerian Circuits
CoRR, 2004

Medical Applications of Multi-field Volume Rendering and VR Techniques.
Proceedings of the VisSym 2004, 2004

How random is the human genome?
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
On Playing Golf with Two Balls.
SIAM J. Discrete Math., 2003

Wavelength assignment and generalized interval graph coloring.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Packing rectangles in a strip.
Acta Inf., 2002

Clustering and Server Selection using Passive Monitoring.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

Wide-Sense Nonblocking WDM Cross-Connects.
Proceedings of the Algorithms, 2002

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

2001
Optimal Carrier Sharing in Wireless TDMA.
Journal of Interconnection Networks, 2001

Optimality and Greed in Dynamic Allocation.
J. Algorithms, 2001

Universal configurations in light-flipping games.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Graph Homomorphisms and Long Range Action.
Proceedings of the Graphs, 2001

2000
Dependent percolation and colliding random walks.
Random Struct. Algorithms, 2000

Gibbs Measures and Dismantlable Graphs.
J. Comb. Theory, Ser. B, 2000

Optimal linear arrangement of a rectangular grid.
Discrete Mathematics, 2000

Average-Case Analysis of Retangle Packings.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999
The Ring Loading Problem.
SIAM Review, 1999

Erratum: Mean distance and minimum degree.
Journal of Graph Theory, 1999

Graph Homomorphisms and Phase Transitions.
J. Comb. Theory, Ser. B, 1999

1998
The Ring Loading Problem.
SIAM J. Discrete Math., 1998

Ramsey Theory and Sequences of Random Variables.
Combinatorics, Probability & Computing, 1998

Reversal of Markov Chains and the Forget Time.
Combinatorics, Probability & Computing, 1998

Ring Routing and Wavelength Translation.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997
Mean distance and minimum degree.
Journal of Graph Theory, 1997

Computing with Snakes in Directed Networks of Automata.
J. Algorithms, 1997

Mixing times.
Proceedings of the Microsurveys in Discrete Probability, 1997

1996
Multiple cover time.
Random Struct. Algorithms, 1996

Shuffling Biological Sequences.
Discrete Applied Mathematics, 1996

Comparing Information Without Leaking It.
Commun. ACM, 1996

On the Number of Eulerian Orientations of a Graph.
Algorithmica, 1996

1995
On the Size of a Random Maximal Graph.
Random Struct. Algorithms, 1995

Monotone Gray Codes and the Middle Levels Problem.
J. Comb. Theory, Ser. A, 1995

Exact Mixing in an Unknown Markov Chain.
Electr. J. Comb., 1995

Efficient stopping rules for Markov chains.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

A Key Escrow System with Warrant Bounds.
Proceedings of the Advances in Cryptology, 1995

1994
Bounding the Vertex Cover Number of a Hypergraph.
Combinatorica, 1994

1993
Collisions Among Random Walks on a Graph.
SIAM J. Discrete Math., 1993

A note on the last new vertex visited by a random walk.
Journal of Graph Theory, 1993

Fast Information Sharing in a Complete Network.
Discrete Applied Mathematics, 1993

1992
Three Thresholds for a Liar.
Combinatorics, Probability & Computing, 1992

Target Shooting with Programmed Random Variables
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

On the Number of Eularian Orientations of a Graph.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

On Playing "Twenty Questions" with a Liar.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

1991
The number of t-wise balance designs.
Combinatorica, 1991

Counting Linear Extensions is #P-Complete
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

On a Random Walk Problem Arising in Self-Stabilizing Token Management.
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

1990
Maximal Chains and Antichains in Boolean Lattices.
SIAM J. Discrete Math., 1990

Maximum itting Time for Random Walks on Graphs.
Random Struct. Algorithms, 1990

Extremal cover times for random walks on trees.
Journal of Graph Theory, 1990

Mean distance in a tree.
Discrete Applied Mathematics, 1990

Computing with Snakes in Directed Networks of Automata (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
A Ramsey-Type Theorem for Orderings of a Graph.
SIAM J. Discrete Math., 1989

1988
The Complexity of Metric Realization.
SIAM J. Discrete Math., 1988

1987
Every connected graph is a query graph.
Journal of Graph Theory, 1987

Factoring a Graph in Polynomial Time.
Eur. J. Comb., 1987

1986
Collapse of the Metric Hierarchy for Bipartite Graphs.
Eur. J. Comb., 1986

1985
On the addressing problem for directed graphs.
Graphs and Combinatorics, 1985

1984
Isometric embedding in products of complete graphs.
Discrete Applied Mathematics, 1984

1983
Existence of graphs with a given set of r-neighborhoods.
J. Comb. Theory, Ser. B, 1983

Vertex-to-vertex pursuit in a graph.
Discrete Mathematics, 1983

On families of finite sets with bounds on unions and intersections.
Discrete Mathematics, 1983

The Advent of Cryptology in the Game of Bridge.
Cryptologia, 1983

Proof of the squashed cube conjecture.
Combinatorica, 1983

1982
On Computability of the Mean Deviation.
Inf. Process. Lett., 1982

Average height in a partially ordered set.
Discrete Mathematics, 1982

1980
On connectivity of triangulations of manifolds.
Discrete Mathematics, 1980


  Loading...