Author:
Franceschini Gianni,Muthukrishnan S.,Pǎtraşcu Mihai
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? Journal of Computer and System Sciences 57(1), 74–93 (1998)
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)
3. Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci. 47, 424–436 (1993)
4. Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. System Sci. 48(3), 533–551 (1994)
5. Han, Y., Thorup, M.: Integer sorting in
$O(n \sqrt{\log \log n})$
expected time and linear space. In: FOCS, pp. 135–144. IEEE Computer Society, Los Alamitos (2002)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast;Lecture Notes in Computer Science;2024
2. Efficient String Sort with Multi-Character Encoding and Adaptive Sampling;Proceedings of the 2021 International Conference on Management of Data;2021-06-09
3. Optimal Substring Equality Queries with Applications to Sparse Text Indexing;ACM Transactions on Algorithms;2021-01-28
4. Vortex: Extreme-Performance Memory Abstractions for Data-Intensive Streaming Applications;Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems;2020-03-09
5. Optimal In-place Algorithms for Basic Graph Problems;Lecture Notes in Computer Science;2020