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=53
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved parity-declustered layouts for disk arrays
Eric J. Schwabe
,
Ian M. Sutherland
Journal of Computer and System Sciences
53
(3), 1996, pp. 328-343
List ranking and list scan on the CRAY C90
Margaret Reid-Miller
Journal of Computer and System Sciences
53
(3), 1996, pp. 344-356
Dynamic load balancing by random matchings
Bhaskar Ghosh
,
S. Muthukrishnan
Journal of Computer and System Sciences
53
(3), 1996, pp. 357-370
Construction of the mesh and the torus tolerating a large number of faults
Hisao Tamaki
Journal of Computer and System Sciences
53
(3), 1996, pp. 371-379
On the parallel complexity of Gaussian elimination with pivoting
M. Leoncini
Journal of Computer and System Sciences
53
(3), 1996, pp. 380-394
An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM
Shay Halperin
,
Uri Zwick
Journal of Computer and System Sciences
53
(3), 1996, pp. 395-416
Efficient low-contention parallel algorithms
Phillip B. Gibbons
,
Yossi Matias
,
Vijaya Ramachandran
Journal of Computer and System Sciences
53
(3), 1996, pp. 417-442
An optimal predicate locking scheduler
Carlo Meghini
,
Costantino Thanos
Journal of Computer and System Sciences
53
(3), 1996, pp. 443-468
A threshold for unsatisfiability
Andreas Goerdt
Journal of Computer and System Sciences
53
(3), 1996, pp. 469-486
Maximal and minimal solutions to language equations
Lila Kari
,
Gabriel Thierrin
Journal of Computer and System Sciences
53
(3), 1996, pp. 487-496
The complexity of nested counterfactuals and iterated knowledge base revisions
Thomas Eiter
,
Georg Gottlob
Journal of Computer and System Sciences
53
(3), 1996, pp. 497-512
k
one-way heads cannot do string-matching
Tao Jiang
,
Ming Li
Journal of Computer and System Sciences
53
(3), 1996, pp. 513-524
River routing with a generalized model
Jean R.S. Blair
,
Errol L. Lloyd
Journal of Computer and System Sciences
53
(3), 1996, pp. 525-544
On completeness under random reductions
Suresh Chari
,
Pankaj Rohatgi
Journal of Computer and System Sciences
53
(3), 1996, pp. 545-555
Regular description of context-free graph languages
Joost Engelfriet
,
Vincent van Oostrom
Journal of Computer and System Sciences
53
(3), 1996, pp. 556-574
Partition triples: A tool for reduction of data sets
Jerzy W. Grzymala-Busse
,
Soe Than
Journal of Computer and System Sciences
53
(3), 1996, pp. 575-582
Program synthesis in the presence of infinite number of inaccuracies
Sanjay Jain
Journal of Computer and System Sciences
53
(3), 1996, pp. 583-591
Seiten
<
1
2