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
[1]
Hilfe
Suche: Journal=J. ACM AND Volume=17
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Pseudo-Runge-Kutta methods of the fifth order
William B. Gruttke
Journal of the ACM
17
, 1970, pp. 613-628
A method for solving large matrix equations reduced from Fredholm integral equations of the second kind
Masahiro Hashimoto
Journal of the ACM
17
, 1970, pp. 629-636
Accumulation of round-off error in fast Fourier transforms
Toyohisa Kaneko
,
Bede Liu
Journal of the ACM
17
, 1970, pp. 637-654
Efficiency of a procedure for near-minimax approximation
L.F. Shampine
Journal of the ACM
17
, 1970, pp. 655-660
Error bounds for zeros of a polynomial based upon Gerschgorin's theorems
Brian T. Smith
Journal of the ACM
17
, 1970, pp. 661-674
Necessary and sufficient conditions for dynamic programming of combinatorial type
P. Bonzon
Journal of the ACM
17
, 1970, pp. 675-682
Statistical properties of the Buddy system
Paul W., Jr. Purdom
,
Stephen M. Stigler
Journal of the ACM
17
, 1970, pp. 683-697
The unit proof and the input proof in theorem proving
C.L. Chang
Journal of the ACM
17
, 1970, pp. 698-707
On the efficiency of algorithms
David Pager
Journal of the ACM
17
, 1970, pp. 708-714
The generation of optimal code for arithmetic expressions
Ravi Sethi
,
J.D. Ullman
Journal of the ACM
17
, 1970, pp. 715-728
The equivalence problem of simple programs
D. Tsichritzis
Journal of the ACM
17
, 1970, pp. 729-738
Seiten
<
1
2
3