Published in: Dagstuhl Reports, Volume 14, Issue 6 (2024)
Tiffany Barnes, Jan Vahrenhold, Thomas Zeume, and Florian Schmalstieg. Teaching Support Systems for Formal Foundations of Computer Science (Dagstuhl Seminar 24251). In Dagstuhl Reports, Volume 14, Issue 6, pp. 108-129, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Article{barnes_et_al:DagRep.14.6.108, author = {Barnes, Tiffany and Vahrenhold, Jan and Zeume, Thomas and Schmalstieg, Florian}, title = {{Teaching Support Systems for Formal Foundations of Computer Science (Dagstuhl Seminar 24251)}}, pages = {108--129}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2024}, volume = {14}, number = {6}, editor = {Barnes, Tiffany and Vahrenhold, Jan and Zeume, Thomas and Schmalstieg, Florian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.6.108}, URN = {urn:nbn:de:0030-drops-227301}, doi = {10.4230/DagRep.14.6.108}, annote = {Keywords: artificial intelligence in education, computing education research, educational data mining, formal foundations of computer science, intelligent tutoring systems, user modeling and adaptive personalization, user studies} }
Published in: LIPIcs, Volume 322, 35th International Symposium on Algorithms and Computation (ISAAC 2024)
Thore Thießen and Jan Vahrenhold. Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues. In 35th International Symposium on Algorithms and Computation (ISAAC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 322, pp. 55:1-55:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{thieen_et_al:LIPIcs.ISAAC.2024.55, author = {Thie{\ss}en, Thore and Vahrenhold, Jan}, title = {{Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues}}, booktitle = {35th International Symposium on Algorithms and Computation (ISAAC 2024)}, pages = {55:1--55:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-354-6}, ISSN = {1868-8969}, year = {2024}, volume = {322}, editor = {Mestre, Juli\'{a}n and Wirth, Anthony}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2024.55}, URN = {urn:nbn:de:0030-drops-221832}, doi = {10.4230/LIPIcs.ISAAC.2024.55}, annote = {Keywords: offline ORAM, oblivious priority queue, perfect security, external memory algorithm, cache-oblivious algorithm} }
Published in: Dagstuhl Reports, Volume 9, Issue 7 (2020)
Mark Guzdial, Shriram Krishnamurthi, Juha Sorva, and Jan Vahrenhold. Notional Machines and Programming Language Semantics in Education (Dagstuhl Seminar 19281). In Dagstuhl Reports, Volume 9, Issue 7, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@Article{guzdial_et_al:DagRep.9.7.1, author = {Guzdial, Mark and Krishnamurthi, Shriram and Sorva, Juha and Vahrenhold, Jan}, title = {{Notional Machines and Programming Language Semantics in Education (Dagstuhl Seminar 19281)}}, pages = {1--23}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2019}, volume = {9}, number = {7}, editor = {Guzdial, Mark and Krishnamurthi, Shriram and Sorva, Juha and Vahrenhold, Jan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.9.7.1}, URN = {urn:nbn:de:0030-drops-116272}, doi = {10.4230/DagRep.9.7.1}, annote = {Keywords: computing education research, formal semantics, misconceptions, notional machines} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Christian Scheffer and Jan Vahrenhold. Approximate Shortest Distances Among Smooth Obstacles in 3D. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 60:1-60:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{scheffer_et_al:LIPIcs.ISAAC.2016.60, author = {Scheffer, Christian and Vahrenhold, Jan}, title = {{Approximate Shortest Distances Among Smooth Obstacles in 3D}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {60:1--60:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-026-2}, ISSN = {1868-8969}, year = {2016}, volume = {64}, editor = {Hong, Seok-Hee}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.60}, URN = {urn:nbn:de:0030-drops-68292}, doi = {10.4230/LIPIcs.ISAAC.2016.60}, annote = {Keywords: Geodesic distances; approximation algorithm; epsilon sample} }
Published in: Dagstuhl Reports, Volume 6, Issue 2 (2016)
Michael E. Caspersen, Kathi Fisler, and Jan Vahrenhold. Assessing Learning In Introductory Computer Science (Dagstuhl Seminar 16072). In Dagstuhl Reports, Volume 6, Issue 2, pp. 78-96, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Article{caspersen_et_al:DagRep.6.2.78, author = {Caspersen, Michael E. and Fisler, Kathi and Vahrenhold, Jan}, title = {{Assessing Learning In Introductory Computer Science (Dagstuhl Seminar 16072)}}, pages = {78--96}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {6}, number = {2}, editor = {Caspersen, Michael E. and Fisler, Kathi and Vahrenhold, Jan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.2.78}, URN = {urn:nbn:de:0030-drops-58899}, doi = {10.4230/DagRep.6.2.78}, annote = {Keywords: Assessment, Learning Objectives} }
Published in: Dagstuhl Seminar Proceedings, Volume 6091, Data Structures (2006)
Henrik Blunck and Jan Vahrenhold. In-Place Randomized Slope-Selection. In Data Structures. Dagstuhl Seminar Proceedings, Volume 6091, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{blunck_et_al:DagSemProc.06091.4, author = {Blunck, Henrik and Vahrenhold, Jan}, title = {{In-Place Randomized Slope-Selection}}, booktitle = {Data Structures}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6091}, editor = {Lars Arge and Robert Sedgewick and Dorothea Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06091.4}, URN = {urn:nbn:de:0030-drops-8390}, doi = {10.4230/DagSemProc.06091.4}, annote = {Keywords: In-Place Algorithms, Slope Selection} }
Published in: Dagstuhl Seminar Proceedings, Volume 4301, Cache-Oblivious and Cache-Aware Algorithms (2005)
Joachim Gudmundsson and Jan Vahrenhold. A Simple Algorithm for I/O-efficiently Pruning Dense Spanners. In Cache-Oblivious and Cache-Aware Algorithms. Dagstuhl Seminar Proceedings, Volume 4301, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{gudmundsson_et_al:DagSemProc.04301.2, author = {Gudmundsson, Joachim and Vahrenhold, Jan}, title = {{A Simple Algorithm for I/O-efficiently Pruning Dense Spanners}}, booktitle = {Cache-Oblivious and Cache-Aware Algorithms}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4301}, editor = {Lars Arge and Michael A. Bender and Erik Demaine and Charles Leiserson and Kurt Mehlhorn}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04301.2}, URN = {urn:nbn:de:0030-drops-1566}, doi = {10.4230/DagSemProc.04301.2}, annote = {Keywords: No keywords} }
Feedback for Dagstuhl Publishing