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=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On distributed search
T. Herman
,
K.M. Chandy
Information Processing Letters
21
(3), 1985, September, pp. 129-133
A note on a special one-rule semi-Thue system
M. Jantzen
Information Processing Letters
21
(3), 1985, September, pp. 135-140
Creation and reflexive rights in grammatical protection systems
T.A. Budd
Information Processing Letters
21
(3), 1985, September, pp. 141-145
An
n^{1.618}
lower bound on the time to simulate one queue or two pushdown stores by one tape
P.M.B. Vitányi
Information Processing Letters
21
(3), 1985, September, pp. 147-152
An approach to the transportation of computer software
Chae Woo Yoo
Information Processing Letters
21
(3), 1985, September, pp. 153-157
VLSI implementation of fast solvers for band linear systems with constant coefficient matrix
B. Codenotti
,
F. Romani
,
G. Lotti
Information Processing Letters
21
(3), 1985, September, pp. 159-163
Fast dynamic intersection searching in a set of isothetic line segments
R.H. Güting
Information Processing Letters
21
(4), 1985, October, pp. 165-171
Enumeration of articulation pairs of a planar graph
J.-P. Laumond
Information Processing Letters
21
(4), 1985, October, pp. 173-179
Defining liveness
B. Alpern
,
F.B. Schneider
Information Processing Letters
21
(4), 1985, October, pp. 181-185
On zigzag permutations and comparisons of adjacent elements
M.D. Atkinson
Information Processing Letters
21
(4), 1985, October, pp. 187-189
A systolic array for the longest common subsequent problem
Y. Robert
,
M. Tchuente
Information Processing Letters
21
(4), 1985, October, pp. 191-198
On the efficient use of semaphore primitives
J.L. Keedy
,
B. Freisleben
Information Processing Letters
21
(4), 1985, October, pp. 199-205
k-fold bitonic sort on a mesh-connected parallel computer
C.C. Hsiao
,
N.-T. Shen
Information Processing Letters
21
(4), 1985, October, pp. 207-212
On different approximation criteria for subset product problems
A. Marchetti-Spaccamela
,
G. Romano
Information Processing Letters
21
(4), 1985, October, pp. 213-218
Incremental string matching
B. Meyer
Information Processing Letters
21
(5), 1985, November, pp. 219-227
Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets
J. Magott
Information Processing Letters
21
(5), 1985, November, pp. 229-232
The unwind property for programs with bounded memory
A.J. Kfoury
Information Processing Letters
21
(5), 1985, November, pp. 233-238
A note on natural selection
W. Dobosiewicz
Information Processing Letters
21
(5), 1985, November, pp. 239-243
Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations
P. Dúris̑
,
O. Sýkora
,
I. Vrt̑o
,
C.D. Thompson
Information Processing Letters
21
(5), 1985, November, pp. 245-247
Decomposing a set of points into chains, with applications to permutation and circle graphs
K.J. Supowit
Information Processing Letters
21
(5), 1985, November, pp. 249-252
An efficient Dijkstra-like labeling method for computing shortest odd/even paths
U. Derigs
Information Processing Letters
21
(5), 1985, November, pp. 253-258
A direct routing algorithm for the bit-reversal permutation on a shuffle-exchange network
I.J.M. Birkhoff
Information Processing Letters
21
(5), 1985, November, pp. 259-268
A fast algorithm for renaming a set of clauses as a Horn set
H. Mannila
,
K. Mehlhorn
Information Processing Letters
21
(5), 1985, November, pp. 269-272
Seiten
<
1
2