default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJesper Sindahl Nielsen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c9]Peyman Afshani, Ingo van Duijn, Rasmus Killmann, Jesper Sindahl Nielsen:
A Lower Bound for Jumbled Indexing. SODA 2020: 592-606
2010 – 2019
- 2017
- [j2]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) - [i4]Allan Grønlund, Kasper Green Larsen, Alexander Mathiasen, Jesper Sindahl Nielsen:
Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D. CoRR abs/1701.07204 (2017) - 2016
- [c8]Peyman Afshani, Edvin Berglin, Ingo van Duijn, Jesper Sindahl Nielsen:
Applications of Incidence Bounds in Point Covering Problems. SoCG 2016: 60:1-60:15 - [c7]Peyman Afshani, Jesper Sindahl Nielsen:
Data Structure Lower Bounds for Document Indexing Problems. ICALP 2016: 93:1-93:15 - [i3]Peyman Afshani, Edvin Berglin, Ingo van Duijn, Jesper Sindahl Nielsen:
Applications of incidence bounds in point covering problems. CoRR abs/1603.07282 (2016) - [i2]Peyman Afshani, Jesper Sindahl Nielsen:
Data Structure Lower Bounds for Document Indexing Problems. CoRR abs/1604.06264 (2016) - 2015
- [j1]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) - [c6]Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen:
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. WADS 2015: 91-102 - [i1]Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen:
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. CoRR abs/1505.00147 (2015) - 2014
- [c5]Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan:
On Hardness of Several String Indexing Problems. CPM 2014: 242-251 - [c4]J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan:
Top- k Term-Proximity in Succinct Space. ISAAC 2014: 169-180 - [c3]Djamal Belazzougui, Gerth Stølting Brodal, Jesper Sindahl Nielsen:
Expected Linear Time Sorting for Word Size Ω(log2 n loglogn). SWAT 2014: 26-37 - 2012
- [c2]Bolette Ammitzbøll Jurik, Jesper Sindahl Nielsen:
Audio Quality Assurance: An Application of Cross Correlation. iPRES 2012 - [c1]Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen:
Finger Search in the Implicit Model. ISAAC 2012: 527-536
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
