A lower bound on the local time complexity of universal constructions

DOI10.1145/277697.277731MaRDI QIDQ2790113zbMATH OpenOpenAlexFDO

Authors Prasad Jayanti

Publication date 2 March 2016

Published in Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(1)

• Hundreds of impossibility results for distributed computing

This page was built for publication: A lower bound on the local time complexity of universal constructions

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