Home
Catalogue search
Refine your search:
Keyword
Creator / Publisher:
Ganguly, Arnab (7)
Thankachan, Sharma V. (7)
Shah, Rahul (5)
Gibney, Daniel (2)
Hooshmand, Sahar (2)
Biswas, Sudip (1)
Hon, Wing-Kai (1)
Külekci, M. Oğuzhan (1)
Year
Medium:
Online (7)
Type:
Article (6)
Miscellaneous (1)
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
Hits 1 – 7 of 7
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
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
4
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
5
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
6
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
7
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
7
Linguistik-Repository
0
IDS Publikationsserver
0
Online dissertations
0
Language Description Heritage
0
© 2013 - 2024 Lin|gu|is|tik
|
Imprint
|
Privacy Policy
|
Datenschutzeinstellungen ändern