Digital search trees with m trees: Level polynomials and insertion costs

Digital search trees with m trees: Level polynomials and insertion costs

Analysis of Algorithms

Bibliographic Details
Main Author:	Helmut Prodinger
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2011-08-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/557/pdf

Similar Items

The Variance of the Profile in Digital Search Trees
by: Ramin Kazemi, et al.
Published: (2011-09-01)

The location of the first maximum in the first sojourn of a Dyck path
by: Helmut Prodinger
Published: (2008-01-01)

A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations
by: Guy Louchard, et al.
Published: (2007-01-01)

Asymptotic results for silent elimination
by: Guy Louchard, et al.
Published: (2010-01-01)

The asymmetric leader election algorithm with Swedish stopping: a probabilistic analysis
by: Guy Louchard, et al.
Published: (2012-09-01)

q-Enumeration of words by their total variation
by: Ligia Loreta Cristea, et al.
Published: (2011-01-01)

On the Book Thickness of k-Trees
by: Vida Dujmović, et al.
Published: (2011-10-01)

Adjoint functors and tree duality
by: Jan Foniok, et al.
Published: (2009-01-01)

The Laplacian spread of a tree
by: Yi-Zheng Fan, et al.
Published: (2008-01-01)

Colouring the Square of the Cartesian Product of Trees
by: David R. Wood
Published: (2011-08-01)

On the kth Eigenvalues of Trees with Perfect Matchings
by: An Chang, et al.
Published: (2007-01-01)

Clustered Spanning Tree - Conditions for Feasibility
by: Nili Guttmann-Beck, et al.
Published: (2019-08-01)

Structure of spanning trees on the two-dimensional Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2011-01-01)

Analysis of some parameters for random nodes in priority trees
by: Alois Panholzer
Published: (2008-01-01)

String pattern avoidance in generalized non-crossing trees
by: Yidong Sun, et al.
Published: (2009-01-01)

Tree-width and large grid minors in planar graphs
by: Alexander Grigoriev
Published: (2011-02-01)

Note on the weighted internal path length of b-ary trees
by: Ludger Rüschendorf, et al.
Published: (2007-01-01)

Recurrence among trees with most numerous efficient dominating sets
by: Dorota Bród, et al.
Published: (2008-01-01)

Polynomial-time normalizers
by: Eugene M. Luks, et al.
Published: (2011-12-01)

On the minimal distance of a polynomial code
by: Peter Pal Pach, et al.
Published: (2011-11-01)

Automaticity of primitive words and irreducible polynomials
by: Anne Lacroix, et al.
Published: (2013-01-01)

The height of q-Binary Search Trees
by: Michael Drmota, et al.
Published: (2002-01-01)

Recursions and divisibility properties for combinatorial Macdonald polynomials
by: Nicholas A. Loehr, et al.
Published: (2011-02-01)

An expected polynomial time algorithm for coloring 2-colorable 3-graphs
by: Yury Person, et al.
Published: (2011-05-01)

Probabilistic Analysis of Carlitz Compositions
by: Guy Louchard, et al.
Published: (2002-01-01)

Ambiguity in the m-bonacci numeration system
by: Petra Kocábová, et al.
Published: (2007-01-01)

Right-cancellability of a family of operations on binary trees
by: Philippe Duchon
Published: (1998-01-01)

Counting descents, rises, and levels, with prescribed first element, in words
by: Sergey Kitaev, et al.
Published: (2008-01-01)

On the degree-chromatic polynomial of a tree
by: Diego Cifuentes
Published: (2012-01-01)

Ore and Erdős type conditions for long cycles in balanced bipartite graphs
by: Janusz Adamus, et al.
Published: (2009-01-01)

A construction of small regular bipartite graphs of girth 8
by: Camino Balbuena
Published: (2009-01-01)

Computation of L_⊕ for several cubic Pisot numbers
by: Julien Bernat
Published: (2007-01-01)

Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
by: Gábor Bacsó, et al.
Published: (2009-01-01)

On the k-restricted structure ratio in planar and outerplanar graphs
by: Gruia Călinescu, et al.
Published: (2008-01-01)

On quadratic residue codes and hyperelliptic curves
by: David Joyner
Published: (2008-01-01)

On the complexity of the balanced vertex ordering problem
by: Jan Kára, et al.
Published: (2007-01-01)

Regular languages and associative language descriptions
by: Marcella Anselmo, et al.
Published: (2007-01-01)

On the size of induced acyclic subgraphs in random digraphs
by: Joel Spencer, et al.
Published: (2008-01-01)

Generating involutions, derangements, and relatives by ECO
by: Vincent Vajnovszki
Published: (2010-01-01)

Tribes of cubic partial cubes
by: Sandi Klavžar, et al.
Published: (2007-01-01)