--- OA_place: publisher _id: '22255' abstract: - lang: eng text: "This thesis studies spectral rigidity and nonrigidity phenomena in dynamical systems. The central question is whether a dynamical system can be determined, up to a natural conjugacy, from its spectrum. We consider three related spectra: the length spectrum, the action spectrum, and the Lyapunov spectrum.\r\n\r\nThe first part of the thesis concerns Liouville metrics on the two-dimensional torus. It is a long-standing folklore conjecture that Liouville metrics are the only integrable metrics on the torus. We prove a length-spectral rigidity result for linear conformal deformations of Liouville metrics by exploiting the dynamical properties of the rational tori -- analogues of the resonant convex caustics in billiards. We also establish a complementary classification result showing that marked-length-isospectral Liouville metrics are characterized by rearrangements of the one-dimensional functions appearing in their conformal factors, generalizing a theorem of Abbondandolo-Mazzucchelli. In particular, the second result gives nonrigidity examples within the class of Liouville metrics.\r\n\r\nThe second part of the thesis studies the standard map from the viewpoint of action and Lyapunov spectra. We construct nontrivial deformations of the standard map which preserve the symplectic actions (respectively, the Lyapunov exponents) of infinitely many periodic orbits accumulating on an invariant curve. The proof combines a resonant normal form construction with Picard iteration schemes to obtain a sequence of periodic orbits accumulating on an invariant curve with a Liouville rotation number. Within the resonant normal forms we capture the dependence of these periodic orbits on the resonant Fourier coefficients of the dynamics on the invariant curve and, using the contraction mapping principle, obtain a suitable deformation achieving the prescribed spectral data associated with this sequence of orbits. The result can be viewed as a symplectic twist-map analogue of a length-spectral nonrigidity phenomenon for Riemannian manifolds and convex billiards, and it motivates the existence problem for similar 'partially length-isospectral' deformations of strictly convex billiard tables.\r\n" acknowledged_ssus: - _id: E-Lib - _id: CampIT acknowledgement: "The financial support of the ERC grant SPERIG #885707 is gratefully acknowledged.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Yunzhe full_name: Li, Yunzhe id: 41cb05d3-f128-11eb-9611-e4e2b3cfba31 last_name: Li citation: ama: Li Y. Spectral rigidity and nonrigidity of dynamical systems. 2026. doi:10.15479/AT-ISTA-22255 apa: Li, Y. (2026). Spectral rigidity and nonrigidity of dynamical systems. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22255 chicago: Li, Yunzhe. “Spectral Rigidity and Nonrigidity of Dynamical Systems.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22255. ieee: Y. Li, “Spectral rigidity and nonrigidity of dynamical systems,” Institute of Science and Technology Austria, 2026. ista: Li Y. 2026. Spectral rigidity and nonrigidity of dynamical systems. Institute of Science and Technology Austria. mla: Li, Yunzhe. Spectral Rigidity and Nonrigidity of Dynamical Systems. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22255. short: Y. Li, Spectral Rigidity and Nonrigidity of Dynamical Systems, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-07-08T12:44:31Z date_published: 2026-07-11T00:00:00Z date_updated: 2026-07-20T14:58:23Z day: '11' ddc: - '515' degree_awarded: PhD department: - _id: GradSch - _id: VaKa doi: 10.15479/AT-ISTA-22255 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: 8201cb5a427656a41828ecde8a85c04b content_type: application/pdf creator: yli date_created: 2026-07-14T10:48:45Z date_updated: 2026-07-14T10:48:45Z file_id: '22337' file_name: 2026_Li_Yunzhe_Thesis.pdf file_size: 1260717 relation: main_file - access_level: closed checksum: 19ee8461ed77f5b7980fc9461f778b6f content_type: application/x-zip-compressed creator: yli date_created: 2026-07-14T11:07:18Z date_updated: 2026-07-20T14:00:33Z file_id: '22339' file_name: 2026_Li_Yunzhe_Thesis.zip file_size: 418752 relation: source_file file_date_updated: 2026-07-20T14:00:33Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '131' project: - _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A call_identifier: H2020 grant_number: '885707' name: Spectral rigidity and integrability for billiards and geodesic flows publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '22340' relation: part_of_dissertation status: public - id: '22341' relation: part_of_dissertation status: public status: public supervisor: - first_name: Vadim full_name: Kaloshin, Vadim id: FE553552-CDE8-11E9-B324-C0EBE5697425 last_name: Kaloshin orcid: 0000-0002-6051-2628 title: Spectral rigidity and nonrigidity of dynamical systems tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher OA_type: hybrid _id: '22370' abstract: - lang: eng text: We report a unified method for the synthesis of α-polyhalomethyl amines from alkenes and alkynes, enabled by readily available hemiaminal reagents. This operationally simple transformation allows for the introduction of not only well-established CF3 and CF2H groups, but also the synthetically (and medicinally) underexplored CF2Cl and CFClH motifs—thereby broadening access to previously inaccessible chemical space of halogenated amine scaffolds. The method displays broad substrate scope and functional-group tolerance while operating under mild conditions. Late-stage functionalization of drug-like derivatives of Oxaprozin, Erlotinib, and Ibuprofen (among others) is reported. acknowledgement: "Funded by the European Union (ERC, C-HANCE, 101142915 to N.M.). Views and opinions expressed are, however, those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. This research was funded in full or in part by the Austrian Science Fund (FWF, 10.55776/P37182 to N.M.). The technical staff of the NMR Centre of the Faculty of Chemistry (University of Vienna) are acknowledged for crucial NMR measurements and expert advice with spectral analysis. The authors thank the Core Facility Crystal Structure Analysis (U. Vienna) for determination of the crystal structures. The authors are also grateful to the University of Vienna for its continued support of our research programs.\r\n\r\nOpen Access funding provided by Universität Wien." article_number: e1233707 article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Angela K. full_name: Hofmeister, Angela K. last_name: Hofmeister - first_name: Giulia full_name: Iannelli, Giulia last_name: Iannelli - first_name: Péter full_name: Angyal, Péter last_name: Angyal - first_name: Augustin full_name: Malandain, Augustin last_name: Malandain - first_name: Daniel full_name: Kaiser, Daniel last_name: Kaiser - first_name: Boris full_name: Maryasin, Boris last_name: Maryasin - first_name: Hanspeter full_name: Kählig, Hanspeter last_name: Kählig - first_name: Matteo full_name: Barel, Matteo id: 8959927b-2236-11ed-bd6e-ea83d94ade0e last_name: Barel - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 - first_name: Nuno full_name: Maulide, Nuno last_name: Maulide citation: ama: Hofmeister AK, Iannelli G, Angyal P, et al. Unified synthesis of unconventional α-polyhalogenated amines through hydroaminoalkylation. Angewandte Chemie International Edition. 2026. doi:10.1002/anie.1233707 apa: Hofmeister, A. K., Iannelli, G., Angyal, P., Malandain, A., Kaiser, D., Maryasin, B., … Maulide, N. (2026). Unified synthesis of unconventional α-polyhalogenated amines through hydroaminoalkylation. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.1233707 chicago: Hofmeister, Angela K., Giulia Iannelli, Péter Angyal, Augustin Malandain, Daniel Kaiser, Boris Maryasin, Hanspeter Kählig, Matteo Barel, Gaia Novarino, and Nuno Maulide. “Unified Synthesis of Unconventional α-Polyhalogenated Amines through Hydroaminoalkylation.” Angewandte Chemie International Edition. Wiley, 2026. https://doi.org/10.1002/anie.1233707. ieee: A. K. Hofmeister et al., “Unified synthesis of unconventional α-polyhalogenated amines through hydroaminoalkylation,” Angewandte Chemie International Edition. Wiley, 2026. ista: Hofmeister AK, Iannelli G, Angyal P, Malandain A, Kaiser D, Maryasin B, Kählig H, Barel M, Novarino G, Maulide N. 2026. Unified synthesis of unconventional α-polyhalogenated amines through hydroaminoalkylation. Angewandte Chemie International Edition., e1233707. mla: Hofmeister, Angela K., et al. “Unified Synthesis of Unconventional α-Polyhalogenated Amines through Hydroaminoalkylation.” Angewandte Chemie International Edition, e1233707, Wiley, 2026, doi:10.1002/anie.1233707. short: A.K. Hofmeister, G. Iannelli, P. Angyal, A. Malandain, D. Kaiser, B. Maryasin, H. Kählig, M. Barel, G. Novarino, N. Maulide, Angewandte Chemie International Edition (2026). das_tickbox: '1' dataavailabilitystatement: The data that supports the findings of this study are available in the supplementary material of this article. date_created: 2026-07-19T22:01:48Z date_published: 2026-07-10T00:00:00Z date_updated: 2026-07-21T07:19:26Z day: '10' ddc: - '570' - '540' department: - _id: GaNo - _id: GradSch doi: 10.1002/anie.1233707 external_id: pmid: - '42429166' has_accepted_license: '1' language: - iso: eng month: '07' oa_version: Published Version pmid: 1 publication: Angewandte Chemie International Edition publication_identifier: eissn: - 1521-3773 issn: - 1433-7851 publication_status: epub_ahead publisher: Wiley quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: yes title: Unified synthesis of unconventional α-polyhalogenated amines through hydroaminoalkylation tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '22323' abstract: - lang: eng text: Arrays of Josephson junctions can be tuned through anomalous metallic, quantum-critical, and insulating regimes. We introduce an alternative experimental probe, capturing microwave radiation across all three regimes, using a two-dimensional array of superconductor-semiconductor hybrid Josephson junctions as a model system. Our approach allows calibration of the sample’s circuit parameters and provides isolation from measurement back-action effects. We measure the radiation temperature of the anomalous metal and find that it is hotter than both the quantum-critical and insulating regimes. We further show that the anomalous metallic regime is more susceptible to additional heating than other regimes, explaining its emergence in otherwise thermalized systems. Turning to the quantum-critical regime, we discover nonlinear scaling of radiative noise with applied bias, consistent with theoretical predictions of universal nonequilibrium behavior at quantum-critical points. acknowledged_ssus: - _id: M-Shop - _id: NanoFab acknowledgement: "We gratefully acknowledge feedback on the preprint\r\nfrom Charles Marcus, Vadim Khrapai, Joel Moore,\r\nAndrew Green, Shivaji Sondhi, Rufus Boyack, and\r\nLuca Delacr´etaz. This work was primarily supported by\r\nthe NOMIS foundation. This work was partially supported\r\nby the University of Chicago Materials Research Science\r\nand Engineering Center, which is funded by the National\r\nScience Foundation under Award No. DMR-2011854, and\r\nby the SFB Q-M&S funded by the Austrian Science Fund\r\n(FWF). We acknowledge technical support from the\r\nNanofabrication Facility and the MIBA machine shop at\r\nIST Austria." article_number: '014031' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Kristen W full_name: Galvin, Kristen W id: 41737c86-5355-11ee-ae5a-d2146bfd0877 last_name: Galvin - first_name: Anton full_name: Bubis, Anton id: 1f6212b5-f795-11ec-9c0c-de4780302890 last_name: Bubis - first_name: Melissa full_name: Mikalsen, Melissa last_name: Mikalsen - first_name: William F. full_name: Schiela, William F. last_name: Schiela - first_name: Bassel H. full_name: Elfeky, Bassel H. last_name: Elfeky - first_name: William M. full_name: Strickland, William M. last_name: Strickland - first_name: Duc T full_name: Phan, Duc T id: 29C8C0B4-F248-11E8-B48F-1D18A9856A87 last_name: Phan - first_name: Javad full_name: Shabani, Javad last_name: Shabani - first_name: Andrew P full_name: Higginbotham, Andrew P id: 4AD6785A-F248-11E8-B48F-1D18A9856A87 last_name: Higginbotham orcid: 0000-0003-2607-2363 citation: ama: Léonard KW, Bubis A, Mikalsen M, et al. Microwave radiometry of a quantum-critical hybrid Josephson array. Physical Review Applied. 2026;26. doi:10.1103/75bl-mm3b apa: Léonard, K. W., Bubis, A., Mikalsen, M., Schiela, W. F., Elfeky, B. H., Strickland, W. M., … Higginbotham, A. P. (2026). Microwave radiometry of a quantum-critical hybrid Josephson array. Physical Review Applied. American Physical Society. https://doi.org/10.1103/75bl-mm3b chicago: Léonard, Kristen Williams, Anton Bubis, Melissa Mikalsen, William F. Schiela, Bassel H. Elfeky, William M. Strickland, Duc T Phan, Javad Shabani, and Andrew P Higginbotham. “Microwave Radiometry of a Quantum-Critical Hybrid Josephson Array.” Physical Review Applied. American Physical Society, 2026. https://doi.org/10.1103/75bl-mm3b. ieee: K. W. Léonard et al., “Microwave radiometry of a quantum-critical hybrid Josephson array,” Physical Review Applied, vol. 26. American Physical Society, 2026. ista: Léonard KW, Bubis A, Mikalsen M, Schiela WF, Elfeky BH, Strickland WM, Phan DT, Shabani J, Higginbotham AP. 2026. Microwave radiometry of a quantum-critical hybrid Josephson array. Physical Review Applied. 26, 014031. mla: Léonard, Kristen Williams, et al. “Microwave Radiometry of a Quantum-Critical Hybrid Josephson Array.” Physical Review Applied, vol. 26, 014031, American Physical Society, 2026, doi:10.1103/75bl-mm3b. short: K.W. Léonard, A. Bubis, M. Mikalsen, W.F. Schiela, B.H. Elfeky, W.M. Strickland, D.T. Phan, J. Shabani, A.P. Higginbotham, Physical Review Applied 26 (2026). corr_author: '1' dataavailabilitystatement: "The data that support the findings of this article are openly available under 10.5281/zenodo\r\n.19615009. " date_created: 2026-07-14T05:35:24Z date_published: 2026-07-10T00:00:00Z date_updated: 2026-07-21T12:01:49Z day: '10' ddc: - '530' department: - _id: GradSch - _id: AnHi - _id: GeKa doi: 10.1103/75bl-mm3b external_id: arxiv: - '2409.09835' file: - access_level: open_access checksum: d872ca35d9d2c7821642fda520be2c15 content_type: application/pdf creator: dernst date_created: 2026-07-16T09:39:37Z date_updated: 2026-07-16T09:39:37Z file_id: '22350' file_name: 2026_PhysicalReviewApplied_Leonard.pdf file_size: 2750867 relation: main_file success: 1 file_date_updated: 2026-07-16T09:39:37Z has_accepted_license: '1' intvolume: ' 26' language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: 34a66131-11ca-11ed-8bc3-a31681c6b03e grant_number: F8606 name: 'Center for Correlated Quantum Materials and Solid State Quantum Systems: Conventional and unconventional topological superconductors' publication: Physical Review Applied publication_identifier: issn: - 2331-7019 publication_status: published publisher: American Physical Society quality_controlled: '1' researchdata_availability: yes scopus_import: '1' status: public supplementarymaterial: no title: Microwave radiometry of a quantum-critical hybrid Josephson array tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 26 year: '2026' ... --- OA_place: publisher _id: '21198' abstract: - lang: eng text: "In recent years there has been a massive increase in the amount of data generated in a\r\ndecentralized manner. Ever more powerful edge devices, such as smartphones, have become\r\nubiquitous in most societies on earth. Through text typed, photos taken and apps used,\r\nthese devices, which we refer to as clients, generate enormous amounts of high quality and\r\ncomplex data. Moreover, the nature of these devices means the data they generate is often\r\nsensitive and privacy concerns prevent it being gathered and stored in a central location. This\r\npresents a challenge to the modern machine learning paradigm that requires central access\r\nto large amounts of data. Federated learning (FL) has emerged as one of the answers to\r\nthis problem. Rather than bringing the data to the model, FL sends the model to the data.\r\nModel training takes place on device, with periodically synchronized updates, allowing data to\r\nremain locally stored. While this approach offers significant privacy advantages it comes with\r\nits own set of unique challenges. These include: data heterogeneity, the notion that different\r\ndevices generate data in distinct ways which can negatively impact training dynamics; systems\r\nheterogeneity, meaning that different devices may have differing hardware specifications; high\r\ncommunication costs, which are induced by the repeated transferring of models over the\r\nnetwork and low device computational power, which limits the use of larger models on device.\r\nIn this thesis we present a range of methods for federated learning. We focus primarily on\r\nthe challenge of data heterogeneity, though the methods presented are designed to be well\r\nadapted to the other challenges of a federated setting, such as the constraints of limited\r\ncompute and communication overhead. We first present a method for explicitly modeling client\r\ndata heterogeneity. The approach formulates clients as samples from a certain probability\r\ndistribution and infers the parameters of this distribution from the available training clients.\r\nThis learned distribution then represents the heterogeneity present among the clients and can\r\nbe sampled from in order to create new simulated clients that are similar to the real clients we\r\nhave observed so far. Following this we present two methods for directly dealing with data\r\nheterogeneity through personalization. Highly heterogeneous client data distributions can mean\r\nthat learning a single global model becomes suboptimal, and some form of personalization of\r\nmodels to each individual client is required. Our approaches are based around hypernetworks,\r\nwhich we use to generate personalized model parameters without the need for additional\r\ntraining or finetuning. In the first approach we focus on generating full parameterizations of\r\nclient models using learned embeddings of client data and labels, with a hypernetwork located\r\non the central server. In the second approach we address the more challenging scenario where\r\nwe want to generate a personalized model for a client without any label information. The\r\nhypernetwork is trained to generate a low dimensional representation of a client’s personalized\r\nmodel parameters, allowing it to be transferred to and run on the client devices. In our final\r\npresented method, we change our focus and rather than aim to directly address the challenge\r\nof data heterogeneity, we instead ensure we are unaffected by it. This is done in the context\r\nof k-means clustering and we present a method for federated clustering with a focus on added\r\nprivacy guarantees." acknowledged_ssus: - _id: ScienComp acknowledgement: "This research was funded in part by the Austrian Science Fund (FWF)\r\n[10.55776/COE12]. Furthermore, the candidate acknowledges the support from the Scientific\r\nService Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp)." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Jonathan A full_name: Scott, Jonathan A id: e499926b-f6e0-11ea-865d-9c63db0031e8 last_name: Scott citation: ama: Scott JA. Data heterogeneity and personalization in federated learning. 2026. doi:10.15479/AT-ISTA-21198 apa: Scott, J. A. (2026). Data heterogeneity and personalization in federated learning. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21198 chicago: Scott, Jonathan A. “Data Heterogeneity and Personalization in Federated Learning.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21198. ieee: J. A. Scott, “Data heterogeneity and personalization in federated learning,” Institute of Science and Technology Austria, 2026. ista: Scott JA. 2026. Data heterogeneity and personalization in federated learning. Institute of Science and Technology Austria. mla: Scott, Jonathan A. Data Heterogeneity and Personalization in Federated Learning. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21198. short: J.A. Scott, Data Heterogeneity and Personalization in Federated Learning, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-02-09T14:59:53Z date_published: 2026-02-09T00:00:00Z date_updated: 2026-07-22T06:34:27Z day: '09' ddc: - '005' degree_awarded: PhD department: - _id: GradSch - _id: ChLa doi: 10.15479/AT-ISTA-21198 file: - access_level: closed checksum: 121c1d968bd86f3630aa7e81d5bbbcb0 content_type: application/zip creator: jscott date_created: 2026-02-17T11:46:22Z date_updated: 2026-02-17T11:46:22Z file_id: '21298' file_name: 2026_Scott_Jonathan_Thesis_Source.zip file_size: 272379252 relation: source_file - access_level: open_access checksum: 6e3e08ba474bbee8511cc8a839ab2077 content_type: application/pdf creator: jscott date_created: 2026-02-27T10:25:41Z date_updated: 2026-02-27T10:25:41Z file_id: '21366' file_name: 2026_Jonathan_Scott_Thesis.pdf file_size: 15220298 relation: main_file success: 1 file_date_updated: 2026-02-27T10:25:41Z has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '158' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '20819' relation: part_of_dissertation status: public - id: '17411' relation: part_of_dissertation status: public - id: '18120' relation: part_of_dissertation status: public - id: '21207' relation: part_of_dissertation status: public status: public supervisor: - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 title: Data heterogeneity and personalization in federated learning type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2026' ... --- OA_place: publisher _id: '21021' abstract: - lang: eng text: This thesis examines how geometry and topology intersect in the representation, transformation, and analysis of complex shapes. It considers how continuous manifolds relate to their discrete analogues, how topological structures evolve in persistence vineyards, and how tools from topological data analysis can illuminate problems in mathematical physics. Central to this exploration is the question of how structure, both geometric and topological, persists or changes under approximation, sampling, or deformation. The work develops new approaches to skeletal and grid-based representations of surfaces, reveals the full expressive capacity of persistence vineyards, and applies topological methods to the longstanding problem of equilibria in electrostatic fields. These threads braid together into a broader understanding of how topology and geometry inform one another across theory, computation, and application. acknowledged_ssus: - _id: M-Shop - _id: ScienComp acknowledgement: "The research presented in this thesis was funded by the DFG Collaborative Research\r\nCenter TRR 109, ‘Discretization in Geometry and Dynamics’.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Christopher D full_name: Fillmore, Christopher D id: 35638A5C-AAC7-11E9-B0BF-5503E6697425 last_name: Fillmore citation: ama: Fillmore CD. Braiding geometry and topology to study shapes and data. 2026. doi:10.15479/AT-ISTA-21021 apa: Fillmore, C. D. (2026). Braiding geometry and topology to study shapes and data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21021 chicago: Fillmore, Christopher D. “Braiding Geometry and Topology to Study Shapes and Data.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21021. ieee: C. D. Fillmore, “Braiding geometry and topology to study shapes and data,” Institute of Science and Technology Austria, 2026. ista: Fillmore CD. 2026. Braiding geometry and topology to study shapes and data. Institute of Science and Technology Austria. mla: Fillmore, Christopher D. Braiding Geometry and Topology to Study Shapes and Data. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21021. short: C.D. Fillmore, Braiding Geometry and Topology to Study Shapes and Data, Institute of Science and Technology Austria, 2026. corr_author: '1' date_created: 2026-01-20T21:38:40Z date_published: 2026-01-21T00:00:00Z date_updated: 2026-07-22T06:33:54Z day: '21' ddc: - '514' - '516' degree_awarded: PhD department: - _id: GradSch - _id: HeEd - _id: UlWa doi: 10.15479/AT-ISTA-21021 file: - access_level: open_access checksum: 4c0889130095c31d4e5088c5b8dfd607 content_type: application/pdf creator: cfillmor date_created: 2026-01-26T19:44:46Z date_updated: 2026-01-30T11:40:09Z file_id: '21046' file_name: 2025_Fillmore_Christopher_Thesis.pdf file_size: 55954297 relation: main_file - access_level: closed checksum: d69afb71d82ab98f856886126ee7303a content_type: application/x-zip-compressed creator: cfillmor date_created: 2026-01-26T19:46:20Z date_updated: 2026-01-26T19:46:20Z file_id: '21047' file_name: Thesis.zip file_size: 166080788 relation: source_file file_date_updated: 2026-01-30T11:40:09Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: '122' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '20260' relation: part_of_dissertation status: public - id: '21051' relation: part_of_dissertation status: public - id: '21050' relation: part_of_dissertation status: public status: public supervisor: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 title: Braiding geometry and topology to study shapes and data tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2026' ... --- OA_place: publisher OA_type: gold _id: '22327' abstract: - lang: eng text: "Population protocols are a model of distributed computing where\r\n\U0001D45B agents, each a simple finite-state machine, interact in pairs to\r\nsolve a common task against a (adversarial) interaction scheduler.\r\nThis model was intensively studied in recent years; in particular,\r\nthe problem of relative majority received much attention: Each\r\nagent starts with an input opinion (or color) out of \U0001D458 possibilities,\r\nand the goal is for each agent to eventually output the color with\r\nthe largest support in the population. Before our work, the state\r\ncomplexity (the minimum number of states required per agent) was\r\nonly known to be between Ω(\U0001D458\r\n2\r\n) and\U0001D442(\U0001D458\r\n7\r\n). Our main contribution\r\nis a population protocol that solves the relative majority problem\r\nwith \U0001D458\r\n3\r\nstates. We achieve this result with a new protocol called\r\nCircles. While prior approaches in the literature relied on duels of\r\nagents to find the majority color — an approach that proved effective\r\nfor the case with two colors — Circles partitions the agents into\r\ncircular linked lists of decreasing sizes, with the property that no\r\ntwo agents with the same initial color lie in the same circle. We\r\nshow that Circles always correctly computes the desired structure\r\nagainst the most adversarial of schedulers (weakly fair). We then\r\nshow that a trivial extension of Circles solves the relative majority\r\nproblem. We extend our protocol to handle various tie-breaking\r\nmechanisms or to support the case where the agents do not share a\r\nprior ordering of the colors. Finally, we show that a modification of\r\nCircles solves the ranking problem with 2 · \U0001D458^4\r\nstates, where each\r\nagent must output the rank of its initial color in the population." acknowledgement: "Funded by the European union. Views and opinions expressed are\r\nhowever those of the author(s) only and do not necessarily reflect\r\nthose of the European Union or the European Research Council\r\nExecutive Agency. Neither the European Union nor the granting authority can be held responsible for them. This project has received\r\nfunding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme\r\n(MoDynStruct, No. 101019564) and the Austrian Science\r\nFund (FWF) grant DOI 10.55776/I5982. For open access purposes,\r\nthe author has applied a CC BY public copyright license to any\r\nauthor-accepted manuscript version arising from this submission." article_processing_charge: Yes arxiv: 1 author: - first_name: Tom-Lukas full_name: Breitkopf, Tom-Lukas last_name: Breitkopf - first_name: Julien full_name: Dallot, Julien last_name: Dallot - first_name: Antoine full_name: El-Hayek, Antoine id: 888a098e-fcac-11ee-aff7-d347be57b725 last_name: El-Hayek orcid: 0000-0003-4268-7368 - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. Ranking opinions with few states in population protocols. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2026:414-424. doi:10.1145/3796701.3815913' apa: 'Breitkopf, T.-L., Dallot, J., El-Hayek, A., & Schmid, S. (2026). Ranking opinions with few states in population protocols. In Proceedings of the ACM Symposium on Principles of Distributed Computing (pp. 414–424). Egham, United Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3796701.3815913' chicago: Breitkopf, Tom-Lukas, Julien Dallot, Antoine El-Hayek, and Stefan Schmid. “Ranking Opinions with Few States in Population Protocols.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, 414–24. Association for Computing Machinery, 2026. https://doi.org/10.1145/3796701.3815913. ieee: T.-L. Breitkopf, J. Dallot, A. El-Hayek, and S. Schmid, “Ranking opinions with few states in population protocols,” in Proceedings of the ACM Symposium on Principles of Distributed Computing, Egham, United Kingdom, 2026, pp. 414–424. ista: 'Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. 2026. Ranking opinions with few states in population protocols. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 414–424.' mla: Breitkopf, Tom-Lukas, et al. “Ranking Opinions with Few States in Population Protocols.” Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2026, pp. 414–24, doi:10.1145/3796701.3815913. short: T.-L. Breitkopf, J. Dallot, A. El-Hayek, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2026, pp. 414–424. conference: end_date: 2026-07-10 location: Egham, United Kingdom name: 'PODC: Symposium on Principles of Distributed Computing' start_date: 2026-07-06 corr_author: '1' das_tickbox: '0' date_created: 2026-07-14T05:40:17Z date_published: 2026-07-01T00:00:00Z date_updated: 2026-07-22T07:49:22Z day: '01' ddc: - '000' department: - _id: MoHe - _id: GradSch doi: 10.1145/3796701.3815913 ec_funded: 1 external_id: arxiv: - '2605.18707' file: - access_level: open_access checksum: e56da70c1b2e7e663d2d8106cf07a30a content_type: application/pdf creator: dernst date_created: 2026-07-16T11:18:44Z date_updated: 2026-07-16T11:18:44Z file_id: '22353' file_name: 2026_ACMPODC_Breitkopf.pdf file_size: 702140 relation: main_file success: 1 file_date_updated: 2026-07-16T11:18:44Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 414 - 424 project: - _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62 call_identifier: H2020 grant_number: '101019564' name: The design and evaluation of modern fully dynamic data structures - _id: bda196b2-d553-11ed-ba76-8e8ee6c21103 grant_number: I05982 name: Static and Dynamic Hierarchical Graph Decompositions publication: Proceedings of the ACM Symposium on Principles of Distributed Computing publication_identifier: isbn: - '9798400725128' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: Ranking opinions with few states in population protocols tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '14703' abstract: - lang: eng text: 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. acknowledgement: 'The authors would like to thank Chris Wojtan for his continuous support and several interesting discussions. Part of this research was performed during two visits: one of SI to the BIDSA research center at Bocconi University, and one of HL to the Institute of Science and Technology Austria. Both host institutions are warmly acknowledged for the hospitality. HL is partially supported by the MUR-Prin 2022-202244A7YL “Gradient Flows and Non-Smooth Geometric Structures with Applications to Optimization and Machine Learning”, funded by the European Union - Next Generation EU. SI is supported in part by ERC Consolidator Grant 101045083 “CoDiNA” funded by the European Research Council. Open access funding provided by Institute of Science and Technology (IST Austria).' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Sadashige full_name: Ishida, Sadashige id: 6F7C4B96-A8E9-11E9-A7CA-09ECE5697425 last_name: Ishida orcid: 0000-0002-3121-3100 - first_name: Hugo full_name: Lavenant, Hugo last_name: Lavenant citation: ama: Ishida S, Lavenant H. Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation. Foundations of Computational Mathematics. 2026;26:349-384. doi:10.1007/s10208-024-09686-3 apa: Ishida, S., & Lavenant, H. (2026). Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation. Foundations of Computational Mathematics. Springer Nature. https://doi.org/10.1007/s10208-024-09686-3 chicago: Ishida, Sadashige, and Hugo Lavenant. “Quantitative Convergence of a Discretization of Dynamic Optimal Transport Using the Dual Formulation.” Foundations of Computational Mathematics. Springer Nature, 2026. https://doi.org/10.1007/s10208-024-09686-3. ieee: S. Ishida and H. Lavenant, “Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation,” Foundations of Computational Mathematics, vol. 26. Springer Nature, pp. 349–384, 2026. ista: Ishida S, Lavenant H. 2026. Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation. Foundations of Computational Mathematics. 26, 349–384. mla: Ishida, Sadashige, and Hugo Lavenant. “Quantitative Convergence of a Discretization of Dynamic Optimal Transport Using the Dual Formulation.” Foundations of Computational Mathematics, vol. 26, Springer Nature, 2026, pp. 349–84, doi:10.1007/s10208-024-09686-3. short: S. Ishida, H. Lavenant, Foundations of Computational Mathematics 26 (2026) 349–384. corr_author: '1' das_tickbox: '0' date_created: 2023-12-21T10:14:37Z date_published: 2026-02-01T00:00:00Z date_updated: 2026-07-23T05:39:38Z day: '01' ddc: - '000' department: - _id: GradSch - _id: ChWo doi: 10.1007/s10208-024-09686-3 external_id: arxiv: - '2312.12213' isi: - '001352503300001' file: - access_level: open_access checksum: 30671f88e792e8b75ae3e698ac4c131c content_type: application/pdf creator: dernst date_created: 2026-07-23T05:37:52Z date_updated: 2026-07-23T05:37:52Z file_id: '22384' file_name: 2026_FoundCompMath_Ishida.pdf file_size: 1240012 relation: main_file success: 1 file_date_updated: 2026-07-23T05:37:52Z has_accepted_license: '1' intvolume: ' 26' isi: 1 keyword: - Optimal transport - Hamilton-Jacobi equation - convex optimization language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 349-384 project: - _id: 34bc2376-11ca-11ed-8bc3-9a3b3961a088 grant_number: '101045083' name: Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena publication: Foundations of Computational Mathematics publication_identifier: eissn: - 1615-3383 issn: - 1615-3375 publication_status: published publisher: Springer Nature quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 26 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '14278' abstract: - lang: eng text: 'The Birkhoff conjecture says that the boundary of a strictly convex integrable billiard table is necessarily an ellipse. In this article, we consider a stronger notion of integrability, namely, integrability close to the boundary, and prove a local version of this conjecture: a small perturbation of almost every ellipse that preserves integrability near the boundary, is itself an ellipse. We apply this result to study local spectral uniqueness of ellipses using the connection between the wave trace of the Laplacian and the dynamics near the boundary and establish local uniqueness for almost all of them.' acknowledgement: 'The author acknowledges the partial support of the European Research Council Grant #885707. He also thanks Vadim Kaloshin for proposing the idea of the project and greatly aiding the implementation. The author is also grateful to Hamid Hezari, Amir Vig, Steve Zelditch, Comlan E. Koudjinan, Corentin Fierobe, Ngo Nhok Tkhai Shon and Roman Sarapin for useful discussions. The author also acknowledges partial support of ISTern summer program. The project started in the summer of 2021, when the author was an intern at ISTA. Open access funding provided by Institute of Science and Technology (IST Austria).' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Illya full_name: Koval, Illya id: 2eed1f3b-896a-11ed-bdf8-93c7c4bf159e last_name: Koval citation: ama: Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. Inventiones Mathematicae. 2026;244:221-298. doi:10.1007/s00222-025-01397-y apa: Koval, I. (2026). Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. Inventiones Mathematicae. Springer Nature. https://doi.org/10.1007/s00222-025-01397-y chicago: Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” Inventiones Mathematicae. Springer Nature, 2026. https://doi.org/10.1007/s00222-025-01397-y. ieee: I. Koval, “Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse,” Inventiones Mathematicae, vol. 244. Springer Nature, pp. 221–298, 2026. ista: Koval I. 2026. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. Inventiones Mathematicae. 244, 221–298. mla: Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” Inventiones Mathematicae, vol. 244, Springer Nature, 2026, pp. 221–98, doi:10.1007/s00222-025-01397-y. short: I. Koval, Inventiones Mathematicae 244 (2026) 221–298. corr_author: '1' das_tickbox: '0' date_created: 2023-09-06T08:35:43Z date_published: 2026-04-01T00:00:00Z date_updated: 2026-07-23T10:58:59Z day: '01' ddc: - '510' department: - _id: GradSch - _id: VaKa doi: 10.1007/s00222-025-01397-y ec_funded: 1 external_id: arxiv: - '2111.12171' file: - access_level: open_access checksum: 487fa9113e1bbf32a6c70e6d1e8f63bc content_type: application/pdf creator: dernst date_created: 2026-07-23T10:55:24Z date_updated: 2026-07-23T10:55:24Z file_id: '22394' file_name: 2026_InventionesMath_Koval.pdf file_size: 2256345 relation: main_file success: 1 file_date_updated: 2026-07-23T10:55:24Z has_accepted_license: '1' intvolume: ' 244' language: - iso: eng mathsc: - 37C83 - 35J05 - 37J70 - 74J25 month: '04' oa: 1 oa_version: Published Version page: 221-298 project: - _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A call_identifier: H2020 grant_number: '885707' name: Spectral rigidity and integrability for billiards and geodesic flows publication: Inventiones Mathematicae publication_identifier: eissn: - 1432-1297 issn: - 0020-9910 publication_status: published publisher: Springer Nature quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: yes title: Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 244 year: '2026' ... --- OA_place: publisher _id: '22281' abstract: - lang: eng text: "In this thesis, we took a look at networks, and more specifically, at networks that change over time, whether those are networks in the distributed algorithms sense of the word, or the graph algorithm sense. \r\n\r\nIn distributed algorithms, we looked at two main problems. First, the broadcast problem: given n agents, each agent is tasked to forward a (unique) message to every other agent. Agents collaborate and can copy and forward all messages they have received up until that point. Broadcast is achieved when one agent has successfully broadcast its message to everyone else. We studied the case where the communication network is controlled by an adversary, under the condition that the graph is rooted in every round of communication. We show that the adversary can delay broadcast for at most l\r\n(1 + √\r\n2)n\r\nm\r\n rounds, improving on the $O(n\\log\\log n)$ previous upper bound~\\cite{fugger2020radius}, and asymptotically matching the $\\sim 1.5n$ lower bound~\\cite{schwarz2017linear}.\r\n\r\nWe then looked at the stochastic version of the problem: here, the adversary -- parametrized by $k$ where $k=0$ signifies that the adversary has no control, and $k=n$ that the adversary has full control -- can choose parts of the graph, and the graph is then completed stochastically. Here, we are able to look at a stronger version of broadcast: instead of having $n$ messages trying to be broadcast in parallel, we can assume that only one message needs to be broadcasted. We show the bound $\\Theta(k+\\log n)$.\r\n\r\nThen, we looked at undecided states dynamics in population protocols: given a population of $n$ agents, where each initially holds an opinion among $k$ different ones. In each round, two agents are chosen uniformly at random, and can interact. If they have different opinions, they forget their opinions and become undecided. If one of them is undecided while the other has an opinion, they undecided agent copies they opinion of the decided one. The question is then, how many interactions does it take for the whole population to share the same opinion? We show a $\\Omega(kn\\log \\frac {\\sqrt n} {k \\log n})$ lower bound \ for any $k = o\\left(\\frac {\\sqrt n}{\\log n}\\right)$.\r\nThis is tight for any $ k \\le n^{\\frac 1 2 - \\epsilon}$, where $\\epsilon >0$ can be any small constant, matching the known $O(kn\\log n)$ upper bound for $k = O\\left(\\frac {\\sqrt n} {\\log ^2 n}\\right)$~\\cite{DBLP:conf/podc/AmirABBHKL23}.\r\n\r\nFinally, in dynamic algorithms, we study the minimum cut problem: we are given a graph, whose vertex set we want to partition into two subsets such that the number of edges crossing from one subset to the other is minimized. Then, the graph can be updated via edge insertions or deletions, and we must update the solution without recomputing everything from scratch. We present an exact fully-dynamic minimum cut algorithm that runs in $n^{o(1)}$ deterministic update time when the minimum cut size is at most $2^{\\Theta(\\log^{3/4-c}n)}$ for any $c>0$, improving on the previous algorithm~\\cite{DBLP:conf/soda/JinST24} whose minimum cut size limit is $(\\log n)^{o(1)}$. Using sparsification and randomization techniques, we are able to extend this to all values of the minimum cut in weighted graphs, at the cost of a $(1+o(1))$-approximation ratio." acknowledgement: "This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564)\r\n\"The Design and Evaluation of Modern Fully Dynamic Data Structures\" , from the\r\nAustrian Science Fund (FWF) grant DOI 10.55776/I5982 \"Static and Dynamic Hierarchical\r\nGraph Decompositions\", and from the Austrian Science Fund (FWF) and netIDEE SCIENCE\r\nproject P 33775-N, \"Fast Algorithms for a Reactive Network Layer\".\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Antoine full_name: El-Hayek, Antoine id: 888a098e-fcac-11ee-aff7-d347be57b725 last_name: El-Hayek orcid: 0000-0003-4268-7368 citation: ama: 'El-Hayek A. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. 2026. doi:10.15479/AT-ISTA-22281' apa: 'El-Hayek, A. (2026). Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22281' chicago: 'El-Hayek, Antoine. “Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22281.' ieee: 'A. El-Hayek, “Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks,” Institute of Science and Technology Austria, 2026.' ista: 'El-Hayek A. 2026. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. Institute of Science and Technology Austria.' mla: 'El-Hayek, Antoine. Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22281.' short: 'A. El-Hayek, Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks, Institute of Science and Technology Austria, 2026.' corr_author: '1' date_created: 2026-07-13T09:39:59Z date_published: 2026-07-13T00:00:00Z date_updated: 2026-07-24T12:48:29Z day: '13' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: MoHe doi: 10.15479/AT-ISTA-22281 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: 923e4ca769c9ef2f6b0b005444faf462 content_type: application/pdf creator: aelhayek date_created: 2026-07-17T11:39:47Z date_updated: 2026-07-17T11:39:47Z file_id: '22356' file_name: 2026_El-Hayek_Antoine_Thesis.pdf file_size: 5465973 relation: main_file success: 1 - access_level: closed checksum: 262689f9df27dd6c2c7c7861f1de7329 content_type: application/x-zip-compressed creator: aelhayek date_created: 2026-07-17T11:40:34Z date_updated: 2026-07-20T11:29:38Z file_id: '22357' file_name: 2026_El-Hayek_Antoine_Thesis.zip file_size: 9116107 relation: source_file file_date_updated: 2026-07-20T11:29:38Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '244' project: - _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62 call_identifier: H2020 grant_number: '101019564' name: The design and evaluation of modern fully dynamic data structures - _id: bda196b2-d553-11ed-ba76-8e8ee6c21103 grant_number: I05982 name: Static and Dynamic Hierarchical Graph Decompositions - _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe grant_number: P33775 name: Fast Algorithms for a Reactive Network Layer publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publisher_comment: Sections 2.4 and 7.1 and chapter 6 are not CC-BY 4.0, they are All Rights Reserved. related_material: record: - id: '20051' relation: part_of_dissertation status: public - id: '18557' relation: part_of_dissertation status: public - id: '19982' relation: part_of_dissertation status: public - id: '21720' relation: part_of_dissertation status: public - id: '22374' relation: part_of_dissertation status: public - id: '22373' relation: part_of_dissertation status: public status: public supervisor: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 title: 'Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: repository OA_type: green _id: '21720' abstract: - lang: eng text: "We present an exact fully-dynamic minimum cut algorithm that runs in \U0001D45B\U0001D45C⁡(1) deterministic update time when the minimum cut size is at most 2Θ⁡(log3/4−\U0001D450⁡\U0001D45B) for any \U0001D450 >0, improving on the previous algorithm of Jin, Sun, and Thorup (SODA 2024) whose minimum cut size limit is (log⁡\U0001D45B)\U0001D45C⁡(1). Combined with graph sparsification, we obtain the first (1 +\U0001D716)-approximate fully-dynamic minimum cut algorithm on weighted graphs, for any \U0001D716 ≥2−Θ⁡(log3/4−\U0001D450⁡\U0001D45B), in \U0001D45B\U0001D45C⁡(1) randomized update time.\r\nOur main technical contribution is a deterministic local minimum cut algorithm, which replaces the randomized LocalKCut procedure from El-Hayek, Henzinger, and Li (SODA 2025)." acknowledgement: Funded by the European union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/I5982. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission. article_processing_charge: No arxiv: 1 author: - first_name: Antoine full_name: El-Hayek, Antoine id: 888a098e-fcac-11ee-aff7-d347be57b725 last_name: El-Hayek orcid: 0000-0003-4268-7368 - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Jason full_name: Li, Jason last_name: Li citation: ama: 'El-Hayek A, Henzinger M, Li J. Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In: Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Vol 2026. Society for Industrial and Applied Mathematics; 2026:613-663. doi:10.1137/1.9781611978971.25' apa: 'El-Hayek, A., Henzinger, M., & Li, J. (2026). Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms (Vol. 2026, pp. 613–663). Vancouver, Canada: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611978971.25' chicago: El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, 2026:613–63. Society for Industrial and Applied Mathematics, 2026. https://doi.org/10.1137/1.9781611978971.25. ieee: A. El-Hayek, M. Henzinger, and J. Li, “Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time,” in Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Vancouver, Canada, 2026, vol. 2026, pp. 613–663. ista: 'El-Hayek A, Henzinger M, Li J. 2026. Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2026, 613–663.' mla: El-Hayek, Antoine, et al. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, vol. 2026, Society for Industrial and Applied Mathematics, 2026, pp. 613–63, doi:10.1137/1.9781611978971.25. short: A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2026, pp. 613–663. conference: end_date: 2026-01-14 location: Vancouver, Canada name: 'SODA: Symposium on Discrete Algorithms' start_date: 2026-01-11 date_created: 2026-04-12T22:01:51Z date_published: 2026-01-07T00:00:00Z date_updated: 2026-07-24T12:48:29Z day: '07' department: - _id: MoHe - _id: GradSch doi: 10.1137/1.9781611978971.25 ec_funded: 1 external_id: arxiv: - '2512.13105' intvolume: ' 2026' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2512.13105 month: '01' oa: 1 oa_version: Preprint page: 613-663 project: - _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62 call_identifier: H2020 grant_number: '101019564' name: The design and evaluation of modern fully dynamic data structures - _id: bda196b2-d553-11ed-ba76-8e8ee6c21103 grant_number: I05982 name: Static and Dynamic Hierarchical Graph Decompositions publication: Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms publication_identifier: eisbn: - '9781611978971' eissn: - 1557-9468 issn: - 1071-9040 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' related_material: record: - id: '22281' relation: dissertation_contains status: public scopus_import: '1' status: public title: Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2026 year: '2026' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold PlanS_conform: '1' _id: '22403' abstract: - lang: eng text: Linear phase‐contrast scanning transmission electron microscopy (STEM) techniques compatible with high‐throughput 4D‐STEM acquisition are widely used to enhance phase contrast in weakly scattering and beam‐sensitive materials. In these modalities, contrast transfer is often suppressed at low spatial frequencies, resulting in a characteristic contrast gap that limits contrast. Approaches that retain low‐frequency phase contrast exist but typically require substantially increased experimental complexity, restricting routine use. Dark‐field STEM imaging captures this missing low‐frequency information through electrons scattered outside the bright‐field disk, but discards a large fraction of the scattered signal and is therefore dose‐inefficient. Fused Full‐field STEM (FF‐STEM) is introduced as a 4D‐STEM imaging modality that overcomes these limitations by combining ptychographic phase reconstruction with tilt‐corrected dark‐field imaging within a single acquisition. Bright‐field data are used to estimate probe aberrations and reconstruct a high‐resolution phase image, while dark‐field data provide complementary low‐frequency contrast. The two channels are fused in Fourier space using Wiener‐band weighting based on the spectral signal‐to‐noise ratio, yielding transfer‐gap‐free images with high contrast. FF‐STEM preserves the upsampling and depth‐sectioning capabilities of ptychography, adds robust low‐frequency contrast characteristic of dark‐field imaging, and enables dose‐efficient, near–real‐time reconstruction. acknowledgement: 'We thank Tadahiro Yokosawa for support and discussions during the experiments. This project has received funding from the European Research Council (ERC) under the European Union''s Horizon 2020 research and innovation programme (Project HyperScaleEM, Grant agreement No. 101164581) and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the Research Training Group GRK 3103 CorMic: Korrelative Materialmikroskopie – Von nanostrukturierten funktionalen Filmen zu hierarchischen Funktionsmaterialien (project number 537140136). B.Z. and X.Y. were supported by the U.S. National Science Foundation under award CHE-2404338. X.Y. also thanks the Principal Investigator Development in Sustainability Grant from the American Chemical Society.' article_number: e76620 article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Shengbo full_name: You, Shengbo last_name: You - first_name: Georgios full_name: Varnavides, Georgios last_name: Varnavides - first_name: Sagar full_name: Khavnekar, Sagar last_name: Khavnekar - first_name: Nikita full_name: Palatkin, Nikita last_name: Palatkin - first_name: Sihan full_name: Shao, Sihan last_name: Shao - first_name: Mingjian full_name: Wu, Mingjian last_name: Wu - first_name: Daniel full_name: Stroppa, Daniel last_name: Stroppa - first_name: Darya full_name: Chernikova, Darya id: 7dbaf460-fa9e-11eb-b0ca-bc7c7ff21ad0 last_name: Chernikova - first_name: Baixu full_name: Zhu, Baixu last_name: Zhu - first_name: Ricardo full_name: Egoavil, Ricardo last_name: Egoavil - first_name: Stefano full_name: Vespucci, Stefano last_name: Vespucci - first_name: Dileep full_name: Krishnan, Dileep last_name: Krishnan - first_name: Xingchen full_name: Ye, Xingchen last_name: Ye - first_name: Florian KM full_name: Schur, Florian KM id: 48AD8942-F248-11E8-B48F-1D18A9856A87 last_name: Schur orcid: 0000-0003-4790-8078 - first_name: Erdmann full_name: Spiecker, Erdmann last_name: Spiecker - first_name: Philipp full_name: Pelz, Philipp last_name: Pelz citation: ama: You S, Varnavides G, Khavnekar S, et al. Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels. Advanced Science. 2026. doi:10.1002/advs.76620 apa: You, S., Varnavides, G., Khavnekar, S., Palatkin, N., Shao, S., Wu, M., … Pelz, P. (2026). Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels. Advanced Science. Wiley. https://doi.org/10.1002/advs.76620 chicago: You, Shengbo, Georgios Varnavides, Sagar Khavnekar, Nikita Palatkin, Sihan Shao, Mingjian Wu, Daniel Stroppa, et al. “Gap‐free Information Transfer in 4D‐STEM via Fusion of Complementary Scattering Channels.” Advanced Science. Wiley, 2026. https://doi.org/10.1002/advs.76620. ieee: S. You et al., “Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels,” Advanced Science. Wiley, 2026. ista: You S, Varnavides G, Khavnekar S, Palatkin N, Shao S, Wu M, Stroppa D, Chernikova D, Zhu B, Egoavil R, Vespucci S, Krishnan D, Ye X, Schur FK, Spiecker E, Pelz P. 2026. Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels. Advanced Science., e76620. mla: You, Shengbo, et al. “Gap‐free Information Transfer in 4D‐STEM via Fusion of Complementary Scattering Channels.” Advanced Science, e76620, Wiley, 2026, doi:10.1002/advs.76620. short: S. You, G. Varnavides, S. Khavnekar, N. Palatkin, S. Shao, M. Wu, D. Stroppa, D. Chernikova, B. Zhu, R. Egoavil, S. Vespucci, D. Krishnan, X. Ye, F.K. Schur, E. Spiecker, P. Pelz, Advanced Science (2026). das_tickbox: '1' dataavailabilitystatement: The data that support the findings of this study are openly available in Zenodo at https://doi.org/10.5281/zenodo.18008901. The reconstruction code is available as an open-source repository at the scatterem github repo. date_created: 2026-07-26T19:01:34Z date_published: 2026-07-23T00:00:00Z date_updated: 2026-07-27T06:04:57Z day: '23' ddc: - '570' - '600' department: - _id: FlSc - _id: GradSch doi: 10.1002/advs.76620 external_id: arxiv: - '2512.19460' has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1002/advs.76620 month: '07' oa: 1 oa_version: Published Version publication: Advanced Science publication_identifier: eissn: - 2198-3844 publication_status: epub_ahead publisher: Wiley quality_controlled: '1' researchdata_availability: yes scopus_import: '1' status: public supplementarymaterial: yes title: Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '20986' abstract: - lang: eng text: During complex vocal interactions, different features of acoustic stimuli are integrated to produce appropriate vocal responses,1 such as copying sounds during vocal matching behavior in some animals.2,3,4,5,6,7,8,9,10,11,12 However, little is known about the interplay and possible trade-offs between the different temporal and spectral acoustic features during these vocal exchanges.2,13,14 Nightingales can flexibly match the pitch of their tonal “whistle songs” in real time during counter-singing duels.15,16 Here, we show that the syllable duration of whistle playbacks could alter the song responses of wild nightingales, causing their whistle duration distribution to shift toward the presented stimulus duration. When exposed to whistle playbacks featuring unnatural combinations of pitch and duration, nightingales demonstrate a flexible trade-off between pitch matching and temporal imitation, yet they are constrained by their vocal repertoire. They selectively adapted their vocal responses to approximate these novel stimuli, aligning them with their natural whistle repertoire. We developed a computational model of nightingale whistle-matching behavior that revealed a hierarchical organization of acoustic feature production. During whistle matching, the feature integration process is constrained by the duration of syllables, and pitch matching follows within this temporal framework, forcing a trade-off between the two features. Our findings reveal a complex interplay between the spectral and temporal domains that shapes song-matching behavior. acknowledgement: 'We would like to thank J. Benichov and N. Hein for their help with fieldwork; M. Ramadas for helping with the segmentation analysis; T. Eliav, C. Chintaluri, G. Tkacik, and A. Navas for providing helpful comments to the project and manuscript; and A. Costalunga for the drawings of nightingales. Funding sources: The Joachim Herz Stiftung Add-on Fellowships for Interdisciplinary Life Science, awarded to G.C.; the ERC Consolidator Grant 819603 SYNAPSEEK, awarded to T.P.V.; and DFG Research Unit 5768–532521431, DFG Research Grant-547921981, DFG SFB 1315–327654276, and the ERC Starting Grant 757459 MIDNIGHT, awarded to D.V.' article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Juan Sebastian full_name: Calderon Garcia, Juan Sebastian id: 1271b54b-dbcd-11ea-9d1d-d92da838fe2c last_name: Calderon Garcia - first_name: Giacomo full_name: Costalunga, Giacomo last_name: Costalunga - first_name: Tim P full_name: Vogels, Tim P id: CB6FF8D2-008F-11EA-8E08-2637E6697425 last_name: Vogels orcid: 0000-0003-3295-6181 - first_name: Daniela full_name: Vallentin, Daniela last_name: Vallentin citation: ama: Calderon Garcia JS, Costalunga G, Vogels TP, Vallentin D. Interplay between syllable duration and pitch during whistle matching in wild nightingales. Current Biology. 2026;36(3):791-798.e6. doi:10.1016/j.cub.2025.12.025 apa: Calderon Garcia, J. S., Costalunga, G., Vogels, T. P., & Vallentin, D. (2026). Interplay between syllable duration and pitch during whistle matching in wild nightingales. Current Biology. Elsevier. https://doi.org/10.1016/j.cub.2025.12.025 chicago: Calderon Garcia, Juan Sebastian, Giacomo Costalunga, Tim P Vogels, and Daniela Vallentin. “Interplay between Syllable Duration and Pitch during Whistle Matching in Wild Nightingales.” Current Biology. Elsevier, 2026. https://doi.org/10.1016/j.cub.2025.12.025. ieee: J. S. Calderon Garcia, G. Costalunga, T. P. Vogels, and D. Vallentin, “Interplay between syllable duration and pitch during whistle matching in wild nightingales,” Current Biology, vol. 36, no. 3. Elsevier, p. 791–798.e6, 2026. ista: Calderon Garcia JS, Costalunga G, Vogels TP, Vallentin D. 2026. Interplay between syllable duration and pitch during whistle matching in wild nightingales. Current Biology. 36(3), 791–798.e6. mla: Calderon Garcia, Juan Sebastian, et al. “Interplay between Syllable Duration and Pitch during Whistle Matching in Wild Nightingales.” Current Biology, vol. 36, no. 3, Elsevier, 2026, p. 791–798.e6, doi:10.1016/j.cub.2025.12.025. short: J.S. Calderon Garcia, G. Costalunga, T.P. Vogels, D. Vallentin, Current Biology 36 (2026) 791–798.e6. das_tickbox: '1' dataavailabilitystatement: "All data have been deposited at https://github.com/vallentinlab/NG-whistle-durations and are publicly available as of the date of publication.\r\nAll original code has been deposited at https://github.com/vallentinlab/NG-whistle-durations and is publicly available as of the date of publication.\r\nAny additional information required to reanalyze the data reported in this paper is available from the lead contact upon request." date_created: 2026-01-14T12:00:29Z date_published: 2026-02-02T00:00:00Z date_updated: 2026-07-27T10:48:35Z day: '02' ddc: - '570' - '577' department: - _id: GradSch - _id: TiVo doi: 10.1016/j.cub.2025.12.025 ec_funded: 1 external_id: pmid: - '41529680' file: - access_level: open_access checksum: e17c3537193d5ab4886596d1a04f9b0e content_type: application/pdf creator: dernst date_created: 2026-07-27T10:47:55Z date_updated: 2026-07-27T10:47:55Z file_id: '22416' file_name: 2026_CurrentBiology_CalderonGarcia.pdf file_size: 7120959 relation: main_file success: 1 file_date_updated: 2026-07-27T10:47:55Z has_accepted_license: '1' intvolume: ' 36' issue: '3' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 791-798.e6 pmid: 1 project: - _id: 0aacfa84-070f-11eb-9043-d7eb2c709234 call_identifier: H2020 grant_number: '819603' name: Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning. publication: Current Biology publication_identifier: eissn: - 1879-0445 issn: - 0960-9822 publication_status: published publisher: Elsevier quality_controlled: '1' researchdata_availability: yes scopus_import: '1' status: public supplementarymaterial: yes title: Interplay between syllable duration and pitch during whistle matching in wild nightingales tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 36 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '21006' abstract: - lang: eng text: Modern experimental methods in programmable self-assembly make it possible to precisely design particle concentrations, shapes and interactions. However, more physical insight is needed before we can take full advantage of this vast design space to assemble nanostructures with complex form and function. Here we show how a substantial part of this design space can be quickly and comprehensively understood by identifying a class of thermodynamic constraints that act on it. These thermodynamic constraints form a high-dimensional convex polyhedron that determines which nanostructures can be assembled at high equilibrium yield and reveals limitations that govern the coexistence of structures. We validate our predictions through detailed, quantitative assembly experiments of nanoscale particles synthesized using DNA origami. Our results uncover physical relationships underpinning many-component programmable self-assembly in equilibrium and form the basis for robust inverse design, applicable to various systems from biological protein complexes to synthetic nanomachines. acknowledgement: We thank B. Isaac and A. Tiano for their technical support with the electron microscopy and S. Waitukaitis for helpful comments on the manuscript. The TEM images were prepared and imaged at the Brandeis Electron Microscopy facility. This work was supported by the Gesellschaft für Forschungsförderung Niederösterreich under project FTI23-G-011 (M.C.H. and C.P.G.), the Brandeis University Materials Research Science and Engineering Center (MRSEC) under grant number NSF DMR-2011846 (T.E.V., D.H. and W.B.R.) and the Smith Family Foundation (W.B.R.). Open access funding provided by Institute of Science and Technology (IST Austria). article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Maximilian full_name: Hübl, Maximilian id: 5eb8629e-15b2-11ec-abd3-e6f3e5e01f32 last_name: Hübl - first_name: Thomas E. full_name: Videbæk, Thomas E. last_name: Videbæk - first_name: Daichi full_name: Hayakawa, Daichi last_name: Hayakawa - first_name: W. Benjamin full_name: Rogers, W. Benjamin last_name: Rogers - first_name: Carl Peter full_name: Goodrich, Carl Peter id: EB352CD2-F68A-11E9-89C5-A432E6697425 last_name: Goodrich orcid: 0000-0002-1307-5074 citation: ama: Hübl M, Videbæk TE, Hayakawa D, Rogers WB, Goodrich CP. A polyhedral structure controls programmable self-assembly. Nature Physics. 2026;22:294-301. doi:10.1038/s41567-025-03120-3 apa: Hübl, M., Videbæk, T. E., Hayakawa, D., Rogers, W. B., & Goodrich, C. P. (2026). A polyhedral structure controls programmable self-assembly. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-025-03120-3 chicago: Hübl, Maximilian, Thomas E. Videbæk, Daichi Hayakawa, W. Benjamin Rogers, and Carl Peter Goodrich. “A Polyhedral Structure Controls Programmable Self-Assembly.” Nature Physics. Springer Nature, 2026. https://doi.org/10.1038/s41567-025-03120-3. ieee: M. Hübl, T. E. Videbæk, D. Hayakawa, W. B. Rogers, and C. P. Goodrich, “A polyhedral structure controls programmable self-assembly,” Nature Physics, vol. 22. Springer Nature, pp. 294–301, 2026. ista: Hübl M, Videbæk TE, Hayakawa D, Rogers WB, Goodrich CP. 2026. A polyhedral structure controls programmable self-assembly. Nature Physics. 22, 294–301. mla: Hübl, Maximilian, et al. “A Polyhedral Structure Controls Programmable Self-Assembly.” Nature Physics, vol. 22, Springer Nature, 2026, pp. 294–301, doi:10.1038/s41567-025-03120-3. short: M. Hübl, T.E. Videbæk, D. Hayakawa, W.B. Rogers, C.P. Goodrich, Nature Physics 22 (2026) 294–301. corr_author: '1' das_tickbox: '1' dataavailabilitystatement: "Design files and folding conditions of DNA origami used in this work are provided in the repository Nanobase68 and are accessible at https://nanobase.org/structures/247. All the TEM images and associated experimental data are available via Zenodo at https://doi.org/10.5281/zenodo.17314727 (ref. 70).\r\nStructure enumeration was performed using the Roly.jl27,71 (v.0.1.0) package developed by M.C.H. and C.P.G., which is available via GitHub at https://github.com/mxhbl/Roly.jl. Polyhedral computation and linear programming were performed using the freely available Convex.jl72 (v.0.16.4) package, Polyhedra.jl73 (v.0.7.8) package and cddlib63 (v.0.9.4) library. The example code reproducing the calculations done on the three rings and reconfigurable squares is available via GitHub at https://github.com/mxhbl/PolyhedralStructureOfSelfAssembly. An implementation of the lattice Monte Carlo sampler is available via GitHub at https://github.com/mxhbl/LatticeSampler. Fitting of the yield curves was achieved using the freely available Optim.jl74 (v.1.12.0) package." date_created: 2026-01-20T10:02:19Z date_published: 2026-02-01T00:00:00Z date_updated: 2026-07-27T10:59:15Z day: '01' ddc: - '570' - '540' department: - _id: CaGo - _id: GradSch doi: 10.1038/s41567-025-03120-3 file: - access_level: open_access checksum: f4e3123d5d9dfcd22324e2c2de02e9a2 content_type: application/pdf creator: dernst date_created: 2026-07-27T10:57:57Z date_updated: 2026-07-27T10:57:57Z file_id: '22417' file_name: 2026_NaturePhysics_Huebl.pdf file_size: 2802534 relation: main_file success: 1 file_date_updated: 2026-07-27T10:57:57Z has_accepted_license: '1' intvolume: ' 22' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 294-301 project: - _id: 8dd93da8-16d5-11f0-9cad-d2c70200d9a5 grant_number: FTI23-G-011 name: Dynamically reconfigurable self-assembly with triangular DNA-origami bricks publication: Nature Physics publication_identifier: eissn: - 1745-2481 issn: - 1745-2473 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - description: News on ISTA website relation: press_release url: https://ista.ac.at/en/news/behind-natures-blueprints/ researchdata_availability: yes scopus_import: '1' status: public supplementarymaterial: yes title: A polyhedral structure controls programmable self-assembly tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 22 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '21295' abstract: - lang: eng text: 'Depending on the type of flow, the transition to turbulence can take one of two forms: either turbulence arises from a sequence of instabilities or from the spatial proliferation of transiently chaotic domains, a process analogous to directed percolation. The former scenario is commonly referred to as a supercritical transition and frequently encountered in flows destabilized by body forces, whereas the latter subcritical transition is common in shear flows. Both cases are inherently continuous in a sense that the transformation from ordered laminar to fully turbulent fluid motion is only accomplished gradually with flow speed. Here we show that these established transition types do not account for the more general setting of shear flows subject to body forces. The combination of the two continuous scenarios leads to the attenuation of spatial coupling; with increasing forcing amplitude, the transition becomes increasingly sharp and eventually discontinuous. We argue that the suppression of laminar–turbulent coexistence and the approach towards a discontinuous phase transition potentially apply to a broad range of situations including flows subject to, for example, buoyancy, centrifugal or electromagnetic forces.' acknowledgement: The work was supported by the Simons Foundation (grant number 662960, to B.H.). Open access funding provided by Institute of Science and Technology (IST Austria). article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Bowen full_name: Yang, Bowen id: 71b6ff4b-15b2-11ec-abd3-aef6b028cf7e last_name: Yang orcid: 0000-0002-4843-6853 - first_name: Yi full_name: Zhuang, Yi id: 3677B57C-F248-11E8-B48F-1D18A9856A87 last_name: Zhuang - first_name: Gökhan full_name: Yalniz, Gökhan id: 66E74FA2-D8BF-11E9-8249-8DE2E5697425 last_name: Yalniz orcid: 0000-0002-8490-9312 - first_name: Mukund full_name: Vasudevan, Mukund id: 3C5A959A-F248-11E8-B48F-1D18A9856A87 last_name: Vasudevan - first_name: Elena full_name: Marensi, Elena id: 0BE7553A-1004-11EA-B805-18983DDC885E last_name: Marensi orcid: 0000-0001-7173-4923 - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: Yang B, Zhuang Y, Yalniz G, Vasudevan M, Marensi E, Hof B. Discontinuous transition to shear flow turbulence. Nature Physics. 2026;22:424-429. doi:10.1038/s41567-025-03166-3 apa: Yang, B., Zhuang, Y., Yalniz, G., Vasudevan, M., Marensi, E., & Hof, B. (2026). Discontinuous transition to shear flow turbulence. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-025-03166-3 chicago: Yang, Bowen, Yi Zhuang, Gökhan Yalniz, Mukund Vasudevan, Elena Marensi, and Björn Hof. “Discontinuous Transition to Shear Flow Turbulence.” Nature Physics. Springer Nature, 2026. https://doi.org/10.1038/s41567-025-03166-3. ieee: B. Yang, Y. Zhuang, G. Yalniz, M. Vasudevan, E. Marensi, and B. Hof, “Discontinuous transition to shear flow turbulence,” Nature Physics, vol. 22. Springer Nature, pp. 424–429, 2026. ista: Yang B, Zhuang Y, Yalniz G, Vasudevan M, Marensi E, Hof B. 2026. Discontinuous transition to shear flow turbulence. Nature Physics. 22, 424–429. mla: Yang, Bowen, et al. “Discontinuous Transition to Shear Flow Turbulence.” Nature Physics, vol. 22, Springer Nature, 2026, pp. 424–29, doi:10.1038/s41567-025-03166-3. short: B. Yang, Y. Zhuang, G. Yalniz, M. Vasudevan, E. Marensi, B. Hof, Nature Physics 22 (2026) 424–429. corr_author: '1' das_tickbox: '1' dataavailabilitystatement: Source data are available via Zenodo at https://doi.org/10.5281/zenodo.17514317 (ref. 51). The numerical simulations were carried out using the open-source codes openpipeflow41 and nsPipeflow45. date_created: 2026-02-17T11:38:41Z date_published: 2026-03-01T00:00:00Z date_updated: 2026-07-27T11:13:48Z day: '01' ddc: - '532' department: - _id: GradSch - _id: BjHo doi: 10.1038/s41567-025-03166-3 external_id: arxiv: - '2311.11474' file: - access_level: open_access checksum: 0636abba74896c467a7237411fa2369b content_type: application/pdf creator: dernst date_created: 2026-07-27T11:12:46Z date_updated: 2026-07-27T11:12:46Z file_id: '22420' file_name: 2026_NaturePhysics_Yang.pdf file_size: 5152735 relation: main_file success: 1 file_date_updated: 2026-07-27T11:12:46Z has_accepted_license: '1' intvolume: ' 22' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 424-429 project: - _id: 238598C6-32DE-11EA-91FC-C7463DDC885E grant_number: '662960' name: Revisiting the Turbulence Problem Using Statistical Mechanics publication: Nature Physics publication_identifier: eissn: - 1745-2481 issn: - 1745-2473 publication_status: published publisher: Springer Nature quality_controlled: '1' researchdata_availability: yes scopus_import: '1' status: public supplementarymaterial: yes title: Discontinuous transition to shear flow turbulence tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 22 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '21483' abstract: - lang: eng text: 'Embryogenesis in the model plant Arabidopsis thaliana provides a framework for understanding how cell polarity and patterning coordinate with hormonal signalling to establish the plant body plan. Following fertilisation, the zygote divides asymmetrically to generate apical and basal lineages, establishing the apical–basal axis that defines future shoot and root poles. Genetic and molecular analyses of classical mutants including gnom, monopteros (mp), bodenlos (bdl) and topless revealed that localised auxin biosynthesis, directional transport and downstream transcriptional responses are central to apical–basal axis establishment and organ initiation. The main components of this regulation are polarly localised PIN auxin transporters and downstream modules involving MONOPTEROS and WUSCHEL-RELATED HOMEOBOX transcription factors. Advances in microscopy have transformed the study of Arabidopsis embryogenesis: fluorescence-compatible clearing reagents and three-dimensional reconstructions now permit quantitative analyses of cell geometry, division orientation, and cytoskeletal dynamics. Live ovule imaging setups with confocal laser scanning and multiphoton microscopes enable real-time observation of embryo development, while laser-assisted cell ablation can be used to probe cell-to-cell communication and fate plasticity. Together, these methodological breakthroughs position Arabidopsis embryos as a prime model for dissecting the chemical and biophysical cues that shape plant development.' acknowledgement: The authors would like to acknowledge the many colleagues whose valuable contributions to the field could not be included in this review due to space limitations and reference constraints. Open Access funding provided by Institute of Science and Technology Austria/KEMÖ. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: David full_name: Babic, David id: db566d23-f6e0-11ea-865d-e6f270e968e7 last_name: Babic - first_name: Milan full_name: Zupunski, Milan id: f6a21fce-573e-11f0-a150-a8d96aee2539 last_name: Zupunski - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Babic D, Zupunski M, Friml J. Imaging and genetic toolbox to study Arabidopsis embryogenesis. New Phytologist. 2026;250(3):1483-1491. doi:10.1111/nph.71072 apa: Babic, D., Zupunski, M., & Friml, J. (2026). Imaging and genetic toolbox to study Arabidopsis embryogenesis. New Phytologist. Wiley. https://doi.org/10.1111/nph.71072 chicago: Babic, David, Milan Zupunski, and Jiří Friml. “Imaging and Genetic Toolbox to Study Arabidopsis Embryogenesis.” New Phytologist. Wiley, 2026. https://doi.org/10.1111/nph.71072. ieee: D. Babic, M. Zupunski, and J. Friml, “Imaging and genetic toolbox to study Arabidopsis embryogenesis,” New Phytologist, vol. 250, no. 3. Wiley, pp. 1483–1491, 2026. ista: Babic D, Zupunski M, Friml J. 2026. Imaging and genetic toolbox to study Arabidopsis embryogenesis. New Phytologist. 250(3), 1483–1491. mla: Babic, David, et al. “Imaging and Genetic Toolbox to Study Arabidopsis Embryogenesis.” New Phytologist, vol. 250, no. 3, Wiley, 2026, pp. 1483–91, doi:10.1111/nph.71072. short: D. Babic, M. Zupunski, J. Friml, New Phytologist 250 (2026) 1483–1491. corr_author: '1' das_tickbox: '0' date_created: 2026-03-23T14:59:06Z date_published: 2026-05-01T00:00:00Z date_updated: 2026-07-27T11:47:24Z day: '01' ddc: - '580' department: - _id: JiFr - _id: GradSch doi: 10.1111/nph.71072 external_id: pmid: - '41808651' file: - access_level: open_access checksum: 67513dde983631bed9613fdaadbbee06 content_type: application/pdf creator: dernst date_created: 2026-07-27T11:46:25Z date_updated: 2026-07-27T11:46:25Z file_id: '22424' file_name: 2026_NewPhytologist_Babic.pdf file_size: 1708392 relation: main_file success: 1 file_date_updated: 2026-07-27T11:46:25Z has_accepted_license: '1' intvolume: ' 250' issue: '3' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 1483-1491 pmid: 1 publication: New Phytologist publication_identifier: eissn: - 1469-8137 issn: - 0028-646X publication_status: published publisher: Wiley quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: Imaging and genetic toolbox to study Arabidopsis embryogenesis tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 250 year: '2026' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '21486' abstract: - lang: eng text: Sex-chromosome systems are highly variable across animals, but how they transition from one to another is not well understood. Diptera have undergone multiple sex-chromosome turnovers and expansions while maintaining their general chromosomal content, which makes them an ideal clade to study such transitions. We analyzed more than 100 dipteran whole-genome assemblies and identified 4 new lineages that underwent sex-chromosome turnover (in addition to the 5 previously reported). We find that the majority of turnovers happened in the group Schizophora, which tend to have fewer genes on Muller element F (the chromosome homologous to the ancestral insect X chromosome) than lower dipterans, a factor previously hypothesized to facilitate turnover. Most derived X chromosomes have higher GC content than autosomes, consistent with a high prevalence of male achiasmy in Diptera. In addition, an excess of gene movement out of the X is detected for most of these new X chromosomes, and many of these moved genes have high testis expression in Drosophila, suggesting that out-of-X gene movement contributes to the long-term demasculinization of X chromosomes. acknowledged_ssus: - _id: ScienComp acknowledgement: This work was supported by a grant from the Austrian Science Fund (FWF, grant number PAT 8748323) to B.V. We thank the Vicoso group for their feedback on an early version of the manuscript. We are grateful to Kamil Jaron and Julia Gries for helpful discussions and for sharing their unpublished work. Computational resources and support were provided by the Scientific Computing Unit at ISTA. article_number: qrag003 article_processing_charge: Yes article_type: original author: - first_name: Lorena Alexandra full_name: Layana Franco, Lorena Alexandra id: 02814589-eb8f-11eb-b029-a70074f3f18f last_name: Layana Franco orcid: 0000-0002-1253-6297 - first_name: Melissa A full_name: Toups, Melissa A id: 4E099E4E-F248-11E8-B48F-1D18A9856A87 last_name: Toups orcid: 0000-0002-9752-7380 - first_name: Beatriz full_name: Vicoso, Beatriz id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87 last_name: Vicoso orcid: 0000-0002-4579-8306 citation: ama: Layana Franco LA, Toups MA, Vicoso B. Causes and consequences of sex-chromosome turnovers in Diptera. Evolution Letters. 2026;10(3). doi:10.1093/evlett/qrag003 apa: Layana Franco, L. A., Toups, M. A., & Vicoso, B. (2026). Causes and consequences of sex-chromosome turnovers in Diptera. Evolution Letters. Oxford University Press. https://doi.org/10.1093/evlett/qrag003 chicago: Layana Franco, Lorena Alexandra, Melissa A Toups, and Beatriz Vicoso. “Causes and Consequences of Sex-Chromosome Turnovers in Diptera.” Evolution Letters. Oxford University Press, 2026. https://doi.org/10.1093/evlett/qrag003. ieee: L. A. Layana Franco, M. A. Toups, and B. Vicoso, “Causes and consequences of sex-chromosome turnovers in Diptera,” Evolution Letters, vol. 10, no. 3. Oxford University Press, 2026. ista: Layana Franco LA, Toups MA, Vicoso B. 2026. Causes and consequences of sex-chromosome turnovers in Diptera. Evolution Letters. 10(3), qrag003. mla: Layana Franco, Lorena Alexandra, et al. “Causes and Consequences of Sex-Chromosome Turnovers in Diptera.” Evolution Letters, vol. 10, no. 3, qrag003, Oxford University Press, 2026, doi:10.1093/evlett/qrag003. short: L.A. Layana Franco, M.A. Toups, B. Vicoso, Evolution Letters 10 (2026). corr_author: '1' dataavailabilitystatement: Scripts, Supplementary Datasets 1–7, and Tables S1, S2, S5 and S6 are also available at https://doi.org/10.15479/AT-ISTA-21116. Pipelines are available at https://git.ista.ac.at/llayanaf/transitions_diptera. date_created: 2026-03-23T15:05:42Z date_published: 2026-06-01T00:00:00Z date_updated: 2026-07-27T12:00:11Z day: '01' ddc: - '570' department: - _id: BeVi - _id: GradSch doi: 10.1093/evlett/qrag003 file: - access_level: open_access checksum: 7c929e78c369a5e6e064bcf263e955ad content_type: application/pdf creator: dernst date_created: 2026-07-27T11:59:40Z date_updated: 2026-07-27T11:59:40Z file_id: '22426' file_name: 2026_EvolutionLetters_Layana.pdf file_size: 1895786 relation: main_file success: 1 file_date_updated: 2026-07-27T11:59:40Z has_accepted_license: '1' intvolume: ' 10' issue: '3' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 8ed82125-16d5-11f0-9cad-fbcae312235b grant_number: PAT 8748323 name: Sex chromosomes in evolution and development publication: Evolution Letters publication_identifier: eissn: - 2056-3744 publication_status: published publisher: Oxford University Press quality_controlled: '1' researchdata_availability: yes status: public supplementarymaterial: yes title: Causes and consequences of sex-chromosome turnovers in Diptera tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2026' ... --- OA_place: publisher _id: '21854' abstract: - lang: eng text: "As neural-network-based models grow both in size and popularity, interest has grown in making the models smaller and more efficient to train. To that end, many methods have been proposed to prune models by reducing their number of nonzero parameters. Additionally, parameter-efficient fine-tuning, in which a much smaller number of parameters than the total contained in the model is updated during training, has become very popular, especially in the space of Large Language Models. At the same time, the increasingly routine deployment of machine learning in real-world applications has spurred a drive to make them more trustworthy - in the sense of, among other things, being unbiased, interpretable, and editable. In this thesis, we examine the interplay between efficiency and trustworthiness.\r\n\r\nFirst, we analyze the effects of model pruning on bias in computer vision models, demonstrating that increased sparsity leads to greater bias, largely as a function of increased model uncertainty in marginal cases. Based on this observation, we propose several bias mitigation techniques. Then, we demonstrate that example-specific model pruning can improve model interpretation methods while improving pruning efficiency to make example-specific model pruning feasible in real time. Then, we investigate the effectiveness of parameter-efficient and data-efficient model personalization via fine-tuning, demonstrating that it is highly feasible with very small computational and data resources. Finally, we consider efficiency in editing model knowledge using a custom synthetic data framework, demonstrating that parameter-efficient, low-rank fine-tuning frequently outperforms full-rank fine-tuning, and, additionally, that restricting which model blocks are fine-tuned frequently improves results. Together, the results in this thesis provide new insights and techniques for combining trustworthiness and efficiency during neural network inference and training.\r\n\r\n" acknowledged_ssus: - _id: ScienComp acknowledgement: "The research in this Ph.D. was funded in whole\r\nor in part by the Austrian Science Fund (FWF) W1260-N35 (Vienna Graduate School for\r\nComputational Optimization). For open access purposes the author has applied a CC BY\r\npublic copyright license to any author accepted manuscript version arising from this submission\r\nwherever possible. Additionally, I am grateful to Alois Schlögl, Waleed Khalid, and the rest of\r\nthe ISTA Scientific Computing team for building and maintaining the infrastructure I used\r\nto run experiments. I’m also deeply grateful to the Alistarh group’s administrative assistant,\r\nChristine Francois, who always deals with our nonsense with common sense and a smile.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Eugenia B full_name: Iofinova, Eugenia B id: f9a17499-f6e0-11ea-865d-fdf9a3f77117 last_name: Iofinova orcid: 0000-0002-7778-3221 citation: ama: Iofinova EB. On the utility and effects of efficiency in artificial neural networks. 2026. doi:10.15479/AT-ISTA-21854 apa: Iofinova, E. B. (2026). On the utility and effects of efficiency in artificial neural networks. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21854 chicago: Iofinova, Eugenia B. “On the Utility and Effects of Efficiency in Artificial Neural Networks.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21854. ieee: E. B. Iofinova, “On the utility and effects of efficiency in artificial neural networks,” Institute of Science and Technology Austria, 2026. ista: Iofinova EB. 2026. On the utility and effects of efficiency in artificial neural networks. Institute of Science and Technology Austria. mla: Iofinova, Eugenia B. On the Utility and Effects of Efficiency in Artificial Neural Networks. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21854. short: E.B. Iofinova, On the Utility and Effects of Efficiency in Artificial Neural Networks, Institute of Science and Technology Austria, 2026. corr_author: '1' das_tickbox: '1' date_created: 2026-05-11T08:43:22Z date_published: 2026-05-11T00:00:00Z date_updated: 2026-07-27T12:50:04Z day: '11' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: DaAl doi: 10.15479/AT-ISTA-21854 doi_confirm: '1' file: - access_level: closed checksum: 2e148dad920e3f9b7c32796e0ba2e5f7 content_type: application/zip creator: eiofinov date_created: 2026-05-11T08:36:01Z date_updated: 2026-05-11T08:36:01Z file_id: '21856' file_name: EIofinova_thesis_FinalVersion.zip file_size: 28479571 relation: source_file - access_level: open_access checksum: b10c2933f386f532b2dbf28b19c5525c content_type: application/pdf creator: eiofinov date_created: 2026-05-13T13:10:48Z date_updated: 2026-05-13T13:10:48Z file_id: '21877' file_name: 2026_Iofinova_Eugenia_Thesis.pdf file_size: 18137757 relation: main_file success: 1 file_date_updated: 2026-05-13T13:10:48Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: '237' project: - _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A grant_number: W1260-N35 name: Vienna Graduate School on Computational Optimization publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publisher_comment: In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not endorse any of ISTA's products or services. Internal or personal use of this material is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional purposes or for creating new collective works for resale or redistribution, please go to http://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from RightsLink. If applicable, University Microfilms and/or ProQuest Library, or the Archives of Canada may supply single copies of the dissertation. related_material: record: - id: '14771' relation: part_of_dissertation status: public - id: '18121' relation: part_of_dissertation status: public - id: '21858' relation: part_of_dissertation status: public - id: '21859' relation: part_of_dissertation status: public - id: '21857' relation: part_of_dissertation status: public status: public supervisor: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X title: On the utility and effects of efficiency in artificial neural networks type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher OA_type: green _id: '21857' abstract: - lang: eng text: "The availability of powerful open-source large language models (LLMs) opens exciting use cases, such as using personal data to fine-tune these models to imitate a user’s unique writing style. Two key requirements for this functionality are personalization–in the sense that the output should recognizably reflect the user’s own writing style—and privacy–users may justifiably be wary of uploading extremely personal data, such as their email archive, to a third-party service. In this paper, we demonstrate the feasibility of training and running such an assistant, which we call Panza, on commodity hardware, for the specific use case of email generation. Panza’s personalization features are based on a combination of parameter-efficient fine-tuning using a variant of the Reverse Instructions technique [1] and Retrieval-Augmented Generation (RAG) [2]. We demonstrate that this combination allows us to fine-tune an LLM to reflect a user’s writing style using limited data, while executing on extremely limited resources, e.g. on a free Google Colab instance. Our key methodological contribution is the first detailed study of evaluation metrics for this task, and\r\nof how different choices of system components–the use of RAG and of different fine-tuning approaches–impact the system’s performance. Additionally, we demonstrate that very little data - under 100 email samples - are sufficient to create models that convincingly imitate humans, showcasing a previously unknown attack vector in language models. We are releasing the full Panza code as well as three new email datasets licensed for research use." article_number: '81' article_processing_charge: No author: - first_name: Armand full_name: Nicolicioiu, Armand last_name: Nicolicioiu - first_name: Eugenia B full_name: Iofinova, Eugenia B id: f9a17499-f6e0-11ea-865d-fdf9a3f77117 last_name: Iofinova orcid: 0000-0002-7778-3221 - first_name: Andrej full_name: Jovanovic, Andrej last_name: Jovanovic - first_name: Eldar full_name: Kurtic, Eldar id: 47beb3a5-07b5-11eb-9b87-b108ec578218 last_name: Kurtic - first_name: Mahdi full_name: Nikdan, Mahdi id: 66374281-f394-11eb-9cf6-869147deecc0 last_name: Nikdan - first_name: Andrei full_name: Panferov, Andrei id: 2c18daae-4dbe-11ef-8491-98ce2d960f09 last_name: Panferov - first_name: Ilia full_name: Markov, Ilia id: D0CF4148-C985-11E9-8066-0BDEE5697425 last_name: Markov - first_name: Nir full_name: Shavit, Nir last_name: Shavit - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Nicolicioiu A, Iofinova EB, Jovanovic A, et al. Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation. OpenReview; 2026.' apa: 'Nicolicioiu, A., Iofinova, E. B., Jovanovic, A., Kurtic, E., Nikdan, M., Panferov, A., … Alistarh, D.-A. (2026). Panza: Investigating the feasibility of fully-local personalized text generation. Third Conference on Parsimony and Learning (Proceedings Track). Tübíngen, Germany: OpenReview.' chicago: 'Nicolicioiu, Armand, Eugenia B Iofinova, Andrej Jovanovic, Eldar Kurtic, Mahdi Nikdan, Andrei Panferov, Ilia Markov, Nir Shavit, and Dan-Adrian Alistarh. Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation. Third Conference on Parsimony and Learning (Proceedings Track). OpenReview, 2026.' ieee: 'A. Nicolicioiu et al., Panza: Investigating the feasibility of fully-local personalized text generation. OpenReview, 2026.' ista: 'Nicolicioiu A, Iofinova EB, Jovanovic A, Kurtic E, Nikdan M, Panferov A, Markov I, Shavit N, Alistarh D-A. 2026. Panza: Investigating the feasibility of fully-local personalized text generation, OpenReview,p.' mla: 'Nicolicioiu, Armand, et al. “Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation.” Third Conference on Parsimony and Learning (Proceedings Track), 81, OpenReview, 2026.' short: 'A. Nicolicioiu, E.B. Iofinova, A. Jovanovic, E. Kurtic, M. Nikdan, A. Panferov, I. Markov, N. Shavit, D.-A. Alistarh, Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation, OpenReview, 2026.' conference: end_date: 2026-03-26 location: Tübíngen, Germany name: 'CPAL: Conference on Parsimony and Learning' start_date: 2026-03-23 corr_author: '1' date_created: 2026-05-11T08:50:28Z date_published: 2026-03-06T00:00:00Z date_updated: 2026-07-27T12:50:03Z day: '06' department: - _id: GradSch - _id: DaAl keyword: - LLMs - PEFT - LoRA - personalization - efficient ML language: - iso: eng main_file_link: - open_access: '1' url: https://openreview.net/pdf?id=soFWnTqd23 month: '03' oa: 1 oa_version: Accepted Version publication: Third Conference on Parsimony and Learning (Proceedings Track) publication_status: published publisher: OpenReview quality_controlled: '1' related_material: record: - id: '21854' relation: dissertation_contains status: public status: public title: 'Panza: Investigating the feasibility of fully-local personalized text generation' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference_poster user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: repository OA_type: green _id: '21859' abstract: - lang: eng text: As artificial neural networks, and specifically large language models, have improved rapidly in capabilities and quality, they have increasingly been deployed in real-world applications, from customer service to Google search, despite the fact that they frequently make factually incorrect or undesirable statements. This trend has inspired practical and academic interest in model editing, that is, in adjusting the weights of the model to modify its likely outputs for queries relating to a specific fact or set of facts. This may be done either to amend a fact or set of facts, for instance, to fix a frequent error in the training data, or to suppress a fact or set of facts entirely, for instance, in case of dangerous knowledge. Multiple methods have been proposed to do such edits. However, at the same time, it has been shown that such model editing can be brittle and incomplete. Moreover the effectiveness of any model editing method necessarily depends on the data on which the model is trained, and, therefore, a good understanding of the interaction of the training data distribution and the way it is stored in the network is necessary and helpful to reliably perform model editing. However, working with large language models trained on real-world data does not allow us to understand this relationship or fully measure the effects of model editing. We therefore propose Behemoth, a fully synthetic data generation framework. To demonstrate the practical insights from the framework, we explore model editing in the context of simple tabular data, demonstrating surprising findings that, in some cases, echo real-world results, for instance, that in some cases restricting the update rank results in a more effective update. acknowledged_ssus: - _id: ScienComp acknowledgement: "EI thanks Weiwei Yang, Janardhan Kulkani, and Kate Lytvynets for their advice and support in\r\ndeveloping an earlier version of the Behemoth library. This research was supported by the Scientific\r\nService Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp).\r\nEI was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35.\r\n" article_processing_charge: No arxiv: 1 author: - first_name: Eugenia B full_name: Iofinova, Eugenia B id: f9a17499-f6e0-11ea-865d-fdf9a3f77117 last_name: Iofinova orcid: 0000-0002-7778-3221 - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Iofinova EB, Alistarh D-A. Behemoth: Benchmarking unlearning in LLMs using fully synthetic data. arXiv. doi:10.48550/arXiv.2601.23153' apa: 'Iofinova, E. B., & Alistarh, D.-A. (n.d.). Behemoth: Benchmarking unlearning in LLMs using fully synthetic data. arXiv. https://doi.org/10.48550/arXiv.2601.23153' chicago: 'Iofinova, Eugenia B, and Dan-Adrian Alistarh. “Behemoth: Benchmarking Unlearning in LLMs Using Fully Synthetic Data.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2601.23153.' ieee: 'E. B. Iofinova and D.-A. Alistarh, “Behemoth: Benchmarking unlearning in LLMs using fully synthetic data,” arXiv. .' ista: 'Iofinova EB, Alistarh D-A. Behemoth: Benchmarking unlearning in LLMs using fully synthetic data. arXiv, 10.48550/arXiv.2601.23153.' mla: 'Iofinova, Eugenia B., and Dan-Adrian Alistarh. “Behemoth: Benchmarking Unlearning in LLMs Using Fully Synthetic Data.” ArXiv, doi:10.48550/arXiv.2601.23153.' short: E.B. Iofinova, D.-A. Alistarh, ArXiv (n.d.). corr_author: '1' date_created: 2026-05-11T08:58:07Z date_published: 2026-01-30T00:00:00Z date_updated: 2026-07-27T12:50:03Z day: '30' department: - _id: GradSch - _id: DaAl doi: 10.48550/arXiv.2601.23153 external_id: arxiv: - '2601.23153' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2601.23153 month: '01' oa: 1 oa_version: Preprint project: - _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A grant_number: W1260-N35 name: Vienna Graduate School on Computational Optimization publication: arXiv publication_status: draft related_material: record: - id: '21854' relation: dissertation_contains status: public status: public title: 'Behemoth: Benchmarking unlearning in LLMs using fully synthetic data' type: preprint user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '21957' abstract: - lang: eng text: "This thesis investigates algorithmic certification and approximation methods for degenerate semidefinite programs (SDPs) and the singular roots of polynomial systems. In the first part, we present a hybrid symbolic-numeric algorithm for certifying the feasibility of weakly feasible, degenerate SDPs. By reformulating linear matrix inequalities (LMIs) into a structured polynomial system via facial reduction and incidence varieties, we guarantee the existence of an isolated exact solution. This algebraic reduction enables the certification of maximum-rank numerical approximations using methods from algebraic geometry.\r\n\r\nIn the second part, we address the severe ill-conditioning and loss of quadratic convergence that plague standard path-tracking methods near isolated singular roots. To overcome this, we propose tracking algorithms that achieve superlinear convergence without the computational bloat characteristic of classical deflation techniques. By modeling the solution path as a generalized fractional Puiseux series, our approach combines an explicitly derived algebraic predictor with a localized hyperplane desingularization phase during the corrector step. Furthermore, we introduce a continuous path-limit method and an extension of the geometric sequence rule to directly extract exact fractional exponents. This bypasses traditional heuristic trial-and-error methods and explicitly accommodates sparse series expansions. Numerical experiments confirm that our method significantly reduces the cumulative number of matrix inversions while achieving high-accuracy root approximations, even for heavily degenerate systems exhibiting higher coranks." acknowledgement: 'Funding: Vienna Graduate School on Computational Optimization (FWF), grant DOI: 10.55776/W1260.' alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Jeferson full_name: Zapata, Jeferson id: 00223538-AF8F-11E9-A4C7-F729E6697425 last_name: Zapata citation: ama: 'Zapata J. Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames. 2026. doi:10.15479/AT-ISTA-21957' apa: 'Zapata, J. (2026). Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21957' chicago: 'Zapata, Jeferson. “Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21957.' ieee: 'J. Zapata, “Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames,” Institute of Science and Technology Austria, 2026.' ista: 'Zapata J. 2026. Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames. Institute of Science and Technology Austria.' mla: 'Zapata, Jeferson. Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21957.' short: 'J. Zapata, Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames, Institute of Science and Technology Austria, 2026.' corr_author: '1' das_tickbox: '1' date_created: 2026-06-08T13:29:52Z date_published: 2026-06-09T00:00:00Z date_updated: 2026-07-27T14:30:42Z day: '09' ddc: - '500' degree_awarded: PhD department: - _id: GradSch - _id: VlKo doi: 10.15479/AT-ISTA-21957 doi_confirm: '1' file: - access_level: closed checksum: b11a959e99d3dcf61040282b5c837141 content_type: application/zip creator: jzapata date_created: 2026-06-08T13:20:02Z date_updated: 2026-06-08T13:20:02Z file_id: '21958' file_name: istaustriathesis_JZapata.zip file_size: 40811933 relation: source_file - access_level: open_access checksum: edf1e5899b2e31505cd1aa3fe8bd4b7f content_type: application/pdf creator: jzapata date_created: 2026-06-10T13:33:25Z date_updated: 2026-06-10T13:33:25Z file_id: '21992' file_name: 4_Final_Thesis_JZapata_REX.pdf file_size: 2207892 relation: main_file success: 1 file_date_updated: 2026-06-10T13:33:25Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '89' project: - _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A grant_number: W1260-N35 name: Vienna Graduate School on Computational Optimization publication_identifier: isbn: - 978-3-99078-079-4 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '21144' relation: part_of_dissertation status: public status: public supervisor: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov title: 'Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ...