Lower bounds for oblivious single-packet end-to-end communication

DOI10.1007/B13831MaRDI QIDQ5897409zbMATH OpenOpenAlexFDO

Authors Pierre Fraigniaud, Cyril Gavoille

Publication date 23 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13831

zbMATH Keywords

end-to-endsequence transmissiontree-width

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Header-size lower bounds for end-to-end communication in memoryless networks
• Graph Minors and Reliable Single Message Transmission
• scientific article; zbMATH DE number 1670868
• scientific article; zbMATH DE number 1696686
• Log-Space Polynomial End-to-End Communication

Cited in

(6)

• Header-size lower bounds for end-to-end communication in memoryless networks
• scientific article; zbMATH DE number 1670868 (Why is no real title available?)
• scientific article; zbMATH DE number 1696686 (Why is no real title available?)
• New Lower Bounds for Privacy in Communication Protocols
• Log-Space Polynomial End-to-End Communication
• Graph Minors and Reliable Single Message Transmission

This page was built for publication: Lower bounds for oblivious single-packet end-to-end communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897409)