Harry B. Hunt III

Publication Activity (10 Years)

Years Active: 1973-2015
Publications (10 Years): 1

Top Venues

Fundamental Problems in Computing

AAMAS

Publications

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

Harry B. Hunt III.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Harry B. Hunt III