The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem

The complexity of problems on probabilistic, nondeterministic, and alternating decision trees

Journal of the ACM (JACM)

Applications of Ramsey's theorem to decision tree complexity

Journal of the ACM (JACM)

Bounding the Maximum Size of a Packet Radio Network

IEEE Transactions on Computers

Optimal randomized algorithms for local sorting and set-maxima

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

Monomial bases for broken circuit complexes

European Journal of Combinatorics

Finding an unknown acyclic orientation of a given graph

Combinatorics, Probability and Computing

Optimal randomized comparison based algorithms for collision

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science