Graph entropy and quantum sorting problems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An efficient algorithm for partial order production
Proceedings of the forty-first annual ACM symposium on Theory of computing
Communication lower bounds via the chromatic number
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Sorting and selection with random costs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Sorting under partial information (without the ellipsoid algorithm)
Proceedings of the forty-second ACM symposium on Theory of computing
An Efficient Algorithm for Partial Order Production
SIAM Journal on Computing
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the complexity of trial and error
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |