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: Author="Leininger, B.S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the simplification and equivalence problems for straight-line programs
O.H. Ibarra
,
B.S. Leininger
Journal of the ACM
30
(3), 1983, pp. 641-656
On the zero-inequivalence problem for loop programs
O.H. Ibarra
,
B.S. Leininger
Journal of Computer and System Sciences
26
(1), 1983, February, pp. 47-64
On the complexity of simple arithmetic expressions
O.H. Ibarra
,
B.S. Leininger
,
S. Moran
Theoretical Computer Science
19
, 1982, pp. 17-28
Straight-line programs with one input variable
O.H. Ibarra
,
B.S. Leininger
SIAM Journal on Computing
11
(1), 1982, February, pp. 1-14
The complexity of the equivalence problem for simple loop-free programs
O.H. Ibarra
,
B.S. Leininger
SIAM Journal on Computing
11
(1), 1982, February, pp. 15-27
Characterizations of Presburger functions
O.H. Ibarra
,
B.S. Leininger
SIAM Journal on Computing
10
(1), 1981, February, pp. 22-39
The complexity of the equivalence problem for straight-line programs
O.H. Ibarra
,
B.S. Leininger
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC'80 (Los Angeles, CA, April 28-30, 1980)
, 1980, pp. 273-280