850 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- ETH ZurichCH58 papers
- Charles UniversityCZ8 papers
- Max Planck Institute for InformaticsDE5 papers
- Institute for Operations ResearchCH4 papers
- Institute for Theoretical PhysicsCH4 papers
- Institute of Theoretical PhysicsCN4 papers
- Instituto de Física TeóricaES4 papers
- Tel Aviv UniversityIL4 papers
- University of CambridgeGB4 papers
- Centre National de la Recherche ScientifiqueFR3 papers
- École Polytechnique Fédérale de LausanneCH3 papers
- Aix-Marseille UniversitéFR2 papers
3 papers · 1 filter
A linear threshold for uniqueness of solutions to random jigsaw puzzles
Anders Martinsson
We consider a problem introduced by Mossel and Ross [Shotgun assembly of labeled graphs, arXiv:1504.07682]. Suppose a random jigsaw puzzle is constructed by independent…
Most edge-orderings of have maximal altitude
Anders Martinsson
Suppose the edges of the complete graph on vertices are assigned a uniformly chosen random ordering. Let denote the corresponding number of Hamiltonian paths that are incre…
Balls into bins via local search: cover time and maximum load
Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer +1
We study a natural process for allocating m balls into n bins that are organized as the vertices of an undirected graph G. Balls arrive one at a time. When a ball arrives, it first…