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=91
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Packing Steiner trees with identical terminal sets
Petteri Kaski
Information Processing Letters
91
(1), 2004, pp. 1-5
Note on the connectivity of line graphs
Angelika Hellwig
,
Dieter Rautenbach
,
Lutz Volkmann
Information Processing Letters
91
(1), 2004, pp. 7-10
Hamiltonian properties on the class of hypercube-like networks
Chong-Dae Park
,
Kyung-Yong Chwa
Information Processing Letters
91
(1), 2004, pp. 11-17
Strongly competitive algorithms for caching with pipelined prefetching
Alexander Gaysinsky
,
Alon Itai
,
Hadas Shachnai
Information Processing Letters
91
(1), 2004, pp. 19-27
Power attacks on a side-channel resistant elliptic curve implementation
Willi Geiselmann
,
Rainer Steinwandt
Information Processing Letters
91
(1), 2004, pp. 29-32
Impossible differential cryptanalysis of 7-round Advanced Encryption Standard (AES)
Raphael C.-W. Phan
Information Processing Letters
91
(1), 2004, pp. 33-38
Attack on a concast signature scheme
D.R. Stinson
Information Processing Letters
91
(1), 2004, pp. 39-41
The quantum query complexity of the hidden subgroup problem is polynomial
Mark Ettinger
,
Peter Hyer
,
Emanuel Knill
Information Processing Letters
91
(1), 2004, pp. 43-48
Search audio data with the wavelet pyramidal algorithm
Ying Li
,
Yibin Hou
Information Processing Letters
91
(1), 2004, pp. 49-55
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Zoltán Fülöp
,
Armin Kühnemann
,
Heiko Vogler
Information Processing Letters
91
(2), 2004, pp. 57-67
Efficient structural joins with clustered extents
Jongik Kim
,
Sang Ho Lee
,
Hyoung-Joo Kim
Information Processing Letters
91
(2), 2004, pp. 69-75
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
Zhengnan Shi
,
Wayne Goddard
,
Stephen T. Hedetniemi
Information Processing Letters
91
(2), 2004, pp. 77-83
Speedup of Vidyasankar's algorithm for the group
k
-exclusion problem
Masataka Takamura
,
Tom Altman
,
Yoshihide Igarashi
Information Processing Letters
91
(2), 2004, pp. 85-91
On the expressive power of semijoin queries
Dirk Leinders
,
Jerzy Tyszkiewicz
,
Jan van den Bussche
Information Processing Letters
91
(2), 2004, pp. 93-98
External matrix multiplication and all-pairs shortest path
Jop F. Sibeyn
Information Processing Letters
91
(2), 2004, pp. 99-106
Fractal dimension and vector quantization
Krishna Kumaraswamy
,
Vasileios Megalooikonomou
,
Christos Faloutsos
Information Processing Letters
91
(3), 2004, pp. 107-113
A fast algorithm for the generalized
k
-keyword proximity problem given keyword offsets
Sung-Ryul Kim
,
Inbok Lee
,
Kunsoo Park
Information Processing Letters
91
(3), 2004, pp. 115-120
On Fixpoint Arithmetic and Infinite Time Turing Machines
Giacomo Lenzi
,
Erich Monteleone
Information Processing Letters
91
(3), 2004, pp. 121-128
Non-shared edges and nearest neighbor interchanges revisited
Wing-Kai Hon
,
Ming-Yang Kao
,
Tak-Wah Lam
,
Wing-Kin Sung
,
Siu-Ming Yiu
Information Processing Letters
91
(3), 2004, pp. 129-134
A hierarchical clustering algorithm for categorical sequence data
Seung-Joon Oh
,
Jae-Yearn Kim
Information Processing Letters
91
(3), 2004, pp. 135-140
On confluence and residuals in Cauchy convergent transfinite rewriting
Jakob Grue Simonsen
Information Processing Letters
91
(3), 2004, pp. 141-146
On finding an ear decomposition of an undirected graph distributively
Y.H. Tsin
Information Processing Letters
91
(3), 2004, pp. 147-153
A coding theorem for Enumerable Output Machines
Jan Poland
Information Processing Letters
91
(4), 2004, pp. 157-161
Algorithms for solving the symmetry number problem on trees
Pradipta Prometheus Mitra
,
Muhammad Arshad Ul Abedin
,
Md. Abul Kashem
Information Processing Letters
91
(4), 2004, pp. 163-169
Shortest paths in simple polygons with polygon-meet constraints
Ramtin Khosravi
,
Mohammad Ghodsi
Information Processing Letters
91
(4), 2004, pp. 171-176
Seiten 1
2
>