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 Volume=89
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
\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
Optimal algorithm for a special point-labeling problem
Sasanka Roy
,
Partha P. Goswami
,
Sandip Das
,
Subhas C. Nandy
Information Processing Letters
89
(2), 2004, pp. 91-98
The log-rank conjecture and low degree polynomials
Paul Valiant
Information Processing Letters
89
(2), 2004, pp. 99-103
Minimum cuts, girth and a spectral threshold
L. Sunil Chandran
Information Processing Letters
89
(3), 2004, pp. 105-110
On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
F. Hess
Information Processing Letters
89
(3), 2004, pp. 111-114
Labeling points with given rectangles
Joo-Won Jung
,
Kyung-Yong Chwa
Information Processing Letters
89
(3), 2004, pp. 115-121
Probabilistic weak simulation is decidable in polynomial time
Christel Baier
,
Holger Hermanns
,
Joost-Pieter Katoen
Information Processing Letters
89
(3), 2004, pp. 123-130
Weak coin flipping with small bias
I. Kerenidis
,
A. Nayak
Information Processing Letters
89
(3), 2004, pp. 131-135
Computing all large sums-of-pairs in
R^n
and the discrete planar two-watchtower problem
Boaz Ben-Moshe
,
Paz Carmi
,
Matthew J. Katz
Information Processing Letters
89
(3), 2004, pp. 137-139
Macro forest transducers
Thomas Perst
,
Helmut Seidl
Information Processing Letters
89
(3), 2004, pp. 141-149
Kinetic hanger
Guilherme D. da Fonseca
,
Celina M.H. de Figueiredo
,
Paulo C.P. Carvalho
Information Processing Letters
89
(3), 2004, pp. 151-157
Seiten 1
2
>