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=61
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
NP
-hard sets are superterse unless
NP
is small
Yongge Wang
Information Processing Letters
61
(1), 1997, pp. 1-6
Optimal parallel randomized renaming
Martin Farach
,
S. Muthukrishnan
Information Processing Letters
61
(1), 1997, pp. 7-10
On-line algorithms for the dominating set problem
Gow-Hsing King
,
Wen-Guey Tzeng
Information Processing Letters
61
(1), 1997, pp. 11-14
Odd-even sort in powerlists
Jacob Kornerup
Information Processing Letters
61
(1), 1997, pp. 15-24
Containment of butterflies in networks constructed by the line digraph operation
Toru Hasunuma
,
Yukio Shibata
Information Processing Letters
61
(1), 1997, pp. 25-30
Improvements on the accelerated integer GCD algorithm
Mohamed S. Sedjelmaci
,
Christian Lavault
Information Processing Letters
61
(1), 1997, pp. 31-36
The space-optimal version of a known rectangle enclosure reporting algorithm
Panayiotis Bozanis
,
Nectarios Kitsios
,
Christos Makris
,
Athanasios Tsakalidis
Information Processing Letters
61
(1), 1997, pp. 37-41
Communication algorithms in
k
-ary
n
-cube interconnection networks
Yaagoub Ashir
,
Iain A. Stewart
,
Aqeel Ahmed
Information Processing Letters
61
(1), 1997, pp. 43-48
An
\tilde{O}(n^{3/14})
-coloring algorithm for 3-colorable graphs
Avrim Blum
,
David Karger
Information Processing Letters
61
(1), 1997, pp. 49-53
The average height of a node in the BANG abstract directory tree
Stephen Taylor
,
Nabil Hachem
,
Stanley Selkow
Information Processing Letters
61
(1), 1997, pp. 55-61
Zero testing of algebraic functions
Richard Zippel
Information Processing Letters
61
(2), 1997, pp. 63-67
One unary function says less than two in existential second order logic
Bernd Loescher
Information Processing Letters
61
(2), 1997, pp. 69-75
A coloring problem for weighted graphs
D.J. Guan
,
Xuding Zhu
Information Processing Letters
61
(2), 1997, pp. 77-81
Collapse of
PP
with a semi-random source to
BPP
Ryuhei Uehara
Information Processing Letters
61
(2), 1997, pp. 83-87
An improved algorithm for intersecting convex polygons
Youssef G. Saab
Information Processing Letters
61
(2), 1997, pp. 89-90
On termination of confluent one-rule string-rewriting systems
Kayoko Shikishima-Tsuji
,
Masashi Katsura
,
Yuji Kobayashi
Information Processing Letters
61
(2), 1997, pp. 91-96
Efficient Huffman decoding
Kuo-Liang Chung
Information Processing Letters
61
(2), 1997, pp. 97-99
It is hard to know when greedy is good for finding independent sets
Hans L. Bodlaender
,
Dimitrios M. Thilikos
,
Koichi Yamazaki
Information Processing Letters
61
(2), 1997, pp. 101-106
A linear-time algorithm for the weighted feedback vertex problem on interval graphs
Chin Lung Lu
,
Chuan Yi Tang
Information Processing Letters
61
(2), 1997, pp. 107-111
The incremental maintenance of a depth-first-search tree in directed acyclic graphs
Paolo G. Franciosa
,
Giorgio Gambosi
,
Umberto Nanni
Information Processing Letters
61
(2), 1997, pp. 113-120
An approximation algorithm for clustering graphs with dominating diametral path
Jitender S. Deogun
,
Dieter Kratsch
,
George Steiner
Information Processing Letters
61
(3), 1997, pp. 121-127
A faster linear systolic algorithm for recovering a longest common subsequence
Thierry Lecroq
,
Guillaume Luce
,
Jean Frédéric Myoupo
Information Processing Letters
61
(3), 1997, pp. 129-136
Polynomial algorithms for the maximum stable set problem on particular classes of
P_5
-free graphs
Raffaele Mosca
Information Processing Letters
61
(3), 1997, pp. 137-143
A simple semi on-line algorithm for
P2//C_max
with a buffer
Guochuan Zhang
Information Processing Letters
61
(3), 1997, pp. 145-148
Resolving data conflicts with multiple versions and precedence relationships in real-time databases
Seok Hee Hong
,
Myoung Ho Kim
Information Processing Letters
61
(3), 1997, pp. 149-156
Seiten 1
2
3
>