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=47
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Why a single parallelization strategy is not enough in knowledge bases
Simona R. Cohen
,
Ouri Wolfson
Journal of Computer and System Sciences
47
(1), 1993, pp. 2-44
B
-trees with inserts and deletes: Why free-at-empty is better than merge-at-half
Theodore Johnson
,
Dennis Shasha
Journal of Computer and System Sciences
47
(1), 1993, pp. 45-76
A logic for programming with complex objects
Michael Kifer
,
James Wu
Journal of Computer and System Sciences
47
(1), 1993, pp. 77-120
Algebraic and calculus query languages for recursively typed complex objects
Richard Hull
,
Jianwen Su
Journal of Computer and System Sciences
47
(1), 1993, pp. 121-156
The impact of recovery on concurrency control
William E. Weihl
Journal of Computer and System Sciences
47
(1), 1993, pp. 157-184
The alternating fixpoint of logic programs with negation
Allen van Gelder
Journal of Computer and System Sciences
47
(1), 1993, pp. 185-221
Logical query optimization by proof-tree transformation
Raghu Ramakrishnan
,
Yehoshua Sagiv
,
Jeffrey D. Ullman
,
Moshe Y. Vardi
Journal of Computer and System Sciences
47
(1), 1993, pp. 222-248
Removing randomness in parallel computation without a processor penalty
Michael Luby
Journal of Computer and System Sciences
47
(2), 1993, pp. 250-286
Nonexpressibility of fairness and signaling
David McAllester
,
Prakash Panangaden
,
Vasant Shanbhogue
Journal of Computer and System Sciences
47
(2), 1993, pp. 287-321
Communication complexity and combinatorial lattice theory
László Lovász
,
Michael Saks
Journal of Computer and System Sciences
47
(2), 1993, pp. 322-349
Effect of connectivity in an associative memory model
János Komlós
,
Ramamohan Paturi
Journal of Computer and System Sciences
47
(2), 1993, pp. 350-373
The discrete logarithm modulo a composite hides
O(n)
bits
J. Håstad
,
A.W. Schrift
,
A. Shamir
Journal of Computer and System Sciences
47
(3), 1993, pp. 376-404
Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC
Mario Szegedy
Journal of Computer and System Sciences
47
(3), 1993, pp. 405-423
Surpassing the information theoretic bound with fusion trees
Michael L. Fredman
,
Dan E. Willard
Journal of Computer and System Sciences
47
(3), 1993, pp. 424-436
Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements
Ketan Mulmuley
Journal of Computer and System Sciences
47
(3), 1993, pp. 437-458
Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
Ming-Yang Kao
,
Philip N. Klein
Journal of Computer and System Sciences
47
(3), 1993, pp. 459-500
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
Robert Cypher
,
C. Greg Plaxton
Journal of Computer and System Sciences
47
(3), 1993, pp. 501-548
Self-testing/correcting with applications to numerical problems
Manuel Blum
,
Michael Luby
,
Ronitt Rubinfeld
Journal of Computer and System Sciences
47
(3), 1993, pp. 549-595