| 2007 | IJCAI | 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 |
| 2001 | ISSAC | 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 |
| 2001 | MFCS | 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 |
| 1999 | PDPTA | Experimental Construction of a Fine-Grained Polyalgorithm for the FFT. | Harry B. Hunt III, Lenore M. R. Mullin |
| 1996 | CAV | HORNSAT, Model Checking, Verification and games (Extended Abstract). | Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz |
| 1996 | ICALP | 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 |
| 1996 | PODC | 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 |
| 1995 | ICALP | Bicriteria Network Design Problems. | Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III |
| 1994 | ESA | 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 |
| 1994 | STOC | Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). | Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan |
| 1993 | ICALP | The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract). | Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi |
| 1993 | ICCI | Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs. | Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi |
| 1993 | STOC | Many birds with one stone: multi-objective approximation algorithms. | R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III |
| 1993 | WG | Hierarchical Specified Unit Disk Graphs (Extended Abstract). | Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi |
| 1992 | STACS | Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. | Venkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns |
| 1989 | ICPP | Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks. | Philip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz |
| 1986 | ITC | On the Computation of Detection Probability for Multiple Faults. | Sreejit Chakravarty, Harry B. Hunt III |
| 1986 | STACS | Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report). | Harry B. Hunt III, Richard Edwin Stearns |
| 1981 | FOCS | On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata | Richard Edwin Stearns, Harry B. Hunt III |
| 1980 | FOCS | The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract) | Harry B. Hunt III, Daniel J. Rosenkrantz |
| 1980 | POPL | Efficient Algorithms for Structural Similarity of Grammars. | Harry B. Hunt III, Daniel J. Rosenkrantz |
| 1980 | VLDB | Processing Conjunctive Predicates and Queries. | Daniel J. Rosenkrantz, Harry B. Hunt III |
| 1979 | SIGMOD | The Complexity of Testing Predicate Locks. | Harry B. Hunt III, Daniel J. Rosenkrantz |
| 1976 | POPL | A Complexity Theory of Grammar Problems. | Harry B. Hunt III |
| 1976 | STOC | Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract) | Harry B. Hunt III, Thomas G. Szymanski |
| 1975 | FOCS | Economy of Descriptions by Parsers, DPDA's, and PDA's | Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman |
| 1975 | FOCS | Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract) | Harry B. Hunt III, J. L. Rangel |
| 1975 | POPL | On the Complexity of LR(k) Testing. | Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman |
| 1975 | STOC | On the Complexity of Grammar and Related Problems | Harry B. Hunt III, Thomas G. Szymanski |
| 1974 | FOCS | Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract) | Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman |
| 1974 | STOC | Computational Parallels between the Regular and Context-Free Languages | Harry B. Hunt III, Daniel J. Rosenkrantz |
| 1973 | STOC | On the Time and Tape Complexity of Languages I | Harry B. Hunt III |