Algorithmics of nonuniformity: tools and paradigms
zbMATH Open1402.68004MaRDI QIDQ4642491FDOQ4642491
Authors: Hosam M. Mahmoud, Micha Hofri
Publication date: 23 May 2018
Full work available at URL: https://www.taylorfrancis.com/books/9781498750721
Recommendations
Mellin transformrandom variablesgenerating functionsfinite-state automataformal languagesquicksortsymbolic calculusStirling numbersTuring machinesrestricted permutationsseries-parallel graphsbinary search treesdigital treesrecursive treespseudocodeblock treesinsertion sortadmissible operationsHoppe treesPolya urn schemeCatalan binary series-parallel graph
Research exposition (monographs, survey articles) pertaining to computer science (68-02) 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) Data structures (68P05) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of algorithms (68W01)
Cited In (9)
- Insertion depth in power-weight trees
- On uniformization of affine dependence algorithms
- Title not available (Why is that?)
- Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
- Profile of random exponential recursive trees
- A SPECTRUM OF SERIES–PARALLEL GRAPHS WITH MULTIPLE EDGE EVOLUTION
- Distributions of cherries and pitchforks for the Ford model
- The containment profile of hyper-recursive trees
- Nonlinear phenomena in spaces of algorithms
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)