Bootstrapping and double-exponential limit laws

Bootstrapping and double-exponential limit laws

Combinatorics

Bibliographic Details
Main Authors:	Helmut Prodinger, Stephan Wagner
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2015-03-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	asymptotic scheme bootstrapping generating functions double-exponential distribution [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [info.info-hc] computer science [cs]/human-computer interaction [cs.hc]
Online Access:	https://dmtcs.episciences.org/2125/pdf

Similar Items

Extending a perfect matching to a Hamiltonian cycle
by: Adel Alahmadi, et al.
Published: (2015-03-01)

Digital search trees with m trees: Level polynomials and insertion costs
by: Helmut Prodinger
Published: (2011-08-01)

The location of the first maximum in the first sojourn of a Dyck path
by: Helmut Prodinger
Published: (2008-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)

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)

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

Snarks with total chromatic number 5
by: Gunnar Brinkmann, et al.
Published: (2015-05-01)

Exponential bounds and tails for additive random recursive sequences
by: Ludger Rüschendorf, et al.
Published: (2007-01-01)

Avoider-enforcer star games
by: Andrzej Grzesik, et al.
Published: (2015-03-01)

On additive combinatorics of permutations of ℤ<sub>n</sub>
by: L. Sunil Chandran, et al.
Published: (2014-06-01)

Asymptotic enumeration on self-similar graphs with two boundary vertices
by: Elmar Teufl, et al.
Published: (2009-01-01)

Output sensitive algorithms for covering many points
by: Hossein Ghasemalizadeh, et al.
Published: (2015-04-01)

Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
by: Mikko Pelto
Published: (2015-05-01)

Graphs with large disjunctive total domination number
by: Michael A. Henning, et al.
Published: (2015-04-01)

Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System
by: Valerie Berthe, et al.
Published: (2009-03-01)

On probe 2-clique graphs and probe diamond-free graphs
by: Flavia Bonomo, et al.
Published: (2015-03-01)

A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
by: Sergio Cabello, et al.
Published: (2015-01-01)

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

Detection number of bipartite graphs and cubic graphs
by: Frederic Havet, et al.
Published: (2014-12-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01)

The Cerný conjecture for automata respecting intervals of a directed graph
by: Mariusz Grech, et al.
Published: (2013-11-01)

A variant of Niessen’s problem on degreesequences of graphs
by: Jiyun Guo, et al.
Published: (2014-05-01)

Clique cycle transversals in graphs with few P₄'s
by: Raquel Bravo, et al.
Published: (2013-09-01)

A new characterization and a recognition algorithm of Lucas cubes
by: Andrej Taranenko
Published: (2013-10-01)

The resolving number of a graph Delia
by: Delia Garijo, et al.
Published: (2013-12-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-01-01)

On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups
by: Dariusz Kowalski, et al.
Published: (2013-11-01)

1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs
by: Rafal Witkowski, et al.
Published: (2013-11-01)

Two player game variant of the Erd\H os-Szekeres problem
by: Parikshit Kolipaka, et al.
Published: (2013-11-01)

The Magnus-Derek game in groups
by: Dániel Gerbner
Published: (2013-11-01)

Surjective cellular automata far from the Garden of Eden
by: Silvio Capobianco, et al.
Published: (2013-10-01)

Computing the number of h-edge spanning forests in complete bipartite graphs
by: Rebecca Stones
Published: (2014-05-01)

On the connectedness and diameter of a geometric Johnson graph
by: Crevel Bautista-Santiago, et al.
Published: (2013-09-01)

Robot's hand and expansions in non-integer bases
by: Paola Loreti, et al.
Published: (2014-06-01)

The b-chromatic number of powers of cycles
by: Anja Kohl
Published: (2013-03-01)

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

On Compact Encoding of Pagenumber $k$ Graphs
by: Cyril Gavoille, et al.
Published: (2008-01-01)

Foreword to the special issue dedicated to the tenth ''Journées montoises d'informatique théorique''
by: Véronique Bruyère, et al.
Published: (2007-01-01)

The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01)