( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs.

, , и . ICCI, стр. 26-30. IEEE Computer Society, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Patrick Hunt

Walther Harry

Bruce Hunt

John Hunt

Bruce Hunt

 

Другие публикации лиц с тем же именем

Computational Parallels Between the Regular and Context-Free Languages., и . SIAM J. Comput., 7 (1): 99-114 (1978)Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze., и . SIAM J. Comput., 15 (3): 831-850 (1986)Complexity Classes in Optimization.. Encyclopedia of Optimization, Springer, (2009)Reachability problems for sequential dynamical systems with threshold functions., , , , , и . Theor. Comput. Sci., (2003)Complexity Metatheorems for Context-Free Grammar Problems., и . J. Comput. Syst. Sci., 13 (3): 318-334 (1976)The Covering Problem for Linear Context-Free Grammars., , и . Theor. Comput. Sci., 2 (3): 361-382 (1976)Hierarchically Specified Unit Disk Graphs., , , и . Theor. Comput. Sci., 174 (1-2): 23-65 (1997)I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract)., , , , и . PODC, стр. 122. ACM, (1996)Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report)., и . STACS, том 210 из Lecture Notes in Computer Science, стр. 277-290. Springer, (1986)Predecessor and Permutation Existence Problems for Sequential Dynamical Systems., , , , , и . DMCS, том AB из DMTCS Proceedings, стр. 69-80. DMTCS, (2003)