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=86
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An efficient stream authentication scheme using tree chaining
Yongsu Park
,
Tae-Sun Chung
,
Yookun Cho
Information Processing Letters
86
(1), 2003, pp. 1-8
Gales suffice for constructive dimension
John M. Hitchcock
Information Processing Letters
86
(1), 2003, pp. 9-12
Effects of broadcast errors on concurrency control in wireless broadcasting environments
Zakil Koo
,
Songchun Moon
Information Processing Letters
86
(1), 2003, pp. 13-21
Optimal search for rationals
Stephen Kwek
,
Kurt Mehlhorn
Information Processing Letters
86
(1), 2003, pp. 23-26
Verifying minimum stable circuit values
C.K. Poon
Information Processing Letters
86
(1), 2003, pp. 27-32
A bandwidth latency tradeoff for broadcast and reduction
Peter Sanders
,
Jop F. Sibeyn
Information Processing Letters
86
(1), 2003, pp. 33-38
Reducing the blocking in two-phase commit with backup sites
P. Krishna Reddy
,
Masaru Kitsuregawa
Information Processing Letters
86
(1), 2003, pp. 39-47
Minimal sensor integrity: Measuring the vulnerability of sensor grids
Rajgopal Kannan
,
S. Sarangi
,
Sibabrata Ray
,
S.S. Iyengar
Information Processing Letters
86
(1), 2003, pp. 49-55
Flaw and modification of the
iKP
electronic payment protocols
Kazuhiro Ogata
,
Kokichi Futatsugi
Information Processing Letters
86
(2), 2003, pp. 57-62
A linear time
\frac{5}{3}
-approximation for the minimum strongly-connected spanning subgraph problem
Liang Zhao
,
Hiroshi Nagamochi
,
Toshihide Ibaraki
Information Processing Letters
86
(2), 2003, pp. 63-70
On the spectrum of projective norm-graphs
Tibor Szabó
Information Processing Letters
86
(2), 2003, pp. 71-74
A lower bound for the hitting set size for combinatorial rectangles and an application
L. Sunil Chandran
Information Processing Letters
86
(2), 2003, pp. 75-78
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
Yosuke Kikuchi
,
Yukio Shibata
Information Processing Letters
86
(2), 2003, pp. 79-85
A
\frac{5}{3}
-approximation algorithm for scheduling vehicles on a path with release and handling times
Daya Ram Gaur
,
Arvind Gupta
,
Ramesh Krishnamurti
Information Processing Letters
86
(2), 2003, pp. 87-91
Fault-tolerant wormhole routing for hypercube networks
Jau-Der Shih
Information Processing Letters
86
(2), 2003, pp. 93-100
On the complexity of digraph packings
Richard C. Brewster
,
Romeo Rizzi
Information Processing Letters
86
(2), 2003, pp. 101-106
A CAT algorithm for generating permutations with a fixed number of inversions
Scott Effler
,
Frank Ruskey
Information Processing Letters
86
(2), 2003, pp. 107-112
Simple and efficient floor-planning
Maciej Kurowski
Information Processing Letters
86
(3), 2003, pp. 113-119
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
Nir Halman
Information Processing Letters
86
(3), 2003, pp. 121-128
Combinatorial algorithms for feedback problems in directed graphs
Camil Demetrescu
,
Irene Finocchi
Information Processing Letters
86
(3), 2003, pp. 129-136
How to detect a counterfeit coin: Adaptive versus non-adaptive solutions
Axel Born
,
Cor A.J. Hurkens
,
Gerhard J. Woeginger
Information Processing Letters
86
(3), 2003, pp. 137-141
A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
Beate Bollig
Information Processing Letters
86
(3), 2003, pp. 143-148
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
Ioannis Caragiannis
,
Christos Kaklamanis
,
Panagiotis Kanellopoulos
Information Processing Letters
86
(3), 2003, pp. 149-154
An efficient minimum and maximum global snapshot algorithm
L.-B. Chen
Information Processing Letters
86
(3), 2003, pp. 155-159
Structure and stability number of chair-, co-
P
- and gem-free graphs revisited
Andreas Brandstädt
,
Hoàng-Oanh Le
,
Jean-Marie Vanherpe
Information Processing Letters
86
(3), 2003, pp. 161-167
Seiten 1
2
3
>