Institution profile

University of Bayreuth

Academic institutioneurope · de
Official website
Research library121linked papers
Opportunities0open roles
Selected work

Representative Papers

On Ray Reordering Techniques for Faster GPU Ray Tracing

May 04, 2020ACM Symposium on Interactive 3D Graphics and Games

Secondary rays in GPU-accelerated ray tracing exhibit poor spatial locality and low SIMT execution efficiency, limiting overall performance. Method: This paper proposes a hardware-agnostic ray reordering framework centered on an Endpoint-Estimated Key—designed specifically for secondary rays—to enhance spatial coherence with minimal computational overhead. The approach integrates wavefront path tracing scheduling, cooperative utilization of RTX hardware traversal kernels, and GPU memory access locality modeling, without relying on shader-specific implementations. Contribution/Results: Evaluated on modern GPUs, the method achieves 1.3–2.0× end-to-end ray tracing speedup. Reordering significantly accelerates software-intensive stages (e.g., intersection computation and shading preparation); although hardware traversal incurs inherent overhead, the net performance gain remains unambiguous. This work establishes a novel, portable paradigm for general-purpose GPU ray reordering—enabling efficient, implementation-independent acceleration across diverse ray tracing pipelines.

18 citations3 influentialRead paper

Inference in Unbalanced Panel Data Models with Interactive Fixed Effects

Apr 07, 2020

This paper addresses asymptotic inference for interactive fixed-effects estimators in unbalanced panel data under random missingness. Recognizing that existing literature lacks a systematic characterization of how missingness proportions and patterns affect estimation, we derive the asymptotic normality of the estimator under general missing-data mechanisms—establishing the first rigorous theoretical foundation for this setting. We propose a robust inference procedure based on principal component analysis (PCA) that remains valid under high missingness rates. Monte Carlo simulations confirm the method’s reliability even with substantial missingness and demonstrate the robustness of Bai (2009) and Moon–Weidner (2017) frameworks under conditionally random missingness. Applying our approach to reassess the causal effect of democratization on economic growth, we robustly identify a statistically significant positive impact. Our results enhance both the statistical credibility and empirical applicability of interactive fixed-effects models in realistic settings with missing data.

3 citationsRead paper

PathFinder: A unified approach for handling paths in graph query languages

Jun 03, 2023

Path matching in graph query languages (e.g., Cypher, SQL/PGQ, GQL) lacks a unified and efficient processing mechanism—particularly when supporting complex path semantics (e.g., shortest paths, simple paths) and regular-expression constraints on edge labels—posing dual challenges in expressive power and performance. This paper introduces the first cross-language, general-purpose path-solving framework. It features a compact symbolic path representation and integrates dynamic-programming-based enumeration, incremental pipelined execution, and regex compilation optimizations to enable unified modeling and efficient evaluation of diverse path semantics and edge-label constraints. Experimental evaluation on real-world datasets and complex queries demonstrates an order-of-magnitude speedup over state-of-the-art graph engines, while maintaining high expressiveness, strong scalability, and behavioral stability.

2 citationsRead paper
Recent publications

Latest Papers

Time to Move on: Querying without Nulls and Bags

Aug 11, 2026

Traditional SQL undermines the theoretical foundations of the relational model by relying on nulls and bags, leading to semantic ambiguities and increased query complexity. This work proposes and implements Rel, a novel declarative query language that entirely eliminates nulls and bags, adhering strictly to set semantics and canonical relational algebra. Through an end-to-end system design and real-world deployment, we demonstrate that a null-free, bag-free relational system is not only expressively complete but also offers significant advantages in optimizability, semantic clarity, and engineering practicality. Our results confirm the feasibility and superiority of this paradigm for real-world applications.

0 citationsRead paper

The Case for Vibe Modeling: A Missing Step in AI-Based Trustworthy Software Development

Jul 30, 2026

Current AI-generated code often suffers from insufficient preservation of human intent and limited behavioral interpretability, leading to challenges in comprehension, verification, and trust. This work proposes “vibe modeling”—a lightweight intermediate abstraction situated between natural language and executable code—that for the first time bridges the representational gap in AI-driven software development by explicitly encoding intent retention and enabling behavioral reasoning. Through an integrated approach combining large language models, human-computer interaction studies, and qualitative analysis, the research demonstrates that vibe modeling significantly reduces developers’ cognitive load during code understanding and validation while enhancing their trust in LLM-generated code. The findings establish vibe modeling as a novel paradigm for trustworthy, AI-assisted programming.

0 citationsRead paper