External Links

Journal: Journal of the ACM

Volume 41, Issue 3

435 -- 469Peter B. Ladkin, Roger D. Maddux. On Binary Constraint Problems
470 -- 516Avrim Blum. New Approximation Algorithms for Graph Coloring
517 -- 539Doron Drusinsky, David Harel. On the Power of Bounded Concurrency I: Finite Automata
540 -- 554Tirza Hirst, David Harel. On the Power of Bounded Concurrency II: Pushdown Automata
555 -- 589Ronald L. Rivest, Robert E. Schapire. Diversity-Based Inference of Finite Automata
runs on