Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Hunt III, H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation algorithms for degree-constrained minimum-cost network-design problems
R. Ravi
,
M.V. Marathe
,
S.S. Ravi
,
D.J. Rosenkrantz
,
H.B. Hunt III
Algorithmica
31
(1), 2001, pp. 58-78
Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
M.V. Marathe
,
H.B. Hunt III
,
S.S. Ravi
Discrete Applied Mathematics
64
, 1996, pp. 135-149
On the size of binary decision diagrams representing Boolean functions
Y. Breitbart
,
H. Hunt III
,
D. Rosenkrantz
Theoretical Computer Science
145
(1-2), 1995, pp. 45-69
Simple heuristics for unit disk graphs
M.V. Marathe
,
H. Breu
,
H.B. Hunt III
,
S.S. Ravi
,
D.J. Rosenkrantz
Networks
25
(1), 1995, pp. 59-68
Bicriteria network design problems
M.V. Marathe
,
R. Ravi
,
R. Sundaram
,
S.S. Ravi
,
D.J. Rosenkrantz
,
H.B. Hunt III
Lecture Notes in Computer Science
944
, 1995, pp. 487-498
A unified approach to approximation schemes for NP- and PSPACE-hard problems for geometric graphs
H.B. Hunt III
,
M.V. Marathe
,
V. Radhakrishnan
,
S.S. Ravi
,
D.J. Rosenkrantz
,
R.E. Stearns
Proceedings of the 2nd Annual European Symposium on Algorithms. ESA '94 (Utrecht, The Netherlands, September 26-28, 1994)
LNCS 855
, 1994, pp. 424-435
Approximation schemes using
L
-reductions
^{1,2,3}
H.B. Hunt III
,
M.V. Marathe
,
V. Radhakrishnan
,
S.S. Ravi
,
D.J. Rosenkrantz
,
R.E. Stearns
Lecture Notes in Computer Science
880
, 1994, pp. 342-353
Approximation schemes for PSPACE-complete problems for succint specifications
M.V. Marathe
,
H.B. Hunt III
,
R.E. Stearns
,
V. Radhakrishnan
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 468-477
The complexity of approximating PSPACE-complete problems for hierarchical specifications
M.V. Marathe
,
H.B. Hunt III
,
S.S. Ravi
Lecture Notes in Computer Science
700
, 1993, pp. 76-87
Hierarchically specified unit disk graphs
M.V. Marathe
,
V. Radhakrishnan
,
H.B. Hunt III
,
S.S. Ravi
Lecture Notes in Computer Science
790
, 1993, pp. 21-32
Many birds with one stone: Multi-objective approximation algorithms (extended abstract)
R. Ravi
,
M.V. Marathe
,
S.S. Ravi
,
D.J. Rosenkrantz
,
H.B. Hunt III
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 438-447
Compaction of message patterns into succinct representations for multiprocessor interconnection networks
P.J. Bernhard
,
H.B. Hunt III
,
D.J. Rosenkrantz
Journal Parallel Distributed Computing
12
(1), 1991, May, pp. 39-49
The complexity of equivalence for commutative rings
H.B. Hunt III
,
R.E. Stearns
Journal Symbolic Computation
10
, 1990, pp. 411-436
The complexity of very simple Boolean formulas with application
H.B. Hunt III
,
R.E. Stearns
SIAM Journal on Computing
19
, 1990, pp. 44-70
Power indices and easier hard problems
R.E. Stearns
,
H.B. Hunt III
Math. Systems Theory
23
, 1990, pp. 209-225
Compaction of message patterns into space-efficient representations for multiprocessor interconnection networks
P.J. Bernhard
,
H.B. Hunt III
,
D.J. Rosenkrantz
Proceedings of the 1989 International Conference on Parallel Processing. Vol.~1 Architecture, ICPP'89 (Penn State University, August 8-12, 1989)
, 1989, pp. 111-115
On the complexity of satisfiability problems for algebraic structures
H.B. Hunt III
,
R.E. Stearns
Lecture Notes in Computer Science
357
, 1989, pp. 250-258
On the computational complexity of algebra on lattices
H.B. Hunt III
,
D.J. Rosenkrantz
,
P.A. Bloniarz
SIAM Journal on Computing
16
(1), 1987, February, pp. 129-148
The complexity of equivalence for commutative rings
H.B. Hunt III
,
R.E. Stearns
Technical Report (87-22), 1987
Nonlinear algebra and optimization on rings are 'hard'
H.B. Hunt III
,
R.E. Stearns
SIAM Journal on Computing
16
(5), 1987, October, pp. 910-929
An application of the planar separator theorem to counting problems
S.S. Ravi
,
H.B. Hunt III
Information Processing Letters
25
(5), 1987, July, pp. 317-321
Recursion schemes and recursive programs are exponentially hard to analyze
H.B. Hunt III
,
D.J. Rosenkrantz
SIAM Journal on Computing
15
(3), 1986, August, pp. 831-850
Monotone Boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures
H.B. Hunt III
,
R.E. Stearns
Lecture Notes in Computer Science
210
, 1986, pp. 277-290
Application of planar separator theorem to counting problems
S.S. Ravi
,
H.B. Hunt III
Technical Report (TR 86-19), 1986, August
On the complexity of the satisfiability problem and the structure of
NP
R.E. Stearns
,
H.B. Hunt III
Technical Report, 1986
Seiten 1
2
>