Data structures for distributed counting
From MaRDI portal
Publication:794431
DOI10.1016/0022-0000(84)90067-9zbMath0541.68025OpenAlexW2062246109MaRDI QIDQ794431
Publication date: 1984
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(84)90067-9
Related Items
Uniform normal form for general time-bounded complexity classes, New time hierarchy results for deterministic TMS, The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory, A Time Hierarchy Theorem for the LOCAL Model, Almost-everywhere complexity hierarchies for nondeterministic time, A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes
Cites Work