| Precise Minimax Regret for Logistic Regression | 0 | 0.34 | 2022 |
| Sufficiently Informative and Relevant Features: An Information-Theoretic and Fourier-Based Characterization | 0 | 0.34 | 2022 |
| Sequential vs. Fixed Design Regrets in Online Learning | 0 | 0.34 | 2022 |
| Hidden Words Statistics For Large Patterns | 0 | 0.34 | 2021 |
| Revisiting Parameter Estimation in Biological Networks: Influence of Symmetries. | 0 | 0.34 | 2021 |
| Degree Distribution for Duplication-Divergence Graphs - Large Deviations. | 0 | 0.34 | 2020 |
| Toward universal testing of dynamic network models. | 0 | 0.34 | 2020 |
| Temporal Ordered Clustering in Dynamic Networks | 0 | 0.34 | 2019 |
| Asymmetric Rényi Problem. | 0 | 0.34 | 2019 |
| Compression Of Preferential Attachment Graphs | 0 | 0.34 | 2019 |
| Goodness of Fit Testing for Dynamic Networks. | 0 | 0.34 | 2019 |
| Entropy and Optimal Compression of Some General Plane Trees. | 0 | 0.34 | 2019 |
| Asymmetry and structural information in preferential attachment graphs | 0 | 0.34 | 2019 |
| Lossless compression of binary trees with correlated vertex names. | 2 | 0.46 | 2018 |
| Joint string complexity for Markov sources: Small data matters | 0 | 0.34 | 2018 |
| Preserving Privacy and Fidelity via Ehrhart Theory | 1 | 0.35 | 2018 |
| TIMES: Temporal Information Maximally Extracted from Structures. | 0 | 0.34 | 2018 |
| Posterior agreement for large parameter-rich optimization problems. | 1 | 0.35 | 2018 |
| Free Energy Asymptotics For Problems With Weak Solution Dependencies | 1 | 0.36 | 2018 |
| A Study of the Boltzmann Sequence-Structure Channel. | 0 | 0.34 | 2017 |
| On Symmetries of Non-Plane Trees in a Non-Uniform Model. | 1 | 0.36 | 2017 |
| Average Size of a Suffix Tree for Markov Sources. | 0 | 0.34 | 2016 |
| Phase transitions in a sequence-structure channel | 0 | 0.34 | 2015 |
| A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence. | 1 | 0.37 | 2014 |
| Expected External Profile of PATRICIA Tries. | 0 | 0.34 | 2014 |
| Markov field types and tilings | 0 | 0.34 | 2014 |
| Classification Of Markov Sources Through Joint String Complexity: Theory And Experiments | 4 | 0.54 | 2013 |
| Capacity of a Structural Binary Symmetric Channel | 0 | 0.34 | 2013 |
| On a Recurrence Arising in Graph Compression. | 0 | 0.34 | 2012 |
| Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets | 7 | 0.50 | 2012 |
| Counting Markov Types, Balanced Matrices, and Eulerian Graphs | 6 | 0.59 | 2012 |
| Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood | 3 | 0.43 | 2011 |
| Philippe Flajolet, the Father of Analytic Combinatorics | 0 | 0.34 | 2011 |
| Obituary. Philippe Flajolet | 0 | 0.34 | 2011 |
| Philippe Flajolet (1948-2011). | 0 | 0.34 | 2011 |
| Constrained pattern matching | 0 | 0.34 | 2011 |
| Philippe flajolet 1 december 1948-22 march 2011 | 0 | 0.34 | 2011 |
| Introduction to the special issue on information theory in molecular biology and neuroscience | 7 | 0.61 | 2010 |
| Tunstall code, Khodak variations, and random walks | 6 | 0.56 | 2010 |
| Minimax redundancy for large alphabets | 5 | 0.51 | 2010 |
| (Un)expected behavior of digital search tree profile | 3 | 0.41 | 2009 |
| Minimum expected length of fixed-to-variable lossless compression of memoryless sources | 1 | 0.37 | 2009 |
| Multiple choice tries and distributed hash tables | 1 | 0.42 | 2009 |
| Annotating Pathways of Interaction Networks | 1 | 0.35 | 2008 |
| Functional annotation of regulatory pathways. | 9 | 0.61 | 2007 |
| Waiting Time Distributions For Pattern Occurrence In A Constrained Sequence | 4 | 0.50 | 2007 |
| Error-resilient LZW data compression | 5 | 0.56 | 2006 |
| Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types | 2 | 0.40 | 2005 |
| A Universal Online Caching Algorithm Based on Pattern Matching | 1 | 0.35 | 2005 |
| Towards a complete characterization of tries | 3 | 0.44 | 2005 |
