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=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decomposing a relation into a tree of binary relations
Rina Dechter
Journal of Computer and System Sciences
41
, 1990, pp. 2-24
A new interpretation for null values in the weak instance model
Paolo Atzeni
,
Maria Cristina De Bernardis
Journal of Computer and System Sciences
41
, 1990, pp. 25-43
Logic programming with sets
Gabriel M. Kuper
Journal of Computer and System Sciences
41
, 1990, pp. 44-64
Commutativity-based locking for nested transactions
Alan Fekete
,
Nancy Lynch
,
Michael Merritt
,
William Weihl
Journal of Computer and System Sciences
41
, 1990, pp. 65-156
Bounds on the propagation of selection into logic programs
Catriel Beeri
,
Paris Kanellakis
,
François Bancilhon
,
Raghu Ramakrishnan
Journal of Computer and System Sciences
41
, 1990, pp. 157-180
Procedural languages for database queries and updates
Serge Abiteboul
,
Victor Vianu
Journal of Computer and System Sciences
41
, 1990, pp. 181-229
Practical arbitrary lookahead LR parsing
Manuel E. Bermudez
,
Karl M. Schimpf
Journal of Computer and System Sciences
41
, 1990, pp. 230-250
On the complexity of ranking
Lane A. Hemachandra
,
Steven Rudich
Journal of Computer and System Sciences
41
, 1990, pp. 251-271
On uniformity within
NC^1
David A. Mix Barrington
,
Neil Immerman
Journal of Computer and System Sciences
41
, 1990, pp. 274-306
Pseudorandom sources for BPP
Jack H. Lutz
Journal of Computer and System Sciences
41
, 1990, pp. 307-320
On the theory of the PTIME degrees of the recursive sets
Juichi Shinoda
,
Theodore A. Slaman
Journal of Computer and System Sciences
41
, 1990, pp. 321-366
Self-reducibility
José L. Balcázar
Journal of Computer and System Sciences
41
, 1990, pp. 367-388
Cook reducibility is faster than Karp reduciblity in NP
Luc Longpré
,
Paul Young
Journal of Computer and System Sciences
41
, 1990, pp. 389-401
Relations between communication complexity classes
Bernd Halstenberg
,
Rüdiger Reischuk
Journal of Computer and System Sciences
41
, 1990, pp. 402-429
Prediction-preserving reducibility
Leonard Pitt
,
Manfred K. Warmuth
Journal of Computer and System Sciences
41
, 1990, pp. 430-467