| Publication | Date of Publication | Type |
|---|
| On the Concentration of the Maximum Degree in the Duplication-Divergence Models | 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 |
| https://portal.mardi4nfdi.de/entity/Q5874414 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874415 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874416 | 2023-02-07 | Paper |
| Degree distribution for duplication-divergence graphs: large deviations | 2022-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5054625 | 2022-11-29 | Paper |
| Sufficiently Informative and Relevant Features: An Information-Theoretic and Fourier-Based Characterization | 2022-10-11 | Paper |
| Sequential universal modeling for non-binary sequences with constrained distributions | 2022-07-15 | Paper |
| Hidden words statistics for large patterns | 2021-06-07 | Paper |
| Towards degree distribution of a duplication-divergence graph model | 2021-01-29 | Paper |
| Joint string complexity for Markov sources: small data matters | 2020-10-21 | Paper |
| The Trade-Off Between Privacy and Fidelity via Ehrhart Theory | 2020-09-29 | Paper |
| Randomized Linear Algebra Approaches to Estimate the von Neumann Entropy of Density Matrices | 2020-09-29 | Paper |
| Compression of dynamic graphs generated by a duplication model | 2020-09-03 | Paper |
| Asymmetric Rényi Problem | 2020-03-11 | Paper |
| How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems | 2019-12-04 | Paper |
| Asymmetry and structural information in preferential attachment graphs | 2019-11-28 | Paper |
| Expected External Profile of PATRICIA Tries | 2019-09-17 | Paper |
| Phase Transitions in Parameter Rich Optimization Problems | 2019-09-17 | Paper |
| On Symmetries of Non-Plane Trees in a Non-Uniform Model | 2019-09-17 | Paper |
| Partial fillup and search time in LC tries | 2019-09-16 | Paper |
| Binary Trees, Left and Right Paths, WKB Expansions, and Painlevé Transcendents | 2019-09-16 | Paper |
| Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633819 | 2019-05-06 | Paper |
| Asymmetric R\'enyi Problem and PATRICIA Tries | 2019-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4632488 | 2019-04-29 | Paper |
| Entropy and Optimal Compression of Some General Plane Trees | 2019-03-28 | Paper |
| Partial fillup and search time in LC tries | 2018-11-05 | Paper |
| Posterior agreement for large parameter-rich optimization problems | 2018-09-24 | Paper |
| Lossless Compression of Binary Trees With Correlated Vertex Names | 2018-09-19 | Paper |
| Profiles of PATRICIA tries | 2018-02-28 | Paper |
| Greedy algorithms for the shortest common superstring that are asymtotically optimal | 2017-12-05 | Paper |
| Redundancy of Lossless Data Compression for Known Sources by Analytic Methods | 2017-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365047 | 2017-09-29 | Paper |
| Noisy Constrained Capacity for BSC Channels | 2017-07-27 | Paper |
| Tunstall Code, Khodak Variations, and Random Walks | 2017-07-27 | Paper |
| Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets | 2017-07-12 | Paper |
| Counting Markov Types, Balanced Matrices, and Eulerian Graphs | 2017-07-12 | Paper |
| Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments | 2017-07-12 | Paper |
| Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints | 2017-07-12 | Paper |
| Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood | 2017-06-08 | Paper |
| Average Redundancy of the Shannon Code for Markov Sources | 2017-06-08 | Paper |
| On the Limiting Distribution of Lempel-Ziv’78 Redundancy for Memoryless Sources | 2017-05-16 | Paper |
| Types of Markov Fields and Tilings | 2017-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2959853 | 2017-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2959919 | 2017-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2834331 | 2016-11-28 | Paper |
| A functional equation often arising in the analysis of algorithms (extended abstract) | 2016-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2789544 | 2016-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2789565 | 2016-03-01 | Paper |
| Philippe Flajolet | 2015-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934678 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921651 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2920840 | 2014-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2920863 | 2014-09-29 | Paper |
| A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence | 2014-09-24 | Paper |
| On symmetry of uniform and preferential attachment graphs | 2014-09-09 | Paper |
| Constrained pattern matching | 2014-09-09 | Paper |
| Philippe flajolet, the father of analytic combinatorics | 2014-09-09 | Paper |
| A Master Theorem for Discrete Divide and Conquer Recurrences | 2014-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904103 | 2013-01-28 | Paper |
| On a recurrence arising in graph compression | 2012-10-24 | Paper |
| Philippe Flajolet, the father of analytic combinatorics | 2012-04-26 | Paper |
| In memoriam: Philippe Flajolet, the father of analytic combinatorics | 2012-02-28 | Paper |
| PHILIPPE FLAJOLET 1 December 1948 – 22 March 2011 | 2011-12-08 | Paper |
| Philippe Flajolet, the father of analytic combinatorics | 2011-09-12 | Paper |
| The expected profile of digital search trees | 2011-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576751 | 2010-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576772 | 2010-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3565419 | 2010-06-03 | Paper |
| A universal online caching algorithm based on pattern matching | 2010-03-04 | Paper |
| Profiles of Tries | 2009-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5190759 | 2009-07-27 | Paper |
| Multiple choice tries and distributed hash tables | 2009-06-16 | Paper |
| On the Construction of (Explicit) Khodak's Code and Its Analysis | 2009-02-24 | Paper |
| A One-to-One Code and Its Anti-Redundancy | 2009-02-24 | Paper |
| Hidden word statistics | 2008-12-21 | Paper |
| Multicast tree structure and the power law | 2008-12-21 | Paper |
| Precise Minimax Redundancy and Regret | 2008-12-21 | Paper |
| Markov Types and Minimax Redundancy for Markov Sources | 2008-12-21 | Paper |
| Problems on Sequences: Information Theory and Computer Science Interface | 2008-12-21 | Paper |
| Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments | 2008-12-21 | Paper |
| On the Joint Path Length Distribution in Random Binary Trees | 2008-10-17 | Paper |
| On the entropy of a hidden Markov process | 2008-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387662 | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387705 | 2008-05-27 | Paper |
| Profile of Tries | 2008-04-15 | Paper |
| Assessing Significance of Connectivity and Conservation in Protein Interaction Networks | 2007-08-30 | Paper |
| Finding biclusters by random projections | 2007-01-22 | Paper |
| Maximum Queue Length and Waiting Time Revisited: Multserver G/G/c Queue | 2007-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485317 | 2006-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485322 | 2006-08-29 | Paper |
| Research in Computational Molecular Biology | 2005-11-23 | Paper |
| Probabilistic behavior of asymmetric level compressed tries | 2005-09-22 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| A universal predictor based on pattern matching | 2005-05-11 | Paper |
| Optimal versus randomized search of fixed length binary words | 2005-05-11 | Paper |
| Analytic variations on redundancy rates of renewal processes | 2005-05-11 | Paper |
| Special Issue on Analysis of Algorithms | 2005-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668723 | 2005-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668724 | 2005-04-15 | Paper |
| On the number of full levels in tries | 2005-02-16 | Paper |
| On average sequence complexity | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828952 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044335 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428916 | 2003-09-22 | Paper |
| Limit laws for the height in PATRICIA tries | 2003-03-23 | Paper |
| The height of a binary search tree: the limiting distribution perspective. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152799 | 2002-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535016 | 2002-06-12 | Paper |
| Average profile of the Lempel-Ziv parsing scheme for a Markovian source | 2002-01-14 | Paper |
| On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol | 2001-10-10 | Paper |
| On asymptotics of certain recurrences arising in universal coding | 2001-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2715788 | 2001-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4524571 | 2001-04-18 | Paper |
| Asymptotic average redundancy of Huffman (and other) block codes | 2001-03-19 | Paper |
| A suboptimal lossy data compression based on approximate pattern matching | 2001-01-14 | Paper |
| Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme | 2000-10-18 | Paper |
| A note on the asymptotic behavior of the heights in \(b\)-trees for \(b\) large | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952616 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508387 | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3836519 | 1999-12-09 | Paper |
| Entropy computations via analytic depoissonization | 1999-11-21 | Paper |
| Philippe Flajolet's research in analysis of algorithms and combinatorics | 1999-06-21 | Paper |
| On pattern frequency occurrences in a Markovian sequence | 1999-04-22 | Paper |
| Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm | 1999-02-22 | Paper |
| Analytical depoissonization and its applications | 1998-08-13 | Paper |
| Greedy algorithms for the shortest common superstring that are asymptotically optimal | 1998-05-24 | Paper |
| Analysis of an asymmetric leader election algorithm | 1998-02-12 | Paper |
| On the average redundancy rate of the Lempel-Ziv code | 1997-11-05 | Paper |
| Stability analysis of quota allocation access protocols in ring networks with spatial reuse | 1997-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3123119 | 1997-06-23 | Paper |
| On the distribution for the duration of a randomized leader election algorithm | 1997-06-12 | Paper |
| Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees | 1997-02-28 | Paper |
| On pattern occurrences in a random text | 1997-02-27 | Paper |
| On asymptotics of certain sums arising in coding theory | 1996-08-13 | Paper |
| A Probabilistic Analysis of a String Editing Problem and its Variations | 1996-01-25 | Paper |
| The probability of large queue lengths and waiting times in a heterogeneous multiserver queue I: Tight limits | 1996-01-15 | Paper |
| A scheduling policy with maximal stability region for ring networks with spatial reuse | 1995-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763609 | 1995-07-17 | Paper |
| Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm | 1995-07-12 | Paper |
| Combinational optimization problems for which almost every algorithm is asymptotically optimal | 1995-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763430 | 1995-04-11 | Paper |
| Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach | 1994-11-30 | Paper |
| Asymptotic properties of data compression and suffix trees | 1994-10-03 | Paper |
| A note on binomial recurrences arising in the analysis of algorithms | 1994-09-19 | Paper |
| Digital Search Trees Again Revisited: The Internal Path Length Perspective | 1994-08-14 | Paper |
| MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES | 1994-03-13 | Paper |
| A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors | 1994-02-07 | Paper |
| Stability conditions for some distributed systems: buffered random access systems | 1994-01-01 | Paper |
| Limiting Distribution for the Depth in PATRICIA Tries | 1993-07-21 | Paper |
| A probabilistic analysis of a pattern matching problem | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037422 | 1993-05-18 | Paper |
| Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter | 1993-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028887 | 1993-03-28 | Paper |
| Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited | 1993-01-16 | Paper |
| Self-alignments in words and their applications | 1993-01-16 | Paper |
| Stability of token passing rings | 1992-09-27 | Paper |
| A characterization of digital search trees from the successful search viewpoint | 1992-06-28 | Paper |
| A Note on the Height of Suffix Trees | 1992-06-28 | Paper |
| On the height of digital trees and related problems | 1991-01-01 | Paper |
| Yet another application of a binomial recurrence. Order statistics | 1990-01-01 | Paper |
| Patricia tries again revisited | 1990-01-01 | Paper |
| The presence of exponentiality in entropy maximized M/GI/1 queues | 1989-01-01 | Paper |
| On the balance property of Patricia tries: External path length viewpoint | 1989-01-01 | Paper |
| On The variance of the extremal path length in a symmetric digital trie | 1989-01-01 | Paper |
| Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation | 1989-01-01 | Paper |
| The evaluation of an alternative sum with applications to the analysis of some data structures | 1988-01-01 | Paper |
| Some results on V-ary asymmetric tries | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792238 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798225 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804206 | 1988-01-01 | Paper |
| Stability Conditions for Multidimensional Queueing Systems with Computer Applications | 1988-01-01 | Paper |
| Some Theorems on Instability with Applications to Multiaccess Protocols | 1988-01-01 | Paper |
| An analysis of a contention resolution algorithm. Another approach | 1987-01-01 | Paper |
| On a recurrence equation arising in the analysis of conflict resolution algorithms | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758250 | 1987-01-01 | Paper |
| Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms | 1987-01-01 | Paper |
| Bounds for Queue Lengths in a Contention Packet Broadcast System | 1986-01-01 | Paper |
| Some sufficient conditions for non-ergodicity of markov chains | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3333828 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3871923 | 1980-01-01 | Paper |
