From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “pair programming” 12

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

A Dependency Pair Framework for Relative Termination of Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

2

citations
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

Jan-Christoph Kassing, Stefan Dollase, Jürgen Giesl

2

citations
Who does what? Work division and allocation strategies of computer science student teams: Work division and allocation strategies of computer science student teams
2021 Leiden Repository (Leiden University) conference-paper Computer Science Teaching and Learning Programming

Anna van der Meulen, Efthimia Aivaloglou

12

citations
Who Does What? Work Division and Allocation Strategies of Computer Science Student Teams
2021 IEEE/ACM International Conference on Software Engineering: Software Engineering Education and Training (ICSE-SEET) conference-paper Computer Science Teaching and Learning Programming Open access

Anna van der Meulen, Efthimia Aivaloglou

0

citations
Sensitivity for Heavy Resonances at the HighLuminosity LHC with the Phase-2 CMS Detector
2020 European Physical Society Conference on High Energy Physics (EPS-HEP) conference-paper Physics and Astronomy Particle physics theoretical and experimental studies Open access

K. Höepfner

0

citations
Optimization of a CPSS-based Flexible Transportation System
2020 Mediterranean Conference on Embedded Computing (MECO) conference-paper Engineering Transportation and Mobility Innovations

Matthias Dziubany, Anke Schmeink, Guido Dartmann

2

citations
Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
2025 International Symposium on Principles and Practice of Declarative Programming (PPDP) conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

2

citations
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

7

citations
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
Neutrino Education, Outreach, and Communications Activities: Captivating Examples from IceCube
2022 Repository KITopen (Karlsruhe Institute of Technology) conference-paper Arts and Humanities Museums and Cultural Heritage Open access

Madeleine O'Keefe, Jocelyn Argueta, Ellen Bechtol, Katherine L. Shirey, James Madsen, Markus Ackermann, +86 more

0

citations
Neutrino Education, Outreach, and Communications Activities: Captivating Examples from IceCube
2021 International Cosmic Ray Conference conference-paper Arts and Humanities Museums and Cultural Heritage Open access

Madeleine O'Keefe, Jocelyn Argueta, Ellen Bechtol, Katherine L. Shirey, K. Andeen, Carlos A. Argüelles, +8 more

0

citations
A Temperature Independent Readout Circuit for ISFET-Based Sensor Applications
2022 IEEE Latin American Test Symposium (LATS) conference-paper Chemical Engineering Analytical Chemistry and Sensors

Elmira Moussavi, Dominik Šišejković, Animesh Singh, Daniyar Kizatov, Rainer Leupers, Sven Ingebrandt, +2 more

2

citations

12 results