Filter your results
- 4
- 2
- 3
- 2
- 1
- 6
- 2
- 1
- 1
- 1
- 1
- 6
- 3
- 2
- 1
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
Fast algorithms for single and multiple pattern Cartesian tree matchingTheoretical Computer Science, 2021, 849, pp.47-63. ⟨10.1016/j.tcs.2020.10.009⟩
Journal articles
hal-03210300v1
|
|||
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions34th IEEE Annual Symposium on Foundations of Computer Science (FOCS'93), 1993, Palo Alto, California, United States. pp.248-258
Conference papers
hal-00619908v1
|
|||
|
A Linear Time Algorithm for Constructing Hierarchical Overlap GraphsCPM 2021 - 32nd Annual Symposium on Combinatorial Pattern Matching, Institute of Computer Science of University of Wrocław, Poland., Jul 2021, Wrocław, Poland. pp.22:1--22:9, ⟨10.4230/LIPIcs.CPM.2021.22⟩
Conference papers
lirmm-03431830v1
|
||
Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, ProceedingsSpringer-Verlag, 441pp., 2005
Books
hal-00620511v1
|
|||
Constant-time randomized parallel string matchingSIAM Journal on Computing, 1997, 26 (4), pp.950-960
Journal articles
hal-00619561v1
|
|||
|
Efficient Construction of Hierarchical Overlap GraphsSPIRE 2020 - 27th International Symposium on String Processing and Information Retrieval, Oct 2020, Orlando, FL, United States. pp.277-290, ⟨10.1007/978-3-030-59212-7_20⟩
Conference papers
lirmm-03014336v1
|