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=15
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A linear algorithm to determine minimal spanning forests in chain graphs
F. Luccio
,
L. Pagli
Information Processing Letters
15
(1), 1982, August, pp. 1-4
A note on two-way nondeterministic pushdown automata
W. Rytter
Information Processing Letters
15
(1), 1982, August, pp. 5-9
Tables of large graphs with given degree and diameter
J.-C. Bermond
,
C. Delorme
,
J.-J. Quisquater
Information Processing Letters
15
(1), 1982, August, pp. 10-13
NP
-completeness of some generalizations of the maximum matching problem
L.J. Stockmeyer
,
V.V. Vazirani
Information Processing Letters
15
(1), 1982, August, pp. 14-19
A memory management unit for the optimal exploitation of a small address space
C. Bron
,
E.J. Dijkstra
,
S.D. Swierstra
Information Processing Letters
15
(1), 1982, August, pp. 20-22
Optimal database reorganisation: some practical difficulties
C.H.C. Leung
Information Processing Letters
15
(1), 1982, August, pp. 23-27
A labeling algorithm to recognize a line digraph and output its root graph
M.M. Sysƚo
Information Processing Letters
15
(1), 1982, August, pp. 28-30
Efficient parallel algorithms for linear recurrence computation
A.C. Greenberg
,
R.E. Ladner
,
M.S. Paterson
,
Z. Galil
Information Processing Letters
15
(1), 1982, August, pp. 31-35
On computability of the mean deviation
P.M. Winkler
Information Processing Letters
15
(1), 1982, August, pp. 36-38
A note on some tree similarity measures
K. Culik II
,
D. Wood
Information Processing Letters
15
(1), 1982, August, pp. 39-42
An improved list-searching algorithm
L.S. Levy
Information Processing Letters
15
(1), 1982, August, pp. 43-45
Steady-paced-output and fractional-on-line algorithms on a RAM
G.K. Manacher
Information Processing Letters
15
(2), 1982, September, pp. 47-52
Partially specified nearest neighbor searches using k-d trees
C.M. Eastman
,
M. Zemankova
Information Processing Letters
15
(2), 1982, September, pp. 53-56
On multiset orderings
J.-P. Jouannaud
,
P. Lescanne
Information Processing Letters
15
(2), 1982, September, pp. 57-63
The towers of Hanoi revisited: moving the rings by counting the moves
T.R. Walsh
Information Processing Letters
15
(2), 1982, September, pp. 64-67
Permutations are not context-free: an application of the interchange lemma
M.G. Main
Information Processing Letters
15
(2), 1982, September, pp. 68-71
Average time analyses of simplified Davis-Putnam procedures
A. Goldberg
,
P. Purdom
,
C. Brown
Information Processing Letters
15
(2), 1982, September, pp. 72-75
Universal grammars
L. Łukaszewicz
Information Processing Letters
15
(2), 1982, September, pp. 76-80
Best possible asymptotic bounds on the depth of monotone functions in multivalued logic
I. Wegener
Information Processing Letters
15
(2), 1982, September, pp. 81-83
A note on a theorem by Ladner
J.L. Balcázar
,
J. Diaz
Information Processing Letters
15
(2), 1982, September, pp. 84-86
Fast algorithm for sparse matrix multiplication
A. Schoor
Information Processing Letters
15
(2), 1982, September, pp. 87-89
A homomorphism theorem for data base mappings
M. Spyratos
Information Processing Letters
15
(3), 1982, October, pp. 91-96
On the relationship between the LL(k) and LR(k) grammars
A. Nijholt
Information Processing Letters
15
(3), 1982, October, pp. 97-101
Time complexity of unambiguous path systems
W. Rytter
Information Processing Letters
15
(3), 1982, October, pp. 102-104
Robust, centralized certifier based concurrency control for distributed databases
P.G. Reddy
,
S. Bhalla
,
B.E. Prasad
Information Processing Letters
15
(3), 1982, October, pp. 105-110
Seiten 1
2
3
>