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=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Addition chains with a bounded number of registers
Richard Parker
,
Andrew Plater
Information Processing Letters
90
(5), 2004, pp. 247-252
Efficient processing of subsequence matching with the Euclidean metric in time-series databases
Sang-Wook Kim
,
Dae-Hyun Park
,
Heon-Gil Lee
Information Processing Letters
90
(5), 2004, pp. 253-260
The complexity of deciding stability under FFS in the adversarial queueing model
C. Àlvarez
,
M. Blesa
,
J. Díaz
,
A. Fernández
,
M. Serna
Information Processing Letters
90
(5), 2004, pp. 261-266
A fixed-parameter tractable algorithm for matrix domination
Mark Weston
Information Processing Letters
90
(5), 2004, pp. 267-272
An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
J. Breit
Information Processing Letters
90
(6), 2004, pp. 273-278
New upper bounds on feedback vertex numbers in butterflies
Maw-Shang Chang
,
Chin-Hua Lin
,
Chuan-Min Lee
Information Processing Letters
90
(6), 2004, pp. 279-285
Using a minimal number of resets when testing from a finite state machine
R.M. Hierons
Information Processing Letters
90
(6), 2004, pp. 287-292
A single-point mutation evolutionary programming
Mingjun Ji
,
Huanwen Tang
,
Juan Guo
Information Processing Letters
90
(6), 2004, pp. 293-299
A lower bound for testing juntas
Hana Chockler
,
Dan Gutfreund
Information Processing Letters
90
(6), 2004, pp. 301-305
A limit characterization for the number of spanning trees of graphs
S.D. Nikolopoulos
,
C. Nomikos
,
P. Rondogiannis
Information Processing Letters
90
(6), 2004, pp. 307-313
\varepsilon
-transitions in concurrent timed auatomata
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
,
Simone Tini
Information Processing Letters
89
(1), 2004, pp. 1-7
On identifying codes in the hexagonal mesh
Iiro Honkala
,
Tero Laihonen
Information Processing Letters
89
(1), 2004, pp. 9-14
On approximation algorithms for the terminal Steiner tree problem
Doratha E. Drake
,
Stefan Hougardy
Information Processing Letters
89
(1), 2004, pp. 15-18
A note on maximum independent sets in rectangle intersection graphs
Timothy M. Chan
Information Processing Letters
89
(1), 2004, pp. 19-23
Irrelevant updates and self-maintainability in transitive closure database views
Millist W. Vincent
,
Jixue Liu
Information Processing Letters
89
(1), 2004, pp. 25-29
Topological formulation of termination properties of iterates of functions
Floris Geerts
,
Bart Kuijpers
Information Processing Letters
89
(1), 2004, pp. 31-35
Incremental learning of approximations from positive data
Gunter Grieser
,
Steffen Lange
Information Processing Letters
89
(1), 2004, pp. 37-42
AM_{exp}\not\subseteq(NP\cup coNP)/poly
N.V. Vinodchandran
Information Processing Letters
89
(1), 2004, pp. 43-47
Compact searchable static binary trees
Bruce K. Durgan
Information Processing Letters
89
(1), 2004, pp. 49-52
The greedy algorithm for domination in graphs of maximum degree 3
Suzanne M. Seager
Information Processing Letters
89
(2), 2004, pp. 53-56
Finding optimal paths in MREP routing
Rudolf Fleischer
,
Mordecai Golin
,
Chin-Tau Lea
,
Steven Wong
Information Processing Letters
89
(2), 2004, pp. 57-63
A characterization of s-languages
Wojciech Fraczak
,
Anna Podolak
Information Processing Letters
89
(2), 2004, pp. 65-70
On the minimum number of negations leading to super-polynomial savings
Stasys Jukna
Information Processing Letters
89
(2), 2004, pp. 71-74
Hardness results and approximation algorithms of
k
-tuple domination in graphs
Ralf Klasing
,
Christian Laforest
Information Processing Letters
89
(2), 2004, pp. 75-83
List edge multicoloring in graphs with few cycles
Dániel Marx
Information Processing Letters
89
(2), 2004, pp. 85-90
Seiten
<
1
2
3
4
5
6
7
8
>