Author:
Albers Susanne,Hagerup Torben
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference37 articles.
1. M. Ajtai, J. Komlós, E. Szemerédi, 1983, AnOnn, Proceedings, 15th Annual ACM Symposium on Theory of Computing, 1, 9
2. A. Andersson, 1995, Sublogarithmic searching without multiplications, Proceedings, 36th Annual Symposium on Foundations of Computer Science, 655, 663
3. A. Andersson, T. Hagerup, S. Nilsson, R. Raman, 1995, Sorting in linear time?, Proceedings, 27th Annual ACM Symposium on the Theory of Computing, 427, 436
4. Fast parallel space allocation, estimation, and integer sorting;Bast;Inform. and Comput.,1995
5. K. E. Batcher, 1968, Sorting networks and their applications, Proceedings, AFIPS Spring Joint Computer Conference, 32, 307, 314
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parallel Integer Sort: Theory and Practice (Abstract);Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing;2024-06-17
2. Parallel Integer Sort: Theory and Practice;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20
3. More Efficient Parallel Integer Sorting;International Journal of Foundations of Computer Science;2022-03-24
4. Theoretically-Efficient and Practical Parallel In-Place Radix Sorting;The 31st ACM Symposium on Parallelism in Algorithms and Architectures;2019-06-17
5. Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back;Discrete & Computational Geometry;2019-03-05