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
[2]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
The Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks
Behrooz Parhami
Information Processing Letters
95
(4), 2005, pp. 441-445
Operational termination of conditional term rewriting systems
Salvador Lucas
,
Claude Marché
,
Jose Meeseguer
Information Processing Letters
95
(4), 2005, pp. 446-453
A decidable class of problems for control under partial observation
Sophie Pinchinat
,
Stéphane Riedweg
Information Processing Letters
95
(4), 2005, pp. 454-460
The transportation metric and related problems
Yaron Ostrovsky-Berman
Information Processing Letters
95
(4), 2005, pp. 461-465
An algorithm for computing the restriction scaffold assignment problem in computational biology
Justin Colannino
,
Godfried Toussaint
Information Processing Letters
95
(4), 2005, pp. 466-471
Security protocols: From linear to classical logic by abstract interpretation
Bruno Blanchet
Information Processing Letters
95
(5), 2005, pp. 473-479
A path-based node filtering method for efficient structural joins
Kyung-Sub Min
,
Hyoung-Joo Kim
Information Processing Letters
95
(5), 2005, pp. 480-486
Modularity for teams of I/O automata
Maurice H. ter Beek
,
Jetty Kleijn
Information Processing Letters
95
(5), 2005, pp. 487-495
A note on window
\tau
-NAF algorithm
Ian F. Blake
,
V. Kumar Murty
,
Guangwu Xu
Information Processing Letters
95
(5), 2005, pp. 496-502
An effective local search for the maximum clique problem
Kengo Katayama
,
Akihiro Hamamoto
,
Hiroyuki Narihisa
Information Processing Letters
95
(5), 2005, pp. 503-511
The bottleneck
k
-MST
Abraham P. Punnen
,
Olena Chapovska
Information Processing Letters
95
(5), 2005, pp. 512-517
Applications of spiking neural networks
Sander M. Bohte
,
Joost N. Kok
Information Processing Letters
95
(6), 2005, pp. 519-520
Seiten
<
1
2
3
4
5
6
7
>