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-01-14 09:33] ellert [2020] |
fischer:publications [2021-05-31 13:13] Johannes Fischer |
||
|---|---|---|---|
| Line 4: | Line 4: | ||
| ===== Peer Reviewed Publications ===== | ===== Peer Reviewed Publications ===== | ||
| + | ==== 2021 ==== | ||
| + | * **Reflexionsförderung bei Lehramtsstudierenden durch den Einsatz von videobasierten Aufgaben**\\ //**Johannes Fischer, Martin Weinert**//\\ To appear in INFOS'21. | ||
| + | * **Zum Stand der Lehramtsausbildung für einen inklusiven Informatikunterricht**\\ //**Kensuke Akao, Johannes Fischer**//\\ To appear in INFOS'21. | ||
| + | * **[[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]]) | ||
| + | * **Linear Time Runs over General Ordered Alphabets | ||
| + | **\\ //**Jonas Ellert**, **Johannes Fischer**//\\ To appear in ICALP'21. ([[https://arxiv.org/abs/2102.08670|arXiv version]]) | ||
| ==== 2020 ==== | ==== 2020 ==== | ||
| - | * **Fostering Reflection in CS Teacher Education**\\ //**Johannes Fischer**, Nora Romahn, **Martin Weinert**//\\ Accepted at ISSEP'20. | + | * **[[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. |
| - | * **To Project or Not to Project: In Search of the Pathway to Object Orientation**\\ //**Johannes Fischer, Arno Pasternak**//\\ Accepted at ISSEP'20. | + | * **[[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 |
| * **[[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.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://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://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. | ||
| Line 57: | Line 63: | ||
| * **[[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 84: | Line 89: | ||
| ===== Other Publications ===== | ===== Other Publications ===== | ||
| + | * **[[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. | * **[[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. | ||
| + | |||