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"

for research of the methods of graph coloring

on the algorithms for arithmetic operators programming

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

"On connection between the problem of memory allocation and the graph coloring problem" (first version)

"On connection between the problem of memory allocation and the graph coloring problem" (second version)

"On chromatic number estimate for connected graphs" for "Doklady Akademii Nauk" (handwritten)

"On chromatic number estimate for connected graphs" for "Doklady Akademii Nauk" (first draft)

on the problems of memory cells and constants packing; on graph coloring and operator scheme construction

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

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

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

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

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