The maximum subforest problem: approximation and exact algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Basic analytic combinatorics of directed lattice paths
Theoretical Computer Science
Asymptotics of multivariate sequences: I. Smooth points of the singular variety
Journal of Combinatorial Theory Series A
Asymptotics of subtracted singularities for generating functions with small singularities
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Generating functions for generating trees
Discrete Mathematics
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
Random Sampling from Boltzmann Principles
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Decycling numbers of random regular graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Integer partitions and the Sperner property
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
Mappings on Decomposable Combinatorial Structures: Analytic Approach
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
Connectedness, Classes and Cycle Index
Combinatorics, Probability and Computing
Equations in finite semigroups: explicit enumeration and asymptotics of solution numbers
Journal of Combinatorial Theory Series A
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
Probabilistic Transforms for Combinatorial Urn Models
Combinatorics, Probability and Computing
Extremal problems for ordered hypergraphs: small patterns and some enumeration
Discrete Applied Mathematics
Singularity analysis, Hadamard products, and tree recurrences
Journal of Computational and Applied Mathematics
Exact distribution of individual displacements in linear probing hashing
ACM Transactions on Algorithms (TALG)
Second-order bounds for linear recurrences with negative coefficients
Journal of Computational and Applied Mathematics
The number of guillotine partitions in d dimensions
Information Processing Letters
Effective scalar products of D-finite symmetric functions
Journal of Combinatorial Theory Series A
The unsatisfiability threshold revisited
Discrete Applied Mathematics
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Bounds for fourth-order [0, 1] difference equations
Computers & Mathematics with Applications
Data morphing: an adaptive, cache-conscious storage technique
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Highly scalable algorithms for robust string barcoding
International Journal of Bioinformatics Research and Applications
Using generating functions to solve linear inhomogeneous recurrence equations
SMO'06 Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization
On fixed points of permutations
Journal of Algebraic Combinatorics: An International Journal
RNA pseudoknot structures with arc-length ≥3 and stack-length ≥σ
Discrete Applied Mathematics
On the number of transversals in Cayley tables of cyclic groups
Discrete Applied Mathematics
The number of guillotine partitions in d dimensions
Information Processing Letters
Second-order bounds for linear recurrences with negative coefficients
Journal of Computational and Applied Mathematics
Effective bounds for P-recursive sequences
Journal of Symbolic Computation
Average case analysis of algorithms
Algorithms and theory of computation handbook
Limitations on the simulation of non-sparse hamiltonians
Quantum Information & Computation
The enumeration of prudent polygons by area and its unusual asymptotics
Journal of Combinatorial Theory Series A
| Hi-index | 0.01 |