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=68
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Comment on ``Efficient Huffman decoding'' and ``An efficient finite-state machine implementation of Huffman decoders''
Andrew Turpin
,
Alistair Moffat
Information Processing Letters
68
(1), 1998, pp. 1-2
An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays
Alfredo García
,
Pedro Jodrá
,
Javier Tejel
Information Processing Letters
68
(1), 1998, pp. 3-9
Improving a family of approximation algorithms to edge color multigraphs
Alberto Caprara
,
Romeo Rizzi
Information Processing Letters
68
(1), 1998, pp. 11-15
Approximating the pathwidth of outerplanar graphs
Rajeev Govindan
,
Michael A. Langston
,
Xudong Yan
Information Processing Letters
68
(1), 1998, pp. 17-23
The widest-
k
-dense corridor problems
Chan-Su Shin
,
Sung Yong Shin
,
Kyung-Yong Chwa
Information Processing Letters
68
(1), 1998, pp. 25-31
Exact primitives for smallest enclosing ellipses
Bernd Gärtner
,
Sven Schönherr
Information Processing Letters
68
(1), 1998, pp. 33-38
VLSI layouts of complete graphs and star graphs
Chi-Hsiang Yeh
,
Behrooz Parhami
Information Processing Letters
68
(1), 1998, pp. 39-45
A non-SOS operational semantics for a process algebra
Wojciech Fraczak
,
Marek B. Zaremba
Information Processing Letters
68
(1), 1998, pp. 47-54
Some remarks on the Kronecker product of graphs
Anne Bottreau
,
Yves Métivier
Information Processing Letters
68
(2), 1998, pp. 55-61
A linear-time transformation of linear inequalities into conjunctive normal form
Joost P. Warners
Information Processing Letters
68
(2), 1998, pp. 63-69
Efficient algorithms for the temporal precedence problem
D. Ranjan
,
E. Pontelli
,
G. Gupta
Information Processing Letters
68
(2), 1998, pp. 71-78
Parallel dictionaries with local rules on AVL and brother trees
Joaquim Gabarró
,
Xavier Messeguer
Information Processing Letters
68
(2), 1998, pp. 79-85
A limitation of vector timestamps for reconstructing distributed computations
C.J. Fidge
Information Processing Letters
68
(2), 1998, pp. 87-91
Pseudo-average block sensitivity equals average sensitivity
S. Venkatesh
Information Processing Letters
68
(2), 1998, pp. 93-95
Efficient dynamic range searching using data replication
K.V. Ravi Kanth
,
Ambuj Singh
Information Processing Letters
68
(2), 1998, pp. 97-105
Robust vector space secret sharing schemes
Carles Padró
Information Processing Letters
68
(3), 1998, pp. 107-111
On the loopless generation of binary tree sequences
Vincent Vajnovszki
Information Processing Letters
68
(3), 1998, pp. 113-117
Deciding the winner in parity games is in
UP\cap
co-
UP
Marcin Jurdziński
Information Processing Letters
68
(3), 1998, pp. 119-124
Efficient special cases of Pattern Matching with Swaps
Amihood Amir
,
Gad M. Landau
,
Moshe Lewenstein
,
Noa Lewenstein
Information Processing Letters
68
(3), 1998, pp. 125-132
A complete axiomatization of full acyclic join dependencies
F.M. Malvestuto
Information Processing Letters
68
(3), 1998, pp. 133-139
A polynomial time solvable instance of the feasible minimum cover problem
Chor-Ping Low
Information Processing Letters
68
(3), 1998, pp. 141-146
An undecidable fragment of the theory of set constraints
Witold Charatonik
Information Processing Letters
68
(3), 1998, pp. 147-151
Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
Valery Gordon
,
Wieslaw Kubiak
Information Processing Letters
68
(3), 1998, pp. 153-159
Complexity versus stability for classes of propositional formulas
Nadia Creignou
Information Processing Letters
68
(4), 1998, pp. 161-165
A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses
Roberto Posenato
,
Massimo Santini
Information Processing Letters
68
(4), 1998, pp. 167-171
Seiten 1
2
>