The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Harry B. Hunt III: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel J. Rosenkrantz, Harry B. Hunt III
    Processing Conjunctive Predicates and Queries. [Citation Graph (42, 16)][DBLP]
    VLDB, 1980, pp:64-72 [Conf]
  2. Harry B. Hunt III, Daniel J. Rosenkrantz
    The Complexity of Testing Predicate Locks. [Citation Graph (9, 9)][DBLP]
    SIGMOD Conference, 1979, pp:127-133 [Conf]
  3. Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
    Operations on Sparse Relations. [Citation Graph (2, 0)][DBLP]
    Commun. ACM, 1977, v:20, n:3, pp:171-176 [Journal]
  4. Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski
    On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:12, n:2, pp:222-268 [Journal]
  5. Harry B. Hunt III, Richard Edwin Stearns
    On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    AAECC, 1988, pp:250-258 [Conf]
  6. Daniel J. Rosenkrantz, Harry B. Hunt III
    The Complexity of STructural Containment and Equivalence. [Citation Graph (0, 0)][DBLP]
    Theoretical Studies in Computer Science, 1992, pp:101-132 [Conf]
  7. Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz
    HORNSAT, Model Checking, Verification and games (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CAV, 1996, pp:99-110 [Conf]
  8. Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns
    Generalized CNF Satisfiability Problems and Non-Efficient. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:356-366 [Conf]
  9. Madhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Theory of Periodically Specified Problems: Complexity and Approximability. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:106-0 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    DM-CCG, 2001, pp:95-110 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    DMCS, 2003, pp:69-80 [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:424-435 [Conf]
  13. Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
    Economy of Descriptions by Parsers, DPDA's, and PDA's [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:122-127 [Conf]
  14. Harry B. Hunt III, J. L. Rangel
    Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:144-150 [Conf]
  15. Harry B. Hunt III, Daniel J. Rosenkrantz
    The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:152-160 [Conf]
  16. Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
    Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1974, pp:127-132 [Conf]
  17. Richard Edwin Stearns, Harry B. Hunt III
    On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:74-81 [Conf]
  18. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Approximation Schemes Using L-Reductions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:342-353 [Conf]
  19. Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
    The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:76-87 [Conf]
  20. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Bicriteria Network Design Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:487-498 [Conf]
  21. 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). [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:466-477 [Conf]
  22. Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
    Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:26-30 [Conf]
  23. Philip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz
    Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1989, pp:111-115 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:2268-2273 [Conf]
  25. 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. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:183-191 [Conf]
  26. Sreejit Chakravarty, Harry B. Hunt III
    On the Computation of Detection Probability for Multiple Faults. [Citation Graph (0, 0)][DBLP]
    ITC, 1986, pp:252-262 [Conf]
  27. Daniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III
    On Materializations of Array-Valued Temporaries. [Citation Graph (0, 0)][DBLP]
    LCPC, 2000, pp:127-141 [Conf]
  28. 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. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:159-172 [Conf]
  29. Harry B. Hunt III, Lenore M. R. Mullin
    Experimental Construction of a Fine-Grained Polyalgorithm for the FFT. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1999, pp:1641-1647 [Conf]
  30. 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). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:122- [Conf]
  31. Harry B. Hunt III
    A Complexity Theory of Grammar Problems. [Citation Graph (0, 0)][DBLP]
    POPL, 1976, pp:12-18 [Conf]
  32. Harry B. Hunt III, Daniel J. Rosenkrantz
    Efficient Algorithms for Structural Similarity of Grammars. [Citation Graph (0, 0)][DBLP]
    POPL, 1980, pp:213-219 [Conf]
  33. Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
    On the Complexity of LR(k) Testing. [Citation Graph (0, 0)][DBLP]
    POPL, 1975, pp:130-136 [Conf]
  34. Harry B. Hunt III, Richard Edwin Stearns
    Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:277-290 [Conf]
  35. Venkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns
    Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:109-119 [Conf]
  36. Harry B. Hunt III
    On the Time and Tape Complexity of Languages I [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:10-19 [Conf]
  37. Harry B. Hunt III, Daniel J. Rosenkrantz
    Computational Parallels between the Regular and Context-Free Languages [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:64-74 [Conf]
  38. Harry B. Hunt III, Thomas G. Szymanski
    On the Complexity of Grammar and Related Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:54-65 [Conf]
  39. Harry B. Hunt III, Thomas G. Szymanski
    Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:126-134 [Conf]
  40. Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
    Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:468-477 [Conf]
  41. R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Many birds with one stone: multi-objective approximation algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:438-447 [Conf]
  42. Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi
    Hierarchical Specified Unit Disk Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:21-32 [Conf]
  43. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:1, pp:58-78 [Journal]
  44. Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
    On the Complexity of LR(k) Testing. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1975, v:18, n:12, pp:707-716 [Journal]
  45. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
    The Complexity of Planar Counting Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  46. Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
    Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  47. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Bicriteria Network Design Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  48. Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
    Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:64, n:2, pp:135-149 [Journal]
  49. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:1, pp:40-63 [Journal]
  50. S. S. Ravi, Harry B. Hunt III
    An Application of the Planar Separator Theorem to Counting Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:5, pp:317-322 [Journal]
  51. Daniel J. Rosenkrantz, Harry B. Hunt III
    Matrix Multiplication for Finite Algebraic Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:4, pp:189-192 [Journal]
  52. Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz
    Algebraic Structures with Hard Equivalence and Minimization Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:879-904 [Journal]
  53. Harry B. Hunt III
    On the Complexity of Flowchart and Loop Program Schemes and Programming Languages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:1, pp:228-249 [Journal]
  54. Harry B. Hunt III
    On the Decidability of Grammar Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:429-447 [Journal]
  55. Harry B. Hunt III
    Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:2, pp:299-318 [Journal]
  56. Harry B. Hunt III, Daniel J. Rosenkrantz
    On Equivalence and Containment Problems for Formal Languages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1977, v:24, n:3, pp:387-396 [Journal]
  57. Harry B. Hunt III, Thomas G. Szymanski
    Lower Bounds and Reductions Between Grammar Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:1, pp:32-51 [Journal]
  58. Harry B. Hunt III, Thomas G. Szymanski
    Corrigendum: ``Lower Bounds and Reductions Between Grammar Problems''. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:4, pp:687-688 [Journal]
  59. 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. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:26, n:2, pp:238-274 [Journal]
  60. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Bicriteria Network Design Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:1, pp:142-171 [Journal]
  61. Richard Edwin Stearns, Harry B. Hunt III
    Exploiting structure in quantified formulas. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:2, pp:220-263 [Journal]
  62. Harry B. Hunt III
    Observations on the Complexity of Regular Expression Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:19, n:3, pp:222-236 [Journal]
  63. Harry B. Hunt III, Daniel J. Rosenkrantz
    The Complexity of Monadic Recursion Schemes: Exponential Time Bounds. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:3, pp:395-419 [Journal]
  64. Harry B. Hunt III, Thomas G. Szymanski
    Complexity Metatheorems for Context-Free Grammar Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:13, n:3, pp:318-334 [Journal]
  65. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:8, pp:1317-1345 [Journal]
  66. Philip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz
    Compaction of Message Patterns into Succinct Representations for Multiprocessor Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:12, n:1, pp:39-49 [Journal]
  67. Harry B. Hunt III, Richard Edwin Stearns
    The Complexity of Equivalence for Commutative Rings. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:5, pp:411-436 [Journal]
  68. Harry B. Hunt III
    On the Complexity of Finite, Pushdown, and Stack Automata. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1976, v:10, n:, pp:33-52 [Journal]
  69. Richard Edwin Stearns, Harry B. Hunt III
    Resource Bounds and Subproblem Independence. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:6, pp:731-761 [Journal]
  70. Richard Edwin Stearns, Harry B. Hunt III
    Power Indices and Easier Hard Problems. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1990, v:23, n:4, pp:209-225 [Journal]
  71. Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
    The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:3, pp:275-316 [Journal]
  72. Harry B. Hunt III, Robert L. Constable, Sartaj Sahni
    On the Computational Complexity of Program Scheme Equivalence. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:2, pp:396-416 [Journal]
  73. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
    The Complexity of Planar Counting Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1142-1167 [Journal]
  74. Harry B. Hunt III, Daniel J. Rosenkrantz
    Computational Parallels Between the Regular and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:1, pp:99-114 [Journal]
  75. Harry B. Hunt III, Daniel J. Rosenkrantz
    Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:831-850 [Journal]
  76. Harry B. Hunt III, Daniel J. Rosenkrantz, Peter A. Bloniarz
    On the Computational Complexity of Algebra on Lattices. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:129-148 [Journal]
  77. Harry B. Hunt III, Richard Edwin Stearns
    Nonlinear Algebra and Optimization on Rings are ``Hard''. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:5, pp:910-929 [Journal]
  78. Harry B. Hunt III, Richard Edwin Stearns
    The Complexity of Very Simple Boolean Formulas with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:1, pp:44-70 [Journal]
  79. Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
    Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1237-1261 [Journal]
  80. Daniel J. Rosenkrantz, Harry B. Hunt III
    Polynomial Algorithms for Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:4, pp:405-412 [Journal]
  81. Daniel J. Rosenkrantz, Harry B. Hunt III
    The Complexity of Processing Hierarchical Specifications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:3, pp:627-649 [Journal]
  82. Richard Edwin Stearns, Harry B. Hunt III
    On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:3, pp:598-611 [Journal]
  83. Richard Edwin Stearns, Harry B. Hunt III
    An Algebraic Model for Combinatorial Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:2, pp:448-476 [Journal]
  84. Sreejit Chakravarty, Harry B. Hunt III
    A Note on Detecting Sneak Paths in Transistor Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:6, pp:861-864 [Journal]
  85. Sreejit Chakravarty, Harry B. Hunt III
    On Computing Signal Probability and Detection Probability of Stuck-at Faults. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:11, pp:1369-1377 [Journal]
  86. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:6, pp:865-869 [Journal]
  87. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:41-64 [Journal]
  88. Yuri Breitbart, Harry B. Hunt III, Daniel J. Rosenkrantz
    On the Size of Binary Decision Diagrams Representing Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:145, n:1&2, pp:45-69 [Journal]
  89. Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
    Economy of Description by Parsers, DPDA'S, and PDA'S. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1977, v:4, n:2, pp:143-153 [Journal]
  90. Harry B. Hunt III, Daniel J. Rosenkrantz
    The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:3-38 [Journal]
  91. Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski
    The Covering Problem for Linear Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:2, n:3, pp:361-382 [Journal]
  92. Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi
    Hierarchically Specified Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:174, n:1-2, pp:23-65 [Journal]
  93. Daniel J. Rosenkrantz, Harry B. Hunt III
    Testing for Grammatical Coverings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:323-341 [Journal]
  94. Daniel J. Rosenkrantz, Harry B. Hunt III
    Efficient Algorithms for Automatic Construction and Compactification of Parsing Grammars. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1987, v:9, n:4, pp:543-566 [Journal]
  95. Daniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III
    On minimizing materializations of array-valued temporaries. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2006, v:28, n:6, pp:1145-1177 [Journal]
  96. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:386, n:1-2, pp:3-37 [Journal]

  97. A Transformation--Based Approach for the Design of Parallel/Distributed Scientific Software: the FFT [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002