Author:
Brodal Gerth Stølting,Fagerberg Rolf,Greve Mark,López-Ortiz Alejandro
Publisher
Springer Berlin Heidelberg
Reference6 articles.
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)
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Finding top-k longest palindromes in substrings;Theoretical Computer Science;2023-11
2. Generic Techniques for Building Top-
k
Structures;ACM Transactions on Algorithms;2022-10-10
3. String indexing for top-k close consecutive occurrences;Theoretical Computer Science;2022-08
4. Algorithmic Techniques for Independent Query Sampling;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12
5. Encoding Two-Dimensional Range Top-k Queries;Algorithmica;2021-07-27