default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarry B. Hunt III
Person information
- affiliation: University at Albany, SUNY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j58]Jingnan Xie, Harry B. Hunt III, Richard Edwin Stearns:
Pumping Lemmas Can be "Harmful". Theory Comput. Syst. 68(5): 1339-1352 (2024)
2010 – 2019
- 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 - [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)
2000 – 2009
- 2009
- [r1]Harry B. Hunt III:
Complexity Classes in Optimization. Encyclopedia of Optimization 2009: 413-419 - 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- - 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
- [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) - [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 - 2000
- [c37]Daniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III:
On Materializations of Array-Valued Temporaries. LCPC 2000: 127-141
1990 – 1999
- 1999
- [c36]Harry B. Hunt III, Lenore M. R. Mullin:
Experimental Construction of a Fine-Grained Polyalgorithm for the FFT. PDPTA 1999: 1641-1647 - 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) - [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) - [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) - 1997
- [j42]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
- [j41]Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi:
Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs. Discret. Appl. Math. 64(2): 135-149 (1996) - [j40]Richard Edwin Stearns, Harry B. Hunt III:
An Algebraic Model for Combinatorial Problems. SIAM J. Comput. 25(2): 448-476 (1996) - [c34]Sandeep K. Shukla
, Harry B. Hunt III, Daniel J. Rosenkrantz:
HORNSAT, Model Checking, Verification and games (Extended Abstract). CAV 1996: 99-110 - [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 - 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
- [j37]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) - [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 - [i2]Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi:
The complexity of approximating PSPACE-Complete problems for hierarchical specifications. CoRR abs/math/9409225 (1994) - [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) - [c24]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 - [c23]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 - [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 - [c21]Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi:
Hierarchical Specified Unit Disk Graphs (Extended Abstract). WG 1993: 21-32 - 1992
- [c20]Daniel J. Rosenkrantz, Harry B. Hunt III:
The Complexity of STructural Containment and Equivalence. Theoretical Studies in Computer Science 1992: 101-132 - [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 - 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) - 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) - [j31]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)
1980 – 1989
- 1989
- [j30]Sreejit Chakravarty, Harry B. Hunt III:
A Note on Detecting Sneak Paths in Transistor Networks. IEEE Trans. Computers 38(6): 861-864 (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) - [c17]Harry B. Hunt III, Richard Edwin Stearns:
On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report). AAECC 1988: 250-258 - 1987
- [j27]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) - [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) - [j25]Harry B. Hunt III, Richard Edwin Stearns:
Nonlinear Algebra and Optimization on Rings are "Hard". SIAM J. Comput. 16(5): 910-929 (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) - [c16]Sreejit Chakravarty, Harry B. Hunt III:
On the Computation of Detection Probability for Multiple Faults. ITC 1986: 252-262 - [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) - [j21]Daniel J. Rosenkrantz, Harry B. Hunt III:
Testing for Grammatical Coverings. Theor. Comput. Sci. 38: 323-341 (1985) - 1984
- [j20]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) - [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) - 1982
- [j16]Harry B. Hunt III:
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages. J. ACM 29(1): 228-249 (1982) - [j15]Harry B. Hunt III:
On the Decidability of Grammar Problems. J. ACM 29(2): 429-447 (1982) - 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 - 1980
- [j14]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) - [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
1970 – 1979
- 1979
- [j13]Harry B. Hunt III:
Observations on the Complexity of Regular Expression Problems. J. Comput. Syst. Sci. 19(3): 222-236 (1979) - [c10]Harry B. Hunt III, Daniel J. Rosenkrantz:
The Complexity of Testing Predicate Locks. SIGMOD Conference 1979: 127-133 - 1978
- [j12]Harry B. Hunt III, Thomas G. Szymanski:
Lower Bounds and Reductions Between Grammar Problems. J. ACM 25(1): 32-51 (1978) - [j11]Harry B. Hunt III, Thomas G. Szymanski:
Corrigendum: "Lower Bounds and Reductions Between Grammar Problems". J. ACM 25(4): 687-688 (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
- [j8]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
Operations on Sparse Relations. Commun. ACM 20(3): 171-176 (1977) - [j7]Harry B. Hunt III, Daniel J. Rosenkrantz:
On Equivalence and Containment Problems for Formal Languages. J. ACM 24(3): 387-396 (1977) - [j6]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
- [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) - [j4]Harry B. Hunt III, Thomas G. Szymanski:
Complexity Metatheorems for Context-Free Grammar Problems. J. Comput. Syst. Sci. 13(3): 318-334 (1976) - [j3]Harry B. Hunt III:
On the Complexity of Finite, Pushdown, and Stack Automata. Math. Syst. Theory 10: 33-52 (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) - [c9]Harry B. Hunt III:
A Complexity Theory of Grammar Problems. POPL 1976: 12-18 - [c8]Harry B. Hunt III, Thomas G. Szymanski:
Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract). STOC 1976: 126-134 - 1975
- [j1]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
On the Complexity of LR(k) Testing. Commun. ACM 18(12): 707-716 (1975) - [c7]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 - [c6]Harry B. Hunt III, J. L. Rangel:
Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract). FOCS 1975: 144-150 - [c5]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
On the Complexity of LR(k) Testing. POPL 1975: 130-136 - [c4]Harry B. Hunt III, Thomas G. Szymanski:
On the Complexity of Grammar and Related Problems. STOC 1975: 54-65 - 1974
- [c3]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract). SWAT 1974: 127-132 - [c2]Harry B. Hunt III, Daniel J. Rosenkrantz:
Computational Parallels between the Regular and Context-Free Languages. STOC 1974: 64-74 - 1973
- [b1]Harry B. Hunt III:
On the Time and Tape Complexity of Languages. Cornell University, USA, 1973 - [c1]Harry B. Hunt III:
On the Time and Tape Complexity of Languages I. STOC 1973: 10-19
Coauthor Index
[c46] [c45] [c44] [j57] [j56] [i6] [j55] [c42] [j54] [j53] [p1] [j51] [c41] [j50] [j48] [c40] [c38] [c37] [j46] [j45] [c35] [i3] [c34] [c32] [c31] [c30] [j39] [j38] [c29] [c27] [c26] [i1] [j36] [c22] [c20] [j35] [j29] [c18] [j28] [j26] [j24] [j23] [j21] [j19] [j18] [j17] [c13] [c12] [c11] [c10] [j10] [j9] [j7] [j5] [j2] [c2]
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-12-10 21:41 CET 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:
