Author:
Della Giustina Davide,Prezza Nicola,Venturini Rossano
Publisher
Springer International Publishing
Reference12 articles.
1. Aronov, B., et al.: Data structures for halfplane proximity queries and incremental voronoi diagrams. In: Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN), pp. 80–92 (2006).
https://doi.org/10.1007/11682462_12
2. Bender, M.A., Farach-Colton, M., Kuszmaul, B.C.: Cache-oblivious string b-trees. In: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 233–242 (2006).
https://doi.org/10.1145/1142351.1142385
3. Brodal, G.S., Fagerberg, R., Pedersen, C.N.S., Östlin, A.: The complexity of constructing evolutionary trees using experiments. In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), pp. 140–151 (2001).
https://doi.org/10.1007/3-540-48224-5_12
4. Brodal, G.S., Fagerberg, R., Pedersen, C.N.S., Östlin, A.: The complexity of constructing evolutionary trees using experiments. Technical Report BRICS-RS-01-1, BRICS, Department of Computer Science, University of Aarhus (2001).
https://www.brics.dk/RS/01/1/BRICS-RS-01-1.pdf
5. Ferragina, P.: On the weak prefix-search problem. Theoret. Comput. Sci. 483, 75–84 (2013).
https://doi.org/10.1016/j.tcs.2012.06.011
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献