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
[1]
Hilfe
Suche: Journal=International Journal of Foundations of Computer Science AND YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
From suffix trees to suffix vectors
Élise Prieur
,
Thierry Lecroq
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1385-1402
Enhanced security models and a generic construction approach for linkable ring signature
Joseph K. Liu
,
Duncan S. Wong
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1403-1422
Fast broadcasting with Byzantine faults
Michel Paquette
,
Andrzej Pelc
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1423-1439
Minimizing total weighted completion time on identical parallel batch machines
Shuguang Li
,
Guojun Li
,
Xingqin Qi
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1441-1453
A priority queue with the working-set property
Amr Elmasry
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1455-1465
The computational complexity of avoiding forbidden submatrices by row deletions
Sebastian Wernicke
,
Jochen Alber
,
Jens Gramm
,
Jiong Guo
,
Rolf Niedermeier
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1467-1484
Seiten
<
1
2
3
4