Skip to main content
SpringerLink
Log in

Computing with Catalan Families

  • Conference paper
Language and Automata Theory and Applications (LATA 2014)

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

Abstract

We study novel arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects.

For numbers corresponding to Catalan objects of low structural complexity our algorithms provide super-exponential gains while their average case complexity is within constant factors of their traditional counterparts.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goodstein, R.: On the restricted ordinal theorem. Journal of Symbolic Logic 9(2), 33–41 (1944)

    Article  MATH  MathSciNet  Google Scholar 

  2. Knuth, D.E.: Mathematics and Computer Science: Coping with Finiteness. Science 194(4271), 1235–1242 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  3. Knuth, D.E.: TCALC program (December 1994), http://www-cs-faculty.stanford.edu/~uno/programs/tcalc.w.gz

  4. Salomaa, A.: Formal Languages. Academic Press, New York (1973)

    MATH  Google Scholar 

  5. Sloane, N.J.A.: A000108, The On-Line Encyclopedia of Integer Sequences (2013), Published electronically at http://oeis.org/A000108

  6. Stanley, R.P.: Enumerative Combinatorics. Wadsworth Publ. Co., Belmont (1986)

    Book  MATH  Google Scholar 

  7. Tarau, P.: Declarative modeling of finite mathematics. In: PPDP 2010: Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pp. 131–142. ACM, New York (2010)

    Chapter  Google Scholar 

  8. Tarau, P.: Arithmetic Algorithms for Hereditarily Binary Natural Numbers (June 2013), http://arxiv.org/abs/1306.1128

  9. Tarau, P., Haraburda, D.: On Computing with Types. In: Proceedings of SAC 2012, ACM Symposium on Applied Computing, PL track, pp. 1889–1896. Riva del Garda (Trento), Italy (March 2012)

    Google Scholar 

  10. Vuillemin, J.: Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates. In: 19th IEEE Symposium on Computer Arithmetic, ARITH 2009, pp. 7–14 (June 2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of North Texas, USA

    Paul Tarau

Authors
  1. Paul Tarau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

  2. School of Computer Science, Department of Software Engineering and Artificial Intelligence, Complutense University of Madrid, Professor José Garcia Santesmases, 9, 28040, Madrid, Spain

    José-Luis Sierra-Rodríguez

  3. Fakultät für Informatik, Institut für Wissens- und Sprachverarbeitung, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39106, Magdeburg, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Tarau, P. (2014). Computing with Catalan Families. In: Dediu, AH., Martín-Vide, C., Sierra-Rodríguez, JL., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2014. Lecture Notes in Computer Science, vol 8370. Springer, Cham. https://doi.org/10.1007/978-3-319-04921-2_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04921-2_46

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04920-5

  • Online ISBN: 978-3-319-04921-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation