scientific article; zbMATH DE number 7650908

DOI10.4230/LIPICS.STACS.2020.23MaRDI QIDQ5874294zbMATH OpenFDO

Authors Taisuke Izumi, François Le Gall, Frédéric Magniez

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/1908.11488

zbMATH Keywords

CONGEST modeldistributed computingquantum computing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(6)

• The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
• Deterministic near-optimal distributed listing of cliques
• On the power of quantum distributed proofs
• Deterministic expander routing: faster and more versatile
• Distributed quantum proofs for replicated data
• Narrowing the \textsf{LOCAL-CONGEST} gaps in sparse networks via expander decompositions

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 Q5874294)