Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Sharma V. Thankachan

◀ ▶ joint publications with Jesper Sindahl Nielsen

> Home > Persons > Sharma V. Thankachan

Publications

2017
[j26]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/MunroNNST17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/MunroNNST17
J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan:
Top-k Term-Proximity in Succinct Space. Algorithmica 78(2): 379-393 (2017)
2015
[j10]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/LarsenMNT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/LarsenMNT15
Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan:
On hardness of several string indexing problems. Theor. Comput. Sci. 582: 74-82 (2015)
2014
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/cpm/LarsenMNT14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/LarsenMNT14
Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan:
On Hardness of Several String Indexing Problems. CPM 2014: 242-251
[c32]
- view
  authority control:
- export record
  dblp key:
  - conf/isaac/MunroNNST14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/MunroNNST14
J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan:
Top- k Term-Proximity in Succinct Space. ISAAC 2014: 169-180

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.