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.
A note on the Dwork-Naor timed deniable authentication
Yunlei Zhao
Information Processing Letters
100
(1), 2006, pp. 1-7
Parameterized complexity and improved inapproximability for computing the largest
j
-simplex in a
V
-polytope
Ioannis Koutis
Information Processing Letters
100
(1), 2006, pp. 8-13
Speeding up transposition-invariant string matching
Sebastian Deorowicz
Information Processing Letters
100
(1), 2006, pp. 14-20
On a traitor tracing scheme from ACISP 2003
Dongvu Tonien
Information Processing Letters
100
(1), 2006, pp. 21-22
Perfectly reliable message transmission
Arvind Narayanan
,
K. Srinathan
,
C. Pandu Rangan
Information Processing Letters
100
(1), 2006, pp. 23-28
Fair cost-sharing methods for the minimum spanning tree game
Eric Angel
,
Evripidis Bampis
,
Lélia Blin
,
Laurent Gourvès
Information Processing Letters
100
(1), 2006, pp. 29-35
Variationally universal hashing
Ted Krovetz
,
Phillip Rogaway
Information Processing Letters
100
(1), 2006, pp. 36-39
The complexity of depth-3 circuits computing symmetric Boolean functions
Guy Wolfovitz
Information Processing Letters
100
(2), 2006, pp. 41-46
Fault-diameter of Cartesian graph bundles
Iztok Banic̑
,
Janez Z̑erovnik
Information Processing Letters
100
(2), 2006, pp. 47-51
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
Yosuke Kikuchi
,
Toru Araki
Information Processing Letters
100
(2), 2006, pp. 52-59
Implementing unreliable failure detectors with unknown membership
Ernesto Jiménez
,
Sergio Arévalo
,
Antonio Fernández
Information Processing Letters
100
(2), 2006, pp. 60-63
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
Peter Damaschke
Information Processing Letters
100
(2), 2006, pp. 64-68
Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices
Khaled Elbassioni
,
Zvi Lotker
,
Raimund Seidel
Information Processing Letters
100
(2), 2006, pp. 69-71
Propositional dynamic logic of context-free programs and fixpoint logic with chop
Martin Lange
,
Rafal Somla
Information Processing Letters
100
(2), 2006, pp. 72-75
Determining the specificity of terms using inside-outside information: A necessary condition of term hierarchy mining
Pum-Mo Ryu
,
Key-Sun Choi
Information Processing Letters
100
(2), 2006, pp. 76-82
New simple constructions of distance-increasing mappings from binary vectors to permutations
Jyh-Shyan Lin
,
Jen-Chun Chang
,
Rong-Jaye Chen
Information Processing Letters
100
(2), 2006, pp. 83-89
Efficient parameterized string matching
Kimmo Fredriksson
,
Maxim Mozgovoy
Information Processing Letters
100
(3), 2006, pp. 91-96
Oriented vertex and arc colorings of outerplanar graphs
Alexandre Pinlou
,
Éric Sopena
Information Processing Letters
100
(3), 2006, pp. 97-104
A relation between edit distance for ordered trees and edit distance for Euler strings
Tatsuya Akutsu
Information Processing Letters
100
(3), 2006, pp. 105-109
Flow equivalent trees in undirected node-edge-capacitated planar graphs
Xianchao Zhang
,
Weifa Liang
,
He Jiang
Information Processing Letters
100
(3), 2006, pp. 110-115
A note on the decoding complexity of error-correcting codes
André Gronemeier
Information Processing Letters
100
(3), 2006, pp. 116-119
On the all-farthest-segments problem for a planar set of points
Asish Mukhopadhyay
,
Samidh Chatterjee
,
Benjamin Lafreniere
Information Processing Letters
100
(3), 2006, pp. 120-123
P
systems without multiplicities of symbol-objects
Artiom Alhazov
Information Processing Letters
100
(3), 2006, pp. 124-129
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
Jean-Luc Baril
,
Jean-Marcel Pallo
Information Processing Letters
100
(4), 2006, pp. 131-136
An
O(n \log n)
-time algorithm for the maximum constrained agreement subtree problem for binary trees
Z.S. Peng
,
H.F. Ting
Information Processing Letters
100
(4), 2006, pp. 137-144
Seiten 1
2
>