On the Time and Tape Complexity of Languages I - Harry B. Hunt III (STOC, 1973)

On the Time and Tape Complexity of Languages. - Harry B. Hunt III (1973)

Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract) - Harry B. Hunt III; Thomas G. Szymanski; Jeffrey D. Ullman (SWAT, 1974)

Computational Parallels between the Regular and Context-Free Languages - Harry B. Hunt III; Daniel J. Rosenkrantz (STOC, 1974)

Economy of Descriptions by Parsers, DPDA's, and PDA's - Matthew M. Geller; Harry B. Hunt III; Thomas G. Szymanski; Jeffrey D. Ullman (FOCS, 1975)

Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract) - Harry B. Hunt III; J. L. Rangel (FOCS, 1975)

On the Complexity of LR(k) Testing. - Harry B. Hunt III; Thomas G. Szymanski; Jeffrey D. Ullman (POPL, 1975)

On the Complexity of Grammar and Related Problems - Harry B. Hunt III; Thomas G. Szymanski (STOC, 1975)

A Complexity Theory of Grammar Problems. - Harry B. Hunt III (POPL, 1976)

Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract) - Harry B. Hunt III; Thomas G. Szymanski (STOC, 1976)

On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages. - Harry B. Hunt III; Daniel J. Rosenkrantz; Thomas G. Szymanski (J. Comput. Syst. Sci., 1976)

Complexity Metatheorems for Context-Free Grammar Problems. - Harry B. Hunt III; Thomas G. Szymanski (J. Comput. Syst. Sci., 1976)

On the Complexity of Finite, Pushdown, and Stack Automata. - Harry B. Hunt III (Math. Syst. Theory, 1976)

The Covering Problem for Linear Context-Free Grammars. - Harry B. Hunt III; Daniel J. Rosenkrantz; Thomas G. Szymanski (Theor. Comput. Sci., 1976)

Operations on Sparse Relations. - Harry B. Hunt III; Thomas G. Szymanski; Jeffrey D. Ullman (Commun. ACM, 1977)

On Equivalence and Containment Problems for Formal Languages. - Harry B. Hunt III; Daniel J. Rosenkrantz (J. ACM, 1977)

Economy of Description by Parsers, DPDA'S, and PDA'S. - Matthew M. Geller; Harry B. Hunt III; Thomas G. Szymanski; Jeffrey D. Ullman (Theor. Comput. Sci., 1977)

Lower Bounds and Reductions Between Grammar Problems. - Harry B. Hunt III; Thomas G. Szymanski (J. ACM, 1978)

Corrigendum: "Lower Bounds and Reductions Between Grammar Problems". - Harry B. Hunt III; Thomas G. Szymanski (J. ACM, 1978)

Polynomial Algorithms for Deterministic Pushdown Automata. - Daniel J. Rosenkrantz; Harry B. Hunt III (SIAM J. Comput., 1978)

The Complexity of Testing Predicate Locks. - Harry B. Hunt III; Daniel J. Rosenkrantz (SIGMOD Conference, 1979)

Observations on the Complexity of Regular Expression Problems. - Harry B. Hunt III (J. Comput. Syst. Sci., 1979)

The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract) - Harry B. Hunt III; Daniel J. Rosenkrantz (FOCS, 1980)

Efficient Algorithms for Structural Similarity of Grammars. - Harry B. Hunt III; Daniel J. Rosenkrantz (POPL, 1980)

Processing Conjunctive Predicates and Queries. - Daniel J. Rosenkrantz; Harry B. Hunt III (VLDB, 1980)

On the Computational Complexity of Program Scheme Equivalence. - Harry B. Hunt III; Robert L. Constable; Sartaj Sahni (SIAM J. Comput., 1980)

On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata - Richard Edwin Stearns; Harry B. Hunt III (FOCS, 1981)

On the Complexity of Flowchart and Loop Program Schemes and Programming Languages. - Harry B. Hunt III (J. ACM, 1982)

On the Decidability of Grammar Problems. - Harry B. Hunt III (J. ACM, 1982)

The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications. - Harry B. Hunt III; Daniel J. Rosenkrantz (Theor. Comput. Sci., 1983)

Algebraic Structures with Hard Equivalence and Minimization Problems. - Peter A. Bloniarz; Harry B. Hunt III; Daniel J. Rosenkrantz (J. ACM, 1984)

Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes. - Harry B. Hunt III (J. ACM, 1984)

The Complexity of Monadic Recursion Schemes: Exponential Time Bounds. - Harry B. Hunt III; Daniel J. Rosenkrantz (J. Comput. Syst. Sci., 1984)

On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata. - Richard Edwin Stearns; Harry B. Hunt III (SIAM J. Comput., 1985)

Testing for Grammatical Coverings. - Daniel J. Rosenkrantz; Harry B. Hunt III (Theor. Comput. Sci., 1985)

On the Computation of Detection Probability for Multiple Faults. - Sreejit Chakravarty; Harry B. Hunt III (ITC, 1986)

Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report). - Harry B. Hunt III; Richard Edwin Stearns (STACS, 1986)

Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze. - Harry B. Hunt III; Daniel J. Rosenkrantz (SIAM J. Comput., 1986)

An Application of the Planar Separator Theorem to Counting Problems. - S. S. Ravi; Harry B. Hunt III (Inf. Process. Lett., 1987)

On the Computational Complexity of Algebra on Lattices. - Harry B. Hunt III; Daniel J. Rosenkrantz; Peter A. Bloniarz (SIAM J. Comput., 1987)

Nonlinear Algebra and Optimization on Rings are "Hard". - Harry B. Hunt III; Richard Edwin Stearns (SIAM J. Comput., 1987)

Efficient Algorithms for Automatic Construction and Compactification of Parsing Grammars. - Daniel J. Rosenkrantz; Harry B. Hunt III (ACM Trans. Program. Lang. Syst., 1987)

On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report). - Harry B. Hunt III; Richard Edwin Stearns (AAECC, 1988)

Matrix Multiplication for Finite Algebraic Systems. - Daniel J. Rosenkrantz; Harry B. Hunt III (Inf. Process. Lett., 1988)

Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks. - Philip J. Bernhard; Harry B. Hunt III; Daniel J. Rosenkrantz (ICPP (1), 1989)

A Note on Detecting Sneak Paths in Transistor Networks. - Sreejit Chakravarty; Harry B. Hunt III (IEEE Trans. Computers, 1989)

The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits. - Sreejit Chakravarty; Harry B. Hunt III; S. S. Ravi; Daniel J. Rosenkrantz (IEEE Trans. Computers, 1989)

The Complexity of Equivalence for Commutative Rings. - Harry B. Hunt III; Richard Edwin Stearns (J. Symb. Comput., 1990)

Power Indices and Easier Hard Problems. - Richard Edwin Stearns; Harry B. Hunt III (Math. Syst. Theory, 1990)

The Complexity of Very Simple Boolean Formulas with Applications. - Harry B. Hunt III; Richard Edwin Stearns (SIAM J. Comput., 1990)

On Computing Signal Probability and Detection Probability of Stuck-at Faults. - Sreejit Chakravarty; Harry B. Hunt III (IEEE Trans. Computers, 1990)

Compaction of Message Patterns into Succinct Representations for Multiprocessor Interconnection Networks. - Philip J. Bernhard; Harry B. Hunt III; Daniel J. Rosenkrantz (J. Parallel Distributed Comput., 1991)

The Complexity of STructural Containment and Equivalence. - Daniel J. Rosenkrantz; Harry B. Hunt III (Theoretical Studies in Computer Science, 1992)

Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. - Venkatesh Radhakrishnan; Harry B. Hunt III; Richard Edwin Stearns (STACS, 1992)

The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract). - Madhav V. Marathe; Harry B. Hunt III; S. S. Ravi (ICALP, 1993)

Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs. - Madhav V. Marathe; Harry B. Hunt III; S. S. Ravi (ICCI, 1993)

Many birds with one stone: multi-objective approximation algorithms. - R. Ravi 001; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Harry B. Hunt III (STOC, 1993)

Hierarchical Specified Unit Disk Graphs (Extended Abstract). - Madhav V. Marathe; Venkatesh Radhakrishnan; Harry B. Hunt III; S. S. Ravi (WG, 1993)

Generalized CNF Satisfiability Problems and Non-Efficient. - Harry B. Hunt III; Madhav V. Marathe; Richard Edwin Stearns (SCT, 1994)

A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (ESA, 1994)

Approximation Schemes Using L-Reductions. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (FSTTCS, 1994)

Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). - Madhav V. Marathe; Harry B. Hunt III; Richard Edwin Stearns; Venkatesh Radhakrishnan (STOC, 1994)

Geometry based heuristics for unit disk graphs. - Madhav V. Marathe; Heinz Breu; Harry B. Hunt III; S. S. Ravi; Daniel J. Rosenkrantz (CoRR, 1994)

The complexity of approximating PSPACE-Complete problems for hierarchical specifications. - Madhav V. Marathe; Harry B. Hunt III; S. S. Ravi (CoRR, 1994)

The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications. - Madhav V. Marathe; Harry B. Hunt III; S. S. Ravi (Nord. J. Comput., 1994)

Bicriteria Network Design Problems. - Madhav V. Marathe; R. Ravi 001; Ravi Sundaram; S. S. Ravi; Daniel J. Rosenkrantz; Harry B. Hunt III (ICALP, 1995)

Simple heuristics for unit disk graphs. - Madhav V. Marathe; Heinz Breu; Harry B. Hunt III; S. S. Ravi; Daniel J. Rosenkrantz (Networks, 1995)

On the Size of Binary Decision Diagrams Representing Boolean Functions. - Yuri Breitbart; Harry B. Hunt III; Daniel J. Rosenkrantz (Theor. Comput. Sci., 1995)

HORNSAT, Model Checking, Verification and games (Extended Abstract). - Sandeep K. Shukla; Harry B. Hunt III; Daniel J. Rosenkrantz (CAV, 1996)

Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results. - Madhav V. Marathe; Harry B. Hunt III; Richard Edwin Stearns; Venkatesh Radhakrishnan (Satisfiability Problem: Theory and Applications, 1996)

The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach. - Sandeep K. Shukla; Daniel J. Rosenkrantz; Harry B. Hunt III; Richard Edwin Stearns (Satisfiability Problem: Theory and Applications, 1996)

On the Complexity of Relational Problems for Finite State Processes (Extended Abstract). - Sandeep K. Shukla; Harry B. Hunt III; Daniel J. Rosenkrantz; Richard Edwin Stearns (ICALP, 1996)

I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract). - Sandeep K. Shukla; Harry B. Hunt III; Daniel J. Rosenkrantz; S. S. Ravi; Richard Edwin Stearns (PODC, 1996)

An Algebraic Model for Combinatorial Problems. - Richard Edwin Stearns; Harry B. Hunt III (SIAM J. Comput., 1996)

Hierarchically Specified Unit Disk Graphs. - Madhav V. Marathe; Venkatesh Radhakrishnan; Harry B. Hunt III; S. S. Ravi (Theor. Comput. Sci., 1997)

Theory of Periodically Specified Problems: Complexity and Approximability. - Madhav V. Marathe; Harry B. Hunt III; Daniel J. Rosenkrantz; Richard Edwin Stearns (CCC, 1998)

NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (J. Algorithms, 1998)

The Complexity of Planar Counting Problems. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; Richard Edwin Stearns (SIAM J. Comput., 1998)

Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. - Madhav V. Marathe; Harry B. Hunt III; Richard Edwin Stearns; Venkatesh Radhakrishnan (SIAM J. Comput., 1998)

Experimental Construction of a Fine-Grained Polyalgorithm for the FFT. - Harry B. Hunt III; Lenore M. R. Mullin (PDPTA, 1999)

On Materializations of Array-Valued Temporaries. - Daniel J. Rosenkrantz; Lenore M. R. Mullin; Harry B. Hunt III (LCPC, 2000)

Gardens of Eden and Fixed Points in Sequential Dynamical Systems. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Predrag T. Tosic (DM-CCG, 2001)

Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures. - Harry B. Hunt III; Madhav V. Marathe; Richard Edwin Stearns (ISSAC, 2001)

Analysis Problems for Sequential Dynamical Systems and Communicating State Machines. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (MFCS, 2001)

Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems. - Harry B. Hunt III; Madhav V. Marathe; Richard Edwin Stearns (Electron. Notes Discret. Math., 2001)

Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (Inf. Comput., 2002)

Exploiting structure in quantified formulas. - Richard Edwin Stearns; Harry B. Hunt III (J. Algorithms, 2002)

Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (DMCS, 2003)

Reachability problems for sequential dynamical systems with threshold functions. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (Theor. Comput. Sci., 2003)

Resource Bounds and Subproblem Independence. - Richard Edwin Stearns; Harry B. Hunt III (Theory Comput. Syst., 2005)

Towards a Predictive Computational Complexity Theory. - Harry B. Hunt III; Madhav V. Marathe; Daniel J. Rosenkrantz; Richard Edwin Stearns (Computational Complexity and Statistical Physics, 2006)

Complexity of reachability problems for finite discrete dynamical systems. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (J. Comput. Syst. Sci., 2006)

On minimizing materializations of array-valued temporaries. - Daniel J. Rosenkrantz; Lenore M. R. Mullin; Harry B. Hunt III (ACM Trans. Program. Lang. Syst., 2006)

Computational Aspects of Analyzing Social Network Dynamics. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Mayur Thakur (IJCAI, 2007)

Predecessor existence problems for finite discrete dynamical systems. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Mayur Thakur (Theor. Comput. Sci., 2007)

A Transformation–Based Approach for the Design of Parallel/Distributed Scientific Software: the FFT - Harry B. Hunt III; Lenore R. Mullin; Daniel J. Rosenkrantz; James E. Raynolds (CoRR, 2008)

Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [TCS 386 (1-2) (2007) 3-37]. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Mayur Thakur (Theor. Comput. Sci., 2008)

Complexity Classes in Optimization. - Harry B. Hunt III (Encyclopedia of Optimization, 2009)

Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (Theor. Comput. Sci., 2011)

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. - R. Ravi 001; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Harry B. Hunt III (Fundamental Problems in Computing, 2013)

The Complexity of Processing Hierarchical Specifications. - Daniel J. Rosenkrantz; Harry B. Hunt III (Fundamental Problems in Computing, 2013)

Sums-of-Products and Subproblem Independence. - Richard Edwin Stearns; Harry B. Hunt III (Fundamental Problems in Computing, 2013)

Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph Predicates. - Daniel J. Rosenkrantz; Madhav V. Marathe; Harry B. Hunt III; S. S. Ravi; Richard Edwin Stearns (AAMAS, 2015)

On the undecidability and descriptional complexity of synchronized regular expressions. - Jingnan Xie; Harry B. Hunt III (Acta Informatica, 2023)

Pumping Lemmas Can be "Harmful". - Jingnan Xie; Harry B. Hunt III; Richard Edwin Stearns (Theory Comput. Syst., 2024)

On the computational and descriptional complexity of multi-pattern languages. - Jingnan Xie; Harry B. Hunt III; Richard Edwin Stearns (Theor. Comput. Sci., 2025)

Decision Problems Concerning L Systems. - Jingnan Xie; Harry B. Hunt III; Richard Edwin Stearns (Theory Comput. Syst., 2025)