Harry B. Hunt III

116 papers A* 20A 6B 3C 1Misc 1Journal 67Unranked 15
YearRankTypeTitle / Venue / Authors
2025 J jnl
Decision Problems Concerning L Systems.
Theory Comput. Syst.
Jingnan Xie, Harry B. Hunt III, Richard Edwin Stearns
2025 J jnl
On the computational and descriptional complexity of multi-pattern languages.
Theor. Comput. Sci.
Jingnan Xie, Harry B. Hunt III, Richard Edwin Stearns
2024 J jnl
Pumping Lemmas Can be "Harmful".
Theory Comput. Syst.
Jingnan Xie, Harry B. Hunt III, Richard Edwin Stearns
2023 J jnl
On the undecidability and descriptional complexity of synchronized regular expressions.
Acta Informatica
Jingnan Xie, Harry B. Hunt III
2015 A conf
Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph Predicates.
AAMAS
Daniel J. Rosenkrantz, Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi, Richard Edwin Stearns
2013 — conf
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.
Fundamental Problems in Computing
R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
2013 — conf
Sums-of-Products and Subproblem Independence.
Fundamental Problems in Computing
Richard Edwin Stearns, Harry B. Hunt III
2013 — conf
The Complexity of Processing Hierarchical Specifications.
Fundamental Problems in Computing
Daniel J. Rosenkrantz, Harry B. Hunt III
2011 J jnl
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems.
Theor. Comput. Sci.
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
2009 — ch.
Complexity Classes in Optimization.
Encyclopedia of Optimization
Harry B. Hunt III
2008 J jnl
A Transformation--Based Approach for the Design of Parallel/Distributed Scientific Software: the FFT
CoRR
Harry B. Hunt III, Lenore R. Mullin, Daniel J. Rosenkrantz, James E. Raynolds
2008 J jnl
Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [TCS 386 (1-2) (2007) 3-37].
Theor. Comput. Sci.
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur
2007 A* conf
Computational Aspects of Analyzing Social Network Dynamics.
IJCAI
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur
2007 J jnl
Predecessor existence problems for finite discrete dynamical systems.
Theor. Comput. Sci.
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur
2006 J jnl
Complexity of reachability problems for finite discrete dynamical systems.
J. Comput. Syst. Sci.
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
2006 J jnl
On minimizing materializations of array-valued temporaries.
ACM Trans. Program. Lang. Syst.
Daniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III
2006 — ch.
Towards a Predictive Computational Complexity Theory.
Computational Complexity and Statistical Physics
Harry B. Hunt III, Madhav V. Marathe, Daniel J. Rosenkrantz, Richard Edwin Stearns
2005 J jnl
Resource Bounds and Subproblem Independence.
Theory Comput. Syst.
Richard Edwin Stearns, Harry B. Hunt III
2003 — conf
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems.
DMCS
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
2003 J jnl
Reachability problems for sequential dynamical systems with threshold functions.
Theor. Comput. Sci.
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
2002 J jnl
Exploiting structure in quantified formulas.
J. Algorithms
Richard Edwin Stearns, Harry B. Hunt III
2002 J jnl
Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems.
Inf. Comput.
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
2001 B conf
Analysis Problems for Sequential Dynamical Systems and Communicating State Machines.
MFCS
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
2001 J jnl
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.
Algorithmica
R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
2001 J jnl
Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems.
Electron. Notes Discret. Math.
Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns
2001 — conf
Gardens of Eden and Fixed Points in Sequential Dynamical Systems.
DM-CCG
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Predrag T. Tosic
2001 B conf
Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures.
ISSAC
Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns
2000 — conf
On Materializations of Array-Valued Temporaries.
LCPC
Daniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III
1999 Misc conf
Experimental Construction of a Fine-Grained Polyalgorithm for the FFT.
PDPTA
Harry B. Hunt III, Lenore M. R. Mullin
1998 J jnl
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
CoRR
Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
1998 J jnl
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems.
SIAM J. Comput.
Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
1998 J jnl
Bicriteria Network Design Problems
CoRR
Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
1998 J jnl
Bicriteria Network Design Problems.
J. Algorithms
Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
1998 J jnl
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs.
J. Algorithms
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
1998 J jnl
The Complexity of Planar Counting Problems
CoRR
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
1998 J jnl
The Complexity of Planar Counting Problems.
SIAM J. Comput.
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
1998 A conf
Theory of Periodically Specified Problems: Complexity and Approximability.
CCC
Madhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns
1997 J jnl
Hierarchically Specified Unit Disk Graphs.
Theor. Comput. Sci.
Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi
1996 J jnl
An Algebraic Model for Combinatorial Problems.
SIAM J. Comput.
Richard Edwin Stearns, Harry B. Hunt III
1996 — conf
Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results.
Satisfiability Problem: Theory and Applications
Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
1996 J jnl
Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs.
Discret. Appl. Math.
Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
1996 A* conf
HORNSAT, Model Checking, Verification and games (Extended Abstract).
CAV
Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz
1996 A* conf
I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract).
PODC
Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, S. S. Ravi, Richard Edwin Stearns
1996 A* conf
On the Complexity of Relational Problems for Finite State Processes (Extended Abstract).
ICALP
Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns
1996 — conf
The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach.
Satisfiability Problem: Theory and Applications
Sandeep K. Shukla, Daniel J. Rosenkrantz, Harry B. Hunt III, Richard Edwin Stearns
1995 A* conf
Bicriteria Network Design Problems.
ICALP
Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
1995 J jnl
On the Size of Binary Decision Diagrams Representing Boolean Functions.
Theor. Comput. Sci.
Yuri Breitbart, Harry B. Hunt III, Daniel J. Rosenkrantz
1995 J jnl
Simple heuristics for unit disk graphs.
Networks
Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz
1994 A conf
A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs.
ESA
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
1994 — conf
Approximation Schemes Using L-Reductions.
FSTTCS
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
1994 A* conf
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version).
STOC
Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
1994 — conf
Generalized CNF Satisfiability Problems and Non-Efficient.
SCT
Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns
1994 J jnl
Geometry based heuristics for unit disk graphs.
CoRR
Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz
1994 J jnl
The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications.
Nord. J. Comput.
Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
1994 J jnl
The complexity of approximating PSPACE-Complete problems for hierarchical specifications.
CoRR
Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
1993 C conf
Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs.
ICCI
Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
1993 B conf
Hierarchical Specified Unit Disk Graphs (Extended Abstract).
WG
Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi
1993 A* conf
Many birds with one stone: multi-objective approximation algorithms.
STOC
R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
1993 A* conf
The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract).
ICALP
Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
1993 J jnl
The Complexity of Processing Hierarchical Specifications.
SIAM J. Comput.
Daniel J. Rosenkrantz, Harry B. Hunt III
1992 A conf
Efficient Algorithms for Solving Systems of Linear Equations and Path Problems.
STACS
Venkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns
1992 — conf
The Complexity of STructural Containment and Equivalence.
Theoretical Studies in Computer Science
Daniel J. Rosenkrantz, Harry B. Hunt III
1991 J jnl
Compaction of Message Patterns into Succinct Representations for Multiprocessor Interconnection Networks.
J. Parallel Distributed Comput.
Philip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz
1990 J jnl
On Computing Signal Probability and Detection Probability of Stuck-at Faults.
IEEE Trans. Computers
Sreejit Chakravarty, Harry B. Hunt III
1990 J jnl
Power Indices and Easier Hard Problems.
Math. Syst. Theory
Richard Edwin Stearns, Harry B. Hunt III
1990 J jnl
The Complexity of Equivalence for Commutative Rings.
J. Symb. Comput.
Harry B. Hunt III, Richard Edwin Stearns
1990 J jnl
The Complexity of Very Simple Boolean Formulas with Applications.
SIAM J. Comput.
Harry B. Hunt III, Richard Edwin Stearns
1989 J jnl
A Note on Detecting Sneak Paths in Transistor Networks.
IEEE Trans. Computers
Sreejit Chakravarty, Harry B. Hunt III
1989 — conf
Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks.
ICPP (1)
Philip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz
1989 J jnl
The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits.
IEEE Trans. Computers
Sreejit Chakravarty, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz
1988 J jnl
Matrix Multiplication for Finite Algebraic Systems.
Inf. Process. Lett.
Daniel J. Rosenkrantz, Harry B. Hunt III
1988 — conf
On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report).
AAECC
Harry B. Hunt III, Richard Edwin Stearns
1987 J jnl
An Application of the Planar Separator Theorem to Counting Problems.
Inf. Process. Lett.
S. S. Ravi, Harry B. Hunt III
1987 J jnl
Efficient Algorithms for Automatic Construction and Compactification of Parsing Grammars.
ACM Trans. Program. Lang. Syst.
Daniel J. Rosenkrantz, Harry B. Hunt III
1987 J jnl
Nonlinear Algebra and Optimization on Rings are "Hard".
SIAM J. Comput.
Harry B. Hunt III, Richard Edwin Stearns
1987 J jnl
On the Computational Complexity of Algebra on Lattices.
SIAM J. Comput.
Harry B. Hunt III, Daniel J. Rosenkrantz, Peter A. Bloniarz
1986 A conf
Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report).
STACS
Harry B. Hunt III, Richard Edwin Stearns
1986 A conf
On the Computation of Detection Probability for Multiple Faults.
ITC
Sreejit Chakravarty, Harry B. Hunt III
1986 J jnl
Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze.
SIAM J. Comput.
Harry B. Hunt III, Daniel J. Rosenkrantz
1985 J jnl
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata.
SIAM J. Comput.
Richard Edwin Stearns, Harry B. Hunt III
1985 J jnl
Testing for Grammatical Coverings.
Theor. Comput. Sci.
Daniel J. Rosenkrantz, Harry B. Hunt III
1984 J jnl
Algebraic Structures with Hard Equivalence and Minimization Problems.
J. ACM
Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz
1984 J jnl
Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes.
J. ACM
Harry B. Hunt III
1984 J jnl
The Complexity of Monadic Recursion Schemes: Exponential Time Bounds.
J. Comput. Syst. Sci.
Harry B. Hunt III, Daniel J. Rosenkrantz
1983 J jnl
The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications.
Theor. Comput. Sci.
Harry B. Hunt III, Daniel J. Rosenkrantz
1982 J jnl
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages.
J. ACM
Harry B. Hunt III
1982 J jnl
On the Decidability of Grammar Problems.
J. ACM
Harry B. Hunt III
1981 A* conf
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata
FOCS
Richard Edwin Stearns, Harry B. Hunt III
1980 A* conf
Efficient Algorithms for Structural Similarity of Grammars.
POPL
Harry B. Hunt III, Daniel J. Rosenkrantz
1980 J jnl
On the Computational Complexity of Program Scheme Equivalence.
SIAM J. Comput.
Harry B. Hunt III, Robert L. Constable, Sartaj Sahni
1980 A* conf
Processing Conjunctive Predicates and Queries.
VLDB
Daniel J. Rosenkrantz, Harry B. Hunt III
1980 A* conf
The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract)
FOCS
Harry B. Hunt III, Daniel J. Rosenkrantz
1979 J jnl
Observations on the Complexity of Regular Expression Problems.
J. Comput. Syst. Sci.
Harry B. Hunt III
1979 — conf
The Complexity of Testing Predicate Locks.
SIGMOD Conference
Harry B. Hunt III, Daniel J. Rosenkrantz
1978 J jnl
Computational Parallels Between the Regular and Context-Free Languages.
SIAM J. Comput.
Harry B. Hunt III, Daniel J. Rosenkrantz
1978 J jnl
Corrigendum: "Lower Bounds and Reductions Between Grammar Problems".
J. ACM
Harry B. Hunt III, Thomas G. Szymanski
1978 J jnl
Lower Bounds and Reductions Between Grammar Problems.
J. ACM
Harry B. Hunt III, Thomas G. Szymanski
1978 J jnl
Polynomial Algorithms for Deterministic Pushdown Automata.
SIAM J. Comput.
Daniel J. Rosenkrantz, Harry B. Hunt III
1977 J jnl
Economy of Description by Parsers, DPDA'S, and PDA'S.
Theor. Comput. Sci.
Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
1977 J jnl
On Equivalence and Containment Problems for Formal Languages.
J. ACM
Harry B. Hunt III, Daniel J. Rosenkrantz
1977 J jnl
Operations on Sparse Relations.
Commun. ACM
Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
1976 A* conf
A Complexity Theory of Grammar Problems.
POPL
Harry B. Hunt III
1976 J jnl
Complexity Metatheorems for Context-Free Grammar Problems.
J. Comput. Syst. Sci.
Harry B. Hunt III, Thomas G. Szymanski
1976 A* conf
Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract)
STOC
Harry B. Hunt III, Thomas G. Szymanski
1976 J jnl
On the Complexity of Finite, Pushdown, and Stack Automata.
Math. Syst. Theory
Harry B. Hunt III
1976 J jnl
On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages.
J. Comput. Syst. Sci.
Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski
1976 J jnl
The Covering Problem for Linear Context-Free Grammars.
Theor. Comput. Sci.
Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski
1975 A* conf
Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract)
FOCS
Harry B. Hunt III, J. L. Rangel
1975 A* conf
Economy of Descriptions by Parsers, DPDA's, and PDA's
FOCS
Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
1975 A* conf
On the Complexity of Grammar and Related Problems
STOC
Harry B. Hunt III, Thomas G. Szymanski
1975 A* conf
On the Complexity of LR(k) Testing.
POPL
Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
1975 J jnl
On the Complexity of LR(k) Testing.
Commun. ACM
Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
1974 A* conf
Computational Parallels between the Regular and Context-Free Languages
STOC
Harry B. Hunt III, Daniel J. Rosenkrantz
1974 — conf
Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract)
SWAT
Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
1973 A* conf
On the Time and Tape Complexity of Languages I
STOC
Harry B. Hunt III
1973 — —
On the Time and Tape Complexity of Languages.
Harry B. Hunt III