Random sampling of large planar maps and convex polyhedra
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Génération de Chemins de Dyck à pics croissants
Discrete Mathematics
Tirage a pile ou face de mots de Fibonacci
Discrete Mathematics
On the robustness of interconnections in random graphs: a symbolic approach
Theoretical Computer Science
Random Sampling from Boltzmann Principles
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Journal of Symbolic Computation
Attribute grammars and automatic complexity analysis
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
An asymptotic theory for recurrence relations based on minimization and maximization
Theoretical Computer Science
Object grammars and bijections
Theoretical Computer Science
A New Way of Automating Statistical Testing Methods
Proceedings of the 16th IEEE international conference on Automated software engineering
From object grammars to ECO systems
Theoretical Computer Science
Forbidden subgraphs in connected graphs
Theoretical Computer Science
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
Dissections and trees, with applications to optimal mesh encoding and to random sampling
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Uniform random sampling of traces in very large models
Proceedings of the 1st international workshop on Random testing
Efficient iteration in admissible combinatorial classes
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
On computing the coefficients of bivariate holonomic formal series
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Generating labeled planar graphs uniformly at random
Theoretical Computer Science
Enumeration and random generation of accessible automata
Theoretical Computer Science
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fast computation of power series solutions of systems of differential equations
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Generating unlabeled connected cubic planar graphs uniformly at random
Random Structures & Algorithms
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Classifying lattice walks restricted to the quarter plane
Journal of Combinatorial Theory Series A
Coverage-biased Random Exploration of Models
Electronic Notes in Theoretical Computer Science (ENTCS)
A benchmark set for the reconstruction of hv-convex discrete sets
Discrete Applied Mathematics
A machine learning approach for statistical software testing
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On the Use of Uniform Random Generation of Automata for Testing
Electronic Notes in Theoretical Computer Science (ENTCS)
The degree sequence of random graphs from subcritical classes†
Combinatorics, Probability and Computing
The relevant prefixes of coloured Motzkin walks: An average case analysis
Theoretical Computer Science
Uniform random sampling of planar graphs in linear time
Random Structures & Algorithms
Generating random binary trees - A survey
Information Sciences: an International Journal
Families of prudent self-avoiding walks
Journal of Combinatorial Theory Series A
Random sampling of plane partitions
Combinatorics, Probability and Computing
Optimal coding and sampling of triangulations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Average value and variance of pattern statistics in rational models
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Structural statistical software testing with active learning in a graph
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Controlled non-uniform random generation of decomposable structures
Theoretical Computer Science
Generating, sampling and counting subclasses of regular tree languages
Proceedings of the 14th International Conference on Database Theory
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Random generation of deterministic acyclic automata using Markov chains
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
A combinatorial framework for designing (pseudoknotted) RNA algorithms
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Boltzmann Samplers, Pólya Theory, and Cycle Pointing
SIAM Journal on Computing
Using CHRs to generate functional test cases for the java card virtual machine
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Sampling unlabeled biconnected planar graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the degree distribution of random planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Computers and Operations Research
Sampling different kinds of acyclic automata using Markov chains
Theoretical Computer Science
Algorithms for combinatorial structures: Well-founded systems and Newton iterations
Journal of Combinatorial Theory Series A
Simulating Size-constrained Galton-Watson Trees
SIAM Journal on Computing
Path computation in multi-layer multi-domain networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Boltzmann samplers for first-order differential specifications
Discrete Applied Mathematics
Journal of Combinatorial Theory Series A
Boys-and-girls Birthdays and Hadamard Products
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
Random generation of combinatorial structures: Boltzmann samplers and beyond
Proceedings of the Winter Simulation Conference
Path computation in multi-layer multi-domain networks: A language theoretic approach
Computer Communications
The number of DFAs for a given spanning tree
The Journal of Supercomputing
A new dichotomic algorithm for the uniform random generation of words in regular languages
Theoretical Computer Science
Non-redundant random generation algorithms for weighted context-free grammars
Theoretical Computer Science
Boltzmann samplers for v-balanced cycles
Theoretical Computer Science
| Hi-index | 5.24 |