scientific article; zbMATH DE number 815575

Publication date: 14 November 1995

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

generating functions asymptotic approximation average-case performance recurrence relationship

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)

Related Items (only showing first 100 items - show all)

Unnamed Item ⋮ Generating all permutations by context-free grammars in Chomsky normal form ⋮ Reductions in binary search trees ⋮ On the median-of-k version of Hoare's selection algorithm ⋮ Skew Motzkin paths ⋮ Optimizing sorting algorithms by using sorting networks ⋮ Avoiding cross-bifix-free binary words ⋮ Analytic combinatorics for computing seeding probabilities ⋮ Generating all permutations by context-free grammars in Greibach normal form ⋮ On the enumeration of closures and environments with an application to random generation ⋮ Scaling behaviour of quiver quantum mechanics ⋮ Sampling properties of homozygosity-based statistics for linkage disequilibrium ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An improved master theorem for divide-and-conquer recurrences ⋮ Localization in quiver moduli spaces ⋮ Investigating several fundamental properties of random lobster trees and random spider trees ⋮ Stream Ciphers Using a Random Update Function: Study of the Entropy of the Inner State ⋮ Space-efficient functional offline-partially-persistent trees with applications to planar point location ⋮ Nash equilibria in random games with right fat-tailed distributions ⋮ A lower bound for the vertex boundary-width of complete \(k\)-ary trees ⋮ On several properties of a class of hybrid recursive trees ⋮ Ruin probabilities as functions of the roots of a polynomial ⋮ An Analysis of the Height of Tries with Random Weights on the Edges ⋮ Interval partitions and polynomial factorization ⋮ On triangle-free list assignments ⋮ On the finite-time dynamics of ant colony optimization ⋮ Multisection of series ⋮ RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP ⋮ Guessing singular dependencies ⋮ Dynamic construction of an antidictionary with linear complexity ⋮ A hitchhiker's guide to descriptional complexity through analytic combinatorics ⋮ EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA ⋮ On Asymptotics for the Signless Noncentral q‐Stirling Numbers of the First Kind ⋮ Minors of a class of Riordan arrays related to weighted partial Motzkin paths ⋮ The degree/diameter problem in maximal planar bipartite graphs ⋮ Recent Developments in Floorplan Representations ⋮ Renewals for exponentially increasing lifetimes, with an application to digital search trees ⋮ Random binary trees: from the average case analysis to the asymptotics of distributions ⋮ Asymptotic formula for sum of moment mean deviation for order statistics from uniform distribution ⋮ Enumeration and generation with a string automata representation ⋮ Asymptotic distributions for random median quicksort ⋮ THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY ⋮ An asymptotic expansion for theq-binomial series using singularity analysis for generating functions ⋮ Applying Sorting Networks to Synthesize Optimized Sorting Libraries ⋮ On the number of iterations required by Von Neumann addition ⋮ A generic approach for the unranking of labeled combinatorial classes ⋮ Pattern statistics and Vandermonde matrices. ⋮ On the Subtree Size Profile of Binary Search trees ⋮ A probabilistic analysis of some tree algorithms ⋮ Rationalizable strategies in random games ⋮ Some open questions about random walks, involutions, limiting distributions, and generating functions ⋮ Forward-reverse expectation-maximization algorithm for Markov chains: convergence and numerical analysis ⋮ Randomness Preserving Deletions on Special Binary Search Trees ⋮ Sorting Algorithms in MOQA ⋮ Upper tail analysis of bucket sort and random tries ⋮ Arithmetic and \(k\)-maximality of the cyclic free magma ⋮ Computing majority by constant depth majority circuits with low fan-in gates ⋮ On Approximating Matrix Norms in Data Streams ⋮ Polynomial sequences: elementary basic methods and application hints. A survey ⋮ Automatic Editing for Business Surveys: An Assessment of Selected Algorithms ⋮ The dual tree of a recursive triangulation of the disk ⋮ Probabilistic analysis of a genealogical model of animal group patterns ⋮ Limit theorems for patterns in phylogenetic trees ⋮ Unnamed Item ⋮ Minimal change list for Lucas strings and some graph theoretic consequences ⋮ Efficient iteration in admissible combinatorial classes ⋮ Computation of several power indices by generating functions ⋮ Counting visible levels in bargraphs and set partitions ⋮ The minimum \(k\)-storage problem on directed graphs ⋮ A metric index for approximate string matching ⋮ Counting intervals in the packing process ⋮ Coloring permutation graphs in parallel ⋮ Numerical solution of dual-phase-lagging heat conduction model for analyzing overshooting phenomenon ⋮ Certain properties of the Laguerre-Sheffer polynomials ⋮ Enumerative aspects of secondary structures ⋮ Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Towards a realistic analysis of the QuickSelect algorithm ⋮ Forbidden subgraphs in connected graphs ⋮ A bijection between directed column-convex polyominoes and ordered trees of height at most three ⋮ On rotations in fringe-balanced binary trees ⋮ An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication ⋮ Exact solution of a minimal recurrence ⋮ The statistic ``number of udu's in Dyck paths ⋮ On the enumeration of polynomials with prescribed factorization pattern ⋮ A linear-time algorithm for the orbit problem over cyclic groups ⋮ A unified approach to linear probing hashing with buckets ⋮ Occupancy urn models in the analysis of algorithms ⋮ Counting the number of spanning trees in a class of double fixed-step loop networks ⋮ The number of distinct values in a geometrically distributed sample ⋮ Achieving perfect coordination amongst agents in the co-action minority game ⋮ Lagrange inversion: when and how ⋮ Approximating Boolean functions by OBDDs ⋮ The left-right-imbalance of binary search trees ⋮ Binary words excluding a pattern and proper Riordan arrays ⋮ An efficient fixed-parameter algorithm for 3-hitting set ⋮ The average diameter of general tree structures ⋮ Introduction to partially ordered patterns ⋮ Retracted: Strong limiting behavior in binary search trees ⋮ Consecutive patterns in permutations

This page was built for publication: