Archive
Software Projects
The ALPHA Project
Storage packing problem
Notes
on the algorithms for arithmetic operators programming
Working notes, 07.06.1961-29.07.1961
made during the work on the paper "On connection between the problem of memory allocation and the graph coloring problem"
Reports, 03.02.1963
on the problems of memory cells and constants packing; on graph coloring and operator scheme construction
Examplary planar graphs, 31.08.1961
for research of the methods of graph coloring
Paper, 28.05.1961
"On connection between the problem of memory allocation and the graph coloring problem" for "Doklady Akademii Nauk" (handwritten)
Paper, 12.08.1961-20.08.1961
"On connection between the problem of memory allocation and the graph coloring problem" (first version)
Paper, 21.08.1961-24.08.1961
"On connection between the problem of memory allocation and the graph coloring problem" (second version)
Paper, 29.06.1961
"On chromatic number estimate for connected graphs" for "Doklady Akademii Nauk" (handwritten)
Paper, 23.06.1961-29.06.1961
"On chromatic number estimate for connected graphs" for "Doklady Akademii Nauk" (first draft)
Working notes, 13.04.1961-07.06.1961
Storage packing problem (second definition) for operator schemata with only scalar values
Working notes, 06.01.1961-15.02.1961
Storage packing problem (second definition). Problems of graph coloring
Working notes, 12.10.1960-11.11.1960
Storage packing problem (second definition). Algorithm of building a graph of identification impossibilities
Cover
with inscription "Paper drafts; started: 3.02.63, finished: 22.01.64"
Cover
with inscription "Storage packing problem (second definition) 7.Graph coloring methods. Started" 31.08.61, put aside: 21.02.63"
Cover
inscripted: "Storage packing problem"
Cover
with inscription "Storage packing problem. 6.Solution for operator schemata with arrays. Started: 29.06.61, finished: 25.08.61"
Cover
inscripted:"Manuscript of a paper for "DAN". Started: 28.05.61"
Working notes, 08.06.1961-09.06.1961
entitled "Upper bound", made during the work on the paper "On the chromatic number estimate for connected graphs"
Working notes, 14.06.1961
entitled "Lower bound. First feeble attempts", made during the work on the paper "On the chromatic number estimate for connected graphs"
Working notes, 15.06.1961
entitled "Elementary estimate derivation. Together with Gena" made during the work on the paper "On the chromatic number estimate for connected graphs"

1 2
Initial order | In alphabetical order | By date

Switch to Russian | Search | Advanced search | Folders | Themes
Home Help in Russian Webmaster © Ershov's Institute of Informatics Systems, 2000-2016