Harry B. Hunt III Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III: Complexity Classes in Optimization. Encyclopedia of Optimization 2009: 413-419
2008
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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)
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristopher 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
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristopher 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
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristopher 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
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel 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)
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristopher 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
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Edwin Stearns, Harry B. Hunt III: Resource Bounds and Subproblem Independence. Theory Comput. Syst. 38(6): 731-761 (2005)
2003
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristopher 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
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristopher 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
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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)
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Edwin Stearns, Harry B. Hunt III: Exploiting structure in quantified formulas. J. Algorithms 43(2): 220-263 (2002)
2001
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristopher 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
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristopher 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
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLR. 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)
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III: On Materializations of Array-Valued Temporaries. LCPC 2000: 127-141
1999
82no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Lenore M. R. Mullin: Experimental Construction of a Fine-Grained Polyalgorithm for the FFT. PDPTA 1999: 1641-1647
1998
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMadhav 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-
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns: The Complexity of Planar Counting Problems CoRR cs.CC/9809017: (1998)
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMadhav 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)
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMadhav 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)
77no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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)
76no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMadhav 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)
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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)
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMadhav 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
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMadhav 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
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz: HORNSAT, Model Checking, Verification and games (Extended Abstract). CAV 1996: 99-110
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSandeep 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
70no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSandeep 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
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMadhav 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)
68no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Edwin Stearns, Harry B. Hunt III: An Algebraic Model for Combinatorial Problems. SIAM J. Comput. 25(2): 448-476 (1996)
1995
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMadhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III: Bicriteria Network Design Problems. ICALP 1995: 487-498
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYuri 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
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMadhav 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
62no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns: Generalized CNF Satisfiability Problems and Non-Efficient. Structure in Complexity Theory Conference 1994: 356-366
61no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMadhav 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
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMadhav 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
59no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMadhav 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
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLR. 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
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMadhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi: Hierarchical Specified Unit Disk Graphs (Extended Abstract). WG 1993: 21-32
56no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel J. Rosenkrantz, Harry B. Hunt III: The Complexity of Processing Hierarchical Specifications. SIAM J. Comput. 22(3): 627-649 (1993)
1992
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVenkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns: Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. STACS 1992: 109-119
54no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel J. Rosenkrantz, Harry B. Hunt III: The Complexity of STructural Containment and Equivalence. Theoretical Studies in Computer Science 1992: 101-132
1991
53no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPhilip 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
52no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSreejit Chakravarty, Harry B. Hunt III: On Computing Signal Probability and Detection Probability of Stuck-at Faults. IEEE Trans. Computers 39(11): 1369-1377 (1990)
51no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Richard Edwin Stearns: The Complexity of Equivalence for Commutative Rings. J. Symb. Comput. 10(5): 411-436 (1990)
50no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Edwin Stearns, Harry B. Hunt III: Power Indices and Easier Hard Problems. Mathematical Systems Theory 23(4): 209-225 (1990)
49no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Richard Edwin Stearns: The Complexity of Very Simple Boolean Formulas with Applications. SIAM J. Comput. 19(1): 44-70 (1990)
1989
48no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPhilip 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
47no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSreejit Chakravarty, Harry B. Hunt III: A Note on Detecting Sneak Paths in Transistor Networks. IEEE Trans. Computers 38(6): 861-864 (1989)
46no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSreejit 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
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Richard Edwin Stearns: On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report). AAECC 1988: 250-258
44no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel J. Rosenkrantz, Harry B. Hunt III: Matrix Multiplication for Finite Algebraic Systems. Inf. Process. Lett. 28(4): 189-192 (1988)
1987
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel 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)
42no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLS. S. Ravi, Harry B. Hunt III: An Application of the Planar Separator Theorem to Counting Problems. Inf. Process. Lett. 25(5): 317-322 (1987)
41no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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)
40no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Richard Edwin Stearns: Nonlinear Algebra and Optimization on Rings are ``Hard''. SIAM J. Comput. 16(5): 910-929 (1987)
1986
39no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSreejit Chakravarty, Harry B. Hunt III: On the Computation of Detection Probability for Multiple Faults. ITC 1986: 252-262
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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
37no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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
36no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard 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)
35no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel J. Rosenkrantz, Harry B. Hunt III: Testing for Grammatical Coverings. Theor. Comput. Sci. 38: 323-341 (1985)
1984
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz: Algebraic Structures with Hard Equivalence and Minimization Problems. J. ACM 31(4): 879-904 (1984)
32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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
31no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III: On the Complexity of Flowchart and Loop Program Schemes and Programming Languages. J. ACM 29(1): 228-249 (1982)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III: On the Decidability of Grammar Problems. J. ACM 29(2): 429-447 (1982)
1981
28no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Edwin Stearns, Harry B. Hunt III: On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata FOCS 1981: 74-81
1980
27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Daniel J. Rosenkrantz: The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract) FOCS 1980: 152-160
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Daniel J. Rosenkrantz: Efficient Algorithms for Structural Similarity of Grammars. POPL 1980: 213-219
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel J. Rosenkrantz, Harry B. Hunt III: Processing Conjunctive Predicates and Queries. VLDB 1980: 64-72
24no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Daniel J. Rosenkrantz: The Complexity of Testing Predicate Locks. SIGMOD Conference 1979: 127-133
22no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III: Observations on the Complexity of Regular Expression Problems. J. Comput. Syst. Sci. 19(3): 222-236 (1979)
1978
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Thomas G. Szymanski: Lower Bounds and Reductions Between Grammar Problems. J. ACM 25(1): 32-51 (1978)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Thomas G. Szymanski: Corrigendum: ``Lower Bounds and Reductions Between Grammar Problems''. J. ACM 25(4): 687-688 (1978)
19no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Daniel J. Rosenkrantz: Computational Parallels Between the Regular and Context-Free Languages. SIAM J. Comput. 7(1): 99-114 (1978)
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel J. Rosenkrantz, Harry B. Hunt III: Polynomial Algorithms for Deterministic Pushdown Automata. SIAM J. Comput. 7(4): 405-412 (1978)
1977
17no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman: Operations on Sparse Relations. Commun. ACM 20(3): 171-176 (1977)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Daniel J. Rosenkrantz: On Equivalence and Containment Problems for Formal Languages. J. ACM 24(3): 387-396 (1977)
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthew 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
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III: A Complexity Theory of Grammar Problems. POPL 1976: 12-18
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Thomas G. Szymanski: Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract) STOC 1976: 126-134
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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)
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Thomas G. Szymanski: Complexity Metatheorems for Context-Free Grammar Problems. J. Comput. Syst. Sci. 13(3): 318-334 (1976)
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III: On the Complexity of Finite, Pushdown, and Stack Automata. Mathematical Systems Theory 10: 33-52 (1976)
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthew 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
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, J. L. Rangel: Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract) FOCS 1975: 144-150
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman: On the Complexity of LR(k) Testing. POPL 1975: 130-136
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Thomas G. Szymanski: On the Complexity of Grammar and Related Problems STOC 1975: 54-65
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman: On the Complexity of LR(k) Testing. Commun. ACM 18(12): 707-716 (1975)
1974
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III, Daniel J. Rosenkrantz: Computational Parallels between the Regular and Context-Free Languages STOC 1974: 64-74
1973
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry B. Hunt III: On the Time and Tape Complexity of Languages I STOC 1973: 10-19

Coauthor Index

1Christopher L. Barrett [86] [88] [91] [92] [94] [96] [97] [98]
2Philip J. Bernhard [48] [53]
3Peter A. Bloniarz [33] [41]
4Yuri Breitbart [66]
5Sreejit Chakravarty [39] [46] [47] [52]
6Robert L. Constable [24]
7Matthew M. Geller [8] [15]
8Madhav V. Marathe [57] [58] [59] [60] [61] [62] [63] [64] [65] [67] [69] [73] [74] [75] [76] [77] [78] [79] [80] [81] [84] [85] [86] [87] [88] [90] [91] [92] [94] [96] [97] [98]
9Lenore M. Restifo Mullin (Lenore M. R. Mullin) [82] [83] [95]
10Lenore R. Mullin [99]
11Venkatesh Radhakrishnan [55] [57] [63] [64] [65] [73] [74] [75] [77] [79] [80] [90]
12J. L. Rangel [7]
13R. Ravi [58] [67] [76] [78] [85]
14S. S. Ravi [42] [46] [57] [58] [59] [60] [61] [64] [65] [67] [69] [70] [73] [76] [77] [78] [85] [86] [88] [90] [91] [92] [94] [96] [97] [98]
15James E. Raynolds [99]
16Daniel J. Rosenkrantz [2] [9] [12] [16] [18] [19] [23] [25] [26] [27] [31] [32] [33] [35] [37] [41] [43] [44] [46] [48] [53] [54] [56] [58] [64] [65] [66] [67] [70] [71] [72] [76] [77] [78] [81] [83] [85] [86] [88] [90] [91] [92] [94] [95] [96] [97] [98] [99]
17Sartaj Sahni (Sartaj K. Sahni) [24]
18Sandeep K. Shukla [70] [71] [72]
19Richard Edwin Stearns [28] [36] [38] [40] [45] [49] [50] [51] [55] [62] [63] [64] [65] [68] [70] [71] [74] [75] [77] [79] [80] [81] [84] [86] [87] [88] [89] [90] [91] [92] [93] [94] [96] [97] [98]
20Ravi Sundaram [67] [76] [78]
21Thomas G. Szymanski [3] [4] [5] [6] [8] [9] [11] [12] [13] [15] [17] [20] [21]
22Mayur Thakur [96] [97] [98]
23Predrag T. Tosic [88]
24Jeffrey D. Ullman [3] [4] [6] [8] [15] [17]

Colors in the list of coauthors

Copyright © Sun Mar 14 22:39:24 2010 by Michael Ley (ley@uni-trier.de)