default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarry B. Hunt III
- > Home > Persons > Harry B. Hunt III
Publications
- 2015
[c46]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: 1501-1509- 2013
- [c45]Daniel J. Rosenkrantz, Harry B. Hunt III:
The Complexity of Processing Hierarchical Specifications. Fundamental Problems in Computing 2013: 209-240 - [c44]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: 241-266 - 2011
- [j57]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): 3932-3946 (2011) - 2008
- [j56]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) - [i6]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) - 2007
- [j55]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) - [c42]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 - 2006
- [j54]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) - [j53]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) - [p1]Harry B. Hunt III, Madhav V. Marathe, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Towards a Predictive Computational Complexity Theory. Computational Complexity and Statistical Physics 2006: 285- - 2003
- [j51]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) - [c41]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 - 2002
- [j50]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) - 2001
- [j48]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) - [c40]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 - [c38]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 - 2000
- [c37]Daniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III:
On Materializations of Array-Valued Temporaries. LCPC 2000: 127-141 - 1998
- [j46]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) - [j45]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) - [c35]Madhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Theory of Periodically Specified Problems: Complexity and Approximability. CCC 1998: 106- - [i3]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) - 1996
- [c34]Sandeep K. Shukla
, Harry B. Hunt III, Daniel J. Rosenkrantz:
HORNSAT, Model Checking, Verification and games (Extended Abstract). CAV 1996: 99-110 - [c32]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: 603-641 - [c31]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 - [c30]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 - 1995
- [j39]Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz:
Simple heuristics for unit disk graphs. Networks 25(2): 59-68 (1995) - [j38]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) - [c29]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 - 1994
- [c27]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 - [c26]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 - [i1]Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz:
Geometry based heuristics for unit disk graphs. CoRR abs/math/9409226 (1994) - 1993
- [j36]Daniel J. Rosenkrantz, Harry B. Hunt III:
The Complexity of Processing Hierarchical Specifications. SIAM J. Comput. 22(3): 627-649 (1993) - [c22]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 - 1992
- [c20]Daniel J. Rosenkrantz, Harry B. Hunt III:
The Complexity of STructural Containment and Equivalence. Theoretical Studies in Computer Science 1992: 101-132 - 1991
- [j35]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): 39-49 (1991) - 1989
- [j29]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) - [c18]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 - 1988
- [j28]Daniel J. Rosenkrantz, Harry B. Hunt III:
Matrix Multiplication for Finite Algebraic Systems. Inf. Process. Lett. 28(4): 189-192 (1988) - 1987
- [j26]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) - [j24]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) - 1986
- [j23]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
- [j21]Daniel J. Rosenkrantz, Harry B. Hunt III:
Testing for Grammatical Coverings. Theor. Comput. Sci. 38: 323-341 (1985) - 1984
- [j19]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) - [j18]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
- [j17]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) - 1980
- [c13]Harry B. Hunt III, Daniel J. Rosenkrantz:
The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract). FOCS 1980: 152-160 - [c12]Harry B. Hunt III, Daniel J. Rosenkrantz:
Efficient Algorithms for Structural Similarity of Grammars. POPL 1980: 213-219 - [c11]Daniel J. Rosenkrantz, Harry B. Hunt III:
Processing Conjunctive Predicates and Queries. VLDB 1980: 64-72 - 1979
- [c10]Harry B. Hunt III, Daniel J. Rosenkrantz:
The Complexity of Testing Predicate Locks. SIGMOD Conference 1979: 127-133 - 1978
- [j10]Harry B. Hunt III, Daniel J. Rosenkrantz:
Computational Parallels Between the Regular and Context-Free Languages. SIAM J. Comput. 7(1): 99-114 (1978) - [j9]Daniel J. Rosenkrantz, Harry B. Hunt III:
Polynomial Algorithms for Deterministic Pushdown Automata. SIAM J. Comput. 7(4): 405-412 (1978) - 1977
- [j7]Harry B. Hunt III, Daniel J. Rosenkrantz:
On Equivalence and Containment Problems for Formal Languages. J. ACM 24(3): 387-396 (1977) - 1976
- [j5]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) - [j2]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) - 1974
- [c2]Harry B. Hunt III, Daniel J. Rosenkrantz:
Computational Parallels between the Regular and Context-Free Languages. STOC 1974: 64-74
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-29 22:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
