Online sorted range reporting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5878 LNCS, Issue , 2009, Pages 173-182

  Brodal, Gerth Stølting ^a   Fagerberg, Rolf ^b   Greve, Mark ^a   López Ortiz, Alejandro ^c  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ONLINE VERSIONS; RAM MODEL; RANGE MINIMUM QUERIES; SUBARRAY; SUBTREES;

DATA STRUCTURES; SEARCH ENGINES;

COMPUTATION THEORY;

EID: 75649139173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_19     Document Type: Conference Paper

References (6)

1. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab (1999)
2. Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing 13(2), 338-355 (1984)
3. Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci. 47(3), 424-436 (1993)
4. Frederickson, G.N., Johnson, D.B.: The complexity of selection and ranking in X + Y and matrices with sorted columns. J. Comput. Syst. Sci. 24(2), 197-208 (1982)
5. Vuillemin, J.: A unifying look at data structures. CACM 23(4), 229-239 (1980)
6. Frederickson, G.N.: An optimal algorithm for selection in a min-heap. Inf. Comput. 104(2), 197-214 (1993)