Wojciech Szpankowski

According to our database1, Wojciech Szpankowski
  • authored at least 222 papers between 1983 and 2017.
  • has a "Dijkstra number"2 of three.

Awards

IEEE Fellow

IEEE Fellow 2004, "For contributions to information system performance evaluation.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
A Study of the Boltzmann Sequence-Structure Channel.
Proceedings of the IEEE, 2017

Redundancy of Lossless Data Compression for Known Sources by Analytic Methods.
Foundations and Trends in Communications and Information Theory, 2017

Recovery of vertex orderings in dynamic graphs.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Entropy of some general plane trees.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On Symmetries of Non-Plane Trees in a Non-Uniform Model.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

Phase Transitions in Parameter Rich Optimization Problems.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016
Fundamental Bounds for Sequence Reconstruction From Nanopore Sequencers.
T-MBMC, 2016

Types of Markov Fields and Tilings.
IEEE Trans. Information Theory, 2016

Average Size of a Suffix Tree for Markov Sources.
CoRR, 2016

Fundamental Bounds and Approaches to Sequence Reconstruction from Nanopore Sequencers.
CoRR, 2016

Asymmetric Rényi Problem and PATRICIA Tries.
CoRR, 2016

Lossless compression of binary trees with correlated vertex names.
Proceedings of the IEEE International Symposium on Information Theory, 2016

The Boltzmann sequence-structure channel.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
A Limit Theorem for Radix Sort and Tries with Markovian Input.
CoRR, 2015

Phase transitions in a sequence-structure channel.
Proceedings of the 2015 Information Theory and Applications Workshop, 2015

Analytic Pattern Matching - From DNA to Twitter.
Cambridge University Press, ISBN: 978-0-521-87608-7, 2015

2014
On the Limiting Distribution of Lempel-Ziv'78 Redundancy for Memoryless Sources.
IEEE Trans. Information Theory, 2014

A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence.
Combinatorics, Probability & Computing, 2014

Data driven consistency (working title).
CoRR, 2014

On Symmetry of Uniform and Preferential Attachment Graphs.
Electr. J. Comb., 2014

Data-driven weak universal redundancy.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Markov field types and tilings.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Expected External Profile of PATRICIA Tries.
Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2013
Average Redundancy of the Shannon Code for Markov Sources.
IEEE Trans. Information Theory, 2013

A Master Theorem for Discrete Divide and Conquer Recurrences.
J. ACM, 2013

Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Capacity of a Structural Binary Symmetric Channel.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Average redundancy of the Shannon code for Markov sources.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Classification of Markov sources through joint string complexity: Theory and experiments.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets.
IEEE Trans. Information Theory, 2012

Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood.
IEEE Trans. Information Theory, 2012

Counting Markov Types, Balanced Matrices, and Eulerian Graphs.
IEEE Trans. Information Theory, 2012

Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments.
IEEE Trans. Information Theory, 2012

Average redundancy of the Shannon code for Markov sources
CoRR, 2012

Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model
CoRR, 2012

On a Recurrence Arising in Graph Compression.
Electr. J. Comb., 2012

Philippe Flajolet, the Father of Analytic Combinatorics.
Algorithmica, 2012

Two-phase cardinality estimation protocols for sensor networks with provable precision.
Proceedings of the 2012 IEEE Wireless Communications and Networking Conference, 2012

Mutual information for a deletion channel.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints.
IEEE Trans. Information Theory, 2011

Philippe Flajolet, the Father of Analytic Combinatorics.
Theor. Comput. Sci., 2011

Philippe flajolet, the father of analytic combinatorics.
ACM Trans. Algorithms, 2011

Constrained pattern matching.
ACM Trans. Algorithms, 2011

Obituary. Philippe Flajolet.
J. Symb. Comput., 2011

The expected profile of digital search trees.
J. Comb. Theory, Ser. A, 2011

In memoriam: Philippe Flajolet, the father of analytic combinatorics.
RAIRO - Theor. Inf. and Applic., 2011

Philippe Flajolet (1948-2011).
Bulletin of the EATCS, 2011

Philippe Flajolet 1 December 1948 - 22 March 2011.
Combinatorics, Probability & Computing, 2011

Deinterleaving Finite Memory Processes via Penalized Maximum Likelihood
CoRR, 2011

Philippe Flajolet: the father of analytic combinatorics.
ACM Comm. Computer Algebra, 2011

A Master Theorem for Discrete Divide and Conquer Recurrences.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Deinterleaving Markov processes: The finite-memory switch case.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Limiting distribution of Lempel Ziv'78 redundancy.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Introduction to the special issue on information theory in molecular biology and neuroscience.
IEEE Trans. Information Theory, 2010

Noisy Constrained Capacity for BSC Channels.
IEEE Trans. Information Theory, 2010

Tunstall code, Khodak variations, and random walks.
IEEE Trans. Information Theory, 2010

A Universal Online Caching Algorithm Based on Pattern Matching.
Algorithmica, 2010

Minimax redundancy for large alphabets.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Profiles of Tries.
SIAM J. Comput., 2009

Multiple choice tries and distributed hash tables.
Random Struct. Algorithms, 2009

(Un)expected behavior of digital search tree profile.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Minimum expected length of fixed-to-variable lossless compression of memoryless sources.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Deinterleaving Markov processes via penalized ML.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Structural complexity of random binary trees.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Compression of graphical structures.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
A One-to-One Code and Its Anti-Redundancy.
IEEE Trans. Information Theory, 2008

On the Construction of (Explicit) Khodak's Code and Its Analysis.
IEEE Trans. Information Theory, 2008

On the entropy of a hidden Markov process.
Theor. Comput. Sci., 2008

Annotating Pathways of Interaction Networks.
Proceedings of the Biocomputing 2008, 2008

Profile of Tries.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Large deviations for constrained pattern matching.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments.
IEEE Trans. Information Theory, 2007

Partial fillup and search time in LC tries.
ACM Trans. Algorithms, 2007

Assessing Significance of Connectivity and Conservation in Protein Interaction Networks.
Journal of Computational Biology, 2007

Identifying Statistical Dependence in Genomic Sequences via Mutual Information Estimates.
EURASIP J. Bioinformatics and Systems Biology, 2007

Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence.
Discrete Mathematics & Theoretical Computer Science, 2007

Randomized leader election.
Distributed Computing, 2007

Identifying statistical dependence in genomic sequences via mutual information estimates
CoRR, 2007

Multiple choice tries and distributed hash tables.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Functional annotation of regulatory pathways.
Proceedings of the Proceedings 15th International Conference on Intelligent Systems for Molecular Biology (ISMB) & 6th European Conference on Computational Biology (ECCB), 2007

2006
Multicast tree structure and the power law.
IEEE Trans. Information Theory, 2006

Finding biclusters by random projections.
Theor. Comput. Sci., 2006

Pairwise Alignment of Protein Interaction Networks.
Journal of Computational Biology, 2006

Detecting Conserved Interaction Patterns in Biological Networks.
Journal of Computational Biology, 2006

Hidden word statistics.
J. ACM, 2006

Preface.
Algorithmica, 2006

Assessing Significance of Connectivity and Conservation in Protein Interaction Networks.
Proceedings of the Research in Computational Molecular Biology, 2006

Error-Resilient LZW Data Compression.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

Binary Trees, Left and Right Paths, WKB Expansions, and Painleve Transcendents.
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

Partial Fillup and Search Time in LC Tries.
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2005
Probabilistic behavior of asymmetric level compressed tries.
Random Struct. Algorithms, 2005

Reliable detection of episodes in event sequences.
Knowl. Inf. Syst., 2005

An optimal DNA segmentation based on the MDL principle.
IJBRA, 2005

Enumeration of Binary Trees and Universal Types.
Discrete Mathematics & Theoretical Computer Science, 2005

Partial fillup and search time in LC tries
CoRR, 2005

Towards a complete characterization of tries.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Markov Models for Identification of Significant Episodes.
Proceedings of the 2005 SIAM International Conference on Data Mining, 2005

Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution.
Proceedings of the Research in Computational Molecular Biology, 2005

Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types.
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.
IEEE Trans. Information Theory, 2004

Markov types and minimax redundancy for Markov sources.
IEEE Trans. Information Theory, 2004

Precise minimax redundancy and regret.
IEEE Trans. Information Theory, 2004

On average sequence complexity.
Theor. Comput. Sci., 2004

On the number of full levels in tries.
Random Struct. Algorithms, 2004

Special Issue on Analysis of Algorithms.
Combinatorics, Probability & Computing, 2004

An efficient algorithm for detecting frequent subgraphs in biological networks.
Proceedings of the Proceedings Twelfth International Conference on Intelligent Systems for Molecular Biology/Third European Conference on Computational Biology 2004, 2004

Detection of Significant Sets of Episodes in Event Sequences.
Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 2004

On the Average Sequence Complexity.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

On the Entropy of a Hidden Markov Process.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

Biclustering Gene-Feature Matrices for Statistically Significant Dense Patterns.
Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

Finding Biclusters by Random Projections.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

On the Average Sequence Complexity.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

Analysis of Randomized Selection Algorithm Motivated by the LZ'77 Scheme.
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").
Bulletin of the EATCS, 2003

Reliable Detection of Episodes in Event Sequences.
Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 2003

Joint Source-Channel LZ'77 Coding.
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

An Optimal DNA Segmentation Based on the MDL Principle.
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments.
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

2002
Optimal versus randomized search of fixed length binary words.
IEEE Trans. Information Theory, 2002

A universal predictor based on pattern matching.
IEEE Trans. Information Theory, 2002

Analytic variations on redundancy rates of renewal processes.
IEEE Trans. Information Theory, 2002

2D-pattern matching image and video compression: theory, algorithms, and experiments.
IEEE Trans. Image Processing, 2002

The height of a binary search tree: the limiting distribution perspective.
Theor. Comput. Sci., 2002

Limit laws for the height in PATRICIA tries.
J. Algorithms, 2002

Is the internet fractal?
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Generalized Shannon Code Minimizes the Maximal Redundancy.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Semi-discrete Matrix Transforms (SDD) for Image and Video Compression.
Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

Improved Behaviour of Tries by the "Symmetrization" of the Source.
Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

Precise Average Redundancy Of An Idealized Arithmetic Codin.
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.
Inf. Sci., 2001

Average-Case Analysis of Algorithms - Preface.
Algorithmica, 2001

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

Hidden Pattern Statistics.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Real-Time Decompression of Streaming Video Using Mobile Code.
Proceedings of the Data Compression Conference, 2001

2000
Asymptotic average redundancy of Huffman (and other) block codes.
IEEE Trans. Information Theory, 2000

Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme.
SIAM J. Comput., 2000

A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large.
Electr. J. Comb., 2000

Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Heights in Generalized Tries and PATRICIA Tries.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Summary Structures for Frequency Queries on Large Transaction Sets.
Proceedings of the Data Compression Conference, 2000

On the Average Redundancy Rate of the Lempel-Ziv Code with K-Error Protocol.
Proceedings of the Data Compression Conference, 2000

1999
Entropy Computations via Analytic Depoissonization.
IEEE Trans. Information Theory, 1999

Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm.
SIAM J. Comput., 1999

Pattern Matching Image Compression: Algorithmic and Empirical Results.
IEEE Trans. Pattern Anal. Mach. Intell., 1999

Indexing and mapping of proteins using a modified nonlinear Sammon projection.
Journal of Computational Chemistry, 1999

Quicksort Algorithm Again Revisited.
Discrete Mathematics & Theoretical Computer Science, 1999

2D-Pattern Matching Image and Video Compression.
Proceedings of the Data Compression Conference, 1999

1998
Analytical Depoissonization and its Applications.
Theor. Comput. Sci., 1998

On Pattern Frequency Occurrences in a Markovian Sequence.
Algorithmica, 1998

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

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

Complexity of Sequential Pattern Matching Algorithms.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

Quicksort Again Revisited.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1997
Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching'.
IEEE Trans. Information Theory, 1997

A suboptimal lossy data compression based on approximate pattern matching.
IEEE Trans. Information Theory, 1997

On the average redundancy rate of the Lempel-Ziv code.
IEEE Trans. Information Theory, 1997

Stability analysis of quota allocation access protocols in ring networks with spatial reuse.
IEEE Trans. Information Theory, 1997

Analysis of algorithms.
Random Struct. Algorithms, 1997

Analysis of an Asymmetric Leader Election Algorithm.
Electr. J. Comb., 1997

1996
Analysis of a splitting process arising in probabilistic counting and other related algorithms.
Random Struct. Algorithms, 1996

On Pattern Occurrences in a Random Text.
Inf. Process. Lett., 1996

A pattern matching approach to image compression.
Proceedings of the Proceedings 1996 International Conference on Image Processing, 1996

Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal.
Proceedings of the Algorithms, 1996

On the Average Redundancy Rate of the Lempel-Ziv Code.
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, March 31, 1996

Pattern Matching Image Compression.
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, March 31, 1996

1995
On asymptotics of certain sums arising in coding theory.
IEEE Trans. Information Theory, 1995

Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm.
IEEE Trans. Information Theory, 1995

Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees.
Theor. Comput. Sci., 1995

A scheduling policy with maximal stability region for ring networks with spatial reuse.
Queueing Syst., 1995

A probabilistic Analysis of a String Editing Problem and its Variations.
Combinatorics, Probability & Computing, 1995

Generalized Lempel-Ziv Parsing Scheme and its Preliminary Analysis of the Average Profile.
Proceedings of the IEEE Data Compression Conference, 1995

1994
Digital Search Trees Again Revisited: The Internal Path Length Perspective.
SIAM J. Comput., 1994

Autocorrelation on Words and Its Applications - Analysis of Suffix Trees by String-Ruler Approach.
J. Comb. Theory, Ser. A, 1994

A functional equation often arising in the analysis of algorithms (extended abstract).
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.
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993
Asymptotic properties of data compression and suffix trees.
IEEE Trans. Information Theory, 1993

Limiting Distribution for the Depth in Patricia Tries.
SIAM J. Discrete Math., 1993

A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors.
SIAM J. Comput., 1993

A Probabilistic Analysis of a Pattern Matching Problem.
Random Struct. Algorithms, 1993

A Note on Binomial Recurrences Arising in the Analysis of Algorithms.
Inf. Process. Lett., 1993

Multidimensional Digital Searching and Some New Parameters in Tries.
Int. J. Found. Comput. Sci., 1993

Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract).
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.
Theor. Comput. Sci., 1992

A Note on the Height of Suffix Trees.
SIAM J. Comput., 1992

Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited.
SIAM J. Comput., 1992

Stability of token passing rings.
Queueing Syst., 1992

Self-Alignments in Words and Their Applications.
J. Algorithms, 1992

(Un)expected Behavior of Typical Suffix Trees.
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.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Probabilistic Analysis of Generalized Suffix Trees (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

1991
Analysis of digital tries with Markovian dependency.
IEEE Trans. Information Theory, 1991

A Characterization of Digital Search Trees from the Successful Search Viewpoint.
Theor. Comput. Sci., 1991

On the Height of Digital Trees and Related Problems.
Algorithmica, 1991

What Can We Learn about Suffix Trees from Independent Tries?
Proceedings of the Algorithms and Data Structures, 1991

Combinatorial Optimization Through Order Statistics.
Proceedings of the ISA '91 Algorithms, 1991

A Typical Behaviour of Some Data Compression Schemes.
Proceedings of the IEEE Data Compression Conference, 1991

1990
Patricia Tries Again Revisited
J. ACM, October, 1990

Yet another application of a binomial recurrence order statistics.
Computing, 1990

On the Analysis of the Tail Queue Length and Waiting Time Distributions of a GI/G/c Queue.
Proceedings of the Performance '90, 1990

1989
On the Balance Property of Patricia Tries: External Path Length Viewpoint.
Theor. Comput. Sci., 1989

Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation.
SIAM J. Comput., 1989

On the variance of the external path length in a symmetric digital trie.
Discrete Applied Mathematics, 1989

Some remarks on uniformly bounded markov chains: multimodality analysis.
Computers & OR, 1989

The presence of exponentiality in entropy maximized M/GI/1 queues.
Computers & OR, 1989

Digital Data Structures and Order Statistics.
Proceedings of the Algorithms and Data Structures, 1989

Digital Search Trees - Further Results on a Fundamental Data Structure.
IFIP Congress, 1989

1988
Some Results on V-ary Asymmetric Tries.
J. Algorithms, 1988

The Evaluation of an Alternative Sum With Applications to the Analysis of Some Data Structures.
Inf. Process. Lett., 1988

Some Theorems on Instability with Applications to Multiaccess Protocols.
Operations Research, 1988

Stability Conditions for Multidimensional Queueing Systems with Computer Applications.
Operations Research, 1988

Closed-network duals of multiqueues with application to token-passing systems.
Comput. Syst. Sci. Eng., 1988

On an Alternative Sum Useful in the Analysis of Some Data Structures.
Proceedings of the SWAT 88, 1988

Do We Really Need to Balance Patricia Trees? (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987
An Analysis of a Contention Resolution Algorithm: Another Approach.
Acta Inf., 1987

Average Complexity of Additive Properties for Multiway Tries: A Unified Approach (Extended Abstract).
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

Two Problems on the Average Complexity of Digital Trees.
Proceedings of the Performance '87, 1987

1986
Bounds for Queue Lengths in a Contention Packet Broadcast System.
IEEE Trans. Communications, 1986

On an Asymptotic Analysis of a Tree-Type Algorithm for Broadcast Communications.
Inf. Process. Lett., 1986

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

Performance Evaluation of a Reservation Protocol for Multiaccess Systems.
Proceedings of the Performance '83, 1983


  Loading...