Skip to main content
Conference Proceedings

Computing with Catalan families

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8370 LNCS 565-575
DOI: 10.1007/978-3-319-04921-2_46
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2014 Springer International Publishing.

Author supplied keywords

Cite

CITATION STYLE

APA

Tarau, P. (2014). Computing with Catalan families. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8370 LNCS, pp. 565–575). https://doi.org/10.1007/978-3-319-04921-2_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free