D. Sivakumar. Algorithmic derandomization via complexity theory. In Proceedings of the 34th annual ACM Symposium on Theory of Computing (STOC), pages 619--626, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Compact Name-Independent Routing with Minimum Stretch - Abraham, Gavoille, al. (2004) (5 citations) (Correct)
No context found.
D. Sivakumar. Algorithmic derandomization via complexity theory. In Proceedings of the 34th annual ACM Symposium on Theory of Computing (STOC), pages 619--626, 2002.
Compact Name-Independent Routing with Minimum Stretch - Abraham, Gavoille, al. (2004) (5 citations) (Correct)
No context found.
D. Sivakumar. Algorithmic derandomization via complexity theory. In Proceedings of the 34th annual ACM Symposium on Theory of Computing (STOC), pages 619--626, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC