Skip to main content
SpringerLink
Log in

Highly Succinct Dynamic Data Structures

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11651))

Included in the following conference series:

Abstract

It is attempted to elucidate a number of known dynamic data structures that come close to using the absolutely minimal amount of space, and their connections and ramifications are explored.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974)

    MATH  Google Scholar 

  2. Alexandrescu, A.: The D Programming Language. Addison-Wesley, Boston (2010)

    MATH  Google Scholar 

  3. Angluin, D., Valiant, L.G.: Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. Syst. Sci. 18(2), 155–193 (1979). https://doi.org/10.1016/0022-0000(79)90045-X

    Article  MathSciNet  MATH  Google Scholar 

  4. Baumann, T., Hagerup, T.: Rank-select indices without tears. In: Proceedings of the Algorithms and Data Structures Symposium (WADS 2019). LNCS. Springer, Cham (2019, to appear)

    Google Scholar 

  5. Clark, D.: Compact pat trees. Ph.D. thesis, University of Waterloo (1996)

    Google Scholar 

  6. Dodis, Y., Pǎtraşcu, M., Thorup, M.: Changing base without losing space. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC 2010), pp. 593–602. ACM (2010). https://doi.org/10.1145/1806689.1806771

  7. Fredriksson, K., Kilpeläinen, P.: Practically efficient array initialization. J. Softw. Pract. Exper. 46(4), 435–467 (2016). https://doi.org/10.1002/spe.2314

    Article  Google Scholar 

  8. Golynski, A.: Optimal lower bounds for rank and select indexes. Theor. Comput. Sci. 387(3), 348–359 (2007). https://doi.org/10.1016/j.tcs.2007.07.041

    Article  MathSciNet  MATH  Google Scholar 

  9. Gosling, J., Joy, B., Steele, G., Bracha, G., Buckley, A.: The Java Language Specification, Java SE 8 Edition. Oracle America (2015)

    Google Scholar 

  10. Hagerup, T.: Sorting and searching on the word RAM. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 366–398. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0028575

    Chapter  Google Scholar 

  11. Hagerup, T.: An optimal choice dictionary. Computing Research Repository (CoRR) abs/1711.00808 [cs.DS] (2017)

    Google Scholar 

  12. Hagerup, T.: Small uncolored and colored choice dictionaries. Computing Research Repository (CoRR) abs/1809.07661 [cs.DS] (2018)

    Google Scholar 

  13. Hagerup, T.: Fast breadth-first search in still less space. In: Proceedings of the 45th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019). LNCS. Springer, Cham (2019, to appear)

    Chapter  Google Scholar 

  14. Hagerup, T., Kammer, F.: Succinct choice dictionaries. Computing Research Repository (CoRR) abs/1604.06058 (2016)

    Google Scholar 

  15. Hagerup, T., Kammer, F.: On-the-fly array initialization in less space. In: Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017). LIPIcs, vol. 92, pp. 44:1–44:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017). https://doi.org/10.4230/LIPIcs.ISAAC.2017.44

  16. Hagerup, T., Kammer, F., Laudahn, M.: Space-efficient Euler partition and bipartite edge coloring. Theor. Comput. Sci. 754, 16–34 (2019). https://doi.org/10.1016/j.tcs.2018.01.008

    Article  MathSciNet  MATH  Google Scholar 

  17. IEC/IEEE International Standard; Behavioural languages – Part 1–1: VHDL Language Reference Manual. IEC 61691–1-1:2011(E) IEEE Std 1076–2008 (2011). https://doi.org/10.1109/IEEESTD.2011.5967868

  18. Jacobson, G.: Succinct static data structures. Ph.D. thesis, Carnegie Mellon University (1988)

    Google Scholar 

  19. Kammer, F., Kratsch, D., Laudahn, M.: Space-efficient biconnected components and recognition of outerplanar graphs. Algorithmica 81(3), 1180–1204 (2019). https://doi.org/10.1007/s00453-018-0464-z

    Article  MathSciNet  MATH  Google Scholar 

  20. Kammer, F., Sajenko, A.: Extra space during initialization of succinct data structures and dynamical initializable arrays. In: Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), pp. 65:1–65:16 (2018). https://doi.org/10.4230/LIPIcs.MFCS.2018.65

  21. Kammer, F., Sajenko, A.: Simple \(2^f\)-color choice dictionaries. In: Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018). LIPIcs, vol. 123, pp. 66:1–66:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018). https://doi.org/10.4230/LIPIcs.ISAAC.2018.66

  22. Katoh, T., Goto, K.: In-place initializable arrays. Computing Research Repository (CoRR) abs/1709.08900 [cs.DS] (2017)

    Google Scholar 

  23. Loong, J.T.P., Nelson, J., Yu, H.: Fillable arrays with constant time operations and a single bit of redundancy. Computing Research Repository (CoRR) abs/1709.09574 (2017)

    Google Scholar 

  24. Navarro, G.: Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences. ACM Comput. Surv. 46(4), 52:1–52:47 (2014). https://doi.org/10.1145/2535933

    Article  MATH  Google Scholar 

  25. Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4), 43:1–43:25 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Augsburg, 86135, Augsburg, Germany

    Torben Hagerup

Authors
  1. Torben Hagerup
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Torben Hagerup .

Editor information

Editors and Affiliations

  1. University of Liverpool, Liverpool, UK

    Leszek Antoni Gąsieniec

  2. Hong Kong Polytechnic University, Hong Kong, China

    Jesper Jansson

  3. Lund University, Lund, Sweden

    Christos Levcopoulos

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hagerup, T. (2019). Highly Succinct Dynamic Data Structures. In: Gąsieniec, L., Jansson, J., Levcopoulos, C. (eds) Fundamentals of Computation Theory. FCT 2019. Lecture Notes in Computer Science(), vol 11651. Springer, Cham. https://doi.org/10.1007/978-3-030-25027-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-25027-0_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-25026-3

  • Online ISBN: 978-3-030-25027-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation