Algorithmics of nonuniformity: tools and paradigms
admissible operationsbinary search treesblock treesCatalan binary series-parallel graphdigital treesfinite-state automataformal languagesgenerating functionsHoppe treesinsertion sortMellin transformPolya urn schemepseudocodequicksortrandom variablesrecursive treesrestricted permutationsseries-parallel graphsStirling numberssymbolic calculusTuring machines
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Searching and sorting (68P10) Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) General topics in the theory of algorithms (68W01) Nonnumerical algorithms (68W05)
- Insertion depth in power-weight trees
- Profile of random exponential recursive trees
- Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
- On uniformization of affine dependence algorithms
- Nonlinear phenomena in spaces of algorithms
- A SPECTRUM OF SERIES–PARALLEL GRAPHS WITH MULTIPLE EDGE EVOLUTION
- The containment profile of hyper-recursive trees
- scientific article; zbMATH DE number 2343061 (Why is no real title available?)
- Distributions of cherries and pitchforks for the Ford model
This page was built for publication: Algorithmics of nonuniformity: tools and paradigms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642491)
