• Refine your search:
  • 
    Keyword:
    
    • Data processing Computer science (6)
    • FOS Computer and information sciences (3)
    • String Algorithms (3)
    • Suffix Trees (3)
    • Burrows - Wheeler transform (2)
    • Compression (2)
    • Computer Science (2)
    • Data Structures (2)
    • Data Structures and Algorithms cs.DS (2)
    • FM-Index (2)
    •   more
  • 
    Creator / Publisher
  • 
    Year:
    
    • 2020 (3)
    • 2019 (4)
    • 2018 (1)
    • 2017 (2)
    • 2016 (2)
    • 2015 (1)
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access:
    • free (13)
    • subject to license (0)

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 13 of 13 1 FM-Index Reveals the Reverse Suffix Array Gibney, Daniel; Thankachan, Sharma V.; Hooshmand, Sahar. - : LIPIcs - Leibniz International Proceedings in Informatics. 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2020 BASE Show details 2 FM-Index Reveals the Reverse Suffix Array ... Ganguly, Arnab; Gibney, Daniel; Hooshmand, Sahar. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 3 On the Complexity of BWT-Runs Minimization via Alphabet Reordering ... Bentley, Jason W.; Gibney, Daniel; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 4 On the Hardness and Inapproximability of Recognizing Wheeler Graphs Gibney, Daniel; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual European Symposium on Algorithms (ESA 2019), 2019 BASE Show details 5 On the Hardness and Inapproximability of Recognizing Wheeler Graphs ... Gibney, Daniel; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2019 BASE Show details 6 On the Complexity of BWT-runs Minimization via Alphabet Reordering ... Bentley, Jason; Gibney, Daniel; Thankachan, Sharma V.. - : arXiv, 2019 BASE Show details 7 On the Hardness and Inapproximability of Recognizing Wheeler Graphs ... Gibney, Daniel; Thankachan, Sharma V.. - : arXiv, 2019 BASE Show details 8 Non-Overlapping Indexing - Cache Obliviously Hooshmand, Sahar; Abedin, Paniz; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. : LIPIcs - Leibniz International Proceedings in Informatics. Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018 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 Structural Pattern Matching - Succinctly ... Ganguly, Arnab; Shah, Rahul; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2017 BASE Show details 11 Space-Time Trade-Offs for the Shortest Unique Substring Problem Ganguly, Arnab; Hon, Wing-Kai; Shah, Rahul. - : 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 12 Parameterized Pattern Matching -- Succinctly ... Ganguly, Arnab; Shah, Rahul; Thankachan, Sharma V.. - : arXiv, 2016 BASE Show details 13 Forbidden Extension Queries Biswas, Sudip; Ganguly, Arnab; Shah, Rahul. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. : LIPIcs - Leibniz International Proceedings in Informatics. 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015), 2015 BASE Show details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 13 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0