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)

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 ⋮ Analysis of a randomized rendezvous algorithm ⋮ Optimal binary search trees with costs depending on the access paths. ⋮ Generalized covariances of multi-dimensional Brownian excursion local times. ⋮ Analysis of multiple quickselect variants. ⋮ An algorithm to generate exactly once every tiling with lozenges of a domain. ⋮ Post-processing hierarchical community structures: quality improvements and multi-scale view ⋮ Almost sure convergence to the quicksort process ⋮ Smooth movement and Manhattan path based random waypoint mobility ⋮ A \(q\)-analogue of the Stirling formula and a continuous limiting behaviour of the \(q\)-binomial distribution -- numerical calculations ⋮ Enumerating a class of lattice paths ⋮ Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees ⋮ Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile ⋮ The calculation of average distance in mesh structures. ⋮ Combinatorics of periods in strings. ⋮ The analysis of range quickselect and related problems ⋮ Lyndon words, permutations and trees. ⋮ Trees with exponentially growing costs ⋮ Management and analysis of DNA microarray data by using weighted trees ⋮ A stochastically quasi-optimal search algorithm for the maximum of the simple random walk ⋮ Analytical study of a stochastic plant growth model: application to the GreenLab model ⋮ A slicing tree representation and QCP-model-based heuristic algorithm for the unequal-area block facility layout problem ⋮ Analytic and combinatoric aspects of Hurwitz polyzetas ⋮ Weighted height of random trees ⋮ A bijection on ordered trees and its consequences ⋮ On the number of non-equivalent ancestral configurations for matching gene trees and species trees ⋮ Combinatorial analysis of tetris-like games ⋮ The number of convex permutominoes ⋮ Singularity analysis, Hadamard products, and tree recurrences ⋮ Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern ⋮ Riordan matrices and higher-dimensional lattice walks ⋮ Chain hexagonal cacti: matchings and independent sets ⋮ Enumeration results for alternating tree families ⋮ Mixed Poisson approximation of node depth distributions in random binary search trees ⋮ Production matrices ⋮ Rooted tree statistics from Matula numbers ⋮ On the silhouette of binary search trees ⋮ Binary trees with choosable edge lengths ⋮ Enumeration and random generation of accessible automata ⋮ The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance ⋮ Approximation of probability density functions for PDEs with random parameters using truncated series expansions ⋮ The average position of the \(d\)th maximum in a sample of geometric random variables ⋮ Techniques on solving systems of nonlinear difference equations ⋮ Moves and displacements of particular elements in quicksort ⋮ On asymptotic extrapolation ⋮ Noncommutative algebra, multiple harmonic sums and applications in discrete probability ⋮ Average complexity of Moore's and Hopcroft's algorithms ⋮ On the variance of the number of occupied boxes ⋮ Regular expression searching on compressed text ⋮ Enumerating symmetric directed convex polyominoes ⋮ Ordered trees with prescribed root degrees, node degrees, and branch lengths ⋮ Repeated patterns in genetic programming ⋮ The relevant prefixes of coloured Motzkin walks: an average case analysis ⋮ The average diameter and its estimation in nonlinear structures ⋮ Dyck path enumeration ⋮ Analytic combinatorics of non-crossing configurations ⋮ Asymptotic estimation of the average number of terminal states in DAWGs ⋮ An analytic approach for the analysis of rotations in fringe-balanced binary search trees ⋮ Asymptotic analysis of an optimized quicksort algorithm. ⋮ Random lattices, threshold phenomena and efficient reduction algorithms. ⋮ On the robustness of interconnections in random graphs: a symbolic approach. ⋮ Sorting algorithms for broadcast communications: mathematical analysis. ⋮ Some results on tries with adaptive branching. ⋮ A heuristic to accelerate in-situ permutation algorithms ⋮ Basic analytic combinatorics of directed lattice paths ⋮ Average number of distinct part sizes in a random Carlitz composition ⋮ Preimages under the bubblesort operator ⋮ An algorithm for finding a \(k\)-median in a directed tree ⋮ Relax, but don't be too lazy ⋮ Modified binary searching for static tables ⋮ Binary search tree recursions with harmonic toll functions

This page was built for publication: