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=75
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved conditions for bounded tardiness under EPDF Pfair multiprocessor scheduling
UmaMaheswari C. Devi
,
James H. Anderson
Journal of Computer and System Sciences
75
(7), 2009, pp. 388-420
Erratum to ``Languages not recognizable in real time by one-dimensional cellular automata''
Katsuhiko Nakamura
Journal of Computer and System Sciences
75
(7), 2009, pp. 421-421
On problems without polynomial kernels
Hans L. Bodlaender
,
Rodney G. Downey
,
Michael R. Fellows
,
Danny Hermelin
Journal of Computer and System Sciences
75
(8), 2009, pp. 423-434
Almost 2-SAT is fixed-parameter tractable
Igor Razgon
,
Barry O'Sullivan
Journal of Computer and System Sciences
75
(8), 2009, pp. 435-450
Efficient algorithms for the inverse sorting problem with bound constraints under the
l_\infty
-norm and the Hamming distance
Tzu-Chin Lin
,
Chung-Chin Kuo
,
Yong-Hsiang Hsieh
,
Biing-Feng Wang
Journal of Computer and System Sciences
75
(8), 2009, pp. 451-464
Worst-case optimal algorithm for XPath evaluation over XML streams
Prakash Ramanan
Journal of Computer and System Sciences
75
(8), 2009, pp. 465-485
Seiten
<
1
2