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=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On hardness of one-way functions
O. Watanabe
Information Processing Letters
27
(3), 1988, March, pp. 151-157
Logic programming with external procedures: introducing S-unification
J. Leszczyƚowski
,
S. Bonnier
,
J. Maluszyński
Information Processing Letters
27
(3), 1988, March, pp. 159-165
On handling vertex deletion in updating minimum spanning trees
Y.H. Tsin
Information Processing Letters
27
(4), 1988, April, pp. 167-168
Message complexity of the set intersection problem
K.V.S. Ramarao
,
R. Daley
,
R. Melhem
Information Processing Letters
27
(4), 1988, April, pp. 169-174
Time and space efficient algorithms for shortest paths between convex polygons
H. Rohnert
Information Processing Letters
27
(4), 1988, April, pp. 175-179
Effects of message loss on the termination of distributed protocols
R. Koo
,
S. Toueg
Information Processing Letters
27
(4), 1988, April, pp. 181-188
On the convergence of stationary distributions in simulated annealing algorithms
U. Faigle
,
R. Schrader
Information Processing Letters
27
(4), 1988, April, pp. 189-194
On computing a conditional edge-connectivity of a graph
A.-H. Esfahanian
,
S.L. Hakimi
Information Processing Letters
27
(4), 1988, April, pp. 195-199
Remarks on languages acceptable in
\log\log n
space
A. Szepietowski
Information Processing Letters
27
(4), 1988, April, pp. 201-203
Generating
t
-ary trees in A-order
D. Roelants van Baronaigien
,
F. Ruskey
Information Processing Letters
27
(4), 1988, April, pp. 205-213
An exponential lower bound for the pure literal rule
K.M. Bugrara
,
P.W. Purdom
Information Processing Letters
27
(4), 1988, April, pp. 215-219
Recognizing majority on a one-way mesh
C. Savage
Information Processing Letters
27
(5), 1988, April, pp. 221-225
Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
H. Jung
,
K. Mehlhorn
Information Processing Letters
27
(5), 1988, April, pp. 227-236
On the computability of circumscription
T. Krishnaprasad
Information Processing Letters
27
(5), 1988, April, pp. 237-243
A study of page arrangements for extendible hashing
B.P. Weems
Information Processing Letters
27
(5), 1988, April, pp. 245-248
A new computation rule for PROLOG
A. Kumar
,
V.M. Malhotra
Information Processing Letters
27
(5), 1988, April, pp. 249-252
An incremental pattern matching algorithm for the pipelined lexical scanner
K. Itano
,
Y. Sato
,
H. Hirai
,
T. Yamagata
Information Processing Letters
27
(5), 1988, April, pp. 253-258
A linear-time algorithm for finding a minimum spanning pseudoforest
H.N. Gabow
,
R.E. Tarjan
Information Processing Letters
27
(5), 1988, April, pp. 259-263
The complexity of ultrametric partitions on graphs
M. Kȓivánek
Information Processing Letters
27
(5), 1988, April, pp. 265-270
A unified approach to domination problems on interval graphs
G. Ramalingam
,
C.P. Rangan
Information Processing Letters
27
(5), 1988, April, pp. 271-274
Line arrangements and range search
J. Matous̑ek
Information Processing Letters
27
(6), 1988, May, pp. 275-280
On the factors of the Thue-Morse word on three symbols
A. de Luca
,
S. Varricchio
Information Processing Letters
27
(6), 1988, May, pp. 281-285
A better lower bound for distributed leader finding in bidirectional, asynchronous rings of processors
H.L. Bodlaender
Information Processing Letters
27
(6), 1988, May, pp. 287-290
Shifting timestamps for concurrency control in an information hierarchy
M. Hsu
,
S.E. Madnick
Information Processing Letters
27
(6), 1988, May, pp. 291-297
Optimal fault-tolerant distributed construction of a spanning forest
S. Kutten
Information Processing Letters
27
(6), 1988, May, pp. 299-307
Seiten
<
1
2
3
>