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=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximum flow in (s,t) planar networks
R. Hassin
Information Processing Letters
13
(3), 1981, December, pp. 107
Author's reply to S. Moran's note on the shortest path problem
Francesco Romani
Information Processing Letters
13
, 1981, pp. 87
A fast algorithm for finding all shortest paths
Osamu Watanabe
Information Processing Letters
13
, 1981, pp. 1-3
Expected complexity of fast search with uniformly distributed data
G.N. Lewis
,
N.J. Boynton
,
F.W. Burton
Information Processing Letters
13
(1), 1981, October, pp. 4-7
Constructing full spanning trees for cubic graphs
J.A. Storer
Information Processing Letters
13
(1), 1981, October, pp. 8-11
Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication
O.H. Ibarra
,
S. Moran
Information Processing Letters
13
(1), 1981, October, pp. 12-15
Greedy binary search trees are nearly optimal
J.F. Korsh
Information Processing Letters
13
(1), 1981, October, pp. 16-19
On the optimality of semidynamic routing schemes
A.K. Agrawala
,
S.K. Tripathi
Information Processing Letters
13
(1), 1981, October, pp. 20-22
Hardware address translation for machines with a large virtual memory
K. Ramamohanarao
,
R. Sacks-Davis
Information Processing Letters
13
(1), 1981, October, pp. 23-29
A new class of C.F.L. for which the equivalence is decidable
G. Senizergues
Information Processing Letters
13
, 1981, pp. 30-34
Degrees of constancy in programming languages
H.I.E. Gunn
,
D.M. Harland
Information Processing Letters
13
(1), 1981, October, pp. 35-38
An approach to the problems of routing optimization in the regions of intricate shape
Yu.G. Stoyan
,
S.V. Smelyakov
Information Processing Letters
13
(1), 1981, October, pp. 39-43
The inclusion of d0l in multi-reset
M. Clerbout
,
M. Latteux
Information Processing Letters
13
(2), 1981, November, pp. 45-47
Using duality for the synthesis of an optimal algorithm involving matrix multiplication
O.M. Makarov
Information Processing Letters
13
(2), 1981, November, pp. 48-49
Real-time queue operations in pure LISP
R. Hood
,
R. Melville
Information Processing Letters
13
(2), 1981, November, pp. 50-54
An adversary-based lower bound for sorting
M.J. Atallah
,
S.R. Kosaraju
Information Processing Letters
13
(2), 1981, November, pp. 55-57
The dynamic simulation of recursive and stack manipulating programs
W. Rytter
Information Processing Letters
13
(2), 1981, November, pp. 58-63
On the average height of trees in digital search and dynamic hashing
M. Regnier
Information Processing Letters
13
(2), 1981, November, pp. 64-66
Optimal choice of discriminators in a balanced
k
-
d
binary search tree
Y.V. Silva Filho
Information Processing Letters
13
(2), 1981, November, pp. 67-70
The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities
V.Ya. Pan
Information Processing Letters
13
(2), 1981, November, pp. 71-72
Nts grammars and church-Rosser systems
R.V. Book
Information Processing Letters
13
(2), 1981, November, pp. 73-76
A shared-memory scheme for coalesced hashing
Jeffrey Scott Vitter
Information Processing Letters
13
, 1981, pp. 77-79
Some remarks on one-pebble rectangular array acceptors
A. Nakamura
Information Processing Letters
13
(2), 1981, November, pp. 80-84
A note on 'is shortest path problem not harder than matrix multiplication?'
S. Moran
Information Processing Letters
13
(2), 1981, November, pp. 85-86
On the decidability of equivalence for deterministic pushdown transducers
O.H. Ibarra
,
L.E. Rosier
Information Processing Letters
13
(3), 1981, December, pp. 89-93
Seiten 1
2
3
>