default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikko Berggren Ettienne
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j2]Anders Roy Christiansen, Mikko Berggren Ettienne, Tomasz Kociumaka
, Gonzalo Navarro, Nicola Prezza:
Optimal-Time Dictionary-Compressed Indexes. ACM Trans. Algorithms 17(1): 8:1-8:39 (2021)- 2020
- [c7]Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
Decompressing Lempel-Ziv Compressed Text. DCC 2020: 143-152
2010 – 2019
- 2019
- [i8]Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz:
Mergeable Dictionaries With Shifts. CoRR abs/1901.00718 (2019) - 2018
- [b1]Mikko Berggren Ettienne:
Compressed and efficient algorithms and data structures for strings. Technical University of Denmark, 2018 - [j1]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) - [c6]Anders Roy Christiansen, Mikko Berggren Ettienne:
Compressed Indexing with Signature Grammars. LATIN 2018: 331-345 - [c5]Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg:
Compressed Communication Complexity of Longest Common Prefixes. SPIRE 2018: 74-87 - [i7]Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
Fast Lempel-Ziv Decompression in Linear Space. CoRR abs/1802.10347 (2018) - [i6]Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg:
Compressed Communication Complexity of Longest Common Prefixes. CoRR abs/1806.03102 (2018) - 2017
- [c4]Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. CPM 2017: 16:1-16:17 - [c3]Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz:
Fast Dynamic Arrays. ESA 2017: 16:1-16:13 - [i5]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) - [i4]Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz:
Fast Dynamic Arrays. CoRR abs/1711.00275 (2017) - [i3]Anders Roy Christiansen, Mikko Berggren Ettienne:
Compressed Indexing with Signature Grammars. CoRR abs/1711.08217 (2017) - 2012
- [c2]Jørgen Villadsen, Andreas Schmidt Jensen, Mikko Berggren Ettienne, Steen Vester, Kenneth Balsiger Andersen, Andreas Frøsig:
Reimplementing a Multi-Agent System in Python. ProMAS 2012: 205-216 - [i2]Jørgen Villadsen, Andreas Schmidt Jensen, Mikko Berggren Ettienne, Steen Vester, Kenneth Balsiger Andersen, Andreas Frøsig:
Multi-Agent Programming Contest 2012 - The Python-DTU Team. CoRR abs/1210.0437 (2012) - 2011
- [c1]Mikko Berggren Ettienne, Steen Vester, Jørgen Villadsen:
Implementing a Multi-Agent System in Python with an Auction-Based Agreement Approach. ProMAS 2011: 185-196 - [i1]Jørgen Villadsen, Mikko Berggren Ettienne, Steen Vester:
Multi-Agent Programming Contest 2011 - The Python-DTU Team. CoRR abs/1110.0105 (2011)
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 13:14 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:
