Wojciech Szpankowski

Gadiel Seroussi

Proceedings of the IEEE International Symposium on Information Theory, 2007

Pattern Matching in Constrained Sequences.

[BibT_eX]

[DOI]

Yongwook Choi

Proceedings of the IEEE International Symposium on Information Theory, 2007

Statistical Dependence in Biological Sequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Multicast tree structure and the power law.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Finding biclusters by random projections.

[BibT_eX]

[DOI]

Qiaofeng Yang

Theor. Comput. Sci., 2006

Pairwise Alignment of Protein Interaction Networks.

[BibT_eX]

[DOI]

J. Comput. Biol., 2006

Detecting Conserved Interaction Patterns in Biological Networks.

[BibT_eX]

[DOI]

J. Comput. Biol., 2006

Hidden word statistics.

[BibT_eX]

[DOI]

Philippe Flajolet

Brigitte Vallée

J. ACM, 2006

Preface.

[BibT_eX]

[DOI]

Daniel Panario

Algorithmica, 2006

On (d, k) Sequences Not Containing a Given Word.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Precise Asymptotic Analysis of the Tunstall Code.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Error-Resilient LZW Data Compression.

[BibT_eX]

[DOI]

Yonghui Wu

Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

Binary Trees, Left and Right Paths, WKB Expansions, and Painleve Transcendents.

[BibT_eX]

[DOI]

Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2005

Probabilistic behavior of asymmetric level compressed tries.

[BibT_eX]

[DOI]

Luc Devroye

Random Struct. Algorithms, 2005

Reliable detection of episodes in event sequences.

[BibT_eX]

[DOI]

Robert Gwadera

Knowl. Inf. Syst., 2005

An optimal DNA segmentation based on the MDL principle.

[BibT_eX]

[DOI]

Wenhui Ren

Lukasz Szpankowski

Int. J. Bioinform. Res. Appl., 2005

Enumeration of Binary Trees and Universal Types.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2005

Towards a complete characterization of tries.

[BibT_eX]

[DOI]

GaHyun Park

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Markov Models for Identification of Significant Episodes.

[BibT_eX]

[DOI]

Robert Gwadera

Proceedings of the 2005 SIAM International Conference on Data Mining, 2005

Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2005

Analytic algorithmics, combinatorics, and information theory.

[BibT_eX]

[DOI]

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types.

[BibT_eX]

[DOI]

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

Problems on Sequences: Information Theory and Computer Science Interface.

[BibT_eX]

[DOI]

John C. Kieffer

En-Hui Yang

IEEE Trans. Inf. Theory, 2004

Markov types and minimax redundancy for Markov sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Precise minimax redundancy and regret.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

On average sequence complexity.

[BibT_eX]

[DOI]

Svante Janson

Theor. Comput. Sci., 2004

On the number of full levels in tries.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

Special Issue on Analysis of Algorithms.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

An efficient algorithm for detecting frequent subgraphs in biological networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Twelfth International Conference on Intelligent Systems for Molecular Biology/Third European Conference on Computational Biology 2004, 2004

Error resilient LZ'77 scheme and its analysis.

[BibT_eX]

[DOI]

Mark Daniel Ward

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Variable-to-variable codes with small redundancy rates.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Detection of Significant Sets of Episodes in Event Sequences.

[BibT_eX]

[DOI]

Robert Gwadera

Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 2004

Biclustering Gene-Feature Matrices for Statistically Significant Dense Patterns.

[BibT_eX]

[DOI]

Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

Analysis of Randomized Selection Algorithm Motivated by the LZ'77 Scheme.

[BibT_eX]

Mark Daniel Ward

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk").

[BibT_eX]

Bull. EATCS, 2003

Joint Source-Channel LZ'77 Coding.

[BibT_eX]

[DOI]

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments.

[BibT_eX]

[DOI]

Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

2002

Optimal versus randomized search of fixed length binary words.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

A universal predictor based on pattern matching.

[BibT_eX]

[DOI]

Izydor Apostol

IEEE Trans. Inf. Theory, 2002

Analytic variations on redundancy rates of renewal processes.

[BibT_eX]

[DOI]

Philippe Flajolet

IEEE Trans. Inf. Theory, 2002

2D-pattern matching image and video compression: theory, algorithms, and experiments.

[BibT_eX]

[DOI]

Marc Alzina

IEEE Trans. Image Process., 2002

The height of a binary search tree: the limiting distribution perspective.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Limit laws for the height in PATRICIA tries.

[BibT_eX]

[DOI]

J. Algorithms, 2002

Is the internet fractal?

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Generalized Shannon Code Minimizes the Maximal Redundancy.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Semi-discrete Matrix Transforms (SDD) for Image and Video Compression.

[BibT_eX]

[DOI]

Sacha Zyto

Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

Improved Behaviour of Tries by the "Symmetrization" of the Source.

[BibT_eX]

[DOI]

Yuriy A. Reznik

Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

Precise Average Redundancy Of An Idealized Arithmetic Codin.

[BibT_eX]

[DOI]

Hsien-Kuei Hwang

Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

2001

On the average redundancy rate of the Lempel-Ziv code with the k-error protocol.

[BibT_eX]

[DOI]

Yuriy A. Reznik

Inf. Sci., 2001

Average-Case Analysis of Algorithms - Preface.

[BibT_eX]

[DOI]

Algorithmica, 2001

Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source.

[BibT_eX]

[DOI]

Jing Tang

Algorithmica, 2001

Hidden Pattern Statistics.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Real-Time Decompression of Streaming Video Using Mobile Code.

[BibT_eX]

[DOI]

David Meyer

Proceedings of the Data Compression Conference, 2001

2000

Asymptotic average redundancy of Huffman (and other) block codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large.

[BibT_eX]

[DOI]

Electron. J. Comb., 2000

Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Heights in Generalized Tries and PATRICIA Tries.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Summary Structures for Frequency Queries on Large Transaction Sets.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2000

1999

Entropy Computations via Analytic Depoissonization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm.

[BibT_eX]

[DOI]

Jing Tang

SIAM J. Comput., 1999

Pattern Matching Image Compression: Algorithmic and Empirical Results.

[BibT_eX]

[DOI]

Yann Génin

IEEE Trans. Pattern Anal. Mach. Intell., 1999

Indexing and mapping of proteins using a modified nonlinear Sammon projection.

[BibT_eX]

[DOI]

Izydor Apostol

J. Comput. Chem., 1999

Quicksort Algorithm Again Revisited.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 1999

2D-Pattern Matching Image and Video Compression.

[BibT_eX]

[DOI]

Marc Alzina

Proceedings of the Data Compression Conference, 1999

Average Case Analysis of Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Analytical Depoissonization and its Applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

On Pattern Frequency Occurrences in a Markovian Sequence.

[BibT_eX]

[DOI]

Mireille Régnier

Algorithmica, 1998

Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics.

[BibT_eX]

[DOI]

Algorithmica, 1998

Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal.

[BibT_eX]

[DOI]

Alan M. Frieze

Algorithmica, 1998

Complexity of Sequential Pattern Matching Algorithms.

[BibT_eX]

[DOI]

Mireille Régnier

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

Quicksort Again Revisited.

[BibT_eX]

[DOI]

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1997

Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching'.

[BibT_eX]

[DOI]

Tomasz Luczak

IEEE Trans. Inf. Theory, 1997

A suboptimal lossy data compression based on approximate pattern matching.

[BibT_eX]

[DOI]

Tomasz Luczak

IEEE Trans. Inf. Theory, 1997

On the average redundancy rate of the Lempel-Ziv code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Stability analysis of quota allocation access protocols in ring networks with spatial reuse.

[BibT_eX]

[DOI]

Leonidas Georgiadis

Leandros Tassiulas

IEEE Trans. Inf. Theory, 1997

Analysis of algorithms.

[BibT_eX]

[DOI]

Philippe Flajolet

Random Struct. Algorithms, 1997

Analysis of an Asymmetric Leader Election Algorithm.

[BibT_eX]

[DOI]

Svante Janson

Electron. J. Comb., 1997

On the approximate pattern occurrences in a text.

[BibT_eX]

[DOI]

Mireille Régnier

Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

1996

Analysis of a splitting process arising in probabilistic counting and other related algorithms.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

On Pattern Occurrences in a Random Text.

[BibT_eX]

[DOI]

Ioannis Fudos

Evaggelia Pitoura

Inf. Process. Lett., 1996

A pattern matching approach to image compression.

[BibT_eX]

[DOI]

Yann Génin

Proceedings of the Proceedings 1996 International Conference on Image Processing, 1996

Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal.

[BibT_eX]

[DOI]

Alan M. Frieze

Proceedings of the Algorithms, 1996

Pattern Matching Image Compression.

[BibT_eX]

[DOI]

Yann Génin

Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

1995

On asymptotics of certain sums arising in coding theory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

A scheduling policy with maximal stability region for ring networks with spatial reuse.

[BibT_eX]

[DOI]

Leonidas Georgiadis

Leandros Tassiulas

Queueing Syst. Theory Appl., 1995

A probabilistic Analysis of a String Editing Problem and its Variations.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1995

Generalized Lempel-Ziv Parsing Scheme and its Preliminary Analysis of the Average Profile.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1995

1994

Digital Search Trees Again Revisited: The Internal Path Length Perspective.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Autocorrelation on Words and Its Applications - Analysis of Suffix Trees by String-Ruler Approach.

[BibT_eX]

J. Comb. Theory, Ser. A, 1994

A functional equation often arising in the analysis of algorithms (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms.

[BibT_eX]

[DOI]

Tomasz Luczak

Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993

Asymptotic properties of data compression and suffix trees.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Limiting Distribution for the Depth in Patricia Tries.

[BibT_eX]

[DOI]

Bonita Rais

SIAM J. Discret. Math., 1993

A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

A Probabilistic Analysis of a Pattern Matching Problem.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1993

A Note on Binomial Recurrences Arising in the Analysis of Algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

Multidimensional Digital Searching and Some New Parameters in Tries.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

1992

Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

A Note on the Height of Suffix Trees.

[BibT_eX]

[DOI]

Luc Devroye

Bonita Rais

SIAM J. Comput., 1992

Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited.

[BibT_eX]

[DOI]

David J. Aldous

Micha Hofri

SIAM J. Comput., 1992

Stability of token passing rings.

[BibT_eX]

[DOI]

Leonidas Georgiadis

Queueing Syst. Theory Appl., 1992

Self-Alignments in Words and Their Applications.

[BibT_eX]

[DOI]

Alberto Apostolico

J. Algorithms, 1992

(Un)expected Behavior of Typical Suffix Trees.

[BibT_eX]

[DOI]

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Probabilistic Analysis of Generalized Suffix Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

1991

Analysis of digital tries with Markovian dependency.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

A Characterization of Digital Search Trees from the Successful Search Viewpoint.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

On the Height of Digital Trees and Related Problems.

[BibT_eX]

[DOI]

Algorithmica, 1991

What Can We Learn about Suffix Trees from Independent Tries?

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1991

Combinatorial Optimization Through Order Statistics.

[BibT_eX]

[DOI]

Proceedings of the ISA '91 Algorithms, 1991

A Typical Behaviour of Some Data Compression Schemes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1991

1990

Patricia Tries Again Revisited

[BibT_eX]

[DOI]

J. ACM, October, 1990

Yet another application of a binomial recurrence order statistics.

[BibT_eX]

[DOI]

Computing, 1990

On the Analysis of the Tail Queue Length and Waiting Time Distributions of a GI/G/c Queue.

[BibT_eX]

John S. Sadowsky

Proceedings of the Performance '90, 1990

1989

On the Balance Property of Patricia Tries: External Path Length Viewpoint.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

On the variance of the external path length in a symmetric digital trie.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1989

Some remarks on uniformly bounded markov chains: multimodality analysis.

[BibT_eX]

[DOI]

Comput. Oper. Res., 1989

The presence of exponentiality in entropy maximized M/GI/1 queues.

[BibT_eX]

[DOI]

Comput. Oper. Res., 1989

Digital Data Structures and Order Statistics.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1989

Digital Search Trees - Further Results on a Fundamental Data Structure.

[BibT_eX]

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988

Some Results on V-ary Asymmetric Tries.

[BibT_eX]

[DOI]

J. Algorithms, 1988

The Evaluation of an Alternative Sum With Applications to the Analysis of Some Data Structures.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

Some Theorems on Instability with Applications to Multiaccess Protocols.

[BibT_eX]

[DOI]

Oper. Res., 1988

Stability Conditions for Multidimensional Queueing Systems with Computer Applications.

[BibT_eX]

[DOI]

Oper. Res., 1988

Closed-network duals of multiqueues with application to token-passing systems.

[BibT_eX]

Comput. Syst. Sci. Eng., 1988

On an Alternative Sum Useful in the Analysis of Some Data Structures.

[BibT_eX]

[DOI]

Proceedings of the SWAT 88, 1988

Do We Really Need to Balance Patricia Trees? (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987

An Analysis of a Contention Resolution Algorithm: Another Approach.

[BibT_eX]

[DOI]

Acta Informatica, 1987

Average Complexity of Additive Properties for Multiway Tries: A Unified Approach (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

Modeling of an availability driven computer network architecture.

[BibT_eX]

[DOI]

Dan C. Marinescu

Proceedings of the 1987 Symposium on the Simulation of Computer Networks, 1987

Two Problems on the Average Complexity of Digital Trees.

[BibT_eX]

Proceedings of the Performance '87, 1987

1986

Bounds for Queue Lengths in a Contention Packet Broadcast System.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1986

On an Asymptotic Analysis of a Tree-Type Algorithm for Broadcast Communications.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

1983

Analysis and Stability Considerations in a Reservation Multiaccess System.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1983

Packet Switching in Multiple Radio Channels: Analysis and Stability of a Random Access System.

[BibT_eX]

[DOI]

Comput. Networks, 1983

Performance Evaluation of a Reservation Protocol for Multiaccess Systems.

[BibT_eX]