| Alternate document: Details Lambda-Upsilon-Omega The 1989 Cookbook (89) Philippe Flajolet, et al. |
Philippe Flajolet, Bruno Salvy  Home/Search
Context Related
| inria.fr/INRIA/publicat...RR0876.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pauillac.inria.fr/algo/...algobib (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Lambda-Upsilon-Omega, \Upsilon\Omega , is a system designed to perform automatic analysis of well-defined classes of algorithms operating over "decomposable" data structures. It consists of an `Algebraic Analyzer' System that compiles algorithms specifications into generating functions of average costs, and an `Analytic Analyzer' System that extracts asymptotic informations on coefficients of generating functions. The algebraic part relies on recent methodologies in combinatorial analysis... (Update)
Context of citations to this paper: More
.... amount of work on analyzing program cost or resource complexities, but the majority of it is on time analysis, e.g. [53, 32, 11, 45, 51, 49, 12, 44, 33, 47, 34]. Some techniques for time analysis can 28 of 31 be adapted for space analysis, for example, as we did for stack...
.... in our context of systems for automatic derivation of complexity bounds of first order recursive programs and term rewriting like [3, 10]. Integration with PCC requires the design of a suitable target language in the form of annotated assembler code or bytecode. Perhaps...
Cited by: More
Random Mapping Statistics - Philippe Flajolet Inria (1990) (Correct)
Static Prediction of Heap Space Usage for First-Order.. - Hofmann, Jost (2003) (Correct)
Automatic Time-Bound Analysis for a Higher-Order Language - Gomez, Liu (2002) (Correct)
Similar documents (at the sentence level):
12.1%: Lambda-Upsilon-Omega - The 1989 Cookbook - Flajolet, al. (1989) (Correct)
Active bibliography (related documents): More All
0.2: Automatic Average-Case Analysis Of Algorithms - Flajolet, al. (1991) (Correct)
0.2: Statistics on Random Trees - Casas, Díaz, Martinez (1991) (Correct)
0.2: Asymptotic Enumeration Methods - Odlyzko (1996) (Correct)
Similar documents based on text: More All
0.4: Computer Algebra Libraries for Combinatorial Structures - Flajolet, Salvy (1995) (Correct)
0.2: Publication List - Flajolet (1997) (Correct)
0.2: Hypergeometrics and the Cost Structure of Quadtrees - Flajolet, Labelle, Laforest, .. (1994) (Correct)
Related documents from co-citation: More All
11: Mechanical program analysis (context) - Wegbreit - 1975
7: The automatic complexity analysis of divide-and-conquer algorithms - Zimmermann, Zimmermann - 1991
7: Automatic average--case analysis of algorithms - Flajolet, Salvy et al. - 1991
BibTeX entry: (Update)
P. Flajolet, B. Salvy, and P. Zimmermann. Lambda-Upsilon-Omega: An assistant algorithms analyzer. In T. Mora, editor, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, volume 357 of Lecture Notes in Computer Science, pages 201--212, Rome, Italy, July 1989. Springer-Verlag, Berlin. http://citeseer.ist.psu.edu/flajolet89lambdaupsilonomega.html More
@inproceedings{ flajolet89lambda,
author = "Flajolet and Salvy and Zimmermann",
title = "Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer",
booktitle = "{AAECC}: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, International Conference",
publisher = "LNCS, Springer-Verlag",
year = "1989",
url = "citeseer.ist.psu.edu/flajolet89lambdaupsilonomega.html" }
Citations (may not include all citations):249 Volume 3: Sorting and Searching (context) - Knuth, of et al. - 1973
172 Applied and Computational Complex Analysis (context) - Henrici - 1977
157 Advanced Combinatorics (context) - Comtet - 1974
154 Combinatorial Enumerations (context) - Goulden, Jackson - 1983
151 Singularity Analysis of Generating Functions (context) - Flajolet, Odlyzko - 1987
66 the Altitude of Nodes in Random Trees (context) - Meir, Moon - 1978
33 Asymptotic Methods in Analysis (context) - de Bruijn - 1981
26 Wadsworth and Brooks/Cole (context) - Stanley, Combinatorics - 1986
20 Labelled Formal Languages and Their Uses (context) - Greene - 1983
18 Generating Functions (context) - Stanley - 1978
13 Mathematical Methods in the Analysis of Algorithms and Data .. (context) - Flajolet - 1988
13 A Generalization of Stirling's Formula (context) - Hayman - 1956
13 Asymptotic Expansions for the Coefficients of Analytic Funct.. (context) - Harris, Schoenfeld - 1968
8 Elements of a general theory of combinatorial structures (context) - Flajolet - 1985
1 Verojatnostnie Metody v Kombinatornom Analize (context) - Sachkov - 1978
1 A Complexity Calculus for Recursive Tree Algorihms (context) - Flajolet, Steyaert - 1987
1 Complexit'e et Structure des Algorithmes (context) - Steyaert - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://pauillac.inria.fr/algo/papers/bibgen/algobib.html): More
Analytic Combinatorics of Non-crossing Configurations - Flajolet, Noy (1997) (Correct)
The Maximum of a Random Walk and Its Application to.. - Coffman, Flajolet.. (1997) (Correct)
The Analysis of Hybrid Trie Structures - Clément, Flajolet.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC