Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
fischer:publications [2021-02-18 09:43] Jonas Ellert [Peer Reviewed Publications] |
fischer:publications [2021-03-10 13:27] Johannes Fischer [2020] |
||
|---|---|---|---|
| Line 9: | Line 9: | ||
| ==== 2020 ==== | ==== 2020 ==== | ||
| * **Fostering Reflection in CS Teacher Education**\\ //**Johannes Fischer**, Nora Romahn, **Martin Weinert**//\\ Accepted at ISSEP'20. | * **Fostering Reflection in CS Teacher Education**\\ //**Johannes Fischer**, Nora Romahn, **Martin Weinert**//\\ Accepted at ISSEP'20. | ||
| - | * **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. | ||