1 - 2 out of 2Page size: 10
  1. 2025

  2. A parallel algorithm for counting parse trees

    Михельсон, М. Н. & Охотин, А. С., 1 Mar 2025, In: Information and Computation. 303, 19 p., 105237.

    Research output: Contribution to journal › Article › peer-review

  3. 2023

  4. Parallel Enumeration of Parse Trees

    Михельсон, М. Н. & Охотин, А. С., Aug 2023, 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 272. p. 67:1-67:14 14 p. 67. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 272).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

ID: 45556404