Lambda-Upsilon-Omega: An Assistant Algorithms Analyzer (1989)

Cached

Download Links

by Philippe Flajolet , Bruno Salvy , Paul Zimmermann
Citations:14 - 2 self

Active Bibliography

97 Average-Case Analysis of Algorithms and Data Structures – Jeffrey Scott Vitter, Philippe Flajolet - 1990
2 Statistics on Random Trees – R. Casas, J. Díaz, C. Martinez - 1991
1 Average-case Analysis on Simple Families of Trees Using a Balanced Probability Model – R. Casas, J. Díaz, C. Martínez - 1991
11 1987]. \Analytic Variations on the Common Subexpression Problem – Paolo Sipala, Jean-marc Steyaert - 1990
110 Asymptotic enumeration methods – A. M. Odlyzko - 1995
8 Computer Algebra Libraries for Combinatorial Structures – Philippe Flajolet, Bruno Salvy - 1995
15 Lambda-Upsilon-Omega -- The 1989 Cookbook – Philippe Flajolet, Bruno Salvy, Paul Zimmermann - 1989
79 Random Mapping Statistics – Philippe Flajolet , Andrew M. Odlyzko - 1990
Bioinformatics – Vol No Pages - 2003
Supernode Binary Search Trees – Haejae Jung And, Haejae Jung, Sartaj Sahni
1 Quick Decoding and Encoding of Prüfer Strings: Exercises in Data Structures – Bryant A. Julstrom
Algorithms and Data Structures -- CSC 721 – Jonathan G. Campbell - 2000
1 The Stack-Size of Combinatorial Tries Revisited – Markus E. Nebel - 2001
12 A Note on Searching in a Binary Search Tree – Arne Andersson, Short Communication - 1991
3 Reactive search for flexible job shop scheduling. Graduate program – John B. Chambers, J. Wesley Barnes - 1998
30 A New Efficient Radix Sort – Arne Andersson , Stefan Nilsson - 1994
The Bitwise Operations Related to a Fast Sorting Algorithm – Krasimir Yordzhev
45 A Comparison of Hashing Schemes for Address Lookup in Computer Networks – Raj Jain - 1989
58 Engineering a Sort Function – Jon L. Bentley, M. Douglas Mcilroy - 1993