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=65
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A simplified
NP
-complete MAXSAT problem
Venkatesh Raman
,
B. Ravikumar
,
S. Srinivasa Rao
Information Processing Letters
65
(1), 1998, pp. 1-6
An attack on a recursive authentication protocol - A cautionary tale
P.Y.A. Ryan
,
S.A. Schneider
Information Processing Letters
65
(1), 1998, pp. 7-10
A polynomial algorithm for the extendability problem in bipartite graphs
J. Lakhal
,
L. Litzler
Information Processing Letters
65
(1), 1998, pp. 11-16
An improved upper bound on the non-3-colourability threshold
Paul E. Dunne
,
Michele Zito
Information Processing Letters
65
(1), 1998, pp. 17-23
On secret sharing schemes
Carlo Blundo
,
Alfredo de Santis
,
Ugo Vaccaro
Information Processing Letters
65
(1), 1998, pp. 25-32
The time complexity of updating snapshot memories
Amos Israeli
,
Asaf Shirazi
Information Processing Letters
65
(1), 1998, pp. 33-40
On rotations in fringe-balanced binary trees
Hosam M. Mahmoud
Information Processing Letters
65
(1), 1998, pp. 41-46
Secret sets and applications
R. Molva
,
G. Tsudik
Information Processing Letters
65
(1), 1998, pp. 47-55
The full quotient and its closure property for regular languages
Teodor Knapik
,
Étienne Payet
Information Processing Letters
65
(2), 1998, pp. 57-62
An improved algorithm for retrieving fuzzy information from two systems
Ahmed Ait-Bouziad
,
Helen Kassel
Information Processing Letters
65
(2), 1998, pp. 63-66
Improved solutions to the Steiner triple covering problem
Michiel A. Odijk
,
Hans van Maaren
Information Processing Letters
65
(2), 1998, pp. 67-69
An active attack on protocols for server-aided RSA signature computation
Gwoboa Horng
Information Processing Letters
65
(2), 1998, pp. 71-73
The complexity of scheduling starting time dependent tasks with release times
T.C.E. Cheng
,
Q. Ding
Information Processing Letters
65
(2), 1998, pp. 75-79
The recognition of geodetically connected graphs
Jou-Ming Chang
,
Chin-Wen Ho
Information Processing Letters
65
(2), 1998, pp. 81-88
An asymtotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
Peter J. Grabner
,
Helmut Prodinger
Information Processing Letters
65
(2), 1998, pp. 89-93
Enclosing
k
points in the smallest axis parallel rectangle
Michael Segal
,
Klara Kedem
Information Processing Letters
65
(2), 1998, pp. 95-99
Comparison of signature file models with superimposed coding
D. Dervos
,
Y. Manolopoulos
,
P. Linardis
Information Processing Letters
65
(2), 1998, pp. 101-106
A note on parallel complexity of maximum
f
-matching
Anders Dessmark
,
Oscar Garrido
,
Andrzej Lingas
Information Processing Letters
65
(2), 1998, pp. 107-109
Relating bends and size in orthogonal graph drawings
Therese C. Biedl
Information Processing Letters
65
(2), 1998, pp. 111-115
A 2.5-factor approximation algorithm for the
k
-MST problem
Sunil Arya
,
H. Ramesh
Information Processing Letters
65
(3), 1998, pp. 117-118
The
NPO
-completeness of the longest Hamiltonian cycle problem
Q.S. Wu
,
K.M. Chao
,
R.C.T. Lee
Information Processing Letters
65
(3), 1998, pp. 119-123
Agreement under faulty interfaces
Pallab Dasgupta
Information Processing Letters
65
(3), 1998, pp. 125-129
The
p
-neighbor
k
-center problem
Shiva Chaudhuri
,
Naveen Garg
,
R. Ravi
Information Processing Letters
65
(3), 1998, pp. 131-134
ANSV problem on BSRs
Limin Xiang
,
Kazuo Ushijima
Information Processing Letters
65
(3), 1998, pp. 135-138
Global avalanche characteristics and nonlinearity of balanced Boolean functions
Jung Je Son
,
Jong In Lim
,
Seongtaek Chee
,
Soo Hak Sung
Information Processing Letters
65
(3), 1998, pp. 139-144
Seiten 1
2
3
>