A parallel search game

  • Authors:

  • Navin Goyal;Michael Saks

  • Affiliations:

  • Department of Computer Science, Rutgers University, Piscataway, NJ 08854;Department of Mathematics, Rutgers University, Piscataway, NJ 08854

  • Venue:
  • Random Structures & Algorithms
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We answer in negative a question of Gál and Miltersen [Proc 30th Int Coll Automata, Languages, and Programming (ICALP) 2003, pp. 332–344] about a combinatorial game arising in the study of time-space trade-offs for data structures. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005