Stefan Kuhlmann

dblp:79/5148 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
5since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5 · 2 first-author · 5 since 2021Software engineering, systems software and programming languages · 2Databases, data management, data science and information retrieval · 2
YearPublicationVenuePosition
2026 A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
Stefan Kuhlmann, Robert Weismantel
IPCO1
2025 Sparse Approximation in Lattices and Semigroups
Stefan Kuhlmann, Timm Oertel, Robert Weismantel
IPCO1
2024 On Matrices over a Polynomial Ring with Restricted Subdeterminants
Marcel Celaya, Stefan Kuhlmann, Robert Weismantel
IPCO2
2022 Improving the Cook et al. Proximity Bound Given Integral Valued Constraints
Marcel Celaya, Stefan Kuhlmann, Joseph Paat, Robert Weismantel
IPCO2
2022 On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases
abstract
We study the lattice width of lattice-free polyhedra given by ${A}{x}\leq{b}$ in terms of $\Delta({A})$, the maximal $n\times n$ minor in absolute value of ${A}\in\mathbb{Z}^{m\times n}$. Our main contribution is to link the lattice width of lattice-free polyhedra to the height of Hilbert bases and to the diameter of finite abelian groups. This leads to a bound on the lattice width of lattice-free pyramids which solely depends on $\Delta({A})$ provided a conjecture regarding the height of Hilbert bases holds. Further, we exploit a combination of techniques to obtain novel bounds on the lattice width of simplices. A second part of the paper is devoted to a study of the above-mentioned Hilbert basis conjecture. We give a complete characterization of the Hilbert basis if $\Delta({A}) = 2$ which implies the conjecture in that case and prove its validity for simplicial cones.
Martin Henk, Stefan Kuhlmann, Robert Weismantel
SIAM J. Discret. Math.2
2014 Innovation diffusion in open source software: preliminary analysis of dependency changes in the gentoo portage package database
abstract
In this paper we make the case that software dependencies are a form of innovation adoption. We then test this on the time-evolution of the Gentoo package dependency graph. We find that the Bass model of innovation diffusion fits the growth of the number of packages depending on a given library. Interestingly, we also find that low-level packages have a primarily imitation driven adoption and multimedia libraries have primarily innovation driven growth.
Remco Bloemen, Chintan Amrit, Stefan Kuhlmann, Gonzalo Ordóñez-Matamoros
MSR3
2014 Gentoo package dependencies over time
abstract
Open source distributions such as Gentoo need to accurately track dependency relations between software packages in order to install working systems. To do this, Gentoo has a carefully authored database containing those relations. In this paper, we extract the Gentoo package dependency graph and its changes over time. The final dependency graph spans 15 thousand open source projects and 80 thousand dependency relations. Furthermore, the development of this graph is tracked over time from the beginning of the Gentoo project in 2000 to the first quarter of 2012, with monthly resolution. The resulting dataset provides many opportunities for research. In this paper we explore cluster analysis to reveals meaningful relations between packages and in a separate paper we analyze changes in the dependencies over time to get insights in the innovation dynamics of open source software.
Remco Bloemen, Chintan Amrit, Stefan Kuhlmann, Gonzalo Ordóñez-Matamoros
MSR3