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=Theor.~Comput.~Sci. AND Volume=182
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Perfect hashing
Zbigniew J. Czech
,
George Havas
,
Bohdan S. Majewski
Theoretical Computer Science
182
(1-2), 1997, pp. 1-143
Bounded capacity priority queues
M.D. Atkinson
,
D. Tulley
Theoretical Computer Science
182
(1-2), 1997, pp. 145-157
On the computational power of self-stabilizing systems
James Abello
,
Shlomi Dolev
Theoretical Computer Science
182
(1-2), 1997, pp. 159-170
Wide-sense nonblocking for multirate 3-stage close networks
B. Gao
,
F.K. Hwang
Theoretical Computer Science
182
(1-2), 1997, pp. 171-182
On compact representations of propositional circumscription
Marco Cadoli
,
Francesco M. Donini
,
Marco Schaerf
,
Riccardo Silvestri
Theoretical Computer Science
182
(1-2), 1997, pp. 183-202
Assigning a single server to inhomogeneous queues with switching costs
Ger Koole
Theoretical Computer Science
182
(1-2), 1997, pp. 203-216
Optimal comparison strategies in Ulam's searching game with two errors
Daniele Mundici
,
Alberto Trombetta
Theoretical Computer Science
182
(1-2), 1997, pp. 217-232
Approximation algorithms for multiple sequence alignment
Vineet Bafna
,
Eugene L. Lawler
,
Pavel A. Pevzner
Theoretical Computer Science
182
(1-2), 1997, pp. 233-244
Hajós, factorizations and completion of codes
Nguyen Huong Lam
Theoretical Computer Science
182
(1-2), 1997, pp. 245-256