Author:
Andersson Arne,Miltersen Peter Bro,Thorup Mikkel
Subject
General Computer Science,Theoretical Computer Science
Reference7 articles.
1. Hash functions for priority queues;Ajtai;Inform. Comput.,1984
2. Organization and maintenance of large ordered indexes;Bayer;Acta Inform.,1972
3. Optimal algorithms for list indexing and subset rank;Dietz,1989
4. The cell probe complexity of dynamic data structures;Fredman,1989
5. Surpassing the information theoretic bound with fusion trees;Fredman;J. Comput. System Sci.,1993
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Space-efficient Huffman codes revisited;Information Processing Letters;2023-01
2. A Robust Graph Theoretic Solution of Routing in Intelligent Networks;Wireless Communications and Mobile Computing;2022-06-20
3. Efficient,Flexible,and Constant-Time Gaussian Sampling Hardware for Lattice Cryptography;IEEE Transactions on Computers;2021
4. Isogrammic-Fusion ORAM;Proceedings of the 2018 on Asia Conference on Computer and Communications Security;2018-05-29
5. Brief Announcement;Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures;2017-07-24