This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st Annual Symposium on Foundations of Computer Science (FOCS 1980)
The inherent complexity of dynamic data structures which accommodate range queries
October 13-October 15
A formal framework is presented in which to explore the complexity issues of data structures which accommodate various types of range queries. Within this framework, a systematic and reasonably tractable method for assessing inherent complexity is developed. Included among the interesting results are the following: the fact that non-linear lower bounds are readily accessible, and the existence of a complexity gap between linear time and n log n time.
Citation:
Michael L. Fredman, "The inherent complexity of dynamic data structures which accommodate range queries," focs, pp.191-199, 21st Annual Symposium on Foundations of Computer Science (FOCS 1980), 1980
Usage of this product signifies your acceptance of the Terms of Use.