Complexity and Probability of Some Boolean Formulas
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
Nodes of large degree in random trees and forests
Random Structures & Algorithms
On the number of matchings of a tree
European Journal of Combinatorics
Complexity and Limiting Ratio of Boolean Functions over Implication
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The fraction of large random trees representing a given Boolean function in implicational logic
Random Structures & Algorithms
Some natural zero one laws for ordinals below ε0
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Non-redundant random generation algorithms for weighted context-free grammars
Theoretical Computer Science
| Hi-index | 0.00 |