Stop the war!Остановите войну!
for scientists:
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
- [c43]Richard Edwin Stearns, Harry B. Hunt III:
Sums-of-Products and Subproblem Independence. Fundamental Problems in Computing 2013: 301-325 - 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) - 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) - [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- - 2005
- [j52]Richard Edwin Stearns, Harry B. Hunt III:
Resource Bounds and Subproblem Independence. Theory Comput. Syst. 38(6): 731-761 (2005) - 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) - [j49]Richard Edwin Stearns, Harry B. Hunt III:
Exploiting structure in quantified formulas. J. Algorithms 43(2): 220-263 (2002) - 2001
- [j47]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: 217-230 (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 - [c39]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 - [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 - 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) - [j44]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) - [j43]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) - [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- - [i5]Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns:
The Complexity of Planar Counting Problems. CoRR cs.CC/9809017 (1998) - [i4]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) - 1996
- [j40]Richard Edwin Stearns, Harry B. Hunt III:
An Algebraic Model for Combinatorial Problems. SIAM J. Comput. 25(2): 448-476 (1996) - [c33]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: 225-259 - [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 - 1994
- [c28]Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns:
Generalized CNF Satisfiability Problems and Non-Efficient. SCT 1994: 356-366 - [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 - [c25]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 - 1992
- [c19]Venkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns:
Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. STACS 1992: 109-119 - 1990
- [j34]Harry B. Hunt III, Richard Edwin Stearns:
The Complexity of Equivalence for Commutative Rings. J. Symb. Comput. 10(5): 411-436 (1990) - [j33]Richard Edwin Stearns, Harry B. Hunt III:
Power Indices and Easier Hard Problems. Math. Syst. Theory 23(4): 209-225 (1990) - [j32]Harry B. Hunt III, Richard Edwin Stearns:
The Complexity of Very Simple Boolean Formulas with Applications. SIAM J. Comput. 19(1): 44-70 (1990) - 1988
- [c17]Harry B. Hunt III, Richard Edwin Stearns:
On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report). AAECC 1988: 250-258 - 1987
- [j25]Harry B. Hunt III, Richard Edwin Stearns:
Nonlinear Algebra and Optimization on Rings are "Hard". SIAM J. Comput. 16(5): 910-929 (1987) - 1986
- [c15]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 - 1985
- [j22]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) - 1981
- [c14]Richard Edwin Stearns, Harry B. Hunt III:
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata. FOCS 1981: 74-81
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 2023-09-28 02:37 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:
