Harry B. Hunt III

According to our database, Harry B. Hunt III authored at least 103 papers between 1973 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

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

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2013

Sums-of-Products and Subproblem Independence.

Richard Edwin Stearns, Harry B. Hunt III

Proceedings of the Fundamental Problems in Computing, 2013

2011

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

2009

Complexity Classes in Optimization.

Harry B. Hunt III

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

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

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

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

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

Proceedings of the IJCAI 2007, 2007

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

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

Towards a Predictive Computational Complexity Theory.

Harry B. Hunt III, Madhav V. Marathe, Daniel J. Rosenkrantz, Richard Edwin Stearns

Proceedings of the Computational Complexity and Statistical Physics., 2006

2005

Resource Bounds and Subproblem Independence.

Richard Edwin Stearns, Harry B. Hunt III

Theory Comput. Syst., 2005

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

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

Proceedings of the Discrete Models for Complex Systems, 2003

2002

Exploiting structure in quantified formulas.

Richard Edwin Stearns, Harry B. Hunt III

J. Algorithms, 2002

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

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

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.

R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III

Algorithmica, 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

Proceedings of the Mathematical Foundations of Computer Science 2001, 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

Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

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

Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

2000

On Materializations of Array-Valued Temporaries.

Daniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III

Proceedings of the Languages and Compilers for Parallel Computing, 2000

1999

Experimental Construction of a Fine-Grained Polyalgorithm for the FFT.

Harry B. Hunt III, Lenore M. R. Mullin

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

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

The Complexity of Planar Counting Problems.

Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns

SIAM J. Comput., 1998

Bicriteria Network Design Problems.

Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III

J. Algorithms, 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

Theory of Periodically Specified Problems: Complexity and Approximability.

Madhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns

Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997

Hierarchically Specified Unit Disk Graphs.

Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi

Theor. Comput. Sci., 1997

1996

An Algebraic Model for Combinatorial Problems.

Richard Edwin Stearns, Harry B. Hunt III

SIAM J. Comput., 1996

Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs.

Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi

Discret. Appl. Math., 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

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 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

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 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

Proceedings of the Satisfiability Problem: Theory and Applications, 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

Proceedings of the Satisfiability Problem: Theory and Applications, 1996

HORNSAT, Model Checking, Verification and games (Extended Abstract).

Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz

Proceedings of the Computer Aided Verification, 8th International Conference, 1996

1995

On the Size of Binary Decision Diagrams Representing Boolean Functions.

Yuri Breitbart, Harry B. Hunt III, Daniel J. Rosenkrantz

Theor. Comput. Sci., 1995

Simple heuristics for unit disk graphs.

Madhav V. Marathe, H. Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz

Networks, 1995

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

The complexity of approximating PSPACE-Complete problems for hierarchical specifications.

Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi

CoRR, 1994

Geometry based heuristics for unit disk graphs.

Madhav V. Marathe, H. Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz

CoRR, 1994

Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version).

Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Approximation Schemes Using L-Reductions.

Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 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

Proceedings of the Algorithms, 1994

Generalized CNF Satisfiability Problems and Non-Efficient.

Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns

Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993

The Complexity of Processing Hierarchical Specifications.

Daniel J. Rosenkrantz, Harry B. Hunt III

SIAM J. Comput., 1993

Hierarchical Specified Unit Disk Graphs (Extended Abstract).

Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Many birds with one stone: multi-objective approximation algorithms.

R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract).

Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

Efficient Algorithms for Solving Systems of Linear Equations and Path Problems.

Venkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns

Proceedings of the STACS 92, 1992

The Complexity of STructural Containment and Equivalence.

Daniel J. Rosenkrantz, Harry B. Hunt III

Proceedings of the Theoretical Studies in Computer Science, 1992

1991

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

1990

On Computing Signal Probability and Detection Probability of Stuck-at Faults.

Sreejit Chakravarty, Harry B. Hunt III

IEEE Trans. Computers, 1990

The Complexity of Very Simple Boolean Formulas with Applications.

Harry B. Hunt III, Richard Edwin Stearns

SIAM J. Comput., 1990

Power Indices and Easier Hard Problems.

Richard Edwin Stearns, Harry B. Hunt III

Math. Syst. Theory, 1990

The Complexity of Equivalence for Commutative Rings.

Harry B. Hunt III, Richard Edwin Stearns

J. Symb. Comput., 1990

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

A Note on Detecting Sneak Paths in Transistor Networks.

Sreejit Chakravarty, Harry B. Hunt III

IEEE Trans. Computers, 1989

Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks.

Philip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz

Proceedings of the International Conference on Parallel Processing, 1989

1988

Matrix Multiplication for Finite Algebraic Systems.

Daniel J. Rosenkrantz, Harry B. Hunt III

Inf. Process. Lett., 1988

On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report).

Harry B. Hunt III, Richard Edwin Stearns

Proceedings of the Applied Algebra, 1988

1987

Efficient Algorithms for Automatic Construction and Compactification of Parsing Grammars.

Daniel J. Rosenkrantz, Harry B. Hunt III

ACM Trans. Program. Lang. Syst., 1987

Nonlinear Algebra and Optimization on Rings are "Hard".

Harry B. Hunt III, Richard Edwin Stearns

SIAM J. Comput., 1987

On the Computational Complexity of Algebra on Lattices.

Harry B. Hunt III, Daniel J. Rosenkrantz, Peter A. Bloniarz

SIAM J. Comput., 1987

An Application of the Planar Separator Theorem to Counting Problems.

S. S. Ravi, Harry B. Hunt III

Inf. Process. Lett., 1987

1986

Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze.

Harry B. Hunt III, Daniel J. Rosenkrantz

SIAM J. Comput., 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

Proceedings of the STACS 86, 1986

On the Computation of Detection Probability for Multiple Faults.

Sreejit Chakravarty, Harry B. Hunt III

Proceedings of the Proceedings International Test Conference 1986, 1986

1985

Testing for Grammatical Coverings.

Daniel J. Rosenkrantz, Harry B. Hunt III

Theor. Comput. Sci., 1985

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

1984

The Complexity of Monadic Recursion Schemes: Exponential Time Bounds.

Harry B. Hunt III, Daniel J. Rosenkrantz

J. Comput. Syst. Sci., 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

Algebraic Structures with Hard Equivalence and Minimization Problems.

Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz

J. ACM, 1984

1983

The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications.

Harry B. Hunt III, Daniel J. Rosenkrantz

Theor. Comput. Sci., 1983

1982

On the Decidability of Grammar Problems.

Harry B. Hunt III

J. ACM, 1982

On the Complexity of Flowchart and Loop Program Schemes and Programming Languages.

Harry B. Hunt III

J. ACM, 1982

1981

On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata

Richard Edwin Stearns, Harry B. Hunt III

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980

On the Computational Complexity of Program Scheme Equivalence.

Harry B. Hunt III, Robert L. Constable, Sartaj Sahni

SIAM J. Comput., 1980

Processing Conjunctive Predicates and Queries.

Daniel J. Rosenkrantz, Harry B. Hunt III

Proceedings of the Sixth International Conference on Very Large Data Bases, 1980

Efficient Algorithms for Structural Similarity of Grammars.

Harry B. Hunt III, Daniel J. Rosenkrantz

Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract)

Harry B. Hunt III, Daniel J. Rosenkrantz

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

Observations on the Complexity of Regular Expression Problems.

Harry B. Hunt III

J. Comput. Syst. Sci., 1979

The Complexity of Testing Predicate Locks.

Harry B. Hunt III, Daniel J. Rosenkrantz

Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, Boston, Massachusetts, USA, May 30, 1979

1978

Polynomial Algorithms for Deterministic Pushdown Automata.

Daniel J. Rosenkrantz, Harry B. Hunt III

SIAM J. Comput., 1978

Computational Parallels Between the Regular and Context-Free Languages.

Harry B. Hunt III, Daniel J. Rosenkrantz

SIAM J. Comput., 1978

Corrigendum: "Lower Bounds and Reductions Between Grammar Problems".

Harry B. Hunt III, Thomas G. Szymanski

J. ACM, 1978

Lower Bounds and Reductions Between Grammar Problems.

Harry B. Hunt III, Thomas G. Szymanski

J. ACM, 1978

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

On Equivalence and Containment Problems for Formal Languages.

Harry B. Hunt III, Daniel J. Rosenkrantz

J. ACM, 1977

Operations on Sparse Relations.

Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman

Commun. ACM, 1977

1976

The Covering Problem for Linear Context-Free Grammars.

Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski

Theor. Comput. Sci., 1976

On the Complexity of Finite, Pushdown, and Stack Automata.

Harry B. Hunt III

Math. Syst. Theory, 1976

Complexity Metatheorems for Context-Free Grammar Problems.

Harry B. Hunt III, Thomas G. Szymanski

J. Comput. Syst. Sci., 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

Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract)

Harry B. Hunt III, Thomas G. Szymanski

Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

A Complexity Theory of Grammar Problems.

Harry B. Hunt III

Proceedings of the Conference Record of the Third ACM Symposium on Principles of Programming Languages, 1976

1975

On the Complexity of LR(k) Testing.

Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman

Commun. ACM, 1975

On the Complexity of Grammar and Related Problems

Harry B. Hunt III, Thomas G. Szymanski

Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract)

Harry B. Hunt III, J. L. Rangel

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

Economy of Descriptions by Parsers, DPDA's, and PDA's

Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1974

Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract)

Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman

Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1973

On the Time and Tape Complexity of Languages.

Harry B. Hunt III

PhD thesis, 1973

On the Time and Tape Complexity of Languages I

Harry B. Hunt III

Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973