| Publication | Date of Publication | Type |
|---|
Precise regularized minimax regret with unbounded weights
IEEE Transactions on Information Theory | 2025-11-25 | Paper |
| Precise minimax regret for logistic regression with categorical feature values | 2025-02-11 | Paper |
Regret bounds for log-loss via Bayesian algorithms
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
On the Concentration of the Maximum Degree in the Duplication-Divergence Models
SIAM Journal on Discrete Mathematics | 2024-03-14 | Paper |
| Analytic Information Theory | 2023-10-16 | Paper |
| The concentration of the maximum degree in the duplication-divergence models | 2023-03-30 | Paper |
| scientific article; zbMATH DE number 7651055 (Why is no real title available?) | 2023-02-07 | Paper |
| Analysis of Lempel-Ziv'78 for Markov Sources | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7651056 (Why is no real title available?) | 2023-02-07 | Paper |
| Degree distribution for duplication-divergence graphs: large deviations | 2022-12-21 | Paper |
scientific article; zbMATH DE number 7625180 (Why is no real title available?)
(available as arXiv preprint) | 2022-11-29 | Paper |
| scientific article; zbMATH DE number 7625180 (Why is no real title available?) | 2022-11-29 | Paper |
Sufficiently Informative and Relevant Features: An Information-Theoretic and Fourier-Based Characterization
IEEE Transactions on Information Theory | 2022-10-11 | Paper |
Sequential universal modeling for non-binary sequences with constrained distributions
Communications in Information and Systems | 2022-07-15 | Paper |
Hidden words statistics for large patterns
The Electronic Journal of Combinatorics | 2021-06-07 | Paper |
Towards degree distribution of a duplication-divergence graph model
The Electronic Journal of Combinatorics | 2021-01-29 | Paper |
Joint string complexity for Markov sources: small data matters
Theoretical Computer Science | 2020-10-21 | Paper |
Randomized Linear Algebra Approaches to Estimate the von Neumann Entropy of Density Matrices
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
The Trade-Off Between Privacy and Fidelity via Ehrhart Theory
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Compression of dynamic graphs generated by a duplication model
Algorithmica | 2020-09-03 | Paper |
Asymmetric Rényi problem
Combinatorics, Probability and Computing | 2020-03-11 | Paper |
How to count quickly and accurately: a unified analysis of probabilistic counting and other related problems
Automata, Languages and Programming | 2019-12-04 | Paper |
Asymmetry and structural information in preferential attachment graphs
Random Structures & Algorithms | 2019-11-28 | Paper |
Phase transitions in parameter rich optimization problems
2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Expected external profile of PATRICIA tries
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
On Symmetries of Non-Plane Trees in a Non-Uniform Model
2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Binary Trees, Left and Right Paths, WKB Expansions, and Painlevé Transcendents
2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Partial fillup and search time in LC tries
2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Towards more realistic probabilistic models for data structures: the external path length in tries under the Markov model
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| scientific article; zbMATH DE number 7051180 (Why is no real title available?) | 2019-05-06 | Paper |
Average size of a suffix tree for Markov sources
(available as arXiv preprint) | 2019-04-29 | Paper |
Asymmetric Rényi problem and PATRICIA tries
(available as arXiv preprint) | 2019-04-29 | Paper |
| Toward Universal Testing of Dynamic Network Models | 2019-04-05 | Paper |
Entropy and optimal compression of some general plane trees
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Partial fillup and search time in LC tries
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Posterior agreement for large parameter-rich optimization problems
Theoretical Computer Science | 2018-09-24 | Paper |
Lossless Compression of Binary Trees With Correlated Vertex Names
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Profiles of PATRICIA tries
Algorithmica | 2018-02-28 | Paper |
Greedy algorithms for the shortest common superstring that are asymtotically optimal
Algorithms — ESA '96 | 2017-12-05 | Paper |
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
Foundations and Trends™ in Communications and Information Theory | 2017-11-22 | Paper |
| A master theorem for discrete divide and conquer recurrences | 2017-09-29 | Paper |
Tunstall Code, Khodak Variations, and Random Walks
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Noisy Constrained Capacity for BSC Channels
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Counting Markov Types, Balanced Matrices, and Eulerian Graphs
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Average Redundancy of the Shannon Code for Markov Sources
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
On the Limiting Distribution of Lempel-Ziv’78 Redundancy for Memoryless Sources
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Types of Markov Fields and Tilings
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| scientific article; zbMATH DE number 6683480 (Why is no real title available?) | 2017-02-10 | Paper |
| scientific article; zbMATH DE number 6683543 (Why is no real title available?) | 2017-02-10 | Paper |
Compact suffix trees resemble PATRICIA tries: limiting distribution of the depth
Journal of the Iranian Statistical Society JIRSS | 2016-11-28 | Paper |
A functional equation often arising in the analysis of algorithms (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
| On symmetry of uniform and preferential attachment graphs | 2016-03-01 | Paper |
| Free energy rates for a class of very noisy optimization problems | 2016-03-01 | Paper |
| A Limit Theorem for Radix Sort and Tries with Markovian Input | 2015-05-27 | Paper |
Philippe Flajolet
ACM Communications in Computer Algebra | 2015-02-20 | Paper |
| Multiple choice tries and distributed hash tables | 2014-12-18 | Paper |
Data driven weak universal consistency
(available as arXiv preprint) | 2014-11-17 | Paper |
| Towards a complete characterization of tries | 2014-10-13 | Paper |
| Joint string complexity for Markov sources | 2014-09-29 | Paper |
| A new binomial recurrence arising in a graphical compression algorithm | 2014-09-29 | Paper |
A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence
Combinatorics, Probability and Computing | 2014-09-24 | Paper |
On symmetry of uniform and preferential attachment graphs
The Electronic Journal of Combinatorics | 2014-09-09 | Paper |
Constrained pattern matching
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Philippe flajolet, the father of analytic combinatorics
ACM Transactions on Algorithms | 2014-09-09 | Paper |
A master theorem for discrete divide and conquer recurrences
Journal of the ACM | 2014-02-17 | Paper |
| scientific article; zbMATH DE number 6131558 (Why is no real title available?) | 2013-01-28 | Paper |
On a recurrence arising in graph compression
The Electronic Journal of Combinatorics | 2012-10-24 | Paper |
Philippe Flajolet, the father of analytic combinatorics
Algorithmica | 2012-04-26 | Paper |
In memoriam: Philippe Flajolet, the father of analytic combinatorics
RAIRO - Theoretical Informatics and Applications | 2012-02-28 | Paper |
PHILIPPE FLAJOLET 1 December 1948 – 22 March 2011
Combinatorics, Probability and Computing | 2011-12-08 | Paper |
Philippe Flajolet, the father of analytic combinatorics
Theoretical Computer Science | 2011-09-12 | Paper |
The expected profile of digital search trees
Journal of Combinatorial Theory. Series A | 2011-07-07 | Paper |
| On the exit time of a random walk with positive drift | 2010-08-02 | Paper |
| On the Ehrenfeucht-Mycielski balance conjecture | 2010-08-02 | Paper |
| On the average profile of symmetric digital search trees | 2010-06-03 | Paper |
A universal online caching algorithm based on pattern matching
Algorithmica | 2010-03-04 | Paper |
Profiles of Tries
SIAM Journal on Computing | 2009-11-06 | Paper |
| On some nonlinear recurrences that arise in computer science | 2009-07-27 | Paper |
Multiple choice tries and distributed hash tables
Random Structures & Algorithms | 2009-06-16 | Paper |
On the Construction of (Explicit) Khodak's Code and Its Analysis
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
A One-to-One Code and Its Anti-Redundancy
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Hidden word statistics
Journal of the ACM | 2008-12-21 | Paper |
Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Precise Minimax Redundancy and Regret
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Markov Types and Minimax Redundancy for Markov Sources
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Multicast tree structure and the power law
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Problems on Sequences: Information Theory and Computer Science Interface
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On the Joint Path Length Distribution in Random Binary Trees
Studies in Applied Mathematics | 2008-10-17 | Paper |
On the entropy of a hidden Markov process
Theoretical Computer Science | 2008-07-10 | Paper |
| Waiting time distributions for pattern occurrence in a constrained sequence | 2008-05-27 | Paper |
| scientific article; zbMATH DE number 5279360 (Why is no real title available?) | 2008-05-27 | Paper |
| scientific article; zbMATH DE number 5279360 (Why is no real title available?) | 2008-05-27 | Paper |
Profile of Tries
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Assessing Significance of Connectivity and Conservation in Protein Interaction Networks
Lecture Notes in Computer Science | 2007-08-30 | Paper |
Finding biclusters by random projections
Theoretical Computer Science | 2007-01-22 | Paper |
Maximum Queue Length and Waiting Time Revisited: Multserver G/G/<i>c</i> Queue
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
| Analysis of biclusters with applications to gene expression data | 2006-08-29 | Paper |
| scientific article; zbMATH DE number 5050583 (Why is no real title available?) | 2006-08-29 | Paper |
Research in Computational Molecular Biology
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Probabilistic behavior of asymmetric level compressed tries
Random Structures & Algorithms | 2005-09-22 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
A universal predictor based on pattern matching
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Analytic variations on redundancy rates of renewal processes
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Optimal versus randomized search of fixed length binary words
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Special Issue on Analysis of Algorithms
Combinatorics, Probability and Computing | 2005-04-18 | Paper |
| scientific article; zbMATH DE number 2156265 (Why is no real title available?) | 2005-04-15 | Paper |
| scientific article; zbMATH DE number 2156266 (Why is no real title available?) | 2005-04-15 | Paper |
On the number of full levels in tries
Random Structures & Algorithms | 2005-02-16 | Paper |
On average sequence complexity
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2119681 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2086237 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1984551 (Why is no real title available?) | 2003-09-22 | Paper |
Limit laws for the height in PATRICIA tries
Journal of Algorithms | 2003-03-23 | Paper |
The height of a binary search tree: the limiting distribution perspective.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1820016 (Why is no real title available?) | 2002-12-10 | Paper |
| scientific article; zbMATH DE number 1754591 (Why is no real title available?) | 2002-06-12 | Paper |
Average profile of the Lempel-Ziv parsing scheme for a Markovian source
Algorithmica | 2002-01-14 | Paper |
On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol
Information Sciences | 2001-10-10 | Paper |
On asymptotics of certain recurrences arising in universal coding
Problems of Information Transmission | 2001-09-10 | Paper |
Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
Wiley-Interscience Series in Discrete Mathematics and Optimization | 2001-05-28 | Paper |
| scientific article; zbMATH DE number 1552327 (Why is no real title available?) | 2001-04-18 | Paper |
Asymptotic average redundancy of Huffman (and other) block codes
IEEE Transactions on Information Theory | 2001-03-19 | Paper |
A suboptimal lossy data compression based on approximate pattern matching
IEEE Transactions on Information Theory | 2001-01-14 | Paper |
Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme
SIAM Journal on Computing | 2000-10-18 | Paper |
A note on the asymptotic behavior of the heights in \(b\)-trees for \(b\) large
The Electronic Journal of Combinatorics | 2000-09-14 | Paper |
A note on the asymptotic behavior of the heights in \(b\)-trees for \(b\) large
The Electronic Journal of Combinatorics | 2000-09-14 | Paper |
| scientific article; zbMATH DE number 1445303 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1512698 (Why is no real title available?) | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1375579 (Why is no real title available?) | 1999-12-09 | Paper |
| scientific article; zbMATH DE number 1375579 (Why is no real title available?) | 1999-12-09 | Paper |
Entropy computations via analytic depoissonization
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Philippe Flajolet's research in analysis of algorithms and combinatorics
Algorithmica | 1999-06-21 | Paper |
On pattern frequency occurrences in a Markovian sequence
Algorithmica | 1999-04-22 | Paper |
Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
SIAM Journal on Computing | 1999-02-22 | Paper |
Analytical depoissonization and its applications
Theoretical Computer Science | 1998-08-13 | Paper |
Greedy algorithms for the shortest common superstring that are asymptotically optimal
Algorithmica | 1998-05-24 | Paper |
Analysis of an asymmetric leader election algorithm
The Electronic Journal of Combinatorics | 1998-02-12 | Paper |
On the average redundancy rate of the Lempel-Ziv code
IEEE Transactions on Information Theory | 1997-11-05 | Paper |
Stability analysis of quota allocation access protocols in ring networks with spatial reuse
IEEE Transactions on Information Theory | 1997-10-28 | Paper |
| scientific article; zbMATH DE number 987641 (Why is no real title available?) | 1997-06-23 | Paper |
On the distribution for the duration of a randomized leader election algorithm
The Annals of Applied Probability | 1997-06-12 | Paper |
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
Theoretical Computer Science | 1997-02-28 | Paper |
On pattern occurrences in a random text
Information Processing Letters | 1997-02-27 | Paper |
On asymptotics of certain sums arising in coding theory
IEEE Transactions on Information Theory | 1996-08-13 | Paper |
A Probabilistic Analysis of a String Editing Problem and its Variations
Combinatorics, Probability and Computing | 1996-01-25 | Paper |
The probability of large queue lengths and waiting times in a heterogeneous multiserver queue I: Tight limits
Advances in Applied Probability | 1996-01-15 | Paper |
A scheduling policy with maximal stability region for ring networks with spatial reuse
Queueing Systems | 1995-07-25 | Paper |
| scientific article; zbMATH DE number 744093 (Why is no real title available?) | 1995-07-17 | Paper |
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
IEEE Transactions on Information Theory | 1995-07-12 | Paper |
Combinational optimization problems for which almost every algorithm is asymptotically optimal
Optimization | 1995-06-21 | Paper |
| scientific article; zbMATH DE number 742990 (Why is no real title available?) | 1995-04-11 | Paper |
Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
Journal of Combinatorial Theory. Series A | 1994-11-30 | Paper |
Asymptotic properties of data compression and suffix trees
IEEE Transactions on Information Theory | 1994-10-03 | Paper |
A note on binomial recurrences arising in the analysis of algorithms
Information Processing Letters | 1994-09-19 | Paper |
Digital Search Trees Again Revisited: The Internal Path Length Perspective
SIAM Journal on Computing | 1994-08-14 | Paper |
MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
International Journal of Foundations of Computer Science | 1994-03-13 | Paper |
A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
SIAM Journal on Computing | 1994-02-07 | Paper |
Stability conditions for some distributed systems: buffered random access systems
Advances in Applied Probability | 1994-01-01 | Paper |
Limiting Distribution for the Depth in PATRICIA Tries
SIAM Journal on Discrete Mathematics | 1993-07-21 | Paper |
A probabilistic analysis of a pattern matching problem
Random Structures & Algorithms | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177551 (Why is no real title available?) | 1993-05-18 | Paper |
Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter
Theoretical Computer Science | 1993-04-22 | Paper |
| scientific article; zbMATH DE number 140470 (Why is no real title available?) | 1993-03-28 | Paper |
Self-alignments in words and their applications
Journal of Algorithms | 1993-01-16 | Paper |
Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited
SIAM Journal on Computing | 1993-01-16 | Paper |
Stability of token passing rings
Queueing Systems | 1992-09-27 | Paper |
A Note on the Height of Suffix Trees
SIAM Journal on Computing | 1992-06-28 | Paper |
A characterization of digital search trees from the successful search viewpoint
Theoretical Computer Science | 1992-06-28 | Paper |
On the height of digital trees and related problems
Algorithmica | 1991-01-01 | Paper |
Patricia tries again revisited
Journal of the ACM | 1990-01-01 | Paper |
Yet another application of a binomial recurrence. Order statistics
Computing | 1990-01-01 | Paper |
On The variance of the extremal path length in a symmetric digital trie
Discrete Applied Mathematics | 1989-01-01 | Paper |
On the balance property of Patricia tries: External path length viewpoint
Theoretical Computer Science | 1989-01-01 | Paper |
Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation
SIAM Journal on Computing | 1989-01-01 | Paper |
The presence of exponentiality in entropy maximized M/GI/1 queues
Computers & Operations Research | 1989-01-01 | Paper |
Some results on V-ary asymmetric tries
Journal of Algorithms | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4064465 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4057000 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4072401 (Why is no real title available?) | 1988-01-01 | Paper |
The evaluation of an alternative sum with applications to the analysis of some data structures
Information Processing Letters | 1988-01-01 | Paper |
Stability Conditions for Multidimensional Queueing Systems with Computer Applications
Operations Research | 1988-01-01 | Paper |
Some Theorems on Instability with Applications to Multiaccess Protocols
Operations Research | 1988-01-01 | Paper |
On a recurrence equation arising in the analysis of conflict resolution algorithms
Communications in Statistics. Stochastic Models | 1987-01-01 | Paper |
Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4007734 (Why is no real title available?) | 1987-01-01 | Paper |
An analysis of a contention resolution algorithm. Another approach
Acta Informatica | 1987-01-01 | Paper |
Bounds for Queue Lengths in a Contention Packet Broadcast System
IEEE Transactions on Communications | 1986-01-01 | Paper |
Some sufficient conditions for non-ergodicity of markov chains
Journal of Applied Probability | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3866314 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3675308 (Why is no real title available?) | 1980-01-01 | Paper |
