Analytical Depoissonization and its Applications

No abstract is available for this paper.

• Publication year

  1998

• Venue

  Theoretical Computer Science

• Publication date

  1998-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0304-3975(97)00167-9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Analysis of algorithms

  2000cited by this paper
• Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm

  1999cited by this paper
• The Art of Computer Programming: Volume 3: Sorting and Searching

  1998cited by this paper
• Asymptotic Estimates of Elementary Probability Distributions

  1997cited by this paper
• Analysis of an Asymmetric Leader Election Algorithm

  1997cited by this paper
• The Diagonal Poisson Transform and its application to the analysis of a hashing scheme

  1997cited by this paper
• On the average redundancy rate of the Lempel-Ziv code

  1997cited by this paper
• On the distribution for the duration of a randomized leader election algorithm

  1996cited by this paper
• Analysis of a splitting process arising in probabilistic counting and other related algorithms

  1996cited by this paper
• Handbook of Combinatorics

  1995cited by this paper
• Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees

  1995cited by this paper
• Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm

  1995cited by this paper
• Mellin Transforms and Asymptotics: Harmonic Sums

  1995cited by this paper
• Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity

  1994cited by this paper
• Autocorrelation on Words and Its Applications - Analysis of Suffix Trees by String-Ruler Approach

  1994cited by this paper
• Independent Process Approximations for Random Combinatorial Structures

  1994cited by this paper
• How to select a loser

  1993cited by this paper
• Generalized Digital Trees and Their Difference-Differential Equations

  1992cited by this paper
• The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects

  1992cited by this paper
• Evolution of random search trees

  1991cited by this paper
• Analysis of digital tries with Markovian dependency

  1991cited by this paper
• Analysis of algorithms and data structures

  1991cited by this paper
• Singularity Analysis of Generating Functions

  1990cited by this paper
• Theory of Complex Functions

  1990cited by this paper
• Patricia tries again revisited

  1990cited by this paper
• Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics

  1990cited by this paper
• New results on the size of tries

  1989cited by this paper
• Contribution de l'analyse d'algorithmes à l'évaluation de protocoles de communication

  1989cited by this paper
• Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation

  1989cited by this paper
• Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression

  1989cited by this paper
• Probability Approximations via the Poisson Clumping Heuristic

  1988cited by this paper
• Probabilistic Analysis of Algorithms

  1987cited by this paper
• Normal Limiting Distribution of the Size of Tries

  1987cited by this paper
• Limiting distributions for trie parameters

  1986cited by this paper
• Approximating Functions by Their Poisson Transform

  1986cited by this paper
• On Birthday, Collectors', Occupancy and Other Classical Urn Problems

  1986cited by this paper
• On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel

  1986cited by this paper
• Enumerative Combinatorics

  1986cited by this paper
• Analysis of a stack algorithm for random multiple-access communication

  1985cited by this paper
• Algebraic Methods for Trie Statistics

  1985cited by this paper
• The Expected Length of the Longest Probe Sequence for Bucket Searching when the Distribution is Not Uniform

  1985cited by this paper
• Probabilistic Counting Algorithms for Data Base Applications

  1985cited by this paper
• Q -ary collision resolution algorithms in random-access systems with free or blocked channel access

  1985cited by this paper
• The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform

  1984cited by this paper
• The art of computer programming

  1983cited by this paper
• Stochastic Processes

  1982cited by this paper
• Expected Length of the Longest Probe Sequence in Hash Code Searching

  1981cited by this paper
• Generalized TDMA: The Multi-Accessing Tree Protocol

  1979cited by this paper
• An Introduction to Orthogonal Polynomials

  1979cited by this paper
• Tree algorithms for packet broadcast channels

  1979cited by this paper
• Integral transforms and their applications

  1978cited by this paper
• Compression of individual sequences via variable-rate coding

  1978cited by this paper
• A universal algorithm for sequential data compression

  1977cited by this paper
• The art of computer programming: sorting and searching (volume 3)

  1973cited by this paper
• An Introduction to Probability Theory and Its Applications

  1967cited by this paper
• An Introduction to Probability Theory and Its Applications

  1959cited by this paper
• Asymptotic methods in analysis

  1958cited by this paper
• Handbuch der Laplace-Transformation

  1950cited by this paper
• On Deviations between Theoretical and Empirical Distributions.

  1949cited by this paper
• Purdue e-Pubs Purdue e-Pubs

  year unknowncited by this paper

• Generalization Bounds for Markov Algorithms through Entropy Flow Computations

  2025cites this paper
• Conditional independence testing for discrete distributions: Beyond χ2- and G-tests

  2023influential citation
• Asymptotic expansions relating to the distribution of the length of longest increasing subsequences

  2023influential citation
• Generalized Sketches for Streaming Sets

  2022cites this paper
• Streaming Algorithms for Estimating High Set Similarities in LogLog Space

  2021cites this paper
• Project-Team Hipercom HIgh PERformance COMmunication

  2021cites this paper
• Asymptotic normality for the size of graph tries built from M-ary tree labelings

  2021cites this paper
• On the mixtures of length-biased Weibull distributions for loss severity modeling

  2020cites this paper
• Analysis of Lempel-Ziv'78 for Markov Sources

  2020cites this paper
• Distribution of Tail Symbols in DST for Markov Sources

  2020cites this paper
• On sequential selection and a first passage problem for the Poisson process

  2020cites this paper
• Poisson limit theorems for the Robinson-Schensted correspondence and for the multi-line Hammersley process

  2020cites this paper
• Asymptotics of Entropy of the Dirichlet-Multinomial Distribution

  2019cites this paper
• Committee Selection is More Similar Than You Think: Evidence from Avalanche and Stellar

  2019cites this paper
• Leaves in a Particular Class of Trees

  2019cites this paper
• Estimation of Information Measures and Its Applications in Machine Learning

  2019cites this paper
• Joint Sequence Complexity: Introduction and Theory

  2018cites this paper
• Joint String Complexity for Markov Sources: Small Data Matters

  2018cites this paper
• PR ] 5 N ov 2 01 7 Asymmetric Rényi Problem

  2018cites this paper
• Hyperfractals for the Modelling of Wireless Networks

  2018cites this paper
• On the Rate of Convergence of the Connectivity Threshold of Random Geometric Graphs with Skew Generalized Cantor Distributed Vertices

  2018cites this paper
• Direct estimation of information divergence using nearest neighbor ratios

  2017cites this paper
• On the Rate of Convergence of the Connectivity Threshold of Random Geometric Graphs with Skew Generalized Cantor Distributed Vertices

  2017cites this paper
• Generating Random Permutations by Coin Tossing

  2017cites this paper
• Node profiles of symmetric digital search trees: Concentration properties

  2017cites this paper
• Analysis of digital search trees incorporated with paging

  2017cites this paper
• Dependence between path-length and size in random digital trees

  2017cites this paper
• New cardinality estimation algorithms for HyperLogLog sketches

  2017cites this paper
• Asymmetric R\'enyi Problem

  2017cites this paper
• Average distances on self-similar sets and higher order average distances of self-similar measures

  2017cites this paper
• Self-similarity in urban wireless networks: Hyperfractals

  2017cites this paper
• Asymmetric Rényi Problem

  2017cites this paper
• Information Dissemination in Vehicular Networks in an Urban Hyperfractal Topology

  2017cites this paper
• EXPECTATIONS OVER DETERMINISTIC FRACTAL SETS

  2016cites this paper
• Profiles of PATRICIA Tries

  2016influential citation
• On the Variety of Shapes in Digital Trees

  2016influential citation
• Average Size of a Suffix Tree for Markov Sources

  2016cites this paper
• Impact of trust-based security association and mobility on the delay metric in MANET

  2016cites this paper
• Pattern Coding Meets Censoring: (almost) Adaptive Coding on Countable Alphabets

  2016cites this paper
• Average distances on self-similar sets and higher order average distances of self-similar measures

  2016cites this paper
• From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader

  2015cites this paper
• A Limit Theorem for Radix Sort and Tries with Markovian Input

  2015cites this paper
• Trend Detection and Information Propagation in Dynamic Social Networks. (Détection des tendances et la propagation des informations dans les réseaux sociaux dynamiques)

  2015cites this paper
• Probabilistic Analysis of Radix Algorithms on Markov Sources

  2015cites this paper
• Variance of Size in Regular Graph Tries

  2015cites this paper
• Analytic Pattern Matching by Philippe Jacquet

  2015cites this paper
• Order statistics of the generalised multinomial measure

  2014cites this paper
• Joint sequence complexity analysis: Application to social networks information flow

  2014influential citation
• On the Limiting Distribution of Lempel-Ziv’78 Redundancy for Memoryless Sources

  2014cites this paper
• Expected External Profile of PATRICIA Tries

  2014cites this paper
• A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence

  2014influential citation
• OPTIMAL ONLINE SELECTION OF A MONOTONE SUBSEQUENCE: A CENTRAL LIMIT THEOREM

  2014influential citation
• Etiology and treatment of hematological neoplasms: stochastic mathematical models.

  2014cites this paper
• Towards a Realistic Analysis of Some Popular Sorting Algorithms

  2014cites this paper
• Words with a generalized restricted growth property

  2013cites this paper
• An analytic approach to the asymptotic variance of trie statistics and related structures

  2013cites this paper
• Repopulation of interacting tumor cells during fractionated radiotherapy: stochastic modeling of the tumor control probability.

  2013cites this paper
• Expectations on fractal sets

  2013cites this paper
• A Binomial Splitting Process in Connection with Corner Parking Problems

  2013cites this paper
• Classification of Markov sources through joint string complexity: Theory and experiments

  2013cites this paper
• On Delta-Method of Moments and Probabilistic Sums

  2013cites this paper
• A Novel Energy Efficient Broadcast Leader Election

  2013cites this paper
• Moments of discrete measures with dense jumps induced by β-expansions

  2013cites this paper
• The Variance of the Number of 2-Protected Nodes in a Trie

  2013cites this paper
• Algorithms , Combinatorics , Information , and Beyond Plenary Talk at ISIT

  2012cites this paper
• A New Binomial Recurrence Arising in a Graphical Compression Algorithm

  2012cites this paper
• Project : Probabilistic Analysis of Random Digital Trees

  2012cites this paper
• Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments

  2012influential citation
• Ieee Information Theory Society Newsletter President's Column from the Editor Ieee Information Theory Society Newsletter the Historian's Column

  2012cites this paper
• IEEE Information Theory Society Newsletter

  2012cites this paper
• Joint String Complexity for Markov Sources

  2012cites this paper
• On a Recurrence Arising in Graph Compression

  2012cites this paper
• Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model

  2012influential citation
• Approximate Counting via the Poisson-Laplace-Mellin Method

  2012influential citation
• Analysis of swaps in radix selection

  2011cites this paper
• Théorie de l'information, séries de Dirichlet, et analyse d'algorithmes. (Information theory, Dirichlet series, and analysis of algorithms)

  2011cites this paper
• Mini-Workshop: Random Trees, Information and Algorithms

  2011cites this paper
• The expected profile of digital search trees

  2011cites this paper
• The Variance of The Profile in Digital Search Trees

  2011cites this paper
• Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints

  2011cites this paper
• Average Case Analysis of Algorithms

  2010cites this paper
• Sharp Bounds on the Entropy of the Poisson Law and Related Quantities

  2010cites this paper
• Information Propagation Speed in Mobile and Delay Tolerant Networks

  2010cites this paper
• Fast Algorithm for Optimal Compression of Graphs

  2010cites this paper
• New analysis of the asymptotic behavior of the Lempel-Ziv compression algorithm

  2010cites this paper
• Profiles of large combinatorial structures

  2010cites this paper
• On an asymptotic series of Ramanujan

  2009cites this paper
• On the shape of the fringe of various types of random trees

  2009cites this paper
• On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks

  2009cites this paper
• Inverse auctions: Injecting unique minima into random sets

  2009cites this paper
• Profiles of Permutations

  2009cites this paper
• Broadcast delay of epidemic routing in intermittently connected networks

  2009cites this paper
• Compression of graphical structures

  2009cites this paper
• Resilient dictionaries

  2009cites this paper
• On Tries, Contention Trees and Their Analysis

  2009cites this paper
• Imbalance in Random Digital Trees

  2009cites this paper
• Information Propagation Speed in Mobile and Delay Tolerant Networks

  2009cites this paper
• The Expected Profile of Digital Search Trees ∗ December 10 , 2009

  2009cites this paper
• Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding

  2008cites this paper
• Profile of Tries

  2008influential citation