default search action
Hjalte Wedel Vildhøj
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j9]Philip Bille
, Anders Roy Christiansen
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation. Algorithmica 80(11): 3207-3224 (2018) - [j8]Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Time-space trade-offs for Lempel-Ziv compressed indexing. Theor. Comput. Sci. 713: 66-77 (2018) - 2017
- [j7]Philip Bille
Fingerprints in compressed strings. J. Comput. Syst. Sci. 86: 171-180 (2017) - [c13]Philip Bille
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. CPM 2017: 16:1-16:17 - [i11]Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. CoRR abs/1706.10094 (2017) - 2016
- [j6]Philip Bille
Sparse Text Indexing in Small Space. ACM Trans. Algorithms 12(3): 39:1-39:19 (2016) - [c12]Mika Amit, Philip Bille
Boxed Permutation Pattern Matching. CPM 2016: 20:1-20:11 - [c11]Philip Bille
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation. ISAAC 2016: 18:1-18:13 - [c10]Raphaël Clifford, Allyx Fontaine
Dynamic and Approximate Pattern Matching in 2D. SPIRE 2016: 133-144 - 2015
- [b1]Hjalte Wedel Vildhøj:
Topics in combinatorial pattern matching. Technical University of Denmark, 2015 - [j5]Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
A suffix tree or not a suffix tree? J. Discrete Algorithms 32: 14-23 (2015) - [c9]Philip Bille
Longest Common Extensions in Sublinear Space. CPM 2015: 65-76 - [i10]Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj:
Longest Common Extensions in Sublinear Space. CoRR abs/1504.02671 (2015) - [i9]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind:
Dynamic Relative Compression. CoRR abs/1504.07851 (2015) - 2014
- [j4]Philip Bille
Time-space trade-offs for longest common extensions. J. Discrete Algorithms 25: 42-50 (2014) - [j3]Philip Bille
String Indexing for Patterns with Wildcards. Theory Comput. Syst. 55(1): 41-60 (2014) - [c8]Tomasz Kociumaka
Sublinear Space Algorithms for the Longest Common Substring Problem. ESA 2014: 605-617 - [c7]Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
A Suffix Tree Or Not a Suffix Tree? IWOCA 2014: 338-350 - [i8]Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
A Suffix Tree Or Not A Suffix Tree? CoRR abs/1403.1364 (2014) - [i7]Tomasz Kociumaka, Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
Sublinear Space Algorithms for the Longest Common Substring Problem. CoRR abs/1407.0522 (2014) - 2013
- [j2]Søren Bøg, Morten Stöckel, Hjalte Wedel Vildhøj:
The hardness of the functional orientation 2-color problem. Australas. J Comb. 56: 225-234 (2013) - [c6]Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for the Longest Common Substring Problem. CPM 2013: 223-234 - [c5]Philip Bille
Sparse Suffix Tree Construction in Small Space. ICALP (1) 2013: 148-159 - [c4]Philip Bille
Fingerprints in Compressed Strings. WADS 2013: 146-157 - [i6]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind:
Fingerprints in Compressed Strings. CoRR abs/1305.2777 (2013) - 2012
- [j1]Philip Bille
String matching with variable length gaps. Theor. Comput. Sci. 443: 25-34 (2012) - [c3]Philip Bille
Time-Space Trade-Offs for Longest Common Extensions. CPM 2012: 293-305 - [c2]Philip Bille
String Indexing for Patterns with Wildcards. SWAT 2012: 283-294 - [i5]Philip Bille, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj:
Sparse Suffix Tree Construction with Small Space. CoRR abs/1207.1135 (2012) - [i4]Søren Bøg, Morten Stöckel, Hjalte Wedel Vildhøj:
The Hardness of the Functional Orientation 2-Color Problem. CoRR abs/1210.2544 (2012) - [i3]Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for Longest Common Extensions. CoRR abs/1211.0270 (2012) - 2011
- [i2]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind:
String Matching with Variable Length Gaps. CoRR abs/1110.2893 (2011) - [i1]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind:
String Indexing for Patterns with Wildcards. CoRR abs/1110.5236 (2011) - 2010
- [c1]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind:
String Matching with Variable Length Gaps. SPIRE 2010: 385-394
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 2024-10-07 22:24 CEST 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: