Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Previous revision
staff:kurpicz [2018-04-24 13:37]
staff:kurpicz [2018-10-17 18:13]
Line 37: Line 37:
  
 == Betreute studentische Arbeiten == == Betreute studentische Arbeiten ==
 +  * **Tim Schonscheck** [[fischer:​abschlussarbeiten:​com_sparse_sa|Textkompression mithilfe eines sparse Suffix Arrays]] (Bachelor)
   * **Uwe Jentsch** [[fischer:​abschlussarbeiten:​suffix_lcp|Suffixsortierung mit integrierter LCP-Berechnung]] (Master)   * **Uwe Jentsch** [[fischer:​abschlussarbeiten:​suffix_lcp|Suffixsortierung mit integrierter LCP-Berechnung]] (Master)
   * **Lucas Weiße** [[fischer:​abschlussarbeiten:​raspberry_pi_cluster|Aufbau eines Clusters mithilfe von Raspberry Pis]] (Bachelor)   * **Lucas Weiße** [[fischer:​abschlussarbeiten:​raspberry_pi_cluster|Aufbau eines Clusters mithilfe von Raspberry Pis]] (Bachelor)
Line 46: Line 47:
 ===== Publications ===== ===== Publications =====
 === Refereed Conference Proceedings === === Refereed Conference Proceedings ===
 +  * **Lightweight Distributed Suffix Array Construction**\\ //Johannes Fischer, Florian Kurpicz//\\ Accepted at ALENEX'​19
 +  * **Scalable Construction of Text Indexes with Thrill** ([[https://​arxiv.org/​abs/​1610.03007|preliminary arXiv preprint]])\\ //Timo Bingmann, Simon Gog, Florian Kurpicz//\\ Accepted at IEEE Big Data '18
   * **[[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.
   * **[[http://​www.stringology.org/​event/​2017/​p07.html|Dismantling DivSufSort]]** ([[https://​arxiv.org/​abs/​1710.01896|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz// \\ Proceedings of the Prague Stringology Conference (PSC 2017), 62--76.   * **[[http://​www.stringology.org/​event/​2017/​p07.html|Dismantling DivSufSort]]** ([[https://​arxiv.org/​abs/​1710.01896|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz// \\ Proceedings of the Prague Stringology Conference (PSC 2017), 62--76.
Line 54: Line 57:
 === Journal Articles === === Journal Articles ===
   * **[[https://​doi.org/​10.1016/​j.ejc.2017.07.012|On 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|On 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.
- 
-=== Preprints === 
-  * **Scalable Construction of Text Indexes**\\ //Timo Bingmann, Simon Gog, Florian Kurpicz// \\ [[https://​arxiv.org/​abs/​1610.03007|arXiv preprint arXiv:​1610.03007]],​ 2016. 
 ===== Further Information ===== ===== Further Information =====
 Please visit our [[fischer:​start|group site]] for further information. Please visit our [[fischer:​start|group site]] for further information.
 
Last modified: 2021-05-01 21:03 by Florian Kurpicz
DokuWikiRSS-Feed