@article{14703, abstract = {We present a discretization of the dynamic optimal transport problem for which we can obtain the convergence rate for the value of the transport cost to its continuous value when the temporal and spatial stepsize vanish. This convergence result does not require any regularity assumption on the measures, though experiments suggest that the rate is not sharp. Via an analysis of the duality gap we also obtain the convergence rates for the gradient of the optimal potentials and the velocity field under mild regularity assumptions. To obtain such rates we discretize the dual formulation of the dynamic optimal transport problem and use the mature literature related to the error due to discretizing the Hamilton-Jacobi equation.}, author = {Ishida, Sadashige and Lavenant, Hugo}, issn = {1615-3383}, journal = {Foundations of Computational Mathematics}, keywords = {Optimal transport, Hamilton-Jacobi equation, convex optimization}, pages = {349--384}, publisher = {Springer Nature}, title = {{Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation}}, doi = {10.1007/s10208-024-09686-3}, volume = {26}, year = {2026}, } @phdthesis{22804, abstract = {Embryo cleavage — a series of rapid, reductive cell divisions — is the first morphogenetic movement following fertilisation. It lays the foundation for subsequent developmental events, including gastrulation, germ layer specification, organogenesis, and the establishment of the overall body plan. Two major modes of cleavage exist in the animal kingdom: holoblastic (complete) and meroblastic (incomplete) cleavage. Because holoblastic cleavage resembles canonical cytokinesis, its biochemical and mechanical basis has been extensively studied — an annular contractile ring forms at the equator and constricts in a purse-string-like manner, leading to the complete separation of two daughter cells. In contrast, although meroblastic cleavage occurs widely across the animal kingdom (e.g. in fish, reptiles, birds, and cephalopod molluscs), its mechanical basis remains largely unclear. During meroblastic cleavage, the cytokinetic furrow forms only at one pole and does not traverse the entire embryo, raising the question of how cytokinesis proceeds in the absence of a closed contractile ring. Moreover, the resulting daughter cells are not fully separated from the underlying yolk compartment, and how these blastomeres are subsequently cellularised remains unknown. This thesis takes the zebrafish as a model organism to address both questions. The first part characterises the biochemical and mechanical mechanisms underlying non-canonical meroblastic cleavage, revealing a two-phase process in which actomyosin cable contraction and cadherin-mediated membrane adhesion act sequentially to drive furrow ingression and invagination. The second part sheds light on the spatiotemporal dynamics by which individual blastomeres become cellularised, and uncovers a previously unrecognised contribution of central blastomeres to the yolk syncytial layer.}, author = {Tong, Xin}, isbn = {978-3-99078-080-0}, issn = {2663-337X}, keywords = {meroblastic cleavage, cytokinesis, active gel theory, embryogenesis, zebrafish, adhesion}, pages = {121}, publisher = {Institute of Science and Technology Austria}, title = {{Towards a deeper understanding of meroblastic cleavage}}, doi = {10.15479/AT-ISTA-22804}, year = {2026}, } @misc{22777, author = {Tong, Xin}, publisher = {Institute of Science and Technology Austria}, title = {{Towards a deeper understanding of meroblastic cleavage - supplementary movies}}, doi = {10.15479/AT-ISTA-22777}, year = {2026}, } @article{22967, abstract = {Alkali salts are widely used in solution processing, yet the corresponding cations are often assumed to remain in the liquid phase. Here, we show that alkali ions introduced during the solution synthesis of SnSe are retained through particle isolation and continue to influence the material during subsequent thermal processing, where they shape the evolution of the final polycrystalline material. Different SnSe powders were prepared using Li+, Na+, and K+ precursors, as well as tetramethylammonium (TMA+) precursors as a nonalkali reference for comparison, and all samples were consolidated under identical conditions. Although all three alkali ions were found in the matrix, at grain boundaries, and in segregated nanoscale regions, they partitioned differently and resulted in distinct grain sizes, defect distributions, and therefore transport properties. Li induced the strongest grain size heterogeneity and the lowest energy barriers, Na the best overall balance between carrier concentration and mobility, and K the broadest alkali-rich grain boundary regions along with the strongest interfacial penalty to charge carrier transport. These results show that residual alkali ions are not just remnants of solution synthesis but active determinants of microstructure and thermoelectric performance in SnSe.}, author = {Fiedler, Christine and Horta, Sharona and Navita, Navita and Maji, Krishnendu and Kleinhanns, Tobias and Llorca, Jordi and Wang, Qi and Ramon, Maria Garcia and Das, Sambit and Gavini, Vikram and Liu, Yu and Ibáñez, Maria}, issn = {1520-5002}, journal = {Chemistry of Materials}, number = {18}, pages = {9323–9332}, publisher = {American Chemical Society}, title = {{Alkali ions retained from synthesis govern microstructure and transport in solution-processed SnSe}}, doi = {10.1021/acs.chemmater.6c01284}, volume = {38}, year = {2026}, } @article{22963, abstract = {Although studies of tumor invasion have mainly emphasized the evolution of genetic and epigenetic heterogeneity, cellular behaviors also depend on the physical microenvironment. Yet, the tumor microenvironment is both complex and continuously remodeled, making it hard to rigorously test its causal influence on tumor dissemination. Here, we adopted a reductionist approach to studying tumor cell invasion in microengineered environments of tunable patterned geometries. We find that not only the presence of obstacles but more unexpectedly their spatial disorder causes a drastic shift from a collective to a single-cell mode of invasion—comparable in strength to loss of cell-cell adhesion. Combining live-imaging and perturbation experiments with minimal biophysical modeling, we demonstrate that cell dissemination results both from local geometrical constraints and a global integration of spatial disorder over time. We identify generic universality classes of invasion dynamics dependent on environmental geometry, enabling us to identify quantitative physical principles for tumor dissemination.}, author = {Dunajova, Zuzana and Tasciyan, Saren and Majek, Juraj and Merrin, Jack and Jenkins, Robert P. and Sahai, Erik and Sixt, Michael K and Hannezo, Edouard B}, issn = {2375-2548}, journal = {Science Advances}, number = {37}, publisher = {AAAS}, title = {{Substrate heterogeneity promotes cancer cell dissemination through interface roughening}}, doi = {10.1126/sciadv.aed0587}, volume = {12}, year = {2026}, } @article{22971, abstract = {We study the problem of minimizing metric distortion in multi-winner elections, where a committee of size k is selected from a set of candidates based on voters’ ordinal preferences. We assume that voters and candidates are embedded on a line metric, and social cost is determined by the underlying metric distances. The distortion of a voting rule is the worst-case ratio between the social cost of the elected committee and an optimal committee. Previous work has focused on the q-cost model, in which a voter’s cost is given by the distance to their qth closest committee member. Here, we study the additive cost, where a voter’s cost is the sum of distances to all committee members. We introduce the Polar Comparison Rule and analyze its distortion under utilitarian additive cost. We show that it achieves a distortion upper bound of almost 2.33 for all committee sizes k > 4, improving upon the previously best-known upper bound of 3. Moreover, for k = 2 and k = 3, we establish tight distortion bounds of 2.41 and 2.33, respectively. We also derive lower bounds that depend on the parity of k and analyze the behavior of distortion for small and large committee sizes. Finally, we extend our results to the egalitarian additive cost.}, author = {Babashah, Negar and Karimi, Hasti and Seddighin, Masoud and Shahkarami, Golnoosh}, issn = {2167-8383}, journal = {ACM Transactions on Economics and Computation}, publisher = {ACM}, title = {{Distortion of multi-winner elections on the line metric: The polar comparison rule}}, doi = {10.1145/3843232}, year = {2026}, } @article{22998, abstract = {Balancing selection, a form of selection that maintains genetic diversity, is difficult to detect, and the importance of balancing selection for the maintenance of genetic variation may be larger than often assumed. We model the possibility that the diversity-promoting effects of balancing selection extend to other loci that show sign epistasis with a locus under balancing selection. Rather than focusing on overdominance, as was done in previous efforts, we explore the effects of negative frequency dependence and show that this has important effects on the conditions under which the diversity-promoting effect of epistasis can occur in diploids. Our results show that not only recombination rate but also the dominance of sign epistasis are key parameters that determine the maintenance of polymorphism beyond the locus under direct balancing selection. We suggest that the effect we explore may play a significant role, especially when balancing selection acts on major effect loci.}, author = {Khudiakova, Kseniia and Barton, Nicholas H and Arnqvist, Göran}, issn = {1096-0325}, journal = {Theoretical Population Biology}, keywords = {Sign epistasis, Balancing selection, Within-population genetic variation}, pages = {48--55}, title = {{Sign epistasis extends the effects of balancing selection on genetic diversity}}, doi = {10.1016/j.tpb.2026.09.001}, volume = {172}, year = {2026}, } @article{23001, abstract = {A famous conjecture by Itai and Zehavi states that, for every 𝑑 -vertex-connected graph 𝐺 and every vertex 𝑟 in 𝐺 , there are 𝑑 spanning trees of 𝐺 such that, for every vertex 𝑣 in 𝐺 ∖{𝑟} , the paths between 𝑟 and 𝑣 in different trees are internally vertex-disjoint. We show that with high probability the Itai–Zehavi conjecture holds asymptotically for the Erdős–Rényi random graph 𝐺⁡(𝑛,𝑝) when 𝑛⁢𝑝 =𝜔⁡(log⁡𝑛) and for random regular graphs 𝐺⁡(𝑛,𝑑) when 𝑑 =𝜔⁡(log⁡𝑛) . Moreover, we essentially confirm the conjecture up to a constant factor for sparser random regular graphs. This answers a question of Draganić and Krivelevich positively. Our proof makes use of recent developments on sprinkling techniques in random regular graphs.}, author = {Hollom, Lawrence and Lichev, Lyuben and Mond, Adva and Portier, Julien and Wang, Yiting}, issn = {1098-2418}, journal = {Random Structures and Algorithms}, number = {2}, publisher = {Wiley}, title = {{Approximate Itai–Zehavi conjecture for random graphs}}, doi = {10.1002/rsa.70095}, volume = {69}, year = {2026}, } @phdthesis{23033, author = {Stöllner, Andrea}, issn = {2663-337X}, keywords = {aerosol physics, electrostatics, optics, optical tweezers, atmospheric electricity}, pages = {88}, publisher = {Institute of Science and Technology Austria}, title = {{Microscale electrical behavior of highly charged individual aerosol particles using optical tweezers}}, doi = {10.15479/AT-ISTA-23033}, year = {2026}, } @inproceedings{23055, abstract = {We report progress toward strong electric-dipole coupling of polar molecules in cryogenic crystals to superconducting microwave resonators for hybrid quantum computing. We detect crystal-shifted inversion transitions of ammonia in neon using a multimode resonator.}, author = {De Zordo, Nikolaus and Borja Espinosa, Carla N and Al Hyder, Ragheed and Li, Jinglun and Kersten, Wenzel and Kanagin, Andrew and Koutentakis, Georgios and Kluibenschedl, Florian and Lemeshko, Mikhail and Fink, Johannes M and Schmiedmayer, Jörg and Redchenko, Elena}, booktitle = {Quantum 2.0 Conference and Exhibition}, isbn = {9781957171616}, location = {Glasgow, United Kingdom}, publisher = {Optica Publishing Group}, title = {{Detecting polar molecules with superconducting microwave resonators}}, year = {2026}, } @inproceedings{23056, abstract = {Superconducting qubits face scaling challenges due to millikelvin temperature requirements. Here we demonstrate the generation and low-noise upconversion of single microwave photons to telecom frequencies, paving the way for quantum networks with superconducting qubits.}, author = {Militaru, Andrei and Werner, Thomas and Riyazi, Erfan and Hawaldar, Samarth and Sahu, Rishabh and Arnold, Georg M and Falthansl-Scheinecker, Paul and Sanchez Naranjo, Jennifer Anais and Loi, Dante and Kapoor, Lucky and Zemlicka, Martin and Qiu, Liu and Fink, Johannes M}, booktitle = {Quantum 2.0 Conference and Exhibition}, isbn = {9781957171616}, location = {Glasgow, United Kingdom}, publisher = {Optica Publishing Group}, title = {{Electro-optic conversion of itinerant Fock states}}, year = {2026}, } @article{23089, abstract = {The location of the hydrogen-helium (H/He) immiscibility boundary controls whether and where helium rain occurs in giant planets, yet it remains uncertain because high-pressure experiments are challenging and ab initio simulations are limited in system size and simulation time. We map this boundary by computing composition-dependent chemical potentials from large-scale molecular dynamics driven by machine learning potentials trained on three density functional approximations (PBE, vdW-DF, and the hybrid HSE). Across the pressure range of 100-1000 GPa, the demixing temperatures are typically ~ 2000 K lower than previous ab initio simulations using small system sizes, and this discrepancy is larger than the estimated error from the chosen density functionals, machine learning potentials, neglect of nuclear quantum effects, and statistical uncertainties. Fitting the H/He mixing free energy to a Redlich-Kister regular solution model rationalizes the thermodynamic driving force for phase separation, and provides a predictive representation of the boundary. Comparing with current planetary interior profiles indicates that helium rain is plausible in Saturn but unlikely in the warmer interior of Jupiter. Our results narrow the uncertainty in the H/He immiscibility boundary and provide inputs for planetary models that couple demixing, heat transport, and composition gradients in gas giants.}, author = {Wang, Xiaoyu and Hamel, Sebastien and Cheng, Bingqing}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Hydrogen-helium immiscibility boundary in gas-giant planetary interiors from machine-learning molecular dynamics}}, doi = {10.1038/s41467-026-77117-8}, volume = {17}, year = {2026}, } @phdthesis{23072, abstract = {Inferring signal from large quantities of data is one of the most important problems in today’s world, with neural networks emerging as the most powerful solution. While there have been massive breakthroughs in the ML space, there are two main drawbacks. The first is that most of these models are “black boxes”, with very little understanding of why they work, which makes it hard to find the correct architecture for a given problem. The architecture is crucial, as the widely used training algorithms are “local” and thus rely on the loss landscape being benign enough to find a global optimum. This brings us to the second problem: while there is a lot of evidence that this can be overcome with large enough data, this is less clear for datasets which are noisy, do not have enough samples, or have a non-standard structure. Historically, on a smaller scale, the alternative has been simple (Bayesian) statistical methods, which also have the advantage of being interpretable and adaptable. However, many of the classical results cannot be easily extended to the high-dimensional regime in which modern data lives. In this work we want to consider two different settings relating to the above. The first is approximate message passing (AMP), an iterative algorithm for high-dimensional (generalized) linear models that easily lends itself to Bayesian setups, and which in many cases is provably Bayes-optimal. The second is an autoencoder with a shallow encoder, for which we can analyze the weights along the training trajectory of gradient descent. Surprisingly, we will find a connection between the two, as we recover certain structures of AMP. We will first introduce the AMP framework by studying an extension that can be applied to a wider variety of data: rotationally invariant generalized approximate message passing (RI-GAMP). This shows that one can extend the AMP framework to a much wider class of algorithms, relevant to more practical settings. The results are then also confirmed on real data that go beyond the theoretical setting. We then move to the setup of an autoencoder with a shallow encoder and a Bayesian prior in the high-dimensional regime, in which the input and compression dimensions are large and proportional; this is also a first step towards opening one of the black boxes above, as we can say precisely when and why the network works. While autoencoders are widely used in modern ML architectures, most fundamental research in this direction has focused on extreme asymptotic regimes, where the autoencoder is either severely over- or under-parameterized, and which do not extend to the proportional high-dimensional regime. We show that for Gaussian priors the network finds the global optimum, and these theoretical findings extrapolate strikingly well to real image data. Next we extend this analysis to more structured priors and a deeper decoder. For sparse Gaussian inputs in the training regime studied here, the shallow decoder does not exploit sparsity and yields the same dynamics as in the Gaussian setting. We then show how a deeper decoder can break this behavior, and interestingly, if we treat the problem as an AMP problem, the network eventually learns the same decoding as AMP. This too extrapolates to real image data. Lastly, we will show that the AMP setup has real practical use, by using a practical variant, genetic vector approximate message passing (gVAMP), for predicting plasma protein levels from genetic information using the UKB GWAS data. This is a perfect example of the problems in the high-dimensional regime: approximately 8.4 million dimensions and 40,000 samples, where the high noise, low sample count, and large size make it hard for ML methods to work. To get the optimal prediction accuracy we consider a two-step inference. We first consider a pre-processed version of the data, of about 880,000 dimensions, on which we run the gVAMP algorithm; this allows us to find predictive regions, taking into account joint effects between different regions, and for most proteins we end up selecting only about 0.1% of the dimensions. We then consider the analogue of this small subset, on which we can now run a standard tree algorithm (XGB) that no longer suffers from the aforementioned problems. This pipeline yields better prediction accuracy than recent nonlinear deep learning approaches applied to this data, as we are able to handle the pre-processing in a principled Bayesian way.}, author = {Kögler, Kevin}, issn = {2663-337X}, pages = {222}, publisher = {Institute of Science and Technology Austria}, title = {{Compression and inference in high dimensions: An approximate message passing perspective}}, doi = {10.15479/AT-ISTA-23072}, year = {2026}, } @article{23094, abstract = {The formation of C(sp2)–heteroatom bonds through cross-coupling catalysis is central to the synthesis of pharmaceuticals, agrochemicals and materials. Whereas Pd0/PdII catalysis requires substrate-specific ligand optimization to balance the competing demands of oxidative addition and reductive elimination, NiI/NiIII catalysis offers a complementary strategy because the bond-forming step is intrinsically favourable. However, contemporary NiI/NiIII methodologies suffer from insufficient oxidative addition reactivity, restricting the aryl halide scope and requiring high catalyst loadings. Here we show that mechanistically guided ligand design overcomes these limitations. Together with a non-nucleophilic base additive that promotes direct visible-light generation of NiI from a bench-stable NiII precatalyst, this ligand design enables the coupling of electron-rich aryl bromides with N-, O-, S- and P-based nucleophiles at nickel loadings as low as 100 ppm. The method is compatible with sterically encumbered nucleophiles and enables gram-scale synthesis and late-stage functionalization of complex molecules.}, author = {Bena, Aleksander and Banik, Trisha and Giannoudis, Christos and Ortis, Florian and Bím, Daniel and Baunis, Haralds and Palissery, Gayathri and Pieber, Bartholomäus}, issn = {2520-1158}, journal = {Nature Catalysis}, publisher = {Springer Nature}, title = {{Ligand design broadens NiI-catalysed C(sp2)–heteroatom couplings of aryl bromides at low catalyst loadings}}, doi = {10.1038/s41929-026-01616-6}, year = {2026}, } @article{23115, abstract = {We investigate the association between galaxies and neutral O I absorption systems at z ∼ 6, which trace metalenriched gas during the epoch of reionization. We identify 40 galaxies across six quasar fields, residing in 15 overdensities within 300 kpc of the background sight lines. Five O I absorption systems are associated with five of these overdensities, yielding a covering fraction of 0.27 0.10 +0.13 within 300 kpc. The absorption occurs beyond typical virial radii, indicating that the gas traces extended overdensity environments rather than individual galaxy halos, unlike the z ∼ 0 circumgalactic medium (CGM), which is largely bound to halos. These galaxy-associated absorbers account for ∼35% of all O I systems seen in blind quasar surveys, implying the remainder arise in lower-mass galaxies below our detection threshold or in dense neutral intergalactic medium pockets. The CGM around these galaxies contains ≳ 2 × 106 M⊙ of oxygen, comparable to the interstellar medium oxygen mass of the galaxies themselves, suggesting that the surrounding environment holds as much metal mass as the galaxies. All five galaxy-associated systems show significantly higher log NCII NOI ( / ) ratios than absorbers lacking galaxy associations. Furthermore, relative abundance ratios ([Si/O], [C/O]) reveal that four of the five exhibit enrichment patterns consistent with Population III nucleosynthesis at the outskirts of galaxy overdensities. These rare systems offer a unique window into the role of first-generation stars in shaping the early metal enrichment of galaxies and their environments.}, author = {Higginson, Jack and Bordoloi, Rongmon and Simcoe, Robert A. and Matthee, Jorryt J and Kashino, Daichi and Mackenzie, Ruari and Kramarenko, Ivan and Lilly, Simon J. and Eilers, Anna-Christina and Naidu, Rohan P. and Yue, Minghao}, issn = {1538-4357}, journal = {The Astrophysical Journal}, number = {1}, publisher = {IOP Publishing}, title = {{EIGER. VIII. First stars signatures in the connection between O I absorption and galaxies in the epoch of reionization}}, doi = {10.3847/1538-4357/ae3e81}, volume = {999}, year = {2026}, } @article{23123, abstract = {How many points can be placed in an 𝑛 × 𝑛 grid sothat every (affine) line contains at most 𝑘 points? Weprove that for 𝑛 ⩾ 𝑘 ⩾ 1037 the maximum number ofpoints is exactly 𝑘𝑛. Our proof builds on the recent workof Kovács, Nagy and Szabó (who proved an analogousresult when 𝑘 is at least about √𝑛 log 𝑛), incorporat-ing ideas of Jain and Pham. Using the same approach,we also obtain new bounds for higher-dimensionalextensions of this problem}, author = {Grebennikov, Aleksandr and Kwan, Matthew Alan}, issn = {1469-2120}, journal = {Bulletin of the London Mathematical Society}, number = {10}, publisher = {Wiley}, title = {{No‐(k+1)‐in‐line problem for large constant k}}, doi = {10.1112/blms.70510}, volume = {58}, year = {2026}, } @phdthesis{22984, author = {Teplova, Anastasiia}, isbn = {978-3-99078-093-0}, issn = {2663-337X }, pages = {190}, publisher = {Institute of Science and Technology Austria}, title = {{Chasing the elusive: Investigating nucleotide cyclase activity in gibberellin and strigolactone signalling; Cellular mechanisms of gravity sensing and response in roots}}, doi = {10.15479/AT-ISTA-22984}, year = {2026}, } @phdthesis{23079, abstract = {We study the computational aspects of the two central solution concepts of stochastic games played on finite graphs for an infinite number of steps: the value in two-player zero-sum games, and Nash equilibria in multi-player games. In both settings, exact solutions are in tractable. Fortwo-playerzero-sumconcurrentstochasticgames,valuescanbeirrational,and the associated decision problem is SQRT-SUM hard. For multi-player turn-based stochastic games,theequilibriumprobabilitiescanbeirrational,anddecidingtheconstrainedexistence of a Nash equilibrium is undecidable in the presence of memory, and ∃R-complete when the players are restricted to stationary strategies. Hence, in both settings, the natural computational problem is the approximation of the solution within an arbitrary additive error. In this thesis, we present improved complexity results and algorithms for such approximation problems. The first part of the thesis considers two-player zero-sum concurrent stochastic games with two classic objectives: (a) stateful-discounted objectives, which are similar to the classic discounted-sum objectives, but states are associated with different discount factors rather than a single discount factor; and (b) parity objectives, which are a canonical representation for ω-regular objectives. For stateful-discounted objectives, given an ordering of the discount factors, the limit value is the limit of the value of the stateful-discounted objectives, as the discount factors approach zero according to the given order. The value-approximation problem is known to be in EXPSPACE for the limit value of stateful-discounted objectives and in PSPACEforparityobjectives,andthebest-knownalgorithmsforbothproblemsareatleast exponential time, with an exponential dependence on the number of states and actions. Our main results for the value-approximation problem for the limit value of stateful-discounted objectives and parity objectives areas follows: (a)we establish TFNPNP complexity; and (b)we present algorithms that improve the dependency on the number of actions in the exponent from linear to logarithmic. In particular, if the number of states is constant, our algorithms run in polynomial time. The second part of the thesis considers multi-player turn-based stochastic games with terminal payoffs, where the players are restricted to stationary strategies. We study the approximate constrained existence problem of Nash equilibria: given a game that has a Nash equilibrium in which the payoff of every player lies in a given interval, compute a strategy profile that is an ε-Nash equilibrium and that satisfies the same constraints up to an additive error ε. Our main results are as follows: (a) we present an FNPNP algorithm for the problem; and(b)we establish that its decision version is NP-hard, already with two players. For the upperbound,weshowthatifaconstrainedNashequilibriumexists,thenthereexists one in which the non-zero probabilities are at least an inverse of a double-exponential in the i input size, and that such a strategy profile can be represented, up to an additive error ε, with floating-point numbers of polynomial size. We complement the upper bound with a lower bound on this approach: we present a game with only five players in which every constrained Nash equilibrium requires double-exponentially small probabilities. The two parts share a common technical toolkit: bounds on solutions of systems of polynomial inequalities that arise from real algebraic geometry, the floating-point representation of doubly-exponentially small numbers, and guess-and-verify procedures that resolve single-player games with an NP oracle.}, author = {Asadi, Ali}, issn = {2791-4585}, pages = {83}, publisher = {Institute of Science and Technology Austria}, title = {{Approximation of values and equilibria in stochastic games: Complexity and algorithms}}, doi = {10.15479/AT-ISTA-23079}, year = {2026}, } @phdthesis{22626, author = {Fiedler, Christine}, isbn = {978-3-99078-086-2}, issn = {2663-337X}, pages = {141}, publisher = {Institute of Science and Technology Austria}, title = {{Mechanistic insight into solution-processed p-type tin chalcogenides as a basis for designing their n-type analogs}}, doi = {10.15479/AT-ISTA-22626}, year = {2026}, } @phdthesis{22017, author = {Kleinhanns, Tobias}, isbn = {978-3-99078-081-7}, issn = {2663-337X}, pages = {59}, publisher = {Institute of Science and Technology Austria}, title = {{Unraveling the origin and evolution of defects to enable advanced thermoelectric performance}}, doi = {10.15479/AT-ISTA-22017}, year = {2026}, }