[{"doi":"10.1109/RadarConf2043947.2020.9266397","acknowledgement":"This work was supported by the Institute of Science and Technology Austria (IST Austria), the European Research Council under grant agreement number 758053 (ERC StG QUNNECT) and the EU’s Horizon 2020 research and innovation programme under grant agreement number 862644 (FET Open QUARTET). S.B. acknowledges support from the Marie Skłodowska Curie\r\nfellowship number 707438 (MSC-IF SUPEREOM), DV acknowledge support from EU’s Horizon 2020 research and innovation programme under grant agreement number 732894 (FET Proactive HOT) and the Project QuaSeRT funded by the QuantERA ERANET Cofund in Quantum Technologies, and J.M.F from the Austrian Science Fund (FWF) through BeyondC (F71), a NOMIS foundation research grant, and the EU’s Horizon 2020 research and\r\ninnovation programme under grant agreement number 732894 (FET Proactive\r\nHOT).","intvolume":"      2020","date_updated":"2026-04-15T06:42:36Z","type":"conference","publisher":"IEEE","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"year":"2020","_id":"9001","publication_identifier":{"issn":["1097-5659"],"isbn":["9781728189420"]},"quality_controlled":"1","language":[{"iso":"eng"}],"conference":{"name":"RadarConf: National Conference on Radar","end_date":"2020-09-25","start_date":"2020-09-21","location":"Florence, Italy"},"arxiv":1,"date_created":"2021-01-10T23:01:17Z","citation":{"chicago":"Barzanjeh, Shabir, Stefano Pirandola, David Vitali, and Johannes M Fink. “Microwave Quantum Illumination with a Digital Phase-Conjugated Receiver.” In <i>IEEE National Radar Conference - Proceedings</i>, Vol. 2020. IEEE, 2020. <a href=\"https://doi.org/10.1109/RadarConf2043947.2020.9266397\">https://doi.org/10.1109/RadarConf2043947.2020.9266397</a>.","ama":"Barzanjeh S, Pirandola S, Vitali D, Fink JM. Microwave quantum illumination with a digital phase-conjugated receiver. In: <i>IEEE National Radar Conference - Proceedings</i>. Vol 2020. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/RadarConf2043947.2020.9266397\">10.1109/RadarConf2043947.2020.9266397</a>","apa":"Barzanjeh, S., Pirandola, S., Vitali, D., &#38; Fink, J. M. (2020). Microwave quantum illumination with a digital phase-conjugated receiver. In <i>IEEE National Radar Conference - Proceedings</i> (Vol. 2020). Florence, Italy: IEEE. <a href=\"https://doi.org/10.1109/RadarConf2043947.2020.9266397\">https://doi.org/10.1109/RadarConf2043947.2020.9266397</a>","ieee":"S. Barzanjeh, S. Pirandola, D. Vitali, and J. M. Fink, “Microwave quantum illumination with a digital phase-conjugated receiver,” in <i>IEEE National Radar Conference - Proceedings</i>, Florence, Italy, 2020, vol. 2020, no. 9.","mla":"Barzanjeh, Shabir, et al. “Microwave Quantum Illumination with a Digital Phase-Conjugated Receiver.” <i>IEEE National Radar Conference - Proceedings</i>, vol. 2020, no. 9, 9266397, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/RadarConf2043947.2020.9266397\">10.1109/RadarConf2043947.2020.9266397</a>.","ista":"Barzanjeh S, Pirandola S, Vitali D, Fink JM. 2020. Microwave quantum illumination with a digital phase-conjugated receiver. IEEE National Radar Conference - Proceedings. RadarConf: National Conference on Radar vol. 2020, 9266397.","short":"S. Barzanjeh, S. Pirandola, D. Vitali, J.M. Fink, in:, IEEE National Radar Conference - Proceedings, IEEE, 2020."},"oa":1,"article_processing_charge":"No","month":"09","volume":2020,"date_published":"2020-09-21T00:00:00Z","related_material":{"record":[{"id":"7910","relation":"earlier_version","status":"public"}]},"article_number":"9266397","scopus_import":"1","publication_status":"published","day":"21","abstract":[{"text":"Quantum illumination is a sensing technique that employs entangled signal-idler beams to improve the detection efficiency of low-reflectivity objects in environments with large thermal noise. The advantage over classical strategies is evident at low signal brightness, a feature which could make the protocol an ideal prototype for non-invasive scanning or low-power short-range radar. Here we experimentally investigate the concept of quantum illumination at microwave frequencies, by generating entangled fields using a Josephson parametric converter which are then amplified to illuminate a room-temperature object at a distance of 1 meter. Starting from experimental data, we simulate the case of perfect idler photon number detection, which results in a quantum advantage compared to the relative classical benchmark. Our results highlight the opportunities and challenges on the way towards a first room-temperature application of microwave quantum circuits.","lang":"eng"}],"project":[{"grant_number":"758053","name":"A Fiber Optic Transceiver for Superconducting Qubits","call_identifier":"H2020","_id":"26336814-B435-11E9-9278-68D0E5697425"},{"_id":"237CBA6C-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","name":"Quantum readout techniques and technologies","grant_number":"862644"},{"grant_number":"707438","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics","call_identifier":"H2020","_id":"258047B6-B435-11E9-9278-68D0E5697425"},{"_id":"257EB838-B435-11E9-9278-68D0E5697425","name":"Hybrid Optomechanical Technologies","call_identifier":"H2020","grant_number":"732894"}],"issue":"9","publication":"IEEE National Radar Conference - Proceedings","oa_version":"Preprint","ec_funded":1,"author":[{"orcid":"0000-0003-0415-1423","full_name":"Barzanjeh, Shabir","first_name":"Shabir","last_name":"Barzanjeh","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stefano","last_name":"Pirandola","full_name":"Pirandola, Stefano"},{"first_name":"David","last_name":"Vitali","full_name":"Vitali, David"},{"orcid":"0000-0001-8112-028X","last_name":"Fink","first_name":"Johannes M","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["1908.03058"],"isi":["000612224900089"]},"department":[{"_id":"JoFi"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.03058"}],"title":"Microwave quantum illumination with a digital phase-conjugated receiver"},{"date_updated":"2026-04-15T06:43:02Z","corr_author":"1","type":"research_data_reference","publisher":"Zenodo","status":"public","doi":"10.5281/ZENODO.4052882","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"8755"}]},"_id":"13070","oa_version":"Published Version","year":"2020","abstract":[{"lang":"eng","text":"This dataset comprises all data shown in the figures of the submitted article \"Surpassing the resistance quantum with a geometric superinductor\". Additional raw data are available from the corresponding author on reasonable request."}],"ddc":["530"],"day":"27","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-05-23T16:42:30Z","license":"https://creativecommons.org/licenses/by/4.0/","author":[{"full_name":"Peruzzo, Matilda","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","first_name":"Matilda","last_name":"Peruzzo","orcid":"0000-0002-3415-4628"},{"id":"42F71B44-F248-11E8-B48F-1D18A9856A87","first_name":"Andrea","full_name":"Trioni, Andrea","last_name":"Trioni"},{"full_name":"Hassani, Farid","last_name":"Hassani","first_name":"Farid","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6937-5773"},{"orcid":"0009-0005-0878-3032","full_name":"Zemlicka, Martin","last_name":"Zemlicka","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"orcid":"0000-0001-8112-028X","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M","last_name":"Fink"}],"title":"Surpassing the resistance quantum with a geometric superinductor","date_published":"2020-09-27T00:00:00Z","oa":1,"month":"09","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.4052883"}],"citation":{"ista":"Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. 2020. Surpassing the resistance quantum with a geometric superinductor, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.4052882\">10.5281/ZENODO.4052882</a>.","short":"M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, J.M. Fink, (2020).","ama":"Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. Surpassing the resistance quantum with a geometric superinductor. 2020. doi:<a href=\"https://doi.org/10.5281/ZENODO.4052882\">10.5281/ZENODO.4052882</a>","chicago":"Peruzzo, Matilda, Andrea Trioni, Farid Hassani, Martin Zemlicka, and Johannes M Fink. “Surpassing the Resistance Quantum with a Geometric Superinductor.” Zenodo, 2020. <a href=\"https://doi.org/10.5281/ZENODO.4052882\">https://doi.org/10.5281/ZENODO.4052882</a>.","apa":"Peruzzo, M., Trioni, A., Hassani, F., Zemlicka, M., &#38; Fink, J. M. (2020). Surpassing the resistance quantum with a geometric superinductor. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.4052882\">https://doi.org/10.5281/ZENODO.4052882</a>","ieee":"M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, and J. M. Fink, “Surpassing the resistance quantum with a geometric superinductor.” Zenodo, 2020.","mla":"Peruzzo, Matilda, et al. <i>Surpassing the Resistance Quantum with a Geometric Superinductor</i>. Zenodo, 2020, doi:<a href=\"https://doi.org/10.5281/ZENODO.4052882\">10.5281/ZENODO.4052882</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"JoFi"}]},{"article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.4266026","open_access":"1"}],"month":"11","oa":1,"department":[{"_id":"JoFi"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"ista":"Hease WJ, Rueda Sanchez AR, Sahu R, Wulf M, Arnold GM, Schwefel H, Fink JM. 2020. Bidirectional electro-optic wavelength conversion in the quantum ground state, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.4266025\">10.5281/ZENODO.4266025</a>.","short":"W.J. Hease, A.R. Rueda Sanchez, R. Sahu, M. Wulf, G.M. Arnold, H. Schwefel, J.M. Fink, (2020).","ama":"Hease WJ, Rueda Sanchez AR, Sahu R, et al. Bidirectional electro-optic wavelength conversion in the quantum ground state. 2020. doi:<a href=\"https://doi.org/10.5281/ZENODO.4266025\">10.5281/ZENODO.4266025</a>","chicago":"Hease, William J, Alfredo R Rueda Sanchez, Rishabh Sahu, Matthias Wulf, Georg M Arnold, Harald Schwefel, and Johannes M Fink. “Bidirectional Electro-Optic Wavelength Conversion in the Quantum Ground State.” Zenodo, 2020. <a href=\"https://doi.org/10.5281/ZENODO.4266025\">https://doi.org/10.5281/ZENODO.4266025</a>.","apa":"Hease, W. J., Rueda Sanchez, A. R., Sahu, R., Wulf, M., Arnold, G. M., Schwefel, H., &#38; Fink, J. M. (2020). Bidirectional electro-optic wavelength conversion in the quantum ground state. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.4266025\">https://doi.org/10.5281/ZENODO.4266025</a>","ieee":"W. J. Hease <i>et al.</i>, “Bidirectional electro-optic wavelength conversion in the quantum ground state.” Zenodo, 2020.","mla":"Hease, William J., et al. <i>Bidirectional Electro-Optic Wavelength Conversion in the Quantum Ground State</i>. Zenodo, 2020, doi:<a href=\"https://doi.org/10.5281/ZENODO.4266025\">10.5281/ZENODO.4266025</a>."},"date_published":"2020-11-10T00:00:00Z","title":"Bidirectional electro-optic wavelength conversion in the quantum ground state","author":[{"last_name":"Hease","id":"29705398-F248-11E8-B48F-1D18A9856A87","full_name":"Hease, William J","first_name":"William J","orcid":"0000-0001-9868-2166"},{"last_name":"Rueda Sanchez","full_name":"Rueda Sanchez, Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","first_name":"Alfredo R","orcid":"0000-0001-6249-5860"},{"orcid":"0000-0001-6264-2162","last_name":"Sahu","first_name":"Rishabh","id":"47D26E34-F248-11E8-B48F-1D18A9856A87","full_name":"Sahu, Rishabh"},{"full_name":"Wulf, Matthias","first_name":"Matthias","last_name":"Wulf","id":"45598606-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6613-1378"},{"last_name":"Arnold","full_name":"Arnold, Georg M","first_name":"Georg M","id":"3770C838-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1397-7876"},{"first_name":"Harald","full_name":"Schwefel, Harald","last_name":"Schwefel"},{"first_name":"Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M","orcid":"0000-0001-8112-028X"}],"date_created":"2023-05-23T16:44:11Z","ddc":["530"],"abstract":[{"lang":"eng","text":"This dataset comprises all data shown in the plots of the main part of the submitted article \"Bidirectional Electro-Optic Wavelength Conversion in the Quantum Ground State\". Additional raw data are available from the corresponding author on reasonable request."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"10","_id":"13071","year":"2020","oa_version":"Published Version","doi":"10.5281/ZENODO.4266025","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"9114"}]},"corr_author":"1","publisher":"Zenodo","type":"research_data_reference","status":"public","date_updated":"2026-04-15T06:43:26Z"},{"external_id":{"isi":["000583700300038"]},"author":[{"first_name":"Tomas","full_name":"Skrivan, Tomas","last_name":"Skrivan","id":"486A5A46-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andreas","full_name":"Soderstrom, Andreas","last_name":"Soderstrom"},{"last_name":"Johansson","full_name":"Johansson, John","first_name":"John"},{"last_name":"Sprenger","full_name":"Sprenger, Christoph","first_name":"Christoph"},{"full_name":"Museth, Ken","last_name":"Museth","first_name":"Ken"},{"last_name":"Wojtan","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546"}],"title":"Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces","file":[{"file_size":20223953,"content_type":"application/pdf","file_name":"2020_ACM_Skrivan.pdf","success":1,"date_created":"2020-09-21T07:51:44Z","relation":"main_file","date_updated":"2020-09-21T07:51:44Z","access_level":"open_access","creator":"dernst","checksum":"c3a680893f01cc4a9e961ff0a4cfa12f","file_id":"8541"}],"department":[{"_id":"ChWo"}],"publication_status":"published","corr_author":"1","scopus_import":"1","article_number":"65","has_accepted_license":"1","ec_funded":1,"oa_version":"Published Version","issue":"4","publication":"ACM Transactions on Graphics","project":[{"call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176"},{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"day":"08","abstract":[{"lang":"eng","text":"We propose a method to enhance the visual detail of a water surface simulation. Our method works as a post-processing step which takes a simulation as input and increases its apparent resolution by simulating many detailed Lagrangian water waves on top of it. We extend linear water wave theory to work in non-planar domains which deform over time, and we discretize the theory using Lagrangian wave packets attached to spline curves. The method is numerically stable and trivially parallelizable, and it produces high frequency ripples with dispersive wave-like behaviors customized to the underlying fluid simulation."}],"ddc":["000"],"date_created":"2020-09-20T22:01:37Z","language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"file_date_updated":"2020-09-21T07:51:44Z","date_published":"2020-07-08T00:00:00Z","article_processing_charge":"No","month":"07","volume":39,"oa":1,"citation":{"ista":"Skrivan T, Soderstrom A, Johansson J, Sprenger C, Museth K, Wojtan C. 2020. Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces. ACM Transactions on Graphics. 39(4), 65.","short":"T. Skrivan, A. Soderstrom, J. Johansson, C. Sprenger, K. Museth, C. Wojtan, ACM Transactions on Graphics 39 (2020).","apa":"Skrivan, T., Soderstrom, A., Johansson, J., Sprenger, C., Museth, K., &#38; Wojtan, C. (2020). Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3386569.3392466\">https://doi.org/10.1145/3386569.3392466</a>","mla":"Skrivan, Tomas, et al. “Wave Curves: Simulating Lagrangian Water Waves on Dynamically Deforming Surfaces.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, 65, Association for Computing Machinery, 2020, doi:<a href=\"https://doi.org/10.1145/3386569.3392466\">10.1145/3386569.3392466</a>.","ieee":"T. Skrivan, A. Soderstrom, J. Johansson, C. Sprenger, K. Museth, and C. Wojtan, “Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4. Association for Computing Machinery, 2020.","ama":"Skrivan T, Soderstrom A, Johansson J, Sprenger C, Museth K, Wojtan C. Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces. <i>ACM Transactions on Graphics</i>. 2020;39(4). doi:<a href=\"https://doi.org/10.1145/3386569.3392466\">10.1145/3386569.3392466</a>","chicago":"Skrivan, Tomas, Andreas Soderstrom, John Johansson, Christoph Sprenger, Ken Museth, and Chris Wojtan. “Wave Curves: Simulating Lagrangian Water Waves on Dynamically Deforming Surfaces.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3386569.3392466\">https://doi.org/10.1145/3386569.3392466</a>."},"status":"public","type":"journal_article","publisher":"Association for Computing Machinery","date_updated":"2026-04-16T08:26:38Z","intvolume":"        39","acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. 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 and Marie SkłodowskaCurie Grant Agreement No. 665385.","doi":"10.1145/3386569.3392466","acknowledged_ssus":[{"_id":"ScienComp"}],"_id":"8535","year":"2020","article_type":"original","isi":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"date_published":"2020-01-02T00:00:00Z","file_date_updated":"2020-07-14T12:47:56Z","citation":{"ama":"Piriya Ananda Babu L, Wang HY, Eguchi K, Guillaud L, Takahashi T. Microtubule and actin differentially regulate synaptic vesicle cycling to maintain high-frequency neurotransmission. <i>Journal of neuroscience</i>. 2020;40(1):131-142. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1571-19.2019\">10.1523/JNEUROSCI.1571-19.2019</a>","chicago":"Piriya Ananda Babu, Lashmi, Han Ying Wang, Kohgaku Eguchi, Laurent Guillaud, and Tomoyuki Takahashi. “Microtubule and Actin Differentially Regulate Synaptic Vesicle Cycling to Maintain High-Frequency Neurotransmission.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2020. <a href=\"https://doi.org/10.1523/JNEUROSCI.1571-19.2019\">https://doi.org/10.1523/JNEUROSCI.1571-19.2019</a>.","ieee":"L. Piriya Ananda Babu, H. Y. Wang, K. Eguchi, L. Guillaud, and T. Takahashi, “Microtubule and actin differentially regulate synaptic vesicle cycling to maintain high-frequency neurotransmission,” <i>Journal of neuroscience</i>, vol. 40, no. 1. Society for Neuroscience, pp. 131–142, 2020.","mla":"Piriya Ananda Babu, Lashmi, et al. “Microtubule and Actin Differentially Regulate Synaptic Vesicle Cycling to Maintain High-Frequency Neurotransmission.” <i>Journal of Neuroscience</i>, vol. 40, no. 1, Society for Neuroscience, 2020, pp. 131–42, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1571-19.2019\">10.1523/JNEUROSCI.1571-19.2019</a>.","apa":"Piriya Ananda Babu, L., Wang, H. Y., Eguchi, K., Guillaud, L., &#38; Takahashi, T. (2020). Microtubule and actin differentially regulate synaptic vesicle cycling to maintain high-frequency neurotransmission. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.1571-19.2019\">https://doi.org/10.1523/JNEUROSCI.1571-19.2019</a>","short":"L. Piriya Ananda Babu, H.Y. Wang, K. Eguchi, L. Guillaud, T. Takahashi, Journal of Neuroscience 40 (2020) 131–142.","ista":"Piriya Ananda Babu L, Wang HY, Eguchi K, Guillaud L, Takahashi T. 2020. Microtubule and actin differentially regulate synaptic vesicle cycling to maintain high-frequency neurotransmission. Journal of neuroscience. 40(1), 131–142."},"oa":1,"article_processing_charge":"No","month":"01","volume":40,"date_created":"2020-01-19T23:00:38Z","publication_identifier":{"issn":["0270-6474"],"eissn":["1529-2401"]},"quality_controlled":"1","language":[{"iso":"eng"}],"year":"2020","pmid":1,"_id":"7339","page":"131-142","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","isi":1,"article_type":"original","intvolume":"        40","date_updated":"2026-04-16T08:27:29Z","status":"public","publisher":"Society for Neuroscience","type":"journal_article","doi":"10.1523/JNEUROSCI.1571-19.2019","title":"Microtubule and actin differentially regulate synaptic vesicle cycling to maintain high-frequency neurotransmission","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"RySh"}],"file":[{"date_created":"2020-01-20T14:44:10Z","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:47:56Z","creator":"dernst","file_id":"7345","checksum":"92f5e8a47f454fc131fb94cd7f106e60","file_name":"2020_JourNeuroscience_Piriya.pdf","file_size":4460781,"content_type":"application/pdf"}],"external_id":{"isi":["000505167600013"],"pmid":["31767677"]},"author":[{"last_name":"Piriya Ananda Babu","full_name":"Piriya Ananda Babu, Lashmi","first_name":"Lashmi"},{"first_name":"Han Ying","full_name":"Wang, Han Ying","last_name":"Wang"},{"full_name":"Eguchi, Kohgaku","first_name":"Kohgaku","last_name":"Eguchi","id":"2B7846DC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6170-2546"},{"full_name":"Guillaud, Laurent","last_name":"Guillaud","first_name":"Laurent"},{"last_name":"Takahashi","first_name":"Tomoyuki","full_name":"Takahashi, Tomoyuki"}],"oa_version":"Published Version","ddc":["570"],"abstract":[{"text":"Cytoskeletal filaments such as microtubules (MTs) and filamentous actin (F-actin) dynamically support cell structure and functions. In central presynaptic terminals, F-actin is expressed along the release edge and reportedly plays diverse functional roles, but whether axonal MTs extend deep into terminals and play any physiological role remains controversial. At the calyx of Held in rats of either sex, confocal and high-resolution microscopy revealed that MTs enter deep into presynaptic terminal swellings and partially colocalize with a subset of synaptic vesicles (SVs). Electrophysiological analysis demonstrated that depolymerization of MTs specifically prolonged the slow-recovery time component of EPSCs from short-term depression induced by a train of high-frequency stimulation, whereas depolymerization of F-actin specifically prolonged the fast-recovery component. In simultaneous presynaptic and postsynaptic action potential recordings, depolymerization of MTs or F-actin significantly impaired the fidelity of high-frequency neurotransmission. We conclude that MTs and F-actin differentially contribute to slow and fast SV replenishment, thereby maintaining high-frequency neurotransmission.","lang":"eng"}],"day":"02","issue":"1","publication":"Journal of neuroscience","scopus_import":"1","publication_status":"published","has_accepted_license":"1"},{"author":[{"full_name":"Chatterley, Adam S.","last_name":"Chatterley","first_name":"Adam S."},{"full_name":"Christiansen, Lars","first_name":"Lars","last_name":"Christiansen"},{"first_name":"Constant A.","last_name":"Schouder","full_name":"Schouder, Constant A."},{"last_name":"Jørgensen","full_name":"Jørgensen, Anders V.","first_name":"Anders V."},{"first_name":"Benjamin","last_name":"Shepperson","full_name":"Shepperson, Benjamin"},{"full_name":"Cherepanov, Igor","first_name":"Igor","last_name":"Cherepanov","id":"339C7E5A-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8823-9777","last_name":"Bighin","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","full_name":"Bighin, Giacomo","first_name":"Giacomo"},{"first_name":"Robert E.","full_name":"Zillich, Robert E.","last_name":"Zillich"},{"full_name":"Lemeshko, Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","orcid":"0000-0002-6990-7802"},{"last_name":"Stapelfeldt","first_name":"Henrik","full_name":"Stapelfeldt, Henrik"}],"external_id":{"isi":["000544526900006"],"arxiv":["2006.02694"],"pmid":["32678640"]},"main_file_link":[{"url":"https://arxiv.org/abs/2006.02694","open_access":"1"}],"department":[{"_id":"MiLe"}],"title":"Rotational coherence spectroscopy of molecules in Helium nanodroplets: Reconciling the time and the frequency domains","article_number":"013001","publication_status":"published","scopus_import":"1","issue":"1","publication":"Physical Review Letters","project":[{"grant_number":"P29902","_id":"26031614-B435-11E9-9278-68D0E5697425","name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF"},{"grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Angulon: physics and applications of a new quasiparticle"},{"call_identifier":"FWF","name":"A path-integral approach to composite impurities","_id":"26986C82-B435-11E9-9278-68D0E5697425","grant_number":"M02641"},{"grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"day":"03","abstract":[{"lang":"eng","text":"Alignment of OCS, CS2, and I2 molecules embedded in helium nanodroplets is measured as a function\r\nof time following rotational excitation by a nonresonant, comparatively weak ps laser pulse. The distinct\r\npeaks in the power spectra, obtained by Fourier analysis, are used to determine the rotational, B, and\r\ncentrifugal distortion, D, constants. For OCS, B and D match the values known from IR spectroscopy. For\r\nCS2 and I2, they are the first experimental results reported. The alignment dynamics calculated from the\r\ngas-phase rotational Schrödinger equation, using the experimental in-droplet B and D values, agree in\r\ndetail with the measurement for all three molecules. The rotational spectroscopy technique for molecules in\r\nhelium droplets introduced here should apply to a range of molecules and complexes."}],"ec_funded":1,"oa_version":"Preprint","language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"date_created":"2020-07-26T22:01:02Z","arxiv":1,"volume":125,"month":"07","article_processing_charge":"No","oa":1,"citation":{"ama":"Chatterley AS, Christiansen L, Schouder CA, et al. Rotational coherence spectroscopy of molecules in Helium nanodroplets: Reconciling the time and the frequency domains. <i>Physical Review Letters</i>. 2020;125(1). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.125.013001\">10.1103/PhysRevLett.125.013001</a>","chicago":"Chatterley, Adam S., Lars Christiansen, Constant A. Schouder, Anders V. Jørgensen, Benjamin Shepperson, Igor Cherepanov, Giacomo Bighin, Robert E. Zillich, Mikhail Lemeshko, and Henrik Stapelfeldt. “Rotational Coherence Spectroscopy of Molecules in Helium Nanodroplets: Reconciling the Time and the Frequency Domains.” <i>Physical Review Letters</i>. American Physical Society, 2020. <a href=\"https://doi.org/10.1103/PhysRevLett.125.013001\">https://doi.org/10.1103/PhysRevLett.125.013001</a>.","apa":"Chatterley, A. S., Christiansen, L., Schouder, C. A., Jørgensen, A. V., Shepperson, B., Cherepanov, I., … Stapelfeldt, H. (2020). Rotational coherence spectroscopy of molecules in Helium nanodroplets: Reconciling the time and the frequency domains. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.125.013001\">https://doi.org/10.1103/PhysRevLett.125.013001</a>","mla":"Chatterley, Adam S., et al. “Rotational Coherence Spectroscopy of Molecules in Helium Nanodroplets: Reconciling the Time and the Frequency Domains.” <i>Physical Review Letters</i>, vol. 125, no. 1, 013001, American Physical Society, 2020, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.125.013001\">10.1103/PhysRevLett.125.013001</a>.","ieee":"A. S. Chatterley <i>et al.</i>, “Rotational coherence spectroscopy of molecules in Helium nanodroplets: Reconciling the time and the frequency domains,” <i>Physical Review Letters</i>, vol. 125, no. 1. American Physical Society, 2020.","ista":"Chatterley AS, Christiansen L, Schouder CA, Jørgensen AV, Shepperson B, Cherepanov I, Bighin G, Zillich RE, Lemeshko M, Stapelfeldt H. 2020. Rotational coherence spectroscopy of molecules in Helium nanodroplets: Reconciling the time and the frequency domains. Physical Review Letters. 125(1), 013001.","short":"A.S. Chatterley, L. Christiansen, C.A. Schouder, A.V. Jørgensen, B. Shepperson, I. Cherepanov, G. Bighin, R.E. Zillich, M. Lemeshko, H. Stapelfeldt, Physical Review Letters 125 (2020)."},"date_published":"2020-07-03T00:00:00Z","acknowledgement":"H. S. acknowledges support from the European Research Council-AdG (Project No. 320459, DropletControl)\r\nand from The Villum Foundation through a Villum Investigator Grant No. 25886. M. L. acknowledges support\r\nby the Austrian Science Fund (FWF), under Project No. P29902-N27, and by the European Research Council\r\n(ERC) Starting Grant No. 801770 (ANGULON). G. B. acknowledges support from the Austrian Science Fund\r\n(FWF), under Project No. M2641-N27. I. C. acknowledges support by the European Union’s Horizon 2020 research and\r\ninnovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. Computational resources for\r\nthe PIMC simulations were provided by the division for scientific computing at the Johannes Kepler University.","doi":"10.1103/PhysRevLett.125.013001","type":"journal_article","status":"public","publisher":"American Physical Society","date_updated":"2026-04-16T08:21:58Z","intvolume":"       125","article_type":"original","isi":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","_id":"8170","year":"2020","pmid":1},{"year":"2020","pmid":1,"_id":"7656","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","article_type":"original","isi":1,"intvolume":"        14","publisher":"Frontiers","type":"journal_article","status":"public","date_updated":"2026-04-16T08:28:50Z","doi":"10.3389/fncom.2020.00020","date_published":"2020-03-13T00:00:00Z","file_date_updated":"2020-07-14T12:48:01Z","citation":{"ama":"Berry MJ, Tkačik G. Clustering of neural activity: A design principle for population codes. <i>Frontiers in Computational Neuroscience</i>. 2020;14. doi:<a href=\"https://doi.org/10.3389/fncom.2020.00020\">10.3389/fncom.2020.00020</a>","chicago":"Berry, Michael J., and Gašper Tkačik. “Clustering of Neural Activity: A Design Principle for Population Codes.” <i>Frontiers in Computational Neuroscience</i>. Frontiers, 2020. <a href=\"https://doi.org/10.3389/fncom.2020.00020\">https://doi.org/10.3389/fncom.2020.00020</a>.","mla":"Berry, Michael J., and Gašper Tkačik. “Clustering of Neural Activity: A Design Principle for Population Codes.” <i>Frontiers in Computational Neuroscience</i>, vol. 14, 20, Frontiers, 2020, doi:<a href=\"https://doi.org/10.3389/fncom.2020.00020\">10.3389/fncom.2020.00020</a>.","ieee":"M. J. Berry and G. Tkačik, “Clustering of neural activity: A design principle for population codes,” <i>Frontiers in Computational Neuroscience</i>, vol. 14. Frontiers, 2020.","apa":"Berry, M. J., &#38; Tkačik, G. (2020). Clustering of neural activity: A design principle for population codes. <i>Frontiers in Computational Neuroscience</i>. Frontiers. <a href=\"https://doi.org/10.3389/fncom.2020.00020\">https://doi.org/10.3389/fncom.2020.00020</a>","short":"M.J. Berry, G. Tkačik, Frontiers in Computational Neuroscience 14 (2020).","ista":"Berry MJ, Tkačik G. 2020. Clustering of neural activity: A design principle for population codes. Frontiers in Computational Neuroscience. 14, 20."},"month":"03","article_processing_charge":"No","volume":14,"oa":1,"date_created":"2020-04-12T22:00:40Z","quality_controlled":"1","publication_identifier":{"eissn":["1662-5188"]},"language":[{"iso":"eng"}],"oa_version":"Published Version","day":"13","ddc":["570"],"abstract":[{"lang":"eng","text":"We propose that correlations among neurons are generically strong enough to organize neural activity patterns into a discrete set of clusters, which can each be viewed as a population codeword. Our reasoning starts with the analysis of retinal ganglion cell data using maximum entropy models, showing that the population is robustly in a frustrated, marginally sub-critical, or glassy, state. This leads to an argument that neural populations in many other brain areas might share this structure. Next, we use latent variable models to show that this glassy state possesses well-defined clusters of neural activity. Clusters have three appealing properties: (i) clusters exhibit error correction, i.e., they are reproducibly elicited by the same stimulus despite variability at the level of constituent neurons; (ii) clusters encode qualitatively different visual features than their constituent neurons; and (iii) clusters can be learned by downstream neural circuits in an unsupervised fashion. We hypothesize that these properties give rise to a “learnable” neural code which the cortical hierarchy uses to extract increasingly complex features without supervision or reinforcement."}],"publication":"Frontiers in Computational Neuroscience","scopus_import":"1","publication_status":"published","has_accepted_license":"1","article_number":"20","title":"Clustering of neural activity: A design principle for population codes","department":[{"_id":"GaTk"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"file":[{"content_type":"application/pdf","file_size":4082937,"checksum":"2b1da23823eae9cedbb42d701945b61e","file_id":"7659","creator":"dernst","date_updated":"2020-07-14T12:48:01Z","access_level":"open_access","relation":"main_file","date_created":"2020-04-14T12:20:39Z","file_name":"2020_Frontiers_Berry.pdf"}],"external_id":{"pmid":["32231528"],"isi":["000525543200001"]},"author":[{"last_name":"Berry","full_name":"Berry, Michael J.","first_name":"Michael J."},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper","last_name":"Tkačik","first_name":"Gašper","orcid":"0000-0002-6699-1455"}]},{"citation":{"ista":"Nimeth BA, Riegler S, Kalyna M. 2020. Alternative splicing and DNA damage response in plants. Frontiers in Plant Science. 11, 91.","short":"B.A. Nimeth, S. Riegler, M. Kalyna, Frontiers in Plant Science 11 (2020).","apa":"Nimeth, B. A., Riegler, S., &#38; Kalyna, M. (2020). Alternative splicing and DNA damage response in plants. <i>Frontiers in Plant Science</i>. Frontiers. <a href=\"https://doi.org/10.3389/fpls.2020.00091\">https://doi.org/10.3389/fpls.2020.00091</a>","mla":"Nimeth, Barbara Anna, et al. “Alternative Splicing and DNA Damage Response in Plants.” <i>Frontiers in Plant Science</i>, vol. 11, 91, Frontiers, 2020, doi:<a href=\"https://doi.org/10.3389/fpls.2020.00091\">10.3389/fpls.2020.00091</a>.","ieee":"B. A. Nimeth, S. Riegler, and M. Kalyna, “Alternative splicing and DNA damage response in plants,” <i>Frontiers in Plant Science</i>, vol. 11. Frontiers, 2020.","chicago":"Nimeth, Barbara Anna, Stefan Riegler, and Maria Kalyna. “Alternative Splicing and DNA Damage Response in Plants.” <i>Frontiers in Plant Science</i>. Frontiers, 2020. <a href=\"https://doi.org/10.3389/fpls.2020.00091\">https://doi.org/10.3389/fpls.2020.00091</a>.","ama":"Nimeth BA, Riegler S, Kalyna M. Alternative splicing and DNA damage response in plants. <i>Frontiers in Plant Science</i>. 2020;11. doi:<a href=\"https://doi.org/10.3389/fpls.2020.00091\">10.3389/fpls.2020.00091</a>"},"oa":1,"volume":11,"month":"02","article_processing_charge":"No","date_published":"2020-02-19T00:00:00Z","file_date_updated":"2020-07-14T12:48:01Z","quality_controlled":"1","publication_identifier":{"eissn":["1664-462X"]},"language":[{"iso":"eng"}],"date_created":"2020-03-22T23:00:46Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","isi":1,"article_type":"original","year":"2020","_id":"7603","doi":"10.3389/fpls.2020.00091","intvolume":"        11","date_updated":"2026-04-16T08:28:17Z","publisher":"Frontiers","type":"journal_article","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"FyKo"}],"file":[{"file_id":"7607","creator":"dernst","checksum":"57c37209f7b6712ced86c0f11b2be74e","date_updated":"2020-07-14T12:48:01Z","relation":"main_file","access_level":"open_access","date_created":"2020-03-23T09:03:40Z","file_name":"2020_FrontiersPlants_Nimeth.pdf","content_type":"application/pdf","file_size":507414}],"title":"Alternative splicing and DNA damage response in plants","author":[{"full_name":"Nimeth, Barbara Anna","first_name":"Barbara Anna","last_name":"Nimeth"},{"full_name":"Riegler, Stefan","first_name":"Stefan","last_name":"Riegler","id":"FF6018E0-D806-11E9-8E43-0B14E6697425","orcid":"0000-0003-3413-1343"},{"first_name":"Maria","last_name":"Kalyna","full_name":"Kalyna, Maria"}],"external_id":{"isi":["000518903600001"]},"abstract":[{"lang":"eng","text":"Plants are exposed to a variety of abiotic and biotic stresses that may result in DNA damage. Endogenous processes - such as DNA replication, DNA recombination, respiration, or photosynthesis - are also a threat to DNA integrity. It is therefore essential to understand the strategies plants have developed for DNA damage detection, signaling, and repair. Alternative splicing (AS) is a key post-transcriptional process with a role in regulation of gene expression. Recent studies demonstrate that the majority of intron-containing genes in plants are alternatively spliced, highlighting the importance of AS in plant development and stress response. Not only does AS ensure a versatile proteome and influence the abundance and availability of proteins greatly, it has also emerged as an important player in the DNA damage response (DDR) in animals. Despite extensive studies of DDR carried out in plants, its regulation at the level of AS has not been comprehensively addressed. Here, we provide some insights into the interplay between AS and DDR in plants."}],"day":"19","ddc":["580"],"publication":"Frontiers in Plant Science","oa_version":"Published Version","has_accepted_license":"1","article_number":"91","scopus_import":"1","publication_status":"published"},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","isi":1,"article_type":"original","year":"2020","_id":"7212","doi":"10.1371/journal.pcbi.1007494","intvolume":"        16","date_updated":"2026-04-16T08:32:38Z","publisher":"Public Library of Science","status":"public","type":"journal_article","citation":{"short":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, PLoS Computational Biology 16 (2020).","ista":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2020. Limits on amplifiers of natural selection under death-Birth updating. PLoS computational biology. 16, e1007494.","ieee":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Limits on amplifiers of natural selection under death-Birth updating,” <i>PLoS computational biology</i>, vol. 16. Public Library of Science, 2020.","mla":"Tkadlec, Josef, et al. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.” <i>PLoS Computational Biology</i>, vol. 16, e1007494, Public Library of Science, 2020, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007494\">10.1371/journal.pcbi.1007494</a>.","apa":"Tkadlec, J., Pavlogiannis, A., Chatterjee, K., &#38; Nowak, M. A. (2020). Limits on amplifiers of natural selection under death-Birth updating. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1007494\">https://doi.org/10.1371/journal.pcbi.1007494</a>","ama":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Limits on amplifiers of natural selection under death-Birth updating. <i>PLoS computational biology</i>. 2020;16. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007494\">10.1371/journal.pcbi.1007494</a>","chicago":"Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.” <i>PLoS Computational Biology</i>. Public Library of Science, 2020. <a href=\"https://doi.org/10.1371/journal.pcbi.1007494\">https://doi.org/10.1371/journal.pcbi.1007494</a>."},"oa":1,"volume":16,"month":"01","article_processing_charge":"No","date_published":"2020-01-17T00:00:00Z","file_date_updated":"2020-07-14T12:47:53Z","quality_controlled":"1","publication_identifier":{"issn":["1553-734X"],"eissn":["1553-7358"]},"language":[{"iso":"eng"}],"arxiv":1,"date_created":"2019-12-23T13:45:11Z","ddc":["000"],"abstract":[{"lang":"eng","text":"The fixation probability of a single mutant invading a population of residents is among the most widely-studied quantities in evolutionary dynamics. Amplifiers of natural selection are population structures that increase the fixation probability of advantageous mutants, compared to well-mixed populations. Extensive studies have shown that many amplifiers exist for the Birth-death Moran process, some of them substantially increasing the fixation probability or even guaranteeing fixation in the limit of large population size. On the other hand, no amplifiers are known for the death-Birth Moran process, and computer-assisted exhaustive searches have failed to discover amplification. In this work we resolve this disparity, by showing that any amplification under death-Birth updating is necessarily bounded and transient. Our boundedness result states that even if a population structure does amplify selection, the resulting fixation probability is close to that of the well-mixed population. Our transience result states that for any population structure there exists a threshold r⋆ such that the population structure ceases to amplify selection if the mutant fitness advantage r is larger than r⋆. Finally, we also extend the above results to δ-death-Birth updating, which is a combination of Birth-death and death-Birth updating. On the positive side, we identify population structures that maintain amplification for a wide range of values r and δ. These results demonstrate that amplification of natural selection depends on the specific mechanisms of the evolutionary process."}],"day":"17","project":[{"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"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"publication":"PLoS computational biology","oa_version":"Published Version","ec_funded":1,"has_accepted_license":"1","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"7196"}]},"article_number":"e1007494","scopus_import":"1","publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"KrCh"}],"file":[{"creator":"dernst","file_id":"7441","checksum":"ce32ee2d2f53aed832f78bbd47e882df","date_created":"2020-02-03T07:32:42Z","relation":"main_file","date_updated":"2020-07-14T12:47:53Z","access_level":"open_access","file_name":"2020_PlosCompBio_Tkadlec.pdf","content_type":"application/pdf","file_size":1817531}],"title":"Limits on amplifiers of natural selection under death-Birth updating","author":[{"first_name":"Josef","full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","orcid":"0000-0002-1097-9684"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Nowak, Martin A.","last_name":"Nowak","first_name":"Martin A."}],"external_id":{"arxiv":["1906.02785"],"isi":["000510916500025"]}},{"date_created":"2020-09-13T22:01:18Z","quality_controlled":"1","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"language":[{"iso":"eng"}],"date_published":"2020-07-08T00:00:00Z","file_date_updated":"2020-11-23T09:03:19Z","citation":{"short":"S. Ishida, P. Synak, F. Narita, T. Hachisuka, C. Wojtan, ACM Transactions on Graphics 39 (2020).","ista":"Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. 2020. A model for soap film dynamics with evolving thickness. ACM Transactions on Graphics. 39(4), 31.","ieee":"S. Ishida, P. Synak, F. Narita, T. Hachisuka, and C. Wojtan, “A model for soap film dynamics with evolving thickness,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4. Association for Computing Machinery, 2020.","mla":"Ishida, Sadashige, et al. “A Model for Soap Film Dynamics with Evolving Thickness.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, 31, Association for Computing Machinery, 2020, doi:<a href=\"https://doi.org/10.1145/3386569.3392405\">10.1145/3386569.3392405</a>.","apa":"Ishida, S., Synak, P., Narita, F., Hachisuka, T., &#38; Wojtan, C. (2020). A model for soap film dynamics with evolving thickness. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3386569.3392405\">https://doi.org/10.1145/3386569.3392405</a>","ama":"Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. A model for soap film dynamics with evolving thickness. <i>ACM Transactions on Graphics</i>. 2020;39(4). doi:<a href=\"https://doi.org/10.1145/3386569.3392405\">10.1145/3386569.3392405</a>","chicago":"Ishida, Sadashige, Peter Synak, Fumiya Narita, Toshiya Hachisuka, and Chris Wojtan. “A Model for Soap Film Dynamics with Evolving Thickness.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3386569.3392405\">https://doi.org/10.1145/3386569.3392405</a>."},"oa":1,"article_processing_charge":"No","month":"07","volume":39,"intvolume":"        39","date_updated":"2026-04-16T08:29:36Z","publisher":"Association for Computing Machinery","status":"public","type":"journal_article","doi":"10.1145/3386569.3392405","acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback, especially Camille Schreck for her help in rendering. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. We would like to thank the authors of [Belcour and Barla 2017] for providing their implementation, the authors of [Atkins and Elliott 2010] and [Seychelles et al. 2008] for allowing us to use their results, and Rok Grah for helpful discussions. Finally, we thank Ryoichi Ando for many discussions from the beginning of the project that resulted in important contents of the paper including our formulation, numerical scheme, and initial implementation. This project has received funding from the\r\nEuropean Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 638176.","year":"2020","_id":"8384","acknowledged_ssus":[{"_id":"ScienComp"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","isi":1,"article_type":"original","external_id":{"isi":["000583700300004"]},"author":[{"full_name":"Ishida, Sadashige","first_name":"Sadashige","last_name":"Ishida","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","orcid":"0000-0002-3121-3100"},{"full_name":"Synak, Peter","last_name":"Synak","id":"331776E2-F248-11E8-B48F-1D18A9856A87","first_name":"Peter"},{"full_name":"Narita, Fumiya","first_name":"Fumiya","last_name":"Narita"},{"first_name":"Toshiya","last_name":"Hachisuka","full_name":"Hachisuka, Toshiya"},{"last_name":"Wojtan","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546"}],"title":"A model for soap film dynamics with evolving thickness","department":[{"_id":"ChWo"}],"file":[{"date_created":"2020-11-23T09:03:19Z","date_updated":"2020-11-23T09:03:19Z","access_level":"open_access","relation":"main_file","file_id":"8795","checksum":"813831ca91319d794d9748c276b24578","creator":"dernst","file_name":"2020_soapfilm_submitted.pdf","success":1,"file_size":14935529,"content_type":"application/pdf"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3386569.3392405"}],"scopus_import":"1","publication_status":"published","has_accepted_license":"1","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"19630"}]},"article_number":"31","oa_version":"Submitted Version","ec_funded":1,"day":"08","abstract":[{"text":"Previous research on animations of soap bubbles, films, and foams largely focuses on the motion and geometric shape of the bubble surface. These works neglect the evolution of the bubble’s thickness, which is normally responsible for visual phenomena like surface vortices, Newton’s interference patterns, capillary waves, and deformation-dependent rupturing of films in a foam. In this paper, we model these natural phenomena by introducing the film thickness as a reduced degree of freedom in the Navier-Stokes equations and deriving their equations of motion. We discretize the equations on a nonmanifold triangle mesh surface and couple it to an existing bubble solver. In doing so, we also introduce an incompressible fluid solver for 2.5D films and a novel advection algorithm for convecting fields across non-manifold surface junctions. Our simulations enhance state-of-the-art bubble solvers with additional effects caused by convection, rippling, draining, and evaporation of the thin film.","lang":"eng"}],"ddc":["000"],"project":[{"_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020","grant_number":"638176"}],"publication":"ACM Transactions on Graphics","issue":"4"},{"intvolume":"        39","date_updated":"2026-04-16T08:31:55Z","publisher":"Association for Computing Machinery","type":"journal_article","status":"public","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 the creators of the Berkeley Garment Library [de Joya et al. 2012] for providing garment meshes, [Krishnamurthy and Levoy 1996] and [Turk and Levoy 1994] for the armadillo and bunny meshes, the creators of libWetCloth [Fei et al. 2018] for their implementation of discrete elastic rod forces, and Tomáš Skřivan for\r\ninspiring discussions and help with Mathematica code generation. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. 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.","doi":"10.1145/3386569.3392412","year":"2020","_id":"8385","acknowledged_ssus":[{"_id":"ScienComp"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","isi":1,"article_type":"original","date_created":"2020-09-13T22:01:18Z","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"quality_controlled":"1","language":[{"iso":"eng"}],"date_published":"2020-07-08T00:00:00Z","file_date_updated":"2020-11-23T09:01:22Z","citation":{"ama":"Sperl G, Narain R, Wojtan C. Homogenized yarn-level cloth. <i>ACM Transactions on Graphics</i>. 2020;39(4). doi:<a href=\"https://doi.org/10.1145/3386569.3392412\">10.1145/3386569.3392412</a>","chicago":"Sperl, Georg, Rahul Narain, and Chris Wojtan. “Homogenized Yarn-Level Cloth.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3386569.3392412\">https://doi.org/10.1145/3386569.3392412</a>.","ieee":"G. Sperl, R. Narain, and C. Wojtan, “Homogenized yarn-level cloth,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4. Association for Computing Machinery, 2020.","mla":"Sperl, Georg, et al. “Homogenized Yarn-Level Cloth.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, 48, Association for Computing Machinery, 2020, doi:<a href=\"https://doi.org/10.1145/3386569.3392412\">10.1145/3386569.3392412</a>.","apa":"Sperl, G., Narain, R., &#38; Wojtan, C. (2020). Homogenized yarn-level cloth. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3386569.3392412\">https://doi.org/10.1145/3386569.3392412</a>","short":"G. Sperl, R. Narain, C. Wojtan, ACM Transactions on Graphics 39 (2020).","ista":"Sperl G, Narain R, Wojtan C. 2020. Homogenized yarn-level cloth. ACM Transactions on Graphics. 39(4), 48."},"oa":1,"volume":39,"article_processing_charge":"No","month":"07","scopus_import":"1","publication_status":"published","corr_author":"1","has_accepted_license":"1","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"12358"}]},"article_number":"48","oa_version":"Submitted Version","ec_funded":1,"abstract":[{"text":"We present a method for animating yarn-level cloth effects using a thin-shell solver. We accomplish this through numerical homogenization: we first use a large number of yarn-level simulations to build a model of the potential energy density of the cloth, and then use this energy density function to compute forces in a thin shell simulator. We model several yarn-based materials, including both woven and knitted fabrics. Our model faithfully reproduces expected effects like the stiffness of woven fabrics, and the highly deformable nature and anisotropy of knitted fabrics. Our approach does not require any real-world experiments nor measurements; because the method is based entirely on simulations, it can generate entirely new material models quickly, without the need for testing apparatuses or human intervention. We provide data-driven models of several woven and knitted fabrics, which can be used for efficient simulation with an off-the-shelf cloth solver.","lang":"eng"}],"ddc":["000"],"day":"08","project":[{"grant_number":"638176","call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"publication":"ACM Transactions on Graphics","issue":"4","external_id":{"isi":["000583700300021"]},"author":[{"last_name":"Sperl","id":"4DD40360-F248-11E8-B48F-1D18A9856A87","full_name":"Sperl, Georg","first_name":"Georg"},{"last_name":"Narain","full_name":"Narain, Rahul","first_name":"Rahul"},{"orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","full_name":"Wojtan, Christopher J","first_name":"Christopher J"}],"title":"Homogenized yarn-level cloth","department":[{"_id":"ChWo"}],"file":[{"file_name":"2020_hylc_submitted.pdf","success":1,"checksum":"cf4c1d361c3196c4bd424520a5588205","file_id":"8794","creator":"dernst","date_created":"2020-11-23T09:01:22Z","date_updated":"2020-11-23T09:01:22Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_size":38922662}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3386569.3392412"}]},{"publication_identifier":{"eissn":["2663-337X"]},"language":[{"iso":"eng"}],"date_created":"2019-12-20T12:26:36Z","citation":{"apa":"Tkadlec, J. (2020). <i>A role of graphs in evolutionary processes</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7196\">https://doi.org/10.15479/AT:ISTA:7196</a>","ieee":"J. Tkadlec, “A role of graphs in evolutionary processes,” Institute of Science and Technology Austria, 2020.","mla":"Tkadlec, Josef. <i>A Role of Graphs in Evolutionary Processes</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7196\">10.15479/AT:ISTA:7196</a>.","ama":"Tkadlec J. A role of graphs in evolutionary processes. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7196\">10.15479/AT:ISTA:7196</a>","chicago":"Tkadlec, Josef. “A Role of Graphs in Evolutionary Processes.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7196\">https://doi.org/10.15479/AT:ISTA:7196</a>.","ista":"Tkadlec J. 2020. A role of graphs in evolutionary processes. Institute of Science and Technology Austria.","short":"J. Tkadlec, A Role of Graphs in Evolutionary Processes, Institute of Science and Technology Austria, 2020."},"oa":1,"month":"01","article_processing_charge":"No","date_published":"2020-01-12T00:00:00Z","file_date_updated":"2020-07-14T12:47:52Z","supervisor":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"}],"doi":"10.15479/AT:ISTA:7196","date_updated":"2026-04-16T08:32:37Z","publisher":"Institute of Science and Technology Austria","type":"dissertation","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2020","_id":"7196","page":"144","degree_awarded":"PhD","author":[{"orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","first_name":"Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"KrCh"},{"_id":"GradSch"}],"file":[{"creator":"jtkadlec","checksum":"451f8e64b0eb26bf297644ac72bfcbe9","file_id":"7255","date_updated":"2020-07-14T12:47:52Z","relation":"source_file","access_level":"closed","date_created":"2020-01-12T11:49:49Z","file_name":"thesis.zip","content_type":"application/zip","file_size":21100497},{"file_name":"2020_Tkadlec_Thesis.pdf","checksum":"d8c44cbc4f939c49a8efc9d4b8bb3985","file_id":"7367","creator":"dernst","date_created":"2020-01-28T07:32:42Z","access_level":"open_access","date_updated":"2020-07-14T12:47:52Z","relation":"main_file","content_type":"application/pdf","file_size":11670983}],"title":"A role of graphs in evolutionary processes","has_accepted_license":"1","OA_place":"publisher","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"5751"},{"id":"7210","relation":"dissertation_contains","status":"public"},{"status":"public","relation":"dissertation_contains","id":"7212"}]},"alternative_title":["ISTA Thesis"],"corr_author":"1","publication_status":"published","day":"12","abstract":[{"lang":"eng","text":"In this thesis we study certain mathematical aspects of evolution. The two primary forces that drive an evolutionary process are mutation and selection. Mutation generates new variants in a population. Selection chooses among the variants depending on the reproductive rates of individuals. Evolutionary processes are intrinsically random – a new mutation that is initially present in the population at low frequency can go extinct, even if it confers a reproductive advantage. The overall rate of evolution is largely determined by two quantities: the probability that an invading advantageous mutation spreads through the population (called fixation probability) and the time until it does so (called fixation time). Both those quantities crucially depend not only on the strength of the invading mutation but also on the population structure. In this thesis, we aim to understand how the underlying population structure affects the overall rate of evolution. Specifically, we study population structures that increase the fixation probability of advantageous mutants (called amplifiers of selection). Broadly speaking, our results are of three different types: We present various strong amplifiers, we identify regimes under which only limited amplification is feasible, and we propose population structures that provide different tradeoffs between high fixation probability and short fixation time."}],"ddc":["519"],"oa_version":"Published Version"},{"department":[{"_id":"CaGu"}],"title":"Design and application of light-regulated receptor tyrosine kinases","author":[{"orcid":"0000-0002-6709-2195","full_name":"Kainrath, Stephanie","last_name":"Kainrath","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","first_name":"Stephanie"},{"full_name":"Janovjak, Harald L","last_name":"Janovjak","first_name":"Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315"}],"external_id":{"pmid":["32651922"]},"publication":"Photoswitching Proteins","abstract":[{"text":"Understanding how the activity of membrane receptors and cellular signaling pathways shapes cell behavior is of fundamental interest in basic and applied research. Reengineering receptors to react to light instead of their cognate ligands allows for generating defined signaling inputs with high spatial and temporal precision and facilitates the dissection of complex signaling networks. Here, we describe fundamental considerations in the design of light-regulated receptor tyrosine kinases (Opto-RTKs) and appropriate control experiments. We also introduce methods for transient receptor expression in HEK293 cells, quantitative assessment of signaling activity in reporter gene assays, semiquantitative assessment of (in)activation time courses through Western blot (WB) analysis, and easy to implement light stimulation hardware.","lang":"eng"}],"day":"11","oa_version":"None","alternative_title":["Methods in Molecular Biology"],"publication_status":"published","scopus_import":"1","volume":2173,"month":"07","article_processing_charge":"No","citation":{"chicago":"Kainrath, Stephanie, and Harald L Janovjak. “Design and Application of Light-Regulated Receptor Tyrosine Kinases.” In <i>Photoswitching Proteins</i>, edited by Dominik Niopek, 2173:233–46. MIMB. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-1-0716-0755-8_16\">https://doi.org/10.1007/978-1-0716-0755-8_16</a>.","ama":"Kainrath S, Janovjak HL. Design and application of light-regulated receptor tyrosine kinases. In: Niopek D, ed. <i>Photoswitching Proteins</i>. Vol 2173. MIMB. Springer Nature; 2020:233-246. doi:<a href=\"https://doi.org/10.1007/978-1-0716-0755-8_16\">10.1007/978-1-0716-0755-8_16</a>","apa":"Kainrath, S., &#38; Janovjak, H. L. (2020). Design and application of light-regulated receptor tyrosine kinases. In D. Niopek (Ed.), <i>Photoswitching Proteins</i> (Vol. 2173, pp. 233–246). Springer Nature. <a href=\"https://doi.org/10.1007/978-1-0716-0755-8_16\">https://doi.org/10.1007/978-1-0716-0755-8_16</a>","ieee":"S. Kainrath and H. L. Janovjak, “Design and application of light-regulated receptor tyrosine kinases,” in <i>Photoswitching Proteins</i>, vol. 2173, D. Niopek, Ed. Springer Nature, 2020, pp. 233–246.","mla":"Kainrath, Stephanie, and Harald L. Janovjak. “Design and Application of Light-Regulated Receptor Tyrosine Kinases.” <i>Photoswitching Proteins</i>, edited by Dominik Niopek, vol. 2173, Springer Nature, 2020, pp. 233–46, doi:<a href=\"https://doi.org/10.1007/978-1-0716-0755-8_16\">10.1007/978-1-0716-0755-8_16</a>.","ista":"Kainrath S, Janovjak HL. 2020.Design and application of light-regulated receptor tyrosine kinases. In: Photoswitching Proteins. Methods in Molecular Biology, vol. 2173, 233–246.","short":"S. Kainrath, H.L. Janovjak, in:, D. Niopek (Ed.), Photoswitching Proteins, Springer Nature, 2020, pp. 233–246."},"date_published":"2020-07-11T00:00:00Z","language":[{"iso":"eng"}],"editor":[{"last_name":"Niopek","full_name":"Niopek, Dominik","first_name":"Dominik"}],"publication_identifier":{"eisbn":["9781071607558"],"issn":["1064-3745"],"eissn":["1940-6029"],"isbn":["9781071607541"]},"date_created":"2020-07-26T22:01:03Z","series_title":"MIMB","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"233-246","_id":"8173","year":"2020","pmid":1,"doi":"10.1007/978-1-0716-0755-8_16","publisher":"Springer Nature","type":"book_chapter","status":"public","date_updated":"2026-04-16T09:22:45Z","intvolume":"      2173"},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Katoen, Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87","last_name":"Katoen","first_name":"Joost P","orcid":"0000-0002-6143-1926"},{"last_name":"Weininger","full_name":"Weininger, Maximilian","first_name":"Maximilian"},{"first_name":"Tobias","last_name":"Winkler","full_name":"Winkler, Tobias"}],"external_id":{"isi":["000695272500021"],"arxiv":["2005.04018"]},"department":[{"_id":"KrCh"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"file":[{"file_id":"8276","checksum":"093d4788d7d5b2ce0ffe64fbe7820043","creator":"dernst","date_created":"2020-08-17T11:32:44Z","access_level":"open_access","date_updated":"2020-08-17T11:32:44Z","relation":"main_file","success":1,"file_name":"2020_LNCS_CAV_Chatterjee.pdf","content_type":"application/pdf","file_size":625056}],"title":"Stochastic games with lexicographic reachability-safety objectives","has_accepted_license":"1","related_material":{"record":[{"id":"12738","status":"public","relation":"later_version"}]},"alternative_title":["LNCS"],"scopus_import":"1","publication_status":"published","day":"14","ddc":["000"],"abstract":[{"lang":"eng","text":"We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as angelic and demonic non-determinism. Lexicographic order allows to consider multiple objectives with a strict preference order over the satisfaction of the objectives. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. We establish determinacy of such games and present strategy and computational complexity results. For strategy complexity, we show that lexicographically optimal strategies exist that are deterministic and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in   NP∩coNP , matching the current known bound for single objectives; and in general the decision problem is   PSPACE -hard and can be solved in   NEXPTIME∩coNEXPTIME . We present an algorithm that computes the lexicographically optimal strategies via a reduction to computation of optimal strategies in a sequence of single-objectives games. We have implemented our algorithm and report experimental results on various case studies."}],"project":[{"grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"publication":"International Conference on Computer Aided Verification","oa_version":"Published Version","ec_funded":1,"publication_identifier":{"issn":["0302-9743"],"isbn":["9783030532901"],"eissn":["1611-3349"]},"quality_controlled":"1","language":[{"iso":"eng"}],"conference":{"name":"CAV: Computer Aided Verification"},"arxiv":1,"date_created":"2020-08-16T22:00:58Z","citation":{"short":"K. Chatterjee, J.P. Katoen, M. Weininger, T. Winkler, in:, International Conference on Computer Aided Verification, Springer Nature, 2020, pp. 398–420.","ista":"Chatterjee K, Katoen JP, Weininger M, Winkler T. 2020. Stochastic games with lexicographic reachability-safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 12225, 398–420.","mla":"Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” <i>International Conference on Computer Aided Verification</i>, vol. 12225, Springer Nature, 2020, pp. 398–420, doi:<a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">10.1007/978-3-030-53291-8_21</a>.","ieee":"K. Chatterjee, J. P. Katoen, M. Weininger, and T. Winkler, “Stochastic games with lexicographic reachability-safety objectives,” in <i>International Conference on Computer Aided Verification</i>, 2020, vol. 12225, pp. 398–420.","apa":"Chatterjee, K., Katoen, J. P., Weininger, M., &#38; Winkler, T. (2020). Stochastic games with lexicographic reachability-safety objectives. In <i>International Conference on Computer Aided Verification</i> (Vol. 12225, pp. 398–420). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">https://doi.org/10.1007/978-3-030-53291-8_21</a>","chicago":"Chatterjee, Krishnendu, Joost P Katoen, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” In <i>International Conference on Computer Aided Verification</i>, 12225:398–420. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">https://doi.org/10.1007/978-3-030-53291-8_21</a>.","ama":"Chatterjee K, Katoen JP, Weininger M, Winkler T. Stochastic games with lexicographic reachability-safety objectives. In: <i>International Conference on Computer Aided Verification</i>. Vol 12225. Springer Nature; 2020:398-420. doi:<a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">10.1007/978-3-030-53291-8_21</a>"},"oa":1,"article_processing_charge":"No","volume":12225,"month":"07","date_published":"2020-07-14T00:00:00Z","file_date_updated":"2020-08-17T11:32:44Z","doi":"10.1007/978-3-030-53291-8_21","intvolume":"     12225","date_updated":"2026-04-16T09:31:14Z","status":"public","type":"conference","publisher":"Springer Nature","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","isi":1,"year":"2020","_id":"8272","page":"398-420"},{"has_accepted_license":"1","scopus_import":"1","publication_status":"published","ddc":["570"],"abstract":[{"text":"Extrasynaptic actions of glutamate are limited by high-affinity transporters expressed by perisynaptic astroglial processes (PAPs): this helps maintain point-to-point transmission in excitatory circuits. Memory formation in the brain is associated with synaptic remodeling, but how this affects PAPs and therefore extrasynaptic glutamate actions is poorly understood. Here, we used advanced imaging methods, in situ and in vivo, to find that a classical synaptic memory mechanism, long-term potentiation (LTP), triggers withdrawal of PAPs from potentiated synapses. Optical glutamate sensors combined with patch-clamp and 3D molecular localization reveal that LTP induction thus prompts spatial retreat of astroglial glutamate transporters, boosting glutamate spillover and NMDA-receptor-mediated inter-synaptic cross-talk. The LTP-triggered PAP withdrawal involves NKCC1 transporters and the actin-controlling protein cofilin but does not depend on major Ca2+-dependent cascades in astrocytes. We have therefore uncovered a mechanism by which a memory trace at one synapse could alter signal handling by multiple neighboring connections.","lang":"eng"}],"day":"09","issue":"5","publication":"Neuron","oa_version":"Published Version","author":[{"first_name":"Christian","last_name":"Henneberger","full_name":"Henneberger, Christian"},{"full_name":"Bard, Lucie","last_name":"Bard","first_name":"Lucie"},{"last_name":"Panatier","full_name":"Panatier, Aude","first_name":"Aude"},{"last_name":"Reynolds","full_name":"Reynolds, James P.","first_name":"James P."},{"last_name":"Kopach","first_name":"Olga","full_name":"Kopach, Olga"},{"full_name":"Medvedev, Nikolay I.","last_name":"Medvedev","first_name":"Nikolay I."},{"full_name":"Minge, Daniel","last_name":"Minge","first_name":"Daniel"},{"first_name":"Michel K.","last_name":"Herde","full_name":"Herde, Michel K."},{"last_name":"Anders","full_name":"Anders, Stefanie","first_name":"Stefanie"},{"full_name":"Kraev, Igor","first_name":"Igor","last_name":"Kraev"},{"first_name":"Janosch P.","last_name":"Heller","full_name":"Heller, Janosch P."},{"full_name":"Rama, Sylvain","first_name":"Sylvain","last_name":"Rama"},{"last_name":"Zheng","first_name":"Kaiyu","full_name":"Zheng, Kaiyu"},{"first_name":"Thomas P.","full_name":"Jensen, Thomas P.","last_name":"Jensen"},{"first_name":"Inmaculada","full_name":"Sanchez-Romero, Inmaculada","last_name":"Sanchez-Romero","id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Colin J.","last_name":"Jackson","full_name":"Jackson, Colin J."},{"orcid":"0000-0002-8023-9315","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","first_name":"Harald L"},{"full_name":"Ottersen, Ole Petter","last_name":"Ottersen","first_name":"Ole Petter"},{"first_name":"Erlend Arnulf","last_name":"Nagelhus","full_name":"Nagelhus, Erlend Arnulf"},{"full_name":"Oliet, Stephane H.R.","last_name":"Oliet","first_name":"Stephane H.R."},{"last_name":"Stewart","first_name":"Michael G.","full_name":"Stewart, Michael G."},{"first_name":"U. VAlentin","full_name":"Nägerl, U. VAlentin","last_name":"Nägerl"},{"full_name":"Rusakov, Dmitri A. ","first_name":"Dmitri A. ","last_name":"Rusakov"}],"external_id":{"pmid":["32976770"],"isi":["000603428000010"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"HaJa"}],"file":[{"content_type":"application/pdf","file_size":7518960,"success":1,"file_name":"2020_Neuron_Henneberger.pdf","creator":"dernst","checksum":"054562bb50165ef9a1f46631c1c5e36b","file_id":"8939","date_created":"2020-12-10T14:42:09Z","access_level":"open_access","date_updated":"2020-12-10T14:42:09Z","relation":"main_file"}],"title":"LTP induction boosts glutamate spillover by driving withdrawal of perisynaptic astroglia","doi":"10.1016/j.neuron.2020.08.030","acknowledgement":"We thank J. Angibaud for organotypic cultures and R. Chereau and J. Tonnesen for help with the STED microscope; also D. Gonzales and the Neurocentre Magendie INSERM U1215 Genotyping Platform, for breeding management and genotyping. This work was supported by the Wellcome Trust Principal Fellowships 101896 and 212251, ERC Advanced Grant 323113, ERC Proof-of-Concept Grant 767372, EC FP7 ITN 606950, and EU CSA 811011 (D.A.R.); NRW-Rückkehrerpogramm, UCL Excellence Fellowship, German Research Foundation (DFG) SPP1757 and SFB1089 (C.H.); Human Frontiers Science Program (C.H., C.J.J., and H.J.); EMBO Long-Term Fellowship (L.B.); Marie Curie FP7 PIRG08-GA-2010-276995 (A.P.), ASTROMODULATION (S.R.); Equipe FRM DEQ 201 303 26519, Conseil Régional d’Aquitaine R12056GG, INSERM (S.H.R.O.); ANR SUPERTri, ANR Castro (ANR-17-CE16-0002), R-13-BSV4-0007-01, Université de Bordeaux, labex BRAIN (S.H.R.O. and U.V.N.); CNRS (A.P., S.H.R.O., and U.V.N.); HFSP, ANR CEXC, and France-BioImaging ANR-10-INSB-04 (U.V.N.); and FP7 MemStick Project No. 201600 (M.G.S.).","intvolume":"       108","date_updated":"2026-04-16T09:33:03Z","status":"public","type":"journal_article","publisher":"Elsevier","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","isi":1,"article_type":"original","year":"2020","pmid":1,"_id":"8674","page":"P919-936.E11","quality_controlled":"1","publication_identifier":{"issn":["0896-6273"],"eissn":["1097-4199"]},"language":[{"iso":"eng"}],"date_created":"2020-10-18T22:01:38Z","citation":{"short":"C. Henneberger, L. Bard, A. Panatier, J.P. Reynolds, O. Kopach, N.I. Medvedev, D. Minge, M.K. Herde, S. Anders, I. Kraev, J.P. Heller, S. Rama, K. Zheng, T.P. Jensen, I. Sanchez-Romero, C.J. Jackson, H.L. Janovjak, O.P. Ottersen, E.A. Nagelhus, S.H.R. Oliet, M.G. Stewart, U.Va. Nägerl, D.A. Rusakov, Neuron 108 (2020) P919–936.E11.","ista":"Henneberger C, Bard L, Panatier A, Reynolds JP, Kopach O, Medvedev NI, Minge D, Herde MK, Anders S, Kraev I, Heller JP, Rama S, Zheng K, Jensen TP, Sanchez-Romero I, Jackson CJ, Janovjak HL, Ottersen OP, Nagelhus EA, Oliet SHR, Stewart MG, Nägerl UVa, Rusakov DA. 2020. LTP induction boosts glutamate spillover by driving withdrawal of perisynaptic astroglia. Neuron. 108(5), P919–936.E11.","ama":"Henneberger C, Bard L, Panatier A, et al. LTP induction boosts glutamate spillover by driving withdrawal of perisynaptic astroglia. <i>Neuron</i>. 2020;108(5):P919-936.E11. doi:<a href=\"https://doi.org/10.1016/j.neuron.2020.08.030\">10.1016/j.neuron.2020.08.030</a>","chicago":"Henneberger, Christian, Lucie Bard, Aude Panatier, James P. Reynolds, Olga Kopach, Nikolay I. Medvedev, Daniel Minge, et al. “LTP Induction Boosts Glutamate Spillover by Driving Withdrawal of Perisynaptic Astroglia.” <i>Neuron</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.neuron.2020.08.030\">https://doi.org/10.1016/j.neuron.2020.08.030</a>.","ieee":"C. Henneberger <i>et al.</i>, “LTP induction boosts glutamate spillover by driving withdrawal of perisynaptic astroglia,” <i>Neuron</i>, vol. 108, no. 5. Elsevier, p. P919–936.E11, 2020.","mla":"Henneberger, Christian, et al. “LTP Induction Boosts Glutamate Spillover by Driving Withdrawal of Perisynaptic Astroglia.” <i>Neuron</i>, vol. 108, no. 5, Elsevier, 2020, p. P919–936.E11, doi:<a href=\"https://doi.org/10.1016/j.neuron.2020.08.030\">10.1016/j.neuron.2020.08.030</a>.","apa":"Henneberger, C., Bard, L., Panatier, A., Reynolds, J. P., Kopach, O., Medvedev, N. I., … Rusakov, D. A. (2020). LTP induction boosts glutamate spillover by driving withdrawal of perisynaptic astroglia. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2020.08.030\">https://doi.org/10.1016/j.neuron.2020.08.030</a>"},"oa":1,"volume":108,"month":"12","article_processing_charge":"No","date_published":"2020-12-09T00:00:00Z","file_date_updated":"2020-12-10T14:42:09Z"},{"ec_funded":1,"oa_version":"Preprint","publication":"23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography","day":"15","abstract":[{"lang":"eng","text":"Discrete Gaussian distributions over lattices are central to lattice-based cryptography, and to the computational and mathematical aspects of lattices more broadly. The literature contains a wealth of useful theorems about the behavior of discrete Gaussians under convolutions and related operations. Yet despite their structural similarities, most of these theorems are formally incomparable, and their proofs tend to be monolithic and written nearly “from scratch,” making them unnecessarily hard to verify, understand, and extend.\r\nIn this work we present a modular framework for analyzing linear operations on discrete Gaussian distributions. The framework abstracts away the particulars of Gaussians, and usually reduces proofs to the choice of appropriate linear transformations and elementary linear algebra. To showcase the approach, we establish several general properties of discrete Gaussians, and show how to obtain all prior convolution theorems (along with some new ones) as straightforward corollaries. As another application, we describe a self-reduction for Learning With Errors (LWE) that uses a fixed number of samples to generate an unlimited number of additional ones (having somewhat larger error). The distinguishing features of our reduction are its simple analysis in our framework, and its exclusive use of discrete Gaussians without any loss in parameters relative to a prior mixed discrete-and-continuous approach.\r\nAs a contribution of independent interest, for subgaussian random matrices we prove a singular value concentration bound with explicitly stated constants, and we give tighter heuristics for specific distributions that are commonly used for generating lattice trapdoors. These bounds yield improvements in the concrete bit-security estimates for trapdoor lattice cryptosystems."}],"project":[{"grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","scopus_import":"1","alternative_title":["LNCS"],"title":"Improved discrete Gaussian and subgaussian analysis for lattice cryptography","main_file_link":[{"url":"https://eprint.iacr.org/2020/337","open_access":"1"}],"department":[{"_id":"KrPi"}],"external_id":{"isi":["001299210200021"]},"author":[{"first_name":"Nicholas","last_name":"Genise","full_name":"Genise, Nicholas"},{"full_name":"Micciancio, Daniele","first_name":"Daniele","last_name":"Micciancio"},{"last_name":"Peikert","first_name":"Chris","full_name":"Peikert, Chris"},{"orcid":"0000-0003-3186-2482","last_name":"Walter","first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","full_name":"Walter, Michael"}],"_id":"8339","page":"623-651","year":"2020","isi":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-16T09:32:27Z","status":"public","publisher":"Springer Nature","type":"conference","intvolume":"     12110","doi":"10.1007/978-3-030-45374-9_21","date_published":"2020-05-15T00:00:00Z","oa":1,"article_processing_charge":"No","volume":12110,"month":"05","citation":{"ama":"Genise N, Micciancio D, Peikert C, Walter M. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In: <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i>. Vol 12110. Springer Nature; 2020:623-651. doi:<a href=\"https://doi.org/10.1007/978-3-030-45374-9_21\">10.1007/978-3-030-45374-9_21</a>","chicago":"Genise, Nicholas, Daniele Micciancio, Chris Peikert, and Michael Walter. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” In <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i>, 12110:623–51. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-45374-9_21\">https://doi.org/10.1007/978-3-030-45374-9_21</a>.","apa":"Genise, N., Micciancio, D., Peikert, C., &#38; Walter, M. (2020). Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i> (Vol. 12110, pp. 623–651). Edinburgh, United Kingdom: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-45374-9_21\">https://doi.org/10.1007/978-3-030-45374-9_21</a>","ieee":"N. Genise, D. Micciancio, C. Peikert, and M. Walter, “Improved discrete Gaussian and subgaussian analysis for lattice cryptography,” in <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i>, Edinburgh, United Kingdom, 2020, vol. 12110, pp. 623–651.","mla":"Genise, Nicholas, et al. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i>, vol. 12110, Springer Nature, 2020, pp. 623–51, doi:<a href=\"https://doi.org/10.1007/978-3-030-45374-9_21\">10.1007/978-3-030-45374-9_21</a>.","ista":"Genise N, Micciancio D, Peikert C, Walter M. 2020. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 12110, 623–651.","short":"N. Genise, D. Micciancio, C. Peikert, M. Walter, in:, 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Springer Nature, 2020, pp. 623–651."},"date_created":"2020-09-06T22:01:13Z","conference":{"location":"Edinburgh, United Kingdom","start_date":"2020-05-04","name":"PKC: Public-Key Cryptography","end_date":"2020-05-07"},"language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783030453732"],"issn":["0302-9743"]}},{"title":"Delayed authentication: Preventing replay and relay attacks in private contact tracing","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2020/418"}],"department":[{"_id":"KrPi"}],"external_id":{"isi":["000927592800001"]},"author":[{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"}],"ec_funded":1,"oa_version":"Preprint","publication":"Progress in Cryptology","abstract":[{"lang":"eng","text":"Currently several projects aim at designing and implementing protocols for privacy preserving automated contact tracing to help fight the current pandemic. Those proposal are quite similar, and in their most basic form basically propose an app for mobile phones which broadcasts frequently changing pseudorandom identifiers via (low energy) Bluetooth, and at the same time, the app stores IDs broadcast by phones in its proximity. Only if a user is tested positive, they upload either the beacons they did broadcast (which is the case in decentralized proposals as DP-3T, east and west coast PACT or Covid watch) or received (as in Popp-PT or ROBERT) during the last two weeks or so.\r\n\r\nVaudenay [eprint 2020/399] observes that this basic scheme (he considers the DP-3T proposal) succumbs to relay and even replay attacks, and proposes more complex interactive schemes which prevent those attacks without giving up too many privacy aspects. Unfortunately interaction is problematic for this application for efficiency and security reasons. The countermeasures that have been suggested so far are either not practical or give up on key privacy aspects. We propose a simple non-interactive variant of the basic protocol that\r\n(security) Provably prevents replay and (if location data is available) relay attacks.\r\n(privacy) The data of all parties (even jointly) reveals no information on the location or time where encounters happened.\r\n(efficiency) The broadcasted message can fit into 128 bits and uses only basic crypto (commitments and secret key authentication).\r\n\r\nTowards this end we introduce the concept of “delayed authentication”, which basically is a message authentication code where verification can be done in two steps, where the first doesn’t require the key, and the second doesn’t require the message."}],"day":"08","project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"publication_status":"published","scopus_import":"1","date_published":"2020-12-08T00:00:00Z","oa":1,"article_processing_charge":"No","volume":12578,"month":"12","citation":{"ieee":"K. Z. Pietrzak, “Delayed authentication: Preventing replay and relay attacks in private contact tracing,” in <i>Progress in Cryptology</i>, Bangalore, India, 2020, vol. 12578, pp. 3–15.","mla":"Pietrzak, Krzysztof Z. “Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing.” <i>Progress in Cryptology</i>, vol. 12578, Springer Nature, 2020, pp. 3–15, doi:<a href=\"https://doi.org/10.1007/978-3-030-65277-7_1\">10.1007/978-3-030-65277-7_1</a>.","apa":"Pietrzak, K. Z. (2020). Delayed authentication: Preventing replay and relay attacks in private contact tracing. In <i>Progress in Cryptology</i> (Vol. 12578, pp. 3–15). Bangalore, India: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-65277-7_1\">https://doi.org/10.1007/978-3-030-65277-7_1</a>","ama":"Pietrzak KZ. Delayed authentication: Preventing replay and relay attacks in private contact tracing. In: <i>Progress in Cryptology</i>. Vol 12578. LNCS. Springer Nature; 2020:3-15. doi:<a href=\"https://doi.org/10.1007/978-3-030-65277-7_1\">10.1007/978-3-030-65277-7_1</a>","chicago":"Pietrzak, Krzysztof Z. “Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing.” In <i>Progress in Cryptology</i>, 12578:3–15. LNCS. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-65277-7_1\">https://doi.org/10.1007/978-3-030-65277-7_1</a>.","short":"K.Z. Pietrzak, in:, Progress in Cryptology, Springer Nature, 2020, pp. 3–15.","ista":"Pietrzak KZ. 2020. Delayed authentication: Preventing replay and relay attacks in private contact tracing. Progress in Cryptology. INDOCRYPT: International Conference on Cryptology in IndiaLNCS vol. 12578, 3–15."},"date_created":"2021-01-03T23:01:23Z","conference":{"end_date":"2020-12-16","name":"INDOCRYPT: International Conference on Cryptology in India","location":"Bangalore, India","start_date":"2020-12-13"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783030652760"],"eissn":["1611-3349"],"issn":["0302-9743"]},"quality_controlled":"1","_id":"8987","page":"3-15","year":"2020","isi":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","series_title":"LNCS","date_updated":"2026-04-16T09:33:26Z","status":"public","publisher":"Springer Nature","type":"conference","intvolume":"     12578","doi":"10.1007/978-3-030-65277-7_1"},{"title":"Reverse firewalls for actively secure MPCs","main_file_link":[{"url":"https://eprint.iacr.org/2019/1317","open_access":"1"}],"department":[{"_id":"KrPi"}],"external_id":{"isi":["001415325700026"]},"author":[{"first_name":"Suvradip","full_name":"Chakraborty, Suvradip","last_name":"Chakraborty","id":"B9CD0494-D033-11E9-B219-A439E6697425"},{"full_name":"Dziembowski, Stefan","first_name":"Stefan","last_name":"Dziembowski"},{"last_name":"Nielsen","first_name":"Jesper Buus","full_name":"Nielsen, Jesper Buus"}],"ec_funded":1,"oa_version":"Preprint","publication":"Advances in Cryptology – CRYPTO 2020","abstract":[{"text":"Reverse firewalls were introduced at Eurocrypt 2015 by Miro-nov and Stephens-Davidowitz, as a method for protecting cryptographic protocols against attacks on the devices of the honest parties. In a nutshell: a reverse firewall is placed outside of a device and its goal is to “sanitize” the messages sent by it, in such a way that a malicious device cannot leak its secrets to the outside world. It is typically assumed that the cryptographic devices are attacked in a “functionality-preserving way” (i.e. informally speaking, the functionality of the protocol remains unchanged under this attacks). In their paper, Mironov and Stephens-Davidowitz construct a protocol for passively-secure two-party computations with firewalls, leaving extension of this result to stronger models as an open question.\r\nIn this paper, we address this problem by constructing a protocol for secure computation with firewalls that has two main advantages over the original protocol from Eurocrypt 2015. Firstly, it is a multiparty computation protocol (i.e. it works for an arbitrary number n of the parties, and not just for 2). Secondly, it is secure in much stronger corruption settings, namely in the active corruption model. More precisely: we consider an adversary that can fully corrupt up to 𝑛−1 parties, while the remaining parties are corrupt in a functionality-preserving way.\r\nOur core techniques are: malleable commitments and malleable non-interactive zero-knowledge, which in particular allow us to create a novel protocol for multiparty augmented coin-tossing into the well with reverse firewalls (that is based on a protocol of Lindell from Crypto 2001).","lang":"eng"}],"day":"10","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"publication_status":"published","scopus_import":"1","alternative_title":["LNCS"],"date_published":"2020-08-10T00:00:00Z","oa":1,"month":"08","volume":12171,"article_processing_charge":"No","citation":{"chicago":"Chakraborty, Suvradip, Stefan Dziembowski, and Jesper Buus Nielsen. “Reverse Firewalls for Actively Secure MPCs.” In <i>Advances in Cryptology – CRYPTO 2020</i>, 12171:732–62. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">https://doi.org/10.1007/978-3-030-56880-1_26</a>.","ama":"Chakraborty S, Dziembowski S, Nielsen JB. Reverse firewalls for actively secure MPCs. In: <i>Advances in Cryptology – CRYPTO 2020</i>. Vol 12171. Springer Nature; 2020:732-762. doi:<a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">10.1007/978-3-030-56880-1_26</a>","apa":"Chakraborty, S., Dziembowski, S., &#38; Nielsen, J. B. (2020). Reverse firewalls for actively secure MPCs. In <i>Advances in Cryptology – CRYPTO 2020</i> (Vol. 12171, pp. 732–762). Santa Barbara, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">https://doi.org/10.1007/978-3-030-56880-1_26</a>","mla":"Chakraborty, Suvradip, et al. “Reverse Firewalls for Actively Secure MPCs.” <i>Advances in Cryptology – CRYPTO 2020</i>, vol. 12171, Springer Nature, 2020, pp. 732–62, doi:<a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">10.1007/978-3-030-56880-1_26</a>.","ieee":"S. Chakraborty, S. Dziembowski, and J. B. Nielsen, “Reverse firewalls for actively secure MPCs,” in <i>Advances in Cryptology – CRYPTO 2020</i>, Santa Barbara, CA, United States, 2020, vol. 12171, pp. 732–762.","ista":"Chakraborty S, Dziembowski S, Nielsen JB. 2020. Reverse firewalls for actively secure MPCs. Advances in Cryptology – CRYPTO 2020. CRYPTO: Annual International Cryptology Conference, LNCS, vol. 12171, 732–762.","short":"S. Chakraborty, S. Dziembowski, J.B. Nielsen, in:, Advances in Cryptology – CRYPTO 2020, Springer Nature, 2020, pp. 732–762."},"date_created":"2020-08-30T22:01:12Z","conference":{"end_date":"2020-08-21","name":"CRYPTO: Annual International Cryptology Conference","location":"Santa Barbara, CA, United States","start_date":"2020-08-17"},"language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030568795"]},"_id":"8322","page":"732-762","year":"2020","isi":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-16T09:31:34Z","status":"public","publisher":"Springer Nature","type":"conference","intvolume":"     12171","doi":"10.1007/978-3-030-56880-1_26","acknowledgement":"We would like to thank the anonymous reviewers for their helpful comments and suggestions. The work was initiated while the first author was in IIT Madras, India. Part of this work was done while the author was visiting the University of Warsaw. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT) and from the Foundation for Polish Science under grant TEAM/2016-1/4 founded within the UE 2014–2020 Smart Growth Operational Program. The last author was supported by the Independent Research Fund Denmark project BETHE and the Concordium Blockchain Research Center, Aarhus University, Denmark."},{"article_processing_charge":"No","month":"12","volume":2020,"oa":1,"citation":{"ista":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. 2020. Lagrangian reachtubes: The next generation. Proceedings of the 59th IEEE Conference on Decision and Control. CDC: Conference on Decision and Control vol. 2020, 1556–1563.","short":"S. Gruenbacher, J. Cyranka, M. Lechner, M.A. Islam, S.A. Smolka, R. Grosu, in:, Proceedings of the 59th IEEE Conference on Decision and Control, IEEE, 2020, pp. 1556–1563.","apa":"Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., &#38; Grosu, R. (2020). Lagrangian reachtubes: The next generation. In <i>Proceedings of the 59th IEEE Conference on Decision and Control</i> (Vol. 2020, pp. 1556–1563). Jeju Islang, Korea (South): IEEE. <a href=\"https://doi.org/10.1109/CDC42340.2020.9304042\">https://doi.org/10.1109/CDC42340.2020.9304042</a>","mla":"Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.” <i>Proceedings of the 59th IEEE Conference on Decision and Control</i>, vol. 2020, IEEE, 2020, pp. 1556–63, doi:<a href=\"https://doi.org/10.1109/CDC42340.2020.9304042\">10.1109/CDC42340.2020.9304042</a>.","ieee":"S. Gruenbacher, J. Cyranka, M. Lechner, M. A. Islam, S. A. Smolka, and R. Grosu, “Lagrangian reachtubes: The next generation,” in <i>Proceedings of the 59th IEEE Conference on Decision and Control</i>, Jeju Islang, Korea (South), 2020, vol. 2020, pp. 1556–1563.","chicago":"Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam, Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.” In <i>Proceedings of the 59th IEEE Conference on Decision and Control</i>, 2020:1556–63. IEEE, 2020. <a href=\"https://doi.org/10.1109/CDC42340.2020.9304042\">https://doi.org/10.1109/CDC42340.2020.9304042</a>.","ama":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. Lagrangian reachtubes: The next generation. In: <i>Proceedings of the 59th IEEE Conference on Decision and Control</i>. Vol 2020. IEEE; 2020:1556-1563. doi:<a href=\"https://doi.org/10.1109/CDC42340.2020.9304042\">10.1109/CDC42340.2020.9304042</a>"},"date_published":"2020-12-14T00:00:00Z","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0743-1546"],"isbn":["9781728174471"]},"quality_controlled":"1","date_created":"2021-02-07T23:01:14Z","arxiv":1,"conference":{"location":"Jeju Islang, Korea (South)","start_date":"2020-12-14","end_date":"2020-12-18","name":"CDC: Conference on Decision and Control"},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"1556-1563","_id":"9103","year":"2020","doi":"10.1109/CDC42340.2020.9304042","acknowledgement":"The authors would like to thank Ramin Hasani and Guillaume Berger for intellectual discussions about the research which lead to the generation of new ideas. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Smolka’s research was supported by NSF grants CPS-1446832 and CCF-1918225. Gruenbacher is funded by FWF project W1255-N23. JC was partially supported by NAWA Polish Returns grant\r\nPPN/PPO/2018/1/00029.\r\n","type":"conference","status":"public","publisher":"IEEE","date_updated":"2026-04-16T09:34:59Z","intvolume":"      2020","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2012.07458"}],"department":[{"_id":"ToHe"}],"title":"Lagrangian reachtubes: The next generation","author":[{"full_name":"Gruenbacher, Sophie","last_name":"Gruenbacher","first_name":"Sophie"},{"first_name":"Jacek","last_name":"Cyranka","full_name":"Cyranka, Jacek"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias"},{"last_name":"Islam","first_name":"Md Ariful","full_name":"Islam, Md Ariful"},{"first_name":"Scott A.","full_name":"Smolka, Scott A.","last_name":"Smolka"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"external_id":{"arxiv":["2012.07458"]},"publication":"Proceedings of the 59th IEEE Conference on Decision and Control","project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"day":"14","abstract":[{"lang":"eng","text":"We introduce LRT-NG, a set of techniques and an associated toolset that computes a reachtube (an over-approximation of the set of reachable states over a given time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the state-of-the-art Langrangian Reachability and its associated tool LRT. From a theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses for the first time an analytically computed metric for the propagated ball which is proven to minimize the ball’s volume. We emphasize that the metric computation is the centerpiece of all bloating-based techniques. Secondly, it computes the next reachset as the intersection of two balls: one based on the Cartesian metric and the other on the new metric. While the two metrics were previously considered opposing approaches, their joint use considerably tightens the reachtubes. Thirdly, it avoids the \"wrapping effect\" associated with the validated integration of the center of the reachset, by optimally absorbing the interval approximation in the radius of the next ball. From a tool-development perspective, LRT-NG is superior to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD. This required the implementation of the Lohner method and a Runge-Kutta time-propagation method. Secondly, it has an improved interface, allowing the input model and initial conditions to be provided as external input files. Our experiments on a comprehensive set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance compared to LRT, CAPD, and Flow*."}],"oa_version":"Preprint","publication_status":"published","scopus_import":"1"},{"title":"An SMT theory of fixed-point arithmetic","main_file_link":[{"url":"https://doi.org/10.1007/978-3-030-51074-9_2","open_access":"1"}],"department":[{"_id":"ToHe"}],"external_id":{"isi":["000884318000002"]},"author":[{"last_name":"Baranowski","first_name":"Marek","full_name":"Baranowski, Marek"},{"first_name":"Shaobo","last_name":"He","full_name":"He, Shaobo"},{"last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias"},{"first_name":"Thanh Son","last_name":"Nguyen","full_name":"Nguyen, Thanh Son"},{"first_name":"Zvonimir","full_name":"Rakamarić, Zvonimir","last_name":"Rakamarić"}],"oa_version":"Published Version","publication":"Automated Reasoning","abstract":[{"lang":"eng","text":"Fixed-point arithmetic is a popular alternative to floating-point arithmetic on embedded systems. Existing work on the verification of fixed-point programs relies on custom formalizations of fixed-point arithmetic, which makes it hard to compare the described techniques or reuse the implementations. In this paper, we address this issue by proposing and formalizing an SMT theory of fixed-point arithmetic. We present an intuitive yet comprehensive syntax of the fixed-point theory, and provide formal semantics for it based on rational arithmetic. We also describe two decision procedures for this theory: one based on the theory of bit-vectors and the other on the theory of reals. We implement the two decision procedures, and evaluate our implementations using existing mature SMT solvers on a benchmark suite we created. Finally, we perform a case study of using the theory we propose to verify properties of quantized neural networks."}],"day":"24","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"publication_status":"published","scopus_import":"1","alternative_title":["LNCS"],"date_published":"2020-06-24T00:00:00Z","oa":1,"volume":12166,"article_processing_charge":"No","month":"06","citation":{"short":"M. Baranowski, S. He, M. Lechner, T.S. Nguyen, Z. Rakamarić, in:, Automated Reasoning, Springer Nature, 2020, pp. 13–31.","ista":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. 2020. An SMT theory of fixed-point arithmetic. Automated Reasoning. IJCAR: International Joint Conference on Automated Reasoning, LNCS, vol. 12166, 13–31.","ama":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. An SMT theory of fixed-point arithmetic. In: <i>Automated Reasoning</i>. Vol 12166. Springer Nature; 2020:13-31. doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>","chicago":"Baranowski, Marek, Shaobo He, Mathias Lechner, Thanh Son Nguyen, and Zvonimir Rakamarić. “An SMT Theory of Fixed-Point Arithmetic.” In <i>Automated Reasoning</i>, 12166:13–31. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>.","ieee":"M. Baranowski, S. He, M. Lechner, T. S. Nguyen, and Z. Rakamarić, “An SMT theory of fixed-point arithmetic,” in <i>Automated Reasoning</i>, Paris, France, 2020, vol. 12166, pp. 13–31.","mla":"Baranowski, Marek, et al. “An SMT Theory of Fixed-Point Arithmetic.” <i>Automated Reasoning</i>, vol. 12166, Springer Nature, 2020, pp. 13–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>.","apa":"Baranowski, M., He, S., Lechner, M., Nguyen, T. S., &#38; Rakamarić, Z. (2020). An SMT theory of fixed-point arithmetic. In <i>Automated Reasoning</i> (Vol. 12166, pp. 13–31). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>"},"date_created":"2020-08-02T22:00:59Z","conference":{"end_date":"2020-07-04","name":"IJCAR: International Joint Conference on Automated Reasoning","location":"Paris, France","start_date":"2020-07-01"},"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783030510732"],"issn":["0302-9743"]},"quality_controlled":"1","_id":"8194","page":"13-31","year":"2020","isi":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-16T09:29:42Z","status":"public","type":"conference","publisher":"Springer Nature","intvolume":"     12166","doi":"10.1007/978-3-030-51074-9_2"}]