Fetching the paper…
Reading the bibliography…
We describe a distributed, asynchronous variant of Edmonds's exact algorithm for producing perfect matchings of minimum weight.
Tevye and his Daughters
Sholem Aleichem · 1949
Earlier work this paper cites.
A Primal-Dual Algorithm for Linear Programs
George Bernard Dantzig, Lester R Ford, and Delbert Ray Fulkerson · 1956
Earlier work this paper cites.
Maximum matching and a polyhedron with 0, 1-vertices
Jack Edmonds · 1965
Earlier work this paper cites.
Paths, trees, and flowers
Jack Edmonds · 1965
Earlier work this paper cites.
A universal modular ACTOR formalism for artificial intelligence
Carl Hewitt, Peter Boehler Bishop, and Richard Steiger · 1973
Earlier work this paper cites.
Proving assertions about parallel programs
E.A. Ashcroft · 1975
Earlier work this paper cites.
Time, clocks, and the ordering of events in a distributed system
Leslie Lamport · 1978
Earlier work this paper cites.
Locality in distributed graph algorithms
Nathan Linial · 1992
Earlier work this paper cites.
Computing minimum-weight perfect matchings
William J. Cook and André Rohe · 1999
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
Cited alongside, same era.
Mirjam Wattenhofer and Roger Wattenhofer · 2004
Cited alongside, same era.
Combinatorial optimization
William J Cook, WH Cunningham, WR Pulleyblank, and A Schrijver · 2009
Cited alongside, same era.
Blossom V: a new implementation of a minimum cost perfect matching algorithm
Vladimir Kolmogorov · 2009
Cited alongside, same era.
Distributed approximate matching
Zvi Lotker, Boaz Patt-Shamir, and Adi Rosén · 2009
Cited alongside, same era.
The hungarian method for the assignment problem
Harold W. Kuhn · 2010
Cited alongside, same era.
Improved distributed approximate matching
Zvi Lotker, Boaz Patt-Shamir, and Seth Pettie · 2015
Later among the works it cites.
Making local algorithms wait-free: the case of ring coloring
Armando Castañeda, Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, and Michel Raynal · 2019
Later among the works it cites.
Distributed computing in the asynchronous LOCAL model
Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, and Mikaël Rabie · 2019
Later among the works it cites.
Photo of St. Edward’s Crown, September 2019
Sgt. Rupert Frere RLC/MOD · 2019
Later among the works it cites.
Building a fault-tolerant quantum computer using concatenated cat codes, 2020
Christopher Chamberland, Kyungjoo Noh, Patricio Arrangoiz-Arriola, Earl T. Campbell, Connor T. Hann, Joseph Iverson, Harald Putterman, Thomas C. Bohdanowicz, Steven T. Flammia, Andrew Keller, Gil Refael, John Preskill, Liang Jiang, Amir H. Safavi-Naeini, Oskar Painter, and Fernando G. S. L. Brandão · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Surface codes: Towards practical large-scale quantum computation
Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland · 2012
Cited alongside, same era.
Towards practical classical processing for the surface code: Timing analysis
Austin G. Fowler, Adam C. Whiteside, and Lloyd C. L. Hollenberg · 2012
Cited alongside, same era.
An o(sqrt( | | v | | ) | | e | | ) algorithm for finding maximum matching in general graphs
Silvio Micali and Vijay V. Vazirani
Cited in the paper.
Distributed online decoding for large-scale quantum computers
Eric C. Peterson and Peter J. Karalekas
Cited in the paper.
aether: Distributed system emulation in common lisp
Eric C. Peterson and Peter J. Karalekas · 2020
Later among the works it cites.
https://github.com/dtqec/aether
aether · 2021
Later among the works it cites.
https://github.com/dtqec/anatevka
anatevka · 2021
Later among the works it cites.