J. Ian Munro
ABSTRACT
We focus on succinct data structures, that is on time and space efficient representations of trees and other combinatorial objects that dominate the memory requirements of most sophisticated programs and systems.
- S. Alstrup, P. Bille, and T. Rauhe. Labeling schemes for small distances in trees. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12--14, 2003, Baltimore, Maryland, USA., pages 689--698. ACM/SIAM, 2003. Google Scholar
Digital Library
- D. Arroyuelo, P. Davoodi, and S. R. Satti. Succinct dynamic cardinal trees. Algorithmica, 74(2):742--777, 2016. Google ScholarDigital Library
- D. Benoit, E. D. Demaine, J. I. Munro, R. Raman, V. Raman, and S. S. Rao. Representing trees of higher degree. Algorithmica, 43(4):275--292, 2005.Google ScholarCross Ref
- H. Chan, W. Hon, T. W. Lam, and K. Sadakane. Compressed indexes for dynamic text collections. ACM Trans. Algorithms, 3(2), 2007. Google ScholarDigital Library
- D. R. Clark. Compact Pat Trees. University of Waterloo, 1996.Google Scholar
- D. R. Clark and J. I. Munro. Efficient suffix trees on secondary storage (extended abstract). In É. Tardos, editor, Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28--30 January 1996, Atlanta, Georgia., pages 383--391. ACM/SIAM, 1996. Google ScholarDigital Library
- H. El-Zein, J. I. Munro, and S. Yang. On the succinct representation of unlabeled permutations. In K. M. Elbassioni and K. Makino, editors, Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9--11, 2015, Proceedings, volume 9472 of Lecture Notes in Computer Science, pages 49--59. Springer, 2015.Google Scholar
- A. Farzan and J. I. Munro. Succinct representation of dynamic trees. Theor. Comput. Sci., 412(24):2668--2678, 2011. Google ScholarDigital Library
- A. Farzan and J. I. Munro. Succinct encoding of arbitrary graphs. Theor. Comput. Sci., 513:38--52, 2013. Google ScholarDigital Library
- A. Farzan and J. I. Munro. A uniform paradigm to succinctly encode various families of trees. Algorithmica, 68(1):16--40, 2014.Google ScholarCross Ref
- P. Ferragina and G. Navarro. Pizza & chili corpus compressed indexes and their testbeds, Sept. 2005.Google Scholar
- A. Golynski. Optimal lower bounds for rank and select indexes. Theor. Comput. Sci., 387(3):348--359, 2007. Google ScholarDigital Library
- G. H. Gonnet, R. A. Baeza-Yates, and T. Snider. New indices for text: Pat trees and pat arrays. In Information Retrieval: Data Structures & Algorithms, pages 66--82. 1992. Google ScholarDigital Library
- R. González and G. Navarro. Rank/select on dynamic compressed sequences and applications. Theor. Comput. Sci., 410(43):4414--4422, 2009. Google ScholarDigital Library
- R. Grossi, A. Gupta, and J. S. Vitter. High-order entropy-compressed text indexes. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '03, pages 841--850, Philadelphia, PA, USA, 2003. Society for Industrial and Applied Mathematics. Google ScholarDigital Library
- D. Gusfield. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, 1997. Google ScholarDigital Library
- G. H. Hardy and S. Ramanujan. Asymptotic formulae in combinatory analysis. Proceedings of the London Mathematical Society, 2(1):75--115, 1918.Google ScholarCross Ref
- M. He and J. I. Munro. Succinct representations of dynamic strings. In E. Chávez and S. Lonardi, editors, String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11--13, 2010. Proceedings, volume 6393 of Lecture Notes in Computer Science, pages 334--346. Springer, 2010. Google ScholarDigital Library
- G. Jacobson. Space-efficient static trees and graphs. In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pages 549--554. IEEE Computer Society, 1989. Google ScholarDigital Library
- G. Jacobson. Succinct Data Structures. Carnegie Melon University, 1989.Google Scholar
- M. Katz, N. A. Katz, A. Korman, and D. Peleg. Labeling schemes for flow and connectivity. SIAM J. Comput., 34(1):23--40, 2004. Google ScholarDigital Library
- M. Lewenstein, J. I. Munro, and V. Raman. Succinct data structures for representing equivalence classes. In L. Cai, S. Cheng, and T. W. Lam, editors, Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16--18, 2013, Proceedings, volume 8283 of Lecture Notes in Computer Science, pages 502--512. Springer, 2013.Google Scholar
- V. M\"akinen and G. Navarro. Compressed compact suffix arrays. In S. C. Sahinalp, S. Muthukrishnan, and U. Dogrusöz, editors, Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5--7, 2004, Proceedings, volume 3109 of Lecture Notes in Computer Science, pages 420--433. Springer, 2004.Google Scholar
- D. R. Morrison. Patricia - practical algorithm to retrieve information coded in alphanumeric. J. ACM, 15(4):514--534, Oct. 1968. Google ScholarDigital Library
- J. I. Munro. Tables. In V. Chandru and V. Vinay, editors, Foundations of Software Technology and Theoretical Computer Science, 16th Conference, Hyderabad, India, December 18--20, 1996, Proceedings, volume 1180 of Lecture Notes in Computer Science, pages 37--42. Springer, 1996. Google ScholarDigital Library
- J. I. Munro and P. K. Nicholson. Succinct posets. In L. Epstein and P. Ferragina, editors, Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10--12, 2012. Proceedings, volume 7501 of Lecture Notes in Computer Science, pages 743--754. Springer, 2012. Google ScholarDigital Library
- J. I. Munro and P. K. Nicholson. Compressed representations of graphs. In Encyclopedia of Algorithms, pages 382--386. 2016.Google ScholarCross Ref
- J. I. Munro, V. Raman, and A. J. Storm. Representing dynamic binary trees succinctly. In S. R. Kosaraju, editor, Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7--9, 2001, Washington, DC, USA., pages 529--536. ACM/SIAM, 2001. Google ScholarDigital Library
- J. I. Munro and S. S. Rao. Succinct representation of data structures. In D. P. Mehta and S. Sahni, editors, Handbook of Data Structures and Applications. Chapman and Hall/CRC, 2004.Google ScholarCross Ref
- G. Navarro. Compact Data Structures: A Practical Approach. Cambridge University Press, 2016, forthcoming.Google ScholarDigital Library
- M. Patrascu. Succincter. In 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25--28, 2008, Philadelphia, PA, USA, pages 305--313. IEEE Computer Society, 2008. Google ScholarDigital Library
- M. Patrascu. A lower bound for succinct rank queries. CoRR, abs/0907.1103, 2009.Google Scholar
- R. Raman and S. S. Rao. Succinct dynamic dictionaries and trees. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, and G. J. Woeginger, editors, Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, volume 2719 of Lecture Notes in Computer Science, pages 357--368. Springer, 2003. Google ScholarDigital Library
- T. B. Simon Gog, J. Bader and M. Petri. Succinct data structure library 2.0, Mar. 2016.Google Scholar
- P. Weiner. Linear pattern matching algorithms. In 14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, October 15--17, 1973, pages 1--11. IEEE Computer Society, 1973. Google ScholarDigital Library
- J. W. J. Williams. Algorithm 232 (heapsort). Commun. ACM, 7(6):347--349, June 1964.Google Scholar
Index Terms
- Succinct Data Structures ... Potential for Symbolic Computation?
Recommendations
Succinct Data Structures in Information Retrieval: Theory and Practice
SIGIR '16: Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information RetrievalSuccinct data structures are used today in many information retrieval applications, e.g., posting lists representation, language model representation, indexing (social) graphs, query auto-completion, document retrieval and indexing dictionary of strings,...
Succinct and I/O Efficient Data Structures for Traversal in Trees
We present two results for path traversal in trees, where the traversal is performed in an asymptotically optimal number of I/Os and the tree structure is represented succinctly. Our first result is for bottom-up traversal that starts with a node in a ...
Optimized succinct data structures for massive data
Succinct data structures provide the same functionality as their corresponding traditional data structure in compact space. We improve on functions rank and select, which are the basic building blocks of FM-indexes and other succinct data structures. ...
Comments