Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The phase transition in random Horn satisfiability and its algorithmic implications
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Random graphs, random triangle-free graphs, and random partial orders
Computational Discrete Mathematics
Annals of Mathematics and Artificial Intelligence
The phase transition in random horn satisfiability and its algorithmic implications
Random Structures & Algorithms
Comparing phase transitions and peak cost in PP-complete satisfiability problems
Eighteenth national conference on Artificial intelligence
Thresholds for families of multisets, with an application to graph pebbling
Discrete Mathematics
On Generalized Random Railways
Combinatorics, Probability and Computing
Covering minimum spanning trees of random subgraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Thresholds and Expectation Thresholds
Combinatorics, Probability and Computing
Online ramsey games in random graphs
Combinatorics, Probability and Computing
Journal of Combinatorial Theory Series A
Small subgraphs in random graphs and the power of multiple choices
Journal of Combinatorial Theory Series B
Numerical estimation of the impact of interferences on the localization problem in sensor networks
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Random databases and threshold for monotone non-recursive datalog
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On rainbow-k-connectivity of random graphs
Information Processing Letters
Discrete Applied Mathematics
| Hi-index | 0.00 |