Connection caching

DOI10.1145/301250.301416zbMath1345.68013DBLPconf/stoc/CohenKZ99OpenAlexW2295593776WikidataQ60299178 ScholiaQ60299178MaRDI QIDQ2819591

Edith Cohen, Haim Kaplan, Uri Zwick

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301416

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (3)

Paging with connections: FIFO strikes again ⋮ Connection caching: Model and algorithms. ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost

This page was built for publication: Connection caching