Fast Pseudorandomness for Independence and Load Balancing

DOI10.1007/978-3-662-43948-7_71zbMath1412.68158OpenAlexW2206724447MaRDI QIDQ5167798

Raghu Meka, Omer Reingold, Ron D. Rothblum, Guy N. Rothblum

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_71

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

New techniques and tighter bounds for local computation algorithms ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness

This page was built for publication: Fast Pseudorandomness for Independence and Load Balancing