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="Stearns, R.E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Generalized CNF satisfiability problems and non-efficient approximability
H.B. Hunt
,
M.V. Marathe
,
R.E. Stearns
Proceedings of the Ninth Annual Conference on Structure in Complexity Theory (Amsterdam, The Netherlands, June 28 - July 1, 1994)
, 1994, pp. 356-366
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 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
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
Juris Hartmanis: The beginnings of computational complexity
R.E. Stearns
Proceedings of the 3rd Annual Conference on Structure in Complexity Theory, CSCT'88 (Georgetown University, Washington D.C., June 14-17 1988)
, 1988, pp. 128-134
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
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
On the complexity of the satisfiability problem and the structure of
NP
R.E. Stearns
,
H.B. Hunt III
Technical Report, 1986
On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata
R.E. Stearns
,
H.B. Hunt III
SIAM Journal on Computing
14
(3), 1985, August, pp. 598-611
Consistency and serializability in concurrent database systems
D.J. Rosenkrantz
,
R.E. Stearns
,
P.M. Lewis II
SIAM Journal on Computing
13
(3), 1984, August, pp. 508-530
On the equivalence and containment problems for unambiguous regular expressions, grammars, and automata
R.E. Stearns
,
H.B. Hunt III
Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'81 (Nashville, TN, October 28-30, 1981)
, 1981, pp. 74-81
An analysis of several heuristics for the traveling salesman problem
D.J. Rosenkrantz
,
R.E. Stearns
,
P.M. Lewis II
SIAM Journal on Computing
6
(3), 1977, September, pp. 563-581
Concurrency control for database systems
R.E. Stearns
,
P.M. Lewis
,
D.J. Rosenkrantz
Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science, FOCS'76 (Houston, TX, October 25-27, 1976)
, 1976, pp. 19-32
Attributed translations
P.M. Lewis
,
D.J. Rosenkrantz
,
R.E. Stearns
Journal of Computer and System Sciences
9
, 1974, pp. 279-307
Approximate algorithms for the traveling salesperson problem
D.J. Rosenkrantz
,
R.E. Stearns
,
P.M. Lewis
Proceedings of the 15th Annual Symp. on Switching and Automata Theory
, 1974, October, pp. 33-42
Attributed translations
P.M. Lewis
,
D.J. Rosenkrantz
,
R.E. Stearns
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, STOC'73 (Austin, TX, April 30 - May 2, 1973)
, 1973, pp. 160-171
Properties of deterministic top-down grammars
D.J. Rosenkrantz
,
R.E. Stearns
Information and Control
17
, 1970, pp. 226-256
Properties of deterministic top down grammars
D.J. Rosenkrantz
,
R.E. Stearns
Proceedings of the 1st Annual ACM Symposium on Theory of Computing, STOC'69 (Marina del Rey, CA, May 5-7, 1969)
, 1969, pp. 165-180
Property grammars and table machines
R.E. Stearns
,
P.M. Lewis
Information and Control
14
, 1969, pp. 524-549
Syntax-directed transduction
P.M. Lewis II
,
R.E. Stearns
Journal of the ACM
15
, 1968, pp. 465-488
Seiten 1
2
>