scientific article; zbMATH DE number 2050057

zbMATH Open1094.00003MaRDI QIDQ4452853FDOQ4452853

Peter Winkler

Publication date: 3 March 2004

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematics in general (00-01) Recreational mathematics (00A08)

Cited In (47)

• Model-Free Reinforcement Learning for Stochastic Parity Games
• Grabbing the gold
• Absent-Minded Passengers
• Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation
• Title not available (Why is that?)
• On λ statistical upward compactness and continuity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Goldbug variations
• Book review of: D. Singmaster, Problems for metagrobologists. A collection of puzzles with real mathematical, logical or scientific content
• The graph grabbing game on \(K_{m, n}\)-trees
• Strong convergence in posets
• Title not available (Why is that?)
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• Sorting balls and water: equivalence and computational complexity
• The pleasures of friends
• Counting Tilings by Taking Walks in a Graph
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• A More Malicious Maitre d’
• The distribution of the size of the union of cycles for two types of random permutations
• Star transposition Gray codes for multiset permutations
• A sharper threshold for bootstrap percolation in two dimensions
• All solutions to the immobilizer problem
• Polar bear or penguin? Musings on Earth cartography and Chebyshev nets
• Title not available (Why is that?)
• On a Combinatorial Generation Problem of Knuth
• The Prisoner Shouting Puzzle and Variations
• Title not available (Why is that?)
• Scaling and Inverse Scaling in Anisotropic Bootstrap Percolation
• The lost boarding pass and other practical problems
• Mathematical Puzzles
• Deterministic thinning of finite Poisson processes
• The absent-minded passengers problem: a motivating challenge solved by computer algebra
• Trimming and gluing Gray codes
• Spinning switches on a wreath product
• Convex grabbing game of the point set on the plane
• Hat chromatic number of graphs
• Graph grabbing game on totally-weighted graphs
• Distributed XML design
• A constant-time algorithm for middle levels Gray codes
• Enumerating lambda terms by weighted length of their de Bruijn representation
• Title not available (Why is that?)
• The graph grabbing game on \(\{0,1\}\)-weighted graphs
• Smash and grab: the \(0 \cdot 6\) scoring game on graphs
• The locker puzzle
• A short proof of the middle levels theorem
• A Graph-Grabbing Game

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452853)