Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFCS
/
Paper
Computational Complexity of String and Graph Identification.
A. O. Slisenko
Venue
B
MFCS
Year
1979
Proceedings
MFCS
DBLP record
conf/mfcs/Slisenko79 ↗
Browse the full
MFCS paper archive
.