Analytical depoissonization and its applications
type: Item
instance of: scholarly article
title: Analytical depoissonization and its applications
zbMATH Open document ID: 0902.68087
DOI: 10.1016/S0304-3975(97)00167-9
author: Philippe Jacquet
author: Wojciech Szpankowski
published in: Theoretical Computer Science
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1190155
zbMATH Keywords: poissonization
zbMATH Keywords: depoissonization
zbMATH Keywords: Cauchy integral formula
zbMATH Keywords: saddle point method
zbMATH Keywords: limiting distributions
zbMATH Keywords: Mellin transform of complex variable
zbMATH Keywords: analytical combinatorics
zbMATH Keywords: analysis of algorithms and data structures
zbMATH Keywords: digital trees
MaRDI profile type: Publication
cites work: Probability approximations via the Poisson clumping heuristic
cites work: Independent process approximations for random combinatorial structures
cites work: Q3847215
cites work: Tree algorithms for packet broadcast channels
cites work: Q4170993
cites work: Q4769056
cites work: Integral transforms and their applications. 2nd ed
cites work: The expected length of the longest probe sequence for bucket searching when the distribution is not uniform
cites work: Q5799604
cites work: On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
cites work: Analysis of a stack algorithm for random multiple-access communication
cites work: Q5624436
cites work: On the distribution for the duration of a randomized leader election algorithm
cites work: Mellin transforms and asymptotics: Harmonic sums
cites work: Probabilistic counting algorithms for data base applications
cites work: Singularity Analysis of Generating Functions
cites work: Q3675510
cites work: Generalized Digital Trees and Their Difference—Differential Equations
cites work: Expected Length of the Longest Probe Sequence in Hash Code Searching
cites work: The analysis of linear probing sort by the use of a new mathematical transform
cites work: Q4876454
cites work: On Birthday, Collectors', Occupancy and Other Classical Urn Problems
cites work: Asymptotic Estimates of Elementary Probability Distributions
cites work: Q3742733
cites work: Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation
cites work: Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
cites work: Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
cites work: Analysis of an asymmetric leader election algorithm
cites work: On Deviations between Theoretical and Empirical Distributions
cites work: Digital Search Trees Again Revisited: The Internal Path Length Perspective
cites work: Q3123119
cites work: Q4057549
cites work: Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
cites work: On the average redundancy rate of the Lempel-Ziv code
cites work: Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
cites work: Q4004056
cites work: &lt;tex&gt;Q&lt;/tex&gt;-ary collision resolution algorithms in random-access systems with free or blocked channel access
cites work: Q4871770
cites work: Approximating functions by their Poisson transform
cites work: The Diagonal Poisson Transform and its application to the analysis of a hashing scheme
cites work: How to select a loser
cites work: Limiting Distribution for the Depth in PATRICIA Tries
cites work: New results on the size of tries
cites work: Q3359022
cites work: Q3218851
cites work: The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
cites work: Q4851833
cites work: Q3748279
cites work: On a recurrence equation arising in the analysis of conflict resolution algorithms
cites work: Patricia tries again revisited
cites work: Random multiple packet access: part-and-try algorithm
cites work: Q4385514
cites work: Q3995745
cites work: Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
cites work: A universal algorithm for sequential data compression
cites work: Compression of individual sequences via variable-rate coding
full work available at URL: s0304-3975(97)00167-9
OpenAlex ID: W2085901659