Edit Profile Hunt, Harry Bowen III Compute Distance To: Compute Author ID: hunt.harry-b-iii Published as: Hunt, H. B.; Hunt, H. B. III; Hunt, H. III; Hunt, Harry B.; Hunt, Harry B. III External Links: MGP · Wikidata Documents Indexed: 85 Publications since 1973 all top 5 Co-Authors 7 single-authored 40 Rosenkrantz, Daniel J. 35 Stearns, Richard Edwin 29 Marathe, Madhav V. 22 Ravi, S. S. 11 Szymanski, Thomas G. 9 Radhakrishnan, Venkatesh 6 Barrett, Chris L. 4 Ullman, Jeffrey David 3 Barrett, Christopher L. 2 Bloniarz, Peter A. 2 Chakravarty, Sreejit 2 Hartmanis, Juris 2 Ravi, Ragoju 2 Ravi, Ramamoorthi 2 Shukla, Sandeep Kumar 2 Sundaram, Ravi 2 Thakur, Mayur 1 Bernhard, P. J. 1 Breitbart, Yuri 1 Breu, Heinz 1 Constable, Robert Lee 1 Geller, Matthew M. 1 Maranthe, M. V. 1 Mullin, Lenore R. 1 Sahni, Sartaj K. 1 Tosic, Predrag T. all top 5 Serials 12 SIAM Journal on Computing 10 Theoretical Computer Science 7 Journal of the Association for Computing Machinery 5 Journal of Computer and System Sciences 3 Journal of Algorithms 2 Information Processing Letters 2 Mathematical Systems Theory 2 Communications of the ACM 1 Discrete Applied Mathematics 1 IEEE Transactions on Reliability 1 IEEE Transactions on Computers 1 Networks 1 Journal of Symbolic Computation 1 Algorithmica 1 Information and Computation 1 Journal of Parallel and Distributed Computing 1 Nordic Journal of Computing 1 Theory of Computing Systems 1 Annals of Combinatorics all top 5 Fields 80 Computer science (68-XX) 13 Mathematical logic and foundations (03-XX) 9 Operations research, mathematical programming (90-XX) 6 Combinatorics (05-XX) 6 Dynamical systems and ergodic theory (37-XX) 3 Order, lattices, ordered algebraic structures (06-XX) 3 Information and communication theory, circuits (94-XX) 2 Commutative algebra (13-XX) 1 Associative rings and algebras (16-XX) 1 Numerical analysis (65-XX) 1 Statistical mechanics, structure of matter (82-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH 70 Publications have been cited 655 times in 472 Documents Cited by ▼ Year ▼ Simple heuristics for unit disk graphs. Zbl 0821.90128Marathe, M. V.; Breu, H.; Hunt, H. B. III; Ravi, S. S.; Rosenkrantz, D. J. 71 1995 NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. Zbl 0894.68105Hunt, Harry B. III; Marathe, Madhav V.; Radhakrishnan, Venkatesh; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 62 1998 Bicriteria network design problems. Zbl 0906.68076Marathe, Madhav V.; Ravi, R.; Sundaram, Ravi; Ravi, S. S.; Rosenkrantz, Daniel J.; Hunt, Harry B. III 46 1998 On the equivalence, containment, and covering problems for the regular and context-free languages. Zbl 0334.68044Hunt, Harry B. III; Rosenkrantz, Daniel J.; Szymanski, Thomas G. 38 1976 On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. Zbl 0577.68074Stearns, R. E.; Hunt, H. B. III 34 1985 Many birds with one stone, multi-objective approximation algorithms. Zbl 1310.68247Ravi, R.; Marathe, M. V.; Ravi, S. S.; Rosenkrantz, D. J.; Hunt, H. B. 30 1993 The complexity of planar counting problems. Zbl 0911.68060Hunt, Harry B. III; Marathe, Madhav V.; Radhakrishnan, Venkatesh; Stearns, Richard E. 23 1998 On the size of binary decision diagrams representing Boolean functions. Zbl 0874.68283Breitbart, Y.; Hunt, H. III; Rosenkrantz, D. 19 1995 Approximation algorithms for degree-constrained minimum-cost network-design problems. Zbl 0980.68139Ravi, R.; Maranthe, M. V.; Ravi, S. S.; Rosenkrantz, D. J.; Hunt, H. B. III 17 2001 The complexity of equivalence for commutative rings. Zbl 0724.68050Hunt, H. B. III; Stearns, R. E. 16 1990 Gardens of Eden and fixed points in sequential dynamical systems. Zbl 1017.68055Barrett, Christopher L.; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E.; Tosic, Predrag T. 15 2001 On the computational complexity of program scheme equivalence. Zbl 0447.68038Hunt, H. B. III; Constable, R. L.; Sahni, S. 14 1980 Computational parallels between the regular and context-free languages. Zbl 0374.68046Hunt, H. B. III; Rosenkrantz, D. J. 14 1978 On the time and tape complexity of languages. I. Zbl 0357.68090Hunt, H. B. III 14 1973 Complexity of reachability problems for finite discrete dynamical systems. Zbl 1119.68095Barrett, Christopher L.; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 13 2006 Algebraic structures with hard equivalence and minimization problems. Zbl 0628.68039Bloniarz, P. A.; Hunt, H. B. III; Rosenkrantz, D. J. 12 1984 Predecessor existence problems for finite discrete dynamical systems. Zbl 1137.68410Barrett, Chris; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E.; Thakur, Mayur 11 2007 Reachability problems for sequential dynamical systems with threshold functions. Zbl 1045.68062Barrett, Chris; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 11 2003 The LBA problem and its importance in the theory of computing. Zbl 0301.68056Hartmanis, J.; Hunt, H. B. III 10 1974 Power indices and easier hard problems. Zbl 0719.68025Stearns, R. E.; Hunt, H. B. III 9 1990 Economy of description by parsers, DPDA’s, and PDA’s. Zbl 0357.68086Geller, Matthew M.; Hunt, Harry B. III; Szymanski, Thomas G.; Ullman, Jeffrey D. 9 1977 On the complexity of LR(k) testing. Zbl 0318.68052Hunt, Harry B. III; Szymanski, Thomas G.; Ullman, Jeffrey D. 9 1975 Predecessor and permutation existence problems for sequential dynamical systems. Zbl 1073.68684Barrett, Christopher L.; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 8 2003 The LBA problem and its importance in the theory of computing. Zbl 0352.68100Hartmanis, J.; Hunt, H. B. 8 1973 On some special classes of sequential dynamical systems. Zbl 1060.68136Barrett, Chris; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 7 2003 Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems. Zbl 0911.68153Marathe, Madhav V.; Hunt, Harry B. III; Stearns, Richard E.; Radhakrishnan, Venkatesh 7 1998 On the complexity of relational problems for finite state processes (extended abstract). Zbl 1046.68627Shukla, Sandeep; Hunt, Harry B. III; Rosenkrantz, Daniel J.; Stearns, Richard E. 7 1996 Approximation schemes using \(L\)-reductions. Zbl 1044.68943Hunt, H. B. III; Marathe, M. V.; Radhakrishnan, V.; Ravi, S. S.; Rosenkrantz, D. J.; Stearns, R. E. 7 1994 On the computational complexity of algebra on lattices. Zbl 0642.06005Hunt, H. B. III; Rosenkrantz, D. J.; Bloniarz, P. A. 7 1987 The complexity of very simple Boolean formulas with applications. Zbl 0696.68060Hunt, H. B. III; Stearns, R. E. 6 1990 Monotone Boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures. Zbl 0605.68030Hunt, H. B.; Stearns, R. E. 6 1986 An application of the planar separator theorem to counting problems. Zbl 0653.68064Ravi, S. S.; Hunt, H. B. III 5 1987 On equivalence and containment problems for formal languages. Zbl 0359.68087Hunt, Harry B. III; Rosenkrantz, Daniel J. 5 1977 The covering problem for linear context-free grammars. Zbl 0343.68037Hunt, H. B. III; Rosenkrantz, D. J.; Szymanski, T. G. 5 1976 Analysis problems for sequential dynamical systems and communicating state machines. Zbl 1006.37012Barrett, Chris; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 4 2001 On the decidability of grammar problems. Zbl 0497.68049Hunt, H. B. III 4 1982 On the complexity of flowchart and loop program schemes and programming languages. Zbl 0477.68045Hunt, H. B. III 4 1982 Observations on the complexity of regular expression problems. Zbl 0453.68015Hunt, H. B. III 4 1979 Computational parallels between the regular and context-free languages. Zbl 0357.68091Hunt, H. B. III; Rosenkrantz, D. J. 4 1974 Hierarchically specified unit disk graphs. Zbl 0908.68120Marathe, Madhav V.; Radhakrishnan, Venkatesh; Hunt, Harry B. III; Ravi, S. S. 3 1997 Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs. Zbl 0847.68084Marathe, M. V.; Hunt, H. B. III; Ravi, S. S. 3 1996 The complexity of approximating PSPACE-complete problems for hierarchical specifications. Zbl 0817.68092Marathe, Madhav V.; Hunt, Harry B. III; Ravi, S. S. 3 1994 Corrigendum to ”Lower bounds and reductions between grammar problems”. Zbl 0388.68064Hunt, H. B. III; Szymanski, T. G. 3 1978 Lower bounds and reductions between grammar problems. Zbl 0365.68073Hunt, Harry B. III; Szymanski, Thomas G. 3 1978 Dichotomization, reachability, and the forbidden subgraph problem. (Extended abstract). Zbl 0365.68031Hunt, H. B. III; Szymanski, T. G. 3 1976 On the complexity of finite, pushdown, and stack automata. Zbl 0351.68016Hunt, H. B. III 3 1976 On the complexity of grammar and related problems. Zbl 0361.68078Hunt, H. B. III; Szymanski, T. G. 3 1975 Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems. Zbl 1216.91025Barrett, Chris; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 2 2011 Errata for the paper “Predecessor existence problems for finite discrete dynamical systems”. Zbl 1138.68426Barrett, Chris; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E.; Thakur, Mayur 2 2008 Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures. Zbl 1356.68279Hunt, Harry B. III; Marathe, Madhav V.; Stearns, Richard E. 2 2001 Complexity of hierarchically and 1-dimensional periodically specified problems. I: Hardness results. Zbl 0895.68070Marathe, Madhav V.; Hunt, Harry B. III; Stearns, Richard E.; Radhakrishnan, Venkatesh 2 1997 An algebraic model for combinatorial problems. Zbl 0844.68063Stearns, Richard E.; Hunt, Harry B. III 2 1996 Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). Zbl 1345.68276Marathe, M. V.; Hunt, H. B. III; Stearns, R. E.; Radhakrishnan, V. 2 1994 Nonlinear algebra and optimization on rings are “hard”. Zbl 0686.68037Hunt, H. B. III; Stearns, R. E. 2 1987 Terminating Turing machine computations and the complexity and/or decidability of correspondence problems, grammars, and program schemes. Zbl 0632.68048Hunt, H. B. III 2 1984 The complexity of monadic recursion schemes: Exponential time bounds. Zbl 0543.68034Hunt, H. B. III; Rosenkrantz, D. J. 2 1984 The complexity of monadic recursion schemes: executability problems, nesting depth, and applications. Zbl 0537.68039Hunt, H. B. III; Rosenkrantz, D. J. 2 1983 Complexity of grammatical similarity relations. Preliminary report. Zbl 0431.68076Hunt, H. B. III; Rosenkrantz, D. J. 2 1977 Operations on sparse relations. Zbl 0349.68024Hunt, H. B. III; Szymanski, T. G.; Ullman, J. D. 2 1977 Complexity metatheorems for context-free grammar problems. Zbl 0377.68038Hunt, Harry B. III; Szymanski, Thomas G. 2 1976 Towards a predictive computational complexity theory for periodically specified problems: a survey. Zbl 1156.82357Hunt, Harry B. III; Marathe, Madhav V.; Rosenkrantz, Daniel J.; Stearns, Richard E. 1 2006 Complexity and approximability of quantified and stochastic constraint satisfaction problems. Zbl 0990.90562Hunt, Harry B. III; Marathe, Madhav V.; Stearns, Richard E. 1 2001 Theory of periodically specified problems: Complexity and approximability. Zbl 0935.68038Marathe, Madhav V.; Hunt, Harry B. III; Rosenkrantz, Daniel J.; Stearns, Richard E. 1 1998 The polynomial time decidability of simulation relations for finite state processes: A HORNSAT based approach. Zbl 0891.68059Shukla, Sandeep K.; Rosenkrantz, Daniel J.; Hunt, Harry B. III; Stearns, Richard E. 1 1997 Efficient algorithms for \(\delta\)-near-planar graph and algebraic problems. Zbl 0968.90514Radhakrishnan, Venkatesh; Hunt, Harry B. III; Stearns, Richard E. 1 1993 On the complexity of satisfiability problems for algebraic structures. Zbl 0679.68083Hunt, H. B. III; Stearns, R. E. 1 1989 Matrix multiplication for finite algebraic systems. Zbl 0738.65041Rosenkrantz, Daniel J.; Hunt, Harry B. III 1 1988 Testing for grammatical coverings. Zbl 0599.68056Rosenkrantz, D. J.; Hunt, H. B. III 1 1985 Finite languages and the computational complexity of algebraic structures. Zbl 0596.68042Hunt, H. B. III 1 1983 Polynomial algorithms for deterministic pushdown automata. Zbl 0386.68072Rosenkrantz, Daniel J.; Hunt, Harry B. III 1 1978 Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems. Zbl 1216.91025Barrett, Chris; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 2 2011 Errata for the paper “Predecessor existence problems for finite discrete dynamical systems”. Zbl 1138.68426Barrett, Chris; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E.; Thakur, Mayur 2 2008 Predecessor existence problems for finite discrete dynamical systems. Zbl 1137.68410Barrett, Chris; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E.; Thakur, Mayur 11 2007 Complexity of reachability problems for finite discrete dynamical systems. Zbl 1119.68095Barrett, Christopher L.; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 13 2006 Towards a predictive computational complexity theory for periodically specified problems: a survey. Zbl 1156.82357Hunt, Harry B. III; Marathe, Madhav V.; Rosenkrantz, Daniel J.; Stearns, Richard E. 1 2006 Reachability problems for sequential dynamical systems with threshold functions. Zbl 1045.68062Barrett, Chris; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 11 2003 Predecessor and permutation existence problems for sequential dynamical systems. Zbl 1073.68684Barrett, Christopher L.; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 8 2003 On some special classes of sequential dynamical systems. Zbl 1060.68136Barrett, Chris; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 7 2003 Approximation algorithms for degree-constrained minimum-cost network-design problems. Zbl 0980.68139Ravi, R.; Maranthe, M. V.; Ravi, S. S.; Rosenkrantz, D. J.; Hunt, H. B. III 17 2001 Gardens of Eden and fixed points in sequential dynamical systems. Zbl 1017.68055Barrett, Christopher L.; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E.; Tosic, Predrag T. 15 2001 Analysis problems for sequential dynamical systems and communicating state machines. Zbl 1006.37012Barrett, Chris; Hunt, Harry B. III; Marathe, Madhav V.; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 4 2001 Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures. Zbl 1356.68279Hunt, Harry B. III; Marathe, Madhav V.; Stearns, Richard E. 2 2001 Complexity and approximability of quantified and stochastic constraint satisfaction problems. Zbl 0990.90562Hunt, Harry B. III; Marathe, Madhav V.; Stearns, Richard E. 1 2001 NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. Zbl 0894.68105Hunt, Harry B. III; Marathe, Madhav V.; Radhakrishnan, Venkatesh; Ravi, S. S.; Rosenkrantz, Daniel J.; Stearns, Richard E. 62 1998 Bicriteria network design problems. Zbl 0906.68076Marathe, Madhav V.; Ravi, R.; Sundaram, Ravi; Ravi, S. S.; Rosenkrantz, Daniel J.; Hunt, Harry B. III 46 1998 The complexity of planar counting problems. Zbl 0911.68060Hunt, Harry B. III; Marathe, Madhav V.; Radhakrishnan, Venkatesh; Stearns, Richard E. 23 1998 Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems. Zbl 0911.68153Marathe, Madhav V.; Hunt, Harry B. III; Stearns, Richard E.; Radhakrishnan, Venkatesh 7 1998 Theory of periodically specified problems: Complexity and approximability. Zbl 0935.68038Marathe, Madhav V.; Hunt, Harry B. III; Rosenkrantz, Daniel J.; Stearns, Richard E. 1 1998 Hierarchically specified unit disk graphs. Zbl 0908.68120Marathe, Madhav V.; Radhakrishnan, Venkatesh; Hunt, Harry B. III; Ravi, S. S. 3 1997 Complexity of hierarchically and 1-dimensional periodically specified problems. I: Hardness results. Zbl 0895.68070Marathe, Madhav V.; Hunt, Harry B. III; Stearns, Richard E.; Radhakrishnan, Venkatesh 2 1997 The polynomial time decidability of simulation relations for finite state processes: A HORNSAT based approach. Zbl 0891.68059Shukla, Sandeep K.; Rosenkrantz, Daniel J.; Hunt, Harry B. III; Stearns, Richard E. 1 1997 On the complexity of relational problems for finite state processes (extended abstract). Zbl 1046.68627Shukla, Sandeep; Hunt, Harry B. III; Rosenkrantz, Daniel J.; Stearns, Richard E. 7 1996 Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs. Zbl 0847.68084Marathe, M. V.; Hunt, H. B. III; Ravi, S. S. 3 1996 An algebraic model for combinatorial problems. Zbl 0844.68063Stearns, Richard E.; Hunt, Harry B. III 2 1996 Simple heuristics for unit disk graphs. Zbl 0821.90128Marathe, M. V.; Breu, H.; Hunt, H. B. III; Ravi, S. S.; Rosenkrantz, D. J. 71 1995 On the size of binary decision diagrams representing Boolean functions. Zbl 0874.68283Breitbart, Y.; Hunt, H. III; Rosenkrantz, D. 19 1995 Approximation schemes using \(L\)-reductions. Zbl 1044.68943Hunt, H. B. III; Marathe, M. V.; Radhakrishnan, V.; Ravi, S. S.; Rosenkrantz, D. J.; Stearns, R. E. 7 1994 The complexity of approximating PSPACE-complete problems for hierarchical specifications. Zbl 0817.68092Marathe, Madhav V.; Hunt, Harry B. III; Ravi, S. S. 3 1994 Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). Zbl 1345.68276Marathe, M. V.; Hunt, H. B. III; Stearns, R. E.; Radhakrishnan, V. 2 1994 Many birds with one stone, multi-objective approximation algorithms. Zbl 1310.68247Ravi, R.; Marathe, M. V.; Ravi, S. S.; Rosenkrantz, D. J.; Hunt, H. B. 30 1993 Efficient algorithms for \(\delta\)-near-planar graph and algebraic problems. Zbl 0968.90514Radhakrishnan, Venkatesh; Hunt, Harry B. III; Stearns, Richard E. 1 1993 The complexity of equivalence for commutative rings. Zbl 0724.68050Hunt, H. B. III; Stearns, R. E. 16 1990 Power indices and easier hard problems. Zbl 0719.68025Stearns, R. E.; Hunt, H. B. III 9 1990 The complexity of very simple Boolean formulas with applications. Zbl 0696.68060Hunt, H. B. III; Stearns, R. E. 6 1990 On the complexity of satisfiability problems for algebraic structures. Zbl 0679.68083Hunt, H. B. III; Stearns, R. E. 1 1989 Matrix multiplication for finite algebraic systems. Zbl 0738.65041Rosenkrantz, Daniel J.; Hunt, Harry B. III 1 1988 On the computational complexity of algebra on lattices. Zbl 0642.06005Hunt, H. B. III; Rosenkrantz, D. J.; Bloniarz, P. A. 7 1987 An application of the planar separator theorem to counting problems. Zbl 0653.68064Ravi, S. S.; Hunt, H. B. III 5 1987 Nonlinear algebra and optimization on rings are “hard”. Zbl 0686.68037Hunt, H. B. III; Stearns, R. E. 2 1987 Monotone Boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures. Zbl 0605.68030Hunt, H. B.; Stearns, R. E. 6 1986 On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. Zbl 0577.68074Stearns, R. E.; Hunt, H. B. III 34 1985 Testing for grammatical coverings. Zbl 0599.68056Rosenkrantz, D. J.; Hunt, H. B. III 1 1985 Algebraic structures with hard equivalence and minimization problems. Zbl 0628.68039Bloniarz, P. A.; Hunt, H. B. III; Rosenkrantz, D. J. 12 1984 Terminating Turing machine computations and the complexity and/or decidability of correspondence problems, grammars, and program schemes. Zbl 0632.68048Hunt, H. B. III 2 1984 The complexity of monadic recursion schemes: Exponential time bounds. Zbl 0543.68034Hunt, H. B. III; Rosenkrantz, D. J. 2 1984 The complexity of monadic recursion schemes: executability problems, nesting depth, and applications. Zbl 0537.68039Hunt, H. B. III; Rosenkrantz, D. J. 2 1983 Finite languages and the computational complexity of algebraic structures. Zbl 0596.68042Hunt, H. B. III 1 1983 On the decidability of grammar problems. Zbl 0497.68049Hunt, H. B. III 4 1982 On the complexity of flowchart and loop program schemes and programming languages. Zbl 0477.68045Hunt, H. B. III 4 1982 On the computational complexity of program scheme equivalence. Zbl 0447.68038Hunt, H. B. III; Constable, R. L.; Sahni, S. 14 1980 Observations on the complexity of regular expression problems. Zbl 0453.68015Hunt, H. B. III 4 1979 Computational parallels between the regular and context-free languages. Zbl 0374.68046Hunt, H. B. III; Rosenkrantz, D. J. 14 1978 Corrigendum to ”Lower bounds and reductions between grammar problems”. Zbl 0388.68064Hunt, H. B. III; Szymanski, T. G. 3 1978 Lower bounds and reductions between grammar problems. Zbl 0365.68073Hunt, Harry B. III; Szymanski, Thomas G. 3 1978 Polynomial algorithms for deterministic pushdown automata. Zbl 0386.68072Rosenkrantz, Daniel J.; Hunt, Harry B. III 1 1978 Economy of description by parsers, DPDA’s, and PDA’s. Zbl 0357.68086Geller, Matthew M.; Hunt, Harry B. III; Szymanski, Thomas G.; Ullman, Jeffrey D. 9 1977 On equivalence and containment problems for formal languages. Zbl 0359.68087Hunt, Harry B. III; Rosenkrantz, Daniel J. 5 1977 Complexity of grammatical similarity relations. Preliminary report. Zbl 0431.68076Hunt, H. B. III; Rosenkrantz, D. J. 2 1977 Operations on sparse relations. Zbl 0349.68024Hunt, H. B. III; Szymanski, T. G.; Ullman, J. D. 2 1977 On the equivalence, containment, and covering problems for the regular and context-free languages. Zbl 0334.68044Hunt, Harry B. III; Rosenkrantz, Daniel J.; Szymanski, Thomas G. 38 1976 The covering problem for linear context-free grammars. Zbl 0343.68037Hunt, H. B. III; Rosenkrantz, D. J.; Szymanski, T. G. 5 1976 Dichotomization, reachability, and the forbidden subgraph problem. (Extended abstract). Zbl 0365.68031Hunt, H. B. III; Szymanski, T. G. 3 1976 On the complexity of finite, pushdown, and stack automata. Zbl 0351.68016Hunt, H. B. III 3 1976 Complexity metatheorems for context-free grammar problems. Zbl 0377.68038Hunt, Harry B. III; Szymanski, Thomas G. 2 1976 On the complexity of LR(k) testing. Zbl 0318.68052Hunt, Harry B. III; Szymanski, Thomas G.; Ullman, Jeffrey D. 9 1975 On the complexity of grammar and related problems. Zbl 0361.68078Hunt, H. B. III; Szymanski, T. G. 3 1975 The LBA problem and its importance in the theory of computing. Zbl 0301.68056Hartmanis, J.; Hunt, H. B. III 10 1974 Computational parallels between the regular and context-free languages. Zbl 0357.68091Hunt, H. B. III; Rosenkrantz, D. J. 4 1974 On the time and tape complexity of languages. I. Zbl 0357.68090Hunt, H. B. III 14 1973 The LBA problem and its importance in the theory of computing. Zbl 0352.68100Hartmanis, J.; Hunt, H. B. 8 1973 all cited Publications top 5 cited Publications all top 5 Cited by 791 Authors 20 Hunt, Harry Bowen III 18 Marathe, Madhav V. 16 Ravi, S. S. 15 Rosenkrantz, Daniel J. 10 Stearns, Richard Edwin 8 Ibarra, Oscar H. 8 Kranakis, Evangelos Konstantinou 6 Carmi, Paz 6 Horváth, Gábor 6 Kortsarz, Guy 6 Zenklusen, Rico 5 Barrett, Chris L. 5 Mortveit, Henning S. 5 Nandy, Subhas Chandra 5 Protti, Fábio 5 Salomaa, Kai T. 5 Wiese, Andreas 5 Wotschke, Detlef 4 Akbari Torkestani, Javad 4 Aledo, Juan Ángel 4 Bollig, Beate 4 da Fonseca, Guilherme Dias 4 Das, Gautam K. 4 Díaz, Luis Guillermo 4 Fujito, Toshihiro 4 Holzer, Markus 4 Krumke, Sven Oliver 4 Kutrib, Martin 4 Mäkinen, Erkki 4 Martinez, Silvia 4 Nijholt, Anton 4 Noltemeier, Hartmut 4 Nutov, Zeev 4 Ogihara, Mitsunori 4 Saurabh, Saket 4 Szabó, Csaba 4 Szymanski, Thomas G. 4 Valverde, Jose C. 4 Wu, Weili 4 Yu, Sheng 3 Cerioli, Márcia R. 3 Danicic, Sebastian 3 De, Minati 3 Demaine, Erik D. 3 Domaratzki, Michael 3 Elkin, Michael 3 Faria, Luerbio 3 Ferreira, Talita O. 3 Fomin, Fedor V. 3 Frieder, Ophir 3 Fukunaga, Takuro 3 Gao, Xiaofeng 3 Grahne, Gösta 3 Hierons, Robert Mark 3 Hu, Xiaodong 3 Huynh, Dung T. 3 Jallu, Ramesh K. 3 Jirásková, Galina 3 Kamei, Sayaka 3 Katz, Matthew J. 3 Khandekar, Rohit 3 Kuhlman, Chris J. 3 Laurence, Michael R. 3 Leininger, Brian S. 3 Levin, Asaf 3 Lohrey, Markus 3 Masopust, Tomáš 3 Meybodi, Mohamad Reza 3 Monnot, Jérôme 3 Nagamochi, Hiroshi 3 Niehren, Joachim 3 Peleg, David 3 Pérennes, Stéphane 3 Radhakrishnan, Venkatesh 3 Ravikumar, Bala 3 Shallit, Jeffrey O. 3 Singh, Mohit 3 Soisalon-Soininen, Eljas 3 Sundaram, Ravi 3 Thakur, Mayur 3 Thomo, Alex 3 Uchizawa, Kei 3 Woelfel, Philipp 3 Zhang, Zhao 3 Zito, Michele 2 Adiga, Abhijin 2 Agarwal, Pankaj Kumar 2 Aloise, Dario José 2 Alzoubi, Khaled M. 2 Amini, Omid 2 Arkin, Esther M. 2 Barbosa, Valmir Carneiro 2 Barrett, Christopher L. 2 Book, Ronald Vernon 2 Bosboom, Jeffrey 2 Boucher, Christina 2 Bozzelli, Laura 2 Brzozowski, Janusz Antoni 2 Butenko, Sergiy I. 2 Caragiannis, Ioannis ...and 691 more Authors all top 5 Cited in 84 Serials 102 Theoretical Computer Science 34 Information Processing Letters 32 Journal of Computer and System Sciences 27 Information and Computation 25 Discrete Applied Mathematics 14 International Journal of Foundations of Computer Science 10 Mathematical Systems Theory 10 Computational Geometry 8 Discrete Mathematics 8 Mathematical Programming. Series A. Series B 8 Theory of Computing Systems 8 Journal of Combinatorial Optimization 7 Algorithmica 7 Journal of Discrete Algorithms 6 International Journal of Algebra and Computation 6 International Journal of Computer Mathematics 5 Acta Informatica 5 International Journal of Computational Geometry & Applications 5 Discrete Mathematics, Algorithms and Applications 4 Algebra Universalis 4 Operations Research Letters 4 Discrete & Computational Geometry 4 European Journal of Operational Research 4 Annals of Mathematics and Artificial Intelligence 3 Applied Mathematics and Computation 3 European Journal of Combinatorics 3 Journal of Global Optimization 3 RAIRO. Theoretical Informatics and Applications 2 Artificial Intelligence 2 BIT 2 Information Sciences 2 Mathematics and Computers in Simulation 2 Networks 2 Semigroup Forum 2 SIAM Journal on Computing 2 Advances in Applied Mathematics 2 Graphs and Combinatorics 2 Journal of Symbolic Computation 2 Computers & Operations Research 2 MSCS. Mathematical Structures in Computer Science 2 Distributed Computing 2 RAIRO. Informatique Théorique et Applications 2 The Journal of Logic and Algebraic Programming 2 Natural Computing 2 Discrete Optimization 2 Optimization Letters 1 Modern Physics Letters B 1 Glasgow Mathematical Journal 1 International Journal of Computer & Information Sciences 1 Journal of Algebra 1 Journal of Computational and Applied Mathematics 1 Journal of Graph Theory 1 Journal of Mathematical Economics 1 Journal of Pure and Applied Algebra 1 Journal of Soviet Mathematics 1 The Journal of Symbolic Logic 1 Kybernetika 1 Operations Research 1 RAIRO, Informatique Théorique 1 Cybernetics 1 Annals of Pure and Applied Logic 1 Order 1 Journal of Parallel and Distributed Computing 1 Computational Complexity 1 Journal of Mathematical Sciences (New York) 1 Complexity 1 Constraints 1 INFORMS Journal on Computing 1 Soft Computing 1 Journal of the ACM 1 Data Mining and Knowledge Discovery 1 RAIRO. Operations Research 1 International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 1 Journal of Applied Mathematics 1 OR Spectrum 1 JMMA. Journal of Mathematical Modelling and Algorithms 1 Central European Journal of Mathematics 1 Logical Methods in Computer Science 1 The Review of Symbolic Logic 1 Algorithms 1 RAIRO. Theoretical Informatics and Applications 1 Journal of the Operations Research Society of China 1 Computer Science Review 1 Journal of Logical and Algebraic Methods in Programming all top 5 Cited in 26 Fields 388 Computer science (68-XX) 128 Combinatorics (05-XX) 80 Operations research, mathematical programming (90-XX) 33 Mathematical logic and foundations (03-XX) 21 Dynamical systems and ergodic theory (37-XX) 13 Group theory and generalizations (20-XX) 12 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 12 Information and communication theory, circuits (94-XX) 10 Order, lattices, ordered algebraic structures (06-XX) 10 General algebraic systems (08-XX) 8 Numerical analysis (65-XX) 5 Associative rings and algebras (16-XX) 4 Biology and other natural sciences (92-XX) 2 Commutative algebra (13-XX) 2 Convex and discrete geometry (52-XX) 2 Statistics (62-XX) 1 General and overarching topics; collections (00-XX) 1 History and biography (01-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Topological groups, Lie groups (22-XX) 1 Approximations and expansions (41-XX) 1 Differential geometry (53-XX) 1 General topology (54-XX) 1 Manifolds and cell complexes (57-XX) 1 Fluid mechanics (76-XX) 1 Geophysics (86-XX) Citations by Year Wikidata Timeline The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.