| 2009 |
|---|
| 100 | EE | Harry B. Hunt III:
Complexity Classes in Optimization.
Encyclopedia of Optimization 2009: 413-419 |
| 2008 |
|---|
| 99 | EE | 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 abs/0811.2535: (2008) |
| 98 | EE | 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): 132-133 (2008) |
| 2007 |
|---|
| 97 | EE | 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: 2268-2273 |
| 96 | EE | 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): 3-37 (2007) |
| 2006 |
|---|
| 95 | EE | 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): 1145-1177 (2006) |
| 94 | EE | 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): 1317-1345 (2006) |
| 2005 |
|---|
| 93 | EE | Richard Edwin Stearns,
Harry B. Hunt III:
Resource Bounds and Subproblem Independence.
Theory Comput. Syst. 38(6): 731-761 (2005) |
| 2003 |
|---|
| 92 | EE | 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: 69-80 |
| 91 | EE | 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: 41-64 (2003) |
| 2002 |
|---|
| 90 | EE | 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): 40-63 (2002) |
| 89 | EE | Richard Edwin Stearns,
Harry B. Hunt III:
Exploiting structure in quantified formulas.
J. Algorithms 43(2): 220-263 (2002) |
| 2001 |
|---|
| 88 | EE | 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: 95-110 |
| 87 | EE | 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: 183-191 |
| 86 | EE | 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: 159-172 |
| 85 | EE | 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): 58-78 (2001) |
| 84 | EE | Harry B. Hunt III,
Madhav V. Marathe,
Richard Edwin Stearns:
Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems.
Electronic Notes in Discrete Mathematics 9: 217-230 (2001) |
| 2000 |
|---|
| 83 | EE | Daniel J. Rosenkrantz,
Lenore M. R. Mullin,
Harry B. Hunt III:
On Materializations of Array-Valued Temporaries.
LCPC 2000: 127-141 |
| 1999 |
|---|
| 82 | | Harry B. Hunt III,
Lenore M. R. Mullin:
Experimental Construction of a Fine-Grained Polyalgorithm for the FFT.
PDPTA 1999: 1641-1647 |
| 1998 |
|---|
| 81 | EE | Madhav V. Marathe,
Harry B. Hunt III,
Daniel J. Rosenkrantz,
Richard Edwin Stearns:
Theory of Periodically Specified Problems: Complexity and Approximability.
IEEE Conference on Computational Complexity 1998: 106- |
| 80 | EE | Harry B. Hunt III,
Madhav V. Marathe,
Venkatesh Radhakrishnan,
Richard Edwin Stearns:
The Complexity of Planar Counting Problems
CoRR cs.CC/9809017: (1998) |
| 79 | EE | Madhav V. Marathe,
Harry B. Hunt III,
Richard Edwin Stearns,
Venkatesh Radhakrishnan:
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
CoRR cs.CC/9809064: (1998) |
| 78 | EE | Madhav V. Marathe,
R. Ravi,
Ravi Sundaram,
S. S. Ravi,
Daniel J. Rosenkrantz,
Harry B. Hunt III:
Bicriteria Network Design Problems
CoRR cs.CC/9809103: (1998) |
| 77 | | 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): 238-274 (1998) |
| 76 | | 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): 142-171 (1998) |
| 75 | EE | Harry B. Hunt III,
Madhav V. Marathe,
Venkatesh Radhakrishnan,
Richard Edwin Stearns:
The Complexity of Planar Counting Problems.
SIAM J. Comput. 27(4): 1142-1167 (1998) |
| 74 | EE | 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): 1237-1261 (1998) |
| 1997 |
|---|
| 73 | EE | Madhav V. Marathe,
Venkatesh Radhakrishnan,
Harry B. Hunt III,
S. S. Ravi:
Hierarchically Specified Unit Disk Graphs.
Theor. Comput. Sci. 174(1-2): 23-65 (1997) |
| 1996 |
|---|
| 72 | | Sandeep K. Shukla,
Harry B. Hunt III,
Daniel J. Rosenkrantz:
HORNSAT, Model Checking, Verification and games (Extended Abstract).
CAV 1996: 99-110 |
| 71 | | 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: 466-477 |
| 70 | | 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: 122 |
| 69 | EE | Madhav V. Marathe,
Harry B. Hunt III,
S. S. Ravi:
Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs.
Discrete Applied Mathematics 64(2): 135-149 (1996) |
| 68 | | Richard Edwin Stearns,
Harry B. Hunt III:
An Algebraic Model for Combinatorial Problems.
SIAM J. Comput. 25(2): 448-476 (1996) |
| 1995 |
|---|
| 67 | | Madhav V. Marathe,
R. Ravi,
Ravi Sundaram,
S. S. Ravi,
Daniel J. Rosenkrantz,
Harry B. Hunt III:
Bicriteria Network Design Problems.
ICALP 1995: 487-498 |
| 66 | EE | 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): 45-69 (1995) |
| 1994 |
|---|
| 65 | | 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: 424-435 |
| 64 | | 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: 342-353 |
| 63 | EE | 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: 468-477 |
| 62 | | Harry B. Hunt III,
Madhav V. Marathe,
Richard Edwin Stearns:
Generalized CNF Satisfiability Problems and Non-Efficient.
Structure in Complexity Theory Conference 1994: 356-366 |
| 61 | | 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): 275-316 (1994) |
| 1993 |
|---|
| 60 | | Madhav V. Marathe,
Harry B. Hunt III,
S. S. Ravi:
The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract).
ICALP 1993: 76-87 |
| 59 | | 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: 26-30 |
| 58 | EE | 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: 438-447 |
| 57 | | Madhav V. Marathe,
Venkatesh Radhakrishnan,
Harry B. Hunt III,
S. S. Ravi:
Hierarchical Specified Unit Disk Graphs (Extended Abstract).
WG 1993: 21-32 |
| 56 | | Daniel J. Rosenkrantz,
Harry B. Hunt III:
The Complexity of Processing Hierarchical Specifications.
SIAM J. Comput. 22(3): 627-649 (1993) |
| 1992 |
|---|
| 55 | | Venkatesh Radhakrishnan,
Harry B. Hunt III,
Richard Edwin Stearns:
Efficient Algorithms for Solving Systems of Linear Equations and Path Problems.
STACS 1992: 109-119 |
| 54 | | Daniel J. Rosenkrantz,
Harry B. Hunt III:
The Complexity of STructural Containment and Equivalence.
Theoretical Studies in Computer Science 1992: 101-132 |
| 1991 |
|---|
| 53 | | Philip J. Bernhard,
Harry B. Hunt III,
Daniel J. Rosenkrantz:
Compaction of Message Patterns into Succinct Representations for Multiprocessor Interconnection Networks.
J. Parallel Distrib. Comput. 12(1): 39-49 (1991) |
| 1990 |
|---|
| 52 | | Sreejit Chakravarty,
Harry B. Hunt III:
On Computing Signal Probability and Detection Probability of Stuck-at Faults.
IEEE Trans. Computers 39(11): 1369-1377 (1990) |
| 51 | | Harry B. Hunt III,
Richard Edwin Stearns:
The Complexity of Equivalence for Commutative Rings.
J. Symb. Comput. 10(5): 411-436 (1990) |
| 50 | | Richard Edwin Stearns,
Harry B. Hunt III:
Power Indices and Easier Hard Problems.
Mathematical Systems Theory 23(4): 209-225 (1990) |
| 49 | | Harry B. Hunt III,
Richard Edwin Stearns:
The Complexity of Very Simple Boolean Formulas with Applications.
SIAM J. Comput. 19(1): 44-70 (1990) |
| 1989 |
|---|
| 48 | | 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: 111-115 |
| 47 | | Sreejit Chakravarty,
Harry B. Hunt III:
A Note on Detecting Sneak Paths in Transistor Networks.
IEEE Trans. Computers 38(6): 861-864 (1989) |
| 46 | | 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): 865-869 (1989) |
| 1988 |
|---|
| 45 | | Harry B. Hunt III,
Richard Edwin Stearns:
On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report).
AAECC 1988: 250-258 |
| 44 | | Daniel J. Rosenkrantz,
Harry B. Hunt III:
Matrix Multiplication for Finite Algebraic Systems.
Inf. Process. Lett. 28(4): 189-192 (1988) |
| 1987 |
|---|
| 43 | EE | Daniel J. Rosenkrantz,
Harry B. Hunt III:
Efficient Algorithms for Automatic Construction and Compactification of Parsing Grammars.
ACM Trans. Program. Lang. Syst. 9(4): 543-566 (1987) |
| 42 | | S. S. Ravi,
Harry B. Hunt III:
An Application of the Planar Separator Theorem to Counting Problems.
Inf. Process. Lett. 25(5): 317-322 (1987) |
| 41 | | Harry B. Hunt III,
Daniel J. Rosenkrantz,
Peter A. Bloniarz:
On the Computational Complexity of Algebra on Lattices.
SIAM J. Comput. 16(1): 129-148 (1987) |
| 40 | | Harry B. Hunt III,
Richard Edwin Stearns:
Nonlinear Algebra and Optimization on Rings are ``Hard''.
SIAM J. Comput. 16(5): 910-929 (1987) |
| 1986 |
|---|
| 39 | | Sreejit Chakravarty,
Harry B. Hunt III:
On the Computation of Detection Probability for Multiple Faults.
ITC 1986: 252-262 |
| 38 | | 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: 277-290 |
| 37 | | Harry B. Hunt III,
Daniel J. Rosenkrantz:
Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze.
SIAM J. Comput. 15(3): 831-850 (1986) |
| 1985 |
|---|
| 36 | | 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): 598-611 (1985) |
| 35 | | Daniel J. Rosenkrantz,
Harry B. Hunt III:
Testing for Grammatical Coverings.
Theor. Comput. Sci. 38: 323-341 (1985) |
| 1984 |
|---|
| 34 | EE | 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): 299-318 (1984) |
| 33 | EE | Peter A. Bloniarz,
Harry B. Hunt III,
Daniel J. Rosenkrantz:
Algebraic Structures with Hard Equivalence and Minimization Problems.
J. ACM 31(4): 879-904 (1984) |
| 32 | | Harry B. Hunt III,
Daniel J. Rosenkrantz:
The Complexity of Monadic Recursion Schemes: Exponential Time Bounds.
J. Comput. Syst. Sci. 28(3): 395-419 (1984) |
| 1983 |
|---|
| 31 | | Harry B. Hunt III,
Daniel J. Rosenkrantz:
The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications.
Theor. Comput. Sci. 27: 3-38 (1983) |
| 1982 |
|---|
| 30 | EE | Harry B. Hunt III:
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages.
J. ACM 29(1): 228-249 (1982) |
| 29 | EE | Harry B. Hunt III:
On the Decidability of Grammar Problems.
J. ACM 29(2): 429-447 (1982) |
| 1981 |
|---|
| 28 | | Richard Edwin Stearns,
Harry B. Hunt III:
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata
FOCS 1981: 74-81 |
| 1980 |
|---|
| 27 | | Harry B. Hunt III,
Daniel J. Rosenkrantz:
The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract)
FOCS 1980: 152-160 |
| 26 | | Harry B. Hunt III,
Daniel J. Rosenkrantz:
Efficient Algorithms for Structural Similarity of Grammars.
POPL 1980: 213-219 |
| 25 | EE | Daniel J. Rosenkrantz,
Harry B. Hunt III:
Processing Conjunctive Predicates and Queries.
VLDB 1980: 64-72 |
| 24 | | Harry B. Hunt III,
Robert L. Constable,
Sartaj Sahni:
On the Computational Complexity of Program Scheme Equivalence.
SIAM J. Comput. 9(2): 396-416 (1980) |
| 1979 |
|---|
| 23 | EE | Harry B. Hunt III,
Daniel J. Rosenkrantz:
The Complexity of Testing Predicate Locks.
SIGMOD Conference 1979: 127-133 |
| 22 | | Harry B. Hunt III:
Observations on the Complexity of Regular Expression Problems.
J. Comput. Syst. Sci. 19(3): 222-236 (1979) |
| 1978 |
|---|
| 21 | EE | Harry B. Hunt III,
Thomas G. Szymanski:
Lower Bounds and Reductions Between Grammar Problems.
J. ACM 25(1): 32-51 (1978) |
| 20 | EE | Harry B. Hunt III,
Thomas G. Szymanski:
Corrigendum: ``Lower Bounds and Reductions Between Grammar Problems''.
J. ACM 25(4): 687-688 (1978) |
| 19 | | Harry B. Hunt III,
Daniel J. Rosenkrantz:
Computational Parallels Between the Regular and Context-Free Languages.
SIAM J. Comput. 7(1): 99-114 (1978) |
| 18 | | Daniel J. Rosenkrantz,
Harry B. Hunt III:
Polynomial Algorithms for Deterministic Pushdown Automata.
SIAM J. Comput. 7(4): 405-412 (1978) |
| 1977 |
|---|
| 17 | | Harry B. Hunt III,
Thomas G. Szymanski,
Jeffrey D. Ullman:
Operations on Sparse Relations.
Commun. ACM 20(3): 171-176 (1977) |
| 16 | EE | Harry B. Hunt III,
Daniel J. Rosenkrantz:
On Equivalence and Containment Problems for Formal Languages.
J. ACM 24(3): 387-396 (1977) |
| 15 | | 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): 143-153 (1977) |
| 1976 |
|---|
| 14 | | Harry B. Hunt III:
A Complexity Theory of Grammar Problems.
POPL 1976: 12-18 |
| 13 | | Harry B. Hunt III,
Thomas G. Szymanski:
Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract)
STOC 1976: 126-134 |
| 12 | | 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): 222-268 (1976) |
| 11 | | Harry B. Hunt III,
Thomas G. Szymanski:
Complexity Metatheorems for Context-Free Grammar Problems.
J. Comput. Syst. Sci. 13(3): 318-334 (1976) |
| 10 | | Harry B. Hunt III:
On the Complexity of Finite, Pushdown, and Stack Automata.
Mathematical Systems Theory 10: 33-52 (1976) |
| 9 | | Harry B. Hunt III,
Daniel J. Rosenkrantz,
Thomas G. Szymanski:
The Covering Problem for Linear Context-Free Grammars.
Theor. Comput. Sci. 2(3): 361-382 (1976) |
| 1975 |
|---|
| 8 | | Matthew M. Geller,
Harry B. Hunt III,
Thomas G. Szymanski,
Jeffrey D. Ullman:
Economy of Descriptions by Parsers, DPDA's, and PDA's
FOCS 1975: 122-127 |
| 7 | | Harry B. Hunt III,
J. L. Rangel:
Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract)
FOCS 1975: 144-150 |
| 6 | | Harry B. Hunt III,
Thomas G. Szymanski,
Jeffrey D. Ullman:
On the Complexity of LR(k) Testing.
POPL 1975: 130-136 |
| 5 | | Harry B. Hunt III,
Thomas G. Szymanski:
On the Complexity of Grammar and Related Problems
STOC 1975: 54-65 |
| 4 | | Harry B. Hunt III,
Thomas G. Szymanski,
Jeffrey D. Ullman:
On the Complexity of LR(k) Testing.
Commun. ACM 18(12): 707-716 (1975) |
| 1974 |
|---|
| 3 | | Harry B. Hunt III,
Thomas G. Szymanski,
Jeffrey D. Ullman:
Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract)
FOCS 1974: 127-132 |
| 2 | | Harry B. Hunt III,
Daniel J. Rosenkrantz:
Computational Parallels between the Regular and Context-Free Languages
STOC 1974: 64-74 |
| 1973 |
|---|
| 1 | | Harry B. Hunt III:
On the Time and Tape Complexity of Languages I
STOC 1973: 10-19 |
