scientific article; zbMATH DE number 815575
From MaRDI portal
Publication:4855565
Recommendations
Cited in
(only showing first 100 items - show all)- The average position of the dth maximum in a sample of geometric random variables
- Moves and displacements of particular elements in quicksort
- On asymptotic extrapolation
- Noncommutative algebra, multiple harmonic sums and applications in discrete probability
- On the variance of the number of occupied boxes
- Repeated patterns in genetic programming
- The relevant prefixes of coloured Motzkin walks: an average case analysis
- The average diameter of general tree structures
- Automatic average-case analysis of algorithms
- 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
- Occupancy urn models in the analysis of algorithms
- 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.
- Enumerating a class of lattice paths
- The calculation of average distance in mesh structures.
- Combinatorics of periods in strings.
- Lyndon words, permutations and trees.
- A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
- The average diameter and its estimation in nonlinear structures
- A heuristic to accelerate in-situ permutation algorithms
- Basic analytic combinatorics of directed lattice paths
- An algorithm for finding a k-median in a directed tree
- Modified binary searching for static tables
- Binary search tree recursions with harmonic toll functions
- Coloring permutation graphs in parallel
- Achieving perfect coordination amongst agents in the co-action minority game
- On the number of non-equivalent ancestral configurations for matching gene trees and species trees
- Singularity analysis, Hadamard products, and tree recurrences
- Mixed Poisson approximation of node depth distributions in random binary search trees
- Production matrices
- Regular expression searching on compressed text
- Enumerating symmetric directed convex polyominoes
- Ordered trees with prescribed root degrees, node degrees, and branch lengths
- 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.
- Average number of distinct part sizes in a random Carlitz composition
- Relax, but don't be too lazy
- Counting intervals in the packing process
- Enumerative aspects of secondary structures
- Forbidden subgraphs in connected graphs
- A bijection between directed column-convex polyominoes and ordered trees of height at most three
- The statistic ``number of udu's in Dyck paths
- 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
- Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
- A bijection on ordered trees and its consequences
- Approximation of probability density functions for PDEs with random parameters using truncated series expansions
- Techniques on solving systems of nonlinear difference equations
- Preimages under the bubblesort operator
- Certain properties of the Laguerre-Sheffer polynomials
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- On the enumeration of polynomials with prescribed factorization pattern
- Almost sure convergence to the quicksort process
- Rationalizable strategies in random games
- Arithmetic and \(k\)-maximality of the cyclic free magma
- Computing majority by constant depth majority circuits with low fan-in gates
- Polynomial sequences: elementary basic methods and application hints. A survey
- 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
- Computation of several power indices by generating functions
- The minimum k-storage problem on directed graphs
- Generating all permutations by context-free grammars in Chomsky normal form
- Reductions in binary search trees
- Avoiding cross-bifix-free binary words
- Generating all permutations by context-free grammars in Greibach normal form
- A lower bound for the vertex boundary-width of complete \(k\)-ary trees
- Interval partitions and polynomial factorization
- On the finite-time dynamics of ant colony optimization
- Guessing singular dependencies
- Dynamic construction of an antidictionary with linear complexity
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- Minors of a class of Riordan arrays related to weighted partial Motzkin paths
- 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
- Enumeration and generation with a string automata representation
- Asymptotic distributions for random median quicksort
- Pattern statistics and Vandermonde matrices.
- A probabilistic analysis of some tree algorithms
- Minimal change list for Lucas strings and some graph theoretic consequences
- Efficient iteration in admissible combinatorial classes
- Skew Motzkin paths
- Optimizing sorting algorithms by using sorting networks
- Analytic combinatorics for computing seeding probabilities
- Scaling behaviour of quiver quantum mechanics
- Sampling properties of homozygosity-based statistics for linkage disequilibrium
- Investigating several fundamental properties of random lobster trees and random spider trees
- Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
- Numerical solution of dual-phase-lagging heat conduction model for analyzing overshooting phenomenon
- Asymptotic enumeration of cographs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4855565)
