Author:
Baran Ilya,Demaine Erik D.,Pǎtraşcu Mihai
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference11 articles.
1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)
2. Albers, S., Hagerup, T.: Improved parallel integer sorting without concurrent writing. In: Proc. 3rd ACM/SIAM Symposium on Discrete Algorithms (SODA), pp. 463–472 (1992)
3. Andersson, A., Miltersen, P.B., Riis, S., Thorup, M.: Static dictionaries on AC 0 RAMs: query time $\Theta(\sqrt{\log n/\log\log n})$ is necessary and sufficient. In: Proc. 37th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 441–450 (1996)
4. Andersson, A., Miltersen, P.B., Thorup, M.: Fusion trees can be implemented with AC 0 instructions only. Theor. Comput. Sci. 215(1–2), 337–344 (1999)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. How Fast Can We Play Tetris Greedily With Rectangular Pieces?;Theoretical Computer Science;2024-01
2. Faster Algorithms for Text-to-Pattern Hamming Distances;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Removing Additive Structure in 3SUM-Based Reductions;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Computational Time Complexity for k-Sum Problem Amalgamated with Quantum Search;2023 International Conference on Artificial Intelligence and Applications (ICAIA) Alliance Technology Conference (ATCON-1);2023-04-21