Peter M. Winkler
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| j86 | ||
| j85 | ||
| j84 | ||
| 2012 | ||
| j83 | ||
| j82 | ||
| j81 | ||
| j80 | ||
| j79 | ||
| j78 | ||
| j77 | ||
| j76 | ||
| 2011 | ||
| j75 | ||
| j74 | ||
| j73 | ||
| j72 | ||
| j71 | ||
| j70 | ||
| j69 | ||
| j68 | ||
| j67 | Peter Winkler: 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 118(7): 661-664 (2011) | |
| i4 | Agelos Georgakopoulos, Peter Winkler: New Bounds for Edge-Cover by Random Walk. CoRR abs/1109.6619 (2011) | |
| i3 | ||
| 2010 | ||
| j66 | ||
| j65 | ||
| j64 | ||
| j63 | ||
| j62 | ||
| j61 | ||
| j60 | ||
| j59 | ||
| j58 | Rachel M. Esselstein, Peter Winkler: Building Graphs from Colored Trees. Electr. J. Comb. 17(1) (2010) | |
| 2009 | ||
| j57 | ||
| j56 | ||
| j55 | ||
| j54 | ||
| j53 | ||
| j52 | ||
| j51 | ||
| j50 | ||
| j49 | Graham Brightwell, Peter Winkler: Submodular Percolation. SIAM J. Discrete Math. 23(3): 1149-1178 (2009) | |
| j48 | Richard Kenyon, Peter Winkler: Branched Polymers. The American Mathematical Monthly 116(7): 612-628 (2009) | |
| j47 | Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick: Maximum Overhang. The American Mathematical Monthly 116(9): 763-787 (2009) | |
| c29 | ||
| 2008 | ||
| j46 | ||
| j45 | ||
| j44 | Elizabeth R. Moseman, Peter Winkler: On a Form of Coordinate Percolation. Combinatorics, Probability & Computing 17(6): 837-845 (2008) | |
| c28 | Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick: Maximum overhang. SODA 2008: 756-765 | |
| i2 | ||
| 2007 | ||
| c27 | ||
| 2006 | ||
| j43 | Noga Alon, Graham Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler: Dominating sets in k-majority tournaments. J. Comb. Theory, Ser. B 96(3): 374-387 (2006) | |
| c26 | David J. Houck, Kin K. Leung, Peter Winkler: Data Synchronization Methods Based on ShuffleNet and Hypercube for Networked Information Systems. INFOCOM 2006 | |
| 2005 | ||
| c25 | ||
| c24 | Graham Brightwell, Peter Winkler: Counting Eulerian Circuits is #P-Complete. ALENEX/ANALCO 2005: 259-262 | |
| c23 | ||
| 2004 | ||
| j42 | Graham Brightwell, Peter Winkler: A second threshold for the hard-core model on a Bethe lattice. Random Struct. Algorithms 24(3): 303-314 (2004) | |
| j41 | Malwina J. Luczak, Peter Winkler: Building uniformly random subtrees. Random Struct. Algorithms 24(4): 420-443 (2004) | |
| c22 | ||
| c21 | Joe Kniss, Jürgen P. Schulze, Uwe Wössner, Peter Winkler, Ulrich Lang, Charles D. Hansen: Medical Applications of Multi-field Volume Rendering and VR Techniques. VisSym 2004: 249-254, 350 | |
| i1 | ||
| 2003 | ||
| j40 | Ioana Dumitriu, Prasad Tetali, Peter Winkler: On Playing Golf with Two Balls. SIAM J. Discrete Math. 16(4): 604-615 (2003) | |
| c20 | Peter Winkler, Lisa Zhang: Wavelength assignment and generalized interval graph coloring. SODA 2003: 830-831 | |
| 2002 | ||
| j39 | Edward G. Coffman Jr., Peter J. Downey, Peter M. Winkler: Packing rectangles in a strip. Acta Inf. 38(10): 673-693 (2002) | |
| c19 | ||
| c18 | Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler: Wide-Sense Nonblocking WDM Cross-Connects. ESA 2002: 538-549 | |
| c17 | Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane: Clustering and Server Selection using Passive Monitoring. INFOCOM 2002 | |
| 2001 | ||
| j38 | ||
| j37 | Sem C. Borst, Edward G. Coffman Jr., Edgar N. Gilbert, Philip A. Whiting, Peter M. Winkler: Optimal Carrier Sharing in Wireless TDMA. Journal of Interconnection Networks 2(2): 189-211 (2001) | |
| c16 | ||
| 2000 | ||
| j36 | Peter C. Fishburn, Prasad Tetali, Peter Winkler: Optimal linear arrangement of a rectangular grid. Discrete Mathematics 213(1-3): 123-139 (2000) | |
| j35 | Graham Brightwell, Peter Winkler: Gibbs Measures and Dismantlable Graphs. J. Comb. Theory, Ser. B 78(1): 141-166 (2000) | |
| j34 | Peter Winkler: Dependent percolation and colliding random walks. Random Struct. Algorithms 16(1): 58-84 (2000) | |
| c15 | Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler: Average-Case Analysis of Retangle Packings. LATIN 2000: 292-297 | |
| 1999 | ||
| j33 | Graham Brightwell, Peter Winkler: Graph Homomorphisms and Phase Transitions. J. Comb. Theory, Ser. B 77(2): 221-262 (1999) | |
| j32 | Mekkia Kouider, Peter Winkler: Erratum: Mean distance and minimum degree. Journal of Graph Theory 30(3): 243 (1999) | |
| 1998 | ||
| j31 | László Lovász, Peter Winkler: Reversal of Markov Chains and the Forget Time. Combinatorics, Probability & Computing 7(2): 189-204 (1998) | |
| j30 | William T. Trotter, Peter Winkler: Ramsey Theory and Sequences of Random Variables. Combinatorics, Probability & Computing 7(2): 221-238 (1998) | |
| j29 | Alexander Schrijver, Paul D. Seymour, Peter Winkler: The Ring Loading Problem. SIAM J. Discrete Math. 11(1): 1-14 (1998) | |
| c14 | ||
| 1997 | ||
| j28 | Shimon Even, Ami Litman, Peter Winkler: Computing with Snakes in Directed Networks of Automata. J. Algorithms 24(1): 158-170 (1997) | |
| j27 | Mekkia Kouider, Peter Winkler: Mean distance and minimum degree. Journal of Graph Theory 25(1): 95-99 (1997) | |
| 1996 | ||
| j26 | Milena Mihail, Peter Winkler: On the Number of Eulerian Orientations of a Graph. Algorithmica 16(4/5): 402-414 (1996) | |
| j25 | Ronald Fagin, Moni Naor, Peter Winkler: Comparing Information Without Leaking It. Commun. ACM 39(5): 77-85 (1996) | |
| j24 | Denise B. Kandel, Yossi Matias, Ron Unger, Peter Winkler: Shuffling Biological Sequences. Discrete Applied Mathematics 71(1-3): 171-185 (1996) | |
| j23 | ||
| 1995 | ||
| j22 | ||
| j21 | Carla D. Savage, Peter Winkler: Monotone Gray Codes and the Middle Levels Problem. J. Comb. Theory, Ser. A 70(2): 230-248 (1995) | |
| j20 | Paul Erdös, Stephen Suen, Peter Winkler: On the Size of a Random Maximal Graph. Random Struct. Algorithms 6(2/3): 309-318 (1995) | |
| c13 | Arjen K. Lenstra, Peter Winkler, Yacov Yacobi: A Key Escrow System with Warrant Bounds. CRYPTO 1995: 197-207 | |
| c12 | ||
| 1994 | ||
| j19 | Guoli Ding, Paul D. Seymour, Peter Winkler: Bounding the Vertex Cover Number of a Hypergraph. Combinatorica 14(1): 23-34 (1994) | |
| 1993 | ||
| j18 | Vaidy S. Sunderam, Peter Winkler: Fast Information Sharing in a Complete Network. Discrete Applied Mathematics 42(1): 75-86 (1993) | |
| j17 | László Lovász, Peter Winkler: A note on the last new vertex visited by a random walk. Journal of Graph Theory 17(5): 593-596 (1993) | |
| j16 | Don Coppersmith, Prasad Tetali, Peter Winkler: Collisions Among Random Walks on a Graph. SIAM J. Discrete Math. 6(3): 363-374 (1993) | |
| 1992 | ||
| j15 | Joel Spencer, Peter Winkler: Three Thresholds for a Liar. Combinatorics, Probability & Computing 1: 81-93 (1992) | |
| c11 | Aditi Dhagat, Péter Gács, Peter Winkler: On Playing "Twenty Questions" with a Liar. SODA 1992: 16-22 | |
| c10 | ||
| c9 | Graham Brightwell, Teunis J. Ott, Peter Winkler: Target Shooting with Programmed Random Variables. STOC 1992: 691-698 | |
| 1991 | ||
| j14 | Charles J. Colbourn, Dean G. Hoffman, Kevin T. Phelps, Vojtech Rödl, Peter Winkler: The number of t-wise balance designs. Combinatorica 11(3): 207-218 (1991) | |
| c8 | Peter Winkler: Production of Individual Dental Restorations Using CAD/CAM Technology. One-Of-A-Kind Production 1991: 3-8 | |
| c7 | Prasad Tetali, Peter Winkler: On a Random Walk Problem Arising in Self-Stabilizing Token Management. PODC 1991: 273-280 | |
| c6 | ||
| 1990 | ||
| j13 | ||
| j12 | Graham Brightwell, Peter Winkler: Extremal cover times for random walks on trees. Journal of Graph Theory 14(5): 547-554 (1990) | |
| j11 | Graham Brightwell, Peter Winkler: Maximum itting Time for Random Wlaks on Graphs. Random Struct. Algorithms 1(3): 263-276 (1990) | |
| j10 | Dwight Duffus, Bill Sands, Peter Winkler: Maximal Chains and Antichains in Boolean Lattices. SIAM J. Discrete Math. 3(2): 197-205 (1990) | |
| c5 | Shimon Even, Ami Litman, Peter Winkler: Computing with Snakes in Directed Networks of Automata (Extended Abstract). FOCS 1990: 740-745 | |
| 1989 | ||
| j9 | Vojtech Rödl, Peter Winkler: A Ramsey-Type Theorem for Orderings of a Graph. SIAM J. Discrete Math. 2(3): 402-406 (1989) | |
| 1988 | ||
| j8 | ||
| 1985 | ||
| j7 | Fan R. K. Chung, Ronald L. Graham, Peter M. Winkler: On the addressing problem for directed graphs. Graphs and Combinatorics 1(1): 41-50 (1985) | |
| c4 | Peter Winkler: Ein Beispiel für Modellierung und Simulation mit Petrinetz-Modellen. Simulationstechnik 1985: 129-135 | |
| 1983 | ||
| j6 | ||
| j5 | Richard J. Nowakowski, Peter Winkler: Vertex-to-vertex pursuit in a graph. Discrete Mathematics 43(2-3): 235-239 (1983) | |
| j4 | Chang M. Bang, Henry Sharp, Peter Winkler: On families of finite sets with bounds on unions and intersections. Discrete Mathematics 45(1): 123-126 (1983) | |
| j3 | Peter M. Winkler: Existence of graphs with a given set of r-neighborhoods. J. Comb. Theory, Ser. B 34(2): 165-176 (1983) | |
| c3 | Peter Winkler: Anforderungsbeschreibung und Simulation mit Net-Modellen. Requirements Engineering 1983: 198-207 | |
| 1982 | ||
| j2 | ||
| 1981 | ||
| c2 | Peter Winkler: Erste Erfahrungen mit dem interaktiven Entwurfswerkzeug BOIE. Fachtagung Prozessrechner 1981: 151-159 | |
| 1980 | ||
| j1 | Peter M. Winkler: On connectivity of triangulations of manifolds. Discrete Mathematics 32(1): 93-94 (1980) | |
| 1979 | ||
| c1 | ||
Colors in the list of coauthors
Last update Wed May 22 03:24:17 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page