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=95
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Completeness of hyper-resolution via the semantics of disjunctive logic programs
Linh Anh Nguyen
,
Rajeev Goré
Information Processing Letters
95
(2), 2005, pp. 363-369
Euclidean TSP between two nested convex obstacles
Jeff Abrahamson
,
Ali Shokoufandeh
,
Pawel Winter
Information Processing Letters
95
(2), 2005, pp. 370-375
Resource-bounded strong dimension versus resource-bounded category
John M. Hitchcock
,
A. Pavan
Information Processing Letters
95
(3), 2005, pp. 377-381
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
Qingmin Shi
,
Joseph JaJa
Information Processing Letters
95
(3), 2005, pp. 382-388
Non-approximability of weighted multiple sequence alignment for arbitrary metrics
Bodo Manthey
Information Processing Letters
95
(3), 2005, pp. 389-395
On the language equivalence of
NE
star-patterns
Benedek Nagy
Information Processing Letters
95
(3), 2005, pp. 396-400
Deciding
H_1
by resolution
Jean Goubault-Larrecq
Information Processing Letters
95
(3), 2005, pp. 401-408
A simple power analysis attack against the key schedule of the Camellia block cipher
Lu Xiao
,
Howard M. Heys
Information Processing Letters
95
(3), 2005, pp. 409-412
Construction of high degree resilient S-boxes with improved nonlinearity
Kishan Chand Gupta
,
Palash Sarkar
Information Processing Letters
95
(3), 2005, pp. 413-417
Restructuring binary search trees revisited
Travis Gagie
Information Processing Letters
95
(3), 2005, pp. 418-421
A large lower bound on the query complexity of a simple Boolean function
Beate Bollig
Information Processing Letters
95
(4), 2005, pp. 423-428
Sufficient conditions for
\lambda'
-optimality of graphs with small conditional diameter
C. Balbuena
,
M. Cera
,
A. Diánez
,
P. Gárcia-Vázquez
,
X. Marcote
Information Processing Letters
95
(4), 2005, pp. 429-434
Modifying YCN key assignment scheme to resist the attack from Hwang
Jyh-haw Yeh
,
Marion Scheepers
,
Wen-chen Hu
Information Processing Letters
95
(4), 2005, pp. 435-440
Seiten 1
2
>