Harry B. Hunt III - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 105

2015

Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph PredicatesDaniel J. Rosenkrantz, Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi, Richard Edwin Stearns. atal 2015: 1501-1509 [doi]

2013

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design ProblemsR. Ravi 0001, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. BIRTHDAY 2009: 241-266 [doi]

The Complexity of Processing Hierarchical SpecificationsDaniel J. Rosenkrantz, Harry B. Hunt III. BIRTHDAY 2009: 209-240 [doi]

Sums-of-Products and Subproblem IndependenceRichard Edwin Stearns, Harry B. Hunt III. BIRTHDAY 2009: 301-325 [doi]

2011

Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systemsChristopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. TCS, 412(30):3932-3946, 2011. [doi]

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. TCS, 395(1):132-133, 2008. [doi]

2007

2006

Complexity of reachability problems for finite discrete dynamical systemsChristopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. jcss, 72(8):1317-1345, 2006. [doi]

Towards a Predictive Computational Complexity TheoryHarry B. Hunt III, Madhav V. Marathe, Daniel J. Rosenkrantz, Richard Edwin Stearns. In Allon G. Percus, Gabriel Istrate, Cristopher Moore, editors, Computational Complexity and Statistical Physics. Studies in the sciences of complexity, pages 285, Oxford University Press, 2006.

On minimizing materializations of array-valued temporariesDaniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III. TOPLAS, 28(6):1145-1177, 2006. [doi]

2005

Resource Bounds and Subproblem IndependenceRichard Edwin Stearns, Harry B. Hunt III. mst, 38(6):731-761, 2005. [doi]

2003

Predecessor and Permutation Existence Problems for Sequential Dynamical SystemsChristopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. dmcs 2003: 69-80 [doi]

Reachability problems for sequential dynamical systems with threshold functionsChristopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. TCS, 295:41-64, 2003. [doi]

2002

Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization ProblemsHarry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. iandc, 173(1):40-63, 2002. [doi]

Exploiting structure in quantified formulasRichard Edwin Stearns, Harry B. Hunt III. jal, 43(2):220-263, 2002. [doi]

2001

Gardens of Eden and Fixed Points in Sequential Dynamical SystemsChristopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Predrag T. Tosic. dmccg 2001: 95-110 [doi]

Analysis Problems for Sequential Dynamical Systems and Communicating State MachinesChristopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. mfcs 2001: 159-172 [doi]

Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structuresHarry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns. issac 2001: 183-191 [doi]

Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction ProblemsHarry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns. endm, 9:217-230, 2001. [doi]

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design ProblemsR. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. algorithmica, 31(1):58-78, 2001. [doi]

2000

On Materializations of Array-Valued TemporariesDaniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III. lcpc 2001: 127-141 [doi]

1999

Experimental Construction of a Fine-Grained Polyalgorithm for the FFTHarry B. Hunt III, Lenore M. R. Mullin. pdpta 1999: 1641-1647

1998

The Complexity of Planar Counting ProblemsHarry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns. SICOMP, 27(4):1142-1167, 1998. [doi]

NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric GraphsHarry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. jal, 26(2):238-274, 1998.

Theory of Periodically Specified Problems: Complexity and ApproximabilityMadhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns. cocoon 1998: 106 [doi]

Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified ProblemsMadhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan. SICOMP, 27(5):1237-1261, 1998. [doi]

Bicriteria Network Design ProblemsMadhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. jal, 28(1):142-171, 1998.

1997

Hierarchically Specified Unit Disk GraphsMadhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi. TCS, 174(1-2):23-65, 1997. [doi]

1996

Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness resultsMadhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan. dimacs 1997: 225-260

Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc GraphsMadhav V. Marathe, Harry B. Hunt III, S. S. Ravi. DAM, 64(2):135-149, 1996. [doi]

The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approachSandeep K. Shukla, Daniel J. Rosenkrantz, Harry B. Hunt III, Richard Edwin Stearns. dimacs 1997: 603-642

HORNSAT, Model Checking, Verification and games (Extended Abstract)Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz. cav 1996: 99-110

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. icalp 1996: 466-477

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. podc 1996: 122

An Algebraic Model for Combinatorial ProblemsRichard Edwin Stearns, Harry B. Hunt III. SICOMP, 25(2):448-476, 1996.

1995

1994

Approximation Schemes Using L-ReductionsHarry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. fsttcs 1994: 342-353

A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric GraphsHarry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. esa 1994: 424-435

Generalized CNF Satisfiability Problems and Non-EfficientHarry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns. cocoon 1994: 356-366

Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan. stoc 1994: 468-477 [doi]

The Complexity of Approximation PSPACE-Complete Problems for Hierarchical SpecificationsMadhav V. Marathe, Harry B. Hunt III, S. S. Ravi. njc, 1(3):275-316, 1994.

1993

1992

Efficient Algorithms for Solving Systems of Linear Equations and Path ProblemsVenkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns. STACS 1992: 109-119

The Complexity of STructural Containment and EquivalenceDaniel J. Rosenkrantz, Harry B. Hunt III. BIRTHDAY 1992: 101-132

1991

Compaction of Message Patterns into Succinct Representations for Multiprocessor Interconnection NetworksPhilip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz. jpdc, 12(1):39-49, 1991.

1990

On Computing Signal Probability and Detection Probability of Stuck-at FaultsSreejit Chakravarty, Harry B. Hunt III. TC, 39(11):1369-1377, 1990.

The Complexity of Very Simple Boolean Formulas with ApplicationsHarry B. Hunt III, Richard Edwin Stearns. SICOMP, 19(1):44-70, 1990.

The Complexity of Equivalence for Commutative RingsHarry B. Hunt III, Richard Edwin Stearns. JSC, 10(5):411-436, 1990.

Power Indices and Easier Hard ProblemsRichard Edwin Stearns, Harry B. Hunt III. mst, 23(4):209-225, 1990.

1989

Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection NetworksPhilip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz. icpp 1989: 111-115

A Note on Detecting Sneak Paths in Transistor NetworksSreejit Chakravarty, Harry B. Hunt III. TC, 38(6):861-864, 1989.

The Complexity of Generating Minimum Test Sets for PLA s and Monotone Combinational CircuitsSreejit Chakravarty, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz. TC, 38(6):865-869, 1989.

1988

On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report)Harry B. Hunt III, Richard Edwin Stearns. AAECC 1989: 250-258

Matrix Multiplication for Finite Algebraic SystemsDaniel J. Rosenkrantz, Harry B. Hunt III. ipl, 28(4):189-192, 1988.

1987

On the Computational Complexity of Algebra on LatticesHarry B. Hunt III, Daniel J. Rosenkrantz, Peter A. Bloniarz. SICOMP, 16(1):129-148, 1987.

Nonlinear Algebra and Optimization on Rings are Hard Harry B. Hunt III, Richard Edwin Stearns. SICOMP, 16(5):910-929, 1987.

An Application of the Planar Separator Theorem to Counting ProblemsS. S. Ravi, Harry B. Hunt III. ipl, 25(5):317-322, 1987.

Efficient Algorithms for Automatic Construction and Compactification of Parsing GrammarsDaniel J. Rosenkrantz, Harry B. Hunt III. TOPLAS, 9(4):543-566, 1987. [doi]

1986

On the Computation of Detection Probability for Multiple FaultsSreejit Chakravarty, Harry B. Hunt III. itc 1986: 252-262

Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report)Harry B. Hunt III, Richard Edwin Stearns. STACS 1986: 277-290

Recursion Schemes and Recursive Programs are Exponentially Hard to AnalyzeHarry B. Hunt III, Daniel J. Rosenkrantz. SICOMP, 15(3):831-850, 1986.

1985

Testing for Grammatical CoveringsDaniel J. Rosenkrantz, Harry B. Hunt III. TCS, 38:323-341, 1985.

On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite AutomataRichard Edwin Stearns, Harry B. Hunt III. SICOMP, 14(3):598-611, 1985.

1984

Algebraic Structures with Hard Equivalence and Minimization ProblemsPeter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz. JACM, 31(4):879-904, 1984. [doi]

Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program SchemesHarry B. Hunt III. JACM, 31(2):299-318, 1984. [doi]

The Complexity of Monadic Recursion Schemes: Exponential Time BoundsHarry B. Hunt III, Daniel J. Rosenkrantz. jcss, 28(3):395-419, 1984.

1983

The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and ApplicationsHarry B. Hunt III, Daniel J. Rosenkrantz. TCS, 27:3-38, 1983.

1982

On the Decidability of Grammar ProblemsHarry B. Hunt III. JACM, 29(2):429-447, 1982. [doi]

On the Complexity of Flowchart and Loop Program Schemes and Programming LanguagesHarry B. Hunt III. JACM, 29(1):228-249, 1982. [doi]

1981

On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and AutomataRichard Edwin Stearns, Harry B. Hunt III. focs 1981: 74-81

1980

On the Computational Complexity of Program Scheme EquivalenceHarry B. Hunt III, Robert L. Constable, Sartaj Sahni. SICOMP, 9(2):396-416, 1980.

The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract)Harry B. Hunt III, Daniel J. Rosenkrantz. focs 1980: 152-160

Efficient Algorithms for Structural Similarity of GrammarsHarry B. Hunt III, Daniel J. Rosenkrantz. POPL 1980: 213-219

Processing Conjunctive Predicates and QueriesDaniel J. Rosenkrantz, Harry B. Hunt III. VLDB 1980: 64-72 [doi]

1979

Observations on the Complexity of Regular Expression ProblemsHarry B. Hunt III. jcss, 19(3):222-236, 1979.

The Complexity of Testing Predicate LocksHarry B. Hunt III, Daniel J. Rosenkrantz. SIGMOD 1979: 127-133 [doi]

1978

Lower Bounds and Reductions Between Grammar ProblemsHarry B. Hunt III, Thomas G. Szymanski. JACM, 25(1):32-51, 1978. [doi]

Corrigendum: Lower Bounds and Reductions Between Grammar Problems Harry B. Hunt III, Thomas G. Szymanski. JACM, 25(4):687-688, 1978. [doi]

Computational Parallels Between the Regular and Context-Free LanguagesHarry B. Hunt III, Daniel J. Rosenkrantz. SICOMP, 7(1):99-114, 1978.

Polynomial Algorithms for Deterministic Pushdown AutomataDaniel J. Rosenkrantz, Harry B. Hunt III. SICOMP, 7(4):405-412, 1978.

1977

Economy of Description by Parsers, DPDA S, and PDA SMatthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman. TCS, 4(2):143-153, 1977.

Operations on Sparse RelationsHarry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman. CACM, 20(3):171-176, 1977.

On Equivalence and Containment Problems for Formal LanguagesHarry B. Hunt III, Daniel J. Rosenkrantz. JACM, 24(3):387-396, 1977. [doi]

1976

1975

Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract)Harry B. Hunt III, J. L. Rangel. focs 1975: 144-150

On the Complexity of Grammar and Related ProblemsHarry B. Hunt III, Thomas G. Szymanski. stoc 1975: 54-65

On the Complexity of LR(k) TestingHarry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman. CACM, 18(12):707-716, 1975.

On the Complexity of LR(k) TestingHarry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman. POPL 1975: 130-136

Sign in or sign up to see more results.

runs on WebDSL