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: Journal=J. Comput.~Syst.~Sci. AND Volume=39
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Strong nondeterministic Turing reduction - A technique for proving intractability
Moon Jung Chung
,
B. Ravikumar
Journal of Computer and System Sciences
39
, 1989, pp. 2-20
On hiding information from an oracle
Martín Abadi
,
Joan Feigenbaum
,
Joe Kilian
Journal of Computer and System Sciences
39
, 1989, pp. 21-50
Descriptive characterizations of computational complexity
Daniel Leivant
Journal of Computer and System Sciences
39
, 1989, pp. 51-83
Probabilistic complexity classes and lowness
Uwe Schöning
Journal of Computer and System Sciences
39
, 1989, pp. 84-100
Some consequences of the existence of pseudorandom generators
Eric W. Allender
Journal of Computer and System Sciences
39
, 1989, pp. 101-124
Optimal shortest path queries in a simple polygon
Leonidas J. Guibas
,
John Hershberger
Journal of Computer and System Sciences
39
, 1989, pp. 126-152
Parallel construction of subdivision hierarchies
N. Dadoun
,
D.G. Kirkpatrick
Journal of Computer and System Sciences
39
, 1989, pp. 153-165
Orthogonally convex coverings of orthogonal polygons without holes
Joseph Culberson
,
Robert A. Reckhow
Journal of Computer and System Sciences
39
, 1989, pp. 166-204
There are planar graphs almost as good as the complete graph
L. Paul Chew
Journal of Computer and System Sciences
39
, 1989, pp. 205-219
Computing geodesic furthest neighbors in simple polygons
Subhash Suri
Journal of Computer and System Sciences
39
, 1989, pp. 220-235
On finite-precision representations of geometric objects
Kokichi Sugihara
Journal of Computer and System Sciences
39
, 1989, pp. 236-247
Honest polynomial time reducibilities and the
P =? NP
problem
Klaus Ambos-Spies
Journal of Computer and System Sciences
39
, 1989, pp. 250-281
P^{NP[O(\log n)]}
and sparse Turing-complete sets for
NP
Jim Kadin
Journal of Computer and System Sciences
39
, 1989, pp. 282-298
The strong exponential hierarchy collapses
Lane A. Hemachandra
Journal of Computer and System Sciences
39
, 1989, pp. 299-322
Ordered vertex removal and subgraph problems
Raymond Greenlaw
Journal of Computer and System Sciences
39
, 1989, pp. 323-342
Solving reflexive domain equations in a category of complete metric spaces
Pierre America
,
Jan Rutten
Journal of Computer and System Sciences
39
, 1989, pp. 343-375
The set coincidence game: Complexity, attainability, and symmetric strategies
A.G. Robinson
,
A.J. Goldman
Journal of Computer and System Sciences
39
, 1989, pp. 376-387