Author:
Dietzfelbinger Martin,Hagerup Torben,Katajainen Jyrki,Penttonen Martti
Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference32 articles.
1. Optimal time bounds for some proximity problems in the plane;Aggarwal;Inform. Process. Lett.,1992
2. The Design and Analysis of Computer Algorithms;Aho,1974
3. A. Andersson, T. Hagerup, S. Nilsson, R. Raman, 1995, Sorting in linear time?, Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, 427, 436, ACM Press, New York
4. H. Bast, T. Hagerup, 1991, Fast and reliable parallel hashing, Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 50, 61, ACM Press, New York
5. The generation of random numbers that are probably prime;Beauchemin;J. Cryptology,1988
Cited by
103 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Predecessor on the Ultra-Wide Word RAM;Algorithmica;2024-01-10
2. On the Privacy of Adaptive Cuckoo Filters: Analysis and Protection;IEEE Transactions on Information Forensics and Security;2024
3. Improved Computation of Database Operators via Vector Processing Near-Data;2023 IEEE 35th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD);2023-10-17
4. A Reconfigurable Architecture for Real-time Event-based Multi-Object Tracking;ACM Transactions on Reconfigurable Technology and Systems;2023-09
5. Analyzing Vectorized Hash Tables across CPU Architectures;Proceedings of the VLDB Endowment;2023-07