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=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An
O(n^3 \log\log n / \log n)
time algorithm for the all-pairs shortest path problem
Tadao Takaoka
Information Processing Letters
96
(5), 2005, pp. 155-161
Double hashing with passbits
Walter A. Burkhard
Information Processing Letters
96
(5), 2005, pp. 162-166
A bivalency proof of the lower bound for uniform consensus
Xianbing Wang
,
Yong Meng Teo
,
Jiannong Cao
Information Processing Letters
96
(5), 2005, pp. 167-174
On the linear complexity of bounded integer sequences over different moduli
Igor E. Shparlinski
,
Arne Winterhof
Information Processing Letters
96
(5), 2005, pp. 175-177
New bounds on
D
-ary optimal codes
Gonzalo Navarro
,
Nieves Brisaboa
Information Processing Letters
96
(5), 2005, pp. 178-184
A new method for approximate indexing and dictionary lookup with one error
Moritz G. Maaß
,
Johannes Nowak
Information Processing Letters
96
(5), 2005, pp. 185-191
On the definition of sequential consistency
Ali Sezgin
,
Ganesh Gopalakrishnan
Information Processing Letters
96
(6), 2005, pp. 193-196
Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
Kuan-Yu Chen
,
Kun-Mao Chao
Information Processing Letters
96
(6), 2005, pp. 197-201
On the
P
versus
NP
intersected with co-
NP
question in communication complexity
Stasys Jukna
Information Processing Letters
96
(6), 2005, pp. 202-206
Distance monotonicity and a new characterization of Hamming graphs
Méziane Aïder
,
Mustapha Aouchiche
Information Processing Letters
96
(6), 2005, pp. 207-213
De Bruijn sequences and De Bruijn graphs for a general language
Eduardo Moreno
Information Processing Letters
96
(6), 2005, pp. 214-219
Producing the left parse during bottom-up parsing
Bos̑tjan Slivnik
,
Bostjan Vilfan
Information Processing Letters
96
(6), 2005, pp. 220-224
The compression structure of a process
Thuy Duong Vu
Information Processing Letters
96
(6), 2005, pp. 225-229
Exploiting distance coherence to speed up range queries in metric indexes
Kimmo Fredriksson
Information Processing Letters
95
(1), 2005, pp. 287-292
Maximum induced subgraph of a recursive circulant
Xiaofan Yang
,
David J. Evans
,
Graham M. Megson
Information Processing Letters
95
(1), 2005, pp. 293-298
Stabilizing mobile philosophers
Ajoy K. Datta
,
Maria Gradinariu
,
Michel Raynal
Information Processing Letters
95
(1), 2005, pp. 299-306
Self-stabilizing coloration in anonymous planar networks
Shing-Tsaan Huang
,
Su-Shen Hung
,
Chi-Hung Tzeng
Information Processing Letters
95
(1), 2005, pp. 307-312
Context exhumation after the Burrows-Wheeler transform
Sebastian Deorowicz
Information Processing Letters
95
(1), 2005, pp. 313-320
On a simple randomized algorithm for finding a 2-factor in sparse graphs
Gopal Pandurangan
Information Processing Letters
95
(1), 2005, pp. 321-327
Properties of uniformly hard languages
Piotr Faliszewski
,
Janusz Jarosz
Information Processing Letters
95
(1), 2005, pp. 329-332
Improved deterministic approximation algorithms for Max TSP
Zhi-Zhong Chen
,
Yuusuke Okamoto
,
Lusheng Wang
Information Processing Letters
95
(2), 2005, pp. 333-342
Space-efficient FCFS group mutual exclusion
Srdjan Petrovic
Information Processing Letters
95
(2), 2005, pp. 343-350
A short note on the lower bound of dilation for
O(\log n)
-label interval routing
Savio S.H. Tse
Information Processing Letters
95
(2), 2005, pp. 351-353
Reviewing bounds on the circuit size of the hardest functions
Gudmund Skovbjerg Frandsen
,
Peter Bro Miltersen
Information Processing Letters
95
(2), 2005, pp. 354-357
Hitting sets when the VC-dimension is small
Guy Even
,
Dror Rawitz
,
Shimon (Moni) Shahar
Information Processing Letters
95
(2), 2005, pp. 358-362
Seiten
<
1
2
3
4
5
6
7
>