( en | de | ru )

 

Disambiguation of "III, Harry B. Hunt"

Author of the publication

copydeleteadd this publication to your clipboard
Computational Parallels Between the Regular and Context-Free Languages.

, and . SIAM J. Comput., 7 (1): 99-114 (1978)

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. You can also use the button next to the name to display some publications already assigned to the person.

Patrick Hunt

Walther Harry

Bruce Hunt

John Hunt

Aoife Hunt

 

Other publications of authors with the same name

Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs., , and . ICCI, page 26-30. IEEE Computer Society, (1993)On the Computation of Detection Probability for Multiple Faults., and . ITC, page 252-262. IEEE Computer Society, (1986)The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications., , and . Nord. J. Comput., 1 (3): 275-316 (1994)Reachability problems for sequential dynamical systems with threshold functions., , , , , and . Theor. Comput. Sci., (2003)Power Indices and Easier Hard Problems., and . Math. Syst. Theory, 23 (4): 209-225 (1990)Complexity Classes in Optimization.. Encyclopedia of Optimization, Springer, (2009)I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract)., , , , and . PODC, page 122. ACM, (1996)Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report)., and . STACS, volume 210 of Lecture Notes in Computer Science, page 277-290. Springer, (1986)Computational Parallels Between the Regular and Context-Free Languages., and . SIAM J. Comput., 7 (1): 99-114 (1978)Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze., and . SIAM J. Comput., 15 (3): 831-850 (1986)