English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

A Breezing Proof of the KMW Bound

MPS-Authors
/persons/resource/persons201891

Coupette,  Corinna
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons123371

Lenzen,  Christoph
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Coupette, C., & Lenzen, C. (2021). A Breezing Proof of the KMW Bound. In V. King, & H. Viet Le (Eds.), Symposium on Simplicity in Algorithms (pp. 184-195). Philadelphia, PA: SIAM. doi:10.1137/1.9781611976496.21.


Cite as: https://hdl.handle.net/21.11116/0000-0007-7A44-4
Abstract
There is no abstract available