Login / Signup

Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.

Dany BreslauerArtur CzumajDevdatt P. DubhashiFriedhelm Meyer auf der Heide
Published in: Inf. Process. Lett. (1997)
Keyphrases
  • random access
  • lower bound
  • probabilistic model
  • objective function
  • parallel processing
  • memory efficient
  • disk storage