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=38
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A provably efficient algorithm for dynamic storage allocation
E.G., Jr. Coffman
,
F.T. Leighton
Journal of Computer and System Sciences
38
, 1989, pp. 2-35
Embedding planar graphs in four pages
Mihalis Yannakakis
Journal of Computer and System Sciences
38
, 1989, pp. 36-67
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
Jin-Yi Cai
Journal of Computer and System Sciences
38
, 1989, pp. 68-85
Making data structures persistent
James R. Driscoll
,
Neil Sarnak
,
Daniel D. Sleator
,
Robert E. Tarjan
Journal of Computer and System Sciences
38
, 1989, pp. 86-124
Optimal parallel selection has complexity
O(\log\log n)
Miklós Ajtai
,
János Komlós
,
W.L. Steiger
,
Endre Szemerédi
Journal of Computer and System Sciences
38
, 1989, pp. 125-133
On nontrivial separators, for
k
-page graphs and simulations by nondeterministic one-tape Turing machines
Zvi Galil
,
Ravi Kannan
,
Endre Szemerédi
Journal of Computer and System Sciences
38
, 1989, pp. 134-149
Bounded-width polynomial-size branching programs recognize exactly those languages in
NC^1
David A. Barrington
Journal of Computer and System Sciences
38
, 1989, pp. 150-164
Topologically sweeping an arrangement
Herbert Edelsbrunner
,
Leonidas J. Guibas
Journal of Computer and System Sciences
38
, 1989, pp. 165-194
The complexity of reasoning about knowledge and time I. Lower bounds
Joseph Y. Halpern
,
Moshe Y. Vardi
Journal of Computer and System Sciences
38
, 1989, pp. 195-237
Automatic generation of fest data for relational queries
Heikki Mannila
,
Kari-Jouko Räihä
Journal of Computer and System Sciences
38
, 1989, pp. 240-258
Data independent recursion in deductive databases
Jeffrey F. Naughton
Journal of Computer and System Sciences
38
, 1989, pp. 259-289
Minimalism, justification and non-monotonicity in deductive databases
Nicole Bidoit
,
Richard Hull
Journal of Computer and System Sciences
38
, 1989, pp. 290-325
A calculus for complex objects
François Bancilhon
,
Setrag Khoshafian
Journal of Computer and System Sciences
38
, 1989, pp. 326-340
On the convergence of query evaluation
Foto Afrati
,
Christos H. Papadimitriou
,
George Papageorgiou
,
Athena Roussou
,
Yehoshua Sagiv
,
Jeffrey D. Ullman
Journal of Computer and System Sciences
38
, 1989, pp. 341-359
Deleting completed transactions
Thanasis Hadzilacos
,
Mihalis Yannakakis
Journal of Computer and System Sciences
38
, 1989, pp. 360-379
A characterization of finite fd-acyclicity
Yehoshua Sagiv
,
Oded Shmueli
Journal of Computer and System Sciences
38
, 1989, pp. 380-404
Rearranging data to maximize the efficiency of compression
Frank Olken
,
Doron Rotem
Journal of Computer and System Sciences
38
, 1989, pp. 405-430
Lower bounds for language recognition on two-dimensional alternating multihead machines
Juraj Hromkovic̑
,
Katsushi Inoue
,
Itsuo Takanami
Journal of Computer and System Sciences
38
, 1989, pp. 431-451
On iterative and cellular tree arrays
Oscar H. Ibarra
,
Tao Jiang
,
Jik H. Chang
Journal of Computer and System Sciences
38
, 1989, pp. 452-473
Serialization of concurrent programs
Marie-Paule Flé
Journal of Computer and System Sciences
38
, 1989, pp. 474-493
Fast and efficient solution of path algebra problems
Victor Pan
,
John Reif
Journal of Computer and System Sciences
38
, 1989, pp. 494-510
Positive relativizations of the
P =? NP
problem
Craig A. Rich
Journal of Computer and System Sciences
38
, 1989, pp. 511-523