Cover, 13.05.1981-09.11.1981
Article, 13.05.1981The 1-st form of the paper "The tree equivalence of linear recursive schemata is polinomial-time decidable".
Letter, B. K. Rosen->A.P. Ershov, 01.06.1981
Letter with attachment, J. H. Gallier->A.P. Ershov, 01.07.1981
Post card, 29.10.1981
Article, 20.10.1981The 2-nd form of the paper "The tree equivalence of linear recursive schemata is polinomial-time decidable".
Receipt, 19.10.1981
Registration card, 22.10.1981
Letter (hand-written), A.P. Ershov->B. K. Rosen, 14.05.1981Request for an opinion on the paper by V. Sabelfeld "The tree equivalence of linear recursive schemata in polynomial-time decidable"; asks for the references to the up-to-date works on the subject of Ershov's presentation at the MFCS'81 Conference
Initial order | In alphabetical order | By date |
