Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
fischer:publications [2020-07-07 18:56] Florian Kurpicz [Other Publications and Preprints] |
fischer:publications [2021-02-18 09:43] Jonas Ellert [Peer Reviewed Publications] |
||
|---|---|---|---|
| Line 4: | Line 4: | ||
| ===== Peer Reviewed Publications ===== | ===== Peer Reviewed Publications ===== | ||
| + | ==== 2021 ==== | ||
| + | * **Linear Time Runs over General Ordered Alphabets | ||
| + | **\\ //**Jonas Ellert**, **Johannes Fischer**//\\ Submitted to ICALP 2021. ([[https://arxiv.org/abs/2102.08670|arXiv version]]) | ||
| ==== 2020 ==== | ==== 2020 ==== | ||
| - | * **Practical Performance of Space Efficient Data Structures for Longest Common Extensions**\\ //**Patrick Dinklage**, **Johannes Fischer**, **Alexander Herlez**, Tomasz Kociumaka, **Florian Kurpicz**//\\ Accepted at ESA. | + | * **Fostering Reflection in CS Teacher Education**\\ //**Johannes Fischer**, Nora Romahn, **Martin Weinert**//\\ Accepted at ISSEP'20. |
| - | * **Deterministic Sparse Suffix Sorting in the Restore Model**\\ //**Johannes Fischer, Tomohiro I, Dominik Köppl**//\\ Accepted to ACM Trans. Algorithms. | + | * **To Project or Not to Project: In Search of the Pathway to Object Orientation**\\ //**Johannes Fischer, Arno Pasternak**//\\ Accepted at ISSEP'20. |
| - | * **LCP-Aware Parallel String Sorting**\\ //**Jonas Ellert, Johannes Fischer**, Nodari Sitchinava//\\ Accepted to Euro-Par. | + | * **[[https://doi.org/10.4230/LIPIcs.ESA.2020.39|Practical Performance of Space Efficient Data Structures for Longest Common Extensions]]**\\ //**Patrick Dinklage**, **Johannes Fischer**, **Alexander Herlez**, Tomasz Kociumaka, **Florian Kurpicz**//\\ Proc. ESA, LIPICS 173, Article No. 39; pp. 39:1–39:20. |
| - | * **[[https://doi.org/10.4230/LIPIcs.ICALP.2020.14|Space Efficient Construction of Lyndon Arrays in Linear Time]]**\\ //Philip Bille, **Jonas Ellert, Johannes Fischer**, Inge Li Gørtz, **Florian Kurpicz**, Ian Munro, Eva Rotenberg//\\ Proc. ICALP 2020, LIPIcs 168, 14:1-14.18. [[http://arxiv.org/abs/1911.03542|(arXiv version)]] | + | * **[[https://dl.acm.org/doi/10.1145/3398681|Deterministic Sparse Suffix Sorting in the Restore Model]]**\\ //**Johannes Fischer, Tomohiro I, Dominik Köppl**//\\ ACM Transactions on Algorithms 16(4), 50.1-50.53. |
| + | * **[[https://doi.org/10.1007/978-3-030-57675-2_21|LCP-Aware Parallel String Sorting]]**\\ //**Jonas Ellert, Johannes Fischer**, Nodari Sitchinava//\\ Proc. Euro-Par, LNCS 12247, 329–342. [[https://www.youtube.com/watch?v=J_Yel_3O72M|(video presentation on YouTube)]] | ||
| + | * **[[https://doi.org/10.4230/LIPIcs.ICALP.2020.14|Space Efficient Construction of Lyndon Arrays in Linear Time]]**\\ //Philip Bille, **Jonas Ellert, Johannes Fischer**, Inge Li Gørtz, **Florian Kurpicz**, Ian Munro, Eva Rotenberg//\\ Proc. ICALP 2020, LIPIcs 168, 14:1-14.18. [[https://doi.org/10.5446/49401|(video presentation on TIB)]] | ||
| * **[[https://doi.org/10.1137/1.9781611976007.17|Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory]]**\\ //**Patrick Dinklage**, **Johannes Fischer**, **Florian Kurpicz**//\\ Proceedings of the 22nd Workshop on Algorithm Engineering and Experiments (ALENEX 2019), 214-228. | * **[[https://doi.org/10.1137/1.9781611976007.17|Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory]]**\\ //**Patrick Dinklage**, **Johannes Fischer**, **Florian Kurpicz**//\\ Proceedings of the 22nd Workshop on Algorithm Engineering and Experiments (ALENEX 2019), 214-228. | ||
| Line 44: | Line 49: | ||
| <!-- ACM DL Article: Inducing Suffix and LCP Arrays in External Memory --> | <!-- ACM DL Article: Inducing Suffix and LCP Arrays in External Memory --> | ||
| <div class="acmdlitem" id="item2975593"><img src="http://dl.acm.org/images/oa.gif" width="25" height="25" border="0" alt="ACM DL Author-ize service" style="vertical-align:middle"/><a href="http://dl.acm.org/authorize?N30693" title="Inducing Suffix and LCP Arrays in External Memory">Inducing Suffix and LCP Arrays in External Memory</a><div style="margin-left:25px"><a href="http://dl.acm.org/author_page.cfm?id=99658726780" >Timo Bingmann</a>, <a href="http://dl.acm.org/author_page.cfm?id=81321491592" >Johannes Fischer</a>, <a href="http://dl.acm.org/author_page.cfm?id=81322502770" >Vitaly Osipov</a><br />Journal of Experimental Algorithmics (JEA) - Special Issue SEA 2014, Regular Papers and Special Issue ALENEX 2013, 2016</div></div> | <div class="acmdlitem" id="item2975593"><img src="http://dl.acm.org/images/oa.gif" width="25" height="25" border="0" alt="ACM DL Author-ize service" style="vertical-align:middle"/><a href="http://dl.acm.org/authorize?N30693" title="Inducing Suffix and LCP Arrays in External Memory">Inducing Suffix and LCP Arrays in External Memory</a><div style="margin-left:25px"><a href="http://dl.acm.org/author_page.cfm?id=99658726780" >Timo Bingmann</a>, <a href="http://dl.acm.org/author_page.cfm?id=81321491592" >Johannes Fischer</a>, <a href="http://dl.acm.org/author_page.cfm?id=81322502770" >Vitaly Osipov</a><br />Journal of Experimental Algorithmics (JEA) - Special Issue SEA 2014, Regular Papers and Special Issue ALENEX 2013, 2016</div></div> | ||
| - | <!-- ACM DL Bibliometrics: Inducing Suffix and LCP Arrays in External Memory--> | ||
| - | <div class="acmdlstat" id ="stats2975593"><iframe src="http://dl.acm.org/authorizestats?N30693" width="100%" height="30" scrolling="no" frameborder="0">frames are not supported</iframe></div> | ||
| </html> | </html> | ||
| * <html> | * <html> | ||
| <!-- ACM DL Article: Sparse Text Indexing in Small Space --> | <!-- ACM DL Article: Sparse Text Indexing in Small Space --> | ||
| <div class="acmdlitem" id="item2836166"><img src="http://dl.acm.org/images/oa.gif" width="25" height="25" border="0" alt="ACM DL Author-ize service" style="vertical-align:middle"/><a href="http://dl.acm.org/authorize?N31933" title="Sparse Text Indexing in Small Space">Sparse Text Indexing in Small Space</a><div style="margin-left:25px"><a href="http://dl.acm.org/author_page.cfm?id=81100628534" >Philip Bille</a>, <a href="http://dl.acm.org/author_page.cfm?id=81321491592" >Johannes Fischer</a>, <a href="http://dl.acm.org/author_page.cfm?id=81100550736" >Inge Li Gørtz</a>, <a href="http://dl.acm.org/author_page.cfm?id=81336490330" >Tsvi Kopelowitz</a>, <a href="http://dl.acm.org/author_page.cfm?id=81384606517" >Benjamin Sach</a>, <a href="http://dl.acm.org/author_page.cfm?id=81479660863" >Hjalte Wedel Vildhøj</a><br />ACM Transactions on Algorithms (TALG), 2016</div></div> | <div class="acmdlitem" id="item2836166"><img src="http://dl.acm.org/images/oa.gif" width="25" height="25" border="0" alt="ACM DL Author-ize service" style="vertical-align:middle"/><a href="http://dl.acm.org/authorize?N31933" title="Sparse Text Indexing in Small Space">Sparse Text Indexing in Small Space</a><div style="margin-left:25px"><a href="http://dl.acm.org/author_page.cfm?id=81100628534" >Philip Bille</a>, <a href="http://dl.acm.org/author_page.cfm?id=81321491592" >Johannes Fischer</a>, <a href="http://dl.acm.org/author_page.cfm?id=81100550736" >Inge Li Gørtz</a>, <a href="http://dl.acm.org/author_page.cfm?id=81336490330" >Tsvi Kopelowitz</a>, <a href="http://dl.acm.org/author_page.cfm?id=81384606517" >Benjamin Sach</a>, <a href="http://dl.acm.org/author_page.cfm?id=81479660863" >Hjalte Wedel Vildhøj</a><br />ACM Transactions on Algorithms (TALG), 2016</div></div> | ||
| - | <!-- ACM DL Bibliometrics: Sparse Text Indexing in Small Space--> | ||
| - | <div class="acmdlstat" id ="stats2836166"><iframe src="http://dl.acm.org/authorizestats?N31933" width="100%" height="30" scrolling="no" frameborder="0">frames are not supported</iframe></div> | ||
| </html> | </html> | ||
| * **[[http://dx.doi.org/10.4230/LIPIcs.CPM.2016.26|On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching]]** ([[https://arxiv.org/abs/1606.02465|arXiv version]]) \\ //**Johannes Fischer**, **Dominik Köppl**, **Florian Kurpicz**// \\ Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), LIPIcs 54, 2016, 26:1--26:11 | * **[[http://dx.doi.org/10.4230/LIPIcs.CPM.2016.26|On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching]]** ([[https://arxiv.org/abs/1606.02465|arXiv version]]) \\ //**Johannes Fischer**, **Dominik Köppl**, **Florian Kurpicz**// \\ Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), LIPIcs 54, 2016, 26:1--26:11 | ||
| Line 85: | Line 86: | ||
| - | ===== Other Publications and Preprints ===== | + | ===== Other Publications ===== |
| - | * **[[https://dx.doi.org/10.17877/DE290R-21114|Parallel Text Index Construction]]**\\ //**Florian Kurpicz**// \\ PhD-Thesis, 2018. | + | * **[[https://www.amazon.de/Mobil-mit-Informatik-M%C3%BCnsteraner-Schulinformatik/dp/375193555X/ref=sr_1_1?__mk_de_DE=%C3%85M%C3%85%C5%BD%C3%95%C3%91&dchild=1&keywords=M%C3%BCnsteraner+Workshop+zur+Schulinformatik&qid=1597830305&s=books&sr=1-1|Wie läuft die Umsetzung inklusiven Informatikunterrichts tatsächlich? Eine Lehrerumfrage zum inklusionsorienterten Unterricht.]]**\\ //**Kensuke Akao, Johannes Fischer**// \\ 9. Münsteraner Workshop für Schulinformatik 2020, 9-18. ISBN 9783751935555. |
| + | * **[[https://dx.doi.org/10.17877/DE290R-21114|Parallel Text Index Construction]]**\\ //**Florian Kurpicz**// \\ PhD-Thesis, 2020. | ||
| + | * **[[https://dl.gi.de/handle/20.500.12116/28915|Informatik für alle: 18. GI-Fachtagung Informatik und Schule]]**\\ //**Arno Pasternak (Hrsg.)**// \\ Lecture Notes in Informatics 288, Gesellschaft für Informatik, 2019. | ||
| * **[[http://dx.doi.org/10.17877/DE290R-19051|Exploring Regular Structures in Strings]]**\\ //**Dominik Köppl**// \\ PhD-Thesis, 2018. | * **[[http://dx.doi.org/10.17877/DE290R-19051|Exploring Regular Structures in Strings]]**\\ //**Dominik Köppl**// \\ PhD-Thesis, 2018. | ||