%PDF-1.4
%
1 0 obj
<>stream
Reverse-mode automatic differentiation; binomial checkpointing; treeverse; programming language theory; compiler theory; lambda calculus
iText 4.2.0 by 1T3XT
LaTeX with hyperref package
2018-10-08T05:33:10-07:00
2018-10-05T15:22:08+05:30
2018-10-08T05:33:10-07:00
application/pdf
Divide-and-conquer checkpointing for arbitrary programs with no user annotation
Jeffrey Mark Siskind; Barak A. Pearlmutter
Optimization Methods & Software, 2018. doi: 10.1080/10556788.2018.1459621
uuid:af63fc7d-7329-4325-bffc-ffd989a35ac6
uuid:950cbb19-097b-41a9-aa9d-edd2b7c39fba
10.1080/10556788.2018.1459621https://doi.org/10.1080/10556788.2018.14596212018-09-12truewww.tandfonline.com10.1080/10556788.2018.1459621www.tandfonline.comtrue2018-09-1210.1080/10556788.2018.1459621
endstream
endobj
4 0 obj
<>stream
xYK$5 3ݍa'`Z.}lNR5#2TU.??0[
h~~:|a0m4%fywM3v`ϭLp6Zs<>_;/_/3YP>^Y:.{ևb+3ukhs^aiE-ZQ-4F-.0ta"rWHzݙHMWE=Sfv]F0EcsH$=5W{K+iI3aLkwu/NsЇZDg4֊y2:um~t+1-ZŇjg,eF#݇| a>[p8ˢ OܵjEDMj~}3Zl|)sʙ - +MG\f>n @(B4衮eOw:2^.lq5z- WT*2P4I 9SB$R