Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Limit laws for the height in PATRICIA tries
Journal of Algorithms - Analysis of algorithms
The height of a binary search tree: the limiting distribution perspective
Theoretical Computer Science
Some results on tries with adaptive branching
Theoretical Computer Science
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Generalized Shannon Code Minimizes the Maximal Redundancy
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Analysis of multiple quickselect variants
Theoretical Computer Science
Precise Average Redundancy Of An Idealized Arithmetic Coding
DCC '02 Proceedings of the Data Compression Conference
An Optimal DNA Segmentation Based on the MDL Principle
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Reliable Detection of Episodes in Event Sequences
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Special issue - Computing patterns in strings: foreword
Fundamenta Informaticae - Special issue on computing patterns in strings
Regexpcount, a symbolic package for counting problems on regular expressions and words
Fundamenta Informaticae - Special issue on computing patterns in strings
Random Structures & Algorithms
Engineering a Fast Online Persistent Suffix Tree Construction
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Biclustering Gene-Feature Matrices for Statistically Significant Dense Patterns
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Probabilistic Transforms for Combinatorial Urn Models
Combinatorics, Probability and Computing
Concentration of Size and Path Length of Tries
Combinatorics, Probability and Computing
On the number of full levels in tries
Random Structures & Algorithms
On average sequence complexity
Theoretical Computer Science
Reliable detection of episodes in event sequences
Knowledge and Information Systems
Singularity analysis, Hadamard products, and tree recurrences
Journal of Computational and Applied Mathematics
Towards a complete characterization of tries
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The Guessing Secrets problem: a probabilistic approach
Journal of Algorithms
Practical methods for constructing suffix trees
The VLDB Journal — The International Journal on Very Large Data Bases
On the average depth of asymmetric LC-tries
Information Processing Letters
Journal of the ACM (JACM)
Software—Practice & Experience
The scientific works of Rainer Kemp (1949-2004)
Theoretical Computer Science
Monotone runs of uniformly distributed integer random variables: a probabilistic analysis
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
On using conditional rotations and randomized heuristics for self-organizing ternary search tries
Proceedings of the 43rd annual Southeast regional conference - Volume 1
The number of distinct values in a geometrically distributed sample
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
A lower bound on compression of unknown alphabets
Theoretical Computer Science
Finding biclusters by random projections
Theoretical Computer Science
A station strategy to deter backoff attacks in IEEE 802.11 LANs
Journal of Discrete Algorithms
A linear-time algorithm for computing the multinomial stochastic complexity
Information Processing Letters
Characterizing overlay multicast networks and their costs
IEEE/ACM Transactions on Networking (TON)
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Multiple choice tries and distributed hash tables
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Computer Science
Partial fillup and search time in LC tries
ACM Transactions on Algorithms (TALG)
Journal of Discrete Algorithms
Practical suffix tree construction
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
New results for molecular formation under pairwise potential minimization
Computational Optimization and Applications
Generalized approximate counting revisited
Theoretical Computer Science
An analysis of the height of tries with random weights on the edges
Combinatorics, Probability and Computing
Probability in the Engineering and Informational Sciences
An optimal DNA segmentation based on the MDL principle
International Journal of Bioinformatics Research and Applications
NML computation algorithms for tree-structured multinomial Bayesian networks
EURASIP Journal on Bioinformatics and Systems Biology
On the entropy of a hidden Markov process
Theoretical Computer Science
(Un)expected behavior of digital search tree profile
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Conflict-resolving tree algorithm stable to incomplete interference damping
Automation and Remote Control
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
On a speculated relation between chvátal–sankoff constants of several sequences
Combinatorics, Probability and Computing
Statistical Properties of Factor Oracles
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
The Number of Symbol Comparisons in QuickSort and QuickSelect
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
From Nerode's congruence to suffix automata with mismatches
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
Inverse auctions: Injecting unique minima into random sets
ACM Transactions on Algorithms (TALG)
IEEE Transactions on Information Theory
Compression of graphical structures
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Minimum expected length of fixed-to-variable lossless compression of memoryless sources
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Structural complexity of random binary trees
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
On the average depth of asymmetric LC-tries
Information Processing Letters
Search data structures for skewed strings
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Tunstall code, Khodak variations, and random walks
IEEE Transactions on Information Theory
Statistical inference for the ε-entropy and the quadratic Rényi entropy
Journal of Multivariate Analysis
Data-specific analysis of string sorting
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
ACM Transactions on Algorithms (TALG)
Noisy constrained capacity for BSC channels
IEEE Transactions on Information Theory
Gaussian clusters and noise: an approach based on the minimum description length principle
DS'10 Proceedings of the 13th international conference on Discovery science
Statistical properties of factor oracles
Journal of Discrete Algorithms
The expected profile of digital search trees
Journal of Combinatorial Theory Series A
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
The enumeration of prudent polygons by area and its unusual asymptotics
Journal of Combinatorial Theory Series A
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Renewal theory in the analysis of tries and strings
Theoretical Computer Science
Record statistics in a random composition
Discrete Applied Mathematics
Average complexity of Moore's and Hopcroft's algorithms
Theoretical Computer Science
Languages with mismatches and an application to approximate indexing
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
On Buffon machines and numbers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A master theorem for discrete divide and conquer recurrences
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Assessing the significance of sets of words
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Analysis of a class of tries with adaptive multi-digit branching
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Playing CSMA/CA game to deter backoff attacks in ad hoc wireless LANs
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Pattern matching statistics on correlated sources
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Assessing significance of connectivity and conservation in protein interaction networks
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Statistical inference for rényi entropy functionals
Conceptual Modelling and Its Theoretical Foundations
Dictionary-symbolwise flexible parsing
Journal of Discrete Algorithms
Counting occurrences for a finite set of words: Combinatorial methods
ACM Transactions on Algorithms (TALG)
Testing Symmetric Properties of Distributions
SIAM Journal on Computing
Regexpcount, a symbolic package for counting problems on regular expressions and words
Fundamenta Informaticae - Computing Patterns in Strings
Fundamenta Informaticae - Computing Patterns in Strings
Towards efficient replication of documents in chord: case (r,s) erasure codes
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
A Master Theorem for Discrete Divide and Conquer Recurrences
Journal of the ACM (JACM)
Large deviation properties for patterns
Journal of Discrete Algorithms
| Hi-index | 0.19 |
From the Publisher:While most algorithm designs are finalized toward worst case scenarios where they have to cope efficiently with unrealistic inputs, the average case solution is a probabilistic approach that allows for the possibility that a simple algorithm would suffice. This book provides a unique overview of the tools and techniques used in average case analysis of algorithms.