• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher:
    
    • Thankachan, Sharma V. (13)
    • Ganguly, Arnab (7)
    • Gibney, Daniel (7)
    • Sharma V. Thankachan (6)
    • Sharma, V. (6)
    • The Pennsylvania State University CiteSeerX Archives (6)
    • Gonzalo Navarro (5)
    • Shah, Rahul (5)
    • Stahl, A. (5)
    • Zhang, J. (5)
    •   more
  • 
    Year
  • 
    Medium:
    
    • Online (26)
  • 
    Type:
    
    • Article (23)
    • Miscellaneous (3)
  • 
    BLLDB-Access

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 Page: 1 2 Hits 1 – 20 of 26 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 Study of central exclusive [Image: see text] production in proton-proton collisions at [Formula: see text] and 13TeV Sirunyan, A. M.; Tumasyan, A.; Adam, W.... In: Eur Phys J C Part Fields (2020) BASE Show details 5 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 6 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 7 On the Complexity of BWT-runs Minimization via Alphabet Reordering ... Bentley, Jason; Gibney, Daniel; Thankachan, Sharma V.. - : arXiv, 2019 BASE Show details 8 On the Hardness and Inapproximability of Recognizing Wheeler Graphs ... Gibney, Daniel; Thankachan, Sharma V.. - : arXiv, 2019 BASE Show details 9 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 10 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 11 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 12 Search for dark matter produced in association with heavy-flavor quark pairs in proton-proton collisions at [Formula: see text] Sirunyan, A. M.; Tumasyan, A.; Adam, W.. - : Springer Berlin Heidelberg, 2017 BASE Show details 13 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 14 Parameterized Pattern Matching -- Succinctly ... Ganguly, Arnab; Shah, Rahul; Thankachan, Sharma V.. - : arXiv, 2016 Abstract: We consider the $Parameterized$ $Pattern$ $Matching$ problem, where a pattern $P$ matches some location in a text $\mathsf{T}$ iff there is a one-to-one correspondence between the alphabet symbols of the pattern to those of the text. More specifically, assume that the text $\mathsf{T}$ contains $n$ characters from a static alphabet $Σ_s$ and a parameterized alphabet $Σ_p$, where $Σ_s \cap Σ_p = \varnothing$ and $|Σ_s \cup Σ_p|=σ$. A pattern $P$ matches a substring $S$ of $\mathsf{T}$ iff the static characters match exactly, and there exists a one-to-one function that renames the parameterized characters in $S$ to that in $P$. Previous indexing solution [Baker, STOC 1993], known as $Parameterized$ $Suffix$ $Tree$, requires $Θ(n\log n)$ bits of space, and can find all $occ$ occurrences of $P$ in $\mathcal{O}(|P|\log σ+ occ)$ time. In this paper, we present the first succinct index that occupies $n \log σ+ \mathcal{O}(n)$ bits and answers queries in $\mathcal{O}((|P|+ occ\cdot \log n) \logσ\log \log σ)$ time. ... Keyword: Data Structures and Algorithms cs.DS; F.2.2; FOS Computer and information sciences URL: https://dx.doi.org/10.48550/arxiv.1603.07457 https://arxiv.org/abs/1603.07457 BASE Hide details 15 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 16 Preventive Audiology: Screening for Hearing Impairment in Children Having Recurrent URTI Sharma, K.; Pannu, M. S.; Arora, A.. - : Springer India, 2015 BASE Show details 17 Ranked document selection J. Ian Munro; Gonzalo Navarro; Rahul Shah... In: http://www.dcc.uchile.cl/~gnavarro/ps/swat14.pdf (2014) BASE Show details 18 New Space/Time Tradeoffs for Top-k Document Retrieval on Sequences Gonzalo Navarro; Sharma V. Thankachan In: http://www.dcc.uchile.cl/~gnavarro/ps/tcs14.pdf (2014) BASE Show details 19 On Entropy-Compressed Text Indexing in External Memory Wing-kai Hon; Rahul Shah; Sharma V. Thankachan... In: http://faculty.cse.tamu.edu/jsv/Papers/HST09externaltextindexing.pdf (2009) BASE Show details 20 A measurement of the charged and neutral B meson lifetimes using fully reconstructed decays Aubert, B.; Boucham, A.; Boutigny, D.... In: International Conference on High-Energy Physics 30 ICHEP 2000 ; http://hal.in2p3.fr/in2p3-00006091 ; International Conference on High-Energy Physics 30 ICHEP 2000, Jul 2000, Osaka, Japan. pp.1-22 (2000) BASE Show details Page: 1 2

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 26 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0