Informatik-Seminar Sommer 2025

Themenliste

1. Empirical Study of Usage and Performance of Java Collections, 
   Costa et al., ICPE 2017

https://aip.ifi.uni-heidelberg.de/fileadmin/papers/2017/ICPE2017_EmpiricalStudyCollections_Costa.pdf

 
2. A Mathematical Model of the Fining of Usability Problems, 
   Nielsen and Landauer, INTERCHI 1993


https://dl.acm.org/doi/pdf/10.1145/169059.169166

3. Geffert Normalformen

   V. Geffert hat in seiner Arbeit 
   Normal forms for phrase-structure grammars. 
   RAIRO Informatique theorique et Applications/Theoretical Informatics and Applications 25, 473-498 (1991) 
   erklärt, wie alle rekursiv aufzählbaren Sprachen mit "nur sehr wenigen nicht-kontextfreien Regeln" und mit "nur sehr wenigen Nichtterminalen" beschrieben werden können.

4. Separatortheoreme f\"ur Graphen aus Schnittmodellen

   J. Fox und J. Pach haben in ihrer Arbeit
   Separator theorems and Turan-type results for planar intersection graphs. 
   Advances in Mathematics 219, 1070-1080 (2008) 
   beschrieben, dass es Separatortheoreme wie das bekannte von Lipton und Tarjan allgemeiner für Graphen gibt, die mit Schnittmodellen beschrieben werden können.

5. Komplexitätstheoretische Grundlagen für Aufzählungsprobleme 
   werden beschrieben in:

   David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis:
   On Generating All Maximal Independent Sets. 
   Information Processing Letters 27(3): 119-123 (1988)
   Bei dem Thema wäre es sinnvoll, "Berechenbarkeit und Komplexität" 
   gehört zu haben.

6. Aufzählungsprobleme finden sich in vielen Anwendungen; 
   eine der ersten für verteilte Systeme wird dargestellt in:

   Hector Garcia-Molina, Daniel Barbará:
   How to Assign Votes in a Distributed System. Journal of the ACM 32(4): 841-860 (1985)

Es wäre gut, wenn hier eng mit (c) zusammengearbeitet würde.  

 7. Layered Graph Drawing with Few Gaps and Few Crossings

https://arxiv.org/abs/2502.20896


 8. Minimum spanning blob-trees

https://arxiv.org/abs/2503.02439>


 9. Guarding a 1.5D terrain with Imprecise Viewpoints

https://kam.mff.cuni.cz/conferences/eurocg2025/booklet2025.pdf (Seite 311)


10. Visualizing Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees and Cacti

https://kam.mff.cuni.cz/conferences/eurocg2025/booklet2025.pdf (Seite 506)

11. Rounding Arrangements Dynamically
    Leoniads J. Guibas and David H. Marimont

Rounding-Arrangements-Dynamically.pdf


12. A New Approach To Subdivision Simplification
    by Mark de Berg, Marc van Kreveld and Stefan Schirra

A-New-Approach-To-Subdivision-Simplification.pdf


 13. Iterated Snap Rounding
     by Dan Halperin and Eli Packer

Iterated-Snap-Rounding.pdf


14. Speeding up the Douglas Peucker Line Simplification Algorithm
    John Hershberger and Jack Snoeyink

Speeding-Up-The-Douglas-Peucker-Line-Simplification-Algorithm.pdf

15. PaperQA: Retrieval-Augmented Generative Agent for Scientific Research

https://arxiv.org/pdf/2312.07559 


16. Generating Clarifying Questions for Query Refinement in Source Code Search

https://arxiv.org/pdf/2201.09974 


17. CORE-Bench: Fostering the Credibility of Published Research Through a Computational Reproducibility Agent Benchmark

https://arxiv.org/abs/2409.11363 


18. Computational reproducibility of Jupyter notebooks from biomedical publications

https://arxiv.org/abs/2308.07333 

19. Thorgeirsson, S., Ewen, T., & Su, Z. (2025, February)
    What Can Computer Science Educators Learn From the Failures of Top-Down Pedagogy?. 
    In Proceedings of the 56th ACM Technical Symposium on Computer Science Education V. 1 (pp. 1127-1133). 

https://dl.acm.org/doi/pdf/10.1145/3641554.3701873 


20. Hartmann, M., Hielscher, M., & Marinus, E. (2024, November)
    Prevalence of Programming Misconceptions in Primary School Students. 
    In Proceedings of the 24th Koli Calling International Conference on Computing Education Research (pp. 1-11).

https://dl.acm.org/doi/pdf/10.1145/3699538.3699568


21. Foughali, M. A. (2023, November) 
    Some thoughts on teaching introductory programming and the first language dilemma. 
    In Proceedings of the 23rd Koli Calling International Conference on Computing Education Research (pp. 1-8).

https://dl.acm.org/doi/pdf/10.1145/3631802.3631812


22. Kazemitabaar, M., Hou, X., Henley, A., Ericson, B. J., Weintrop, D., & Grossman, T. (2023, November) 
    How novices use LLM-based code generators to solve CS1 coding tasks in a self-paced learning environment. 
    In Proceedings of the 23rd Koli calling international conference on computing education research (pp. 1-12).

https://dl.acm.org/doi/pdf/10.1145/3631802.3631806

23. Congestion Avoidance and Control
    Van Jacobson et al., SIGCOMM 1988) 
    This classic paper addresses the early Internet’s **congestion collapse** in the 1980s. It famously recounts 
    how in 1986 a simple file transfer between two nearby sites (400 yards apart) saw throughput drop from 32 Kbps to 40 bps 
    due to network congestion . Jacobson and Karels identified that the issue lay in TCP implementations and introduced 
    several new congestion control mechanisms. The result was dramatic – modified TCP could fill the network pipe without 
    collapsing, whereas the old TCP only achieved ~75% of link bandwidth due to excessive retransmissions. This paper laid 
    the foundation for all modern TCP/IP congestion control. 

https://ee.lbl.gov/papers/congavoid.pdf#:~:text=In%20October%20of%20%E2%80%9986%2C%20the,3BSD%20%28Berkeley%20UNIX%29%20TCP


24. A Multifaceted Look at Starlink Performance
    Nitinder Mohan et al., WebConf 2024 
    This study is examining SpaceX’s **Starlink** satellite internet network. The authors conduct a large-scale 
    measurement to see how Starlink performs as an ISP. Importantly, the paper also shows Starlink can support 
    real-time applications like Zoom video calls and cloud gaming with performance similar to terrestrial networks 
    under good conditions . That said, because the satellites periodically hand off connections, users might see 
    brief hiccups. The researchers also noted Starlink’s use of **inter-satellite laser links**, which in some 
    cases route data faster than undersea cables for long distances. 

https://www.nitindermohan.com/documents/2024/pubs/starlinkWWW2024.pdf#:~:text=,significantly%20increases%20under%20traffic%20load


25.History, Development, and Principles of Large Language Models—An Introductory Survey
   Wang et al. 2024 
   Diese Arbeit bietet einen einführenden Überblick über die historische Entwicklung, die technischen Prinzipien 
   und die konzeptionellen Grundlagen großer Sprachmodelle (LLMs). Im Mittelpunkt stehen die zentralen 
   Meilensteine im Deep Learning, die zur heutigen Architektur von LLMs geführt haben, einschließlich 
   Transformer-Architekturen, Trainingsmethoden, Skalierungsstrategien und Evaluationsmetriken. 

https://arxiv.org/pdf/2402.06853


26. Rust's Memory Safety Model: An Evaluation of Its Effectiveness in Preventing Common Vulnerabilities
    Santoso et al. 2023)
    Diese Untersuchung bewertet Rusts Ansatz zur Speichersicherheit im Vergleich zu klassischen 
    Speicherverwaltungsmodellen (z. B. in C/C++). Sie analysiert, wie effektiv Rust durch Ownership, 
    Borrowing und Lifetime-Checks typische Schwachstellen wie Use-after-free oder Buffer Overflows 
    verhindert und welche Grenzen dabei bestehen. 

https://www.sciencedirect.com/science/article/pii/S1877050923016757

27. From Display to Interaction: Design Patterns for Cross-Reality Systems 

https://ieeexplore.ieee.org/abstract/document/10922183


28. Comparison of Cross-Reality Transition Techniques Between 3D and 2D Display Spaces in Desktop–AR Systems 

https://ieeexplore.ieee.org/abstract/document/10919011


29. Self-Similarity Beats Motor Control in Augmented Reality Body Weight Perception 

https://ieeexplore.ieee.org/abstract/document/10930320


30. The Impact of Avatar Clothing on the Proteus Effect and Stereotype Threat 

https://ieeexplore.ieee.org/abstract/document/10937435