[{"related_material":{"record":[{"status":"public","id":"13057","relation":"research_data"},{"relation":"dissertation_contains","id":"9920","status":"public"},{"id":"17133","status":"public","relation":"dissertation_contains"}]},"publisher":"American Physical Society","article_processing_charge":"No","corr_author":"1","tmp":{"short":"CC BY (4.0)","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)"},"department":[{"_id":"JoFi"},{"_id":"NanoFab"},{"_id":"M-Shop"}],"month":"11","project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385"},{"_id":"2622978C-B435-11E9-9278-68D0E5697425","name":"Hybrid Semiconductor - Superconductor Quantum Devices"},{"grant_number":"F07105","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f","name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits"}],"article_type":"original","volume":2,"author":[{"last_name":"Peruzzo","full_name":"Peruzzo, Matilda","first_name":"Matilda","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3415-4628"},{"orcid":"0000-0001-6937-5773","first_name":"Farid","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","full_name":"Hassani, Farid","last_name":"Hassani"},{"full_name":"Szep, Gregory","last_name":"Szep","first_name":"Gregory"},{"id":"42F71B44-F248-11E8-B48F-1D18A9856A87","first_name":"Andrea","last_name":"Trioni","full_name":"Trioni, Andrea"},{"last_name":"Redchenko","full_name":"Redchenko, Elena","first_name":"Elena","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zemlicka, Martin","last_name":"Zemlicka","orcid":"0009-0005-0878-3032","first_name":"Martin","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fink, Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","orcid":"0000-0001-8112-028X"}],"doi":"10.1103/PRXQuantum.2.040341","oa":1,"acknowledgement":"We thank W. Hughes for analytic and numerical modeling during the early stages of this work, J. Koch for discussions and support with the scqubits package, R. Sett, P. Zielinski, and L. Drmic for software development, and G. Katsaros for equipment support, as well as the MIBA workshop and the Institute of Science and Technology Austria nanofabrication facility. We thank I. Pop, S. Deleglise, and E. Flurin for discussions. This work was supported by a NOMIS Foundation research grant, the Austrian Science Fund (FWF) through BeyondC (F7105), and IST Austria. M.P. is the recipient of a Pöttinger scholarship at IST Austria. E.R. is the recipient of a DOC fellowship of the Austrian Academy of Sciences at IST Austria.","oa_version":"Published Version","title":"Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction","date_created":"2021-08-17T08:14:18Z","keyword":["quantum physics","mesoscale and nanoscale physics"],"arxiv":1,"publication_identifier":{"eissn":["2691-3399"]},"file":[{"file_size":4247422,"date_created":"2022-01-18T11:29:33Z","success":1,"content_type":"application/pdf","access_level":"open_access","file_id":"10641","date_updated":"2022-01-18T11:29:33Z","creator":"cchlebak","relation":"main_file","file_name":"2021_PRXQuantum_Peruzzo.pdf","checksum":"36eb41ea43d8ca22b0efab12419e4eb2"}],"publication_status":"published","scopus_import":"1","issue":"4","ec_funded":1,"page":"040341","status":"public","isi":1,"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"publication":"PRX Quantum","date_updated":"2026-04-15T06:41:46Z","file_date_updated":"2022-01-18T11:29:33Z","date_published":"2021-11-24T00:00:00Z","ddc":["530"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","intvolume":"         2","day":"24","citation":{"ama":"Peruzzo M, Hassani F, Szep G, et al. Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. <i>PRX Quantum</i>. 2021;2(4):040341. doi:<a href=\"https://doi.org/10.1103/PRXQuantum.2.040341\">10.1103/PRXQuantum.2.040341</a>","ista":"Peruzzo M, Hassani F, Szep G, Trioni A, Redchenko E, Zemlicka M, Fink JM. 2021. Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. PRX Quantum. 2(4), 040341.","chicago":"Peruzzo, Matilda, Farid Hassani, Gregory Szep, Andrea Trioni, Elena Redchenko, Martin Zemlicka, and Johannes M Fink. “Geometric Superinductance Qubits: Controlling Phase Delocalization across a Single Josephson Junction.” <i>PRX Quantum</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PRXQuantum.2.040341\">https://doi.org/10.1103/PRXQuantum.2.040341</a>.","mla":"Peruzzo, Matilda, et al. “Geometric Superinductance Qubits: Controlling Phase Delocalization across a Single Josephson Junction.” <i>PRX Quantum</i>, vol. 2, no. 4, American Physical Society, 2021, p. 040341, doi:<a href=\"https://doi.org/10.1103/PRXQuantum.2.040341\">10.1103/PRXQuantum.2.040341</a>.","short":"M. Peruzzo, F. Hassani, G. Szep, A. Trioni, E. Redchenko, M. Zemlicka, J.M. Fink, PRX Quantum 2 (2021) 040341.","ieee":"M. Peruzzo <i>et al.</i>, “Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction,” <i>PRX Quantum</i>, vol. 2, no. 4. American Physical Society, p. 040341, 2021.","apa":"Peruzzo, M., Hassani, F., Szep, G., Trioni, A., Redchenko, E., Zemlicka, M., &#38; Fink, J. M. (2021). Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. <i>PRX Quantum</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PRXQuantum.2.040341\">https://doi.org/10.1103/PRXQuantum.2.040341</a>"},"has_accepted_license":"1","quality_controlled":"1","type":"journal_article","external_id":{"isi":["000723015100001"],"arxiv":["2106.05882"]},"_id":"9928","abstract":[{"lang":"eng","text":"There are two elementary superconducting qubit types that derive directly from the quantum harmonic oscillator. In one, the inductor is replaced by a nonlinear Josephson junction to realize the widely used charge qubits with a compact phase variable and a discrete charge wave function. In the other, the junction is added in parallel, which gives rise to an extended phase variable, continuous wave functions, and a rich energy-level structure due to the loop topology. While the corresponding rf superconducting quantum interference device Hamiltonian was introduced as a quadratic quasi-one-dimensional potential approximation to describe the fluxonium qubit implemented with long Josephson-junction arrays, in this work we implement it directly using a linear superinductor formed by a single uninterrupted aluminum wire. We present a large variety of qubits, all stemming from the same circuit but with drastically different characteristic energy scales. This includes flux and fluxonium qubits but also the recently introduced quasicharge qubit with strongly enhanced zero-point phase fluctuations and a heavily suppressed flux dispersion. The use of a geometric inductor results in high reproducibility of the inductive energy as guaranteed by top-down lithography—a key ingredient for intrinsically protected superconducting qubits."}],"language":[{"iso":"eng"}]},{"month":"10","department":[{"_id":"JoFi"}],"date_updated":"2026-04-15T06:41:45Z","author":[{"full_name":"Peruzzo, Matilda","last_name":"Peruzzo","first_name":"Matilda","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3415-4628"},{"id":"2AED110C-F248-11E8-B48F-1D18A9856A87","first_name":"Farid","orcid":"0000-0001-6937-5773","full_name":"Hassani, Farid","last_name":"Hassani"},{"first_name":"Grisha","full_name":"Szep, Grisha","last_name":"Szep"},{"first_name":"Andrea","id":"42F71B44-F248-11E8-B48F-1D18A9856A87","full_name":"Trioni, Andrea","last_name":"Trioni"},{"first_name":"Elena","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","full_name":"Redchenko, Elena","last_name":"Redchenko"},{"first_name":"Martin","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0005-0878-3032","full_name":"Zemlicka, Martin","last_name":"Zemlicka"},{"first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","last_name":"Fink","full_name":"Fink, Johannes M"}],"oa":1,"doi":"10.5281/ZENODO.5592103","related_material":{"record":[{"id":"9928","status":"public","relation":"used_in_publication"}]},"publisher":"Zenodo","status":"public","corr_author":"1","tmp":{"short":"CC BY (4.0)","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)"},"article_processing_charge":"No","day":"22","citation":{"chicago":"Peruzzo, Matilda, Farid Hassani, Grisha Szep, Andrea Trioni, Elena Redchenko, Martin Zemlicka, and Johannes M Fink. “Geometric Superinductance Qubits: Controlling Phase Delocalization across a Single Josephson Junction.” Zenodo, 2021. <a href=\"https://doi.org/10.5281/ZENODO.5592103\">https://doi.org/10.5281/ZENODO.5592103</a>.","ama":"Peruzzo M, Hassani F, Szep G, et al. Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. 2021. doi:<a href=\"https://doi.org/10.5281/ZENODO.5592103\">10.5281/ZENODO.5592103</a>","ista":"Peruzzo M, Hassani F, Szep G, Trioni A, Redchenko E, Zemlicka M, Fink JM. 2021. Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.5592103\">10.5281/ZENODO.5592103</a>.","apa":"Peruzzo, M., Hassani, F., Szep, G., Trioni, A., Redchenko, E., Zemlicka, M., &#38; Fink, J. M. (2021). Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.5592103\">https://doi.org/10.5281/ZENODO.5592103</a>","mla":"Peruzzo, Matilda, et al. <i>Geometric Superinductance Qubits: Controlling Phase Delocalization across a Single Josephson Junction</i>. Zenodo, 2021, doi:<a href=\"https://doi.org/10.5281/ZENODO.5592103\">10.5281/ZENODO.5592103</a>.","ieee":"M. Peruzzo <i>et al.</i>, “Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction.” Zenodo, 2021.","short":"M. Peruzzo, F. Hassani, G. Szep, A. Trioni, E. Redchenko, M. Zemlicka, J.M. Fink, (2021)."},"type":"research_data_reference","abstract":[{"text":"This dataset comprises all data shown in the figures of the submitted article \"Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction\". Additional raw data are available from the corresponding author on reasonable request.","lang":"eng"}],"_id":"13057","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.5592104"}],"date_published":"2021-10-22T00:00:00Z","title":"Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction","date_created":"2023-05-23T13:42:27Z","year":"2021","ddc":["530"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"supervisor":[{"full_name":"Fink, Johannes M","last_name":"Fink","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X"}],"publication_status":"published","file":[{"date_updated":"2021-09-06T08:39:47Z","file_id":"9924","relation":"source_file","creator":"mperuzzo","checksum":"3cd1986efde5121d7581f6fcf9090da8","file_name":"GeometricSuperinductorsForCQED.zip","content_type":"application/x-zip-compressed","date_created":"2021-08-16T09:33:21Z","file_size":151387283,"access_level":"closed"},{"date_updated":"2021-09-06T08:39:47Z","creator":"mperuzzo","relation":"main_file","file_id":"9939","file_name":"GeometricSuperinductorsAndTheirApplicationsIncQED-1b.pdf","checksum":"50928c621cdf0775d7a5906b9dc8602c","date_created":"2021-08-18T14:20:06Z","file_size":17596344,"content_type":"application/pdf","access_level":"open_access"},{"access_level":"closed","description":"Extra copy of the thesis as PDF/A-2b","content_type":"application/pdf","date_created":"2021-08-18T14:20:09Z","file_size":17592425,"checksum":"37f486aa1b622fe44af00d627ec13f6c","file_name":"GeometricSuperinductorsAndTheirApplicationsIncQED-2b.pdf","creator":"mperuzzo","relation":"other","file_id":"9940","date_updated":"2021-09-06T08:39:47Z"}],"keyword":["quantum computing","superinductor","quantum metrology"],"publication_identifier":{"isbn":["978-3-99078-013-8"],"issn":["2663-337X"]},"alternative_title":["ISTA Thesis"],"title":"Geometric superinductors and their applications in circuit quantum electrodynamics","date_created":"2021-08-16T09:44:09Z","oa_version":"Published Version","oa":1,"doi":"10.15479/at:ista:9920","degree_awarded":"PhD","author":[{"orcid":"0000-0002-3415-4628","first_name":"Matilda","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","full_name":"Peruzzo, Matilda","last_name":"Peruzzo"}],"department":[{"_id":"GradSch"},{"_id":"JoFi"}],"month":"08","article_processing_charge":"No","corr_author":"1","publisher":"Institute of Science and Technology Austria","related_material":{"record":[{"relation":"part_of_dissertation","id":"9928","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"8755"}]},"language":[{"iso":"eng"}],"_id":"9920","abstract":[{"lang":"eng","text":"This work is concerned with two fascinating circuit quantum electrodynamics components, the Josephson junction and the geometric superinductor, and the interesting experiments that can be done by combining the two. The Josephson junction has revolutionized the field of superconducting circuits as a non-linear dissipation-less circuit element and is used in almost all superconducting qubit implementations since the 90s. On the other hand, the superinductor is a relatively new circuit element introduced as a key component of the fluxonium qubit in 2009. This is an inductor with characteristic impedance larger than the resistance quantum and self-resonance frequency in the GHz regime. The combination of these two elements can occur in two fundamental ways: in parallel and in series. When connected in parallel the two create the fluxonium qubit, a loop with large inductance and a rich energy spectrum reliant on quantum tunneling. On the other hand placing the two elements in series aids with the measurement of the IV curve of a single Josephson junction in a high impedance environment. In this limit theory predicts that the junction will behave as its dual element: the phase-slip junction. While the Josephson junction acts as a non-linear inductor the phase-slip junction has the behavior of a non-linear capacitance and can be used to measure new Josephson junction phenomena, namely Coulomb blockade of Cooper pairs and phase-locked Bloch oscillations. The latter experiment allows for a direct link between frequency and current which is an elusive connection in quantum metrology. This work introduces the geometric superinductor, a superconducting circuit element where the high inductance is due to the geometry rather than the material properties of the superconductor, realized from a highly miniaturized superconducting planar coil. These structures will be described and characterized as resonators and qubit inductors and progress towards the measurement of phase-locked Bloch oscillations will be presented."}],"type":"dissertation","day":"19","citation":{"apa":"Peruzzo, M. (2021). <i>Geometric superinductors and their applications in circuit quantum electrodynamics</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:9920\">https://doi.org/10.15479/at:ista:9920</a>","mla":"Peruzzo, Matilda. <i>Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:9920\">10.15479/at:ista:9920</a>.","ieee":"M. Peruzzo, “Geometric superinductors and their applications in circuit quantum electrodynamics,” Institute of Science and Technology Austria, 2021.","short":"M. Peruzzo, Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics, Institute of Science and Technology Austria, 2021.","chicago":"Peruzzo, Matilda. “Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:9920\">https://doi.org/10.15479/at:ista:9920</a>.","ama":"Peruzzo M. Geometric superinductors and their applications in circuit quantum electrodynamics. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:9920\">10.15479/at:ista:9920</a>","ista":"Peruzzo M. 2021. Geometric superinductors and their applications in circuit quantum electrodynamics. Institute of Science and Technology Austria."},"has_accepted_license":"1","ddc":["539"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2021","OA_place":"publisher","date_published":"2021-08-19T00:00:00Z","file_date_updated":"2021-09-06T08:39:47Z","date_updated":"2026-04-15T06:43:02Z","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"page":"149","status":"public"},{"issue":"4","scopus_import":"1","status":"public","publication":"ACM Transactions on Graphics","date_updated":"2026-04-16T08:19:58Z","isi":1,"file_date_updated":"2021-08-09T11:41:50Z","date_published":"2021-08-01T00:00:00Z","article_number":"44","intvolume":"        40","year":"2021","ddc":["000"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","has_accepted_license":"1","day":"01","citation":{"apa":"Mallikarjun, B. R., Tewari, A., Dib, A., Weyrich, T., Bickel, B., Seidel, H. P., … Theobalt, C. (2021). PhotoApp: Photorealistic appearance editing of head portraits. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3450626.3459765\">https://doi.org/10.1145/3450626.3459765</a>","ieee":"B. R. Mallikarjun <i>et al.</i>, “PhotoApp: Photorealistic appearance editing of head portraits,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4. Association for Computing Machinery, 2021.","short":"B.R. Mallikarjun, A. Tewari, A. Dib, T. Weyrich, B. Bickel, H.P. Seidel, H. Pfister, W. Matusik, L. Chevallier, M.A. Elgharib, C. Theobalt, ACM Transactions on Graphics 40 (2021).","mla":"Mallikarjun, B. R., et al. “PhotoApp: Photorealistic Appearance Editing of Head Portraits.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, 44, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3450626.3459765\">10.1145/3450626.3459765</a>.","chicago":"Mallikarjun, B. R., Ayush Tewari, Abdallah Dib, Tim Weyrich, Bernd Bickel, Hans Peter Seidel, Hanspeter Pfister, et al. “PhotoApp: Photorealistic Appearance Editing of Head Portraits.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3450626.3459765\">https://doi.org/10.1145/3450626.3459765</a>.","ista":"Mallikarjun BR, Tewari A, Dib A, Weyrich T, Bickel B, Seidel HP, Pfister H, Matusik W, Chevallier L, Elgharib MA, Theobalt C. 2021. PhotoApp: Photorealistic appearance editing of head portraits. ACM Transactions on Graphics. 40(4), 44.","ama":"Mallikarjun BR, Tewari A, Dib A, et al. PhotoApp: Photorealistic appearance editing of head portraits. <i>ACM Transactions on Graphics</i>. 2021;40(4). doi:<a href=\"https://doi.org/10.1145/3450626.3459765\">10.1145/3450626.3459765</a>"},"_id":"9819","language":[{"iso":"eng"}],"abstract":[{"text":"Photorealistic editing of head portraits is a challenging task as humans are very sensitive to inconsistencies in faces. We present an approach for high-quality intuitive editing of the camera viewpoint and scene illumination (parameterised with an environment map) in a portrait image. This requires our method to capture and control the full reflectance field of the person in the image. Most editing approaches rely on supervised learning using training data captured with setups such as light and camera stages. Such datasets are expensive to acquire, not readily available and do not capture all the rich variations of in-the-wild portrait images. In addition, most supervised approaches only focus on relighting, and do not allow camera viewpoint editing. Thus, they only capture and control a subset of the reflectance field. Recently, portrait editing has been demonstrated by operating in the generative model space of StyleGAN. While such approaches do not require direct supervision, there is a significant loss of quality when compared to the supervised approaches. In this paper, we present a method which learns from limited supervised training data. The training images only include people in a fixed neutral expression with eyes closed, without much hair or background variations. Each person is captured under 150 one-light-at-a-time conditions and under 8 camera poses. Instead of training directly in the image space, we design a supervised problem which learns transformations in the latent space of StyleGAN. This combines the best of supervised learning and generative adversarial modeling. We show that the StyleGAN prior allows for generalisation to different expressions, hairstyles and backgrounds. This produces high-quality photorealistic results for in-the-wild images and significantly outperforms existing methods. Our approach can edit the illumination and pose simultaneously, and runs at interactive rates.","lang":"eng"}],"external_id":{"isi":["000674930900011"],"arxiv":["2103.07658"]},"type":"journal_article","quality_controlled":"1","tmp":{"short":"CC BY (4.0)","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)"},"article_processing_charge":"Yes (in subscription journal)","publisher":"Association for Computing Machinery","author":[{"last_name":"Mallikarjun","full_name":"Mallikarjun, B. R.","first_name":"B. R."},{"full_name":"Tewari, Ayush","last_name":"Tewari","first_name":"Ayush"},{"last_name":"Dib","full_name":"Dib, Abdallah","first_name":"Abdallah"},{"first_name":"Tim","full_name":"Weyrich, Tim","last_name":"Weyrich"},{"full_name":"Bickel, Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385"},{"first_name":"Hans Peter","last_name":"Seidel","full_name":"Seidel, Hans Peter"},{"first_name":"Hanspeter","full_name":"Pfister, Hanspeter","last_name":"Pfister"},{"first_name":"Wojciech","last_name":"Matusik","full_name":"Matusik, Wojciech"},{"last_name":"Chevallier","full_name":"Chevallier, Louis","first_name":"Louis"},{"last_name":"Elgharib","full_name":"Elgharib, Mohamed A.","first_name":"Mohamed A."},{"full_name":"Theobalt, Christian","last_name":"Theobalt","first_name":"Christian"}],"volume":40,"article_type":"original","department":[{"_id":"BeBi"}],"month":"08","acknowledgement":"This work was supported by the ERC Consolidator Grant 4DReply (770784). We also acknowledge support from Technicolor and InterDigital. We thank Tiancheng Sun for kindly helping us with the comparisons with Sun et al. [2019].","doi":"10.1145/3450626.3459765","oa":1,"date_created":"2021-08-08T22:01:27Z","title":"PhotoApp: Photorealistic appearance editing of head portraits","oa_version":"Published Version","arxiv":1,"publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"file":[{"success":1,"content_type":"application/pdf","date_created":"2021-08-09T11:41:50Z","file_size":49840741,"access_level":"open_access","relation":"main_file","date_updated":"2021-08-09T11:41:50Z","creator":"asandaue","file_id":"9834","checksum":"51b61b7e5c175e2d7ed8fa3b35f7525a","file_name":"2021_ACMTransactionsOnGraphics_Mallikarjun.pdf"}],"publication_status":"published"},{"pmid":1,"related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/dancing-molecules-and-two-dimensional-particles/"}],"record":[{"id":"12390","status":"public","relation":"dissertation_contains"}]},"article_processing_charge":"No","publisher":"American Physical Society","volume":126,"author":[{"orcid":"0000-0002-6249-0928","first_name":"Morris","id":"B7ECF9FC-AA38-11E9-AC9A-0930E6697425","full_name":"Brooks, Morris","last_name":"Brooks"},{"last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","orcid":"0000-0002-6990-7802"},{"first_name":"D.","last_name":"Lundholm","full_name":"Lundholm, D."},{"full_name":"Yakaboylu, Enderalp","last_name":"Yakaboylu","orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","first_name":"Enderalp"}],"project":[{"name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770","call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425"}],"article_type":"original","month":"01","department":[{"_id":"MiLe"},{"_id":"RoSe"}],"acknowledgement":"We are grateful to A. Ghazaryan for valuable discussions and also thank the anonymous referees for comments. D.L. acknowledges financial support from the G¨oran Gustafsson Foundation (grant no. 1804) and LMU Munich. M.L. gratefully acknowledges financial support\r\nby the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreements No 801770).","doi":"10.1103/PhysRevLett.126.015301","oa":1,"date_created":"2021-01-17T23:01:10Z","title":"Molecular impurities as a realization of anyons on the two-sphere","oa_version":"Preprint","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"arxiv":1,"publication_status":"published","ec_funded":1,"issue":"1","scopus_import":"1","status":"public","date_updated":"2026-04-16T08:20:53Z","publication":"Physical Review Letters","isi":1,"date_published":"2021-01-08T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2009.05948"}],"intvolume":"       126","article_number":"015301","year":"2021","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"short":"M. Brooks, M. Lemeshko, D. Lundholm, E. Yakaboylu, Physical Review Letters 126 (2021).","ieee":"M. Brooks, M. Lemeshko, D. Lundholm, and E. Yakaboylu, “Molecular impurities as a realization of anyons on the two-sphere,” <i>Physical Review Letters</i>, vol. 126, no. 1. American Physical Society, 2021.","mla":"Brooks, Morris, et al. “Molecular Impurities as a Realization of Anyons on the Two-Sphere.” <i>Physical Review Letters</i>, vol. 126, no. 1, 015301, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.126.015301\">10.1103/PhysRevLett.126.015301</a>.","apa":"Brooks, M., Lemeshko, M., Lundholm, D., &#38; Yakaboylu, E. (2021). Molecular impurities as a realization of anyons on the two-sphere. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.126.015301\">https://doi.org/10.1103/PhysRevLett.126.015301</a>","ista":"Brooks M, Lemeshko M, Lundholm D, Yakaboylu E. 2021. Molecular impurities as a realization of anyons on the two-sphere. Physical Review Letters. 126(1), 015301.","ama":"Brooks M, Lemeshko M, Lundholm D, Yakaboylu E. Molecular impurities as a realization of anyons on the two-sphere. <i>Physical Review Letters</i>. 2021;126(1). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.126.015301\">10.1103/PhysRevLett.126.015301</a>","chicago":"Brooks, Morris, Mikhail Lemeshko, D. Lundholm, and Enderalp Yakaboylu. “Molecular Impurities as a Realization of Anyons on the Two-Sphere.” <i>Physical Review Letters</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevLett.126.015301\">https://doi.org/10.1103/PhysRevLett.126.015301</a>."},"day":"08","_id":"9005","language":[{"iso":"eng"}],"abstract":[{"text":"Studies on the experimental realization of two-dimensional anyons in terms of quasiparticles have been restricted, so far, to only anyons on the plane. It is known, however, that the geometry and topology of space can have significant effects on quantum statistics for particles moving on it. Here, we have undertaken the first step toward realizing the emerging fractional statistics for particles restricted to move on the sphere instead of on the plane. We show that such a model arises naturally in the context of quantum impurity problems. In particular, we demonstrate a setup in which the lowest-energy spectrum of two linear bosonic or fermionic molecules immersed in a quantum many-particle environment can coincide with the anyonic spectrum on the sphere. This paves the way toward the experimental realization of anyons on the sphere using molecular impurities. Furthermore, since a change in the alignment of the molecules corresponds to the exchange of the particles on the sphere, such a realization reveals a novel type of exclusion principle for molecular impurities, which could also be of use as a powerful technique to measure the statistics parameter. Finally, our approach opens up a simple numerical route to investigate the spectra of many anyons on the sphere. Accordingly, we present the spectrum of two anyons on the sphere in the presence of a Dirac monopole field.","lang":"eng"}],"external_id":{"isi":["000606325000003"],"pmid":["33480760"],"arxiv":["2009.05948"]},"type":"journal_article","quality_controlled":"1"},{"date_published":"2021-06-01T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ddc":["570"],"year":"2021","intvolume":"        30","citation":{"ista":"Berdan EL, Blanckaert A, Slotte T, Suh A, Westram AM, Fragata I. 2021. Unboxing mutations: Connecting mutation types with evolutionary consequences. Molecular Ecology. 30(12), 2710–2723.","ama":"Berdan EL, Blanckaert A, Slotte T, Suh A, Westram AM, Fragata I. Unboxing mutations: Connecting mutation types with evolutionary consequences. <i>Molecular Ecology</i>. 2021;30(12):2710-2723. doi:<a href=\"https://doi.org/10.1111/mec.15936\">10.1111/mec.15936</a>","chicago":"Berdan, Emma L., Alexandre Blanckaert, Tanja Slotte, Alexander Suh, Anja M Westram, and Inês Fragata. “Unboxing Mutations: Connecting Mutation Types with Evolutionary Consequences.” <i>Molecular Ecology</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/mec.15936\">https://doi.org/10.1111/mec.15936</a>.","short":"E.L. Berdan, A. Blanckaert, T. Slotte, A. Suh, A.M. Westram, I. Fragata, Molecular Ecology 30 (2021) 2710–2723.","ieee":"E. L. Berdan, A. Blanckaert, T. Slotte, A. Suh, A. M. Westram, and I. Fragata, “Unboxing mutations: Connecting mutation types with evolutionary consequences,” <i>Molecular Ecology</i>, vol. 30, no. 12. Wiley, pp. 2710–2723, 2021.","mla":"Berdan, Emma L., et al. “Unboxing Mutations: Connecting Mutation Types with Evolutionary Consequences.” <i>Molecular Ecology</i>, vol. 30, no. 12, Wiley, 2021, pp. 2710–23, doi:<a href=\"https://doi.org/10.1111/mec.15936\">10.1111/mec.15936</a>.","apa":"Berdan, E. L., Blanckaert, A., Slotte, T., Suh, A., Westram, A. M., &#38; Fragata, I. (2021). Unboxing mutations: Connecting mutation types with evolutionary consequences. <i>Molecular Ecology</i>. Wiley. <a href=\"https://doi.org/10.1111/mec.15936\">https://doi.org/10.1111/mec.15936</a>"},"day":"01","has_accepted_license":"1","quality_controlled":"1","type":"journal_article","external_id":{"isi":["000652056400001"]},"language":[{"iso":"eng"}],"_id":"9470","abstract":[{"lang":"eng","text":"A key step in understanding the genetic basis of different evolutionary outcomes (e.g., adaptation) is to determine the roles played by different mutation types (e.g., SNPs, translocations and inversions). To do this we must simultaneously consider different mutation types in an evolutionary framework. Here, we propose a research framework that directly utilizes the most important characteristics of mutations, their population genetic effects, to determine their relative evolutionary significance in a given scenario. We review known population genetic effects of different mutation types and show how these may be connected to different evolutionary outcomes. We provide examples of how to implement this framework and pinpoint areas where more data, theory and synthesis are needed. Linking experimental and theoretical approaches to examine different mutation types simultaneously is a critical step towards understanding their evolutionary significance."}],"scopus_import":"1","ec_funded":1,"issue":"12","page":"2710-2723","status":"public","isi":1,"date_updated":"2026-04-16T08:19:26Z","publication":"Molecular Ecology","file_date_updated":"2021-06-11T15:34:53Z","oa_version":"Published Version","title":"Unboxing mutations: Connecting mutation types with evolutionary consequences","date_created":"2021-06-06T22:01:31Z","publication_identifier":{"eissn":["1365-294X"],"issn":["0962-1083"]},"file":[{"access_level":"open_access","date_created":"2021-06-11T15:34:53Z","file_size":1031978,"content_type":"application/pdf","success":1,"file_name":"2021_MolecularEcology_Berdan.pdf","checksum":"e6f4731365bde2614b333040a08265d8","date_updated":"2021-06-11T15:34:53Z","relation":"main_file","creator":"kschuh","file_id":"9545"}],"publication_status":"published","publisher":"Wiley","article_processing_charge":"No","tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"department":[{"_id":"NiBa"}],"month":"06","project":[{"name":"Theoretical and empirical approaches to understanding Parallel Adaptation","_id":"265B41B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"797747"}],"author":[{"last_name":"Berdan","full_name":"Berdan, Emma L.","first_name":"Emma L."},{"full_name":"Blanckaert, Alexandre","last_name":"Blanckaert","first_name":"Alexandre"},{"last_name":"Slotte","full_name":"Slotte, Tanja","first_name":"Tanja"},{"first_name":"Alexander","full_name":"Suh, Alexander","last_name":"Suh"},{"orcid":"0000-0003-1050-4969","first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","full_name":"Westram, Anja M","last_name":"Westram"},{"first_name":"Inês","full_name":"Fragata, Inês","last_name":"Fragata"}],"volume":30,"oa":1,"doi":"10.1111/mec.15936","acknowledgement":"We thank the editor, two helpful reviewers, Roger Butlin, Kerstin Johannesson, Valentina Peona, Rike Stelkens, Julie Blommaert, Nick Barton, and João Alpedrinha for helpful comments that improved the manuscript. The authors acknowledge funding from the Swedish Research Council Formas (2017-01597 to AS), the Swedish Research Council Vetenskapsrådet (2016-05139 to AS, 2019-04452 to TS) and from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 757451 to TS). ELB was funded by a Carl Tryggers grant awarded to Tanja Slotte. Anja M. Westram was funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 797747. Inês Fragata was funded by a Junior Researcher contract from FCT (CEECIND/02616/2018)."},{"scopus_import":"1","issue":"4","status":"public","isi":1,"date_updated":"2026-04-16T08:20:28Z","publication":"ACM Transactions on Graphics","main_file_link":[{"open_access":"1","url":"https://zaguan.unizar.es/record/110704/files/texto_completo.pdf"}],"date_published":"2021-08-01T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2021","article_number":"125","intvolume":"        40","day":"01","citation":{"chicago":"Serrano, Ana, Bin Chen, Chao Wang, Michael Piovarci, Hans Peter Seidel, Piotr Didyk, and Karol Myszkowski. “The Effect of Shape and Illumination on Material Perception: Model and Applications.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3450626.3459813\">https://doi.org/10.1145/3450626.3459813</a>.","ama":"Serrano A, Chen B, Wang C, et al. The effect of shape and illumination on material perception: Model and applications. <i>ACM Transactions on Graphics</i>. 2021;40(4). doi:<a href=\"https://doi.org/10.1145/3450626.3459813\">10.1145/3450626.3459813</a>","ista":"Serrano A, Chen B, Wang C, Piovarci M, Seidel HP, Didyk P, Myszkowski K. 2021. The effect of shape and illumination on material perception: Model and applications. ACM Transactions on Graphics. 40(4), 125.","apa":"Serrano, A., Chen, B., Wang, C., Piovarci, M., Seidel, H. P., Didyk, P., &#38; Myszkowski, K. (2021). The effect of shape and illumination on material perception: Model and applications. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3450626.3459813\">https://doi.org/10.1145/3450626.3459813</a>","mla":"Serrano, Ana, et al. “The Effect of Shape and Illumination on Material Perception: Model and Applications.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, 125, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3450626.3459813\">10.1145/3450626.3459813</a>.","short":"A. Serrano, B. Chen, C. Wang, M. Piovarci, H.P. Seidel, P. Didyk, K. Myszkowski, ACM Transactions on Graphics 40 (2021).","ieee":"A. Serrano <i>et al.</i>, “The effect of shape and illumination on material perception: Model and applications,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4. Association for Computing Machinery, 2021."},"quality_controlled":"1","type":"journal_article","external_id":{"isi":["000674930900090"]},"abstract":[{"text":"Material appearance hinges on material reflectance properties but also surface geometry and illumination. The unlimited number of potential combinations between these factors makes understanding and predicting material appearance a very challenging task. In this work, we collect a large-scale dataset of perceptual ratings of appearance attributes with more than 215,680 responses for 42,120 distinct combinations of material, shape, and illumination. The goal of this dataset is twofold. First, we analyze for the first time the effects of illumination and geometry in material perception across such a large collection of varied appearances. We connect our findings to those of the literature, discussing how previous knowledge generalizes across very diverse materials, shapes, and illuminations. Second, we use the collected dataset to train a deep learning architecture for predicting perceptual attributes that correlate with human judgments. We demonstrate the consistent and robust behavior of our predictor in various challenging scenarios, which, for the first time, enables estimating perceived material attributes from general 2D images. Since our predictor relies on the final appearance in an image, it can compare appearance properties across different geometries and illumination conditions. Finally, we demonstrate several applications that use our predictor, including appearance reproduction using 3D printing, BRDF editing by integrating our predictor in a differentiable renderer, illumination design, or material recommendations for scene design.","lang":"eng"}],"_id":"9820","language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery","article_processing_charge":"No","department":[{"_id":"BeBi"}],"month":"08","article_type":"original","volume":40,"author":[{"full_name":"Serrano, Ana","last_name":"Serrano","first_name":"Ana"},{"last_name":"Chen","full_name":"Chen, Bin","first_name":"Bin"},{"full_name":"Wang, Chao","last_name":"Wang","first_name":"Chao"},{"orcid":"0000-0002-5062-4474","first_name":"Michael","id":"62E473F4-5C99-11EA-A40E-AF823DDC885E","last_name":"Piovarci","full_name":"Piovarci, Michael"},{"first_name":"Hans Peter","last_name":"Seidel","full_name":"Seidel, Hans Peter"},{"last_name":"Didyk","full_name":"Didyk, Piotr","first_name":"Piotr"},{"last_name":"Myszkowski","full_name":"Myszkowski, Karol","first_name":"Karol"}],"oa":1,"doi":"10.1145/3450626.3459813","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie, grant agreement Nº 765911 (RealVision) and from the European Research Council (ERC), grant agreement Nº 804226 (PERDY).","oa_version":"Submitted Version","date_created":"2021-08-08T22:01:28Z","title":"The effect of shape and illumination on material perception: Model and applications","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"publication_status":"published"},{"publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"title":"Mechanics-aware deformation of yarn pattern geometry","date_created":"2021-08-08T22:01:27Z","oa_version":"Published Version","publication_status":"published","article_processing_charge":"Yes (in subscription journal)","publisher":"Association for Computing Machinery","related_material":{"record":[{"id":"9327","status":"public","relation":"software"},{"id":"12358","status":"public","relation":"dissertation_contains"}],"link":[{"url":"https://ist.ac.at/en/news/knitting-virtual-yarn/","relation":"press_release","description":"News on IST Webpage"}]},"oa":1,"doi":"10.1145/3450626.3459816","acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback. We also thank Seddi Labs for providing the garment model with fold-over seams.\r\nThis research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific\r\nComputing. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 638176. Rahul Narain is supported by a Pankaj Gupta Young Faculty Fellowship and a gift from Adobe Inc.","author":[{"last_name":"Sperl","full_name":"Sperl, Georg","id":"4DD40360-F248-11E8-B48F-1D18A9856A87","first_name":"Georg"},{"full_name":"Narain, Rahul","last_name":"Narain","first_name":"Rahul"},{"orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","full_name":"Wojtan, Christopher J","last_name":"Wojtan"}],"volume":40,"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"month":"08","project":[{"name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"article_type":"original","intvolume":"        40","article_number":"168","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2021","date_published":"2021-08-01T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.1145/3450626.3459816","open_access":"1"}],"external_id":{"isi":["000674930900132"]},"abstract":[{"lang":"eng","text":"Triangle mesh-based simulations are able to produce satisfying animations of knitted and woven cloth; however, they lack the rich geometric detail of yarn-level simulations. Naive texturing approaches do not consider yarn-level physics, while full yarn-level simulations may become prohibitively expensive for large garments. We propose a method to animate yarn-level cloth geometry on top of an underlying deforming mesh in a mechanics-aware fashion. Using triangle strains to interpolate precomputed yarn geometry, we are able to reproduce effects such as knit loops tightening under stretching. In combination with precomputed mesh animation or real-time mesh simulation, our method is able to animate yarn-level cloth in real-time at large scales."}],"_id":"9818","language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","citation":{"apa":"Sperl, G., Narain, R., &#38; Wojtan, C. (2021). Mechanics-aware deformation of yarn pattern geometry. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3450626.3459816\">https://doi.org/10.1145/3450626.3459816</a>","ieee":"G. Sperl, R. Narain, and C. Wojtan, “Mechanics-aware deformation of yarn pattern geometry,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4. Association for Computing Machinery, 2021.","short":"G. Sperl, R. Narain, C. Wojtan, ACM Transactions on Graphics 40 (2021).","mla":"Sperl, Georg, et al. “Mechanics-Aware Deformation of Yarn Pattern Geometry.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, 168, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3450626.3459816\">10.1145/3450626.3459816</a>.","chicago":"Sperl, Georg, Rahul Narain, and Chris Wojtan. “Mechanics-Aware Deformation of Yarn Pattern Geometry.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3450626.3459816\">https://doi.org/10.1145/3450626.3459816</a>.","ista":"Sperl G, Narain R, Wojtan C. 2021. Mechanics-aware deformation of yarn pattern geometry. ACM Transactions on Graphics. 40(4), 168.","ama":"Sperl G, Narain R, Wojtan C. Mechanics-aware deformation of yarn pattern geometry. <i>ACM Transactions on Graphics</i>. 2021;40(4). doi:<a href=\"https://doi.org/10.1145/3450626.3459816\">10.1145/3450626.3459816</a>"},"day":"01","status":"public","ec_funded":1,"issue":"4","scopus_import":"1","date_updated":"2026-04-16T08:21:26Z","publication":"ACM Transactions on Graphics","isi":1,"acknowledged_ssus":[{"_id":"ScienComp"}]},{"tmp":{"name":"The MIT License","legal_code_url":"https://opensource.org/licenses/MIT","short":"MIT"},"publisher":"IST Austria","status":"public","license":"https://opensource.org/licenses/MIT","gitlab_url":"https://git.ist.ac.at/gsperl/MADYPG","related_material":{"record":[{"id":"9818","status":"public","relation":"used_for_analysis_in"}]},"oa":1,"doi":"10.15479/AT:ISTA:9327","file_date_updated":"2021-04-26T09:33:44Z","date_updated":"2026-04-16T08:21:25Z","author":[{"full_name":"Sperl, Georg","last_name":"Sperl","first_name":"Georg","id":"4DD40360-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Narain","full_name":"Narain, Rahul","first_name":"Rahul"},{"first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","last_name":"Wojtan"}],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"month":"05","year":"2021","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","ddc":["005"],"date_published":"2021-05-01T00:00:00Z","title":"Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data)","date_created":"2021-04-16T14:26:19Z","_id":"9327","abstract":[{"lang":"eng","text":"This archive contains the missing sweater mesh animations and displacement models for the code of \"Mechanics-Aware Deformation of Yarn Pattern Geometry\"\r\n\r\nCode Repository: https://git.ist.ac.at/gsperl/MADYPG"}],"gitlab_commit_id":"6a77e7e22769230ae5f5edaa090fb4b828e57573","type":"software","has_accepted_license":"1","citation":{"apa":"Sperl, G., Narain, R., &#38; Wojtan, C. (2021). Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data). IST Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9327\">https://doi.org/10.15479/AT:ISTA:9327</a>","ieee":"G. Sperl, R. Narain, and C. Wojtan, “Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data).” IST Austria, 2021.","short":"G. Sperl, R. Narain, C. Wojtan, (2021).","mla":"Sperl, Georg, et al. <i>Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data)</i>. IST Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9327\">10.15479/AT:ISTA:9327</a>.","chicago":"Sperl, Georg, Rahul Narain, and Chris Wojtan. “Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data).” IST Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9327\">https://doi.org/10.15479/AT:ISTA:9327</a>.","ista":"Sperl G, Narain R, Wojtan C. 2021. Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data), IST Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:9327\">10.15479/AT:ISTA:9327</a>.","ama":"Sperl G, Narain R, Wojtan C. Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data). 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9327\">10.15479/AT:ISTA:9327</a>"},"file":[{"file_id":"9328","relation":"main_file","date_updated":"2021-04-16T14:15:12Z","creator":"gsperl","file_name":"MADYPG_extra_data.zip","checksum":"0324cb519273371708743f3282e7c081","date_created":"2021-04-16T14:15:12Z","file_size":802586232,"success":1,"content_type":"application/zip","access_level":"open_access"},{"access_level":"open_access","content_type":"application/gzip","date_created":"2021-04-26T09:33:44Z","file_size":64962865,"checksum":"4c224551adf852b136ec21a4e13f0c1b","file_name":"MADYPG.zip","relation":"main_file","file_id":"9353","date_updated":"2021-04-26T09:33:44Z","creator":"pub-gitlab-bot"}]},{"isi":1,"publication":"Discrete Applied Mathematics","date_updated":"2026-04-16T09:15:13Z","file_date_updated":"2021-02-04T11:28:42Z","scopus_import":"1","issue":"1","status":"public","page":"392-415","has_accepted_license":"1","citation":{"apa":"Zeiner, M., Schmid, U., &#38; Chatterjee, K. (2021). Optimal strategies for selecting coordinators. <i>Discrete Applied Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.dam.2020.10.022\">https://doi.org/10.1016/j.dam.2020.10.022</a>","mla":"Zeiner, Martin, et al. “Optimal Strategies for Selecting Coordinators.” <i>Discrete Applied Mathematics</i>, vol. 289, no. 1, Elsevier, 2021, pp. 392–415, doi:<a href=\"https://doi.org/10.1016/j.dam.2020.10.022\">10.1016/j.dam.2020.10.022</a>.","ieee":"M. Zeiner, U. Schmid, and K. Chatterjee, “Optimal strategies for selecting coordinators,” <i>Discrete Applied Mathematics</i>, vol. 289, no. 1. Elsevier, pp. 392–415, 2021.","short":"M. Zeiner, U. Schmid, K. Chatterjee, Discrete Applied Mathematics 289 (2021) 392–415.","chicago":"Zeiner, Martin, Ulrich Schmid, and Krishnendu Chatterjee. “Optimal Strategies for Selecting Coordinators.” <i>Discrete Applied Mathematics</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.dam.2020.10.022\">https://doi.org/10.1016/j.dam.2020.10.022</a>.","ama":"Zeiner M, Schmid U, Chatterjee K. Optimal strategies for selecting coordinators. <i>Discrete Applied Mathematics</i>. 2021;289(1):392-415. doi:<a href=\"https://doi.org/10.1016/j.dam.2020.10.022\">10.1016/j.dam.2020.10.022</a>","ista":"Zeiner M, Schmid U, Chatterjee K. 2021. Optimal strategies for selecting coordinators. Discrete Applied Mathematics. 289(1), 392–415."},"day":"31","type":"journal_article","quality_controlled":"1","_id":"8793","abstract":[{"text":"We study optimal election sequences for repeatedly selecting a (very) small group of leaders among a set of participants (players) with publicly known unique ids. In every time slot, every player has to select exactly one player that it considers to be the current leader, oblivious to the selection of the other players, but with the overarching goal of maximizing a given parameterized global (“social”) payoff function in the limit. We consider a quite generic model, where the local payoff achieved by a given player depends, weighted by some arbitrary but fixed real parameter, on the number of different leaders chosen in a round, the number of players that choose the given player as the leader, and whether the chosen leader has changed w.r.t. the previous round or not. The social payoff can be the maximum, average or minimum local payoff of the players. Possible applications include quite diverse examples such as rotating coordinator-based distributed algorithms and long-haul formation flying of social birds. Depending on the weights and the particular social payoff, optimal sequences can be very different, from simple round-robin where all players chose the same leader alternatingly every time slot to very exotic patterns, where a small group of leaders (at most 2) is elected in every time slot. Moreover, we study the question if and when a single player would not benefit w.r.t. its local payoff when deviating from the given optimal sequence, i.e., when our optimal sequences are Nash equilibria in the restricted strategy space of oblivious strategies. As this is the case for many parameterizations of our model, our results reveal that no punishment is needed to make it rational for the players to optimize the social payoff.","lang":"eng"}],"language":[{"iso":"eng"}],"external_id":{"isi":["000596823800035"]},"date_published":"2021-01-31T00:00:00Z","year":"2021","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ddc":["510"],"intvolume":"       289","article_type":"original","project":[{"name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"}],"department":[{"_id":"KrCh"}],"month":"01","author":[{"last_name":"Zeiner","full_name":"Zeiner, Martin","first_name":"Martin"},{"first_name":"Ulrich","full_name":"Schmid, Ulrich","last_name":"Schmid"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"}],"volume":289,"acknowledgement":"We are grateful to Matthias Függer and Thomas Nowak for having raised our interest in the problem studied in this paper.\r\nThis work has been supported the Austrian Science Fund (FWF) projects S11405, S11407 (RiSE), and P28182 (ADynNet).","doi":"10.1016/j.dam.2020.10.022","oa":1,"publisher":"Elsevier","corr_author":"1","tmp":{"short":"CC BY (4.0)","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)"},"article_processing_charge":"No","file":[{"access_level":"open_access","date_created":"2021-02-04T11:28:42Z","file_size":652739,"content_type":"application/pdf","success":1,"file_name":"2021_DiscreteApplMath_Zeiner.pdf","checksum":"f1039ff5a2d6ca116720efdb84ee9d5e","relation":"main_file","date_updated":"2021-02-04T11:28:42Z","creator":"dernst","file_id":"9089"}],"publication_status":"published","oa_version":"Published Version","date_created":"2020-11-22T23:01:26Z","title":"Optimal strategies for selecting coordinators","publication_identifier":{"eissn":["1872-6771"],"issn":["0166-218X"]}},{"publisher":"Elsevier","corr_author":"1","article_processing_charge":"No","related_material":{"record":[{"status":"public","id":"6989","relation":"shorter_version"}]},"acknowledgement":"This research was performed in part at the 33rd Bellairs Winter Workshop on Computational Geometry. We thank all other participants for a fruitful atmosphere. H. Akitaya was supported by NSF CCF-1422311 & 1423615. Z. Masárová was partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","doi":"10.1016/j.comgeo.2020.101700","oa":1,"article_type":"original","project":[{"name":"Mathematics, Computer Science","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"department":[{"_id":"HeEd"}],"month":"02","author":[{"last_name":"Aichholzer","full_name":"Aichholzer, Oswin","first_name":"Oswin"},{"first_name":"Hugo A.","last_name":"Akitaya","full_name":"Akitaya, Hugo A."},{"first_name":"Kenneth C.","full_name":"Cheung, Kenneth C.","last_name":"Cheung"},{"first_name":"Erik D.","last_name":"Demaine","full_name":"Demaine, Erik D."},{"full_name":"Demaine, Martin L.","last_name":"Demaine","first_name":"Martin L."},{"first_name":"Sándor P.","full_name":"Fekete, Sándor P.","last_name":"Fekete"},{"full_name":"Kleist, Linda","last_name":"Kleist","first_name":"Linda"},{"first_name":"Irina","full_name":"Kostitsyna, Irina","last_name":"Kostitsyna"},{"full_name":"Löffler, Maarten","last_name":"Löffler","first_name":"Maarten"},{"orcid":"0000-0002-6660-1322","first_name":"Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","full_name":"Masárová, Zuzana","last_name":"Masárová"},{"last_name":"Mundilova","full_name":"Mundilova, Klara","first_name":"Klara"},{"first_name":"Christiane","last_name":"Schmidt","full_name":"Schmidt, Christiane"}],"volume":93,"arxiv":1,"publication_identifier":{"issn":["0925-7721"],"eissn":["1879-081X"]},"oa_version":"Preprint","date_created":"2020-08-30T22:01:09Z","title":"Folding polyominoes with holes into a cube","publication_status":"published","status":"public","scopus_import":"1","isi":1,"publication":"Computational Geometry: Theory and Applications","date_updated":"2026-04-16T09:14:31Z","year":"2021","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","intvolume":"        93","article_number":"101700","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1910.09917v3"}],"date_published":"2021-02-01T00:00:00Z","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"_id":"8317","abstract":[{"lang":"eng","text":"When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with one or several holes to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special “basic” holes guarantee foldability."}],"external_id":{"isi":["000579185100004"],"arxiv":["1910.09917"]},"citation":{"chicago":"Aichholzer, Oswin, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, et al. “Folding Polyominoes with Holes into a Cube.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">https://doi.org/10.1016/j.comgeo.2020.101700</a>.","ama":"Aichholzer O, Akitaya HA, Cheung KC, et al. Folding polyominoes with holes into a cube. <i>Computational Geometry: Theory and Applications</i>. 2021;93. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">10.1016/j.comgeo.2020.101700</a>","ista":"Aichholzer O, Akitaya HA, Cheung KC, Demaine ED, Demaine ML, Fekete SP, Kleist L, Kostitsyna I, Löffler M, Masárová Z, Mundilova K, Schmidt C. 2021. Folding polyominoes with holes into a cube. Computational Geometry: Theory and Applications. 93, 101700.","apa":"Aichholzer, O., Akitaya, H. A., Cheung, K. C., Demaine, E. D., Demaine, M. L., Fekete, S. P., … Schmidt, C. (2021). Folding polyominoes with holes into a cube. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">https://doi.org/10.1016/j.comgeo.2020.101700</a>","mla":"Aichholzer, Oswin, et al. “Folding Polyominoes with Holes into a Cube.” <i>Computational Geometry: Theory and Applications</i>, vol. 93, 101700, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">10.1016/j.comgeo.2020.101700</a>.","ieee":"O. Aichholzer <i>et al.</i>, “Folding polyominoes with holes into a cube,” <i>Computational Geometry: Theory and Applications</i>, vol. 93. Elsevier, 2021.","short":"O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P. Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt, Computational Geometry: Theory and Applications 93 (2021)."},"day":"01"},{"ec_funded":1,"scopus_import":"1","page":"399-421","status":"public","date_updated":"2026-04-16T09:28:46Z","publication":"Topics in Cryptology – CT-RSA 2021","date_published":"2021-05-11T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2020/670"}],"intvolume":"     12704","year":"2021","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"ista":"Auerbach B, Chakraborty S, Klein K, Pascual Perez G, Pietrzak KZ, Walter M, Yeo MX. 2021. Inverse-Sybil attacks in automated contact tracing. Topics in Cryptology – CT-RSA 2021. CT-RSA: Cryptographers’ Track at the RSA Conference, LNCS, vol. 12704, 399–421.","ama":"Auerbach B, Chakraborty S, Klein K, et al. Inverse-Sybil attacks in automated contact tracing. In: <i>Topics in Cryptology – CT-RSA 2021</i>. Vol 12704. Springer Nature; 2021:399-421. doi:<a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">10.1007/978-3-030-75539-3_17</a>","chicago":"Auerbach, Benedikt, Suvradip Chakraborty, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, Michael Walter, and Michelle X Yeo. “Inverse-Sybil Attacks in Automated Contact Tracing.” In <i>Topics in Cryptology – CT-RSA 2021</i>, 12704:399–421. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">https://doi.org/10.1007/978-3-030-75539-3_17</a>.","short":"B. Auerbach, S. Chakraborty, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, M.X. Yeo, in:, Topics in Cryptology – CT-RSA 2021, Springer Nature, 2021, pp. 399–421.","ieee":"B. Auerbach <i>et al.</i>, “Inverse-Sybil attacks in automated contact tracing,” in <i>Topics in Cryptology – CT-RSA 2021</i>, Virtual Event, 2021, vol. 12704, pp. 399–421.","mla":"Auerbach, Benedikt, et al. “Inverse-Sybil Attacks in Automated Contact Tracing.” <i>Topics in Cryptology – CT-RSA 2021</i>, vol. 12704, Springer Nature, 2021, pp. 399–421, doi:<a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">10.1007/978-3-030-75539-3_17</a>.","apa":"Auerbach, B., Chakraborty, S., Klein, K., Pascual Perez, G., Pietrzak, K. Z., Walter, M., &#38; Yeo, M. X. (2021). Inverse-Sybil attacks in automated contact tracing. In <i>Topics in Cryptology – CT-RSA 2021</i> (Vol. 12704, pp. 399–421). Virtual Event: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">https://doi.org/10.1007/978-3-030-75539-3_17</a>"},"day":"11","language":[{"iso":"eng"}],"_id":"9826","abstract":[{"lang":"eng","text":"Automated contract tracing aims at supporting manual contact tracing during pandemics by alerting users of encounters with infected people. There are currently many proposals for protocols (like the “decentralized” DP-3T and PACT or the “centralized” ROBERT and DESIRE) to be run on mobile phones, where the basic idea is to regularly broadcast (using low energy Bluetooth) some values, and at the same time store (a function of) incoming messages broadcasted by users in their proximity. In the existing proposals one can trigger false positives on a massive scale by an “inverse-Sybil” attack, where a large number of devices (malicious users or hacked phones) pretend to be the same user, such that later, just a single person needs to be diagnosed (and allowed to upload) to trigger an alert for all users who were in proximity to any of this large group of devices.\r\n\r\nWe propose the first protocols that do not succumb to such attacks assuming the devices involved in the attack do not constantly communicate, which we observe is a necessary assumption. The high level idea of the protocols is to derive the values to be broadcasted by a hash chain, so that two (or more) devices who want to launch an inverse-Sybil attack will not be able to connect their respective chains and thus only one of them will be able to upload. Our protocols also achieve security against replay, belated replay, and one of them even against relay attacks."}],"type":"conference","quality_controlled":"1","corr_author":"1","article_processing_charge":"No","publisher":"Springer Nature","volume":12704,"author":[{"orcid":"0000-0002-7553-6606","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","first_name":"Benedikt","full_name":"Auerbach, Benedikt","last_name":"Auerbach"},{"full_name":"Chakraborty, Suvradip","last_name":"Chakraborty","first_name":"Suvradip","id":"B9CD0494-D033-11E9-B219-A439E6697425"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen","last_name":"Klein","full_name":"Klein, Karen"},{"id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","first_name":"Guillermo","orcid":"0000-0001-8630-415X","last_name":"Pascual Perez","full_name":"Pascual Perez, Guillermo"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"},{"last_name":"Walter","full_name":"Walter, Michael","orcid":"0000-0003-3186-2482","first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Yeo","full_name":"Yeo, Michelle X","orcid":"0009-0001-3676-4809","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","first_name":"Michelle X"}],"project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"},{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"month":"05","department":[{"_id":"KrPi"},{"_id":"GradSch"}],"acknowledgement":"Guillermo Pascual-Perez and Michelle Yeo were funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska–Curie Grant Agreement No. 665385; the remaining contributors to this project have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).","oa":1,"doi":"10.1007/978-3-030-75539-3_17","title":"Inverse-Sybil attacks in automated contact tracing","alternative_title":["LNCS"],"date_created":"2021-08-08T22:01:30Z","oa_version":"Submitted Version","publication_identifier":{"isbn":["9783030755386"],"eissn":["1611-3349"],"issn":["0302-9743"]},"conference":{"name":"CT-RSA: Cryptographers’ Track at the RSA Conference","start_date":"2021-05-17","end_date":"2021-05-20","location":"Virtual Event"},"publication_status":"published"},{"publisher":"Springer Nature","article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","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)"},"corr_author":"1","oa":1,"doi":"10.1007/978-3-030-75245-3_3","acknowledgement":"This work was initiated in discussions with Léo Ducas, when the author was visiting the Simons Institute for the Theory of Computation during the program “Lattices: Algorithms, Complexity, and Cryptography”. We thank Thomas Espitau for pointing out a bug in a proof in an earlier version of this manuscript.","department":[{"_id":"KrPi"}],"month":"05","project":[{"grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks"}],"volume":12710,"author":[{"full_name":"Walter, Michael","last_name":"Walter","orcid":"0000-0003-3186-2482","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","first_name":"Michael"}],"publication_identifier":{"isbn":["9783030752446"],"eissn":["1611-3349"],"issn":["0302-9743"]},"oa_version":"Published Version","date_created":"2021-06-06T22:01:29Z","alternative_title":["LNCS"],"title":"The convergence of slide-type reductions","conference":{"start_date":"2021-05-10","name":"PKC: IACR International Conference on Practice and Theory of Public Key Cryptography","location":"Virtual","end_date":"2021-05-13"},"publication_status":"published","file":[{"access_level":"open_access","file_size":489017,"date_created":"2022-05-27T09:48:31Z","success":1,"content_type":"application/pdf","file_name":"2021_PKC_Walter.pdf","checksum":"413e564d645ed93d7318672361d9d470","date_updated":"2022-05-27T09:48:31Z","file_id":"11416","relation":"main_file","creator":"dernst"}],"page":"45-67","status":"public","scopus_import":"1","ec_funded":1,"file_date_updated":"2022-05-27T09:48:31Z","isi":1,"date_updated":"2026-04-16T09:25:35Z","publication":"Public-Key Cryptography – PKC 2021","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ddc":["000"],"year":"2021","intvolume":"     12710","date_published":"2021-05-01T00:00:00Z","quality_controlled":"1","type":"conference","external_id":{"isi":["001294728500003"]},"abstract":[{"lang":"eng","text":"In this work, we apply the dynamical systems analysis of Hanrot et al. (CRYPTO’11) to a class of lattice block reduction algorithms that includes (natural variants of) slide reduction and block-Rankin reduction. This implies sharper bounds on the polynomial running times (in the query model) for these algorithms and opens the door to faster practical variants of slide reduction. We give heuristic arguments showing that such variants can indeed speed up slide reduction significantly in practice. This is confirmed by experimental evidence, which also shows that our variants are competitive with state-of-the-art reduction algorithms."}],"_id":"9466","language":[{"iso":"eng"}],"citation":{"chicago":"Walter, Michael. “The Convergence of Slide-Type Reductions.” In <i>Public-Key Cryptography – PKC 2021</i>, 12710:45–67. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_3\">https://doi.org/10.1007/978-3-030-75245-3_3</a>.","ista":"Walter M. 2021. The convergence of slide-type reductions. Public-Key Cryptography – PKC 2021. PKC: IACR International Conference on Practice and Theory of Public Key Cryptography, LNCS, vol. 12710, 45–67.","ama":"Walter M. The convergence of slide-type reductions. In: <i>Public-Key Cryptography – PKC 2021</i>. Vol 12710. Springer Nature; 2021:45-67. doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_3\">10.1007/978-3-030-75245-3_3</a>","apa":"Walter, M. (2021). The convergence of slide-type reductions. In <i>Public-Key Cryptography – PKC 2021</i> (Vol. 12710, pp. 45–67). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_3\">https://doi.org/10.1007/978-3-030-75245-3_3</a>","short":"M. Walter, in:, Public-Key Cryptography – PKC 2021, Springer Nature, 2021, pp. 45–67.","ieee":"M. Walter, “The convergence of slide-type reductions,” in <i>Public-Key Cryptography – PKC 2021</i>, Virtual, 2021, vol. 12710, pp. 45–67.","mla":"Walter, Michael. “The Convergence of Slide-Type Reductions.” <i>Public-Key Cryptography – PKC 2021</i>, vol. 12710, Springer Nature, 2021, pp. 45–67, doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_3\">10.1007/978-3-030-75245-3_3</a>."},"day":"01","has_accepted_license":"1"},{"conference":{"location":"Yangon, Myanmar","end_date":"2021-03-02","start_date":"2021-02-28","name":"WALCOM: Algorithms and Computation"},"publication_status":"published","alternative_title":["LNCS"],"title":"On compatible matchings","date_created":"2021-03-28T22:01:41Z","oa_version":"Preprint","arxiv":1,"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783030682118"],"isbn":["9783030682101"]},"volume":12635,"author":[{"last_name":"Aichholzer","full_name":"Aichholzer, Oswin","first_name":"Oswin"},{"last_name":"Arroyo Guevara","full_name":"Arroyo Guevara, Alan M","first_name":"Alan M","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2401-8670"},{"full_name":"Masárová, Zuzana","last_name":"Masárová","orcid":"0000-0002-6660-1322","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana"},{"first_name":"Irene","last_name":"Parada","full_name":"Parada, Irene"},{"full_name":"Perz, Daniel","last_name":"Perz","first_name":"Daniel"},{"last_name":"Pilz","full_name":"Pilz, Alexander","first_name":"Alexander"},{"full_name":"Tkadlec, Josef","last_name":"Tkadlec","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684"},{"last_name":"Vogtenhuber","full_name":"Vogtenhuber, Birgit","first_name":"Birgit"}],"month":"02","department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"KrCh"}],"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Mathematics, Computer Science"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa":1,"doi":"10.1007/978-3-030-68211-8_18","acknowledgement":"A.A. funded by the Marie Skłodowska-Curie grant agreement No. 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).","related_material":{"record":[{"relation":"later_version","status":"public","id":"11938"}]},"article_processing_charge":"No","publisher":"Springer Nature","day":"16","citation":{"chicago":"Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” In <i>15th International Conference on Algorithms and Computation</i>, 12635:221–33. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-68211-8_18\">https://doi.org/10.1007/978-3-030-68211-8_18</a>.","ama":"Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. In: <i>15th International Conference on Algorithms and Computation</i>. Vol 12635. Springer Nature; 2021:221-233. doi:<a href=\"https://doi.org/10.1007/978-3-030-68211-8_18\">10.1007/978-3-030-68211-8_18</a>","ista":"Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2021. On compatible matchings. 15th International Conference on Algorithms and Computation. WALCOM: Algorithms and Computation, LNCS, vol. 12635, 221–233.","apa":"Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2021). On compatible matchings. In <i>15th International Conference on Algorithms and Computation</i> (Vol. 12635, pp. 221–233). Yangon, Myanmar: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-68211-8_18\">https://doi.org/10.1007/978-3-030-68211-8_18</a>","mla":"Aichholzer, Oswin, et al. “On Compatible Matchings.” <i>15th International Conference on Algorithms and Computation</i>, vol. 12635, Springer Nature, 2021, pp. 221–33, doi:<a href=\"https://doi.org/10.1007/978-3-030-68211-8_18\">10.1007/978-3-030-68211-8_18</a>.","ieee":"O. Aichholzer <i>et al.</i>, “On compatible matchings,” in <i>15th International Conference on Algorithms and Computation</i>, Yangon, Myanmar, 2021, vol. 12635, pp. 221–233.","short":"O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and Computation, Springer Nature, 2021, pp. 221–233."},"external_id":{"isi":["001435069600018"],"arxiv":["2101.03928"]},"language":[{"iso":"eng"}],"_id":"9296","abstract":[{"text":" matching is compatible to two or more labeled point sets of size n with labels   {1,…,n}  if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled convex sets of n points there exists a compatible matching with   ⌊2n−−√⌋  edges. More generally, for any   ℓ  labeled point sets we construct compatible matchings of size   Ω(n1/ℓ) . As a corresponding upper bound, we use probabilistic arguments to show that for any   ℓ  given sets of n points there exists a labeling of each set such that the largest compatible matching has   O(n2/(ℓ+1))  edges. Finally, we show that   Θ(logn)  copies of any set of n points are necessary and sufficient for the existence of a labeling such that any compatible matching consists only of a single edge.","lang":"eng"}],"quality_controlled":"1","type":"conference","date_published":"2021-02-16T00:00:00Z","main_file_link":[{"url":"https://arxiv.org/abs/2101.03928","open_access":"1"}],"intvolume":"     12635","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2021","date_updated":"2026-04-16T09:18:21Z","publication":"15th International Conference on Algorithms and Computation","isi":1,"ec_funded":1,"scopus_import":"1","page":"221-233","status":"public"},{"doi":"10.1007/978-3-030-75539-3_20","oa":1,"acknowledgement":"The authors thank Sauvik Bhattacharya, L´eo Ducas, Rachel Player, and Christine van Vredendaal for early discussions on this topic and on preliminary results. The authors further thank the reviewers of CT-RSA 2021 for their valuable feedback.","volume":12704,"author":[{"first_name":"Thijs","last_name":"Laarhoven","full_name":"Laarhoven, Thijs"},{"orcid":"0000-0003-3186-2482","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","last_name":"Walter","full_name":"Walter, Michael"}],"month":"05","department":[{"_id":"KrPi"}],"article_processing_charge":"No","publisher":"Springer Nature","conference":{"name":"CT-RSA: Cryptographers’ Track at the RSA Conference","start_date":"2021-05-17","end_date":"2021-05-20","location":"Virtual Event"},"publication_status":"published","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783030755386"]},"date_created":"2021-08-08T22:01:30Z","title":"Dual lattice attacks for closest vector problems (with preprocessing)","alternative_title":["LNCS"],"oa_version":"Preprint","date_updated":"2026-04-16T09:28:30Z","publication":"Topics in Cryptology – CT-RSA 2021","page":"478-502","status":"public","scopus_import":"1","language":[{"iso":"eng"}],"_id":"9825","abstract":[{"text":"The dual attack has long been considered a relevant attack on lattice-based cryptographic schemes relying on the hardness of learning with errors (LWE) and its structured variants. As solving LWE corresponds to finding a nearest point on a lattice, one may naturally wonder how efficient this dual approach is for solving more general closest vector problems, such as the classical closest vector problem (CVP), the variants bounded distance decoding (BDD) and approximate CVP, and preprocessing versions of these problems. While primal, sieving-based solutions to these problems (with preprocessing) were recently studied in a series of works on approximate Voronoi cells [Laa16b, DLdW19, Laa20, DLvW20], for the dual attack no such overview exists, especially for problems with preprocessing. With one of the take-away messages of the approximate Voronoi cell line of work being that primal attacks work well for approximate CVP(P) but scale poorly for BDD(P), one may further wonder if the dual attack suffers the same drawbacks, or if it is perhaps a better solution when trying to solve BDD(P).\r\n\r\nIn this work we provide an overview of cost estimates for dual algorithms for solving these “classical” closest lattice vector problems. Heuristically we expect to solve the search version of average-case CVPP in time and space   20.293𝑑+𝑜(𝑑)  in the single-target model. The distinguishing version of average-case CVPP, where we wish to distinguish between random targets and targets planted at distance (say)   0.99⋅𝑔𝑑  from the lattice, has the same complexity in the single-target model, but can be solved in time and space   20.195𝑑+𝑜(𝑑)  in the multi-target setting, when given a large number of targets from either target distribution. This suggests an inequivalence between distinguishing and searching, as we do not expect a similar improvement in the multi-target setting to hold for search-CVPP. We analyze three slightly different decoders, both for distinguishing and searching, and experimentally obtain concrete cost estimates for the dual attack in dimensions 50 to 80, which confirm our heuristic assumptions, and show that the hidden order terms in the asymptotic estimates are quite small.\r\n\r\nOur main take-away message is that the dual attack appears to mirror the approximate Voronoi cell line of work – whereas using approximate Voronoi cells works well for approximate CVP(P) but scales poorly for BDD(P), the dual approach scales well for BDD(P) instances but performs poorly on approximate CVP(P).","lang":"eng"}],"quality_controlled":"1","type":"conference","citation":{"chicago":"Laarhoven, Thijs, and Michael Walter. “Dual Lattice Attacks for Closest Vector Problems (with Preprocessing).” In <i>Topics in Cryptology – CT-RSA 2021</i>, 12704:478–502. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75539-3_20\">https://doi.org/10.1007/978-3-030-75539-3_20</a>.","ama":"Laarhoven T, Walter M. Dual lattice attacks for closest vector problems (with preprocessing). In: <i>Topics in Cryptology – CT-RSA 2021</i>. Vol 12704. Springer Nature; 2021:478-502. doi:<a href=\"https://doi.org/10.1007/978-3-030-75539-3_20\">10.1007/978-3-030-75539-3_20</a>","ista":"Laarhoven T, Walter M. 2021. Dual lattice attacks for closest vector problems (with preprocessing). Topics in Cryptology – CT-RSA 2021. CT-RSA: Cryptographers’ Track at the RSA Conference, LNCS, vol. 12704, 478–502.","apa":"Laarhoven, T., &#38; Walter, M. (2021). Dual lattice attacks for closest vector problems (with preprocessing). In <i>Topics in Cryptology – CT-RSA 2021</i> (Vol. 12704, pp. 478–502). Virtual Event: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-75539-3_20\">https://doi.org/10.1007/978-3-030-75539-3_20</a>","mla":"Laarhoven, Thijs, and Michael Walter. “Dual Lattice Attacks for Closest Vector Problems (with Preprocessing).” <i>Topics in Cryptology – CT-RSA 2021</i>, vol. 12704, Springer Nature, 2021, pp. 478–502, doi:<a href=\"https://doi.org/10.1007/978-3-030-75539-3_20\">10.1007/978-3-030-75539-3_20</a>.","short":"T. Laarhoven, M. Walter, in:, Topics in Cryptology – CT-RSA 2021, Springer Nature, 2021, pp. 478–502.","ieee":"T. Laarhoven and M. Walter, “Dual lattice attacks for closest vector problems (with preprocessing),” in <i>Topics in Cryptology – CT-RSA 2021</i>, Virtual Event, 2021, vol. 12704, pp. 478–502."},"day":"11","intvolume":"     12704","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2021","date_published":"2021-05-11T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/557"}]},{"corr_author":"1","article_processing_charge":"No","publisher":"Elsevier","volume":167,"author":[{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E","full_name":"Sarac, Naci E","last_name":"Sarac"},{"first_name":"Ömer Faruk","full_name":"Altun, Ömer Faruk","last_name":"Altun"},{"first_name":"Kamil Tolga","full_name":"Atam, Kamil Tolga","last_name":"Atam"},{"full_name":"Karahoda, Sertac","last_name":"Karahoda","first_name":"Sertac"},{"first_name":"Kamer","full_name":"Kaya, Kamer","last_name":"Kaya"},{"full_name":"Yenigün, Hüsnü","last_name":"Yenigün","first_name":"Hüsnü"}],"article_type":"original","project":[{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}],"month":"04","department":[{"_id":"ToHe"}],"acknowledgement":"This work was supported by The Scientific and Technological Research Council of Turkey (TUBITAK) [grant number 114E569]. This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). We would like to thank the authors of (Roman & Szykula, 2015) for providing their heuristics implementations, which we used to compare our SynchroP implementation as given in Table 11.","doi":"10.1016/j.eswa.2020.114203","oa":1,"date_created":"2020-12-02T13:34:25Z","title":"Boosting expensive synchronizing heuristics","oa_version":"Submitted Version","publication_identifier":{"issn":["0957-4174"],"eissn":["1873-6793"]},"file":[{"file_name":"synchroPaperRevised.pdf","checksum":"600c2f81bc898a725bcfa7cf26ff4fed","date_updated":"2020-12-02T13:33:51Z","file_id":"8913","relation":"main_file","creator":"esarac","access_level":"open_access","date_created":"2020-12-02T13:33:51Z","file_size":634967,"content_type":"application/pdf"}],"publication_status":"published","issue":"4","scopus_import":"1","status":"public","date_updated":"2026-04-16T09:15:47Z","publication":"Expert Systems with Applications","isi":1,"file_date_updated":"2020-12-02T13:33:51Z","date_published":"2021-04-01T00:00:00Z","intvolume":"       167","article_number":"114203","year":"2021","ddc":["000"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","has_accepted_license":"1","citation":{"ieee":"N. E. Sarac, Ö. F. Altun, K. T. Atam, S. Karahoda, K. Kaya, and H. Yenigün, “Boosting expensive synchronizing heuristics,” <i>Expert Systems with Applications</i>, vol. 167, no. 4. Elsevier, 2021.","short":"N.E. Sarac, Ö.F. Altun, K.T. Atam, S. Karahoda, K. Kaya, H. Yenigün, Expert Systems with Applications 167 (2021).","mla":"Sarac, Naci E., et al. “Boosting Expensive Synchronizing Heuristics.” <i>Expert Systems with Applications</i>, vol. 167, no. 4, 114203, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">10.1016/j.eswa.2020.114203</a>.","apa":"Sarac, N. E., Altun, Ö. F., Atam, K. T., Karahoda, S., Kaya, K., &#38; Yenigün, H. (2021). Boosting expensive synchronizing heuristics. <i>Expert Systems with Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">https://doi.org/10.1016/j.eswa.2020.114203</a>","ista":"Sarac NE, Altun ÖF, Atam KT, Karahoda S, Kaya K, Yenigün H. 2021. Boosting expensive synchronizing heuristics. Expert Systems with Applications. 167(4), 114203.","ama":"Sarac NE, Altun ÖF, Atam KT, Karahoda S, Kaya K, Yenigün H. Boosting expensive synchronizing heuristics. <i>Expert Systems with Applications</i>. 2021;167(4). doi:<a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">10.1016/j.eswa.2020.114203</a>","chicago":"Sarac, Naci E, Ömer Faruk Altun, Kamil Tolga Atam, Sertac Karahoda, Kamer Kaya, and Hüsnü Yenigün. “Boosting Expensive Synchronizing Heuristics.” <i>Expert Systems with Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">https://doi.org/10.1016/j.eswa.2020.114203</a>."},"day":"01","_id":"8912","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"For automata, synchronization, the problem of bringing an automaton to a particular state regardless of its initial state, is important. It has several applications in practice and is related to a fifty-year-old conjecture on the length of the shortest synchronizing word. Although using shorter words increases the effectiveness in practice, finding a shortest one (which is not necessarily unique) is NP-hard. For this reason, there exist various heuristics in the literature. However, high-quality heuristics such as SynchroP producing relatively shorter sequences are very expensive and can take hours when the automaton has tens of thousands of states. The SynchroP heuristic has been frequently used as a benchmark to evaluate the performance of the new heuristics. In this work, we first improve the runtime of SynchroP and its variants by using algorithmic techniques. We then focus on adapting SynchroP for many-core architectures,\r\nand overall, we obtain more than 1000× speedup on GPUs compared to naive sequential implementation that has been frequently used as a benchmark to evaluate new heuristics in the literature. We also propose two SynchroP variants and evaluate their performance."}],"external_id":{"isi":["000640531100038"]},"type":"journal_article","quality_controlled":"1"},{"isi":1,"date_updated":"2026-04-16T09:26:11Z","publication":"Structural Information and Communication Complexity","status":"public","page":"87-105","scopus_import":"1","quality_controlled":"1","type":"conference","external_id":{"arxiv":["2103.08949"],"isi":["001292788400006"]},"abstract":[{"lang":"eng","text":"Approximate agreement is one of the few variants of consensus that can be solved in a wait-free manner in asynchronous systems where processes communicate by reading and writing to shared memory. In this work, we consider a natural generalisation of approximate agreement on arbitrary undirected connected graphs. Each process is given a vertex of the graph as input and, if non-faulty, must output a vertex such that\r\nall the outputs are within distance 1 of one another, and\r\n\r\neach output value lies on a shortest path between two input values.\r\n\r\nFrom prior work, it is known that there is no wait-free algorithm among   𝑛≥3  processes for this problem on any cycle of length   𝑐≥4 , by reduction from 2-set agreement (Castañeda et al. 2018).\r\n\r\nIn this work, we investigate the solvability and complexity of this task on general graphs. We give a new, direct proof of the impossibility of approximate agreement on cycles of length   𝑐≥4 , via a generalisation of Sperner’s Lemma to convex polygons. We also extend the reduction from 2-set agreement to a larger class of graphs, showing that approximate agreement on these graphs is unsolvable. On the positive side, we present a wait-free algorithm for a class of graphs that properly contains the class of chordal graphs."}],"_id":"9823","language":[{"iso":"eng"}],"citation":{"apa":"Alistarh, D.-A., Ellen, F., &#38; Rybicki, J. (2021). Wait-free approximate agreement on graphs. In <i>Structural Information and Communication Complexity</i> (Vol. 12810, pp. 87–105). Wrocław, Poland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-79527-6_6\">https://doi.org/10.1007/978-3-030-79527-6_6</a>","mla":"Alistarh, Dan-Adrian, et al. “Wait-Free Approximate Agreement on Graphs.” <i>Structural Information and Communication Complexity</i>, vol. 12810, Springer Nature, 2021, pp. 87–105, doi:<a href=\"https://doi.org/10.1007/978-3-030-79527-6_6\">10.1007/978-3-030-79527-6_6</a>.","short":"D.-A. Alistarh, F. Ellen, J. Rybicki, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 87–105.","ieee":"D.-A. Alistarh, F. Ellen, and J. Rybicki, “Wait-free approximate agreement on graphs,” in <i>Structural Information and Communication Complexity</i>, Wrocław, Poland, 2021, vol. 12810, pp. 87–105.","chicago":"Alistarh, Dan-Adrian, Faith Ellen, and Joel Rybicki. “Wait-Free Approximate Agreement on Graphs.” In <i>Structural Information and Communication Complexity</i>, 12810:87–105. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-79527-6_6\">https://doi.org/10.1007/978-3-030-79527-6_6</a>.","ama":"Alistarh D-A, Ellen F, Rybicki J. Wait-free approximate agreement on graphs. In: <i>Structural Information and Communication Complexity</i>. Vol 12810. Springer Nature; 2021:87-105. doi:<a href=\"https://doi.org/10.1007/978-3-030-79527-6_6\">10.1007/978-3-030-79527-6_6</a>","ista":"Alistarh D-A, Ellen F, Rybicki J. 2021. Wait-free approximate agreement on graphs. Structural Information and Communication Complexity. SIROCCO: Structural Information and Communication Complexity, LNCS, vol. 12810, 87–105."},"day":"20","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2021","intvolume":"     12810","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08949"}],"date_published":"2021-06-20T00:00:00Z","doi":"10.1007/978-3-030-79527-6_6","oa":1,"department":[{"_id":"DaAl"}],"month":"06","volume":12810,"author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"full_name":"Ellen, Faith","last_name":"Ellen","first_name":"Faith"},{"orcid":"0000-0002-6432-6646","first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","full_name":"Rybicki, Joel","last_name":"Rybicki"}],"publisher":"Springer Nature","article_processing_charge":"No","conference":{"name":"SIROCCO: Structural Information and Communication Complexity","start_date":"2021-06-28","end_date":"2021-07-01","location":"Wrocław, Poland"},"publication_status":"published","publication_identifier":{"isbn":["9783030795269"],"issn":["0302-9743"],"eissn":["1611-3349"]},"arxiv":1,"oa_version":"Preprint","date_created":"2021-08-08T22:01:29Z","alternative_title":["LNCS"],"title":"Wait-free approximate agreement on graphs"},{"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783030766566"]},"alternative_title":["LNCS"],"date_created":"2021-08-08T22:01:29Z","title":"Body centered cubic grid - coordinate system and discrete analytical plane definition","oa_version":"None","publication_status":"published","conference":{"name":"DGMM: International Conference on Discrete Geometry and Mathematical Morphology","start_date":"2021-05-24","end_date":"2021-05-27","location":"Uppsala, Sweden"},"article_processing_charge":"No","publisher":"Springer Nature","acknowledgement":"This work has been partially supported by the Ministry of Education, Science and Technological Development of the Republic of Serbia through the project no. 451-03-68/2020-14/200156: “Innovative scientific and artistic research from the FTS (activity) domain” (LČ), the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183 (RB), and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35 (RB).","doi":"10.1007/978-3-030-76657-3_10","volume":12708,"author":[{"full_name":"Čomić, Lidija","last_name":"Čomić","first_name":"Lidija"},{"first_name":"Rita","last_name":"Zrour","full_name":"Zrour, Rita"},{"first_name":"Gaëlle","full_name":"Largeteau-Skapin, Gaëlle","last_name":"Largeteau-Skapin"},{"id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita","orcid":"0000-0002-5372-7890","last_name":"Biswas","full_name":"Biswas, Ranita"},{"first_name":"Eric","last_name":"Andres","full_name":"Andres, Eric"}],"project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"}],"month":"05","department":[{"_id":"HeEd"}],"intvolume":"     12708","year":"2021","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_published":"2021-05-16T00:00:00Z","_id":"9824","language":[{"iso":"eng"}],"abstract":[{"text":"We define a new compact coordinate system in which each integer triplet addresses a voxel in the BCC grid, and we investigate some of its properties. We propose a characterization of 3D discrete analytical planes with their topological features (in the Cartesian and in the new coordinate system) such as the interrelation between the thickness of the plane and the separability constraint we aim to obtain.","lang":"eng"}],"external_id":{"isi":["001286400400010"]},"type":"conference","quality_controlled":"1","citation":{"mla":"Čomić, Lidija, et al. “Body Centered Cubic Grid - Coordinate System and Discrete Analytical Plane Definition.” <i>Discrete Geometry and Mathematical Morphology</i>, vol. 12708, Springer Nature, 2021, pp. 152–63, doi:<a href=\"https://doi.org/10.1007/978-3-030-76657-3_10\">10.1007/978-3-030-76657-3_10</a>.","ieee":"L. Čomić, R. Zrour, G. Largeteau-Skapin, R. Biswas, and E. Andres, “Body centered cubic grid - coordinate system and discrete analytical plane definition,” in <i>Discrete Geometry and Mathematical Morphology</i>, Uppsala, Sweden, 2021, vol. 12708, pp. 152–163.","short":"L. Čomić, R. Zrour, G. Largeteau-Skapin, R. Biswas, E. Andres, in:, Discrete Geometry and Mathematical Morphology, Springer Nature, 2021, pp. 152–163.","apa":"Čomić, L., Zrour, R., Largeteau-Skapin, G., Biswas, R., &#38; Andres, E. (2021). Body centered cubic grid - coordinate system and discrete analytical plane definition. In <i>Discrete Geometry and Mathematical Morphology</i> (Vol. 12708, pp. 152–163). Uppsala, Sweden: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-76657-3_10\">https://doi.org/10.1007/978-3-030-76657-3_10</a>","ama":"Čomić L, Zrour R, Largeteau-Skapin G, Biswas R, Andres E. Body centered cubic grid - coordinate system and discrete analytical plane definition. In: <i>Discrete Geometry and Mathematical Morphology</i>. Vol 12708. Springer Nature; 2021:152-163. doi:<a href=\"https://doi.org/10.1007/978-3-030-76657-3_10\">10.1007/978-3-030-76657-3_10</a>","ista":"Čomić L, Zrour R, Largeteau-Skapin G, Biswas R, Andres E. 2021. Body centered cubic grid - coordinate system and discrete analytical plane definition. Discrete Geometry and Mathematical Morphology. DGMM: International Conference on Discrete Geometry and Mathematical Morphology, LNCS, vol. 12708, 152–163.","chicago":"Čomić, Lidija, Rita Zrour, Gaëlle Largeteau-Skapin, Ranita Biswas, and Eric Andres. “Body Centered Cubic Grid - Coordinate System and Discrete Analytical Plane Definition.” In <i>Discrete Geometry and Mathematical Morphology</i>, 12708:152–63. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-76657-3_10\">https://doi.org/10.1007/978-3-030-76657-3_10</a>."},"day":"16","status":"public","page":"152-163","ec_funded":1,"scopus_import":"1","publication":"Discrete Geometry and Mathematical Morphology","date_updated":"2026-04-16T09:26:30Z","isi":1},{"ec_funded":1,"page":"276","status":"public","date_updated":"2026-04-16T09:52:03Z","file_date_updated":"2022-03-10T12:15:18Z","date_published":"2021-09-23T00:00:00Z","OA_place":"publisher","year":"2021","ddc":["519"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","has_accepted_license":"1","day":"23","citation":{"apa":"Klein, K. (2021). <i>On the adaptive security of graph-based games</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10035\">https://doi.org/10.15479/at:ista:10035</a>","mla":"Klein, Karen. <i>On the Adaptive Security of Graph-Based Games</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10035\">10.15479/at:ista:10035</a>.","short":"K. Klein, On the Adaptive Security of Graph-Based Games, Institute of Science and Technology Austria, 2021.","ieee":"K. Klein, “On the adaptive security of graph-based games,” Institute of Science and Technology Austria, 2021.","chicago":"Klein, Karen. “On the Adaptive Security of Graph-Based Games.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10035\">https://doi.org/10.15479/at:ista:10035</a>.","ama":"Klein K. On the adaptive security of graph-based games. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10035\">10.15479/at:ista:10035</a>","ista":"Klein K. 2021. On the adaptive security of graph-based games. Institute of Science and Technology Austria."},"_id":"10035","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Many security definitions come in two flavors: a stronger “adaptive” flavor, where the adversary can arbitrarily make various choices during the course of the attack, and a weaker “selective” flavor where the adversary must commit to some or all of their choices a-priori. For example, in the context of identity-based encryption, selective security requires the adversary to decide on the identity of the attacked party at the very beginning of the game whereas adaptive security allows the attacker to first see the master public key and some secret keys before making this choice. Often, it appears to be much easier to achieve selective security than it is to achieve adaptive security. A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption [Pan07][FJP15], constrained PRFs [FKPR14], and Yao’s garbled circuits [JW16]. Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework (published at Crypto ’17 [JKK+17a]) that connects all of these works and allows us to present them in a unified and simplified fashion. Having the framework in place, we show how to achieve adaptive security for proxy re-encryption schemes (published at PKC ’19 [FKKP19]) and provide the first adaptive security proofs for continuous group key agreement protocols (published at S&P ’21 [KPW+21]). Questioning optimality of our framework, we then show that currently used proof techniques cannot lead to significantly better security guarantees for \"graph-building\" games (published at TCC ’21 [KKPW21a]). These games cover generalized selective decryption, as well as the security of prominent constructions for constrained PRFs, continuous group key agreement, and proxy re-encryption. Finally, we revisit the adaptive security of Yao’s garbled circuits and extend the analysis of Jafargholi and Wichs in two directions: While they prove adaptive security only for a modified construction with increased online complexity, we provide the first positive results for the original construction by Yao (published at TCC ’21 [KKP21a]). On the negative side, we prove that the results of Jafargholi and Wichs are essentially optimal by showing that no black-box reduction can provide a significantly better security bound (published at Crypto ’21 [KKPW21c])."}],"type":"dissertation","related_material":{"record":[{"status":"public","id":"10044","relation":"part_of_dissertation"},{"status":"public","id":"10048","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"10041","status":"public"},{"relation":"part_of_dissertation","id":"10049","status":"public"},{"status":"public","id":"637","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"6430","status":"public"}]},"tmp":{"short":"CC BY (4.0)","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)"},"corr_author":"1","article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","author":[{"last_name":"Klein","full_name":"Klein, Karen","first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"}],"project":[{"name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"682815"}],"month":"09","department":[{"_id":"GradSch"},{"_id":"KrPi"}],"degree_awarded":"PhD","acknowledgement":"I want to acknowledge the funding by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).\r\n","doi":"10.15479/at:ista:10035","oa":1,"title":"On the adaptive security of graph-based games","alternative_title":["ISTA Thesis"],"date_created":"2021-09-23T07:31:44Z","oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"]},"file":[{"access_level":"open_access","file_size":2104726,"date_created":"2021-10-04T12:22:33Z","content_type":"application/pdf","success":1,"file_name":"thesis_pdfa.pdf","checksum":"73a44345c683e81f3e765efbf86fdcc5","file_id":"10082","creator":"cchlebak","relation":"main_file","date_updated":"2021-10-04T12:22:33Z"},{"date_updated":"2022-03-10T12:15:18Z","creator":"cchlebak","relation":"source_file","file_id":"10085","file_name":"thesis_final (1).zip","checksum":"7b80df30a0e686c3ef6a56d4e1c59e29","date_created":"2021-10-05T07:04:37Z","file_size":9538359,"content_type":"application/x-zip-compressed","access_level":"closed"}],"supervisor":[{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"publication_status":"published"},{"citation":{"mla":"Schlögl, Alois, et al. “Managing Software on a Heterogenous HPC Cluster.” <i>ASHPC21 – Austrian-Slovenian HPC Meeting 2021</i>, University of Ljubljana, 2021, p. 5, doi:<a href=\"https://doi.org/10.3359/2021hpc\">10.3359/2021hpc</a>.","short":"A. Schlögl, S. Elefante, A. Hornoiu, S. Stadlbauer, in:, ASHPC21 – Austrian-Slovenian HPC Meeting 2021, University of Ljubljana, 2021, p. 5.","ieee":"A. Schlögl, S. Elefante, A. Hornoiu, and S. Stadlbauer, “Managing software on a heterogenous HPC cluster,” in <i>ASHPC21 – Austrian-Slovenian HPC Meeting 2021</i>, Virtual, 2021, p. 5.","apa":"Schlögl, A., Elefante, S., Hornoiu, A., &#38; Stadlbauer, S. (2021). Managing software on a heterogenous HPC cluster. In <i>ASHPC21 – Austrian-Slovenian HPC Meeting 2021</i> (p. 5). Virtual: University of Ljubljana. <a href=\"https://doi.org/10.3359/2021hpc\">https://doi.org/10.3359/2021hpc</a>","ama":"Schlögl A, Elefante S, Hornoiu A, Stadlbauer S. Managing software on a heterogenous HPC cluster. In: <i>ASHPC21 – Austrian-Slovenian HPC Meeting 2021</i>. University of Ljubljana; 2021:5. doi:<a href=\"https://doi.org/10.3359/2021hpc\">10.3359/2021hpc</a>","ista":"Schlögl A, Elefante S, Hornoiu A, Stadlbauer S. 2021. Managing software on a heterogenous HPC cluster. ASHPC21 – Austrian-Slovenian HPC Meeting 2021. ASHPC: Austrian-Slovenian HPC Meeting, 5.","chicago":"Schlögl, Alois, Stefano Elefante, Andrei Hornoiu, and Stephan Stadlbauer. “Managing Software on a Heterogenous HPC Cluster.” In <i>ASHPC21 – Austrian-Slovenian HPC Meeting 2021</i>, 5. University of Ljubljana, 2021. <a href=\"https://doi.org/10.3359/2021hpc\">https://doi.org/10.3359/2021hpc</a>."},"day":"02","has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"12909","type":"conference_abstract","date_published":"2021-06-02T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://vsc.ac.at/fileadmin/user_upload/vsc/conferences/ashpc21/BOOKLET_ASHPC21.pdf"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ddc":["000"],"year":"2021","publication":"ASHPC21 – Austrian-Slovenian HPC Meeting 2021","date_updated":"2026-04-16T10:19:31Z","file_date_updated":"2023-05-16T07:36:34Z","status":"public","page":"5","file":[{"access_level":"open_access","content_type":"application/pdf","success":1,"date_created":"2023-05-16T07:36:34Z","file_size":422761,"checksum":"ba73f85858fb9d5737ebc7724646dd45","file_name":"2021_ASHPC_Schloegl.pdf","relation":"main_file","creator":"dernst","file_id":"12971","date_updated":"2023-05-16T07:36:34Z"}],"conference":{"end_date":"2021-06-02","location":"Virtual","name":"ASHPC: Austrian-Slovenian HPC Meeting","start_date":"2021-05-31"},"publication_status":"published","title":"Managing software on a heterogenous HPC cluster","date_created":"2023-05-05T13:17:36Z","oa_version":"Published Version","publication_identifier":{"isbn":["978-961-6980-77-7","978-961-6133-48-7"]},"author":[{"last_name":"Schlögl","full_name":"Schlögl, Alois","first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100"},{"first_name":"Stefano","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","full_name":"Elefante, Stefano","last_name":"Elefante"},{"id":"77129392-B450-11EA-8745-D4653DDC885E","first_name":"Andrei","last_name":"Hornoiu","full_name":"Hornoiu, Andrei"},{"first_name":"Stephan","id":"4D0BC184-F248-11E8-B48F-1D18A9856A87","last_name":"Stadlbauer","full_name":"Stadlbauer, Stephan"}],"month":"06","department":[{"_id":"ScienComp"}],"oa":1,"doi":"10.3359/2021hpc","article_processing_charge":"No","corr_author":"1","publisher":"University of Ljubljana"}]