- [16] Y. Rinott, Multivariate majorization and rearrangement inequalities with some appli cations to probability and statistics, Israel J. Math. 15 (1973), 60--77.
- Sorting by Placement and Shift Sergi Elizalde
- COMBINATORICA Akad'emiai Kiad'o --SpringerVerlag
- SIAM J. DISCRETE MATH. c 2009 Society for Industrial and Applied Mathematics Vol. 23, No. 3, pp. 11491178
- Foundations of Computer Science (1989) 514--519. [28] L.G. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979)
- Mixing Times for Uniformly Ergodic Markov Chains David Aldous 1 and L'aszl'o Lov'asz 2 and Peter Winkler 3
- Computing with Snakes in Directed Networks of Automata Shimon Even*, Ami Litman* and Peter Winkler*
- the problem. For example, setting all targets equal to 0 (or to any other constant) is tantamount to trying to balance the loads equally.
- Games People Don't Play Peter Winkler, Bell Labs, Murray Hill NJ 07974
- the electronic journal of combinatorics 2 (1995), #Rnn 12 [12] A.K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari, The electrical
- 1. Alon, N. and Spencer, J. H. (1991), The Probabilistic Method, Wiley & Sons, New York. 2. Coffman, E. G., Jr., Mallows, C. L., and Poonen, Bjorn (1994), ``Parking Arcs on the
- Hard Constraints and the Bethe Lattice: Adventures at the Interface of
- Wavelength Assignment and Generalized Interval Graph Coloring (Short Form Abstract)
- Clustering and Server Selection using Passive Monitoring Matthew Andrews Bruce Shepherd Aravind Srinivasan Peter Winkler
- [10] D. Coppersmith, P. Tetali, and P. Winkler, Collisions among Random Walks on a Graph, SIAM J. on Dis
- Widesense Nonblocking WDM Crossconnects Penny Haxell \Lambda April Rasala y Gordon Wilfong z Peter Winkler x
- Five Algorithmic Puzzles Peter Winkler, Bell Labs, Murray Hill NJ 07974
- On Playing Golf With Two Balls Ioana Dumitriu Prasad Tetali y Peter Winkler z
- Mixing Points on an Interval Dana Randall # Peter Winkler +
- Optimality and Greed in Dynamic Allocation
- Building Uniformly Random Subtrees Malwina Luczak
- Mixing Points on a Circle Dana Randall 1? and Peter Winkler 2??
- each j, 1 j m, two of those nodes labeled by u j;1 ; u j;2 and u j;3 so that the one that is not placed in
- Counting Eulerian Circuits is #PComplete Graham R. Brightwell # Peter Winkler +
- Maximum Overhang (extended abstract)
- The Spanning Tree Enumeration Problem for Digraphs
- Random Colorings of a Cayley Tree Graham R. Brightwell \Lambda
- THE RING LOADING PROBLEM ALEXANDER SCHRIJVER y , PAUL SEYMOUR z , AND PETER WINKLER x
- A Second Threshold for the Hard-core Model on a Bethe Lattice
- Fast Information Sharing in a Complete Network V.S. Sunderam, Emory University
- Optimal Carrier Sharing in Wireless TDMA S.C. Borst \Lambda , E.G. Coffman y , E.N. Gilbert, P.A. Whiting, and P.M. Winkler
- Corrections to Mathematical Mind-Benders (contributed by eagle-eyed readers--the kind I love. Special thanks to Svante Janson, who,
- THE RING LOADING PROBLEM # ALEXANDER SCHRIJVER + , PAUL SEYMOUR # , AND PETER WINKLER
- RAMSEY THEORY FOR PROBABILITY SPACES 17 [15] W. T. Trotter, Combinatorics and partially Ordered Sets: Dimension Theory, The Johns
- Dependent Percolation and Colliding Random Walks Peter Winkler \Lambda
- [8] P. Dagum, M. Luby, M. Mihail, and U. Vazirani, Polytopes, permanents and graphs with large factors, 29th Annual IEEE Symposium on Foundations of Computer Science (1989),
- Seven Puzzles You Think You Must Not Have Heard Correctly with solutions
- On a Form of Coordinate Percolation Elizabeth R. Moseman
- Branched Polymers Richard Kenyon and Peter Winkler
- Three Thresholds for a Liar Joel Spencer \Lambda
- 36 L. Lov'asz and P. Winkler [44] E. R. Speer, Asymmetric Abelian sandpile models, J. Stat. Phys. 71
- On the Economics of Multicasting Yuval Shavitt
- [4] D.J. Aldous and P. Diaconis, Shuffling cards and stopping times, Amer. Math. Monthly 93 No. 5 (1986), 333--348.
- Ronald Fagin, Moni Naor, and Peter Winkler
- [1] R.J. Baxter, Exactly Solved Models in Statistical Mechanics, Academic Press, London (1982). [2] J. van den Berg and J.E. Steif, Percolation and the hardcore lattice gas model, Stochastic
- On the Isolation of a Common Secret Don Beaver, Stuart Haber and Peter Winkler
- bucket. Then again the usual reduction to the n = 1 case can be effected, and one can verify that there is a wellbehaved
- Fluid/solid transition in a hardcore system Lewis Bowen # and Russell Lyons +
- Maximum Overhang Mike Paterson Yuval Peres Mikkel Thorup Peter Winkler Uri Zwick
- [19] R.L. Rivest and R.E. Schapire, Inference of finite automata using homing sequences, In formation and Computation 103 #2 (1993), 299347.
- [8] D. Coppersmith, P. Doyle, P. Raghavan and M. Snir, Random walks on weighted graphs, and applications to online algorithms, Proc. 22nd Annual ACM Symposium on Theory
- Graph Homomorphisms and Long Range Action
- A Key Escrow System with Warrant Bounds Arjen K. Lenstra 1 , Peter Winkler 2 , Yacov Yacobi 3
- [AD91] Javed Aslam and Aditi Dhagat. Searching in the presence of linearly bounded errors. To Appear In STOC, 1991.
- [1] B. Bollob'as, Random Graphs, Academic Press, 1985. [2] P. Erdos & A. Renyi, On the evolution of random graphs, Publ. Math. Inst. Hungar.
- Packing Rectangles in a Strip E. G. Co man, Jr.
- References. [1] M. Dyer and A. Frieze, On the complexity of computing the volume of a polyhedron, SIAM
- [19] E. Ukkonen. Approximate string matching with qgrams and maximal matches. Theo retical Computer Science, 92:191--211, 1992.
- Gibbs Measures and Dismantlable Graphs Graham R. Brightwell \Lambda
- [18] M. Jerrum and A. Sinclair, Conductance and the rapid mixing property for Markov chains: the approximation of the permanent resolved, Proc. 20nd Annual ACM Symposium on
- [3] Van den Berg, J. and Ermakov, A. (1996) A new lower bound for the critical probability of site percolation on the square lattice, Random Structures & Algorithms 8, 199--212.
- Building Graphs from Colored Trees Rachel M. Esselstein
- Dominating Sets in k-Majority Tournaments Graham Brightwell