Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
fischer:publications [2018-09-02 10:08]
Johannes Fischer [To Appear]
fischer:publications [2019-01-14 09:43] (current)
Florian Kurpicz [2019]
Line 2: Line 2:
  
 ====== Publications (Group Members in Bold) ====== ====== Publications (Group Members in Bold) ======
 +===== Peer Reviewed Publications =====
  
 ==== To Appear ====  ​ ==== To Appear ====  ​
   * **Standards for Higher Secondary Education for Computer Science in Germany** \\ //**Arno Pasternak**,​ Lutz Hellmig and Gerhard Röhner//\\ Accepted at ISSEP'​18.   * **Standards for Higher Secondary Education for Computer Science in Germany** \\ //**Arno Pasternak**,​ Lutz Hellmig and Gerhard Röhner//\\ Accepted at ISSEP'​18.
-  * **Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes** ([[https://​arxiv.org/​abs/​1802.10355|arXiv version]]) \\  //Tomohiro I, **Dominik Köppl**//​\\ ​Accepted at TCS.+  * **Scalable Construction of Text Indexes with Thrill**\\ //Timo Bingmann, Simon Gog, **Florian Kurpicz**//​\\ Accepted at IEEE Big Data '18 
 + 
 +==== 2019 ==== 
 +  * **[[https://​epubs.siam.org/​doi/​abs/​10.1137/​1.9781611975499.3|Lightweight Distributed Suffix Array Construction]]**\\ //​**Johannes Fischer**, **Florian Kurpicz**//​\\ Proceedings of the 21st Workshop on Algorithm Engineering and Experiments (ALENEX 2019), 27--38, 2019. 
 +  * **[[https://​www.sciencedirect.com/​science/​article/​pii/​S0304397518304493|Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes]]** ([[https://​arxiv.org/​abs/​1802.10355|arXiv version]]) \\  //Tomohiro I, **Dominik Köppl**//​\\ ​Theoretical Computer Science, 753: 1--15, 2019.
  
 ==== 2018 ==== ==== 2018 ====
Line 11: Line 16:
   * **[[http://​dx.doi.org/​10.1007/​s00453-017-0333-1|Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees]]** ([[http://​rdcu.be/​utWN|Nature SharedIt]]) \\ //​**Johannes Fischer**, Tomohiro I, **Dominik Köppl**, Kunihiko Sadakane//​\\ Algorithmica,​ Special Issue on Compact Data Structures, 80(7): 2048--2081, 2018.   * **[[http://​dx.doi.org/​10.1007/​s00453-017-0333-1|Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees]]** ([[http://​rdcu.be/​utWN|Nature SharedIt]]) \\ //​**Johannes Fischer**, Tomohiro I, **Dominik Köppl**, Kunihiko Sadakane//​\\ Algorithmica,​ Special Issue on Compact Data Structures, 80(7): 2048--2081, 2018.
   * **[[https://​doi.org/​10.1007/​s00224-017-9794-5|Tighter Bounds and Optimal Algorithms for all Maximal α-gapped Repeats and Palindromes]]** ([[http://​rdcu.be/​u01y|Nature SharedIt]]) \\ //Pawel Gawrychowski,​ Tomohiro I, Shunsuke Inenaga, **Dominik Köppl**, Florin Manea//\\ Theory of Computing Systems, 62(1): 162--191, 2018.   * **[[https://​doi.org/​10.1007/​s00224-017-9794-5|Tighter Bounds and Optimal Algorithms for all Maximal α-gapped Repeats and Palindromes]]** ([[http://​rdcu.be/​u01y|Nature SharedIt]]) \\ //Pawel Gawrychowski,​ Tomohiro I, Shunsuke Inenaga, **Dominik Köppl**, Florin Manea//\\ Theory of Computing Systems, 62(1): 162--191, 2018.
-  * **[[https://​doi.org/​10.1137/​1.9781611975055.2|Simple,​ Fast and Lightweight Parallel Wavelet Tree Construction]]** ([[https://​arxiv.org/​abs/​1702.07578|arXiv version]]) \\ //​**Johannes Fischer**, **Florian Kurpicz**, **Marvin Löbel**// \\ Proceedings of the 20th Workshop on Algorithm Engineering and Experiments (ALENEX 2018), 9--20.+  * **[[https://​doi.org/​10.1137/​1.9781611975055.2|Simple,​ Fast and Lightweight Parallel Wavelet Tree Construction]]** ([[https://​arxiv.org/​abs/​1702.07578|arXiv version]]) \\ //​**Johannes Fischer**, **Florian Kurpicz**, **Marvin Löbel**// \\ Proceedings of the 20th Workshop on Algorithm Engineering and Experiments (ALENEX 2018), 9--20, 2018.
   * **[[https://​doi.org/​10.1016/​j.ejc.2017.07.012|Maximum Common Subgraph Problems in Series-Parallel Graphs]]** ([[https://​arxiv.org/​abs/​1708.02772|arXiv version]])\\ //Nils Kriege, **Florian Kurpicz**, Petra Mutzel// \\ European Journal of Combinatorics (Eur. J. Combin.), 68:79--95, 2018.   * **[[https://​doi.org/​10.1016/​j.ejc.2017.07.012|Maximum Common Subgraph Problems in Series-Parallel Graphs]]** ([[https://​arxiv.org/​abs/​1708.02772|arXiv version]])\\ //Nils Kriege, **Florian Kurpicz**, Petra Mutzel// \\ European Journal of Combinatorics (Eur. J. Combin.), 68:79--95, 2018.
  
Line 68: Line 73:
  
  
-===== Preprints =====+===== Other Publications and Preprints ===== 
 +  * **[[http://​dx.doi.org/​10.17877/​DE290R-19051|Exploring Regular Structures in Strings]]**\\ //**Dominik Köppl**// \\ PhD-Thesis, 2018.
   * **[[https://​arxiv.org/​abs/​1610.03007|Scalable Construction of Text Indexes]]**\\ //Timo Bingmann, Simon Gog, **Florian Kurpicz**// \\   * **[[https://​arxiv.org/​abs/​1610.03007|Scalable Construction of Text Indexes]]**\\ //Timo Bingmann, Simon Gog, **Florian Kurpicz**// \\
  
 
Last modified: 2018-09-02 10:08 by Johannes Fischer
DokuWikiRSS-Feed