1 - 4 out of 4Page size: 10
  1. 2022

  2. Computing The Maximum Exponent in a Stream

    Merkurev, O. & Shur, A. M., Mar 2022, In: Algorithmica. 84, 3, p. 742-756 15 p.

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

  3. 2020

  4. Optimal skeleton huffman trees revisited

    Kosolobov, D. & Merkurev, O., 1 Jan 2020, Computer Science – Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Proceedings. Fernau, H. (ed.). Springer Verlag, p. 276-288 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12159 LNCS).

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

  5. 2019

  6. Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams

    Gawrychowski, P., Merkurev, O., Shur, A. M. & Uznański, P., Sept 2019, In: Algorithmica. 81, 9, p. 3630-3654 25 p.

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

  7. Searching Runs in Streams

    Merkurev, O. & Shur, A. M., 1 Jan 2019, String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. Brisaboa, N. R. & Puglisi, S. J. (eds.). Springer Verlag, p. 203-220 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11811 LNCS).

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

ID: 42366