A. O. Slisenko

According to our database1, A. O. Slisenko authored at least 4 papers between 1978 and 1982.

Collaborative distances:
  • Dijkstra number2 of seven.
  • Erdős number3 of six.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1982
Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems.
Inf. Process. Lett., 1982

1979
Computational Complexity of String and Graph Identification.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

What can we do with problems of exhaustive search?.
Proceedings of the Algorithms in Modern Mathematics and Computer Science, 1979

1978
String-Matching in Real Time: Some Properties of the Data Structure.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978


  Loading...