Data structures for distributed counting

DOI10.1016/0022-0000(84)90067-9zbMath0541.68025OpenAlexW2062246109MaRDI QIDQ794431

Martin Fuerer

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

zbMATH Keywords

data structuressimulationshierarchy for k-tape Turing machinesredundant representation of integers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

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

• On time hierarchies
• On Time Versus Space
• Space bounds for a game on graphs
• On the Computational Complexity of Algorithms
• Two-Tape Simulation of Multitape Turing Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item