Author:
Cicalese Ferdinando,Jacobs Tobias,Laber Eduardo,Molinaro Marco
Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. J. Abrahams, Code and parse trees for lossless source encoding, in: Compression and Complexity of Sequences, 1997, pp. 145–171.
2. M. Adler, E. Demaine, N. Harvey, M. Patrascu, Lower bounds for asymmetric communication channels and distributed source coding, in: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 251–260.
3. Approximating optimal binary decision trees;Adler,2008
4. Protocols for asymmetric communication channels;Adler;Journal of Computer and System Sciences,2001
5. Optimal search in trees;Ben-Asher;SIAM Journal on Computing,1999
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Theoretical Analysis of Git Bisect;Algorithmica;2023-12-21
2. Partial Order Multiway Search;ACM Transactions on Database Systems;2023-11-13
3. Competitive Online Search Trees on Trees;ACM Transactions on Algorithms;2023-06-24
4. An Optimal Algorithm for Partial Order Multiway Search;ACM SIGMOD Record;2023-06-07
5. Noisy Interactive Graph Search;Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2022-08-14