Large convex cones in hypercubes
Discrete Applied Mathematics
Rapid almost-complete broadcasting in faulty networks
Theoretical Computer Science
Vertex Turán problems in the hypercube
Journal of Combinatorial Theory Series A
Rapid almost-complete broadcasting in faulty networks
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
An improved lower bound on the sensitivity complexity of graph properties
Theoretical Computer Science
| Hi-index | 0.00 |