arXiv (All)
open access
Distributed Lower Bounds via Automatic Self-Reduction
The development of round elimination into a general-purpose technique [PODC 2019] marked a turning point in our understanding of the hardness of many graph problems in the distributed setting and led to several breakthrough results. However, the round elimination technique seems unable to yield rand
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Distributed Lower Bounds via Automatic Self-Reduction#1108707
- Compact Partial Symmetry Breaking for Graph Search Problems#1035952
- Odd and Even Harder Problems on Cycle-Factors#1104900
- Majority Dynamics on Random Graphs With Almost Balanced Initial Settings: The Power of Few#656561
- Lower Bounds for Private Graph Optimization Problems using Reconstruction Attacks#673427
Record · ID 1129011
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive