Harry B. Hunt III

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2015
Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph Predicates.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2013
Sums-of-Products and Subproblem Independence.
Proceedings of the Fundamental Problems in Computing, 2013

The Complexity of Processing Hierarchical Specifications.
Proceedings of the Fundamental Problems in Computing, 2013

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.
Proceedings of the Fundamental Problems in Computing, 2013

2011
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems.
Theor. Comput. Sci., 2011

2009
Complexity Classes in Optimization.
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].
Theor. Comput. Sci., 2008

A Transformation--Based Approach for the Design of Parallel/Distributed Scientific Software: the FFT
CoRR, 2008

2007
Predecessor existence problems for finite discrete dynamical systems.
Theor. Comput. Sci., 2007

Computational Aspects of Analyzing Social Network Dynamics.
Proceedings of the IJCAI 2007, 2007

2006
On minimizing materializations of array-valued temporaries.
ACM Trans. Program. Lang. Syst., 2006

Complexity of reachability problems for finite discrete dynamical systems.
J. Comput. Syst. Sci., 2006

2005
Resource Bounds and Subproblem Independence.
Theory Comput. Syst., 2005

2003
Reachability problems for sequential dynamical systems with threshold functions.
Theor. Comput. Sci., 2003

Predecessor and Permutation Existence Problems for Sequential Dynamical Systems.
Proceedings of the Discrete Models for Complex Systems, 2003

2002
Exploiting structure in quantified formulas.
J. Algorithms, 2002

Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems.
Inf. Comput., 2002

2001
Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems.
Electronic Notes in Discrete Mathematics, 2001

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

Analysis Problems for Sequential Dynamical Systems and Communicating State Machines.
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.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

Gardens of Eden and Fixed Points in Sequential Dynamical Systems.
Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

2000
On Materializations of Array-Valued Temporaries.
Proceedings of the Languages and Compilers for Parallel Computing, 2000

1999
Experimental Construction of a Fine-Grained Polyalgorithm for the FFT.
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.
SIAM J. Comput., 1998

The Complexity of Planar Counting Problems.
SIAM J. Comput., 1998

Bicriteria Network Design Problems.
J. Algorithms, 1998

NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs.
J. Algorithms, 1998

Bicriteria Network Design Problems
CoRR, 1998

Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
CoRR, 1998

The Complexity of Planar Counting Problems
CoRR, 1998

Theory of Periodically Specified Problems: Complexity and Approximability.
Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997
Hierarchically Specified Unit Disk Graphs.
Theor. Comput. Sci., 1997

1996
An Algebraic Model for Combinatorial Problems.
SIAM J. Comput., 1996

Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs.
Discrete Applied Mathematics, 1996

I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract).
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).
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.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996

Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996

HORNSAT, Model Checking, Verification and games (Extended Abstract).
Proceedings of the Computer Aided Verification, 8th International Conference, 1996

1995
On the Size of Binary Decision Diagrams Representing Boolean Functions.
Theor. Comput. Sci., 1995

Simple heuristics for unit disk graphs.
Networks, 1995

Bicriteria Network Design Problems.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994
The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications.
Nord. J. Comput., 1994

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

Geometry based heuristics for unit disk graphs.
CoRR, 1994

Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version).
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Approximation Schemes Using L-Reductions.
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.
Proceedings of the Algorithms, 1994

Generalized CNF Satisfiability Problems and Non-Efficient.
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993
The Complexity of Processing Hierarchical Specifications.
SIAM J. Comput., 1993

Hierarchical Specified Unit Disk Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Many birds with one stone: multi-objective approximation algorithms.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs.
Proceedings of the Computing and Information, 1993

The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
Efficient Algorithms for Solving Systems of Linear Equations and Path Problems.
Proceedings of the STACS 92, 1992

The Complexity of STructural Containment and Equivalence.
Proceedings of the Theoretical Studies in Computer Science, 1992

1991
Compaction of Message Patterns into Succinct Representations for Multiprocessor Interconnection Networks.
J. Parallel Distrib. Comput., 1991

1990
On Computing Signal Probability and Detection Probability of Stuck-at Faults.
IEEE Trans. Computers, 1990

The Complexity of Very Simple Boolean Formulas with Applications.
SIAM J. Comput., 1990

Power Indices and Easier Hard Problems.
Mathematical Systems Theory, 1990

The Complexity of Equivalence for Commutative Rings.
J. Symb. Comput., 1990

1989
The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits.
IEEE Trans. Computers, 1989

A Note on Detecting Sneak Paths in Transistor Networks.
IEEE Trans. Computers, 1989

Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks.
Proceedings of the International Conference on Parallel Processing, 1989

1988
Matrix Multiplication for Finite Algebraic Systems.
Inf. Process. Lett., 1988

On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report).
Proceedings of the Applied Algebra, 1988

1987
Efficient Algorithms for Automatic Construction and Compactification of Parsing Grammars.
ACM Trans. Program. Lang. Syst., 1987

Nonlinear Algebra and Optimization on Rings are "Hard".
SIAM J. Comput., 1987

On the Computational Complexity of Algebra on Lattices.
SIAM J. Comput., 1987

An Application of the Planar Separator Theorem to Counting Problems.
Inf. Process. Lett., 1987

1986
Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze.
SIAM J. Comput., 1986

Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report).
Proceedings of the STACS 86, 1986

On the Computation of Detection Probability for Multiple Faults.
Proceedings of the Proceedings International Test Conference 1986, 1986

1985
Testing for Grammatical Coverings.
Theor. Comput. Sci., 1985

On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata.
SIAM J. Comput., 1985

1984
The Complexity of Monadic Recursion Schemes: Exponential Time Bounds.
J. Comput. Syst. Sci., 1984

Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes.
J. ACM, 1984

Algebraic Structures with Hard Equivalence and Minimization Problems.
J. ACM, 1984

1983
The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications.
Theor. Comput. Sci., 1983

1982
On the Decidability of Grammar Problems.
J. ACM, 1982

On the Complexity of Flowchart and Loop Program Schemes and Programming Languages.
J. ACM, 1982

1981
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
On the Computational Complexity of Program Scheme Equivalence.
SIAM J. Comput., 1980

Processing Conjunctive Predicates and Queries.
Proceedings of the Sixth International Conference on Very Large Data Bases, 1980

Efficient Algorithms for Structural Similarity of Grammars.
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)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979
Observations on the Complexity of Regular Expression Problems.
J. Comput. Syst. Sci., 1979

The Complexity of Testing Predicate Locks.
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.
SIAM J. Comput., 1978

Computational Parallels Between the Regular and Context-Free Languages.
SIAM J. Comput., 1978

Corrigendum: "Lower Bounds and Reductions Between Grammar Problems".
J. ACM, 1978

Lower Bounds and Reductions Between Grammar Problems.
J. ACM, 1978

1977
Economy of Description by Parsers, DPDA'S, and PDA'S.
Theor. Comput. Sci., 1977

On Equivalence and Containment Problems for Formal Languages.
J. ACM, 1977

Operations on Sparse Relations.
Commun. ACM, 1977

1976
The Covering Problem for Linear Context-Free Grammars.
Theor. Comput. Sci., 1976

On the Complexity of Finite, Pushdown, and Stack Automata.
Mathematical Systems Theory, 1976

Complexity Metatheorems for Context-Free Grammar Problems.
J. Comput. Syst. Sci., 1976

On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages.
J. Comput. Syst. Sci., 1976

Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract)
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

A Complexity Theory of Grammar Problems.
Proceedings of the Conference Record of the Third ACM Symposium on Principles of Programming Languages, 1976

1975
On the Complexity of LR(k) Testing.
Commun. ACM, 1975

On the Complexity of Grammar and Related Problems
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

On the Complexity of LR(k) Testing.
Proceedings of the Conference Record of the Second ACM Symposium on Principles of Programming Languages, 1975

Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract)
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

Economy of Descriptions by Parsers, DPDA's, and PDA's
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1974
Computational Parallels between the Regular and Context-Free Languages
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract)
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1973
On the Time and Tape Complexity of Languages I
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973


  Loading...