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 [2021-06-24 09:15] Johannes Fischer [2021] |
fischer:publications [2023-01-20 08:40] Johannes Fischer [2023] |
||
|---|---|---|---|
| Line 4: | Line 4: | ||
| ===== Peer Reviewed Publications ===== | ===== Peer Reviewed Publications ===== | ||
| + | |||
| + | ==== 2023 ==== | ||
| + | |||
| + | * **Bit-Parallel (Compressed) Wavelet Tree Construction**\\ //**Patrick Dinklage, Johannes Fischer**, Florian Kurpicz, Jan-Philipp Tarnowski//\\ Accepted at DCC 2023. | ||
| + | * **Optimal Square Detection Over General Alphabets**\\ //**Jonas Ellert**, Paweł Gawrychowski, Garance Gourdel//\\ Accepted at SODA 2023. | ||
| + | ==== 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 ==== | ==== 2021 ==== | ||
| - | * **Lyndon Words Accelerate Suffix Sorting**\\ //**Nico Bertram, Jonas Ellert, Johannes Fischer**//\\ To appear in ESA'21. | + | * **[[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. |
| - | * **Practical Wavelet Tree Construction**\\ //**Patrick Dinklage, Jonas Ellert, Johannes Fischer, Florian Kurpicz, Marvin Löbel**//\\ To appear in ACM J. Exp. Algor. | + | * **[[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. |
| - | * **Reflexionsförderung bei Lehramtsstudierenden durch den Einsatz von videobasierten Aufgaben**\\ //**Johannes Fischer, Martin Weinert**//\\ To appear in INFOS'21. | + | * **[[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. |
| - | * **Zum Stand der Lehramtsausbildung für einen inklusiven Informatikunterricht**\\ //**Kensuke Akao, Johannes Fischer**//\\ To appear in INFOS'21. | + | * **[[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.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 2019), LIPIcs 190, 7:1–7:19. ([[https://arxiv.org/abs/2104.06740|arXiv version]]) | + | * **[[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. |
| - | * **Linear Time Runs over General Ordered Alphabets | + | * **[[https://doi.org/10.18420/infos2021_k217|Zum Stand der Lehramtsausbildung für einen inklusiven Informatikunterricht]]**\\ //**Kensuke Akao, Johannes Fischer**//\\ INFOS'21, 291-294. |
| - | **\\ //**Jonas Ellert**, **Johannes Fischer**//\\ To appear in ICALP'21. ([[https://arxiv.org/abs/2102.08670|arXiv version]]) | + | * **[[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 ==== | ||
| * **[[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. | * **[[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. | ||