Skip to main content
SpringerLink
Log in

Computational complexity of string and graph ident ification

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1979 (MFCS 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 74))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Slisenko A.O., String-matching in real-time: some properties of the data structure. Lect.Notes Comput.Sci, 1978, 64, 493–496.

    Google Scholar 

  2. Слисенко АО., Сложностные задачи теории вычислений. Препринт. ВИНИТИ, М., 1979.

    Google Scholar 

  3. Angluin D., Valiant L.G., Fast probabilistic algorithms for Hamiltonian circuits and matching. CSR-17-77, Dept.Comput.Sci., Univ.of Edinburgh, 1977.

    Google Scholar 

  4. Schönhage A., Storage modification machines. Univ.Tübingen, Math. Inst., 1979,45 pp.

    Google Scholar 

  5. Hopcroft J., Paul W., Valiant L., On time versus space and related problems. IEEE 16th Annu.Symp.Found.Comput.Sci., Berkeley, California, 1975, 57–64.

    Google Scholar 

  6. Слисенко А.О., Распоэнавание предиката вхождения в реальное время. Препринт ЛОМИ P-7-77, Л енинград, 1977.

    Google Scholar 

  7. Weiner P., Linear pattern-matching algorithm. IEEE 14th Symp. Switch. and Automata Theory, Iowa, 1973, 1–11.

    Google Scholar 

  8. Rodeh M., Pratt V., Even S., A linear algorithm for finding repetitions and its applications in data compression. TR 72,April, 1976, Technion-Israel Inst. of Technology, Dept.Comput.Sci., Haifa.

    Google Scholar 

  9. Слисенко А.А., Упрощенное доказательство распоэнаваемости симмет — ричности слов в реальное время. Записки научных семинаров ЛОМИ, 1977, 68, 123–139.

    Google Scholar 

  10. Fischer M.J., Paterson M.S., String-matching and other products. "Complexity of Computations" (SIAM-AMS Proc., Vol. 7), Providence, R. I., 1974, 113–125.

    Google Scholar 

  11. Read R.C., Corneil D.G., The graph isomorphism disease. J.Graph Theory, 1977, 1, 339–363.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LOMI, Fontanka 27, 191011, Leningrad, USSR

    A. O. Slisenko

Authors
  1. A. O. Slisenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Slisenko, A.O. (1979). Computational complexity of string and graph ident ification. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation