A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem

This paper proves a tradeoff between the time it takes to search for elements in an implicit dictionary and the time it takes to update the value of elements in specified locations of the dictionary. It essentially shows that if the update time is constant, then the search time is ω(nɛ) for some constant ɛ>0.

[1]  J. IAN MUNRO,et al.  An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time , 1986, J. Comput. Syst. Sci..

[2]  Eli Upfal,et al.  How to share memory in a distributed system , 1984, JACM.

[3]  Allan Borodin,et al.  Efficient Searching Using Partial Ordering , 1981, Inf. Process. Lett..

[4]  Eli Upfal,et al.  A tradeoff between space and efficiency for routing tables , 1988, STOC '88.

[5]  Eli Upfal,et al.  A time-randomness tradeoff for oblivious routing , 1988, STOC '88.

[6]  Eli Upfal,et al.  A probabilistic relation between desirable and feasible, models of parallel computation , 1984, STOC '84.

[7]  Eli Upfal,et al.  The complexity of parallel computation on matroids , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[8]  Eli Upfal,et al.  Fault Tolerance in Networks of Bounded Degree , 1988, SIAM J. Comput..

[9]  Eli Upfal,et al.  The Complexity of Parallel Search , 1988, J. Comput. Syst. Sci..

[10]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.

[11]  Allan Borodin,et al.  A Time-Space Tradeoff for Element Distinctness , 1987, SIAM J. Comput..

[12]  Kurt Mehlhorn,et al.  Partial Match Retrieval in Implicit Data Structures , 1981, Inf. Process. Lett..

[13]  Andrew Chi-Chih Yao,et al.  Should Tables Be Sorted? , 1981, JACM.

[14]  Kurt Mehlhorn,et al.  Searching Semisorted Tables , 1985, SIAM J. Comput..

[15]  Greg N. Frederickson,et al.  Implicit Data Structures for the Dictionary Problem , 1983, JACM.

[16]  Eli Upfal,et al.  Are search and decision programs computationally equivalent? , 1985, STOC '85.

[17]  Harry G. Mairson.  Average case lower bounds on the construction and searching of partial orders , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[18]  Michael E. Saks,et al.  Information bounds are good for search problems on ordered data structures , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[19]  Allan Borodin,et al.  A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem , 1988, Theor. Comput. Sci..

[20]  Eli Upfal,et al.  A Fast Construction oF Disjoint Paths in Communication Networks , 1983, FCT.

[21]  J. Ian Munro.  An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time , 1984, FOCS.

[22]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[23]  Eli Upfal,et al.  The token distribution problem , 1989, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[24]  Eli Upfal,et al.  N-processors graphs distributively achieve perfect matchings in O(log2N) beats , 1982, PODC '82.