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
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Approximate Max
k
-cut with subgraph guarantee
Viggo Kann
,
Jens Lagergren
,
Alessandro Panconesi
Information Processing Letters
65
(3), 1998, pp. 145-150
Recognizing when greed can approximate maximum independent sets is complete for parallel access to
NP
Edith Hemaspaandra
,
Jörg Rothe
Information Processing Letters
65
(3), 1998, pp. 151-156
Optimal 1-Hamiltonian graphs
Jeng-Jung Wang
,
Chun-Nan Hung
,
Lih-Hsing Hsu
Information Processing Letters
65
(3), 1998, pp. 157-161
An improved fixed-parameter algorithm for vertex cover
R. Balasubramanian
,
Michael R. Fellows
,
Venkatesh Raman
Information Processing Letters
65
(3), 1998, pp. 163-168
Regular expressions with nested levels of back referencing form a hierarchy
Kim S. Larsen
Information Processing Letters
65
(4), 1998, pp. 169-172
Scheduling cyclic tasks with binary periods
Jerzy R. Nawrocki
,
Adam Czajka
,
Wojciech Complak
Information Processing Letters
65
(4), 1998, pp. 173-178
The bandwidth allocation problem in the ATM network model is
NP
-complete
Sundararajan Vedantham
,
S.S. Iyengar
Information Processing Letters
65
(4), 1998, pp. 179-182
On the number of spanning trees of multi-star related graphs
S.D. Nikolopoulos
,
P. Rondogiannis
Information Processing Letters
65
(4), 1998, pp. 183-188
Arbitrated unconditionally secure authentication scheme with multi-senders
Tzonelih Hwang
,
Chih-Hung Wang
Information Processing Letters
65
(4), 1998, pp. 189-193
On the richness of the collection of subtrees in random binary search trees
Luc Devroye
Information Processing Letters
65
(4), 1998, pp. 195-199
A polynomial time solution for labeling a rectilinear map
Chung Keung Poon
,
Binhai Zhu
,
Francis Chin
Information Processing Letters
65
(4), 1998, pp. 201-207
Data sufficiency for queries on cache
Oded Shmueli
,
Kurt Shoens
Information Processing Letters
65
(4), 1998, pp. 209-216
On learning width two branching programs
Nader H. Bshouty
,
Christino Tamon
,
David K. Wilson
Information Processing Letters
65
(4), 1998, pp. 217-222
Optimal availability quorum systems: Theory and practice
Yair Amir
,
Avishai Wool
Information Processing Letters
65
(5), 1998, pp. 223-228
A 13/12 approximation algorithm for bin packing with extendable bins
Paolo Dell'Olmo
,
Hans Kellerer
,
Maria Grazia Speranza
,
Zsolt Tuza
Information Processing Letters
65
(5), 1998, pp. 229-233
Shifts and loopless generation of
k
-ary trees
James F. Korsh
,
Seymour Lipschutz
Information Processing Letters
65
(5), 1998, pp. 235-240
Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study
Jeremy Frank
,
Ian P. Gent
,
Toby Walsh
Information Processing Letters
65
(5), 1998, pp. 241-245
Starvation-free secure multiversion concurrency control
Heung-Taek Kim
,
Myoung Ho Kim
Information Processing Letters
65
(5), 1998, pp. 247-253
An optimal message routing algorithm for double-loop networks
D.J. Guan
Information Processing Letters
65
(5), 1998, pp. 255-260
Test sequence generation from the protocol data portion based on the selecting Chinese postman algorithm
Wen-huei Chen
Information Processing Letters
65
(5), 1998, pp. 261-268
Maintaining visibility of a polygon with a moving point of view
Danny Z. Chen
,
Ovidiu Daescu
Information Processing Letters
65
(5), 1998, pp. 269-275
Pattern matching for permutations
Prosenjit Bose
,
Jonathan F. Buss
,
Anna Lubiw
Information Processing Letters
65
(5), 1998, pp. 277-283
Seiten
<
1
2
3
4
5
6
7
8
9
>