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=Inf.~Process.~Lett. AND YEAR=2008
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Integrating job parallelism in real-time scheduling theory
Sébastien Collette
,
Liliana Cucu
,
Joël Goossens
Information Processing Letters
106
(5), 2008, pp. 180-187
Efficient intensity map splitting algorithms for intensity-modulated radiation therapy
Xiaodong Wu
Information Processing Letters
106
(5), 2008, pp. 188-194
Minimal proper interval completions
Ivan Rapaport
,
Karol Suchan
,
Ioan Todinca
Information Processing Letters
106
(5), 2008, pp. 195-202
Approximating maximum satisfiable subsystems of linear equations of bounded width
Zeev Nutov
,
Daniel Reichman
Information Processing Letters
106
(5), 2008, pp. 203-207
t
-wise independence with local dependencies
Ronen Gradwohl
,
Amir Yehudayoff
Information Processing Letters
106
(5), 2008, pp. 208-212
An algorithm with linear expected running time for string editing with substitutions and substring reversals
Abdullah N. Arslan
Information Processing Letters
106
(5), 2008, pp. 213-218
Another short proof of optimality for the MIN cache replacement algorithm
Walter Vogler
Information Processing Letters
106
(5), 2008, pp. 219-220
Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models
Francisco Chicano
,
Enrique Alba
Information Processing Letters
106
(6), 2008, pp. 221-231
Should one always use repeated squaring for modular exponentiation?
Shmuel T. Klein
Information Processing Letters
106
(6), 2008, pp. 232-237
The probability of ``undefined'' (non-converging) output in generating the universal probability distribution
Ray J. Solomonoff
Information Processing Letters
106
(6), 2008, pp. 238-240
Resource-bounded measure on probabilistic classes
Philippe Moser
Information Processing Letters
106
(6), 2008, pp. 241-245
Rotation symmetry in algebraically generated cryptographic substitution tables
Vincent Rijmen
,
Paulo S.L.M. Barreto
,
Décio L. Gazzoni Filho
Information Processing Letters
106
(6), 2008, pp. 246-250
Dynamic bottleneck optimization for
k
-edge and 2-vertex connectivity
Orestis A. Telelis
,
Vassilis Zissimopoulos
Information Processing Letters
106
(6), 2008, pp. 251-257
Vertex vulnerability parameters of Kronecker products of complete graphs
Aygul Mamut
,
Elkin Vumar
Information Processing Letters
106
(6), 2008, pp. 258-262
Seiten
<
1
2
3
4
5
6
7
8
9