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

DOI10.1007/B13831zbMATH Open1180.68014OpenAlexW4247838468MaRDI QIDQ5897409FDOQ5897409

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

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

zbMATH Keywords

tree-widthend-to-endsequence transmission

Mathematics Subject Classification ID

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

Cited In (5)

• New Lower Bounds for Privacy in Communication Protocols
• Graph Minors and Reliable Single Message Transmission
• Header-size lower bounds for end-to-end communication in memoryless networks
• Title not available (Why is that?)
• Title not available (Why is that?)

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)