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=14
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on the sufficiency of Sokolowski's criterion for context-free languages
A. Nijholt
Information Processing Letters
14
(5), 1982, July, pp. 207
On the computational power of the floor function
A. Schmitt
Information Processing Letters
14
(1), 1982, March, pp. 1-3
Arithmetic of finite fields
B.-Z. Chor
Information Processing Letters
14
(1), 1982, March, pp. 4-6
Parallel algorithms for the connected components and minimal spanning tree problems
D. Nath
,
S.N. Maheshwari
Information Processing Letters
14
(1), 1982, March, pp. 7-11
A note on ``Master keys for group sharing''
A.E. Brouwer
,
P. van Emde Boas
Information Processing Letters
14
(1), 1982, March, pp. 12-14
Writing a number as the sum of two squares: a new solution
R. Backhouse
Information Processing Letters
14
(1), 1982, March, pp. 15-17
On the size of projections: I
E. Gelenbe
,
D. Gardy
Information Processing Letters
14
(1), 1982, March, pp. 18-21
Compile time type checking of structure field accessing
H.I.E. Gunn
Information Processing Letters
14
(1), 1982, March, pp. 22-25
A hierarchical clustering algorithm using strong components
R.E. Tarjan
Information Processing Letters
14
(1), 1982, March, pp. 26-29
Sensitivity analysis of minimum spanning trees and shortest path trees
Robert Endre Tarjan
Information Processing Letters
14
, 1982, March, pp. 30-33
Efficient recognition of rational relations
J. van Leeuwen
,
M. Nivat
Information Processing Letters
14
(1), 1982, March, pp. 34-38
Some observations on the probabilistic algorithms and NP-hard problems
K.-I. Ko
Information Processing Letters
14
(1), 1982, March, pp. 39-43
Generation and ranking of
k
-ary trees
S. Zaks
Information Processing Letters
14
(1), 1982, March, pp. 44-48
A simple deduction method for modal logic
L. Fariñas del Cerro
Information Processing Letters
14
(2), 1982, April, pp. 49-51
Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
A.O. Slisenko
Information Processing Letters
14
(2), 1982, April, pp. 52-56
Strong equivalence of relational expressions under dependencies
M.H. Graham
,
A.O. Mendelzon
Information Processing Letters
14
(2), 1982, April, pp. 57-62
Minimal storage representations for binary relations
J.C. Lagarias
,
D.E. Swartwout
Information Processing Letters
14
(2), 1982, April, pp. 63-66
The automatic synthesis of iterative programs
G. Gini
Information Processing Letters
14
(2), 1982, April, pp. 67-73
Polygonal intersection searching
H. Edelsbrunner
,
H.A. Maurer
,
D.G. Kirkpatrick
Information Processing Letters
14
(2), 1982, April, pp. 74-79
A simple transfer lemma for algebraic specifications
J.A. Bergstra
,
J.-J.Ch. Meyer
Information Processing Letters
14
(2), 1982, April, pp. 80-85
Formal correctness proofs of a nondeterministic program
E. Upfal
Information Processing Letters
14
(2), 1982, April, pp. 86-92
Parallel computation and conflicts in memory access
L. Kuc̑era
Information Processing Letters
14
(2), 1982, April, pp. 93-96
A three-restricted normal form theorem for ETOL languages
T. Yokomori
,
D. Wood
,
K.-J. Lange
Information Processing Letters
14
(3), 1982, May, pp. 97-100
LR parsing of some ambiguous grammars
J. Tarhio
Information Processing Letters
14
(3), 1982, May, pp. 101-103
An algorithm for verifying equations of morphisms in a category
D. Wätjen
,
W. Struckmann
Information Processing Letters
14
(3), 1982, May, pp. 104-108
Seiten 1
2
3
>