Jesper Sindahl Nielsen

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A Lower Bound for Jumbled Indexing Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms	2021-02-02	Paper
Applications of incidence bounds in point covering problems (available as arXiv preprint)	2018-01-30	Paper
Data structure lower bounds for document indexing problems (available as arXiv preprint)	2017-12-19	Paper
Top-k term-proximity in succinct space Algorithmica	2017-07-07	Paper
Strictly implicit priority queues: on the number of moves and worst-case time Lecture Notes in Computer Science	2015-10-30	Paper
Top-\(k\) term-proximity in succinct space Algorithms and Computation	2015-09-11	Paper
On hardness of several string indexing problems Theoretical Computer Science	2015-04-29	Paper
Expected linear time sorting for word size \(\Omega (\log ^{2} n \log\log n)\) Algorithm Theory – SWAT 2014	2014-09-02	Paper
On Hardness of Several String Indexing Problems Combinatorial Pattern Matching	2014-06-30	Paper
Finger search in the implicit model Algorithms and Computation	2013-03-21	Paper

Research outcomes over time

This page was built for person: Jesper Sindahl Nielsen