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=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sensitivity analysis of minimum spanning trees and shortest path trees
R.E. Tarjan
Information Processing Letters
23
(4), 1986, November, pp. 219
The space complexity of the unique decipherability problem
W. Rytter
Information Processing Letters
23
(1), 1986, July, pp. 1-3
Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs
Ferng-Ching Lin
,
Wei-Kuan Shih
Information Processing Letters
23
(1), 1986, July, pp. 5-9
The bounded subset sum problem is almost everywhere randomly decidable in
O(n)
G. Tinhofer
,
H. Schreck
Information Processing Letters
23
(1), 1986, July, pp. 11-17
On the maximum edge length in VLSI layouts of complete binary trees
H. Schmeck
Information Processing Letters
23
(1), 1986, July, pp. 19-23
On
\Delta_2^P
-immunity (complexity)
J.L. Balcázar
Information Processing Letters
23
(1), 1986, July, pp. 25-28
A note on the equivalence problem of rational formal power series
Karel Culik II
,
Juhani Karhumäki
Information Processing Letters
23
(1), 1986, July, pp. 29-31
A parallel reference counting algorithm
K. Kakuta
,
H. Nakamura
,
S. Iida
Information Processing Letters
23
(1), 1986, July, pp. 33-37
A note on the queens' problem
B.-J. Falkowski
,
L. Schmitz
Information Processing Letters
23
(1), 1986, July, pp. 39-46
Data algebra and its application in database design
O.M. Vikas
,
S.K. Basandra
Information Processing Letters
23
(1), 1986, July, pp. 47-54
A fully distributed (minimal) spanning tree algorithm
I. Lavallee
,
G. Roucairol
Information Processing Letters
23
(2), 1986, August, pp. 55-62
Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
A. Apostolico
Information Processing Letters
23
(2), 1986, August, pp. 63-69
Shortest paths in the plane with convex polygonal obstacles
H. Rohnert
Information Processing Letters
23
(2), 1986, August, pp. 71-76
An implementation of mutual inclusion
R.R. Hoogerwoord
Information Processing Letters
23
(2), 1986, August, pp. 77-80
An application of Mehlhorn's algorithm for bracket languages to
\log(n)
space recognition of input-driven languages
W. Rytter
Information Processing Letters
23
(2), 1986, August, pp. 81-84
An algorithm for the derivation of codefinitions in computer programs
J. Laski
Information Processing Letters
23
(2), 1986, August, pp. 85-90
Comments on Morris's starvation-free solution to the mutual exclusion problem
J.K. Annot
,
M.D. Janssens
,
A.J. van de Goor
Information Processing Letters
23
(2), 1986, August, pp. 91-97
On gallery watchmen in grids
S. Ntafos
Information Processing Letters
23
(2), 1986, August, pp. 99-102
On the probabilistic performance of algorithms for the satisfiability problem
J. Franco
Information Processing Letters
23
(2), 1986, August, pp. 103-106
Area-time tradeoffs for bilinear forms computations in VLSI
B. Codenotti
,
G. Lotti
Information Processing Letters
23
(2), 1986, August, pp. 107-109
A VLSI fast solver for tridiagonal linear systems
B. Codenotti
,
G. Lotti
Information Processing Letters
23
(3), 1986, October, pp. 111-114
A noncommutative algorithm for multiplying 5*5 matrices using 102 multiplications
O.M. Makarov
Information Processing Letters
23
(3), 1986, October, pp. 115-117
A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions
T.-H. Lai
,
A. Sprague
Information Processing Letters
23
(3), 1986, October, pp. 119-122
Efficient selection on a binary tree
J. Cooper
,
S.G. Akl
Information Processing Letters
23
(3), 1986, October, pp. 123-126
Approximating functions by their Poisson transform
P.V. Poblete
Information Processing Letters
23
(3), 1986, October, pp. 127-130
Seiten 1
2
3
>