Search Results - "string algorithm"

Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12

    Source: SIAM Journal on Computing
    NARCIS
    Hyper Article en Ligne
    Datacite
    ORCID
    INRIA a CCSD electronic archive server
    arXiv.org e-Print Archive
    Vrije Universiteit Amsterdam (VU Amsterdam)-Institutional Repository
    Bernardini, G, Gawrychowski, P, Pisanti, N, Pissis, S P & Rosone, G 2022, ' ELASTIC-DEGENERATE STRING MATCHING VIA FAST MATRIX MULTIPLICATION ', SIAM Journal on Computing, vol. 51, no. 3, pp. 549-576 . https://doi.org/10.1137/20M1368033
    SIAM Journal on Computing, 2022, 51 (3), pp.549-576. ⟨10.1137/20M1368033⟩
    SIAM Journal on Computing, 51(3), 549-576
    SIAM Journal on Computing, 51(3), 549-576. Society for Industrial and Applied Mathematics Publications

    File Description: application/pdf

  13. 13

    Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001556429800012; ispartofbook:34th International Symposium on Algorithms and Computation (ISAAC 2023); International Symposium on Algorithms and Computation, ISAAC 2023; volume:283; firstpage:1; lastpage:19; numberofpages:19; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; https://hdl.handle.net/2434/1131463

  14. 14
  15. 15
  16. 16

    Source: Bringmann, K & Das, D 2021, A linear-time n 0.4-approximation for longest common subsequence . in N Bansal, E Merelli & J Worrell (eds), 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021 ., 39, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 198, pp. 1-20, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, Virtual, Glasgow, United Kingdom, 12/07/2021 . https://doi.org/10.4230/LIPIcs.ICALP.2021.39

    File Description: application/pdf

  17. 17
  18. 18
  19. 19

    Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-234-1; 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022); volume:223; firstpage:16:1; lastpage:16:17; numberofpages:17; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; info:eu-repo/grantAgreement/EC/H2020/872539; 956229; https://hdl.handle.net/11368/3024591; https://drops.dagstuhl.de/opus/volltexte/2022/16140/

  20. 20

    Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-234-1; 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022); volume:223; firstpage:12:1; lastpage:12:18; numberofpages:18; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; https://hdl.handle.net/11368/3024593; https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=16139