`Travelled to:`

1 × Germany

1 × Hungary

1 × Sweden

11 × USA

2 × Canada

`Collaborated with:`

D.J.Rosenkrantz T.G.Szymanski M.V.Marathe ∅ R.E.Stearns S.S.Ravi S.K.Shukla R.Ravi J.D.Ullman V.Radhakrishnan R.Sundaram

`Talks about:`

problem (8) complex (8) approxim (4) grammar (3) algorithm (2) process (2) languag (2) complet (2) specif (2) pspace (2)

## Person: Harry B. Hunt III

### DBLP: III:Harry_B=_Hunt

### Contributed to:

### Wrote 16 papers:

- SAT-2001-HuntMS #complexity #constraints #probability #problem #quantifier
- Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems (HBHI, MVM, RES), pp. 217–230.
- CAV-1996-ShuklaHR #game studies #model checking #verification
- HORNSAT, Model Checking, Verification and games (SKS, HBHI, DJR), pp. 99–110.
- ICALP-1996-ShuklaHRS #complexity #finite #on the #problem #process #relational
- On the Complexity of Relational Problems for Finite State Processes (SKS, HBHI, DJR, RES), pp. 466–477.
- ICALP-1995-MaratheRSRRH #design #network #problem
- Bicriteria Network Design Problems (MVM, RR, RS, SSR, DJR, HBHI), pp. 487–498.
- STOC-1994-MaratheHSR #approximate #problem #specification
- Approximation schemes for PSPACE-complete problems for succinct specifications (MVM, HBHI, RES, VR), pp. 468–477.
- ICALP-1993-MaratheHR #approximate #complexity #problem #specification
- The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (MVM, HBHI, SSR), pp. 76–87.
- STOC-1993-RaviMRRH #algorithm #approximate #multi
- Many birds with one stone: multi-objective approximation algorithms (RR, MVM, SSR, DJR, HBHI), pp. 438–447.
- POPL-1980-HuntR #algorithm #performance #similarity
- Efficient Algorithms for Structural Similarity of Grammars (HBHI, DJR), pp. 213–219.
- VLDB-1980-RosenkrantzH #query
- Processing Conjunctive Predicates and Queries (DJR, HBHI), pp. 64–72.
- SIGMOD-1979-HuntR #complexity #testing
- The Complexity of Testing Predicate Locks (HBHI, DJR), pp. 127–133.
- POPL-1976-Hunt #complexity #problem
- A Complexity Theory of Grammar Problems (HBHI), pp. 12–18.
- STOC-1976-HuntS #problem #reachability
- Dichotomization, Reachability, and the Forbidden Subgraph Problem (HBHI, TGS), pp. 126–134.
- POPL-1975-HuntSU #complexity #lr #on the #testing
- On the Complexity of LR(k) Testing (HBHI, TGS, JDU), pp. 130–136.
- STOC-1975-HuntS #complexity #on the #problem
- On the Complexity of Grammar and Related Problems (HBHI, TGS), pp. 54–65.
- STOC-1974-HuntR #context-free grammar
- Computational Parallels between the Regular and Context-Free Languages (HBHI, DJR), pp. 64–74.
- STOC-1973-Hunt #complexity #on the
- On the Time and Tape Complexity of Languages I (HBHI), pp. 10–19.