Author:
Flajolet Philippe,Salvy Bruno,Zimmermann Paul
Subject
General Computer Science,Theoretical Computer Science
Reference94 articles.
1. The Theory of Parsing, Translation, and Compiling; Volume 1: Parsing;Aho,1972
2. Average case analysis of unification algorithms;Albert,1990
3. Proc. STACS '91;Albert,1991
4. Central and local limit theorems applied to asymptotic enumeration;Bender;J. Combinatorial Theory,1973
Cited by
69 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computing error bounds for asymptotic expansions of regular P-recursive sequences;Mathematics of Computation;2023-08-16
2. Modeling Asymptotic Complexity Using ACL2;Electronic Proceedings in Theoretical Computer Science;2022-05-24
3. Dynaplex: analyzing program complexity using dynamically inferred recurrence relations;Proceedings of the ACM on Programming Languages;2021-10-20
4. Generating Functions and Analytic Combinatorics;Algorithmic and Symbolic Combinatorics;2020-12-23
5. Introduction;Algorithmic and Symbolic Combinatorics;2020-12-23