( en | de | ru )

 

Disambiguation of "III, Harry B. Hunt"

Author of the publication

copydeleteadd this publication to your clipboard
I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract).

, , , , and . PODC, page 122. ACM, (1996)

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

Bruce Hunt

 

Other publications of authors with the same name

Gardens of Eden and Fixed Points in Sequential Dynamical Systems., , , , , , and . DM-CCG, volume AA of DMTCS Proceedings, page 95-110. (2001)Matrix Multiplication for Finite Algebraic Systems., and . Inf. Process. Lett., 28 (4): 189-192 (1988)An Algebraic Model for Combinatorial Problems., and . SIAM J. Comput., 25 (2): 448-476 (1996)On the Complexity of Grammar and Related Problems, and . STOC, page 54-65. ACM, (1975)On the Complexity of LR(k) Testing., , and . POPL, page 130-136. ACM Press, (1975)The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach., , , and . Satisfiability Problem: Theory and Applications, volume 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 603-641. DIMACS/AMS, (1996)Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results., , , and . Satisfiability Problem: Theory and Applications, volume 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 225-259. DIMACS/AMS, (1996)Resource Bounds and Subproblem Independence., and . Theory Comput. Syst., 38 (6): 731-761 (2005)Sums-of-Products and Subproblem Independence., and . Fundamental Problems in Computing, page 301-325. Springer, (2013)On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report)., and . AAECC, volume 357 of Lecture Notes in Computer Science, page 250-258. Springer, (1988)