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=100
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Remarks on BioHash and its mathematical foundation
Andrew Teoh
,
Beng Jin
,
Tee Connie
,
David Ngo
,
Chek Ling
Information Processing Letters
100
(4), 2006, pp. 145-150
Infinity problems and countability problems for
\omega
-automata
Yunfeng Tao
Information Processing Letters
100
(4), 2006, pp. 151-153
An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
Chor Ping Low
Information Processing Letters
100
(4), 2006, pp. 154-161
An efficient approximation for the Generalized Assignment Problem
Reuven Cohen
,
Liran Katzir
,
Danny Raz
Information Processing Letters
100
(4), 2006, pp. 162-166
A polynomial time algorithm for the minimum quartet inconsistency problem with
O(n)
quartet errors
Gang Wu
,
Jia-Huai You
,
Guohui Lin
Information Processing Letters
100
(4), 2006, pp. 167-171
Natural language tagging with genetic algorithms
Enrique Alba
,
Gabriel Luque
,
Lourdes Araujo
Information Processing Letters
100
(5), 2006, pp. 173-182
A 2-approximation algorithm for the Zookeeper's problem
Xuehou Tan
Information Processing Letters
100
(5), 2006, pp. 183-187
On the number of broadcast schemes in networks
Calin D. Morosan
Information Processing Letters
100
(5), 2006, pp. 188-193
How much precision is needed to compare two sums of square roots of integers?
Jianbo Qian
,
Cao An Wang
Information Processing Letters
100
(5), 2006, pp. 194-198
A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
Taisuke Izumi
,
Toshimitsu Masuzawa
Information Processing Letters
100
(5), 2006, pp. 199-205
The equivalence problem for deterministic MSO tree transducers is decidable
Joost Engelfriet
,
Sebastian Maneth
Information Processing Letters
100
(5), 2006, pp. 206-212
Efficiently pricing European-Asian options - Ultimate implementation and analysis of the AMO algorithm
Akiyoshi Shioura
,
Takeshi Tokuyama
Information Processing Letters
100
(6), 2006, pp. 213-219
Farthest line segment Voronoi diagrams
F. Aurenhammer
,
R.L.S. Drysdale
,
H. Krasser
Information Processing Letters
100
(6), 2006, pp. 220-225
A general compression algorithm that supports fast searching
Kimmo Fredriksson
,
Szymon Grabowski
Information Processing Letters
100
(6), 2006, pp. 226-232
Improved construction for universality of determinant and permanent
Hong Liu
,
Kenneth W. Regan
Information Processing Letters
100
(6), 2006, pp. 233-237
Guarding galleries and terrains
Alon Efrat
,
Sariel Har-Peled
Information Processing Letters
100
(6), 2006, pp. 238-245
Seiten
<
1
2