The following pages link to Peter Winkler (Q221782):
Displaying 50 items.
- Cop vs. gambler (Q267177) (← links)
- (Q378051) (redirect page) (← links)
- Can extra updates delay mixing? (Q378052) (← links)
- Capturing the drunk robber on a graph (Q406701) (← links)
- Factoring a graph in polynomial time (Q579285) (← links)
- Building graphs from colored trees (Q612947) (← links)
- Avoidance coupling (Q743027) (← links)
- Polynomial hyperforms (Q762525) (← links)
- Isometric embedding in products of complete graphs (Q787171) (← links)
- On coverings of a finite set: Depth and subcovers (Q797579) (← links)
- On the number of k-realizations of an ordered set (Q804608) (← links)
- Sphere orders (Q909680) (← links)
- Existence of graphs with a given set of r-neighborhoods (Q1053037) (← links)
- Proof of the squashed cube conjecture (Q1055790) (← links)
- Random orders (Q1058533) (← links)
- (Q1065835) (redirect page) (← links)
- Comparability invariance of the fixed point property (Q1065836) (← links)
- On the addressing problem for directed graphs (Q1068101) (← links)
- Connectedness and diameter for random orders of fixed dimension (Q1068112) (← links)
- Arithmetic progressions in partially ordered sets (Q1093657) (← links)
- A counterexample in the theory of random orders (Q1121295) (← links)
- On connectivity of triangulations of manifolds (Q1140659) (← links)
- Classification of algebraic structures by work space (Q1149971) (← links)
- Average height in a partially ordered set (Q1163038) (← links)
- Degree sets of k-trees: Small k (Q1164068) (← links)
- Random orders of dimension 2 (Q1177705) (← links)
- The number of \(t\)-wise balanced designs (Q1180422) (← links)
- Counting linear extensions (Q1183942) (← links)
- Fast information sharing in a complete network (Q1209151) (← links)
- Bounding the vertex cover number of a hypergraph (Q1323476) (← links)
- Packing rectangles in a strip (Q1403326) (← links)
- Graph homomorphisms and phase transitions (Q1569058) (← links)
- Gibbs measures and dismantlable graphs (Q1569061) (← links)
- The minimum Manhattan distance and minimum jump of permutations (Q1621428) (← links)
- Monotone Gray codes and the middle levels problem (Q1805053) (← links)
- Nonmonotonic behavior in hard-core and Widom-Rowlinson models (Q1809678) (← links)
- Mean distance in a tree (Q1813712) (← links)
- On families of finite sets with bounds on unions and intersections (Q1837682) (← links)
- Vertex-to-vertex pursuit in a graph (Q1837707) (← links)
- On computability of the mean deviation (Q1838828) (← links)
- Exact mixing in an unknown Markov chain (Q1897681) (← links)
- Target shooting with programmed random variables (Q1909404) (← links)
- On the number of Eulerian orientations of a graph (Q1923856) (← links)
- Mixing times for uniformly ergodic Markov chains (Q1965874) (← links)
- Optimal linear arrangement of a rectangular grid (Q1970706) (← links)
- Biased coin puzzles (Q2153991) (← links)
- Mixing of permutations by biased transpositions (Q2321931) (← links)
- Dominating sets in \(k\)-majority tournaments. (Q2490838) (← links)
- Universal configurations in light-flipping games (Q2768402) (← links)
- Optimality and greed in dynamic allocation (Q2775889) (← links)
