Y. Han. A fast derandomization scheme and its applications. Tech. Rep. No. 180-90, Dept. of Computer Science, University of Kentucky, Lexington, Kentucky, to appear on SIAM J. on Computing. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Improved Algorithms via Approximations of Probability.. - Chari, Rohatgi.. (1997) (11 citations) (Correct)
.... = V; E) with jV j = n, jEj = m and having a maximum degree Delta, a ( Delta 1) vertex coloring of the graph can be computed by an ( n m) log 3 n log log n) algorithm [20] an improved ( n m) log log n; log 2 n log log n) algorithm that runs on the CREW PRAM, has been devised by Han [13]. We improve these time complexities by presenting an ( n m)n ffi ; log 2 n) algorithm where ffi 0 is any constant. This gives faster algorithms for other problems such as the much harder Delta vertex coloring problem [25] We use similar ideas to derive a faster algorithm for ....
Y. Han, A fast derandomization scheme and its applications, SIAM J. Comput., 25:52--82, 1996.
An Improvement on Parallel Computation of a Maximal Matching - Han Self-citation (Han) (Correct)
No context found.
Y. Han. A fast derandomization scheme and its applications. Tech. Rep. No. 180-90, Dept. of Computer Science, University of Kentucky, Lexington, Kentucky, to appear on SIAM J. on Computing.
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