DOI,IST REx ID,Research Group,Title of publication
10.15479/AT:ISTA:9022,9022,"GradSch,LaEr",Fluctuations in the spectrum of random matrices
10.15479/at:ista:10422,10422,"GradSch,CaGo",Towards designer materials using customizable particle shape
10.15479/at:ista:10030,10030,"GradSch,JaMa",Discrete-to-continuum limits of transport problems and gradient flows in the space of measures
10.15479/at:ista:9733,9733,"GradSch,RoSe,JaMa",The polaron at strong coupling
10.1007/s11005-020-01350-5,9225,RoSe,"Persistence of the spectral gap for the Landau–Pekar equations"
10.48550/arXiv.2106.11217,9792,"RoSe,JaMa",A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature
10.48550/arXiv.2101.12566,9787,RoSe,The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics
10.48550/arXiv.2107.03720,9791,RoSe,The effective mass problem for the Landau-Pekar equations
10.1007/978-3-030-81685-8_16,9987,KrCh,Stateless model checking under a reads-value-from equivalence
10.15479/at:ista:10199,10199,"GradSch,KrCh",Improved verification techniques for concurrent systems
10.1145/3485541,10191,"GradSch,KrCh",The reads-from equivalence for the TSO and PSO memory models
10.15479/at:ista:10007,10007,"GradSch,JuFi",Curvature driven interface evolution: Uniqueness properties of weak solution concepts
10.15479/at:ista:10429,10429,"GradSch,DaAl",On achieving scalability through relaxation
null,10435,DaAl,Asynchronous decentralized SGD with quantized and local updates
null,10432,DaAl,Elastic consistency: A practical consistency model for distributed stochastic gradient descent
10.48550/arXiv.2108.01733,10013,JuFi,Weak-strong uniqueness for the mean curvature flow of double bubbles
10.15479/AT:ISTA:9418,9418,"GradSch,ChLa",Underspecification in deep learning
10.15479/AT:ISTA:9056,9056,"HeEd,GradSch",Multi-cover persistence and Delaunay mosaics
null,9416,"GradSch,ChLa",The inductive bias of ReLU networks on orthogonally separable data
10.15479/at:ista:10035,10035,"GradSch,KrPi",On the adaptive security of graph-based games