Log-Space Polynomial End-to-End Communication

DOI10.1137/S0097539795296760zbMath0907.68008MaRDI QIDQ4210121

Adi Rosén, Eyal Kushilevitz, Rafail Ostrovsky

Publication date: 21 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

space complexityend-to-end communicationunreliable networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (1)

Authenticated adversarial routing

This page was built for publication: Log-Space Polynomial End-to-End Communication