[{"article_processing_charge":"No","quality_controlled":"1","fulldoi":"https://doi.org/10.1609/aaai.v35i9.16999","type":"conference","doi":"10.1609/aaai.v35i9.16999","publication_status":"published","publication_identifier":{"isbn":["9781713835974"],"issn":["2159-5399"],"eissn":["2374-3468"]},"intvolume":"        35","issue":"9B","_id":"11436","ec_funded":1,"year":"2021","conference":{"location":"Virtual, Online","end_date":"2021-02-09","name":"AAAI: Conference on Artificial Intelligence","start_date":"2021-02-02"},"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["1905.11845"]},"publication":"35th AAAI Conference on Artificial Intelligence, AAAI 2021","date_published":"2021-05-18T00:00:00Z","arxiv":1,"month":"05","scopus_import":"1","acknowledgement":"Vyacheslav Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics. Bapi Chatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus). Dan Alistarh has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","page":"8209-8216","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":35,"date_updated":"2026-08-19T09:25:06Z","title":"Asynchronous optimization methods for efficient training of deep neural networks with guarantees","status":"public","oa_version":"Preprint","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Asynchronous distributed algorithms are a popular way to reduce synchronization costs in large-scale optimization, and in particular for neural network training. However, for nonsmooth and nonconvex objectives, few convergence guarantees exist beyond cases where closed-form proximal operator solutions are available. As training most popular deep neural networks corresponds to optimizing nonsmooth and nonconvex objectives, there is a pressing need for such convergence guarantees. In this paper, we analyze for the first time the convergence of stochastic asynchronous optimization for this general class of objectives. In particular, we focus on stochastic subgradient methods allowing for block variable partitioning, where the shared model is asynchronously updated by concurrent processes. To this end, we use a probabilistic model which captures key features of real asynchronous scheduling between concurrent processes. Under this model, we establish convergence with probability one to an invariant set for stochastic subgradient methods with momentum. From a practical perspective, one issue with the family of algorithms that we consider is that they are not efficiently supported by machine learning frameworks, which mostly focus on distributed data-parallel strategies. To address this, we propose a new implementation strategy for shared-memory based training of deep neural networks for a partitioned but shared model in single- and multi-GPU settings. Based on this implementation, we achieve on average1.2x speed-up in comparison to state-of-the-art training methods for popular image classification tasks, without compromising accuracy."}],"oa":1,"date_created":"2022-06-05T22:01:52Z","day":"18","citation":{"ista":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. 2021. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. 35th AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI: Conference on Artificial Intelligence vol. 35, 8209–8216.","mla":"Kungurtsev, Vyacheslav, et al. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, vol. 35, no. 9B, AAAI Press, 2021, pp. 8209–16, doi:<a href=\"https://doi.org/10.1609/aaai.v35i9.16999\">10.1609/aaai.v35i9.16999</a>.","ama":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In: <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>. Vol 35. AAAI Press; 2021:8209-8216. doi:<a href=\"https://doi.org/10.1609/aaai.v35i9.16999\">10.1609/aaai.v35i9.16999</a>","short":"V. Kungurtsev, M. Egan, B. Chatterjee, D.-A. Alistarh, in:, 35th AAAI Conference on Artificial Intelligence, AAAI 2021, AAAI Press, 2021, pp. 8209–8216.","chicago":"Kungurtsev, Vyacheslav, Malcolm Egan, Bapi Chatterjee, and Dan-Adrian Alistarh. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, 35:8209–16. AAAI Press, 2021. <a href=\"https://doi.org/10.1609/aaai.v35i9.16999\">https://doi.org/10.1609/aaai.v35i9.16999</a>.","apa":"Kungurtsev, V., Egan, M., Chatterjee, B., &#38; Alistarh, D.-A. (2021). Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i> (Vol. 35, pp. 8209–8216). Virtual, Online: AAAI Press. <a href=\"https://doi.org/10.1609/aaai.v35i9.16999\">https://doi.org/10.1609/aaai.v35i9.16999</a>","ieee":"V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization methods for efficient training of deep neural networks with guarantees,” in <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, Virtual, Online, 2021, vol. 35, no. 9B, pp. 8209–8216."},"publisher":"AAAI Press","author":[{"full_name":"Kungurtsev, Vyacheslav","first_name":"Vyacheslav","last_name":"Kungurtsev"},{"full_name":"Egan, Malcolm","last_name":"Egan","first_name":"Malcolm"},{"last_name":"Chatterjee","first_name":"Bapi","orcid":"0000-0002-2742-4028","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Bapi"},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1905.11845","open_access":"1"}]},{"quality_controlled":"1","has_accepted_license":"1","file_date_updated":"2022-01-26T07:38:08Z","article_processing_charge":"No","corr_author":"1","fulldoi":"https://doi.org/10.1609/aaai.v35i13.17372","publication_status":"published","alternative_title":["Technical Tracks"],"doi":"10.1609/aaai.v35i13.17372","type":"conference","issue":"13","_id":"10669","intvolume":"        35","publication_identifier":{"eissn":["2374-3468"],"issn":["2159-5399"],"isbn":["978-1-57735-866-4"]},"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","file":[{"checksum":"468d07041e282a1d46ffdae92f709630","success":1,"date_created":"2022-01-26T07:38:08Z","access_level":"open_access","file_id":"10680","creator":"mlechner","date_updated":"2022-01-26T07:38:08Z","file_size":286906,"content_type":"application/pdf","relation":"main_file","file_name":"17372-Article Text-20866-1-2-20210518.pdf"}],"conference":{"name":"AAAI: Association for the Advancement of Artificial Intelligence","start_date":"2021-02-02","end_date":"2021-02-09","location":"Virtual"},"external_id":{"arxiv":["2012.08863"]},"project":[{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"11525-11535","arxiv":1,"date_published":"2021-05-28T00:00:00Z","month":"05","acknowledgement":"The authors would like to thank the reviewers for their insightful comments. RH and RG were partially supported by\r\nHorizon-2020 ECSEL Project grant No. 783163 (iDev40). RH was partially supported by Boeing. ML was supported\r\nin part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). SG was funded by FWF\r\nproject W1255-N23. JC was partially supported by NAWA Polish Returns grant PPN/PPO/2018/1/00029. SS was supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832.\r\n","oa_version":"Published Version","ddc":["000"],"status":"public","title":"On the verification of neural ODEs with stochastic guarantees","date_updated":"2026-08-19T09:29:48Z","volume":35,"publisher":"AAAI Press","author":[{"last_name":"Grunbacher","first_name":"Sophie","full_name":"Grunbacher, Sophie"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"full_name":"Cyranka, Jacek","first_name":"Jacek","last_name":"Cyranka"},{"last_name":"Smolka","first_name":"Scott A","full_name":"Smolka, Scott A"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"citation":{"ieee":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S. A. Smolka, and R. Grosu, “On the verification of neural ODEs with stochastic guarantees,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 13, pp. 11525–11535.","apa":"Grunbacher, S., Hasani, R., Lechner, M., Cyranka, J., Smolka, S. A., &#38; Grosu, R. (2021). On the verification of neural ODEs with stochastic guarantees. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 11525–11535). Virtual: AAAI Press. <a href=\"https://doi.org/10.1609/aaai.v35i13.17372\">https://doi.org/10.1609/aaai.v35i13.17372</a>","ama":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. On the verification of neural ODEs with stochastic guarantees. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:11525-11535. doi:<a href=\"https://doi.org/10.1609/aaai.v35i13.17372\">10.1609/aaai.v35i13.17372</a>","short":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S.A. Smolka, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 11525–11535.","chicago":"Grunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott A Smolka, and Radu Grosu. “On the Verification of Neural ODEs with Stochastic Guarantees.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:11525–35. AAAI Press, 2021. <a href=\"https://doi.org/10.1609/aaai.v35i13.17372\">https://doi.org/10.1609/aaai.v35i13.17372</a>.","mla":"Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic Guarantees.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35, doi:<a href=\"https://doi.org/10.1609/aaai.v35i13.17372\">10.1609/aaai.v35i13.17372</a>.","ista":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. 2021. On the verification of neural ODEs with stochastic guarantees. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 11525–11535."},"main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/17372"}],"date_created":"2022-01-25T15:47:20Z","day":"28","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"abstract":[{"text":"We show that Neural ODEs, an emerging class of timecontinuous neural networks, can be verified by solving a set of global-optimization problems. For this purpose, we introduce Stochastic Lagrangian Reachability (SLR), an\r\nabstraction-based technique for constructing a tight Reachtube (an over-approximation of the set of reachable states\r\nover a given time-horizon), and provide stochastic guarantees in the form of confidence intervals for the Reachtube bounds. SLR inherently avoids the infamous wrapping effect (accumulation of over-approximation errors) by performing local optimization steps to expand safe regions instead of repeatedly forward-propagating them as is done by deterministic reachability methods. To enable fast local optimizations, we introduce a novel forward-mode adjoint sensitivity method to compute gradients without the need for backpropagation. Finally, we establish asymptotic and non-asymptotic convergence rates for SLR.","lang":"eng"}]},{"author":[{"first_name":"Giorgi","last_name":"Nadiradze","orcid":"0000-0001-5634-0731","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","full_name":"Nadiradze, Giorgi"}],"citation":{"ama":"Nadiradze G. On achieving scalability through relaxation. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10429\">10.15479/at:ista:10429</a>","chicago":"Nadiradze, Giorgi. “On Achieving Scalability through Relaxation.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10429\">https://doi.org/10.15479/at:ista:10429</a>.","short":"G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science and Technology Austria, 2021.","mla":"Nadiradze, Giorgi. <i>On Achieving Scalability through Relaxation</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10429\">10.15479/at:ista:10429</a>.","ista":"Nadiradze G. 2021. On achieving scalability through relaxation. Institute of Science and Technology Austria.","ieee":"G. Nadiradze, “On achieving scalability through relaxation,” Institute of Science and Technology Austria, 2021.","apa":"Nadiradze, G. (2021). <i>On achieving scalability through relaxation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10429\">https://doi.org/10.15479/at:ista:10429</a>"},"publisher":"Institute of Science and Technology Austria","date_created":"2021-12-08T21:52:28Z","day":"09","oa":1,"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"language":[{"iso":"eng"}],"abstract":[{"text":"The scalability of concurrent data structures and distributed algorithms strongly depends on\r\nreducing the contention for shared resources and the costs of synchronization and communication. We show how such cost reductions can be attained by relaxing the strict consistency conditions required by sequential implementations. In the first part of the thesis, we consider relaxation in the context of concurrent data structures. Specifically, in data structures \r\nsuch as priority queues, imposing strong semantics renders scalability impossible, since a correct implementation of the remove operation should return only the element with highest priority. Intuitively, attempting to invoke remove operations concurrently  creates a race condition. This bottleneck  can be circumvented by relaxing semantics of the affected data structure, thus allowing removal of the elements which are no longer required to have the highest priority. We prove that the randomized implementations of relaxed data structures provide provable guarantees on the priority of the removed elements even under concurrency. Additionally, we show that in some cases the relaxed data structures can be used to scale the classical algorithms which are usually implemented with the exact ones. In the second part, we study parallel variants of the  stochastic gradient descent (SGD) algorithm, which distribute computation  among the multiple processors, thus reducing the running time. Unfortunately, in order for standard parallel SGD to succeed, each processor has to maintain a local copy of the necessary model parameter, which is identical to the local copies of other processors; the overheads from this perfect consistency in terms of communication and synchronization can negate the speedup gained by distributing the computation. We show that the consistency conditions required by SGD can be  relaxed, allowing the algorithm to be more flexible in terms of tolerating quantized communication, asynchrony, or even crash faults, while its convergence remains asymptotically the same.","lang":"eng"}],"degree_awarded":"PhD","oa_version":"Published Version","OA_place":"publisher","ddc":["000"],"status":"public","title":"On achieving scalability through relaxation","date_updated":"2026-08-19T09:30:23Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"132","month":"12","date_published":"2021-12-09T00:00:00Z","supervisor":[{"first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"}],"file":[{"checksum":"6bf14e9a523387328f016c0689f5e10e","access_level":"open_access","date_created":"2021-12-09T17:47:49Z","success":1,"relation":"main_file","content_type":"application/pdf","file_name":"Thesis_Final_09_12_2021.pdf","file_id":"10436","creator":"gnadirad","date_updated":"2021-12-09T17:47:49Z","file_size":2370859},{"content_type":"application/zip","relation":"source_file","file_name":"Thesis_Final_09_12_2021.zip","creator":"gnadirad","file_id":"10437","date_updated":"2022-03-28T12:55:12Z","file_size":2596924,"checksum":"914d6c5ca86bd0add471971a8f4c4341","date_created":"2021-12-09T17:47:49Z","access_level":"closed"}],"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"year":"2021","ec_funded":1,"_id":"10429","publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","alternative_title":["ISTA Thesis"],"related_material":{"record":[{"id":"6673","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"5965","status":"public"},{"relation":"part_of_dissertation","id":"10435","status":"public"},{"status":"public","id":"10432","relation":"part_of_dissertation"}]},"doi":"10.15479/at:ista:10429","type":"dissertation","corr_author":"1","fulldoi":"https://doi.org/10.15479/at:ista:10429","has_accepted_license":"1","file_date_updated":"2022-03-28T12:55:12Z","article_processing_charge":"No"},{"article_processing_charge":"No","quality_controlled":"1","fulldoi":"https://doi.org/10.1609/aaai.v35i10.17092","type":"conference","doi":"10.1609/aaai.v35i10.17092","related_material":{"record":[{"id":"10429","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","intvolume":"        35","issue":"10","_id":"10432","ec_funded":1,"year":"2021","conference":{"location":"Virtual","start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09"},"project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"external_id":{"arxiv":["2001.05918"]},"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","month":"05","arxiv":1,"date_published":"2021-05-18T00:00:00Z","acknowledgement":"We would like to thank Christopher De Sa for his feedback on an earlier draft of this paper, as well as the anonymous AAAI reviewers for their useful comments. This project has received\r\nfunding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Bapi\r\nChatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus).","page":"9037-9045","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":35,"date_updated":"2026-08-19T09:30:23Z","status":"public","title":"Elastic consistency: A practical consistency model for distributed stochastic gradient descent","ddc":["000"],"oa_version":"Published Version","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"One key element behind the recent progress of machine learning has been the ability to train machine learning models in large-scale distributed shared-memory and message-passing environments. Most of these models are trained employing variants of stochastic gradient descent (SGD) based optimization, but most methods involve some type of consistency relaxation relative to sequential SGD, to mitigate its large communication or synchronization costs at scale. In this paper, we introduce a general consistency condition covering communication-reduced and asynchronous distributed SGD implementations. Our framework, called elastic consistency, decouples the system-specific aspects of the implementation from the SGD convergence requirements, giving a general way to obtain convergence bounds for a wide variety of distributed SGD methods used in practice. Elastic consistency can be used to re-derive or improve several previous convergence bounds in message-passing and shared-memory settings, but also to analyze new models and distribution schemes. As a direct application, we propose and analyze a new synchronization-avoiding scheduling scheme for distributed SGD, and show that it can be used to efficiently train deep convolutional models for image classification."}],"oa":1,"date_created":"2021-12-09T09:21:35Z","day":"18","citation":{"ista":"Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. 2021. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence vol. 35, 9037–9045.","mla":"Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 10, 2021, pp. 9037–45, doi:<a href=\"https://doi.org/10.1609/aaai.v35i10.17092\">10.1609/aaai.v35i10.17092</a>.","chicago":"Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav  Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:9037–45, 2021. <a href=\"https://doi.org/10.1609/aaai.v35i10.17092\">https://doi.org/10.1609/aaai.v35i10.17092</a>.","short":"G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 9037–9045.","ama":"Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. ; 2021:9037-9045. doi:<a href=\"https://doi.org/10.1609/aaai.v35i10.17092\">10.1609/aaai.v35i10.17092</a>","apa":"Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., &#38; Alistarh, D.-A. (2021). Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 9037–9045). Virtual. <a href=\"https://doi.org/10.1609/aaai.v35i10.17092\">https://doi.org/10.1609/aaai.v35i10.17092</a>","ieee":"G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Elastic consistency: A practical consistency model for distributed stochastic gradient descent,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 10, pp. 9037–9045."},"author":[{"full_name":"Nadiradze, Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5634-0731","last_name":"Nadiradze","first_name":"Giorgi"},{"full_name":"Markov, Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","last_name":"Markov","first_name":"Ilia"},{"full_name":"Chatterjee, Bapi","orcid":"0000-0002-2742-4028","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Bapi"},{"full_name":"Kungurtsev, Vyacheslav ","first_name":"Vyacheslav ","last_name":"Kungurtsev"},{"first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"}],"main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/17092","open_access":"1"}]},{"fulldoi":"https://doi.org/10.48550/arXiv.2104.14946","corr_author":"1","researchdata_availability":"no","article_processing_charge":"No","das_tickbox":"0","article_number":"2104.14946","_id":"12077","type":"preprint","doi":"10.48550/arXiv.2104.14946","related_material":{"record":[{"status":"public","id":"12072","relation":"dissertation_contains"},{"relation":"later_version","status":"public","id":"17058"}]},"publication_status":"draft","acknowledgement":"The author would like to thank Damaris Schindler and Florian Wilsch for their helpful comments on the heights and Tamagawa measures used in Section 3, together with Marta Pieropan, Sho Tanimoto and Sam Streeter for providing valuable feedback on an earlier version of this paper, and Tim Browning for many useful comments and discussions during the development of this work. The author is also grateful to the anonymous referee for providing many valuable comments and suggestions that improved the quality of the paper.","arxiv":1,"month":"04","date_published":"2021-04-30T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2021","external_id":{"arxiv":["2104.14946"]},"publication":"arXiv","abstract":[{"lang":"eng","text":"We compare the Manin-type conjecture for Campana points recently formulated\r\nby Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado with an alternative\r\nprediction of Browning and Van Valckenborgh in the special case of the orbifold\r\n$(\\mathbb{P}^1,D)$, where $D =\\frac{1}{2}[0]+\\frac{1}{2}[1]+\\frac{1}{2}[\\infty]$. We find that the two predicted leading constants do not agree, and we discuss whether thin sets\r\ncould explain this discrepancy. Motivated by this, we provide a counterexample\r\nto the Manin-type conjecture for Campana points, by considering orbifolds\r\ncorresponding to squareful values of binary quadratic forms."}],"language":[{"iso":"eng"}],"department":[{"_id":"TiBr"}],"supplementarymaterial":"no","oa":1,"day":"30","date_created":"2022-09-09T10:43:17Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2104.14946","open_access":"1"}],"citation":{"ista":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. arXiv, 2104.14946.","mla":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” <i>ArXiv</i>, 2104.14946, doi:<a href=\"https://doi.org/10.48550/arXiv.2104.14946\">10.48550/arXiv.2104.14946</a>.","short":"A.L. Shute, ArXiv (n.d.).","chicago":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2104.14946\">https://doi.org/10.48550/arXiv.2104.14946</a>.","ama":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2104.14946\">10.48550/arXiv.2104.14946</a>","apa":"Shute, A. L. (n.d.). On the leading constant in the Manin-type conjecture for Campana points. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2104.14946\">https://doi.org/10.48550/arXiv.2104.14946</a>","ieee":"A. L. Shute, “On the leading constant in the Manin-type conjecture for Campana points,” <i>arXiv</i>. ."},"author":[{"last_name":"Shute","first_name":"Alec L","full_name":"Shute, Alec L","orcid":"0000-0002-1812-2810","id":"440EB050-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-08-19T12:54:58Z","status":"public","title":"On the leading constant in the Manin-type conjecture for Campana points","oa_version":"Preprint"},{"article_type":"letter_note","fulldoi":"https://doi.org/10.1103/PhysRevLett.126.244502","corr_author":"1","isi":1,"article_processing_charge":"No","quality_controlled":"1","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"article_number":"244502","intvolume":"       126","_id":"9558","issue":"24","type":"journal_article","doi":"10.1103/PhysRevLett.126.244502","related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/turbulent-flow-simplified/","description":"News on IST Homepage"}],"record":[{"id":"19591","status":"returned","relation":"popular_science"},{"id":"19684","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","acknowledgement":"We thank the referees for improving this Letter with their comments. We acknowledge stimulating discussions with\r\nH. Edelsbrunner. This work was supported by Grant No. 662960 from the Simons Foundation (B. H.). The numerical calculations were performed at TUBITAK ULAKBIM High Performance and Grid Computing Center (TRUBA resources) and IST Austria High Performance Computing cluster.","scopus_import":"1","date_published":"2021-06-18T00:00:00Z","arxiv":1,"month":"06","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","year":"2021","external_id":{"arxiv":["2007.02584"],"isi":["000663310100008"]},"project":[{"name":"Revisiting the Turbulence Problem Using Statistical Mechanics","_id":"238598C6-32DE-11EA-91FC-C7463DDC885E","grant_number":"662960"}],"publication":"Physical Review Letters","abstract":[{"text":"We show that turbulent dynamics that arise in simulations of the three-dimensional Navier--Stokes equations in a triply-periodic domain under sinusoidal forcing can be described as transient visits to the neighborhoods of unstable time-periodic solutions. Based on this description, we reduce the original system with more than 10^5 degrees of freedom to a 17-node Markov chain where each node corresponds to the neighborhood of a periodic orbit. The model accurately reproduces long-term averages of the system's observables as weighted sums over the periodic orbits.\r\n","lang":"eng"}],"department":[{"_id":"GradSch"},{"_id":"BjHo"}],"language":[{"iso":"eng"}],"oa":1,"day":"18","date_created":"2021-06-16T15:45:36Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2007.02584"}],"publisher":"American Physical Society","citation":{"mla":"Yalniz, Gökhan, et al. “Coarse Graining the State Space of a Turbulent Flow Using Periodic Orbits.” <i>Physical Review Letters</i>, vol. 126, no. 24, 244502, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">10.1103/PhysRevLett.126.244502</a>.","ista":"Yalniz G, Hof B, Budanur NB. 2021. Coarse graining the state space of a turbulent flow using periodic orbits. Physical Review Letters. 126(24), 244502.","chicago":"Yalniz, Gökhan, Björn Hof, and Nazmi B Budanur. “Coarse Graining the State Space of a Turbulent Flow Using Periodic Orbits.” <i>Physical Review Letters</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">https://doi.org/10.1103/PhysRevLett.126.244502</a>.","ama":"Yalniz G, Hof B, Budanur NB. Coarse graining the state space of a turbulent flow using periodic orbits. <i>Physical Review Letters</i>. 2021;126(24). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">10.1103/PhysRevLett.126.244502</a>","short":"G. Yalniz, B. Hof, N.B. Budanur, Physical Review Letters 126 (2021).","apa":"Yalniz, G., Hof, B., &#38; Budanur, N. B. (2021). Coarse graining the state space of a turbulent flow using periodic orbits. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">https://doi.org/10.1103/PhysRevLett.126.244502</a>","ieee":"G. Yalniz, B. Hof, and N. B. Budanur, “Coarse graining the state space of a turbulent flow using periodic orbits,” <i>Physical Review Letters</i>, vol. 126, no. 24. American Physical Society, 2021."},"author":[{"orcid":"0000-0002-8490-9312","id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425","full_name":"Yalniz, Gökhan","last_name":"Yalniz","first_name":"Gökhan"},{"first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"},{"last_name":"Budanur","first_name":"Nazmi B","full_name":"Budanur, Nazmi B","orcid":"0000-0003-0423-5010","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87"}],"volume":126,"date_updated":"2026-09-02T08:16:31Z","status":"public","title":"Coarse graining the state space of a turbulent flow using periodic orbits","acknowledged_ssus":[{"_id":"ScienComp"}],"oa_version":"Preprint"},{"type":"conference","doi":"10.1007/978-3-030-90456-2_8","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"18088"}]},"alternative_title":["LNCS"],"publication_status":"published","publication_identifier":{"eisbn":["978-3-030-90456-2"],"isbn":["9-783-0309-0455-5"],"eissn":["1611-3349"],"issn":["0302-9743"]},"intvolume":"     13044","_id":"10408","article_processing_charge":"No","quality_controlled":"1","fulldoi":"https://doi.org/10.1007/978-3-030-90456-2_8","isi":1,"date_updated":"2026-09-07T14:12:36Z","volume":13044,"status":"public","title":"Grafting key trees: Efficient key management for overlapping groups","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Key trees are often the best solution in terms of transmission cost and storage requirements for managing keys in a setting where a group needs to share a secret key, while being able to efficiently rotate the key material of users (in order to recover from a potential compromise, or to add or remove users). Applications include multicast encryption protocols like LKH (Logical Key Hierarchies) or group messaging like the current IETF proposal TreeKEM. A key tree is a (typically balanced) binary tree, where each node is identified with a key: leaf nodes hold users’ secret keys while the root is the shared group key. For a group of size N, each user just holds   log(N)  keys (the keys on the path from its leaf to the root) and its entire key material can be rotated by broadcasting   2log(N)  ciphertexts (encrypting each fresh key on the path under the keys of its parents). In this work we consider the natural setting where we have many groups with partially overlapping sets of users, and ask if we can find solutions where the cost of rotating a key is better than in the trivial one where we have a separate key tree for each group. We show that in an asymptotic setting (where the number m of groups is fixed while the number N of users grows) there exist more general key graphs whose cost converges to the cost of a single group, thus saving a factor linear in the number of groups over the trivial solution. As our asymptotic “solution” converges very slowly and performs poorly on concrete examples, we propose an algorithm that uses a natural heuristic to compute a key graph for any given group structure. Our algorithm combines two greedy algorithms, and is thus very efficient: it first converts the group structure into a “lattice graph”, which is then turned into a key graph by repeatedly applying the algorithm for constructing a Huffman code. To better understand how far our proposal is from an optimal solution, we prove lower bounds on the update cost of continuous group-key agreement and multicast encryption in a symbolic model admitting (asymmetric) encryption, pseudorandom generators, and secret sharing as building blocks."}],"department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"oa":1,"day":"04","date_created":"2021-12-05T23:01:42Z","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/1158"}],"publisher":"Springer Nature","author":[{"first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Benedikt","last_name":"Auerbach","orcid":"0000-0002-7553-6606","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","full_name":"Auerbach, Benedikt"},{"first_name":"Mirza Ahad","last_name":"Baig","full_name":"Baig, Mirza Ahad","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425"},{"id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","orcid":"0000-0002-2505-4246","full_name":"Cueto Noval, Miguel","last_name":"Cueto Noval","first_name":"Miguel"},{"last_name":"Klein","first_name":"Karen","full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"},{"id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8630-415X","full_name":"Pascual Perez, Guillermo","last_name":"Pascual Perez","first_name":"Guillermo"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"id":"488F98B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3186-2482","full_name":"Walter, Michael","first_name":"Michael","last_name":"Walter"}],"citation":{"chicago":"Alwen, Joel F, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, and Michael Walter. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.” In <i>19th International Conference</i>, 13044:222–53. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-90456-2_8\">https://doi.org/10.1007/978-3-030-90456-2_8</a>.","short":"J.F. Alwen, B. Auerbach, M.A. Baig, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer Nature, 2021, pp. 222–253.","ama":"Alwen JF, Auerbach B, Baig MA, et al. Grafting key trees: Efficient key management for overlapping groups. In: <i>19th International Conference</i>. Vol 13044. Springer Nature; 2021:222-253. doi:<a href=\"https://doi.org/10.1007/978-3-030-90456-2_8\">10.1007/978-3-030-90456-2_8</a>","mla":"Alwen, Joel F., et al. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.” <i>19th International Conference</i>, vol. 13044, Springer Nature, 2021, pp. 222–53, doi:<a href=\"https://doi.org/10.1007/978-3-030-90456-2_8\">10.1007/978-3-030-90456-2_8</a>.","ista":"Alwen JF, Auerbach B, Baig MA, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ, Walter M. 2021. Grafting key trees: Efficient key management for overlapping groups. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13044, 222–253.","ieee":"J. F. Alwen <i>et al.</i>, “Grafting key trees: Efficient key management for overlapping groups,” in <i>19th International Conference</i>, Raleigh, NC, United States, 2021, vol. 13044, pp. 222–253.","apa":"Alwen, J. F., Auerbach, B., Baig, M. A., Cueto Noval, M., Klein, K., Pascual Perez, G., … Walter, M. (2021). Grafting key trees: Efficient key management for overlapping groups. In <i>19th International Conference</i> (Vol. 13044, pp. 222–253). Raleigh, NC, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-90456-2_8\">https://doi.org/10.1007/978-3-030-90456-2_8</a>"},"ec_funded":1,"year":"2021","project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"},{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000728363700008"]},"conference":{"start_date":"2021-11-08","name":"TCC: Theory of Cryptography","end_date":"2021-11-11","location":"Raleigh, NC, United States"},"publication":"19th International Conference","scopus_import":"1","acknowledgement":"B. Auerbach, M.A. Baig and K. Pietrzak—received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT); Karen Klein was supported in part by ERC CoG grant 724307 and conducted part of this work at IST Austria, funded by the ERC under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT); Guillermo Pascual-Perez was funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385; Michael Walter conducted part of this work at IST Austria, funded by the ERC under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).","date_published":"2021-11-04T00:00:00Z","month":"11","page":"222-253","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"publication_status":"published","related_material":{"record":[{"status":"public","id":"637","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"6430","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"10044"},{"id":"10048","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"10041","relation":"part_of_dissertation"},{"id":"10049","status":"public","relation":"part_of_dissertation"}]},"alternative_title":["ISTA Thesis"],"doi":"10.15479/at:ista:10035","type":"dissertation","license":"https://creativecommons.org/licenses/by/4.0/","_id":"10035","publication_identifier":{"issn":["2663-337X"]},"has_accepted_license":"1","file_date_updated":"2022-03-10T12:15:18Z","article_processing_charge":"No","corr_author":"1","fulldoi":"https://doi.org/10.15479/at:ista:10035","oa_version":"Published Version","degree_awarded":"PhD","ddc":["519"],"OA_place":"publisher","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"status":"public","title":"On the adaptive security of graph-based games","date_updated":"2026-09-07T14:12:38Z","publisher":"Institute of Science and Technology Austria","citation":{"ieee":"K. Klein, “On the adaptive security of graph-based games,” Institute of Science and Technology Austria, 2021.","apa":"Klein, K. (2021). <i>On the adaptive security of graph-based games</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10035\">https://doi.org/10.15479/at:ista:10035</a>","ista":"Klein K. 2021. On the adaptive security of graph-based games. Institute of Science and Technology Austria.","mla":"Klein, Karen. <i>On the Adaptive Security of Graph-Based Games</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10035\">10.15479/at:ista:10035</a>.","short":"K. Klein, On the Adaptive Security of Graph-Based Games, Institute of Science and Technology Austria, 2021.","chicago":"Klein, Karen. “On the Adaptive Security of Graph-Based Games.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10035\">https://doi.org/10.15479/at:ista:10035</a>.","ama":"Klein K. On the adaptive security of graph-based games. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10035\">10.15479/at:ista:10035</a>"},"author":[{"first_name":"Karen","last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen"}],"day":"23","date_created":"2021-09-23T07:31:44Z","oa":1,"abstract":[{"text":"Many security definitions come in two flavors: a stronger “adaptive” flavor, where the adversary can arbitrarily make various choices during the course of the attack, and a weaker “selective” flavor where the adversary must commit to some or all of their choices a-priori. For example, in the context of identity-based encryption, selective security requires the adversary to decide on the identity of the attacked party at the very beginning of the game whereas adaptive security allows the attacker to first see the master public key and some secret keys before making this choice. Often, it appears to be much easier to achieve selective security than it is to achieve adaptive security. A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption [Pan07][FJP15], constrained PRFs [FKPR14], and Yao’s garbled circuits [JW16]. Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework (published at Crypto ’17 [JKK+17a]) that connects all of these works and allows us to present them in a unified and simplified fashion. Having the framework in place, we show how to achieve adaptive security for proxy re-encryption schemes (published at PKC ’19 [FKKP19]) and provide the first adaptive security proofs for continuous group key agreement protocols (published at S&P ’21 [KPW+21]). Questioning optimality of our framework, we then show that currently used proof techniques cannot lead to significantly better security guarantees for \"graph-building\" games (published at TCC ’21 [KKPW21a]). These games cover generalized selective decryption, as well as the security of prominent constructions for constrained PRFs, continuous group key agreement, and proxy re-encryption. Finally, we revisit the adaptive security of Yao’s garbled circuits and extend the analysis of Jafargholi and Wichs in two directions: While they prove adaptive security only for a modified construction with increased online complexity, we provide the first positive results for the original construction by Yao (published at TCC ’21 [KKP21a]). On the negative side, we prove that the results of Jafargholi and Wichs are essentially optimal by showing that no black-box reduction can provide a significantly better security bound (published at Crypto ’21 [KKPW21c]).","lang":"eng"}],"language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"KrPi"}],"file":[{"success":1,"date_created":"2021-10-04T12:22:33Z","access_level":"open_access","checksum":"73a44345c683e81f3e765efbf86fdcc5","file_name":"thesis_pdfa.pdf","content_type":"application/pdf","relation":"main_file","date_updated":"2021-10-04T12:22:33Z","file_size":2104726,"file_id":"10082","creator":"cchlebak"},{"checksum":"7b80df30a0e686c3ef6a56d4e1c59e29","access_level":"closed","date_created":"2021-10-05T07:04:37Z","relation":"source_file","content_type":"application/x-zip-compressed","file_name":"thesis_final (1).zip","creator":"cchlebak","file_id":"10085","file_size":9538359,"date_updated":"2022-03-10T12:15:18Z"}],"project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"year":"2021","ec_funded":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"276","acknowledgement":"I want to acknowledge the funding by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).\r\n","supervisor":[{"last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}],"date_published":"2021-09-23T00:00:00Z","month":"09"},{"publisher":"Springer Nature","citation":{"short":"B. Auerbach, S. Chakraborty, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, M.X. Yeo, in:, Topics in Cryptology – CT-RSA 2021, Springer Nature, 2021, pp. 399–421.","chicago":"Auerbach, Benedikt, Suvradip Chakraborty, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, Michael Walter, and Michelle X Yeo. “Inverse-Sybil Attacks in Automated Contact Tracing.” In <i>Topics in Cryptology – CT-RSA 2021</i>, 12704:399–421. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">https://doi.org/10.1007/978-3-030-75539-3_17</a>.","ama":"Auerbach B, Chakraborty S, Klein K, et al. Inverse-Sybil attacks in automated contact tracing. In: <i>Topics in Cryptology – CT-RSA 2021</i>. Vol 12704. Springer Nature; 2021:399-421. doi:<a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">10.1007/978-3-030-75539-3_17</a>","mla":"Auerbach, Benedikt, et al. “Inverse-Sybil Attacks in Automated Contact Tracing.” <i>Topics in Cryptology – CT-RSA 2021</i>, vol. 12704, Springer Nature, 2021, pp. 399–421, doi:<a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">10.1007/978-3-030-75539-3_17</a>.","ista":"Auerbach B, Chakraborty S, Klein K, Pascual Perez G, Pietrzak KZ, Walter M, Yeo MX. 2021. Inverse-Sybil attacks in automated contact tracing. Topics in Cryptology – CT-RSA 2021. CT-RSA: Cryptographers’ Track at the RSA Conference, LNCS, vol. 12704, 399–421.","apa":"Auerbach, B., Chakraborty, S., Klein, K., Pascual Perez, G., Pietrzak, K. Z., Walter, M., &#38; Yeo, M. X. (2021). Inverse-Sybil attacks in automated contact tracing. In <i>Topics in Cryptology – CT-RSA 2021</i> (Vol. 12704, pp. 399–421). Virtual Event: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">https://doi.org/10.1007/978-3-030-75539-3_17</a>","ieee":"B. Auerbach <i>et al.</i>, “Inverse-Sybil attacks in automated contact tracing,” in <i>Topics in Cryptology – CT-RSA 2021</i>, Virtual Event, 2021, vol. 12704, pp. 399–421."},"author":[{"last_name":"Auerbach","first_name":"Benedikt","orcid":"0000-0002-7553-6606","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","full_name":"Auerbach, Benedikt"},{"last_name":"Chakraborty","first_name":"Suvradip","full_name":"Chakraborty, Suvradip","id":"B9CD0494-D033-11E9-B219-A439E6697425"},{"first_name":"Karen","last_name":"Klein","full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pascual Perez","first_name":"Guillermo","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8630-415X","full_name":"Pascual Perez, Guillermo"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"},{"first_name":"Michael","last_name":"Walter","orcid":"0000-0003-3186-2482","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","full_name":"Walter, Michael"},{"id":"2D82B818-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0001-3676-4809","full_name":"Yeo, Michelle X","last_name":"Yeo","first_name":"Michelle X"}],"main_file_link":[{"url":"https://eprint.iacr.org/2020/670","open_access":"1"}],"date_created":"2021-08-08T22:01:30Z","day":"11","oa":1,"department":[{"_id":"KrPi"},{"_id":"GradSch"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Automated contract tracing aims at supporting manual contact tracing during pandemics by alerting users of encounters with infected people. There are currently many proposals for protocols (like the “decentralized” DP-3T and PACT or the “centralized” ROBERT and DESIRE) to be run on mobile phones, where the basic idea is to regularly broadcast (using low energy Bluetooth) some values, and at the same time store (a function of) incoming messages broadcasted by users in their proximity. In the existing proposals one can trigger false positives on a massive scale by an “inverse-Sybil” attack, where a large number of devices (malicious users or hacked phones) pretend to be the same user, such that later, just a single person needs to be diagnosed (and allowed to upload) to trigger an alert for all users who were in proximity to any of this large group of devices.\r\n\r\nWe propose the first protocols that do not succumb to such attacks assuming the devices involved in the attack do not constantly communicate, which we observe is a necessary assumption. The high level idea of the protocols is to derive the values to be broadcasted by a hash chain, so that two (or more) devices who want to launch an inverse-Sybil attack will not be able to connect their respective chains and thus only one of them will be able to upload. Our protocols also achieve security against replay, belated replay, and one of them even against relay attacks."}],"oa_version":"Submitted Version","title":"Inverse-Sybil attacks in automated contact tracing","status":"public","date_updated":"2026-09-07T11:37:54Z","volume":12704,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"399-421","date_published":"2021-05-11T00:00:00Z","month":"05","scopus_import":"1","acknowledgement":"Guillermo Pascual-Perez and Michelle Yeo were funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska–Curie Grant Agreement No. 665385; the remaining contributors to this project have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).","publication":"Topics in Cryptology – CT-RSA 2021","conference":{"location":"Virtual Event","end_date":"2021-05-20","name":"CT-RSA: Cryptographers’ Track at the RSA Conference","start_date":"2021-05-17"},"project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"year":"2021","ec_funded":1,"_id":"9826","intvolume":"     12704","publication_identifier":{"isbn":["9783030755386"],"issn":["0302-9743"],"eissn":["1611-3349"]},"publication_status":"published","alternative_title":["LNCS"],"doi":"10.1007/978-3-030-75539-3_17","type":"conference","corr_author":"1","fulldoi":"https://doi.org/10.1007/978-3-030-75539-3_17","quality_controlled":"1","article_processing_charge":"No"},{"language":[{"iso":"eng"}],"department":[{"_id":"KrPi"},{"_id":"DaAl"}],"abstract":[{"lang":"eng","text":"While messaging systems with strong security guarantees are widely used in practice, designing a protocol that scales efficiently to large groups and enjoys similar security guarantees remains largely open. The two existing proposals to date are ART (Cohn-Gordon et al., CCS18) and TreeKEM (IETF, The Messaging Layer Security Protocol, draft). TreeKEM is the currently considered candidate by the IETF MLS working group, but dynamic group operations (i.e. adding and removing users) can cause efficiency issues. In this paper we formalize and analyze a variant of TreeKEM which we term Tainted TreeKEM (TTKEM for short). The basic idea underlying TTKEM was suggested by Millican (MLS mailing list, February 2018). This version is more efficient than TreeKEM for some natural distributions of group operations, we quantify this through simulations.Our second contribution is two security proofs for TTKEM which establish post compromise and forward secrecy even against adaptive attackers. The security loss (to the underlying PKE) in the Random Oracle Model is a polynomial factor, and a quasipolynomial one in the Standard Model. Our proofs can be adapted to TreeKEM as well. Before our work no security proof for any TreeKEM-like protocol establishing tight security against an adversary who can adaptively choose the sequence of operations was known. We also are the first to prove (or even formalize) active security where the server can arbitrarily deviate from the protocol specification. Proving fully active security – where also the users can arbitrarily deviate – remains open."}],"oa":1,"date_created":"2021-09-27T13:46:27Z","day":"26","author":[{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen","last_name":"Klein","first_name":"Karen"},{"first_name":"Guillermo","last_name":"Pascual Perez","orcid":"0000-0001-8630-415X","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","full_name":"Pascual Perez, Guillermo"},{"last_name":"Walter","first_name":"Michael","orcid":"0000-0003-3186-2482","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","full_name":"Walter, Michael"},{"last_name":"Kamath Hosdurg","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0006-6812-7317","full_name":"Kamath Hosdurg, Chethan"},{"last_name":"Capretto","first_name":"Margarita","full_name":"Capretto, Margarita"},{"last_name":"Cueto Noval","first_name":"Miguel","full_name":"Cueto Noval, Miguel","orcid":"0000-0002-2505-4246","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc"},{"full_name":"Markov, Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","last_name":"Markov","first_name":"Ilia"},{"first_name":"Michelle X","last_name":"Yeo","full_name":"Yeo, Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0001-3676-4809"},{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","first_name":"Joel F","last_name":"Alwen"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}],"citation":{"mla":"Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” <i>2021 IEEE Symposium on Security and Privacy </i>, IEEE, 2021, pp. 268–84, doi:<a href=\"https://doi.org/10.1109/sp40001.2021.00035\">10.1109/sp40001.2021.00035</a>.","ista":"Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium on Security and Privacy . SP: Symposium on Security and Privacy, 268–284.","ama":"Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: <i>2021 IEEE Symposium on Security and Privacy </i>. IEEE; 2021:268-284. doi:<a href=\"https://doi.org/10.1109/sp40001.2021.00035\">10.1109/sp40001.2021.00035</a>","chicago":"Klein, Karen, Guillermo Pascual Perez, Michael Walter, Chethan Kamath Hosdurg, Margarita Capretto, Miguel Cueto Noval, Ilia Markov, Michelle X Yeo, Joel F Alwen, and Krzysztof Z Pietrzak. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” In <i>2021 IEEE Symposium on Security and Privacy </i>, 268–84. IEEE, 2021. <a href=\"https://doi.org/10.1109/sp40001.2021.00035\">https://doi.org/10.1109/sp40001.2021.00035</a>.","short":"K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.","ieee":"K. Klein <i>et al.</i>, “Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement,” in <i>2021 IEEE Symposium on Security and Privacy </i>, San Francisco, CA, United States, 2021, pp. 268–284.","apa":"Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M., Cueto Noval, M., … Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In <i>2021 IEEE Symposium on Security and Privacy </i> (pp. 268–284). San Francisco, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/sp40001.2021.00035\">https://doi.org/10.1109/sp40001.2021.00035</a>"},"publisher":"IEEE","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/1489"}],"date_updated":"2026-09-07T14:12:38Z","status":"public","title":"Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement","oa_version":"Preprint","month":"08","date_published":"2021-08-26T00:00:00Z","acknowledgement":"The first three authors contributed equally to this work. Funded by the European Research Council (ERC) under the European Union’s Horizon2020 research and innovation programme (682815-TOCNeT). Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.665385.","scopus_import":"1","page":"268-284","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ec_funded":1,"year":"2021","conference":{"location":"San Francisco, CA, United States","end_date":"2021-05-27","start_date":"2021-05-24","name":"SP: Symposium on Security and Privacy"},"external_id":{"isi":["001316065000016"]},"project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"publication":"2021 IEEE Symposium on Security and Privacy ","_id":"10049","type":"conference","doi":"10.1109/sp40001.2021.00035","related_material":{"record":[{"relation":"dissertation_contains","id":"10035","status":"public"},{"relation":"dissertation_contains","id":"18088","status":"public"}]},"publication_status":"published","fulldoi":"https://doi.org/10.1109/sp40001.2021.00035","isi":1,"corr_author":"1","article_processing_charge":"No","quality_controlled":"1"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","scopus_import":"1","keyword":["Computing methodologies","shape modeling","modeling and simulation","theory of computation","computational geometry","mathematics of computing","mathematical optimization"],"acknowledgement":"We thank the anonymous reviewers for their generous feedback, and Michal Piovarči for his help in producing the supplemental video. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 715767).\r\n","month":"07","date_published":"2021-07-19T00:00:00Z","publication":"ACM Transactions on Graphics","file":[{"checksum":"7e5d08ce46b0451b3102eacd3d00f85f","date_created":"2021-10-18T10:42:15Z","success":1,"access_level":"open_access","creator":"chafner","file_id":"10150","file_size":17064290,"date_updated":"2021-10-18T10:42:15Z","content_type":"application/pdf","relation":"main_file","file_name":"elastic-curves-paper.pdf"},{"content_type":"application/pdf","relation":"supplementary_material","file_name":"elastic-curves-supp.pdf","file_id":"10151","creator":"chafner","file_size":547156,"date_updated":"2021-10-18T10:42:22Z","checksum":"0088643478be7c01a703b5b10767348f","date_created":"2021-10-18T10:42:22Z","access_level":"open_access"}],"project":[{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020"}],"external_id":{"isi":["000674930900091"]},"conference":{"end_date":"2021-08-13","name":"SIGGRAF: Special Interest Group on Computer Graphics and Interactive Techniques","start_date":"2021-08-09","location":"Virtual"},"year":"2021","ec_funded":1,"author":[{"last_name":"Hafner","first_name":"Christian","id":"400429CC-F248-11E8-B48F-1D18A9856A87","full_name":"Hafner, Christian"},{"first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"}],"publisher":"Association for Computing Machinery","citation":{"chicago":"Hafner, Christian, and Bernd Bickel. “The Design Space of Plane Elastic Curves.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3450626.3459800\">https://doi.org/10.1145/3450626.3459800</a>.","ama":"Hafner C, Bickel B. The design space of plane elastic curves. <i>ACM Transactions on Graphics</i>. 2021;40(4). doi:<a href=\"https://doi.org/10.1145/3450626.3459800\">10.1145/3450626.3459800</a>","short":"C. Hafner, B. Bickel, ACM Transactions on Graphics 40 (2021).","mla":"Hafner, Christian, and Bernd Bickel. “The Design Space of Plane Elastic Curves.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, 126, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3450626.3459800\">10.1145/3450626.3459800</a>.","ista":"Hafner C, Bickel B. 2021. The design space of plane elastic curves. ACM Transactions on Graphics. 40(4), 126.","ieee":"C. Hafner and B. Bickel, “The design space of plane elastic curves,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4. Association for Computing Machinery, 2021.","apa":"Hafner, C., &#38; Bickel, B. (2021). The design space of plane elastic curves. <i>ACM Transactions on Graphics</i>. Virtual: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3450626.3459800\">https://doi.org/10.1145/3450626.3459800</a>"},"day":"19","date_created":"2021-08-08T22:01:26Z","oa":1,"abstract":[{"lang":"eng","text":"Elastic bending of initially flat slender elements allows the realization and economic fabrication of intriguing curved shapes. In this work, we derive an intuitive but rigorous geometric characterization of the design space of plane elastic rods with variable stiffness. It enables designers to determine which shapes are physically viable with active bending by visual inspection alone. Building on these insights, we propose a method for efficiently designing the geometry of a flat elastic rod that realizes a target equilibrium curve, which only requires solving a linear program. We implement this method in an interactive computational design tool that gives feedback about the feasibility of a design, and computes the geometry of the structural elements necessary to realize it within an instant. The tool also offers an iterative optimization routine that improves the fabricability of a model while modifying it as little as possible. In addition, we use our geometric characterization to derive an algorithm for analyzing and recovering the stability of elastic curves that would otherwise snap out of their unstable equilibrium shapes by buckling. We show the efficacy of our approach by designing and manufacturing several physical models that are assembled from flat elements."}],"language":[{"iso":"eng"}],"department":[{"_id":"BeBi"}],"oa_version":"Published Version","ddc":["516"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"The design space of plane elastic curves","status":"public","date_updated":"2026-09-26T22:30:06Z","volume":40,"isi":1,"article_type":"original","fulldoi":"https://doi.org/10.1145/3450626.3459800","has_accepted_license":"1","quality_controlled":"1","file_date_updated":"2021-10-18T10:42:22Z","article_processing_charge":"No","_id":"9817","issue":"4","intvolume":"        40","article_number":"126","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"publication_status":"published","related_material":{"link":[{"description":"News on IST Website","relation":"press_release","url":"https://ist.ac.at/en/news/designing-with-elastic-structures/"}],"record":[{"relation":"dissertation_contains","status":"public","id":"12897"}]},"doi":"10.1145/3450626.3459800","type":"journal_article"},{"_id":"8602","intvolume":"        17","publication_identifier":{"eissn":["1745-2481"],"issn":["1745-2473"]},"publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","id":"12964","status":"public"}],"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/wound-healing-waves/","description":"News on IST Homepage"}]},"doi":"10.1038/s41567-020-01037-7","type":"journal_article","corr_author":"1","isi":1,"article_type":"original","fulldoi":"https://doi.org/10.1038/s41567-020-01037-7","quality_controlled":"1","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.05.15.096479"}],"author":[{"full_name":"Boocock, Daniel R","id":"453AF628-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1585-2631","last_name":"Boocock","first_name":"Daniel R"},{"first_name":"Naoya","last_name":"Hino","full_name":"Hino, Naoya"},{"first_name":"Natalia","last_name":"Ruzickova","id":"D2761128-D73D-11E9-A1BF-BA0DE6697425","full_name":"Ruzickova, Natalia"},{"full_name":"Hirashima, Tsuyoshi","last_name":"Hirashima","first_name":"Tsuyoshi"},{"last_name":"Hannezo","first_name":"Edouard B","full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87"}],"citation":{"ista":"Boocock DR, Hino N, Ruzickova N, Hirashima T, Hannezo EB. 2021. Theory of mechanochemical patterning and optimal migration in cell monolayers. Nature Physics. 17, 267–274.","mla":"Boocock, Daniel R., et al. “Theory of Mechanochemical Patterning and Optimal Migration in Cell Monolayers.” <i>Nature Physics</i>, vol. 17, Springer Nature, 2021, pp. 267–74, doi:<a href=\"https://doi.org/10.1038/s41567-020-01037-7\">10.1038/s41567-020-01037-7</a>.","chicago":"Boocock, Daniel R, Naoya Hino, Natalia Ruzickova, Tsuyoshi Hirashima, and Edouard B Hannezo. “Theory of Mechanochemical Patterning and Optimal Migration in Cell Monolayers.” <i>Nature Physics</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41567-020-01037-7\">https://doi.org/10.1038/s41567-020-01037-7</a>.","short":"D.R. Boocock, N. Hino, N. Ruzickova, T. Hirashima, E.B. Hannezo, Nature Physics 17 (2021) 267–274.","ama":"Boocock DR, Hino N, Ruzickova N, Hirashima T, Hannezo EB. Theory of mechanochemical patterning and optimal migration in cell monolayers. <i>Nature Physics</i>. 2021;17:267-274. doi:<a href=\"https://doi.org/10.1038/s41567-020-01037-7\">10.1038/s41567-020-01037-7</a>","ieee":"D. R. Boocock, N. Hino, N. Ruzickova, T. Hirashima, and E. B. Hannezo, “Theory of mechanochemical patterning and optimal migration in cell monolayers,” <i>Nature Physics</i>, vol. 17. Springer Nature, pp. 267–274, 2021.","apa":"Boocock, D. R., Hino, N., Ruzickova, N., Hirashima, T., &#38; Hannezo, E. B. (2021). Theory of mechanochemical patterning and optimal migration in cell monolayers. <i>Nature Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41567-020-01037-7\">https://doi.org/10.1038/s41567-020-01037-7</a>"},"publisher":"Springer Nature","day":"01","date_created":"2020-10-04T22:01:37Z","oa":1,"abstract":[{"lang":"eng","text":"Collective cell migration offers a rich field of study for non-equilibrium physics and cellular biology, revealing phenomena such as glassy dynamics, pattern formation and active turbulence. However, how mechanical and chemical signalling are integrated at the cellular level to give rise to such collective behaviours remains unclear. We address this by focusing on the highly conserved phenomenon of spatiotemporal waves of density and extracellular signal-regulated kinase (ERK) activation, which appear both in vitro and in vivo during collective cell migration and wound healing. First, we propose a biophysical theory, backed by mechanical and optogenetic perturbation experiments, showing that patterns can be quantitatively explained by a mechanochemical coupling between active cellular tensions and the mechanosensitive ERK pathway. Next, we demonstrate how this biophysical mechanism can robustly induce long-ranged order and migration in a desired orientation, and we determine the theoretically optimal wavelength and period for inducing maximal migration towards free edges, which fits well with experimentally observed dynamics. We thereby provide a bridge between the biophysical origin of spatiotemporal instabilities and the design principles of robust and efficient long-ranged migration."}],"language":[{"iso":"eng"}],"department":[{"_id":"EdHa"}],"oa_version":"Preprint","title":"Theory of mechanochemical patterning and optimal migration in cell monolayers","status":"public","volume":17,"date_updated":"2026-09-26T22:30:05Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"267-274","acknowledgement":"We would like to thank G. Tkacik and all of the members of the Hannezo and Hirashima groups for useful discussions, X. Trepat for help on traction force microscopy and M. Matsuda for use of the lab facility. E.H. acknowledges grants from the Austrian Science Fund (FWF) (P 31639) and the European Research Council (851288). T.H. acknowledges a grant from JST, PRESTO (JPMJPR1949). This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 665385 (to D.B.), from JSPS KAKENHI grant no. 17J02107 (to N.H.) and from the SPIRITS 2018 of Kyoto University (to E.H. and T.H.).","scopus_import":"1","date_published":"2021-02-01T00:00:00Z","month":"02","publication":"Nature Physics","external_id":{"isi":["000573519500002"]},"project":[{"call_identifier":"FWF","name":"Active mechano-chemical description of the cell cytoskeleton","_id":"268294B6-B435-11E9-9278-68D0E5697425","grant_number":"P31639"},{"_id":"05943252-7A3F-11EA-A408-12923DDC885E","grant_number":"851288","name":"Design Principles of Branching Morphogenesis","call_identifier":"H2020"},{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"year":"2021","ec_funded":1},{"isi":1,"corr_author":"1","fulldoi":"https://doi.org/10.1038/s41467-021-23123-x","article_type":"original","quality_controlled":"1","has_accepted_license":"1","file_date_updated":"2021-05-28T12:39:43Z","article_processing_charge":"No","issue":"1","_id":"9429","intvolume":"        12","article_number":"3058","publication_identifier":{"eissn":["2041-1723"]},"publication_status":"published","related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/defective-gene-slows-down-brain-cells/"}],"record":[{"relation":"dissertation_contains","status":"public","id":"19557"},{"relation":"earlier_version","status":"public","id":"7800"},{"status":"public","id":"12401","relation":"dissertation_contains"}]},"doi":"10.1038/s41467-021-23123-x","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-05-24T00:00:00Z","month":"05","scopus_import":"1","keyword":["General Biochemistry","Genetics and Molecular Biology"],"acknowledgement":"We thank A. Coll Manzano, F. Freeman, M. Ladron de Guevara, and A. Ç. Yahya for technical assistance, S. Deixler, A. Lepold, and A. Schlerka for the management of our animal colony, as well as M. Schunn and the Preclinical Facility team for technical assistance. We thank K. Heesom and her team at the University of Bristol Proteomics Facility for the proteomics sample preparation, data generation, and analysis support. We thank Y. B. Simon for kindly providing the plasmid for lentiviral labeling. Further, we thank M. Sixt for his advice regarding cell migration and the fruitful discussions. This work was supported by the ISTPlus postdoctoral fellowship (Grant Agreement No. 754411) to B.B., by the European Union’s Horizon 2020 research and innovation program (ERC) grant 715508 (REVERSEAUTISM), and by the Austrian Science Fund (FWF) to G.N. (DK W1232-B24 and SFB F7807-B) and to J.G.D (I3600-B27).","file":[{"content_type":"application/pdf","relation":"main_file","file_name":"2021_NatureCommunications_Morandell.pdf","file_id":"9430","creator":"kschuh","date_updated":"2021-05-28T12:39:43Z","file_size":9358599,"checksum":"337e0f7959c35ec959984cacdcb472ba","date_created":"2021-05-28T12:39:43Z","success":1,"access_level":"open_access"}],"publication":"Nature Communications","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"name":"Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo and in vitro Models","call_identifier":"H2020","_id":"25444568-B435-11E9-9278-68D0E5697425","grant_number":"715508"},{"grant_number":"W1232","_id":"2548AE96-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Molecular Drug Targets"},{"grant_number":"F7807","_id":"05A0D778-7A3F-11EA-A408-12923DDC885E","name":"Stem Cell Modulation in Neural Development and Regeneration/ P07-Neural stem cells in autism and epilepsy"},{"call_identifier":"FWF","name":"Optical control of synaptic function via adhesion molecules","grant_number":"I03600","_id":"265CB4D0-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000658769900010"]},"year":"2021","ec_funded":1,"author":[{"first_name":"Jasmin","last_name":"Morandell","full_name":"Morandell, Jasmin","id":"4739D480-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schwarz","first_name":"Lena A","id":"29A8453C-F248-11E8-B48F-1D18A9856A87","full_name":"Schwarz, Lena A"},{"last_name":"Basilico","first_name":"Bernadette","full_name":"Basilico, Bernadette","id":"36035796-5ACA-11E9-A75E-7AF2E5697425","orcid":"0000-0003-1843-3173"},{"orcid":"0000-0003-1671-393X","id":"4323B49C-F248-11E8-B48F-1D18A9856A87","full_name":"Tasciyan, Saren","last_name":"Tasciyan","first_name":"Saren"},{"last_name":"Dimchev","first_name":"Georgi A","orcid":"0000-0001-8370-6161","id":"38C393BE-F248-11E8-B48F-1D18A9856A87","full_name":"Dimchev, Georgi A"},{"full_name":"Nicolas, Armel","id":"2A103192-F248-11E8-B48F-1D18A9856A87","last_name":"Nicolas","first_name":"Armel"},{"first_name":"Christoph M","last_name":"Sommer","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1216-9105","full_name":"Sommer, Christoph M"},{"last_name":"Kreuzinger","first_name":"Caroline","full_name":"Kreuzinger, Caroline","id":"382077BA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christoph","last_name":"Dotter","full_name":"Dotter, Christoph","orcid":"0000-0002-9033-9096","id":"4C66542E-F248-11E8-B48F-1D18A9856A87"},{"id":"3B2ABCF4-F248-11E8-B48F-1D18A9856A87","full_name":"Knaus, Lisa","first_name":"Lisa","last_name":"Knaus"},{"last_name":"Dobler","first_name":"Zoe","id":"D23090A2-9057-11EA-883A-A8396FC7A38F","full_name":"Dobler, Zoe"},{"full_name":"Cacci, Emanuele","last_name":"Cacci","first_name":"Emanuele"},{"full_name":"Schur, Florian KM","orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","first_name":"Florian KM"},{"id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","full_name":"Danzl, Johann G","last_name":"Danzl","first_name":"Johann G"},{"orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","full_name":"Novarino, Gaia","last_name":"Novarino","first_name":"Gaia"}],"citation":{"mla":"Morandell, Jasmin, et al. “Cul3 Regulates Cytoskeleton Protein Homeostasis and Cell Migration during a Critical Window of Brain Development.” <i>Nature Communications</i>, vol. 12, no. 1, 3058, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-23123-x\">10.1038/s41467-021-23123-x</a>.","ista":"Morandell J, Schwarz LA, Basilico B, Tasciyan S, Dimchev GA, Nicolas A, Sommer CM, Kreuzinger C, Dotter C, Knaus L, Dobler Z, Cacci E, Schur FK, Danzl JG, Novarino G. 2021. Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development. Nature Communications. 12(1), 3058.","short":"J. Morandell, L.A. Schwarz, B. Basilico, S. Tasciyan, G.A. Dimchev, A. Nicolas, C.M. Sommer, C. Kreuzinger, C. Dotter, L. Knaus, Z. Dobler, E. Cacci, F.K. Schur, J.G. Danzl, G. Novarino, Nature Communications 12 (2021).","ama":"Morandell J, Schwarz LA, Basilico B, et al. Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-23123-x\">10.1038/s41467-021-23123-x</a>","chicago":"Morandell, Jasmin, Lena A Schwarz, Bernadette Basilico, Saren Tasciyan, Georgi A Dimchev, Armel Nicolas, Christoph M Sommer, et al. “Cul3 Regulates Cytoskeleton Protein Homeostasis and Cell Migration during a Critical Window of Brain Development.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-23123-x\">https://doi.org/10.1038/s41467-021-23123-x</a>.","apa":"Morandell, J., Schwarz, L. A., Basilico, B., Tasciyan, S., Dimchev, G. A., Nicolas, A., … Novarino, G. (2021). Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-23123-x\">https://doi.org/10.1038/s41467-021-23123-x</a>","ieee":"J. Morandell <i>et al.</i>, “Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development,” <i>Nature Communications</i>, vol. 12, no. 1. Springer Nature, 2021."},"publisher":"Springer Nature","date_created":"2021-05-28T11:49:46Z","day":"24","oa":1,"department":[{"_id":"GaNo"},{"_id":"JoDa"},{"_id":"FlSc"},{"_id":"MiSi"},{"_id":"LifeSc"},{"_id":"Bio"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"De novo loss of function mutations in the ubiquitin ligase-encoding gene Cullin3 lead to autism spectrum disorder (ASD). In mouse, constitutive haploinsufficiency leads to motor coordination deficits as well as ASD-relevant social and cognitive impairments. However, induction of Cul3 haploinsufficiency later in life does not lead to ASD-relevant behaviors, pointing to an important role of Cul3 during a critical developmental window. Here we show that Cul3 is essential to regulate neuronal migration and, therefore, constitutive Cul3 heterozygous mutant mice display cortical lamination abnormalities. At the molecular level, we found that Cul3 controls neuronal migration by tightly regulating the amount of Plastin3 (Pls3), a previously unrecognized player of neural migration. Furthermore, we found that Pls3 cell-autonomously regulates cell migration by regulating actin cytoskeleton organization, and its levels are inversely proportional to neural migration speed. Finally, we provide evidence that cellular phenotypes associated with autism-linked gene haploinsufficiency can be rescued by transcriptional activation of the intact allele in vitro, offering a proof of concept for a potential therapeutic approach for ASDs."}],"oa_version":"Published Version","acknowledged_ssus":[{"_id":"PreCl"}],"ddc":["572"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"status":"public","title":"Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development","date_updated":"2026-09-26T22:30:12Z","volume":12},{"isi":1,"article_type":"original","fulldoi":"https://doi.org/10.1016/j.ydbio.2020.12.014","file_date_updated":"2021-08-11T10:28:06Z","has_accepted_license":"1","quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","intvolume":"       474","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","_id":"8966","pmid":1,"publication_identifier":{"issn":["0012-1606"]},"related_material":{"record":[{"relation":"dissertation_contains","id":"12891","status":"public"}]},"publication_status":"published","type":"journal_article","doi":"10.1016/j.ydbio.2020.12.014","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We thank Nicoletta Petridou, Diana Pinheiro, Cornelia Schwayer and Stefania Tavano for feedback on the manuscript. Research in the Heisenberg lab is supported by an ERC Advanced Grant (MECSPEC 742573) to C.-P.H. A.S. is a recipient of a DOC Fellowship of the Austrian Academy of Science.","scopus_import":"1","keyword":["Developmental Biology","Cell Biology","Molecular Biology"],"date_published":"2021-06-01T00:00:00Z","month":"06","page":"71-81","project":[{"name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation","call_identifier":"H2020","_id":"260F1432-B435-11E9-9278-68D0E5697425","grant_number":"742573"},{"_id":"26B1E39C-B435-11E9-9278-68D0E5697425","grant_number":"25239","name":"Mesendoderm specification in zebrafish: The role of extraembryonic tissues"}],"external_id":{"pmid":["33352181"],"isi":["000639461800008"]},"publication":"Developmental Biology","file":[{"file_id":"9880","creator":"kschuh","date_updated":"2021-08-11T10:28:06Z","file_size":1440321,"relation":"main_file","content_type":"application/pdf","file_name":"2021_DevBiology_Schauer.pdf","checksum":"fa2a5731fd16ab171b029f32f031c440","access_level":"open_access","date_created":"2021-08-11T10:28:06Z","success":1}],"ec_funded":1,"year":"2021","day":"01","date_created":"2020-12-22T09:53:34Z","author":[{"id":"30A536BA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7659-9142","full_name":"Schauer, Alexandra","first_name":"Alexandra","last_name":"Schauer"},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"citation":{"mla":"Schauer, Alexandra, and Carl-Philipp J. Heisenberg. “Reassembling Gastrulation.” <i>Developmental Biology</i>, vol. 474, Elsevier, 2021, pp. 71–81, doi:<a href=\"https://doi.org/10.1016/j.ydbio.2020.12.014\">10.1016/j.ydbio.2020.12.014</a>.","ista":"Schauer A, Heisenberg C-PJ. 2021. Reassembling gastrulation. Developmental Biology. 474, 71–81.","short":"A. Schauer, C.-P.J. Heisenberg, Developmental Biology 474 (2021) 71–81.","ama":"Schauer A, Heisenberg C-PJ. Reassembling gastrulation. <i>Developmental Biology</i>. 2021;474:71-81. doi:<a href=\"https://doi.org/10.1016/j.ydbio.2020.12.014\">10.1016/j.ydbio.2020.12.014</a>","chicago":"Schauer, Alexandra, and Carl-Philipp J Heisenberg. “Reassembling Gastrulation.” <i>Developmental Biology</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.ydbio.2020.12.014\">https://doi.org/10.1016/j.ydbio.2020.12.014</a>.","ieee":"A. Schauer and C.-P. J. Heisenberg, “Reassembling gastrulation,” <i>Developmental Biology</i>, vol. 474. Elsevier, pp. 71–81, 2021.","apa":"Schauer, A., &#38; Heisenberg, C.-P. J. (2021). Reassembling gastrulation. <i>Developmental Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ydbio.2020.12.014\">https://doi.org/10.1016/j.ydbio.2020.12.014</a>"},"publisher":"Elsevier","abstract":[{"lang":"eng","text":"During development, a single cell is transformed into a highly complex organism through progressive cell division, specification and rearrangement. An important prerequisite for the emergence of patterns within the developing organism is to establish asymmetries at various scales, ranging from individual cells to the entire embryo, eventually giving rise to the different body structures. This becomes especially apparent during gastrulation, when the earliest major lineage restriction events lead to the formation of the different germ layers. Traditionally, the unfolding of the developmental program from symmetry breaking to germ layer formation has been studied by dissecting the contributions of different signaling pathways and cellular rearrangements in the in vivo context of intact embryos. Recent efforts, using the intrinsic capacity of embryonic stem cells to self-assemble and generate embryo-like structures de novo, have opened new avenues for understanding the many ways by which an embryo can be built and the influence of extrinsic factors therein. Here, we discuss and compare divergent and conserved strategies leading to germ layer formation in embryos as compared to in vitro systems, their upstream molecular cascades and the role of extrinsic factors in this process."}],"language":[{"iso":"eng"}],"department":[{"_id":"CaHe"}],"oa":1,"ddc":["570"],"oa_version":"Published Version","date_updated":"2026-09-26T22:30:14Z","volume":474,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"title":"Reassembling gastrulation","status":"public"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-04-14T00:00:00Z","month":"04","scopus_import":"1","acknowledgement":"The AK group is supported by IST Austria and by the ERC under European Union Horizon 2020 research and innovation programme Grant 680037. Apologies to those whose work could not be mentioned due to limited space. We thank all my lab members, both past and present, for stimulating discussion. This work was funded by a Singapore Ministry of Education Tier 3 Grant, MOE2016-T3-1-005. We thank Francis Corson for continuous discussion and collaboration contributing to these views and for figure 4(A). PC is sponsored by the Institut Pasteur and the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 665807. Research in JG's laboratory is funded by the European Research Council under the European Union's Seventh Framework Programme (FP7/2007-2013)/ERC Grant Agreement No. 337635, Institut Pasteur, CNRS, Cercle FSER, Fondation pour la Recherche Medicale, the Vallee Foundation and the ANR-19-CE-13-0024 Grant. We thank Erez Braun and Alex Mogilner for comments on the manuscript and Niv Ierushalmi for help with figure 5. This project has received funding from the European Union's Horizon 2020 research and innovation programme under Grant Agreement No. ERC-2018-COG Grant 819174-HydraMechanics awarded to KK. EH thanks all lab members, as well as Pierre Recho, Tsuyoshi Hirashima, Diana Pinheiro and Carl-Philip Heisenberg, for fruitful discussions on these topics—and apologize for not being able to cite many very relevant publications due to the strict 10-reference limit. EH acknowledges the support of Austrian Science Fund (FWF) (P 31639) and the European Research Council under the European Union's Horizon 2020 Research and Innovation Programme Grant Agreements (851288). The authors acknowledge the inspiring scientists whose work could not be cited in this perspective due to space constraints; the members of the Gartner Lab for helpful discussions; the Barbara and Gerson Bakar Foundation, the Chan Zuckerberg Biohub Investigators Programme, the National Institute of Health, and the Centre for Cellular Construction, an NSF Science and Technology Centre. The Minc laboratory is currently funded by the CNRS and the European Research Council (CoG Forcaster No. 647073). Research in the lab of J-LM is supported by the Institut Curie, the Centre National de la Recherche Scientifique (CNRS), the Institut National de la Santé Et de la Recherche Médicale (INSERM), and is funded by grants from the ATIP-Avenir programme, the Fondation Schlumberger pour l'Éducation et la Recherche via the Fondation pour la Recherche Médicale, the European Research Council Starting Grant ERC-2017-StG 757557, the European Molecular Biology Organization Young Investigator programme (EMBO YIP), the INSERM transversal programme Human Development Cell Atlas (HuDeCA), Paris Sciences Lettres (PSL) 'nouvelle équipe' and QLife (17-CONV-0005) grants and Labex DEEP (ANR-11-LABX-0044) which are part of the IDEX PSL (ANR-10-IDEX-0001-02). We acknowledge useful discussions with Massimo Vergassola, Sebastian Streichan and my lab members. Work in my laboratory on Drosophila embryogenesis is partly supported by NIH-R01GM122936. The authors acknowledge the support by a grant from the European Research Council (Grant No. 682161). Lenne group is funded by a grant from the 'Investissements d'Avenir' French Government programme managed by the French National Research Agency (ANR-16-CONV-0001) and by the Excellence Initiative of Aix-Marseille University—A*MIDEX, and ANR projects MechaResp (ANR-17-CE13-0032) and AdGastrulo (ANR-19-CE13-0022).","file":[{"date_updated":"2021-04-27T08:38:35Z","file_size":6296324,"creator":"cziletti","file_id":"9355","file_name":"2021_PhysBio_Lenne.pdf","relation":"main_file","content_type":"application/pdf","access_level":"open_access","success":1,"date_created":"2021-04-27T08:38:35Z","checksum":"4f52082549d3561c4c15d4d8d84ca5d8"}],"publication":"Physical biology","project":[{"_id":"B6FC0238-B512-11E9-945C-1524E6697425","grant_number":"680037","name":"Coordination of Patterning And Growth In the Spinal Cord","call_identifier":"H2020"},{"name":"Active mechano-chemical description of the cell cytoskeleton","call_identifier":"FWF","_id":"268294B6-B435-11E9-9278-68D0E5697425","grant_number":"P31639"},{"grant_number":"851288","_id":"05943252-7A3F-11EA-A408-12923DDC885E","name":"Design Principles of Branching Morphogenesis","call_identifier":"H2020"}],"external_id":{"pmid":["33276350"],"isi":["000640396400001"]},"year":"2021","ec_funded":1,"author":[{"full_name":"Lenne, Pierre François","last_name":"Lenne","first_name":"Pierre François"},{"full_name":"Munro, Edwin","first_name":"Edwin","last_name":"Munro"},{"last_name":"Heemskerk","first_name":"Idse","full_name":"Heemskerk, Idse"},{"full_name":"Warmflash, Aryeh","last_name":"Warmflash","first_name":"Aryeh"},{"full_name":"Bocanegra, Laura","id":"4896F754-F248-11E8-B48F-1D18A9856A87","last_name":"Bocanegra","first_name":"Laura"},{"orcid":"0000-0001-6060-4795","id":"3065DFC4-F248-11E8-B48F-1D18A9856A87","full_name":"Kishi, Kasumi","last_name":"Kishi","first_name":"Kasumi"},{"first_name":"Anna","last_name":"Kicheva","orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","full_name":"Kicheva, Anna"},{"full_name":"Long, Yuchen","last_name":"Long","first_name":"Yuchen"},{"last_name":"Fruleux","first_name":"Antoine","full_name":"Fruleux, Antoine"},{"last_name":"Boudaoud","first_name":"Arezki","full_name":"Boudaoud, Arezki"},{"last_name":"Saunders","first_name":"Timothy E.","full_name":"Saunders, Timothy E."},{"full_name":"Caldarelli, Paolo","last_name":"Caldarelli","first_name":"Paolo"},{"last_name":"Michaut","first_name":"Arthur","full_name":"Michaut, Arthur"},{"first_name":"Jerome","last_name":"Gros","full_name":"Gros, Jerome"},{"full_name":"Maroudas-Sacks, Yonit","first_name":"Yonit","last_name":"Maroudas-Sacks"},{"full_name":"Keren, Kinneret","first_name":"Kinneret","last_name":"Keren"},{"last_name":"Hannezo","first_name":"Edouard B","full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Zev J.","last_name":"Gartner","full_name":"Gartner, Zev J."},{"full_name":"Stormo, Benjamin","first_name":"Benjamin","last_name":"Stormo"},{"first_name":"Amy","last_name":"Gladfelter","full_name":"Gladfelter, Amy"},{"full_name":"Rodrigues, Alan","last_name":"Rodrigues","first_name":"Alan"},{"full_name":"Shyer, Amy","first_name":"Amy","last_name":"Shyer"},{"first_name":"Nicolas","last_name":"Minc","full_name":"Minc, Nicolas"},{"full_name":"Maître, Jean Léon","last_name":"Maître","first_name":"Jean Léon"},{"full_name":"Di Talia, Stefano","first_name":"Stefano","last_name":"Di Talia"},{"full_name":"Khamaisi, Bassma","first_name":"Bassma","last_name":"Khamaisi"},{"first_name":"David","last_name":"Sprinzak","full_name":"Sprinzak, David"},{"full_name":"Tlili, Sham","last_name":"Tlili","first_name":"Sham"}],"citation":{"apa":"Lenne, P. F., Munro, E., Heemskerk, I., Warmflash, A., Bocanegra, L., Kishi, K., … Tlili, S. (2021). Roadmap for the multiscale coupling of biochemical and mechanical signals during development. <i>Physical Biology</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1478-3975/abd0db\">https://doi.org/10.1088/1478-3975/abd0db</a>","ieee":"P. F. Lenne <i>et al.</i>, “Roadmap for the multiscale coupling of biochemical and mechanical signals during development,” <i>Physical biology</i>, vol. 18, no. 4. IOP Publishing, 2021.","ista":"Lenne PF, Munro E, Heemskerk I, Warmflash A, Bocanegra L, Kishi K, Kicheva A, Long Y, Fruleux A, Boudaoud A, Saunders TE, Caldarelli P, Michaut A, Gros J, Maroudas-Sacks Y, Keren K, Hannezo EB, Gartner ZJ, Stormo B, Gladfelter A, Rodrigues A, Shyer A, Minc N, Maître JL, Di Talia S, Khamaisi B, Sprinzak D, Tlili S. 2021. Roadmap for the multiscale coupling of biochemical and mechanical signals during development. Physical biology. 18(4), 041501.","mla":"Lenne, Pierre François, et al. “Roadmap for the Multiscale Coupling of Biochemical and Mechanical Signals during Development.” <i>Physical Biology</i>, vol. 18, no. 4, 041501, IOP Publishing, 2021, doi:<a href=\"https://doi.org/10.1088/1478-3975/abd0db\">10.1088/1478-3975/abd0db</a>.","short":"P.F. Lenne, E. Munro, I. Heemskerk, A. Warmflash, L. Bocanegra, K. Kishi, A. Kicheva, Y. Long, A. Fruleux, A. Boudaoud, T.E. Saunders, P. Caldarelli, A. Michaut, J. Gros, Y. Maroudas-Sacks, K. Keren, E.B. Hannezo, Z.J. Gartner, B. Stormo, A. Gladfelter, A. Rodrigues, A. Shyer, N. Minc, J.L. Maître, S. Di Talia, B. Khamaisi, D. Sprinzak, S. Tlili, Physical Biology 18 (2021).","chicago":"Lenne, Pierre François, Edwin Munro, Idse Heemskerk, Aryeh Warmflash, Laura Bocanegra, Kasumi Kishi, Anna Kicheva, et al. “Roadmap for the Multiscale Coupling of Biochemical and Mechanical Signals during Development.” <i>Physical Biology</i>. IOP Publishing, 2021. <a href=\"https://doi.org/10.1088/1478-3975/abd0db\">https://doi.org/10.1088/1478-3975/abd0db</a>.","ama":"Lenne PF, Munro E, Heemskerk I, et al. Roadmap for the multiscale coupling of biochemical and mechanical signals during development. <i>Physical biology</i>. 2021;18(4). doi:<a href=\"https://doi.org/10.1088/1478-3975/abd0db\">10.1088/1478-3975/abd0db</a>"},"publisher":"IOP Publishing","date_created":"2021-04-25T22:01:29Z","day":"14","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"AnKi"},{"_id":"EdHa"}],"abstract":[{"lang":"eng","text":"The way in which interactions between mechanics and biochemistry lead to the emergence of complex cell and tissue organization is an old question that has recently attracted renewed interest from biologists, physicists, mathematicians and computer scientists. Rapid advances in optical physics, microscopy and computational image analysis have greatly enhanced our ability to observe and quantify spatiotemporal patterns of signalling, force generation, deformation, and flow in living cells and tissues. Powerful new tools for genetic, biophysical and optogenetic manipulation are allowing us to perturb the underlying machinery that generates these patterns in increasingly sophisticated ways. Rapid advances in theory and computing have made it possible to construct predictive models that describe how cell and tissue organization and dynamics emerge from the local coupling of biochemistry and mechanics. Together, these advances have opened up a wealth of new opportunities to explore how mechanochemical patterning shapes organismal development. In this roadmap, we present a series of forward-looking case studies on mechanochemical patterning in development, written by scientists working at the interface between the physical and biological sciences, and covering a wide range of spatial and temporal scales, organisms, and modes of development. Together, these contributions highlight the many ways in which the dynamic coupling of mechanics and biochemistry shapes biological dynamics: from mechanoenzymes that sense force to tune their activity and motor output, to collectives of cells in tissues that flow and redistribute biochemical signals during development."}],"oa_version":"Published Version","ddc":["570"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"status":"public","title":"Roadmap for the multiscale coupling of biochemical and mechanical signals during development","date_updated":"2026-09-26T22:30:18Z","volume":18,"isi":1,"fulldoi":"https://doi.org/10.1088/1478-3975/abd0db","article_type":"original","quality_controlled":"1","has_accepted_license":"1","file_date_updated":"2021-04-27T08:38:35Z","article_processing_charge":"No","issue":"4","_id":"9349","intvolume":"        18","article_number":"041501","publication_identifier":{"eissn":["1478-3975"]},"pmid":1,"publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","id":"13081","status":"public"}]},"doi":"10.1088/1478-3975/abd0db","type":"journal_article"},{"article_type":"original","fulldoi":"https://doi.org/10.1038/s41596-021-00526-0","corr_author":"1","isi":1,"article_processing_charge":"No","has_accepted_license":"1","quality_controlled":"1","file_date_updated":"2021-12-02T23:30:05Z","publication_identifier":{"issn":["1754-2189"],"eissn":["1750-2799"]},"pmid":1,"_id":"9438","issue":"6","intvolume":"        16","doi":"10.1038/s41596-021-00526-0","type":"journal_article","publication_status":"published","page":"2947–2967","scopus_import":"1","acknowledgement":"This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 692692 to P.J.) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award to P.J., V 739-B27 to C.B.M.). We are grateful to F. Marr and C. Altmutter for excellent technical assistance and cell reconstruction, E. Kralli-Beller for manuscript editing, and the Scientific Service Units of IST Austria, especially T. Asenov and Miba machine shop, for maximally efficient support.","date_published":"2021-06-01T00:00:00Z","month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","ec_funded":1,"file":[{"date_created":"2021-07-08T12:27:55Z","access_level":"open_access","checksum":"7eb580abd8893cdb0b410cf41bc8c263","file_size":38574802,"embargo":"2021-12-01","date_updated":"2021-12-02T23:30:05Z","file_id":"9639","creator":"cziletti","file_name":"VandaeletalAuthorVersion2021.pdf","content_type":"application/pdf","relation":"main_file"}],"publication":"Nature Protocols","project":[{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692","call_identifier":"H2020","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse"},{"grant_number":"Z00312","_id":"25C5A090-B435-11E9-9278-68D0E5697425","name":"Synaptic communication in neuronal microcircuits","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Structural plasticity at mossy fiber-CA3 synapses","_id":"2696E7FE-B435-11E9-9278-68D0E5697425","grant_number":"V00739"}],"external_id":{"pmid":["33990799"],"isi":["000650528700003"]},"oa":1,"abstract":[{"text":"Rigorous investigation of synaptic transmission requires analysis of unitary synaptic events by simultaneous recording from presynaptic terminals and postsynaptic target neurons. However, this has been achieved at only a limited number of model synapses, including the squid giant synapse and the mammalian calyx of Held. Cortical presynaptic terminals have been largely inaccessible to direct presynaptic recording, due to their small size. Here, we describe a protocol for improved subcellular patch-clamp recording in rat and mouse brain slices, with the synapse in a largely intact environment. Slice preparation takes ~2 h, recording ~3 h and post hoc morphological analysis 2 d. Single presynaptic hippocampal mossy fiber terminals are stimulated minimally invasively in the bouton-attached configuration, in which the cytoplasmic content remains unperturbed, or in the whole-bouton configuration, in which the cytoplasmic composition can be precisely controlled. Paired pre–postsynaptic recordings can be integrated with biocytin labeling and morphological analysis, allowing correlative investigation of synapse structure and function. Paired recordings can be obtained from mossy fiber terminals in slices from both rats and mice, implying applicability to genetically modified synapses. Paired recordings can also be performed together with axon tract stimulation or optogenetic activation, allowing comparison of unitary and compound synaptic events in the same target cell. Finally, paired recordings can be combined with spontaneous event analysis, permitting collection of miniature events generated at a single identified synapse. In conclusion, the subcellular patch-clamp techniques detailed here should facilitate analysis of biophysics, plasticity and circuit function of cortical synapses in the mammalian central nervous system.","lang":"eng"}],"language":[{"iso":"eng"}],"department":[{"_id":"PeJo"}],"author":[{"first_name":"David H","last_name":"Vandael","full_name":"Vandael, David H","orcid":"0000-0001-7577-1676","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Okamoto, Yuji","orcid":"0000-0003-0408-6094","id":"3337E116-F248-11E8-B48F-1D18A9856A87","last_name":"Okamoto","first_name":"Yuji"},{"id":"4305C450-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0005-401X","full_name":"Borges Merjane, Carolina","first_name":"Carolina","last_name":"Borges Merjane"},{"id":"2F55A9DE-F248-11E8-B48F-1D18A9856A87","full_name":"Vargas Barroso, Victor M","last_name":"Vargas Barroso","first_name":"Victor M"},{"first_name":"Benjamin","last_name":"Suter","full_name":"Suter, Benjamin","orcid":"0000-0002-9885-6936","id":"4952F31E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M"}],"publisher":"Springer Nature","citation":{"chicago":"Vandael, David H, Yuji Okamoto, Carolina Borges Merjane, Victor M Vargas Barroso, Benjamin Suter, and Peter M Jonas. “Subcellular Patch-Clamp Techniques for Single-Bouton Stimulation and Simultaneous Pre- and Postsynaptic Recording at Cortical Synapses.” <i>Nature Protocols</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41596-021-00526-0\">https://doi.org/10.1038/s41596-021-00526-0</a>.","ama":"Vandael DH, Okamoto Y, Borges Merjane C, Vargas Barroso VM, Suter B, Jonas PM. Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses. <i>Nature Protocols</i>. 2021;16(6):2947–2967. doi:<a href=\"https://doi.org/10.1038/s41596-021-00526-0\">10.1038/s41596-021-00526-0</a>","short":"D.H. Vandael, Y. Okamoto, C. Borges Merjane, V.M. Vargas Barroso, B. Suter, P.M. Jonas, Nature Protocols 16 (2021) 2947–2967.","ista":"Vandael DH, Okamoto Y, Borges Merjane C, Vargas Barroso VM, Suter B, Jonas PM. 2021. Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses. Nature Protocols. 16(6), 2947–2967.","mla":"Vandael, David H., et al. “Subcellular Patch-Clamp Techniques for Single-Bouton Stimulation and Simultaneous Pre- and Postsynaptic Recording at Cortical Synapses.” <i>Nature Protocols</i>, vol. 16, no. 6, Springer Nature, 2021, pp. 2947–2967, doi:<a href=\"https://doi.org/10.1038/s41596-021-00526-0\">10.1038/s41596-021-00526-0</a>.","ieee":"D. H. Vandael, Y. Okamoto, C. Borges Merjane, V. M. Vargas Barroso, B. Suter, and P. M. Jonas, “Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses,” <i>Nature Protocols</i>, vol. 16, no. 6. Springer Nature, pp. 2947–2967, 2021.","apa":"Vandael, D. H., Okamoto, Y., Borges Merjane, C., Vargas Barroso, V. M., Suter, B., &#38; Jonas, P. M. (2021). Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses. <i>Nature Protocols</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41596-021-00526-0\">https://doi.org/10.1038/s41596-021-00526-0</a>"},"day":"01","date_created":"2021-05-30T22:01:24Z","status":"public","title":"Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses","volume":16,"date_updated":"2025-04-22T22:30:43Z","oa_version":"Submitted Version","ddc":["570"],"acknowledged_ssus":[{"_id":"M-Shop"}]},{"status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"Regulation of size and scale in vertebrate spinal cord development","date_updated":"2026-09-26T22:30:20Z","oa_version":"Published Version","OA_place":"publisher","ddc":["570"],"oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"AnKi"}],"abstract":[{"text":"All vertebrates have a spinal cord with dimensions and shape specific to their species. Yet how species‐specific organ size and shape are achieved is a fundamental unresolved question in biology. The formation and sculpting of organs begins during embryonic development. As it develops, the spinal cord extends in anterior–posterior direction in synchrony with the overall growth of the body. The dorsoventral (DV) and apicobasal lengths of the spinal cord neuroepithelium also change, while at the same time a characteristic pattern of neural progenitor subtypes along the DV axis is established and elaborated. At the basis of these changes in tissue size and shape are biophysical determinants, such as the change in cell number, cell size and shape, and anisotropic tissue growth. These processes are controlled by global tissue‐scale regulators, such as morphogen signaling gradients as well as mechanical forces. Current challenges in the field are to uncover how these tissue‐scale regulatory mechanisms are translated to the cellular and molecular level, and how regulation of distinct cellular processes gives rise to an overall defined size. Addressing these questions will help not only to achieve a better understanding of how size is controlled, but also of how tissue size is coordinated with the specification of pattern.","lang":"eng"}],"author":[{"id":"4CED352A-F248-11E8-B48F-1D18A9856A87","full_name":"Kuzmicz-Kowalska, Katarzyna","last_name":"Kuzmicz-Kowalska","first_name":"Katarzyna"},{"full_name":"Kicheva, Anna","orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","first_name":"Anna","last_name":"Kicheva"}],"publisher":"Wiley","citation":{"ieee":"K. Kuzmicz-Kowalska and A. Kicheva, “Regulation of size and scale in vertebrate spinal cord development,” <i>Wiley Interdisciplinary Reviews: Developmental Biology</i>. Wiley, 2021.","apa":"Kuzmicz-Kowalska, K., &#38; Kicheva, A. (2021). Regulation of size and scale in vertebrate spinal cord development. <i>Wiley Interdisciplinary Reviews: Developmental Biology</i>. Wiley. <a href=\"https://doi.org/10.1002/wdev.383\">https://doi.org/10.1002/wdev.383</a>","mla":"Kuzmicz-Kowalska, Katarzyna, and Anna Kicheva. “Regulation of Size and Scale in Vertebrate Spinal Cord Development.” <i>Wiley Interdisciplinary Reviews: Developmental Biology</i>, e383, Wiley, 2021, doi:<a href=\"https://doi.org/10.1002/wdev.383\">10.1002/wdev.383</a>.","ista":"Kuzmicz-Kowalska K, Kicheva A. 2021. Regulation of size and scale in vertebrate spinal cord development. Wiley Interdisciplinary Reviews: Developmental Biology., e383.","chicago":"Kuzmicz-Kowalska, Katarzyna, and Anna Kicheva. “Regulation of Size and Scale in Vertebrate Spinal Cord Development.” <i>Wiley Interdisciplinary Reviews: Developmental Biology</i>. Wiley, 2021. <a href=\"https://doi.org/10.1002/wdev.383\">https://doi.org/10.1002/wdev.383</a>.","short":"K. Kuzmicz-Kowalska, A. Kicheva, Wiley Interdisciplinary Reviews: Developmental Biology (2021).","ama":"Kuzmicz-Kowalska K, Kicheva A. Regulation of size and scale in vertebrate spinal cord development. <i>Wiley Interdisciplinary Reviews: Developmental Biology</i>. 2021. doi:<a href=\"https://doi.org/10.1002/wdev.383\">10.1002/wdev.383</a>"},"date_created":"2020-05-24T22:01:00Z","day":"15","year":"2021","ec_funded":1,"file":[{"content_type":"application/pdf","relation":"main_file","file_name":"2020_WIREs_DevBio_KuzmiczKowalska.pdf","creator":"dernst","file_id":"8800","date_updated":"2020-11-24T13:11:39Z","file_size":2527276,"checksum":"f0a7745d48afa09ea7025e876a0145a8","success":1,"date_created":"2020-11-24T13:11:39Z","access_level":"open_access"}],"publication":"Wiley Interdisciplinary Reviews: Developmental Biology","external_id":{"pmid":["32391980"],"isi":["000531419400001"]},"project":[{"grant_number":"680037","_id":"B6FC0238-B512-11E9-945C-1524E6697425","call_identifier":"H2020","name":"Coordination of Patterning And Growth In the Spinal Cord"},{"_id":"267AF0E4-B435-11E9-9278-68D0E5697425","name":"The role of morphogens in the regulation of neural tube growth"},{"_id":"059DF620-7A3F-11EA-A408-12923DDC885E","grant_number":"F7802","name":"Stem Cell Modulation in Neural Development and Regeneration/ P02-Morphogen control of growth and pattern in the spinal cord"}],"date_published":"2021-04-15T00:00:00Z","month":"04","acknowledgement":"Austrian Academy of Sciences, Grant/Award Number: DOC fellowship for Katarzyna Kuzmicz-Kowalska; Austrian Science Fund, Grant/Award Number: F78 (Stem Cell Modulation); H2020 European Research Council, Grant/Award Number: 680037","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1002/wdev.383","type":"journal_article","publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","id":"14323","status":"public"}]},"publication_identifier":{"issn":["1759-7684"],"eissn":["1759-7692"]},"pmid":1,"_id":"7883","OA_type":"hybrid","article_number":"e383","article_processing_charge":"Yes (via OA deal)","quality_controlled":"1","has_accepted_license":"1","file_date_updated":"2020-11-24T13:11:39Z","fulldoi":"https://doi.org/10.1002/wdev.383","article_type":"original","isi":1,"corr_author":"1"},{"publisher":"Springer Nature","citation":{"ista":"Petit YK, Mourad E, Prehal C, Leypold C, Windischbacher A, Mijailovic D, Slugovc C, Borisov SM, Zojer E, Brutti S, Fontaine O, Freunberger SA. 2021. Mechanism of mediated alkali peroxide oxidation and triplet versus singlet oxygen formation. Nature Chemistry. 13(5), 465–471.","mla":"Petit, Yann K., et al. “Mechanism of Mediated Alkali Peroxide Oxidation and Triplet versus Singlet Oxygen Formation.” <i>Nature Chemistry</i>, vol. 13, no. 5, Springer Nature, 2021, pp. 465–71, doi:<a href=\"https://doi.org/10.1038/s41557-021-00643-z\">10.1038/s41557-021-00643-z</a>.","ama":"Petit YK, Mourad E, Prehal C, et al. Mechanism of mediated alkali peroxide oxidation and triplet versus singlet oxygen formation. <i>Nature Chemistry</i>. 2021;13(5):465-471. doi:<a href=\"https://doi.org/10.1038/s41557-021-00643-z\">10.1038/s41557-021-00643-z</a>","chicago":"Petit, Yann K., Eléonore Mourad, Christian Prehal, Christian Leypold, Andreas Windischbacher, Daniel Mijailovic, Christian Slugovc, et al. “Mechanism of Mediated Alkali Peroxide Oxidation and Triplet versus Singlet Oxygen Formation.” <i>Nature Chemistry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41557-021-00643-z\">https://doi.org/10.1038/s41557-021-00643-z</a>.","short":"Y.K. Petit, E. Mourad, C. Prehal, C. Leypold, A. Windischbacher, D. Mijailovic, C. Slugovc, S.M. Borisov, E. Zojer, S. Brutti, O. Fontaine, S.A. Freunberger, Nature Chemistry 13 (2021) 465–471.","apa":"Petit, Y. K., Mourad, E., Prehal, C., Leypold, C., Windischbacher, A., Mijailovic, D., … Freunberger, S. A. (2021). Mechanism of mediated alkali peroxide oxidation and triplet versus singlet oxygen formation. <i>Nature Chemistry</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41557-021-00643-z\">https://doi.org/10.1038/s41557-021-00643-z</a>","ieee":"Y. K. Petit <i>et al.</i>, “Mechanism of mediated alkali peroxide oxidation and triplet versus singlet oxygen formation,” <i>Nature Chemistry</i>, vol. 13, no. 5. Springer Nature, pp. 465–471, 2021."},"author":[{"last_name":"Petit","first_name":"Yann K.","full_name":"Petit, Yann K."},{"full_name":"Mourad, Eléonore","last_name":"Mourad","first_name":"Eléonore"},{"last_name":"Prehal","first_name":"Christian","full_name":"Prehal, Christian"},{"full_name":"Leypold, Christian","first_name":"Christian","last_name":"Leypold"},{"full_name":"Windischbacher, Andreas","first_name":"Andreas","last_name":"Windischbacher"},{"last_name":"Mijailovic","first_name":"Daniel","full_name":"Mijailovic, Daniel"},{"full_name":"Slugovc, Christian","first_name":"Christian","last_name":"Slugovc"},{"first_name":"Sergey M.","last_name":"Borisov","full_name":"Borisov, Sergey M."},{"first_name":"Egbert","last_name":"Zojer","full_name":"Zojer, Egbert"},{"last_name":"Brutti","first_name":"Sergio","full_name":"Brutti, Sergio"},{"last_name":"Fontaine","first_name":"Olivier","full_name":"Fontaine, Olivier"},{"first_name":"Stefan Alexander","last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425"}],"day":"15","date_created":"2021-03-16T11:12:20Z","oa":1,"abstract":[{"lang":"eng","text":"Aprotic alkali metal–O2 batteries face two major obstacles to their chemistry occurring efficiently, the insulating nature of the formed alkali superoxides/peroxides and parasitic reactions that are caused by the highly reactive singlet oxygen (1O2). Redox mediators are recognized to be key for improving rechargeability. However, it is unclear how they affect 1O2 formation, which hinders strategies for their improvement. Here we clarify the mechanism of mediated peroxide and superoxide oxidation and thus explain how redox mediators either enhance or suppress 1O2 formation. We show that charging commences with peroxide oxidation to a superoxide intermediate and that redox potentials above ~3.5 V versus Li/Li+ drive 1O2 evolution from superoxide oxidation, while disproportionation always generates some 1O2. We find that 1O2 suppression requires oxidation to be faster than the generation of 1O2 from disproportionation. Oxidation rates decrease with growing driving force following Marcus inverted-region behaviour, establishing a region of maximum rate."}],"department":[{"_id":"StFr"}],"language":[{"iso":"eng"}],"oa_version":"Submitted Version","ddc":["540"],"acknowledged_ssus":[{"_id":"M-Shop"}],"title":"Mechanism of mediated alkali peroxide oxidation and triplet versus singlet oxygen formation","status":"public","date_updated":"2024-10-09T21:00:28Z","volume":13,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"465-471","keyword":["General Chemistry","General Chemical Engineering"],"scopus_import":"1","acknowledgement":"S.A.F. is indebted to the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 636069) as well as IST Austria. O.F thanks the French National Research Agency (STORE-EX Labex Project ANR-10-LABX-76-01). We thank EL-Cell GmbH (Hamburg, Germany) for the pressure test cell. We thank R. Saf for help with the mass spectrometry, J. Schlegl for manufacturing instrumentation, M. Winkler of Acib GmbH, G. Strohmeier and R. Fürst for HPLC measurements and S. Mondal and S. Stadlbauer for kinetic measurements.","date_published":"2021-03-15T00:00:00Z","month":"03","publication":"Nature Chemistry","file":[{"content_type":"application/pdf","relation":"main_file","file_name":"2021_NatureChem_Petit_acceptedVersion.pdf","creator":"dernst","file_id":"9276","date_updated":"2021-09-16T22:30:03Z","embargo":"2021-09-15","file_size":1811448,"checksum":"3ee3f8dd79ed1b7bb0929fce184c8012","date_created":"2021-03-22T11:46:00Z","access_level":"open_access"}],"external_id":{"isi":["000629296400001"],"pmid":["33723377"]},"year":"2021","_id":"9250","issue":"5","intvolume":"        13","publication_identifier":{"issn":["1755-4330"],"eissn":["1755-4349"]},"pmid":1,"publication_status":"published","doi":"10.1038/s41557-021-00643-z","type":"journal_article","corr_author":"1","isi":1,"article_type":"original","fulldoi":"https://doi.org/10.1038/s41557-021-00643-z","has_accepted_license":"1","quality_controlled":"1","file_date_updated":"2021-09-16T22:30:03Z","article_processing_charge":"No"},{"date_published":"2021-06-01T00:00:00Z","month":"06","arxiv":1,"acknowledgement":"We thank our collaborators K. Bull, S. Choi, J.-Y. Desaules, W. W. Ho, A. Hudomal, M. Lukin, I. Martin, H. Pichler, N. Regnault, I. Vasić and in particular A. Michailidis and C. Turner, without whom this work would not have been possible. We also benefited from discussions with E. Altman, B. A. Bernevig, A. Chandran, P. Fendley, V. Khemani and L. Motrunich. M.S. was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 850899). D.A.A. was supported by the Swiss National Science Foundation and by the ERC under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 864597). Z.P. acknowledges support by the Leverhulme Trust Research Leadership Award RL-2019-015.","scopus_import":"1","page":"675–685","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"year":"2021","project":[{"_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","grant_number":"850899","call_identifier":"H2020","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control"}],"external_id":{"isi":["000655563800002"],"arxiv":["2011.09486"]},"publication":"Nature Physics","file":[{"checksum":"316ed42ea1b42b0f1a3025bb476266fc","date_created":"2021-09-20T09:27:43Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"RevisedQMBSreview.pdf","file_id":"10026","creator":"patrickd","embargo":"2021-12-01","file_size":10028836,"date_updated":"2021-12-02T23:30:03Z"}],"department":[{"_id":"MaSe"}],"language":[{"iso":"eng"}],"abstract":[{"text":"Thermalization is the inevitable fate of many complex quantum systems, whose dynamics allow them to fully explore the vast configuration space regardless of the initial state---the behaviour known as quantum ergodicity. In a quest for experimental realizations of coherent long-time dynamics, efforts have focused on ergodicity-breaking mechanisms, such as integrability and localization. The recent discovery of persistent revivals in quantum simulators based on Rydberg atoms have pointed to the existence of a new type of behaviour where the system rapidly relaxes for most initial conditions, while certain initial states give rise to non-ergodic dynamics. This collective effect has been named ”quantum many-body scarring’by analogy with a related form of weak ergodicity breaking that occurs for a single particle inside a stadium billiard potential. In this Review, we provide a pedagogical introduction to quantum many-body scars and highlight the emerging connections with the semiclassical quantization of many-body systems. We discuss the relation between scars and more general routes towards weak violations of ergodicity due to embedded algebras and non-thermal eigenstates, and highlight possible applications of scars in quantum technology.","lang":"eng"}],"oa":1,"date_created":"2021-05-28T09:03:50Z","day":"01","publisher":"Nature Research","citation":{"apa":"Serbyn, M., Abanin, D. A., &#38; Papić, Z. (2021). Quantum many-body scars and weak breaking of ergodicity. <i>Nature Physics</i>. Nature Research. <a href=\"https://doi.org/10.1038/s41567-021-01230-2\">https://doi.org/10.1038/s41567-021-01230-2</a>","ieee":"M. Serbyn, D. A. Abanin, and Z. Papić, “Quantum many-body scars and weak breaking of ergodicity,” <i>Nature Physics</i>, vol. 17, no. 6. Nature Research, pp. 675–685, 2021.","chicago":"Serbyn, Maksym, Dmitry A. Abanin, and Zlatko Papić. “Quantum Many-Body Scars and Weak Breaking of Ergodicity.” <i>Nature Physics</i>. Nature Research, 2021. <a href=\"https://doi.org/10.1038/s41567-021-01230-2\">https://doi.org/10.1038/s41567-021-01230-2</a>.","short":"M. Serbyn, D.A. Abanin, Z. Papić, Nature Physics 17 (2021) 675–685.","ama":"Serbyn M, Abanin DA, Papić Z. Quantum many-body scars and weak breaking of ergodicity. <i>Nature Physics</i>. 2021;17(6):675–685. doi:<a href=\"https://doi.org/10.1038/s41567-021-01230-2\">10.1038/s41567-021-01230-2</a>","ista":"Serbyn M, Abanin DA, Papić Z. 2021. Quantum many-body scars and weak breaking of ergodicity. Nature Physics. 17(6), 675–685.","mla":"Serbyn, Maksym, et al. “Quantum Many-Body Scars and Weak Breaking of Ergodicity.” <i>Nature Physics</i>, vol. 17, no. 6, Nature Research, 2021, pp. 675–685, doi:<a href=\"https://doi.org/10.1038/s41567-021-01230-2\">10.1038/s41567-021-01230-2</a>."},"author":[{"orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","full_name":"Serbyn, Maksym","first_name":"Maksym","last_name":"Serbyn"},{"first_name":"Dmitry A.","last_name":"Abanin","full_name":"Abanin, Dmitry A."},{"full_name":"Papić, Zlatko","last_name":"Papić","first_name":"Zlatko"}],"volume":17,"date_updated":"2025-04-14T07:52:09Z","status":"public","title":"Quantum many-body scars and weak breaking of ergodicity","ddc":["539"],"oa_version":"Preprint","fulldoi":"https://doi.org/10.1038/s41567-021-01230-2","article_type":"review","isi":1,"article_processing_charge":"No","file_date_updated":"2021-12-02T23:30:03Z","quality_controlled":"1","has_accepted_license":"1","publication_identifier":{"eissn":["1745-2481"]},"intvolume":"        17","issue":"6","_id":"9428","type":"journal_article","doi":"10.1038/s41567-021-01230-2","publication_status":"published"},{"_id":"9397","publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","alternative_title":["ISTA Thesis"],"doi":"10.15479/at:ista:9397","type":"dissertation","corr_author":"1","fulldoi":"https://doi.org/10.15479/at:ista:9397","has_accepted_license":"1","file_date_updated":"2022-05-21T22:30:04Z","article_processing_charge":"No","citation":{"apa":"Huljev, K. (2021). <i>Coordinated spatiotemporal reorganization of interstitial fluid is required for axial mesendoderm migration in zebrafish gastrulation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:9397\">https://doi.org/10.15479/at:ista:9397</a>","ieee":"K. Huljev, “Coordinated spatiotemporal reorganization of interstitial fluid is required for axial mesendoderm migration in zebrafish gastrulation,” Institute of Science and Technology Austria, 2021.","mla":"Huljev, Karla. <i>Coordinated Spatiotemporal Reorganization of Interstitial Fluid Is Required for Axial Mesendoderm Migration in Zebrafish Gastrulation</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:9397\">10.15479/at:ista:9397</a>.","ista":"Huljev K. 2021. Coordinated spatiotemporal reorganization of interstitial fluid is required for axial mesendoderm migration in zebrafish gastrulation. Institute of Science and Technology Austria.","ama":"Huljev K. Coordinated spatiotemporal reorganization of interstitial fluid is required for axial mesendoderm migration in zebrafish gastrulation. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:9397\">10.15479/at:ista:9397</a>","chicago":"Huljev, Karla. “Coordinated Spatiotemporal Reorganization of Interstitial Fluid Is Required for Axial Mesendoderm Migration in Zebrafish Gastrulation.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:9397\">https://doi.org/10.15479/at:ista:9397</a>.","short":"K. Huljev, Coordinated Spatiotemporal Reorganization of Interstitial Fluid Is Required for Axial Mesendoderm Migration in Zebrafish Gastrulation, Institute of Science and Technology Austria, 2021."},"author":[{"full_name":"Huljev, Karla","id":"44C6F6A6-F248-11E8-B48F-1D18A9856A87","first_name":"Karla","last_name":"Huljev"}],"publisher":"Institute of Science and Technology Austria","date_created":"2021-05-17T12:31:30Z","day":"18","oa":1,"department":[{"_id":"CaHe"},{"_id":"GradSch"}],"language":[{"iso":"eng"}],"abstract":[{"text":"Accumulation of interstitial fluid (IF) between embryonic cells is a common phenomenon in vertebrate embryogenesis. Unlike other model systems, where these accumulations coalesce into a large central cavity – the blastocoel, in zebrafish, IF is more uniformly distributed between the deep cells (DC) before the onset of gastrulation. This is likely due to the presence of a large extraembryonic structure – the yolk cell (YC) at the position where the blastocoel typically forms in other model organisms. IF has long been speculated to play a role in tissue morphogenesis during embryogenesis, but direct evidence supporting such function is still sparse. Here we show that the relocalization of IF to the interface between the YC and DC/epiblast is critical for axial mesendoderm (ME) cell protrusion formation and migration along this interface, a key process in embryonic axis formation. We further demonstrate that axial ME cell migration and IF relocalization engage in a positive feedback loop, where axial ME migration triggers IF accumulation ahead of the advancing axial ME tissue by mechanically compressing the overlying epiblast cell layer. Upon compression, locally induced flow relocalizes the IF through the porous epiblast tissue resulting in an IF accumulation ahead of the leading axial ME. This IF accumulation, in turn, promotes cell protrusion formation and migration of the leading axial ME cells, thereby facilitating axial ME extension. Our findings reveal a central role of dynamic IF relocalization in orchestrating germ layer morphogenesis during gastrulation.","lang":"eng"}],"degree_awarded":"PhD","oa_version":"Published Version","ddc":["571"],"OA_place":"publisher","title":"Coordinated spatiotemporal reorganization of interstitial fluid is required for axial mesendoderm migration in zebrafish gastrulation","status":"public","date_updated":"2026-04-08T07:12:51Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"101","date_published":"2021-05-18T00:00:00Z","month":"05","supervisor":[{"full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","last_name":"Heisenberg"}],"file":[{"relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_name":"KHuljev_Thesis_corrections.docx","creator":"khuljev","file_id":"9398","file_size":47799741,"date_updated":"2022-05-21T22:30:04Z","checksum":"7f98532f5324a0b2f3fa8de2967baa19","access_level":"closed","date_created":"2021-05-17T12:29:12Z","embargo_to":"open_access"},{"file_size":16542131,"date_updated":"2022-05-21T22:30:04Z","embargo":"2022-05-20","creator":"khuljev","file_id":"9401","file_name":"new_KHuljev_Thesis_corrections.pdf","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_created":"2021-05-18T14:50:28Z","checksum":"bf512f8a1e572a543778fc4b227c01ba"}],"year":"2021"}]