# Wojciech Szpankowski

#37,838

Most Influential Person Now

Polish computer scientist

## Wojciech Szpankowski's AcademicInfluence.com Rankings

Wojciech Szpankowskicomputer-science Degrees

Computer Science

#2049

World Rank

#2128

Historical Rank

Database

#2878

World Rank

#3003

Historical Rank

## Download Badge

Computer Science

## Wojciech Szpankowski's Degrees

- PhD Computer Science University of Warsaw

## Similar Degrees You Can Earn

## Why Is Wojciech Szpankowski Influential?

(Suggest an Edit or Addition)According to Wikipedia, Wojciech Szpankowski is the Saul Rosen Professor of Computer Science at Purdue University. He is known for his work in analytic combinatorics, analysis of algorithms and analytic information theory. He is the director of the NSF Science and Technology Center for Science of Information.

## Wojciech Szpankowski's Published Works

### Published Works

- Average Case Analysis of Algorithms on Sequences (2001) (536)
- Pairwise Alignment of Protein Interaction Networks (2006) (283)
- Stability conditions for some distributed systems: buffered random access systems (1994) (227)
- An efficient algorithm for detecting frequent subgraphs in biological networks (2004) (219)
- Average Case Analysis of Algorithms on Sequences: Szpankowski/Average (2001) (200)
- Analytical Depoissonization and its Applications (1998) (168)
- Reliable detection of episodes in event sequences (2003) (128)
- Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees (1995) (126)
- On the entropy of a hidden Markov process (2004) (119)
- A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors (1993) (118)
- On Pattern Frequency Occurrences in a Markovian Sequence (1997) (116)
- A suboptimal lossy data compression based on approximate pattern matching (1997) (115)
- Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments (2012) (101)
- Autocorrelation on Words and Its Applications - Analysis of Suffix Trees by String-Ruler Approach (1994) (100)
- Detecting Conserved Interaction Patterns in Biological Networks (2006) (99)
- Precise minimax redundancy and regret (2004) (97)
- Analysis of digital tries with Markovian dependency (1991) (91)
- Patricia tries again revisited (1990) (89)
- Asymptotic properties of data compression and suffix trees (1993) (89)
- Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution (2005) (89)
- Entropy Computations via Analytic Depoissonization (1999) (88)
- Analysis of algorithms (2000) (83)
- On the distribution for the duration of a randomized leader election algorithm (1996) (82)
- Assessing Significance of Connectivity and Conservation in Protein Interaction Networks (2006) (79)
- Some Results on V-ary Asymmetric Tries (1988) (78)
- Detection of significant sets of episodes in event sequences (2004) (76)
- A universal predictor based on pattern matching (2002) (76)
- Stability of token passing rings (1992) (75)
- Average redundancy rate of the Lempel-Ziv code (1996) (74)
- Stabilty Conditions for Some Multiqueue Distributed Systems: Buffered Random Access Systems (1992) (72)
- Analysis of an Asymmetric Leader Election Algorithm (1997) (67)
- ON ASYMPTOTICS OF CERTAIN RECURRENCES ARISING IN UNIVERSAL CODING (1998) (66)
- A Note on the Height of Suffix Trees (1992) (66)
- Self-Alignments in Words and Their Applications (1992) (65)
- Markov Models for Identification of Significant Episodes (2005) (65)
- Markov types and minimax redundancy for Markov sources (2004) (65)
- Stability Conditions for Multidimensional Queueing Systems with Computer Applications (1988) (64)
- Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm (1995) (63)
- Packet Switching in Multiple Radio Channels: Analysis and Stability of a Random Access System (1983) (61)
- Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints (2011) (61)
- Asymptotic average redundancy of Huffman (and other) block codes (2000) (60)
- On the variance of the external path length in a symmetric digital trie (1989) (59)
- Limiting Distribution for the Depth in Patricia Tries (1993) (53)
- Yet another application of a binomial recurrence order statistics (1990) (52)
- Quicksort Algorithm Again Revisited (1999) (51)
- Profiles of Tries (2008) (51)
- Pattern Matching Image Compression: Algorithmic and Empirical Results (1999) (50)
- Digital Search Trees Again Revisited: The Internal Path Length Perspective (1994) (48)
- Finding biclusters by random projections (2004) (45)
- Biclustering gene-feature matrices for statistically significant dense patterns (2004) (45)
- Hidden word statistics (2006) (45)
- The Evaluation of an Alternative Sum With Applications to the Analysis of Some Data Structures (1988) (43)
- On the average sequence complexity (2004) (43)
- Analysis and Stability Considerations in a Reservation Multiaccess System (1983) (41)
- Yet Another Application of a Binomial Recurrence (1988) (41)
- Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source (2001) (41)
- On the approximate pattern occurrences in a text (1997) (41)
- On the height of digital trees and related problems (1991) (41)
- On the average redundancy rate of the Lempel-Ziv code with k-error protocol (2000) (40)
- On the Balance Property of Patricia Tries: External Path Length Viewpoint (1989) (39)
- Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments (2007) (35)
- Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets (2012) (34)
- A Characterization of Digital Search Trees from the Successful Search Viewpoint (1991) (34)
- Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal (1996) (34)
- Profile of Tries (2008) (33)
- Analysis of a splitting process arising in probabilistic counting and other related algorithms (1996) (33)
- Joint source-channel LZ'77 coding (2003) (32)
- 2D-pattern matching image and video compression: theory, algorithms, and experiments (2002) (31)
- Structural complexity of random binary trees (2009) (31)
- Analytic variations on redundancy rates of renewal processes (2002) (30)
- A master theorem for discrete divide and conquer recurrences (2011) (30)
- Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme (2000) (29)
- A One-to-One Code and Its Anti-Redundancy (2008) (28)
- The probability of large queue lengths and waiting times in a heterogeneous multiserver queue I: Tight limits (1995) (28)
- Bounds for Queue Lengths in a Contention Packet Broadcast System (1986) (27)
- Functional annotation of regulatory pathways (2007) (27)
- Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm (1999) (27)
- Combinatorial optimization problems for which almost every algorithm is asymptotically optimal (1995) (27)
- Exploring the characteristics of sequence elements in proximal promoters of human genes. (2004) (26)
- Tunstall Code, Khodak Variations, and Random Walks (2010) (26)
- Multidimensional Digital Searching and Some New Parameters in Tries (1993) (26)
- Introduction to the special issue on information theory in molecular biology and neuroscience (2010) (25)
- Two-phase cardinality estimation protocols for sensor networks with provable precision (2012) (24)
- The expected profile of digital search trees (2011) (24)
- On Symmetry of Uniform and Preferential Attachment Graphs (2014) (24)
- Analytic Pattern Matching - From DNA to Twitter (2015) (24)
- Asymmetry and structural information in preferential attachment graphs (2016) (24)
- On Pattern Occurrences in a Random Text (1996) (23)
- An optimal DNA segmentation based on the MDL principle (2003) (23)
- Randomized leader election (2007) (23)
- Error-resilient LZW data compression (2006) (23)
- Compression of graphical structures (2009) (22)
- Multicast tree structure and the power law (2006) (22)
- Solution of a linear recurrence equation arising in the analysis of some algorithms (1987) (22)
- 2D-pattern matching image and video compression (1999) (21)
- On a Recurrence Equation Arising in the Analysis of Conflict Resolution Algorithms (1987) (21)
- Precise Asymptotic Analysis of the Tunstall Code (2006) (21)
- On asymptotics of certain sums arising in coding theory (1995) (21)
- Identifying Statistical Dependence in Genomic Sequences via Mutual Information Estimates (2007) (21)
- Minimax redundancy for large alphabets (2010) (20)
- Hidden Pattern Statistics (2001) (18)
- Ergodicity aspects of multidimensional Markov chains with application to computer communication system analysis (1984) (17)
- Precise average redundancy of an idealized arithmetic coding (2002) (17)
- Towards computable stability criteria for some multidimensional stochastic processes (1989) (17)
- Probabilistic Analysis of Generalized Suffix Trees (Extended Abstract) (1992) (17)
- Generalized Shannon Code Minimizes the Maximal Redundancy (2002) (17)
- A pattern matching approach to image compression (1996) (16)
- On the Origin of Protein Superfamilies and Superfolds (2015) (16)
- Is the Internet Fractal? The Multicast Power Law Revisited (2001) (16)
- Analytic Approach to Pattern Matching (2005) (15)
- Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation (1989) (15)
- Maximum Queue Length and Waiting Time Revisited: Multserver G/G/c Queue (1992) (15)
- A scheduling policy with maximal stability region for ring networks with spatial reuse (1995) (15)
- Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model (2012) (14)
- How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems (1992) (14)
- Some Theorems on Instability with Applications to Multiaccess Protocols (1988) (14)
- Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence (2007) (14)
- Inferring Temporal Information from a Snapshot of a Dynamic Network (2019) (14)
- Lossless compression of binary trees with correlated vertex names (2016) (14)
- A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large (2000) (13)
- Average Case Analysis of Algorithms (2010) (13)
- Mutual information for a deletion channel (2012) (13)
- Noisy Constrained Capacity (2007) (13)
- Stability analysis of quota allocation access protocols in ring networks with spatial reuse (1995) (13)
- Complexity of Sequential Pattern Matching Algorithms (1998) (13)
- Limit Laws for Heights in Generalized Tries and PATRICIA Tries (1999) (12)
- Fundamental Bounds for Sequence Reconstruction From Nanopore Sequencers (2016) (12)
- Limit laws for the height in PATRICIA tries (2002) (12)
- Indexing and mapping of proteins using a modified nonlinear Sammon projection (1999) (12)
- (Un)expected behavior of typical suffix trees (1992) (12)
- A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms (1994) (12)
- On (d, k) Sequences Not Containing a Given Word (2006) (12)
- Classification of Markov sources through joint string complexity: Theory and experiments (2013) (12)
- Ultimate Stability Conditions for Some Multidimensional Distributed Systems (1987) (12)
- Counting Markov Types, Balanced Matrices, and Eulerian Graphs (2012) (12)
- Heights in Generalized Tries and PATRICIA Tries (2000) (11)
- Semi-discrete matrix transforms (SDD) for image and video compression (2002) (11)
- Recovery of vertex orderings in dynamic graphs (2017) (11)
- Some sufficient conditions for non-ergodicity of markov chains (1985) (11)
- Summary structures for frequency queries on large transaction sets (2000) (11)
- Discovering sequences with potential regulatory characteristics. (2009) (11)
- The precise minimax redundancy (2002) (11)
- Pattern Matching in Constrained Sequences (2007) (10)
- Analysis of biclusters with applications to gene expression data (2005) (10)
- Analysis of Randomized Selection Algorithm Motivated by the LZ'77 Scheme (2004) (10)
- Joint String Complexity for Markov Sources (2012) (10)
- An Universal Predictor Based on Pattern Matching: Preliminary results 1 (2000) (10)
- On the Average Profile of Symmetric Digital Search Trees (2008) (10)
- Digital Data Structures and Order Statistics (1989) (10)
- Expected External Profile of PATRICIA Tries (2014) (10)
- Analytic Pattern Matching by Philippe Jacquet (2015) (10)
- Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited (1992) (10)
- On the number of full levels in tries (2004) (10)
- Limiting distribution of Lempel Ziv'78 redundancy (2011) (10)
- On the analysis of variable-to-variable length codes (2002) (9)
- (Un)expected behavior of digital search tree profile (2009) (9)
- On the Construction of (Explicit) Khodak's Code and Its Analysis (2008) (9)
- A lossy data compression based on an approximate pattern matching (1995) (9)
- Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract) (1992) (9)
- The presence of exponentiality in entropy maximized M/GI/1 queues (1989) (9)
- Error resilient LZ'77 scheme and its analysis (2004) (9)
- Compression of Dynamic Graphs Generated by a Duplication Model (2018) (9)
- Randomized Linear Algebra Approaches to Estimate the Von Neumann Entropy of Density Matrices (2018) (9)
- On the Analysis of the Average Height of a Digital Trie: Another Approach (1986) (9)
- Structural Information and Compression of Scale-Free Graphs (2017) (8)
- Profiles of PATRICIA Tries (2016) (8)
- Analysis of the multiplicity matching parameter in suffix trees (2005) (8)
- Special Issue on Analysis of Algorithms (2004) (8)
- The Probability of Large Queue Lengths and Waiting Times in a Heterogeneous Multiserver Queue Part I (1995) (8)
- Preserving Privacy and Fidelity via Ehrhart Theory (2018) (8)
- On The Collapse of the q-Gram Filtration (1998) (8)
- A probabilistic approach to pattern matching with mismatches (1990) (8)
- One-to-one code and its anti-redundancy (2005) (8)
- Is the internet fractal? (2002) (8)
- What Can We Learn about Suffix Trees from Independent Tries? (1991) (8)
- Redundancy of Lossless Data Compression for Known Sources by Analytic Methods (2017) (7)
- Uncertainty Estimates of Purity Measurements Based on Current Information: Toward a “Live Validation” of Purity Methods (2012) (7)
- Pattern Matching Image Compression with Predication Loop: Preliminary Experimental Results (1996) (7)
- Data-driven weak universal redundancy (2014) (7)
- Pattern matching image compression (1996) (7)
- Revisiting Parameter Estimation in Biological Networks: Influence of Symmetries (2019) (7)
- Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding (2008) (7)
- Probabilistic behavior of asymmetric level compressed tries (2005) (7)
- Problems on Sequences: Information Theory and Computer Science Interface (2004) (7)
- Availability Driven Multiple Access Network Architecture (1986) (7)
- Generalized Lempel-Ziv parsing scheme and its preliminary analysis of the average profile (1995) (7)
- A Theoretical Framework for Learning from Quantum Data (2021) (7)
- Precise Minimax Regret for Logistic Regression with Categorical Feature Values (2021) (7)
- Free Energy Rates for a Class of Very Noisy Optimization Problems (2014) (7)
- Fundamental Bounds and Approaches to Sequence Reconstruction from Nanopore Sequencers (2016) (7)
- Compression of Preferential Attachment Graphs (2019) (7)
- Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types (2005) (6)
- Combinatorial Optimization Through Order Statistics (1991) (6)
- Enumeration of Binary Trees and Universal Types (2005) (6)
- Pattern Matching with Mismatches: A Simple Randomized Algorithm and its Analysis (1992) (6)
- Types of Markov Fields and Tilings (2016) (6)
- Compact Suffix Trees Resemble Patricia Tries: Limiting Distribution of Depth (2004) (6)
- A Note on Binomial Recurrences Arising in the Analysis of Algorithms (1993) (6)
- Inclusion‐Exclusion Principle (2011) (6)
- Average Complexity of Additive Properties for Multiway Tries: A Unified Approach (Extended Abstract) (1987) (6)
- Two Problems on the Average Complexity of Digital Trees (1987) (6)
- A Probabilistic Analysis of a String Editing Problem and its Variations (1995) (6)
- Towards a complete characterization of tries (2005) (6)
- Statistical and computational thresholds for the planted k-densest sub-hypergraph problem (2020) (5)
- On the Exit Time of a Random Walk with Positive Drift (2007) (5)
- A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence (2014) (5)
- On Symmetries of Non-Plane Trees in a Non-Uniform Model (2017) (5)
- Stability Conditions for Multidimensional Queueing Systems and Applications to Analysis of Computer Systems (1986) (5)
- A Probabilistic Analysis of a Pattern Matching Problem (1993) (5)
- A typical behavior of some data compression schemes (1991) (5)
- The Trade-Off Between Privacy and Fidelity via Ehrhart Theory (2018) (5)
- HIgh PERformance COMmunication (2007) (5)
- Entropy of some general plane trees (2017) (5)
- Binary Trees, Left and Right Paths, WKB Expansions, and Painleve Transcendents (2006) (5)
- Entropy computations for discrete distributions: towards analytic information theory (1998) (5)
- Probably) Optimal Solution to Some Problems Not Only on Graphs (1989) (5)
- Noisy Constrained Capacity for BSC Channels (2010) (5)
- Packet switching in multiple radio channels (1983) (5)
- A Combinatorial Problem Arising in Information Theory: Precise Minimax Redundancy for Markov Sources (2002) (5)
- The height of a binary search tree: the limiting distribution perspective (2002) (5)
- A Limit Theorem for Radix Sort and Tries with Markovian Input (2015) (5)
- Partial fillup and search time in LC tries (2005) (4)
- Stability Problems in Local Area Networks: A Qualitative Approach (1985) (4)
- Performance Evaluation of a Reservation Protocol for Multiaccess Systems (1983) (4)
- On a Recurrence Arising in Graph Compression (2012) (4)
- Degree Distribution for Duplication-Divergence Graphs: Large Deviations (2020) (4)
- Posterior agreement for large parameter-rich optimization problems (2018) (4)
- Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood (2011) (4)
- Hidden Words Statistics for Large Patterns (2020) (4)
- Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics (1998) (4)
- Biclustering Gene-Feature Matrices for Statistically Significant Patterns (2004) (4)
- A Probabilistic analysis of a string edit problem (1992) (4)
- Average redundancy of the Shannon code for Markov sources (2012) (4)
- On the Limiting Distribution of Lempel-Ziv’78 Redundancy for Memoryless Sources (2014) (4)
- On the Analysis of the Tail Queue Length and Waiting Time Distributions of a GI/G/c Queue (1990) (4)
- Deinterleaving Markov processes via penalized ML (2009) (4)
- Compression and Symmetry of Small-World Graphs and Structures (2020) (3)
- On an Asymptotic Analysis of a Tree-Type Algorithm for Broadcast Communications (1986) (3)
- Autocorrelation on Words and Its Applications (2018) (3)
- Data dependent weak universal redundancy (2014) (3)
- Techniques of the Average Case Analysis of Algorithms (1996) (3)
- A Last Word on Pattern Frequency Occurences In A Markovian Sequence (1996) (3)
- A General Lower Bound for Regret in Logistic Regression (2021) (3)
- Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning (2021) (3)
- Multiple choice tries and distributed hash tables (2007) (3)
- Analytic algorithmics, combinatorics, and information theory (2005) (3)
- Expected Worst Case Regret via Stochastic Sequential Covering (2022) (3)
- A Greedy Algorithm for the Shortest Common Superstring is Asymptotically Optimal (1995) (3)
- Markov Types Again Revisited (2009) (3)
- Asymmetric Rényi Problem and PATRICIA Tries (2016) (3)
- Wiley‐Interscience Series in Discrete Mathematics and Optimization (2011) (3)
- Asymptotic average redundancy of adaptive block codes (2003) (3)
- Towards Degree Distribution of Duplication Graph Models ∗ (2019) (3)
- Power-Law Degree Distribution in the Connected Component of a Duplication Graph (2020) (3)
- A Universal Online Caching Algorithm Based on Pattern Matching (2010) (3)
- Information Sufficiency via Fourier Expansion (2021) (3)
- Minimum expected length of fixed-to-variable lossless compression of memoryless sources (2009) (3)
- Closed-network duals of multiqueues with application to token-passing systems (1988) (3)
- Finding Relevant Information via a Discrete Fourier Expansion (2021) (3)
- Stability criteria for yet another class of multidimensional distributed systems (1994) (3)
- Analytic Poissonization and Depoissonization (2011) (3)
- On the Joint Path Length Distribution in Random Binary Trees (2006) (3)
- Constrained pattern matching (2011) (3)
- A Study of the Boltzmann Sequence-Structure Channel (2017) (3)
- Some Remarks on Uniformly Bounded Markov Chains: Stability Analysis (1986) (3)
- Stability, bounds and approximation in asymmetric buffered aloha-type systems (1986) (3)
- Suffi x Trees Revisited: (Un)Expected Asymptotic Behaviors (1991) (3)
- Asymptotic average redundancy of Huffman (and Shannon-Fano) block codes (2000) (3)
- Average Size of a Suffix Tree for Markov Sources (2016) (2)
- A functional equation often arising in the analysis of algorithms (extended abstract) (1994) (2)
- Markov Types and Minimax Redundancy for (2004) (2)
- Phase Transitions in a Protein Folding Channel (2014) (2)
- Stability Criteria For Yet Another Multidimensional Distributed System (1991) (2)
- Preferential Attachment Graphs are All But Asymmetric (2016) (2)
- Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm (2022) (2)
- Toward Physically Realizable Quantum Neural Networks (2022) (2)
- Temporal Ordered Clustering in Dynamic Networks (2019) (2)
- Asymptotics of Entropy of the Dirichlet-Multinomial Distribution (2019) (2)
- Randomized Linear Algebra Approaches to Estimate the von Neumann Entropy of Density Matrices (2020) (2)
- Instability Conditions Arising in Analysis of Some Multiaccess Protocols (1986) (2)
- On the Maximum Queue Length with Applications to Data Structures: A Simple But Yet Asymptotically Exact Approach (1988) (2)
- Do We Really Need to Balance Patricia Trees? (Extended Abstract) (1988) (2)
- On an Alternative Sum Useful in the Analysis of Some Data Structures (1988) (2)
- Phase Transitions in Parameter Rich Optimization Problems (2017) (2)
- Average Redundancy of the Shannon Code for Markov Sources (2013) (2)
- On The Bottleneck and Capacity Assignment Problems (1988) (2)
- Pattern Matching Image Compression with Predication Loop (1997) (2)
- Annotating Pathways of Interaction Networks (2007) (2)
- Average-Case Analysis of Algorithms - Preface (2001) (2)
- Lossless Compression of Binary Trees With Correlated Vertex Names (2018) (2)
- Recovery of a Planted k-Densest Sub-Hypergraph (2020) (2)
- Counting Markov Types (2010) (2)
- The Boltzmann sequence-structure channel (2016) (2)
- On the Variance of the External Path Length in a Binary Digital Trie (1987) (2)
- 2 D-Pattern Matching Image and Video (1998) (2)
- An analysis of a contention resolution algorithm (1987) (2)
- What is information? (2008) (2)
- Algorithms for bounded-error correlation of high dimensional data in microarray experiments (2003) (2)
- Improved behaviour of tries by the "symmetrization" of the source (2002) (2)
- Variable-to-variable codes with small redundancy rates (2004) (2)
- Do we really need to balance patricia tries (1988) (2)
- On maximum-likelihood estimation in the all-or-nothing regime (2021) (1)
- On asymptotics of Certain Recurrences Arising in Multi-Alphabet Universal Coding (1996) (1)
- Phase transitions in a sequence-structure channel (2015) (1)
- Statistical Dependence in Biological Sequences (2007) (1)
- On The Appr oximate Patt ern Occurrences in a Text (1996) (1)
- Mellin Transform and Its Applications (2011) (1)
- Towards Degree Distribution of a Duplication-Divergence Graph Model (2021) (1)
- Analysis of an error resilient lempel-ziv algorithm via suffix trees (2005) (1)
- Deinterleaving Markov processes: The finite-memory switch case (2011) (1)
- Asymptotically Optimal Heuristics for Bottleneck and Capacity Optimization Problems (1994) (1)
- A universal pattern matching predictor for mixing sources (2002) (1)
- Asymmetric Rényi Problem (2017) (1)
- Algorithms , Combinatorics , Information , and Beyond Plenary Talk at ISIT (2012) (1)
- Large deviations for constrained pattern matching (2008) (1)
- Detection of Sets of Episodes in Event Sequences : Algorithms , Analysis and Experiments (2004) (1)
- A General Discrete Divide and Conquer Recurrence and Its Applications August 23 , 2010 (2010) (1)
- Frontiers of Science of Information (2015) (1)
- A safe state approach to real-time system scheduling (1989) (1)
- Optimal versus randomized search of fixed length binary words (2002) (1)
- Digital Search Trees - Further Results on a Fundamental Data Structure (1989) (1)
- Asymmetric R\'enyi Problem (2017) (1)
- Subadditive Ergodic Theorem and Large Deviations (2011) (1)
- Entropy and Optimal Compression of Some General Plane Trees (2018) (1)
- FACETS OF INFORMATION IN COMMUNICATIONS (2008) (1)
- Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract) (1993) (1)
- Obituary. Philippe Flajolet (2011) (1)
- Markov field types and tilings (2014) (1)
- Precise minimax redundancy for Markov sources (2003) (1)
- Quicksort Again Revisited (1998) (1)
- Analytic variations on the redundancy rate of renewal processes (2000) (1)
- Philippe Flajolet, the Father of Analytic Combinatorics (2011) (1)
- Sequential Universal Compression for Non-Binary Sequences with Constrained Distributions (2019) (1)
- Free Energy Asymptotics for Problems with Weak Solution Dependencies (2018) (1)
- Temporal Ordered Clustering in Dynamic Networks: Unsupervised and Semi-Supervised Learning Algorithms (2019) (1)
- Some remarks on uniformly bounded markov chains: multimodality analysis (1989) (1)
- On the lempel-ziv parsing algorithm and its digital tree representation (1993) (1)
- Profiles of PATRICIA Tries (2016) (1)
- On Generalized Digital Search Trees with Applications to a Generalized Lempel-ziv Algorithm (1995) (1)
- NON-ERGODICITY OF MARKOV CHAINS (1985) (1)
- Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter (1992) (1)
- An Architecture for a Local Network Providing Multiple Supercomputer Access (1986) (1)
- Online Learning in Dynamically Changing Environments (2023) (1)
- Another Unified Approach to Some Bottleneck and Capacity Optimization Problems (1990) (1)
- Symmetry and the Entropy of Small-World Structures and Graphs (2021) (1)
- Precise Minimax Regret for Logistic Regression (2022) (1)
- Sufficiently Informative and Relevant Features: An Information-Theoretic and Fourier-Based Characterization (2022) (1)
- In memoriam: Philippe Flajolet, the father of analytic combinatorics (2011) (1)
- Capacity of a Structural Binary Symmetric Channel (2013) (0)
- Some Thoughts on Ultimate Stability Condition for G|G|1 Queue (1989) (0)
- Linear Assignment Problem Revisited: Average (1 + 1/e)-out Degree Bipartite Graph has a Perfect Match (1992) (0)
- Efficient Algorithmic Techniques for Combinatorial Problems (1992) (0)
- Stability Criteria For Queueing Networks with a Monotonicity Property (1994) (0)
- Real-Time Decompression of Streaming Video Using Mobile Code (2001) (0)
- Elements of Information Theory (2011) (0)
- Goodness of Fit Testing for Dynamic Networks (2019) (0)
- Probabilistic and Analytical Models (2011) (0)
- A Note on the Height of Suffi x Trees (1989) (0)
- An M/SM/1 View of a Token Ring Queue (1987) (0)
- Shannon and Renyi ’ s Entropies Via Analytic Methods of Analysis of Algorithms (0)
- Data-Derived Weak Universal Consistency (2014) (0)
- L2-Polynomial Regression is Agnostic PAC Learner for k-Juntas (2021) (0)
- Corrections Correction to “ A Suboptimal Lossy Date Compression Based on Approximate Pattern Matching ” (1998) (0)
- MOBILVIDEO : A Framework for Self-Manipulating Video Streams (0)
- An Analysis of a Contention Resolution Algorithm --- Another Approach (2020) (0)
- Structural Information in Graphs : Symmetries and Admissible Relabelings (2017) (0)
- Recovery of Vertex Orderings in Dynamic Graphs: Algorithms for a General Solution (2019) (0)
- ON SOME NON-LINEAR RECURRENCES THAT ARISE IN COMPUTER SCIENCE (2008) (0)
- A Representation of Approximate Self- Overlapping Word and Its Application (1994) (0)
- A Lower Bound for Regret in Logistic Regression (2021) (0)
- Suffix Trees and Lempel–Ziv'77 (2015) (0)
- Scientific Foundations - La théorie analytique de l'information (2002) (0)
- Quantum State Classification via Quantum Fourier (2021) (0)
- IEEE TRANSACTIONS ON INFORMATION THEORY H. VINCENT POOR, Editor-in-Chief ELZA ERKIP, Publications Editor ADRIAAN J. VAN WIJNGAARDEN, Publications Editor (2006) (0)
- Analytic Information Theory and the Redundancy Rate Problem (2000) (0)
- Frequency of Patt ern Occurences in a (DNA) Sequence (1995) (0)
- ANALYSIS OF ALGORITHMS (AOFA) PART I: 1993 – 1998 (“DAGSTUHL PERIOD”) (2004) (0)
- Constrained Exact String Matching (2015) (0)
- A New Binomial Recurrence Arising in a Graphical Compression Algorithm (2012) (0)
- A Statistical Model for Functional Characterization of Regulatory Pathways (2007) (0)
- Efficient Algorithms for Hybrid Data/Voice Transmissions (1988) (0)
- The Concentration of the Maximum Degree in the Duplication-Divergence Models (2021) (0)
- Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2006, Miami, Florida, USA, January 21, 2006 (2006) (0)
- Performance Evaluation of Interval-Searching Conflict Resolution Algorithms (1985) (0)
- About the sketches (2015) (0)
- J un 2 02 1 Quantum State Classification via Quantum Fourier (2021) (0)
- A Validation Criterion for a Class of Combinatorial Optimization Problems via Helmholtz Free Energy and its Asymptotics (2015) (0)
- On Agnostic PAC Learning using L2-polynomial Regression and Fourier-based Algorithms (2021) (0)
- Predicted regulatory signals in the human HOXA locus: supplemental material for the report: Discovering sequences with potential regulatory characteristics (2013) (0)
- Analysis of Lempel-Ziv'78 for Markov Sources (2020) (0)
- A Characterization of Digital Search Trees from the Average Complexity Viewpoint (1987) (0)
- ALOHA-TYPE SYSTEMS (1986) (0)
- 2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (2006) (0)
- Prediction of precision for purity methods. (2020) (0)
- Complex Asymptotic Methods (2011) (0)
- Markov Types Again Revisited September 2 , 2009 (2009) (0)
- Analytical Approach to Some Problems Involving Order Statistics (0)
- How Predictable Are Biological Sequences ? March 12 , 2003 (0)
- Modeling of an availability driven computer network architecture (1987) (0)
- Towards Stability Criteria For Multidimensional Distributed Systems: Buffered Aloha Case (2020) (0)
- Toward universal testing of dynamic network models (2019) (0)
- The First and Second Moment Methods (2011) (0)
- Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics: Analco workshop preface (2008) (0)
- On the Discrete Geometry of Differential Privacy via Ehrhart Theory∗ (2017) (0)
- Generalized String Matching (2015) (0)
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital trees (1995) (0)
- Adaptive policies for spatial Reuse ring networks (1993) (0)
- COMBINATORIAL OPTIMIZATION PROBLEMS FOR WHICH ALMOSTEVERY ALGORITHM IS ASYMPTOTICALLY OPTIMAL ! September 28 , 1994 (1994) (0)
- Some Results on Vary Asymmetric Tries (2018) (0)
- Uncertainty Estimates of Purity Measurements Based on Current Information: Toward a “Live Validation” of Purity Methods (2012) (0)
- GERHARD KRAMER, Publications Editor ADRIAAN J. VAN WIJNGAARDEN, Publications Editor (2005) (0)
- Greedy Algorithms For The S hortest Common Superstring Th at Are Asymptotically Optimal (1996) (0)
- LINEAR ASSIGNMENT PROBLEM REVISITED , Average ( 1 + l / e )-out Degree Bipartite Graph Has a Perfect Matching Working Paper : June 23 , 1992 (2013) (0)
- Distribution of Tail Symbols in DST for Markov Sources (2020) (0)
- Sequential Universal Modeling for Non-Binary Sequences with Constrained Distributions (2020) (0)
- SUFFIX TREES REVISITED : ( UN ) EXPECTED ASYMPTOTIC BEHAVIORS September 16 , 1991 (2018) (0)
- Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching' (1997) (0)
- Joint String Complexity for Markov Sources Dedicated to our friend and mentor (2012) (0)
- Preferential Attachment Graphs Are All But Asymmetric ∗ July 6 , 2016 (2016) (0)
- PHILIPPE FLAJOLET 1 December 1948 – 22 March 2011 (2011) (0)
- Frontiers of Science of Information: Shannon Meets Turing (2018) (0)
- Exact String Matching (2015) (0)
- Agnostic PAC Learning of k-juntas Using L2-Polynomial Regression (2023) (0)
- PR ] 5 N ov 2 01 7 Asymmetric Rényi Problem (2018) (0)
- On Agnostic PAC Learning using $\mathcal{L}_2$-polynomial Regression and Fourier-based Algorithms (2021) (0)
- Towards Analytical Information Theory: Recent Results on Lempel-Ziv Data Compression Schemes (2007) (0)
- Inferring Temporal Information from a Snapshot of a Dynamic Network (2019) (0)
- A Low Degree Learning Algorithm for Quantum Data via Quantum Fourier (2021) (0)
- LOW COMPLEXITY APPROXIMATE BAYESIAN LOGIS- (2020) (0)
- Data driven consistency (working title) (2014) (0)
- Sequences and Digital Trees: A Symbiosis (1988) (0)
- Learning k-qubit Quantum Operators via Pauli Decomposition (2021) (0)
- Towards graphs compression : The degree 1 distribution of duplication-divergence graphs (2019) (0)
- COVER FEATURE OUTLOOK (2018) (0)
- Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk") (2003) (0)
- On the asymptotics of the minimax redundancy arising in a universal coding (1998) (0)
- A universal online caching algorithm based on pattern matching (2005) (0)
- Algorithms and Data Structures (2015) (0)
- c-Lock: Dynamic Lock-coalescing for Latency-sensitive Distributed Locking (2011) (0)
- Compression of Dynamic Graphs Generated by a Duplication Model (2020) (0)
- Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences (2011) (0)
- ONTHEVARIANCEOFTHEEXTERNALPATHLENGTHIN A SYMMETRIC DIGITAL TRlE (1989) (0)
- 2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (2013) (0)
- Scientific Foundations - Analytical information theory (2006) (0)
- Lattice Path Counting 319 Tail Bounds for the Wiener Index of Random Trees (2008) (0)
- Data Structures and Algorithms on Words (2011) (0)
- An Analytic Approach for the Asymptotic Distribution of the Height of an Incomplete Digital Tree (1994) (0)
- Model Based Data Reduction for Event Sequences (2008) (0)
- Philippe Flajolet, the Father of Analytic Combinatorics (2011) (0)
- Optimal versus randomized search of fixed length words (2002) (0)
- Frontiers of Science of Information : Shannon Meets (2017) (0)
- Subsequence String Matching (2015) (0)
- Lempel–Ziv'78 Compression Algorithm (2015) (0)
- PATI ' ERN MATCHING IMAGE COMPRESSION WITH PREDICATION LOOP : PRELIMINARY EXPERIMENTAL (2018) (0)
- Joint String Complexity for Markov Sources: Small Data Matters (2018) (0)

This paper list is powered by the following services:

## Other Resources About Wojciech Szpankowski

## What Schools Are Affiliated With Wojciech Szpankowski?

Wojciech Szpankowski is affiliated with the following schools: