Draft:Harry B. Hunt, III
 | Review waiting, please be patient.
This may take 8 weeks or more, since drafts are reviewed in no specific order. There are 1,730 pending submissions waiting for review.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
Reviewer tools
|
Harry Bowen Hunt, III | |
|---|---|
| Born | July 1, 1949 |
| Alma mater | Case Western Reserve University (B.S. & M.S.) Cornell University (Ph.D.) |
| Scientific career | |
| Institutions | University at Albany |
| Doctoral advisor | John Hopcroft [1] |
| Other academic advisors | Juris Hartmanis |
| Doctoral students | |
Harry Bowen Hunt, III (born July 01, 1949) is a prominent American computer scientist and professor at the University at Albany, SUNY. He is best known for his pioneering contributions to theoretical computer science, particularly in the areas of complexity theory, automata theory, and formal language theory. Over the course of his career, Hunt has authored and co-authored numerous groundbreaking research papers, published in the most prestigious and authoritative journals in the field, such as the Journal of the ACM, SIAM Journal on Computing, Acta Informatica, and Theoretical Computer Science, making significant contributions to advancing the understanding of computational efficiency and algorithmic problem-solving.
Hunt graduated with a B.S and M.S. in mathematics from Case Western Reserve University and then received his Ph.D. from Cornell University in 1973 after completing a doctoral dissertation, titled On the Time and Tape Complexity of Languages, under the supervision of John Hopcroft.[1] Hunt is now a professor of Computer Science at the University at Albany, which is part of the State University of New York.[3] His collaborations with eminent scientists, including Richard E. Stearns, a co-recipient of the 1993 Turing Award[4], and Daniel J. Rosenkrantz, have produced groundbreaking results that have significantly advanced the field of theoretical computer science. Significant results include the development of NC-approximation schemes for various NP- and PSPACE-Hard problems in geometric graphs.[5]. Hunt and Stearns also investigated sum-of-products problems where the addition and multiplication operators are drawn from commutative semirings. They demonstrated that such problems can be solved using fewer operations if the problem exhibits favorable structural properties captured by a structure tree. In this context, "favorable structural properties" refers to either a small weighted depth for top-down processing or a small channelwidth for bottom-up processing. Channelwidth corresponds to the concept of treewidth when sum-of-products problems are visualized graphically, but the structure tree offers a clearer perspective for algebraic interpretations. Furthermore, with the inclusion of an algebraic condition, they extended the structure tree framework to handle quantified formulas. Finally, they established a strong connection between sub-linear space complexity and OR-of-AND problems with sub-linearly bounded treewidth.[4]
Bibliography
[edit]- Harry B Hunt, Madhav V Marathe, Venkatesh Radhakrishnan, S.S Ravi, Daniel J Rosenkrantz, and Richard E Stearns. 1998. NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. J. Algorithms 26, 2 (feb. 1998), 238–274. NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- Harry B. Hunt, Madhav V. Marathe, Venkatesh Radhakrishnan, and Richard E. Stearns. 1998. The Complexity of Planar Counting Problems. SIAM J. Comput. 27, 4 (Aug. 1998), 1142–1167.
- H. B. Hunt. 1973. On the time and tape complexity of languages I. In Proceedings of the fifth annual ACM symposium on Theory of computing (STOC '73). Association for Computing Machinery, New York, NY, USA, 10–19. On the time and tape complexity of languages I
- Harry B. Hunt, Daniel J. Rosenkrantz, and Thomas G. Szymanski. 1976. On the equivalence, containment, and covering problems for the regular and context-free languages. J. Comput. Syst. Sci. 12, 2 (April, 1976), 222–268. On the equivalence, containment, and covering problems for the regular and context-free languages
- Harry B. Hunt and Daniel J. Rosenkrantz. 1977. On Equivalence and Containment Problems for Formal Languages. J. ACM 24, 3 (July 1977), 387–396. On Equivalence and Containment Problems for Formal Languages
- P. A. Bloniarz, H. B. Hunt, and D. J. Rosenkrantz. 1984. Algebraic Structures with Hard Equivalence and Minimization Problems. J. ACM 31, 4 (Oct. 1984), 879–904. Algebraic Structures with Hard Equivalence and Minimization Problems
- Harry B. Hunt, Thomas G. Szymanski, and Jeffrey D. Ullman. 1975. On the complexity of LR(k) testing. Commun. ACM 18, 12 (Dec. 1975), 707–716. On the complexity of LR(k) testing
- Jingnan Xie and Harry B. Hunt, III. 2023. On the undecidability and descriptional complexity of synchronized regular expressions. Acta Inf. 60, 3 (Sep 2023), 257–278. On the undecidability and descriptional complexity of synchronized regular expressions
References
[edit]- ^ a b "John Hopcroft". www.cs.cornell.edu.
- ^ "Harry Hunt, III - The Mathematics Genealogy Project". www.mathgenealogy.org.
- ^ "Department of Computer Science - University at Albany-SUNY". www.albany.edu.
- ^ a b "Richard E Stearns - A.M. Turing Award Laureate". amturing.acm.org.
- ^ Hunt, Harry B; Marathe, Madhav V; Radhakrishnan, Venkatesh; Ravi, S.S; Rosenkrantz, Daniel J; Stearns, Richard E (February 1, 1998). "NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs". J. Algorithms. 26 (2): 238–274. doi:10.1006/jagm.1997.0903 – via ACM Digital Library.