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
[2]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing OR on a randomized fixed adversary CRCW PRAM
Ludȇk Kuc̑era
Information Processing Letters
63
(3), 1997, pp. 165-166
Total domination and transformation
Dieter Kratsch
,
Lorna Stewart
Information Processing Letters
63
(3), 1997, pp. 167-170
Shelf algorithms for on-line strip packing
János Csirik
,
Gerhard J. Woeginger
Information Processing Letters
63
(4), 1997, pp. 171-175
Computing strictly-second shortest paths
Kumar N. Lalgudi
,
Marios C. Papaefthymiou
Information Processing Letters
63
(4), 1997, pp. 177-181
The working set algorithm has competitive ratio less than two
Kunsoo Park
,
Sang Lyul Min
,
Yookun Cho
Information Processing Letters
63
(4), 1997, pp. 183-188
Updating timestamp interval for dynamic adjustment of serialization order in optimistic concurrency control-time interval (OCCTI) protocol
Prabhudev Konana
,
Juhnyoung Lee
,
Sudha Ram
Information Processing Letters
63
(4), 1997, pp. 189-193
Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
Maxime Crochemore
,
Thierry Lecroq
Information Processing Letters
63
(4), 1997, pp. 195-203
Distributed routing in a fault-tolerant multistage interconnection network
Sying-Jyan Wang
Information Processing Letters
63
(4), 1997, pp. 205-210
A tight bound for approximating the square root
Nader H. Bshouty
,
Yishay Mansour
,
Baruch Schieber
,
Prasoon Tiwari
Information Processing Letters
63
(4), 1997, pp. 211-213
Computing a single cell in the overlay of two simple polygons
Mark de Berg
,
Olivier Devillers
,
Katrin Dobrindt
,
Otfried Schwarzkopf
Information Processing Letters
63
(4), 1997, pp. 215-219
I
-serializability: Generalized correctness for transaction-based environments
Jürgen Ebert
,
Gottfried Vossen
Information Processing Letters
63
(4), 1997, pp. 221-227
Orienting graphs to optimize reachability
S. Louis Hakimi
,
Edward F. Schmeichel
,
Neal E. Young
Information Processing Letters
63
(5), 1997, pp. 229-235
An approximation algorithm for least median of squares regression
Clark F. Olson
Information Processing Letters
63
(5), 1997, pp. 237-241
Stutter-invariant temporal properties are expressible without the next-time operator
Doron Peled
,
Thomas Wilke
Information Processing Letters
63
(4), 1997, pp. 243-246
Authenticated encryption schemes with linkage between message blocks
Wei-Bin Lee
,
Chin-Chen Chang
Information Processing Letters
63
(4), 1997, pp. 247-250
Languages represented by Boolean formulas
Helmut Veith
Information Processing Letters
63
(5), 1997, pp. 251-256
The average sensitivity of bounded-depth circuits
Ravi B. Boppana
Information Processing Letters
63
(5), 1997, pp. 257-261
An
O(n)
algorithm for finding an optimal position with relative distances in an evolutionary tree
B.Y. Wu
,
C.Y. Tang
Information Processing Letters
63
(5), 1997, pp. 263-269
Broadcast scheduling in packet radio networks by Hopfield neural networks
Li-Chiun Wei
,
Ruay-Shiung Chang
Information Processing Letters
63
(5), 1997, pp. 271-276
The minimum labeling spanning trees
Ruay-Shiung Chang
,
Shing-Jiuan Leu
Information Processing Letters
63
(5), 1997, pp. 277-282
When is a pair of matrices mortal?
Vincent D. Blondel
,
John N. Tsitsiklis
Information Processing Letters
63
(5), 1997, pp. 283-286
On the power of a threshold gate at the top
Mikael Goldmann
Information Processing Letters
63
(6), 1997, pp. 287-293
Detecting conjunctions of global predicates
Vijay K. Garg
,
J. Roger Mitchell
Information Processing Letters
63
(6), 1997, pp. 295-302
Logarithmic width, linear area upward drawing of AVL trees
Sung Kwon Kim
Information Processing Letters
63
(6), 1997, pp. 303-307
Efficient stream distribution algorithm for heterogeneous multimedia multicast with link capacity constraint
Seung-Hoon Kim
,
Kyungshik Lim
,
Cheeha Kim
Information Processing Letters
63
(6), 1997, pp. 309-315
Seiten
<
1
2
3
4
5
6
7
8
9
>