on the algorithms for arithmetic operators programming

with inscription "Paper drafts; started: 3.02.63, finished: 22.01.64"

with inscription "Storage packing problem (second definition) №7.Graph coloring methods. Started" 31.08.61, put aside: 21.02.63"

inscripted: "Storage packing problem"

with inscription "Storage packing problem. №6.Solution for operator schemata with arrays. Started: 29.06.61, finished: 25.08.61"

inscripted:"Manuscript of a paper for "DAN". Started: 28.05.61"

with inscription "Storage packing problem.№8. Implementation of the algorithms in ALPHA-compiler. Started:3.2.63, Finished: 28.1.64"

inscribed:"First draft of the DAN paper. August 12-20, 1961"

containing series expansion of many functions

entitled "Storage packing problem (second definition). Problem statement and necessary criteria"

Storage packing problem (second definition). Algorithm of building a graph of identification impossibilities

Storage packing problem (second definition). Problems of graph coloring

Storage packing problem (second definition) for operator schemata with only scalar values

"On connection between the problem of memory allocation and the graph coloring problem" for "Doklady Akademii Nauk" (handwritten)

made during the work on the paper "On connection between the problem of memory allocation and the graph coloring problem"

entitled "Upper bound", made during the work on the paper "On the chromatic number estimate for connected graphs"

entitled "Lower bound. First feeble attempts", made during the work on the paper "On the chromatic number estimate for connected graphs"

entitled "Elementary estimate derivation. Together with Gena" made during the work on the paper "On the chromatic number estimate for connected graphs"

entitled "First version of a coherent account of the lower bound" made during the work on the paper "On the chromatic number estimate for connected graphs"

entitled "Derivation of more bounds" made during the work on the paper "On the chromatic number estimate for connected graphs"