scientific article; zbMATH DE number 6871552

zbMath1402.68004MaRDI QIDQ4642491

Hosam M. Mahmoud, Micha Hofri

Publication date: 23 May 2018

Full work available at URL: https://www.taylorfrancis.com/books/9781498750721

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Mellin transformgenerating functionsTuring machinesrandom variablesStirling numbersformal languagessymbolic calculusfinite-state automataseries-parallel graphsbinary search treesdigital treesquicksortrestricted permutationsrecursive treespseudocodeblock treesinsertion sortadmissible operationsHoppe treesPolya urn schemeCatalan binary series-parallel graph

Mathematics Subject Classification ID

Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) General topics in the theory of algorithms (68W01) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

Insertion depth in power-weight trees ⋮ A SPECTRUM OF SERIES–PARALLEL GRAPHS WITH MULTIPLE EDGE EVOLUTION ⋮ The containment profile of hyper-recursive trees ⋮ Profile of random exponential recursive trees ⋮ Distributions of cherries and pitchforks for the Ford model

This page was built for publication: