• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher:
    
    • Thankachan, Sharma V. (10)
    • Ganguly, Arnab (6)
    • Sharma V. Thankachan (6)
    • Sharma, V. (6)
    • The Pennsylvania State University CiteSeerX Archives (6)
    • Gibney, Daniel (5)
    • Gonzalo Navarro (5)
    • Stahl, A. (5)
    • Zhang, J. (5)
    • Abbaneo, D. (4)
    •   more
  • 
    Year
  • 
    Medium:
    
    • Online (23)
  • 
    Type:
    
    • Article (23)
  • 
    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 23 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 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 8 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 9 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 10 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 11 Space-Time Trade-Offs for the Shortest Unique Substring Problem Ganguly, Arnab; Hon, Wing-Kai; Shah, Rahul; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th International Symposium on Algorithms and Computation (ISAAC 2016), 2016 Abstract: Given a string X[1, n] and a position k in [1, n], the Shortest Unique Substring of X covering k, denoted by S_k, is a substring X[i, j] of X which satisfies the following conditions: (i) i leq k leq j, (ii) i is the only position where there is an occurrence of X[i, j], and (iii) j - i is minimized. The best-known algorithm [Hon et al., ISAAC 2015] can find S k for all k in [1, n] in time O(n) using the string X and additional 2n words of working space. Let tau be a given parameter. We present the following new results. For any given k in [1, n], we can compute S_k via a deterministic algorithm in O(n tau^2 log n tau) time using X and additional O(n/tau) words of working space. For every k in [1, n], we can compute S_k via a deterministic algorithm in O(n tau^2 log n/tau) time using X and additional O(n/tau) words and 4n + o(n) bits of working space. For both problems above, we present an O(n tau log^{c+1} n)-time randomized algorithm that uses n/ log c n words in addition to that mentioned above, where c geq 0 is an arbitrary constant. In this case, the reported string is unique and covers k, but with probability at most n^{-O(1)} ; may not be the shortest. As a consequence of our techniques, we also obtain similar space-and-time tradeoffs for a related problem of finding Maximal Unique Matches of two strings [Delcher et al., Nucleic Acids Res. 1999]. Keyword: Data processing Computer science; Probabilistic z-Fast Trie; Rabin-Karp Fingerprint; Sparsification; Succinct Data-Structures; Suffix Tree URN: urn:nbn:de:0030-drops-68041 URL: https://doi.org/10.4230/LIPIcs.ISAAC.2016.34 https://drops.dagstuhl.de/opus/volltexte/2016/6804/ BASE Hide details 12 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 13 Preventive Audiology: Screening for Hearing Impairment in Children Having Recurrent URTI Sharma, K.; Pannu, M. S.; Arora, A.. - : Springer India, 2015 BASE Show details 14 Ranked document selection J. Ian Munro; Gonzalo Navarro; Rahul Shah... In: http://www.dcc.uchile.cl/~gnavarro/ps/swat14.pdf (2014) BASE Show details 15 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 16 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 17 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 18 An experimental study of $\gamma \gamma \rightarrow hadrons$ at LEP Buskulic, D.; De Bonis, I.; Decamp, D.... In: ISSN: 0370-2693 ; Physics Letters B ; http://hal.in2p3.fr/in2p3-00004532 ; Physics Letters B, Elsevier, 1993, 313, pp.509-519 (1993) BASE Show details 19 Search for a non-minimal Higgs boson produced in the reaction e$^+$e$^-$ $\rightarrow$ hZ$^{\star}$ Buskulic, D.; Boehrer, A.; De Bonis, I.... In: ISSN: 0370-2693 ; Physics Letters B ; http://hal.in2p3.fr/in2p3-00004593 ; Physics Letters B, Elsevier, 1993, 313, pp.312-325 (1993) BASE Show details 20 Bottom-k Document Retrieval Gonzalo Navarro; Sharma V. Thankachan In: http://www.dcc.uchile.cl/%7Egnavarro/ps/jda15.pdf 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 23 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0