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=22
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Convex hull made easy
M. Kallay
Information Processing Letters
22
(3), 1986, March, pp. 161
On transformations of algorithms to multiply
2\times 2
matrices
P. Chatelin
Information Processing Letters
22
(1), 1986, January, pp. 1-5
Every iterated morphism yields a co-CFL
J. Berstel
Information Processing Letters
22
(1), 1986, January, pp. 7-9
The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms
V.Ya. Pan
Information Processing Letters
22
(1), 1986, January, pp. 11-14
On termination and phase changes in the presence of unreliable communication
B. Baumgarten
,
P. Ochsenschläger
Information Processing Letters
22
(1), 1986, January, pp. 15-20
Linear programming in
O(n\cdot 3^{d^2})
time
K.L. Clarkson
Information Processing Letters
22
(1), 1986, January, pp. 21-24
The greedy and Delauney triangulations are not bad in the average case
A. Lingas
Information Processing Letters
22
(1), 1986, January, pp. 25-31
A note on Presburger arithmetic with array segments, permutation and equality
L.E. Rosier
Information Processing Letters
22
(1), 1986, January, pp. 33-35
Hexagonal unit network - a tool for proving the
NP
-completeness results of geometric problems
M. Kȓivánek
Information Processing Letters
22
(1), 1986, January, pp. 37-41
Two results on tables
C.T.M. Jacobs
,
P. van Emde Boas
Information Processing Letters
22
(1), 1986, January, pp. 43-48
Tree-like parse and polynomial subclasses of search problems
V. Kriauc̑iukas
Information Processing Letters
22
(1), 1986, January, pp. 49-54
A note on approximate convex hulls
I. Stojmenović
,
E. Soisalon-Soininen
Information Processing Letters
22
(2), 1986, January, pp. 55-56
An improved parallel algorithm for maximal matching
A. Israeli
,
Y. Shiloach
Information Processing Letters
22
(2), 1986, January, pp. 57-60
EDISON-80, a language for modular programming of parallel processes
Ke-Chang Dai
Information Processing Letters
22
(2), 1986, January, pp. 61-72
A lower bound to the complexity of Euclidean and rectilinear matching algorithms
M.D. Grigoriadis
,
B. Kalantari
Information Processing Letters
22
(2), 1986, January, pp. 73-76
A fast and simple randomized parallel algorithm for maximal matching
A. Israeli
,
A. Itai
Information Processing Letters
22
(2), 1986, January, pp. 77-80
Lower bounds on parallel algorithms for finding the first maximal independent set
C.U. Martel
Information Processing Letters
22
(2), 1986, January, pp. 81-85
Some remarks on the possibility of extending resolution proof procedures to intuitionistic logic
M. Cialdea
Information Processing Letters
22
(2), 1986, January, pp. 87-90
Verifying nonrigidity
P. Goralc̑ik
,
V. Koubek
Information Processing Letters
22
(2), 1986, January, pp. 91-95
Exact balancing is not always good
M. Snir
Information Processing Letters
22
(2), 1986, January, pp. 97-102
A class of differential equations for testing variable-step-size integration
M.B. Webster
,
P.W. Baker
Information Processing Letters
22
(2), 1986, January, pp. 103-107
On probability of forest of quadtrees reducing to quadtrees
P. Srinivas Kumar
,
M. Manohar
Information Processing Letters
22
(3), 1986, March, pp. 109-111
Inhomogeneities in the polynomial-time degrees: the degrees of super sparse sets
K. Ambos-Spies
Information Processing Letters
22
(3), 1986, March, pp. 113-117
The one-dimensional weighted Voronoi diagram
F. Aurenhammer
Information Processing Letters
22
(3), 1986, March, pp. 119-123
Square-free words on partially commutative free monoids
A. Carpi
,
A. de Luca
Information Processing Letters
22
(3), 1986, March, pp. 125-131
Seiten 1
2
3
>