Wojciech Szpankowski

330 papers A* 23A 6B 80C 3Misc 6Journal 186Unranked 22

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Breaking through the classical Shannon entropy limit: A new frontier through logical semantics. CoRR Luis A. Lastras, Barry M. Trager, Jonathan Lenchner, Wojciech Szpankowski, Chai Wah Wu, Mark S. Squillante, Alexander Gray
2025	A*	`conf`	No Free Lunch: Fundamental Limits of Learning Non-Hallucinating Generative Models. ICLR Changlong Wu, Ananth Grama, Wojciech Szpankowski
2025	B	`conf`	Online Learning with Nasty Experts. ISIT Nikolaos Papagiannis, Wojciech Szpankowski, Changlong Wu
2025	J	`jnl`	Precise Regularized Minimax Regret With Unbounded Weights. IEEE Trans. Inf. Theory Michael Drmota, Philippe Jacquet, Changlong Wu, Wojciech Szpankowski
2024	J	`jnl`	Efficient Gradient Estimation of Variational Quantum Circuits with Lie Algebraic Symmetries. CoRR Mohsen Heidari, Masih Mozakka, Wojciech Szpankowski
2024	A*	`conf`	Information-theoretic Limits of Online Classification with Noisy Labels. NeurIPS Changlong Wu, Ananth Grama, Wojciech Szpankowski
2024	B	`conf`	Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning. ISIT Gil I. Shamir, Wojciech Szpankowski
2024	B	`conf`	Minimax Regret with Unbounded Weights. ISIT Michael Drmota, Philippe Jacquet, Changlong Wu, Wojciech Szpankowski
2024	B	`conf`	New Bounds on Quantum Sample Complexity of Measurement Classes. ISIT Mohsen Heidari, Wojciech Szpankowski
2024	J	`jnl`	New Bounds on Quantum Sample Complexity of Measurement Classes. CoRR Mohsen Heidari, Wojciech Szpankowski
2024	J	`jnl`	No Free Lunch: Fundamental Limits of Learning Non-Hallucinating Generative Models. CoRR Changlong Wu, Ananth Grama, Wojciech Szpankowski
2024	J	`jnl`	On the Concentration of the Maximum Degree in the Duplication-Divergence Models. SIAM J. Discret. Math. Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski
2024	A	`conf`	Online Distribution Learning with Local Privacy Constraints. AISTATS Jin Sima, Changlong Wu, Olgica Milenkovic, Wojciech Szpankowski
2024	J	`jnl`	Online Distribution Learning with Local Private Constraints. CoRR Jin Sima, Changlong Wu, Olgica Milenkovic, Wojciech Szpankowski
2024	A*	`conf`	Oracle-Efficient Hybrid Online Learning with Unknown Distribution. COLT Changlong Wu, Jin Sima, Wojciech Szpankowski
2024	J	`jnl`	Oracle-Efficient Hybrid Online Learning with Unknown Distribution. CoRR Changlong Wu, Jin Sima, Wojciech Szpankowski
2023	A	`conf`	Agnostic PAC Learning of k-juntas Using L AISTATS Mohsen Heidari, Wojciech Szpankowski
2023	J	`jnl`	Agnostic PAC Learning of k-juntas Using L2-Polynomial Regression. CoRR Mohsen Heidari, Wojciech Szpankowski
2023	J	`jnl`	Expected Worst Case Regret via Stochastic Sequential Covering. Trans. Mach. Learn. Res. Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski
2023	A*	`conf`	Learning Functional Distributions with Private Labels. ICML Changlong Wu, Yifan Wang, Ananth Grama, Wojciech Szpankowski
2023	A	`conf`	Learning k-qubit Quantum Operators via Pauli Decomposition. AISTATS Mohsen Heidari, Wojciech Szpankowski
2023	J	`jnl`	On the concentration of the maximum degree in the duplication-divergence models. CoRR Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski
2023	A*	`conf`	Online Learning in Dynamically Changing Environments. COLT Changlong Wu, Ananth Grama, Wojciech Szpankowski
2023	J	`jnl`	Online Learning in Dynamically Changing Environments. CoRR Changlong Wu, Ananth Grama, Wojciech Szpankowski
2023	J	`jnl`	Quantum Shadow Gradient Descent for Quantum Learning. CoRR Mohsen Heidari, Md Mobasshir Arshed Naved, Wenbo Xie, Arjun Jacob Grama, Wojciech Szpankowski
2023	J	`jnl`	Regret Bounds for Log-Loss via Bayesian Algorithms. IEEE Trans. Inf. Theory Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski
2023	J	`jnl`	Robust Online Classification: From Estimation to Denoising. CoRR Changlong Wu, Ananth Grama, Wojciech Szpankowski
2023	J	`jnl`	Towards a Unification of Logic and Information Theory. CoRR Luis A. Lastras, Barry M. Trager, Jonathan Lenchner, Wojciech Szpankowski, Chai Wah Wu, Mark S. Squillante, Alexander Gray
2022	J	`jnl`	Compression and symmetry of small-world graphs and structures. Commun. Inf. Syst. Ioannis Kontoyiannis, Yi Heng Lim, Katia Papakonstantinopoulou, Wojciech Szpankowski
2022	J	`jnl`	Data-Derived Weak Universal Consistency. J. Mach. Learn. Res. Narayana Santhanam, Venkatachalam Anantharam, Wojciech Szpankowski
2022	J	`jnl`	Expected Worst Case Regret via Stochastic Sequential Covering. CoRR Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski
2022	B	`conf`	Precise Minimax Regret for Logistic Regression. ISIT Philippe Jacquet, Gil I. Shamir, Wojciech Szpankowski
2022	A*	`conf`	Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm. NeurIPS Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski
2022	J	`jnl`	Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm. CoRR Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski
2022	J	`jnl`	Sequential universal modeling for non-binary sequences with constrained distributions. Commun. Inf. Syst. Michael Drmota, Gil I. Shamir, Wojciech Szpankowski
2022	B	`conf`	Sequential vs. Fixed Design Regrets in Online Learning. ISIT Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski
2022	A	`conf`	Statistical and computational thresholds for the planted k-densest sub-hypergraph problem. AISTATS Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann
2022	J	`jnl`	Sufficiently Informative and Relevant Features: An Information-Theoretic and Fourier-Based Characterization. IEEE Trans. Inf. Theory Mohsen Heidari, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski
2022	A*	`conf`	Toward Physically Realizable Quantum Neural Networks. AAAI Mohsen Heidari, Ananth Grama, Wojciech Szpankowski
2022	J	`jnl`	Toward Physically Realizable Quantum Neural Networks. CoRR Mohsen Heidari, Ananth Grama, Wojciech Szpankowski
2021	J	`jnl`	A Low Degree Learning Algorithm for Quantum Data via Quantum Fourier. CoRR Mohsen Heidari, Wojciech Szpankowski
2021	B	`conf`	A Lower Bound for Regret in Logistic Regression. ISIT Gil I. Shamir, Wojciech Szpankowski
2021	B	`conf`	A Theoretical Framework for Learning from Quantum Data. ISIT Mohsen Heidari, Arun Padakandla, Wojciech Szpankowski
2021	J	`jnl`	A Theoretical Framework for Learning from Quantum Data. CoRR Mohsen Heidari, Arun Padakandla, Wojciech Szpankowski
2021	A*	`conf`	Finding Relevant Information via a Discrete Fourier Expansion. ICML Mohsen Heidari, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski
2021	J	`jnl`	Hidden Words Statistics for Large Patterns. Electron. J. Comb. Svante Janson, Wojciech Szpankowski
2021	B	`conf`	Information Sufficiency via Fourier Expansion. ISIT Mohsen Heidari, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski
2021	J	`jnl`	Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning. CoRR Gil I. Shamir, Wojciech Szpankowski
2021	J	`jnl`	On Agnostic PAC Learning using L CoRR Mohsen Heidari, Wojciech Szpankowski
2021	B	`conf`	On maximum-likelihood estimation in the all-or-nothing regime. ISIT Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann
2021	J	`jnl`	On maximum-likelihood estimation in the all-or-nothing regime. CoRR Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann
2021	B	`conf`	Precise Minimax Regret for Logistic Regression with Categorical Feature Values. ALT Philippe Jacquet, Gil I. Shamir, Wojciech Szpankowski
2021	J	`jnl`	Revisiting Parameter Estimation in Biological Networks: Influence of Symmetries. IEEE ACM Trans. Comput. Biol. Bioinform. Jithin K. Sreedharan, Krzysztof Turowski, Wojciech Szpankowski
2021	B	`conf`	Symmetry and the Entropy of Small-World Structures and Graphs. ISIT Ioannis Kontoyiannis, Yi Heng Lim, Katia Papakonstantinopoulou, Wojciech Szpankowski
2021	J	`jnl`	Temporal Ordered Clustering in Dynamic Networks: Unsupervised and Semi-Supervised Learning Algorithms. IEEE Trans. Netw. Sci. Eng. Krzysztof Turowski, Jithin K. Sreedharan, Wojciech Szpankowski
2021	Misc	`conf`	The Concentration of the Maximum Degree in the Duplication-Divergence Models. COCOON Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski
2021	J	`jnl`	Towards Degree Distribution of a Duplication-Divergence Graph Model. Electron. J. Comb. Krzysztof Turowski, Wojciech Szpankowski
2020	C	`conf`	Analysis of Lempel-Ziv'78 for Markov Sources. AofA Philippe Jacquet, Wojciech Szpankowski
2020	J	`jnl`	Compression and Symmetry of Small-World Graphs and Structures. CoRR Ioannis Kontoyiannis, Yi Heng Lim, Katia Papakonstantinopoulou, Wojciech Szpankowski
2020	J	`jnl`	Compression of Dynamic Graphs Generated by a Duplication Model. Algorithmica Krzysztof Turowski, Abram Magner, Wojciech Szpankowski
2020	B	`conf`	Degree Distribution for Duplication-Divergence Graphs: Large Deviations. WG Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski
2020	C	`conf`	Hidden Words Statistics for Large Patterns. AofA Svante Janson, Wojciech Szpankowski
2020	J	`jnl`	Hidden Words Statistics for Large Patterns. CoRR Svante Janson, Wojciech Szpankowski
2020	J	`jnl`	Joint string complexity for Markov sources: Small data matters. Theor. Comput. Sci. Philippe Jacquet, Dimitris Milioris, Wojciech Szpankowski
2020	C	`conf`	Power-Law Degree Distribution in the Connected Component of a Duplication Graph. AofA Philippe Jacquet, Krzysztof Turowski, Wojciech Szpankowski
2020	J	`jnl`	Randomized Linear Algebra Approaches to Estimate the von Neumann Entropy of Density Matrices. IEEE Trans. Inf. Theory Eugenia-Maria Kontopoulou, Gregory-Paul Dexter, Wojciech Szpankowski, Ananth Grama, Petros Drineas
2020	J	`jnl`	Sequential Universal Modeling for Non-Binary Sequences with Constrained Distributions. CoRR Michael Drmota, Gil I. Shamir, Wojciech Szpankowski
2020	J	`jnl`	Statistical and computational thresholds for the planted k-densest sub-hypergraph problem. CoRR Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann
2020	B	`conf`	Temporal Ordered Clustering in Dynamic Networks. ISIT Krzysztof Turowski, Jithin K. Sreedharan, Wojciech Szpankowski
2020	J	`jnl`	The Trade-Off Between Privacy and Fidelity via Ehrhart Theory. IEEE Trans. Inf. Theory Arun Padakandla, P. R. Kumar, Wojciech Szpankowski
2020	B	`conf`	Toward universal testing of dynamic network models. ALT Abram Magner, Wojciech Szpankowski
2019	J	`jnl`	Asymmetric Rényi Problem. Comb. Probab. Comput. Michael Drmota, Abram Magner, Wojciech Szpankowski
2019	J	`jnl`	Asymmetry and structural information in preferential attachment graphs. Random Struct. Algorithms Tomasz Luczak, Abram Magner, Wojciech Szpankowski
2019	B	`conf`	Asymptotics of Entropy of the Dirichlet-Multinomial Distribution. ISIT Krzysztof Turowski, Philippe Jacquet, Wojciech Szpankowski
2019	B	`conf`	Compression of Preferential Attachment Graphs. ISIT Tomasz Luczak, Abram Magner, Wojciech Szpankowski
2019	J	`jnl`	Entropy and Optimal Compression of Some General Plane Trees. ACM Trans. Algorithms Zbigniew Golebiewski, Abram Magner, Wojciech Szpankowski
2019	J	`jnl`	Goodness of Fit Testing for Dynamic Networks. CoRR Abram Magner, Wojciech Szpankowski
2019	J	`jnl`	Temporal Ordered Clustering in Dynamic Networks. CoRR Krzysztof Turowski, Jithin K. Sreedharan, Wojciech Szpankowski
2018	—	`conf`	Compression of Dynamic Graphs Generated by a Duplication Model. Allerton Krzysztof Turowski, Abram Magner, Wojciech Szpankowski
2018	B	`conf`	Free Energy Asymptotics for Problems with Weak Solution Dependencies. ISIT Alexey Gronskiy, Joachim M. Buhmann, Wojciech Szpankowski
2018	J	`jnl`	Frontiers of Science of Information: Shannon Meets Turing. Computer Wojciech Szpankowski, Ananth Grama
2018	J	`jnl`	Joint String Complexity for Markov Sources: Small Data Matters. CoRR Philippe Jacquet, Dimitris Milioris, Wojciech Szpankowski
2018	J	`jnl`	Lossless Compression of Binary Trees With Correlated Vertex Names. IEEE Trans. Inf. Theory Abram Magner, Krzysztof Turowski, Wojciech Szpankowski
2018	J	`jnl`	Posterior agreement for large parameter-rich optimization problems. Theor. Comput. Sci. Joachim M. Buhmann, Julien Dumazert, Alexey Gronskiy, Wojciech Szpankowski
2018	B	`conf`	Preserving Privacy and Fidelity via Ehrhart Theory. ISIT Arun Padakandla, P. R. Kumar, Wojciech Szpankowski
2018	J	`jnl`	Profiles of PATRICIA Tries. Algorithmica Abram Magner, Wojciech Szpankowski
2018	B	`conf`	Randomized Linear Algebra Approaches to Estimate the Von Neumann Entropy of Density Matrices. ISIT Eugenia-Maria Kontopoulou, Ananth Grama, Wojciech Szpankowski, Petros Drineas
2018	J	`jnl`	Randomized Linear Algebra Approaches to Estimate the Von Neumann Entropy of Density Matrices. CoRR Eugenia-Maria Kontopoulou, Ananth Grama, Wojciech Szpankowski, Petros Drineas
2018	A*	`conf`	TIMES: Temporal Information Maximally Extracted from Structures. WWW Abram N. Magner, Jithin K. Sreedharan, Ananth Y. Grama, Wojciech Szpankowski
2018	J	`jnl`	The Trade-off between Privacy and Fidelity via Ehrhart Theory. CoRR Arun Padakandla, P. R. Kumar, Wojciech Szpankowski
2017	J	`jnl`	A Study of the Boltzmann Sequence-Structure Channel. Proc. IEEE Abram Magner, Daisuke Kihara, Wojciech Szpankowski
2017	B	`conf`	Entropy of some general plane trees. ISIT Zbigniew Golebiewski, Abram Magner, Wojciech Szpankowski
2017	—	`conf`	On Symmetries of Non-Plane Trees in a Non-Uniform Model. ANALCO Jacek Cichon, Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
2017	—	`conf`	Phase Transitions in Parameter Rich Optimization Problems. ANALCO Joachim M. Buhmann, Julien Dumazert, Alexey Gronskiy, Wojciech Szpankowski
2017	B	`conf`	Recovery of vertex orderings in dynamic graphs. ISIT Abram Magner, Ananth Grama, Jithin K. Sreedharan, Wojciech Szpankowski
2017	J	`jnl`	Redundancy of Lossless Data Compression for Known Sources by Analytic Methods. Found. Trends Commun. Inf. Theory Michael Drmota, Wojciech Szpankowski
2016	J	`jnl`	Asymmetric Rényi Problem and PATRICIA Tries. CoRR Michael Drmota, Abram Magner, Wojciech Szpankowski
2016	J	`jnl`	Average Size of a Suffix Tree for Markov Sources. CoRR Philippe Jacquet, Wojciech Szpankowski
2016	J	`jnl`	Fundamental Bounds and Approaches to Sequence Reconstruction from Nanopore Sequencers. CoRR Jarek Duda, Wojciech Szpankowski, Ananth Grama
2016	J	`jnl`	Fundamental Bounds for Sequence Reconstruction From Nanopore Sequencers. IEEE Trans. Mol. Biol. Multi Scale Commun. Abram Magner, Jaroslaw Duda, Wojciech Szpankowski, Ananth Grama
2016	B	`conf`	Lossless compression of binary trees with correlated vertex names. ISIT Abram Magner, Krzysztof Turowski, Wojciech Szpankowski
2016	B	`conf`	The Boltzmann sequence-structure channel. ISIT Abram Magner, Daisuke Kihara, Wojciech Szpankowski
2016	J	`jnl`	Types of Markov Fields and Tilings. IEEE Trans. Inf. Theory Yuliy M. Baryshnikov, Jaroslaw Jarek Duda, Wojciech Szpankowski
2015	J	`jnl`	A Limit Theorem for Radix Sort and Tries with Markovian Input. CoRR Kevin Leckey, Ralph Neininger, Wojciech Szpankowski
2015	—	`book`	Analytic Pattern Matching - From DNA to Twitter. Philippe Jacquet, Wojciech Szpankowski
2015	Misc	`conf`	Phase transitions in a sequence-structure channel. ITA Abram Magner, Daisuke Kihara, Wojciech Szpankowski
2014	J	`jnl`	A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence. Comb. Probab. Comput. Philippe Jacquet, Charles Knessl, Wojciech Szpankowski
2014	J	`jnl`	Data driven consistency (working title). CoRR Narayana P. Santhanam, Venkat Anantharam, Aleksandar Kavcic, Wojciech Szpankowski
2014	B	`conf`	Data-driven weak universal redundancy. ISIT Narayana Prasad Santhanam, Venkat Anantharam, Aleksandar Kavcic, Wojciech Szpankowski
2014	—	`conf`	Expected External Profile of PATRICIA Tries. ANALCO Abram Magner, Charles Knessl, Wojciech Szpankowski
2014	B	`conf`	Markov field types and tilings. ISIT Yuliy M. Baryshnikov, Jaroslaw Duda, Wojciech Szpankowski
2014	J	`jnl`	On Symmetry of Uniform and Preferential Attachment Graphs. Electron. J. Comb. Abram Magner, Svante Janson, Giorgios Kollias, Wojciech Szpankowski
2014	J	`jnl`	On the Limiting Distribution of Lempel-Ziv'78 Redundancy for Memoryless Sources. IEEE Trans. Inf. Theory Philippe Jacquet, Wojciech Szpankowski
2013	J	`jnl`	A Master Theorem for Discrete Divide and Conquer Recurrences. J. ACM Michael Drmota, Wojciech Szpankowski
2013	J	`jnl`	Average Redundancy of the Shannon Code for Markov Sources. IEEE Trans. Inf. Theory Neri Merhav, Wojciech Szpankowski
2013	B	`conf`	Average redundancy of the Shannon code for Markov sources. ISIT Neri Merhav, Wojciech Szpankowski
2013	B	`conf`	Capacity of a Structural Binary Symmetric Channel. ISIT Lan V. Truong, Wojciech Szpankowski
2013	B	`conf`	Classification of Markov sources through joint string complexity: Theory and experiments. ISIT Philippe Jacquet, Dimitris Milioris, Wojciech Szpankowski
2013	—	`ed.`	Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013, New Orleans, Louisiana, USA, January 6, 2013 ANALCO Markus E. Nebel, Wojciech Szpankowski
2013	A*	`conf`	Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model. SODA Ralph Neininger, Kevin Leckey, Wojciech Szpankowski
2012	J	`jnl`	Average redundancy of the Shannon code for Markov sources CoRR Neri Merhav, Wojciech Szpankowski
2012	J	`jnl`	Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments. IEEE Trans. Inf. Theory Yongwook Choi, Wojciech Szpankowski
2012	J	`jnl`	Counting Markov Types, Balanced Matrices, and Eulerian Graphs. IEEE Trans. Inf. Theory Philippe Jacquet, Charles Knessl, Wojciech Szpankowski
2012	J	`jnl`	Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood. IEEE Trans. Inf. Theory Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger
2012	J	`jnl`	Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets. IEEE Trans. Inf. Theory Wojciech Szpankowski, Marcelo J. Weinberger
2012	B	`conf`	Mutual information for a deletion channel. ISIT Michael Drmota, Wojciech Szpankowski, Krishnamurthy Viswanathan
2012	J	`jnl`	On a Recurrence Arising in Graph Compression. Electron. J. Comb. Yongwook Choi, Charles Knessl, Wojciech Szpankowski
2012	J	`jnl`	Philippe Flajolet, the Father of Analytic Combinatorics. Algorithmica Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée
2012	J	`jnl`	Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model CoRR Kevin Leckey, Ralph Neininger, Wojciech Szpankowski
2012	B	`conf`	Two-phase cardinality estimation protocols for sensor networks with provable precision. WCNC Jacek Cichon, Jakub Lemiesz, Wojciech Szpankowski, Marcin Zawada
2011	A*	`conf`	A Master Theorem for Discrete Divide and Conquer Recurrences. SODA Michael Drmota, Wojciech Szpankowski
2011	B	`conf`	Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences. ISIT Michael Drmota, Wojciech Szpankowski
2011	J	`jnl`	Constrained pattern matching. ACM Trans. Algorithms Yongwook Choi, Wojciech Szpankowski
2011	J	`jnl`	Deinterleaving Finite Memory Processes via Penalized Maximum Likelihood CoRR Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger
2011	B	`conf`	Deinterleaving Markov processes: The finite-memory switch case. ISIT Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger
2011	J	`jnl`	In memoriam: Philippe Flajolet, the father of analytic combinatorics. RAIRO Theor. Informatics Appl. Bruno Salvy, Robert Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée
2011	B	`conf`	Limiting distribution of Lempel Ziv'78 redundancy. ISIT Philippe Jacquet, Wojciech Szpankowski
2011	J	`jnl`	Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints. IEEE Trans. Inf. Theory Wojciech Szpankowski, Sergio Verdú
2011	J	`jnl`	Obituary. Philippe Flajolet. J. Symb. Comput. Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée
2011	J	`jnl`	Philippe Flajolet (1948-2011). Bull. EATCS Bruno Salvy, Robert Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée
2011	J	`jnl`	Philippe Flajolet 1 December 1948 - 22 March 2011. Comb. Probab. Comput. Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée
2011	J	`jnl`	Philippe Flajolet, the Father of Analytic Combinatorics. Theor. Comput. Sci. Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée
2011	J	`jnl`	Philippe Flajolet: the father of analytic combinatorics. ACM Commun. Comput. Algebra Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée
2011	J	`jnl`	Philippe flajolet, the father of analytic combinatorics. ACM Trans. Algorithms Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée
2011	J	`jnl`	The expected profile of digital search trees. J. Comb. Theory A Michael Drmota, Wojciech Szpankowski
2010	J	`jnl`	A Universal Online Caching Algorithm Based on Pattern Matching. Algorithmica Gopal Pandurangan, Wojciech Szpankowski
2010	J	`jnl`	Introduction to the special issue on information theory in molecular biology and neuroscience. IEEE Trans. Inf. Theory Olgica Milenkovic, Gil Alterovitz, Gerard Battail, Todd P. Coleman, Joachim Hagenauer, Sean P. Meyn, Nathan D. Price, Marco Ramoni, Ilya Shmulevich, Wojciech Szpankowski
2010	B	`conf`	Minimax redundancy for large alphabets. ISIT Wojciech Szpankowski, Marcelo J. Weinberger
2010	J	`jnl`	Noisy Constrained Capacity for BSC Channels. IEEE Trans. Inf. Theory Philippe Jacquet, Wojciech Szpankowski
2010	J	`jnl`	Tunstall code, Khodak variations, and random walks. IEEE Trans. Inf. Theory Michael Drmota, Yuriy A. Reznik, Wojciech Szpankowski
2009	A*	`conf`	(Un)expected behavior of digital search tree profile. SODA Michael Drmota, Wojciech Szpankowski
2009	B	`conf`	Compression of graphical structures. ISIT Yongwook Choi, Wojciech Szpankowski
2009	B	`conf`	Deinterleaving Markov processes via penalized ML. ISIT Gadiel Seroussi, Marcelo J. Weinberger, Wojciech Szpankowski
2009	B	`conf`	Minimum expected length of fixed-to-variable lossless compression of memoryless sources. ISIT Wojciech Szpankowski, Sergio Verdú
2009	J	`jnl`	Multiple choice tries and distributed hash tables. Random Struct. Algorithms Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski
2009	J	`jnl`	Profiles of Tries. SIAM J. Comput. GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski
2009	B	`conf`	Structural complexity of random binary trees. ISIT John C. Kieffer, En-Hui Yang, Wojciech Szpankowski
2008	J	`jnl`	A One-to-One Code and Its Anti-Redundancy. IEEE Trans. Inf. Theory Wojciech Szpankowski
2008	Misc	`conf`	Annotating Pathways of Interaction Networks. Pacific Symposium on Biocomputing Jayesh Pandey, Mehmet Koyutürk, Wojciech Szpankowski, Ananth Grama
2008	B	`conf`	Large deviations for constrained pattern matching. ISIT Yongwook Choi, Wojciech Szpankowski
2008	J	`jnl`	On the Construction of (Explicit) Khodak's Code and Its Analysis. IEEE Trans. Inf. Theory Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
2008	J	`jnl`	On the entropy of a hidden Markov process. Theor. Comput. Sci. Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski
2008	—	`ed.`	Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2008, San Francisco, California, USA, January 19, 2008 ANALCO Robert Sedgewick, Wojciech Szpankowski
2008	B	`conf`	Profile of Tries. LATIN GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski
2008	B	`conf`	What is information? ITW Jerzy Konorski, Wojciech Szpankowski
2007	J	`jnl`	Assessing Significance of Connectivity and Conservation in Protein Interaction Networks. J. Comput. Biol. Mehmet Koyutürk, Wojciech Szpankowski, Ananth Grama
2007	J	`jnl`	Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments. IEEE Trans. Inf. Theory Stefano Lonardi, Wojciech Szpankowski, Mark Daniel Ward
2007	—	`conf`	Functional annotation of regulatory pathways. ISMB/ECCB (Supplement of Bioinformatics) Jayesh Pandey, Mehmet Koyutürk, Yohan Kim, Wojciech Szpankowski, Shankar Subramaniam, Ananth Grama
2007	J	`jnl`	Identifying Statistical Dependence in Genomic Sequences via Mutual Information Estimates. EURASIP J. Bioinform. Syst. Biol. Hasan Metin Aktulga, Ioannis Kontoyiannis, Leszek Alex Lyznik, Lukasz Szpankowski, Ananth Grama, Wojciech Szpankowski
2007	J	`jnl`	Identifying statistical dependence in genomic sequences via mutual information estimates CoRR Hasan Metin Aktulga, Ioannis Kontoyiannis, Leszek Alex Lyznik, Lukasz Szpankowski, Ananth Grama, Wojciech Szpankowski
2007	A*	`conf`	Multiple choice tries and distributed hash tables. SODA Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski
2007	B	`conf`	Noisy Constrained Capacity. ISIT Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski
2007	J	`jnl`	Partial fillup and search time in LC tries. ACM Trans. Algorithms Svante Janson, Wojciech Szpankowski
2007	B	`conf`	Pattern Matching in Constrained Sequences. ISIT Yongwook Choi, Wojciech Szpankowski
2007	J	`jnl`	Randomized leader election. Distributed Comput. Murali Krishna Ramanathan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama, Wojciech Szpankowski
2007	B	`conf`	Statistical Dependence in Biological Sequences. ISIT Hasan Metin Aktulga, Ioannis Kontoyiannis, Leszek Alex Lyznik, Lukasz Szpankowski, Ananth Y. Grama, Wojciech Szpankowski
2007	J	`jnl`	Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence. Discret. Math. Theor. Comput. Sci. Valery T. Stefanov, Wojciech Szpankowski
2006	B	`conf`	Assessing Significance of Connectivity and Conservation in Protein Interaction Networks. RECOMB Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski
2006	—	`conf`	Binary Trees, Left and Right Paths, WKB Expansions, and Painleve Transcendents. ANALCO Charles Knessl, Wojciech Szpankowski
2006	J	`jnl`	Detecting Conserved Interaction Patterns in Biological Networks. J. Comput. Biol. Mehmet Koyutürk, Yohan Kim, Shankar Subramaniam, Wojciech Szpankowski, Ananth Grama
2006	B	`conf`	Error-Resilient LZW Data Compression. DCC Yonghui Wu, Stefano Lonardi, Wojciech Szpankowski
2006	J	`jnl`	Finding biclusters by random projections. Theor. Comput. Sci. Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang
2006	J	`jnl`	Hidden word statistics. J. ACM Philippe Flajolet, Wojciech Szpankowski, Brigitte Vallée
2006	J	`jnl`	Multicast tree structure and the power law. IEEE Trans. Inf. Theory Cédric Adjih, Leonidas Georgiadis, Philippe Jacquet, Wojciech Szpankowski
2006	B	`conf`	On (d, k) Sequences Not Containing a Given Word. ISIT Philippe Jacquet, Wojciech Szpankowski
2006	J	`jnl`	Pairwise Alignment of Protein Interaction Networks. J. Comput. Biol. Mehmet Koyutürk, Yohan Kim, Umut Topkara, Shankar Subramaniam, Wojciech Szpankowski, Ananth Grama
2006	—	`conf`	Partial Fillup and Search Time in LC Tries. ANALCO Svante Janson, Wojciech Szpankowski
2006	B	`conf`	Precise Asymptotic Analysis of the Tunstall Code. ISIT Michael Drmota, Yuriy A. Reznik, Serap A. Savari, Wojciech Szpankowski
2006	J	`jnl`	Preface. Algorithmica Philippe Jacquet, Daniel Panario, Wojciech Szpankowski
2005	B	`conf`	A universal online caching algorithm based on pattern matching. ISIT Gopal Pandurangan, Wojciech Szpankowski
2005	J	`jnl`	An optimal DNA segmentation based on the MDL principle. Int. J. Bioinform. Res. Appl. Wojciech Szpankowski, Wenhui Ren, Lukasz Szpankowski
2005	B	`conf`	Analytic algorithmics, combinatorics, and information theory. ITW Wojciech Szpankowski
2005	J	`jnl`	Enumeration of Binary Trees and Universal Types. Discret. Math. Theor. Comput. Sci. Charles Knessl, Wojciech Szpankowski
2005	—	`conf`	Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types. ALENEX/ANALCO Charles Knessl, Wojciech Szpankowski
2005	A	`conf`	Markov Models for Identification of Significant Episodes. SDM Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski
2005	B	`conf`	One-to-one code and its anti-redundancy. ISIT Wojciech Szpankowski
2005	B	`conf`	Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution. RECOMB Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski
2005	J	`jnl`	Partial fillup and search time in LC tries CoRR Svante Janson, Wojciech Szpankowski
2005	J	`jnl`	Probabilistic behavior of asymmetric level compressed tries. Random Struct. Algorithms Luc Devroye, Wojciech Szpankowski
2005	J	`jnl`	Reliable detection of episodes in event sequences. Knowl. Inf. Syst. Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski
2005	A*	`conf`	Towards a complete characterization of tries. SODA GaHyun Park, Wojciech Szpankowski
2004	—	`conf`	An efficient algorithm for detecting frequent subgraphs in biological networks. ISMB/ECCB (Supplement of Bioinformatics) Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski
2004	—	`conf`	Analysis of Randomized Selection Algorithm Motivated by the LZ'77 Scheme. ALENEX/ANALC Mark Daniel Ward, Wojciech Szpankowski
2004	—	`conf`	Biclustering Gene-Feature Matrices for Statistically Significant Dense Patterns. CSB Mehmet Koyutürk, Wojciech Szpankowski, Ananth Grama
2004	A*	`conf`	Detection of Significant Sets of Episodes in Event Sequences. ICDM Mikhail J. Atallah, Robert Gwadera, Wojciech Szpankowski
2004	B	`conf`	Error resilient LZ'77 scheme and its analysis. ISIT Stefano Lonardi, Wojciech Szpankowski, Mark Daniel Ward
2004	B	`conf`	Finding Biclusters by Random Projections. CPM Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang
2004	J	`jnl`	Markov types and minimax redundancy for Markov sources. IEEE Trans. Inf. Theory Philippe Jacquet, Wojciech Szpankowski
2004	J	`jnl`	On average sequence complexity. Theor. Comput. Sci. Svante Janson, Stefano Lonardi, Wojciech Szpankowski
2004	B	`conf`	On the Average Sequence Complexity. CPM Svante Janson, Stefano Lonardi, Wojciech Szpankowski
2004	B	`conf`	On the Average Sequence Complexity. Data Compression Conference Svante Janson, Stefano Lonardi, Wojciech Szpankowski
2004	B	`conf`	On the Entropy of a Hidden Markov Process. Data Compression Conference Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski
2004	B	`conf`	On the entropy of a Hidden Markov process. ISIT Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski
2004	J	`jnl`	On the number of full levels in tries. Random Struct. Algorithms Charles Knessl, Wojciech Szpankowski
2004	J	`jnl`	Precise minimax redundancy and regret. IEEE Trans. Inf. Theory Michael Drmota, Wojciech Szpankowski
2004	J	`jnl`	Problems on Sequences: Information Theory and Computer Science Interface. IEEE Trans. Inf. Theory John C. Kieffer, Wojciech Szpankowski, En-Hui Yang
2004	J	`jnl`	Special Issue on Analysis of Algorithms. Comb. Probab. Comput. Michael Drmota, Wojciech Szpankowski
2004	B	`conf`	Variable-to-variable codes with small redundancy rates. ISIT Michael Drmota, Wojciech Szpankowski
2003	—	`conf`	Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments. CSB Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski
2003	—	`conf`	An Optimal DNA Segmentation Based on the MDL Principle. CSB Wojciech Szpankowski, Wenhui Ren, Lukasz Szpankowski
2003	J	`jnl`	Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk"). Bull. EATCS Michael Drmota, Wojciech Szpankowski
2003	B	`conf`	Joint Source-Channel LZ'77 Coding. DCC Stefano Lonardi, Wojciech Szpankowski
2003	A*	`conf`	Reliable Detection of Episodes in Event Sequences. ICDM Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski
2002	J	`jnl`	2D-pattern matching image and video compression: theory, algorithms, and experiments. IEEE Trans. Image Process. Marc Alzina, Wojciech Szpankowski, Ananth Grama
2002	J	`jnl`	A universal predictor based on pattern matching. IEEE Trans. Inf. Theory Philippe Jacquet, Wojciech Szpankowski, Izydor Apostol
2002	J	`jnl`	Analytic variations on redundancy rates of renewal processes. IEEE Trans. Inf. Theory Philippe Flajolet, Wojciech Szpankowski
2002	B	`conf`	Generalized Shannon Code Minimizes the Maximal Redundancy. LATIN Michael Drmota, Wojciech Szpankowski
2002	B	`conf`	Improved Behaviour of Tries by the "Symmetrization" of the Source. DCC Yuriy A. Reznik, Wojciech Szpankowski
2002	A*	`conf`	Is the internet fractal? SODA Cédric Adjih, Leonidas Georgiadis, Philippe Jacquet, Wojciech Szpankowski
2002	J	`jnl`	Limit laws for the height in PATRICIA tries. J. Algorithms Charles Knessl, Wojciech Szpankowski
2002	J	`jnl`	Optimal versus randomized search of fixed length binary words. IEEE Trans. Inf. Theory Helmut Prodinger, Wojciech Szpankowski
2002	B	`conf`	Precise Average Redundancy Of An Idealized Arithmetic Codin. DCC Michael Drmota, Hsien-Kuei Hwang, Wojciech Szpankowski
2002	B	`conf`	Semi-discrete Matrix Transforms (SDD) for Image and Video Compression. DCC Sacha Zyto, Ananth Grama, Wojciech Szpankowski
2002	J	`jnl`	The height of a binary search tree: the limiting distribution perspective. Theor. Comput. Sci. Charles Knessl, Wojciech Szpankowski
2001	J	`jnl`	Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source. Algorithmica Philippe Jacquet, Wojciech Szpankowski, Jing Tang
2001	J	`jnl`	Average-Case Analysis of Algorithms - Preface. Algorithmica Helmut Prodinger, Wojciech Szpankowski
2001	A*	`conf`	Hidden Pattern Statistics. ICALP Philippe Flajolet, Yves Guivarc'h, Wojciech Szpankowski, Brigitte Vallée
2001	J	`jnl`	On the average redundancy rate of the Lempel-Ziv code with the k-error protocol. Inf. Sci. Yuriy A. Reznik, Wojciech Szpankowski
2001	B	`conf`	Real-Time Decompression of Streaming Video Using Mobile Code. Data Compression Conference Ananth Grama, David Meyer, Wojciech Szpankowski
2000	J	`jnl`	A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large. Electron. J. Comb. Charles Knessl, Wojciech Szpankowski
2000	J	`jnl`	Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme. SIAM J. Comput. Charles Knessl, Wojciech Szpankowski
2000	J	`jnl`	Asymptotic average redundancy of Huffman (and other) block codes. IEEE Trans. Inf. Theory Wojciech Szpankowski
2000	A*	`conf`	Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme. SODA Charles Knessl, Wojciech Szpankowski
2000	B	`conf`	Heights in Generalized Tries and PATRICIA Tries. LATIN Charles Knessl, Wojciech Szpankowski
2000	B	`conf`	On the Average Redundancy Rate of the Lempel-Ziv Code with K-Error Protocol. Data Compression Conference Yuriy A. Reznik, Wojciech Szpankowski
2000	B	`conf`	Summary Structures for Frequency Queries on Large Transaction Sets. Data Compression Conference Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciech Szpankowski
1999	B	`conf`	2D-Pattern Matching Image and Video Compression. Data Compression Conference Marc Alzina, Wojciech Szpankowski, Ananth Grama
1999	—	`ch.`	Average Case Analysis of Algorithms. Algorithms and Theory of Computation Handbook Wojciech Szpankowski
1999	J	`jnl`	Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm. SIAM J. Comput. Guy Louchard, Wojciech Szpankowski, Jing Tang
1999	J	`jnl`	Entropy Computations via Analytic Depoissonization. IEEE Trans. Inf. Theory Philippe Jacquet, Wojciech Szpankowski
1999	J	`jnl`	Indexing and mapping of proteins using a modified nonlinear Sammon projection. J. Comput. Chem. Izydor Apostol, Wojciech Szpankowski
1999	J	`jnl`	Pattern Matching Image Compression: Algorithmic and Empirical Results. IEEE Trans. Pattern Anal. Mach. Intell. Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski
1999	J	`jnl`	Quicksort Algorithm Again Revisited. Discret. Math. Theor. Comput. Sci. Charles Knessl, Wojciech Szpankowski
1998	J	`jnl`	Analytical Depoissonization and its Applications. Theor. Comput. Sci. Philippe Jacquet, Wojciech Szpankowski
1998	—	`conf`	Complexity of Sequential Pattern Matching Algorithms. RANDOM Mireille Régnier, Wojciech Szpankowski
1998	J	`jnl`	Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal. Algorithmica Alan M. Frieze, Wojciech Szpankowski
1998	J	`jnl`	On Pattern Frequency Occurrences in a Markovian Sequence. Algorithmica Mireille Régnier, Wojciech Szpankowski
1998	J	`jnl`	Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics. Algorithmica Helmut Prodinger, Wojciech Szpankowski
1998	—	`conf`	Quicksort Again Revisited. RANDOM Charles Knessl, Wojciech Szpankowski
1997	J	`jnl`	A suboptimal lossy data compression based on approximate pattern matching. IEEE Trans. Inf. Theory Tomasz Luczak, Wojciech Szpankowski
1997	J	`jnl`	Analysis of algorithms. Random Struct. Algorithms Philippe Flajolet, Wojciech Szpankowski
1997	J	`jnl`	Analysis of an Asymmetric Leader Election Algorithm. Electron. J. Comb. Svante Janson, Wojciech Szpankowski
1997	J	`jnl`	Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching'. IEEE Trans. Inf. Theory Tomasz Luczak, Wojciech Szpankowski
1997	—	`conf`	On the approximate pattern occurrences in a text. SEQUENCES Mireille Régnier, Wojciech Szpankowski
1997	J	`jnl`	On the average redundancy rate of the Lempel-Ziv code. IEEE Trans. Inf. Theory Guy Louchard, Wojciech Szpankowski
1997	J	`jnl`	Stability analysis of quota allocation access protocols in ring networks with spatial reuse. IEEE Trans. Inf. Theory Leonidas Georgiadis, Wojciech Szpankowski, Leandros Tassiulas
1996	—	`conf`	A pattern matching approach to image compression. ICIP (2) Mikhail J. Atallah, Wojciech Szpankowski, Yann Génin
1996	J	`jnl`	Analysis of a splitting process arising in probabilistic counting and other related algorithms. Random Struct. Algorithms Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1996	A	`conf`	Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal. ESA Alan M. Frieze, Wojciech Szpankowski
1996	J	`jnl`	On Pattern Occurrences in a Random Text. Inf. Process. Lett. Ioannis Fudos, Evaggelia Pitoura, Wojciech Szpankowski
1996	B	`conf`	On the Average Redundancy Rate of the Lempel-Ziv Code. Data Compression Conference Guy Louchard, Wojciech Szpankowski
1996	B	`conf`	Pattern Matching Image Compression. Data Compression Conference Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski
1995	J	`jnl`	A probabilistic Analysis of a String Editing Problem and its Variations. Comb. Probab. Comput. Guy Louchard, Wojciech Szpankowski
1995	J	`jnl`	A scheduling policy with maximal stability region for ring networks with spatial reuse. Queueing Syst. Theory Appl. Leonidas Georgiadis, Wojciech Szpankowski, Leandros Tassiulas
1995	J	`jnl`	Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees. Theor. Comput. Sci. Philippe Jacquet, Wojciech Szpankowski
1995	J	`jnl`	Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm. IEEE Trans. Inf. Theory Guy Louchard, Wojciech Szpankowski
1995	B	`conf`	Generalized Lempel-Ziv Parsing Scheme and its Preliminary Analysis of the Average Profile. Data Compression Conference Guy Louchard, Wojciech Szpankowski
1995	J	`jnl`	On asymptotics of certain sums arising in coding theory. IEEE Trans. Inf. Theory Wojciech Szpankowski
1994	B	`conf`	A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms. CPM Tomasz Luczak, Wojciech Szpankowski
1994	A*	`conf`	A functional equation often arising in the analysis of algorithms (extended abstract). STOC Philippe Jacquet, Wojciech Szpankowski
1994	J	`jnl`	Autocorrelation on Words and Its Applications - Analysis of Suffix Trees by String-Ruler Approach. J. Comb. Theory A Philippe Jacquet, Wojciech Szpankowski
1994	J	`jnl`	Digital Search Trees Again Revisited: The Internal Path Length Perspective. SIAM J. Comput. Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1993	J	`jnl`	A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors. SIAM J. Comput. Wojciech Szpankowski
1993	J	`jnl`	A Note on Binomial Recurrences Arising in the Analysis of Algorithms. Inf. Process. Lett. Helmut Prodinger, Wojciech Szpankowski
1993	J	`jnl`	A Probabilistic Analysis of a Pattern Matching Problem. Random Struct. Algorithms Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski
1993	B	`conf`	Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract). CPM Guy Louchard, Wojciech Szpankowski
1993	J	`jnl`	Asymptotic properties of data compression and suffix trees. IEEE Trans. Inf. Theory Wojciech Szpankowski
1993	J	`jnl`	Limiting Distribution for the Depth in Patricia Tries. SIAM J. Discret. Math. Bonita Rais, Philippe Jacquet, Wojciech Szpankowski
1993	J	`jnl`	Multidimensional Digital Searching and Some New Parameters in Tries. Int. J. Found. Comput. Sci. Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1992	A*	`conf`	(Un)expected Behavior of Typical Suffix Trees. SODA Wojciech Szpankowski
1992	J	`jnl`	A Note on the Height of Suffix Trees. SIAM J. Comput. Luc Devroye, Wojciech Szpankowski, Bonita Rais
1992	A*	`conf`	How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems. ICALP Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1992	J	`jnl`	Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited. SIAM J. Comput. David J. Aldous, Micha Hofri, Wojciech Szpankowski
1992	B	`conf`	Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract). CPM Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski
1992	B	`conf`	Probabilistic Analysis of Generalized Suffix Trees (Extended Abstract). CPM Wojciech Szpankowski
1992	J	`jnl`	Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter. Theor. Comput. Sci. Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1992	J	`jnl`	Self-Alignments in Words and Their Applications. J. Algorithms Alberto Apostolico, Wojciech Szpankowski
1992	J	`jnl`	Stability of token passing rings. Queueing Syst. Theory Appl. Leonidas Georgiadis, Wojciech Szpankowski
1991	J	`jnl`	A Characterization of Digital Search Trees from the Successful Search Viewpoint. Theor. Comput. Sci. Wojciech Szpankowski
1991	B	`conf`	A Typical Behaviour of Some Data Compression Schemes. Data Compression Conference Wojciech Szpankowski
1991	J	`jnl`	Analysis of digital tries with Markovian dependency. IEEE Trans. Inf. Theory Philippe Jacquet, Wojciech Szpankowski
1991	—	`conf`	Combinatorial Optimization Through Order Statistics. ISA Wojciech Szpankowski
1991	J	`jnl`	On the Height of Digital Trees and Related Problems. Algorithmica Wojciech Szpankowski
1991	B	`conf`	What Can We Learn about Suffix Trees from Independent Tries? WADS Philippe Jacquet, Wojciech Szpankowski
1990	Misc	`conf`	On the Analysis of the Tail Queue Length and Waiting Time Distributions of a GI/G/c Queue. Performance John S. Sadowsky, Wojciech Szpankowski
1990	J	`jnl`	Patricia Tries Again Revisited J. ACM Wojciech Szpankowski
1990	J	`jnl`	Yet another application of a binomial recurrence order statistics. Computing Wojciech Szpankowski, Vernon Rego
1989	B	`conf`	Digital Data Structures and Order Statistics. WADS Wojciech Szpankowski
1989	—	`conf`	Digital Search Trees - Further Results on a Fundamental Data Structure. IFIP Congress Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1989	J	`jnl`	On the Balance Property of Patricia Tries: External Path Length Viewpoint. Theor. Comput. Sci. Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1989	J	`jnl`	On the variance of the external path length in a symmetric digital trie. Discret. Appl. Math. Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1989	J	`jnl`	Some remarks on uniformly bounded markov chains: multimodality analysis. Comput. Oper. Res. Wojciech Szpankowski
1989	J	`jnl`	The presence of exponentiality in entropy maximized M/GI/1 queues. Comput. Oper. Res. Vernon Rego, Wojciech Szpankowski
1989	J	`jnl`	Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation. SIAM J. Comput. Philippe Jacquet, Wojciech Szpankowski
1988	J	`jnl`	Closed-network duals of multiqueues with application to token-passing systems. Comput. Syst. Sci. Eng. Vernon Rego, Wojciech Szpankowski
1988	A*	`conf`	Do We Really Need to Balance Patricia Trees? (Extended Abstract). ICALP Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1988	—	`conf`	On an Alternative Sum Useful in the Analysis of Some Data Structures. SWAT Wojciech Szpankowski
1988	J	`jnl`	Some Results on V-ary Asymmetric Tries. J. Algorithms Wojciech Szpankowski
1988	J	`jnl`	Some Theorems on Instability with Applications to Multiaccess Protocols. Oper. Res. Wojciech Szpankowski, Vernon Rego
1988	J	`jnl`	Stability Conditions for Multidimensional Queueing Systems with Computer Applications. Oper. Res. Wojciech Szpankowski
1988	J	`jnl`	The Evaluation of an Alternative Sum With Applications to the Analysis of Some Data Structures. Inf. Process. Lett. Wojciech Szpankowski
1987	J	`jnl`	An Analysis of a Contention Resolution Algorithm: Another Approach. Acta Informatica Wojciech Szpankowski
1987	—	`conf`	Average Complexity of Additive Properties for Multiway Tries: A Unified Approach (Extended Abstract). TAPSOFT, Vol.1 Wojciech Szpankowski
1987	—	`conf`	Modeling of an availability driven computer network architecture. Simulation of Computer Networks Dan C. Marinescu, Vernon Rego, Wojciech Szpankowski
1987	Misc	`conf`	Two Problems on the Average Complexity of Digital Trees. Performance Wojciech Szpankowski
1986	J	`jnl`	Bounds for Queue Lengths in a Contention Packet Broadcast System. IEEE Trans. Commun. Wojciech Szpankowski
1986	J	`jnl`	On an Asymptotic Analysis of a Tree-Type Algorithm for Broadcast Communications. Inf. Process. Lett. Wojciech Szpankowski
1983	J	`jnl`	Analysis and Stability Considerations in a Reservation Multiaccess System. IEEE Trans. Commun. Wojciech Szpankowski
1983	J	`jnl`	Packet Switching in Multiple Radio Channels: Analysis and Stability of a Random Access System. Comput. Networks Wojciech Szpankowski
1983	Misc	`conf`	Performance Evaluation of a Reservation Protocol for Multiaccess Systems. Performance Wojciech Szpankowski