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 [2020-08-19 11:53]
Johannes Fischer [Other Publications and Preprints]
fischer:publications [2023-08-05 09:13] (current)
Johannes Fischer [2023]
Line 4: Line 4:
 ===== Peer Reviewed Publications ===== ===== Peer Reviewed Publications =====
  
 +
 +==== 2023 ====
 +  * **New Advances in Rightmost Lempel-Ziv**\\ //**Jonas Ellert, Johannes Fischer**, Max Rishøj Pedersen//​\\ Accepted at SPIRE 2023
 +  * **Sublinear Time Lempel-Ziv 77 Factorization**\\ //**Jonas Ellert**//​\\ Accepted at SPIRE 2023
 +  * **Lyndon Arrays in Sublinear Time**\\ //Hideo Bannai, **Jonas Ellert**//​\\ Accepted at ESA 2023
 +  * **Ein Roboter lernt laufen: Vermittlung von Konzepten des verstärkenden Lernens im Informatikunterricht**\\ //Jan Laumeyer, **Jan Hendrik Krone**, **Johannes Fischer**//​\\ Accepted at INFOS'​23.
 +  * **[[https://​doi.org/​10.4230/​LIPIcs.CPM.2023.4|Sliding Window String Indexing in Streams]]**\\ //Philip Bille, **Johannes Fischer**, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen//​\\ Proc. CPM 2023, 4:1--4:18, **Best Student Paper Award**.
 +  * **[[https://​doi.org/​10.1109/​DCC55655.2023.00016|Bit-Parallel (Compressed) Wavelet Tree Construction]]**\\ //**Patrick Dinklage, Johannes Fischer**, Florian Kurpicz, Jan-Philipp Tarnowski//​\\ Proc. DCC 2023, 81-90.
 +  * **[[https://​doi.org/​10.1137/​1.9781611977554.ch189|Optimal Square Detection Over General Alphabets]]**\\ //**Jonas Ellert**, Paweł Gawrychowski,​ Garance Gourdel//\\ Proc. SODA 2023, 5220--5242.
 +==== 2022 ====
 +  * **[[https://​doi.org/​10.4230/​LIPIcs.ESA.2022.48|Lyndon Arrays Simplified]]**\\ //**Jonas Ellert**//​\\ Proc. ESA 2022, LIPIcs 244, 48:1--48:14
 +  * **LIVE-Interaktion statt Videomaterial bei der Sensibilisierung für Inklusion und Computerzugänglichkeit! - Im E-Lecture fragen Studierende einen blinden Betroffenen**\\ //**Kensuke Akao**//\\ Proc. DELFI 2022, LNI P-322, 189-194.
 +  * **[[https://​drops.dagstuhl.de/​opus/​volltexte/​2022/​16544/​|A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs]]**\\ //**Nico Bertram, Jonas Ellert, Johannes Fischer**//​\\ Proc. SEA 2022, 10.1-10.15
 +  * **[[https://​doi.org/​10.4230/​LIPIcs.CPM.2022.13|Back-to-Front Online Lyndon Forest Construction]]**\\ //Golnaz Badkobeh, Maxime Crochemore, **Jonas Ellert** and Cyril Nicaud//\\ Proc. CPM 2022, LIPIcs 223, 13:1--13:23
 +==== 2021 ====
 +  * **[[https://​doi.org/​10.1145/​3481638|Engineering Practical Lempel-Ziv Tries]]**\\ //Diego Arroyuelo, Rodrigo Canovas, **Johannes Fischer**, Dominik Köppl, Marvin Löbel, Gonzalo Navarro, Rajeev Raman//\\ ACM J. Exp. Algor. 26, Article No.: 1.14, pp 1-47.
 +  * **[[https://​delfi-tagung.de/​fileadmin/​TG/​DELFI/​HDI_2021/​5410_HDI-Tagungsband_-_Broschuere_-_L11_so.pdf#​page=74|Wie können wir Lehramtsstudierende auf einen inklusiven Informatikunterricht vorbereiten?​]]**\\ //**Kensuke Akao, Johannes Fischer**//​\\ Proc. HDI 2021, 75-83.
 +  * **[[https://​doi.org/​10.4230/​LIPIcs.ESA.2021.15|Lyndon Words Accelerate Suffix Sorting]]**\\ //**Nico Bertram, Jonas Ellert, Johannes Fischer**//​\\ Proc. ESA 2021, LIPIcs 204, 15:​1--15:​13. ​
 +  * **[[https://​doi.org/​10.1145/​3457197|Practical Wavelet Tree Construction]]**\\ //**Patrick Dinklage, Jonas Ellert, Johannes Fischer, Florian Kurpicz, Marvin Löbel**//​\\ ACM J. Exp. Algor. 26(1), Article No.: 1.8, pp 1–67.
 +  * **[[https://​doi.org/​10.18420/​infos2021_p228|Reflexionsförderung bei Lehramtsstudierenden durch den Einsatz von videobasierten Aufgaben]]**\\ //​**Johannes Fischer, Martin Weinert**//​\\ INFOS'​21,​ 261-270.
 +  * **[[https://​doi.org/​10.18420/​infos2021_k217|Zum Stand der Lehramtsausbildung für einen inklusiven Informatikunterricht]]**\\ //**Kensuke Akao, Johannes Fischer**//​\\ INFOS'​21,​ 291-294.
 +  * **[[https://​doi.org/​10.4230/​LIPIcs.SEA.2021.7|Engineering Predecessor Data Structures for Dynamic Integer Sets]]**\\ //**Patrick Dinklage, Johannes Fischer, Alexander Herlez**//​\\ Proceeding of the 19th International Symposium on Experimental Algorithms (SEA 2021), LIPIcs 190, 7:1–7:19. ([[https://​arxiv.org/​abs/​2104.06740|arXiv version]])
 +  * **[[https://​doi.org/​10.4230/​LIPIcs.ICALP.2021.63|Linear Time Runs Over General Ordered Alphabets]]
 +**\\ //**Jonas Ellert**, **Johannes Fischer**//​\\ Proc. ICALP 2021, LIPIcs 198, 63:​1--63:​16. ([[https://​www.youtube.com/​watch?​v=bHbXVlb_EJ4|video presentation on YouTube]])
 ==== 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. +  * **[[http://​ceur-ws.org/​Vol-2755/​paper11.pdf|Fostering Reflection in CS Teacher Education]]**\\ //​**Johannes Fischer**, Nora Romahn, **Martin Weinert**//​\\ ISSEP (CEURWS Volume) 2020: 128-139. 
-  * **Deterministic Sparse Suffix Sorting in the Restore Model**\\ //​**Johannes Fischer, Tomohiro I, Dominik Köppl**//​\\ ​Accepted to ACM Trans. ​Algorithms. +  * **[[http://​ceur-ws.org/​Vol-2755/​paper3.pdf|To Project or Not to Project: In Search of the Pathway to Object Orientation]]**\\ //​**Johannes Fischer, Arno Pasternak**//​\\ ISSEP (CEURWS Volume) 2020: 31-42 
-  * **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 70:
 <!-- 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&#​248;​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&#​248;​j</​a><​br />ACM Transactions on Algorithms (TALG),&​nbsp;​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&#​248;​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&#​248;​j</​a><​br />ACM Transactions on Algorithms (TALG),&​nbsp;​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 59: Line 81:
   * **[[http://​dx.doi.org/​10.4230/​LIPIcs.STACS.2016.39|Efficiently Finding All Maximal α-gapped Repeats]]** \\ //Pawel Gawrychowski,​ **Tomohiro I**, Shunsuke Inenaga, **Dominik Köppl**, Florin Manea// \\ Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016), LIPIcs 47, 39:1-39:14.   * **[[http://​dx.doi.org/​10.4230/​LIPIcs.STACS.2016.39|Efficiently Finding All Maximal α-gapped Repeats]]** \\ //Pawel Gawrychowski,​ **Tomohiro I**, Shunsuke Inenaga, **Dominik Köppl**, Florin Manea// \\ Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016), LIPIcs 47, 39:1-39:14.
   * **[[http://​www.sciencedirect.com/​science/​article/​pii/​S1570866715001057|GLOUDS:​ Representing Tree-Like Graphs]]**\\ //​**Johannes Fischer**, Daniel Peters//\\ J. Discrete Algorithms 36: 39-49.   * **[[http://​www.sciencedirect.com/​science/​article/​pii/​S1570866715001057|GLOUDS:​ Representing Tree-Like Graphs]]**\\ //​**Johannes Fischer**, Daniel Peters//\\ J. Discrete Algorithms 36: 39-49.
-  * **[[http://​dx.doi.org/​10.1007/​978-3-642-27848-8_640-1|Compressed Range Minimum Queries]]**\\ //​**Johannes Fischer**//​\\ In Ming-Yang Kao (ed.): Encyclopedia of Algorithms (2nd edition), 379-382, Springer. 
  
 ==== 2015 ==== ==== 2015 ====
Line 86: Line 107:
  
 ===== Other Publications ===== ===== Other Publications =====
 +  * **Scalable Text Index Construction**\\ //Timo Bingmann, **Patrick Dinklage, Johannes Fischer**, Florian Kurpicz, Enno Ohlebusch, Peter Sanders//\\ Algorithms for Big Data 2022: 252-284
 +  * **[[https://​www.unterrichtsvideos.net/​tagung/​viewer/​show?​file=..%2Fdownloads%2FPoster%2FGruppe_B.pdf#​pagemode=bookmarks|Videobasierte Aufgaben im Studium des Informatiklehramts]]**\\ //**Martin Weinert, Johannes Fischer**// \\ Poster, Lehren und Forschen mit Videos in der Lehrkräftebildung,​ 2021
   * **[[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://​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://​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.
 +  * **[[http://​dx.doi.org/​10.1007/​978-3-642-27848-8_640-1|Compressed Range Minimum Queries]]**\\ //​**Johannes Fischer**//​\\ In Ming-Yang Kao (ed.): Encyclopedia of Algorithms (2nd edition), 379-382, Springer.
 +
 
Last modified: 2023-08-05 09:13 by Johannes Fischer
DokuWikiRSS-Feed