DE eng

Search in the Catalogues and Directories

Hits 1 – 17 of 17

1
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures
Nakashima, Katsuhito; Fujisato, Noriki; Hendrian, Diptarama. - : LIPIcs - Leibniz International Proceedings in Informatics. 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2020
BASE
Show details
2
String Indexing with Compressed Patterns
Bille, Philip; Steiner, Teresa Anna. - : LIPIcs - Leibniz International Proceedings in Informatics. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), 2020
BASE
Show details
3
Online Algorithms for Constructing Linear-Size Suffix Trie
Hendrian, Diptarama; Takagi, Takuya; Inenaga, Shunsuke. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019
BASE
Show details
4
Cartesian Tree Matching and Indexing
Park, Sung Gwan; Amir, Amihood; Landau, Gad M.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019
BASE
Show details
5
Sufficient Conditions for Efficient Indexing Under Different Matchings
Amir, Amihood; Kondratovsky, Eitan. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019
BASE
Show details
6
Streaming Periodicity with Mismatches
Grigorescu, Elena; Sadeqi Azer, Erfan; Zhou, Samson. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017), 2017
BASE
Show details
7
Real-Time Streaming Multi-Pattern Search for Constant Alphabet
Golan, Shay; Porat, Ely. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 25th Annual European Symposium on Algorithms (ESA 2017), 2017
BASE
Show details
8
Algorithm Engineering for All-Pairs Suffix-Prefix Matching
Lim, Jihyuk; Park, Kunsoo. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 16th International Symposium on Experimental Algorithms (SEA 2017), 2017
BASE
Show details
9
Structural Pattern Matching - Succinctly
Ganguly, Arnab; Shah, Rahul; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017
BASE
Show details
10
Lempel-Ziv Compression in a Sliding Window
Bille, Philip; Cording, Patrick Hagge; Fischer, Johannes. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017
BASE
Show details
11
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
Fischer, Johannes; Kurpicz, Florian. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016
BASE
Show details
12
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap
Amir, Amihood; Kopelowitz, Tsvi; Levy, Avivit. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th International Symposium on Algorithms and Computation (ISAAC 2016), 2016
BASE
Show details
13
Succinct Online Dictionary Matching with Improved Worst-Case Guarantees
Kopelowitz, Tsvi; Porat, Ely; Rozen, Yaron. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016
BASE
Show details
14
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
Nguyen Thi, Thu Hien. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. : LIPIcs - Leibniz International Proceedings in Informatics. 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 2013
BASE
Show details
15
Optimal Packed String Matching
Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011. : LIPIcs - Leibniz International Proceedings in Informatics. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), 2011
BASE
Show details
16
Reverse Engineering Prefix Tables
Clement, Julien; Crochemore, Maxime; Rindone, Giuseppina. - : LIPIcs - Leibniz International Proceedings in Informatics. 26th International Symposium on Theoretical Aspects of Computer Science, 2009
BASE
Show details
17
Information Access to Historical Documents from the Early New High German Period
Leiss, Elisabeth; Wanzeck, Christiane; Schulz, Klaus U.. - : Dagstuhl Seminar Proceedings. 06491 - Digital Historical Corpora- Architecture, Annotation, and Retrieval, 2007
BASE
Show details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
17
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern