-
1
المؤلفون: Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
المصدر: Algorithmica.
مصطلحات موضوعية: General Computer Science, Applied Mathematics, Computer Science Applications
-
2
المساهمون: University of Wrocław [Poland] (UWr), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Scalable, Optimized and Parallel Algorithms for Genomics (GenScale), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-GESTION DES DONNÉES ET DE LA CONNAISSANCE (IRISA-D7), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Université de Rennes (UR), ANR-20-CE48-0001,PARSe,Algorithmes d'approximation et randomisés pour le traitement de texte(2020)
المصدر: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics, pp.670-694, 2022, ⟨10.1137/1.9781611977073.30⟩مصطلحات موضوعية: [INFO]Computer Science [cs]
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de8a995ee85145a9c1262cc9ee91bf1e
https://hal.science/hal-03887523/file/1.9781611977073.30.pdf -
3
المصدر: String Processing and Information Retrieval ISBN: 9783031206429
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::9da9accd33d18923d28aa19b49335af7
https://doi.org/10.1007/978-3-031-20643-6_23 -
4
المؤلفون: Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
المساهمون: Bar-Ilan University [Israël], Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)
المصدر: 33rd SODA 2022
33rd SODA 2022, 2022, Alexandria ( Virtual Conference), United Statesمصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), [INFO]Computer Science [cs]
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::991d0182ea9380d38340f512bd19bb61
http://arxiv.org/abs/2111.02336 -
5
المؤلفون: Tatiana Starikovskaya, Paweł Gawrychowski, Bartłomiej Dudek
المساهمون: University of Wrocław [Poland] (UWr), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)
المصدر: STOC
Proceedings of the 52nd annual ACM SIGACT Symposium on Theory of Computing (STOC) 2020
Proceedings of the 52nd annual ACM SIGACT Symposium on Theory of Computing (STOC) 2020, 2020, Chicago, United Statesمصطلحات موضوعية: FOS: Computer and information sciences, Conjecture, Reduction (recursion theory), Existential quantification, Zero (complex analysis), Parameterized complexity, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Combinatorics, Integer, 010201 computation theory & mathematics, Simple (abstract algebra), Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, Linear equation, Mathematics
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b0bacfdf254ee215059439fa4e15fb5f
https://doi.org/10.1145/3357713.3384275 -
6
المساهمون: Recherche Opérationnelle (RO), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), École normale supérieure - Paris (ENS Paris)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)
المصدر: SODA 2019-Symposium on Discrete Algorithms
SODA 2019-Symposium on Discrete Algorithms, Jan 2019, San Diego, United Statesمصطلحات موضوعية: FOS: Computer and information sciences, approximate text indexing, lower bounds, Hamming distance, strong exponential time hypothesis, Computer Science - Data Structures and Algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], pointer-machine, Data Structures and Algorithms (cs.DS), edit distance, and phrases Lower bound, dictionary look-up
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d8336b8f13c8aec98096e5a33950c02
https://hal.archives-ouvertes.fr/hal-01960182/file/main-blast.pdf -
7
المؤلفون: Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya
المساهمون: Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)
المصدر: Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)
Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), Jan 2018, New Orleans, United States. ⟨10.1137/1.9781611975031.100⟩مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), [INFO]Computer Science [cs], ComputingMilieux_MISCELLANEOUS
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::452d5ccc3e827e21bd4ecdacc462424a
https://hal-cnrs.archives-ouvertes.fr/hal-02349997 -
8
المؤلفون: Tatiana Starikovskaya, Paweł Gawrychowski
المساهمون: University of Wrocław [Poland] (UWr), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)
المصدر: 30th Annual Symposium on Combinatorial Pattern Matching CPM 2019
30th Annual Symposium on Combinatorial Pattern Matching CPM 2019, 2019, Pisa (IT), Italy. ⟨10.4230/LIPIcs.CPM.2019.21⟩مصطلحات موضوعية: FOS: Computer and information sciences, 000 Computer science, knowledge, general works, General Computer Science, Series (mathematics), Matching (graph theory), Applied Mathematics, Hamming distance, 0102 computer and information sciences, 02 engineering and technology, Space (mathematics), 01 natural sciences, Upper and lower bounds, Substring, Computer Science Applications, Combinatorics, 010201 computation theory & mathematics, Position (vector), 020204 information systems, Computer Science, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Data Structures and Algorithms (cs.DS), Streaming algorithm, Mathematics
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b292fefdcc06a2af733aa3d4be88c59
-
9
المؤلفون: Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
مصطلحات موضوعية: FOS: Computer and information sciences, General Computer Science, Applied Mathematics, Hash function, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Upper and lower bounds, Substring, Computer Science Applications, Running time, Longest common substring problem, Combinatorics, Character (mathematics), 010201 computation theory & mathematics, Theory of computation, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Data Structures and Algorithms (cs.DS), Time complexity, Mathematics
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85775fa956276db02973a614c67d1065
-
10
المؤلفون: Tatiana Starikovskaya, Jakub Radoszewski
المساهمون: University of Warsaw (UW), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)
المصدر: Conference Data Compression Conference (DCC) 2017
Conference Data Compression Conference (DCC) 2017, 2017, Snowbird (USA), United States
DCCمصطلحات موضوعية: FOS: Computer and information sciences, Series (mathematics), Computer science, Approximation algorithm, Hamming distance, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Substring, Computer Science Applications, Theoretical Computer Science, Task (computing), Computational Theory and Mathematics, 010201 computation theory & mathematics, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Feature (machine learning), Data Structures and Algorithms (cs.DS), 020201 artificial intelligence & image processing, [INFO]Computer Science [cs], Pattern matching, Representation (mathematics), Streaming algorithm, Algorithm, Information Systems
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::931853c82a187039e637762dec4fafac
https://hal.science/hal-03942923/document
Find this article in full text from Springer Verlag.