[{"alternative_title":["EPiC Series in Computing"],"scopus_import":"1","intvolume":" 57","month":"10","abstract":[{"text":"Solving parity games, which are equivalent to modal μ-calculus model checking, is a central algorithmic problem in formal methods, with applications in reactive synthesis, program repair, verification of branching-time properties, etc. Besides the standard compu- tation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with n vertices and parity conditions with d priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations and O(n) symbolic space. In this work, our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and O(n) symbolic space; and (b) any future improvement in progress measure based explicit algorithms immediately imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and O(d · log n) symbolic space. Moreover, for the important special case of d ≤ log n, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space.","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"volume":57,"publication_status":"published","publication_identifier":{"issn":["2398-7340"]},"language":[{"iso":"eng"}],"file":[{"success":1,"checksum":"1229aa8640bd6db610c85decf2265480","file_id":"11392","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2018_EPiCs_Chatterjee.pdf","date_created":"2022-05-17T07:51:08Z","creator":"dernst","file_size":720893,"date_updated":"2022-05-17T07:51:08Z"}],"conference":{"start_date":"2018-11-17","end_date":"2018-11-21","location":"Awassa, Ethiopia","name":"LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning"},"type":"conference","status":"public","_id":"10883","file_date_updated":"2022-05-17T07:51:08Z","department":[{"_id":"KrCh"}],"date_updated":"2022-07-29T09:24:31Z","ddc":["000"],"oa":1,"publisher":"EasyChair","quality_controlled":"1","acknowledgement":"A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph Games). For M.H the research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) /ERC Grant Agreement no. 340506.","page":"233-253","date_created":"2022-03-18T12:46:32Z","doi":"10.29007/5z5k","date_published":"2018-10-23T00:00:00Z","year":"2018","has_accepted_license":"1","publication":"22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning","day":"23","project":[{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"external_id":{"arxiv":["1909.04983"]},"article_processing_charge":"No","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Wolfgang","last_name":"Dvořák","full_name":"Dvořák, Wolfgang"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Svozil","full_name":"Svozil, Alexander","first_name":"Alexander"}],"title":"Quasipolynomial set-based symbolic algorithms for parity games","citation":{"mla":"Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53, doi:10.29007/5z5k.","short":"K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, in:, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair, 2018, pp. 233–253.","ieee":"K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253.","apa":"Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k","ama":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Quasipolynomial set-based symbolic algorithms for parity games. In: 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Vol 57. EasyChair; 2018:233-253. doi:10.29007/5z5k","chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k.","ista":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2018. Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253."},"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Leopold NK, Pickl P. Mean-field limits of particles in interaction with quantised radiation fields. In: Vol 270. Springer; 2018:185-214. doi:10.1007/978-3-030-01602-9_9","apa":"Leopold, N. K., & Pickl, P. (2018). Mean-field limits of particles in interaction with quantised radiation fields (Vol. 270, pp. 185–214). Presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany: Springer. https://doi.org/10.1007/978-3-030-01602-9_9","short":"N.K. Leopold, P. Pickl, in:, Springer, 2018, pp. 185–214.","ieee":"N. K. Leopold and P. Pickl, “Mean-field limits of particles in interaction with quantised radiation fields,” presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany, 2018, vol. 270, pp. 185–214.","mla":"Leopold, Nikolai K., and Peter Pickl. Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields. Vol. 270, Springer, 2018, pp. 185–214, doi:10.1007/978-3-030-01602-9_9.","ista":"Leopold NK, Pickl P. 2018. Mean-field limits of particles in interaction with quantised radiation fields. MaLiQS: Macroscopic Limits of Quantum Systems vol. 270, 185–214.","chicago":"Leopold, Nikolai K, and Peter Pickl. “Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields,” 270:185–214. Springer, 2018. https://doi.org/10.1007/978-3-030-01602-9_9."},"title":"Mean-field limits of particles in interaction with quantised radiation fields","external_id":{"arxiv":["1806.10843"]},"publist_id":"8045","author":[{"last_name":"Leopold","full_name":"Leopold, Nikolai K","orcid":"0000-0002-0495-6822","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","first_name":"Nikolai K"},{"last_name":"Pickl","full_name":"Pickl, Peter","first_name":"Peter"}],"project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"694227","name":"Analysis of quantum many-body systems"}],"day":"27","year":"2018","date_created":"2018-12-11T11:44:08Z","date_published":"2018-10-27T00:00:00Z","doi":"10.1007/978-3-030-01602-9_9","page":"185 - 214","oa":1,"publisher":"Springer","quality_controlled":"1","date_updated":"2021-01-12T06:48:16Z","department":[{"_id":"RoSe"}],"_id":"11","status":"public","conference":{"start_date":"2017-03-30","location":"Munich, Germany","end_date":"2017-04-01","name":"MaLiQS: Macroscopic Limits of Quantum Systems"},"type":"conference","language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"volume":270,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We report on a novel strategy to derive mean-field limits of quantum mechanical systems in which a large number of particles weakly couple to a second-quantized radiation field. The technique combines the method of counting and the coherent state approach to study the growth of the correlations among the particles and in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon system of equations from the Nelson model with ultraviolet cutoff and possibly massless scalar field. In particular, we prove the convergence of the reduced density matrices (of the nonrelativistic particles and the field bosons) associated with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon equations in trace norm. Furthermore, we derive explicit bounds on the rate of convergence of the one-particle reduced density matrix of the nonrelativistic particles in Sobolev norm."}],"intvolume":" 270","month":"10","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.10843"}],"scopus_import":1},{"publication_status":"published","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5266","checksum":"47686d58ec21c164540f1a980ff2163f","creator":"system","date_updated":"2020-07-14T12:44:39Z","file_size":671125,"date_created":"2018-12-12T10:17:13Z","file_name":"IST-2016-712-v1+1_s10959-016-0724-2.pdf"}],"license":"https://creativecommons.org/licenses/by/4.0/","issue":"2","volume":31,"abstract":[{"text":"Two generalizations of Itô formula to infinite-dimensional spaces are given.\r\nThe first one, in Hilbert spaces, extends the classical one by taking advantage of\r\ncancellations when they occur in examples and it is applied to the case of a group\r\ngenerator. The second one, based on the previous one and a limit procedure, is an Itô\r\nformula in a special class of Banach spaces having a product structure with the noise\r\nin a Hilbert component; again the key point is the extension due to a cancellation. This\r\nextension to Banach spaces and in particular the specific cancellation are motivated\r\nby path-dependent Itô calculus.","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"intvolume":" 31","month":"06","date_updated":"2021-01-12T06:49:09Z","ddc":["519"],"file_date_updated":"2020-07-14T12:44:39Z","department":[{"_id":"JaMa"}],"_id":"1215","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","pubrep_id":"712","status":"public","year":"2018","has_accepted_license":"1","publication":"Journal of Theoretical Probability","day":"01","page":"789-826","date_created":"2018-12-11T11:50:45Z","doi":"10.1007/s10959-016-0724-2","date_published":"2018-06-01T00:00:00Z","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The second named author benefited partially from the support of the “FMJH Program Gaspard Monge in Optimization and Operations Research” (Project 2014-1607H). He is also grateful for the invitation to the Department of Mathematics of the University of Pisa. The third named author is grateful for the invitation to ENSTA.","oa":1,"publisher":"Springer","quality_controlled":"1","citation":{"short":"F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826.","ieee":"F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under weak spatial regularity of the processes,” Journal of Theoretical Probability, vol. 31, no. 2. Springer, pp. 789–826, 2018.","apa":"Flandoli, F., Russo, F., & Zanco, G. A. (2018). Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. Springer. https://doi.org/10.1007/s10959-016-0724-2","ama":"Flandoli F, Russo F, Zanco GA. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 2018;31(2):789-826. doi:10.1007/s10959-016-0724-2","mla":"Flandoli, Franco, et al. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability, vol. 31, no. 2, Springer, 2018, pp. 789–826, doi:10.1007/s10959-016-0724-2.","ista":"Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 31(2), 789–826.","chicago":"Flandoli, Franco, Francesco Russo, and Giovanni A Zanco. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability. Springer, 2018. https://doi.org/10.1007/s10959-016-0724-2."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes (via OA deal)","author":[{"first_name":"Franco","last_name":"Flandoli","full_name":"Flandoli, Franco"},{"last_name":"Russo","full_name":"Russo, Francesco","first_name":"Francesco"},{"first_name":"Giovanni A","id":"47491882-F248-11E8-B48F-1D18A9856A87","full_name":"Zanco, Giovanni A","last_name":"Zanco"}],"publist_id":"6119","title":"Infinite-dimensional calculus under weak spatial regularity of the processes","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}]},{"status":"public","type":"conference","conference":{"name":"SoCG: Symposium on Computational Geometry","location":"Budapest, Hungary","end_date":"2018-06-14","start_date":"2018-06-11"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"185","department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:45:19Z","ddc":["510"],"date_updated":"2021-01-12T06:53:36Z","month":"01","intvolume":" 99","alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing whether a given piecewise linear map of a graph in a surface is approximable by an embedding. More precisely, an instance of this problem consists of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact surface M given as the union of a set of pairwise disjoint discs corresponding to the clusters and a set of pairwise disjoint "pipes" corresponding to the bundles, connecting certain pairs of these discs. We are to decide whether G can be embedded inside M so that the vertices in every cluster are drawn in the corresponding disc, the edges in every bundle pass only through its corresponding pipe, and every edge crosses the boundary of each disc at most once."}],"volume":99,"file":[{"creator":"dernst","date_updated":"2020-07-14T12:45:19Z","file_size":718857,"date_created":"2018-12-17T12:33:52Z","file_name":"2018_LIPIcs_Fulek.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"f1b94f1a75b37c414a1f61d59fb2cd4c","file_id":"5701"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-95977-066-8"]},"publication_status":"published","project":[{"call_identifier":"FWF","_id":"261FA626-B435-11E9-9278-68D0E5697425","name":"Eliminating intersections in drawings of graphs","grant_number":"M02281"}],"article_number":"39","title":"Hanani-Tutte for approximating maps of graphs","publist_id":"7735","author":[{"first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774"},{"first_name":"Jan","last_name":"Kynčl","full_name":"Kynčl, Jan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Fulek, Radoslav, and Jan Kynčl. Hanani-Tutte for Approximating Maps of Graphs. Vol. 99, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.39.","apa":"Fulek, R., & Kynčl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.39","ama":"Fulek R, Kynčl J. Hanani-Tutte for approximating maps of graphs. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.39","ieee":"R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.","short":"R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","chicago":"Fulek, Radoslav, and Jan Kynčl. “Hanani-Tutte for Approximating Maps of Graphs,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.39.","ista":"Fulek R, Kynčl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 39."},"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"doi":"10.4230/LIPIcs.SoCG.2018.39","date_published":"2018-01-01T00:00:00Z","date_created":"2018-12-11T11:45:04Z","day":"01","has_accepted_license":"1","year":"2018"},{"department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:45:20Z","date_updated":"2021-01-12T06:53:48Z","ddc":["000"],"type":"conference","conference":{"start_date":"2018-06-11","location":"Budapest, Hungary","end_date":"2018-06-14","name":"SoCG: Symposium on Computational Geometry"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"188","volume":99,"publication_status":"published","file":[{"file_name":"2018_LIPIcs_Edelsbrunner.pdf","date_created":"2018-12-17T16:31:31Z","creator":"dernst","file_size":489080,"date_updated":"2020-07-14T12:45:20Z","file_id":"5724","checksum":"7509403803b3ac1aee94bbc2ad293d21","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"scopus_import":1,"month":"06","intvolume":" 99","abstract":[{"lang":"eng","text":"Smallest enclosing spheres of finite point sets are central to methods in topological data analysis. Focusing on Bregman divergences to measure dissimilarity, we prove bounds on the location of the center of a smallest enclosing sphere. These bounds depend on the range of radii for which Bregman balls are convex."}],"oa_version":"Published Version","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Virk","full_name":"Virk, Ziga","first_name":"Ziga"},{"last_name":"Wagner","full_name":"Wagner, Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert"}],"publist_id":"7733","title":"Smallest enclosing spheres and Chernoff points in Bregman geometry","citation":{"ama":"Edelsbrunner H, Virk Z, Wagner H. Smallest enclosing spheres and Chernoff points in Bregman geometry. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:35:1-35:13. doi:10.4230/LIPIcs.SoCG.2018.35","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2018). Smallest enclosing spheres and Chernoff points in Bregman geometry (Vol. 99, p. 35:1-35:13). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.35","short":"H. Edelsbrunner, Z. Virk, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13.","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Smallest enclosing spheres and Chernoff points in Bregman geometry,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 35:1-35:13.","mla":"Edelsbrunner, Herbert, et al. Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13, doi:10.4230/LIPIcs.SoCG.2018.35.","ista":"Edelsbrunner H, Virk Z, Wagner H. 2018. Smallest enclosing spheres and Chernoff points in Bregman geometry. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 35:1-35:13.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry,” 99:35:1-35:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.35."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}],"page":"35:1 - 35:13","doi":"10.4230/LIPIcs.SoCG.2018.35","date_published":"2018-06-11T00:00:00Z","date_created":"2018-12-11T11:45:05Z","has_accepted_license":"1","year":"2018","day":"11","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"acknowledgement":"This research is partially supported by the Office of Naval Research, through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund"},{"quality_controlled":"1","publisher":"Elsevier","oa":1,"date_published":"2018-04-01T00:00:00Z","doi":"10.1016/j.heliyon.2018.e00596","date_created":"2018-12-11T11:45:44Z","day":"01","publication":"Heliyon","has_accepted_license":"1","year":"2018","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"article_number":"e00596","title":"An introduction to the maximum entropy approach and its application to inference problems in biology","author":[{"first_name":"Andrea","last_name":"De Martino","full_name":"De Martino, Andrea"},{"orcid":"0000-0002-5214-4706","full_name":"De Martino, Daniele","last_name":"De Martino","first_name":"Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"De Martino A, De Martino D. 2018. An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. 4(4), e00596.","chicago":"De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon. Elsevier, 2018. https://doi.org/10.1016/j.heliyon.2018.e00596.","short":"A. De Martino, D. De Martino, Heliyon 4 (2018).","ieee":"A. De Martino and D. De Martino, “An introduction to the maximum entropy approach and its application to inference problems in biology,” Heliyon, vol. 4, no. 4. Elsevier, 2018.","apa":"De Martino, A., & De Martino, D. (2018). An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. Elsevier. https://doi.org/10.1016/j.heliyon.2018.e00596","ama":"De Martino A, De Martino D. An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. 2018;4(4). doi:10.1016/j.heliyon.2018.e00596","mla":"De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon, vol. 4, no. 4, e00596, Elsevier, 2018, doi:10.1016/j.heliyon.2018.e00596."},"month":"04","intvolume":" 4","scopus_import":1,"oa_version":"Published Version","abstract":[{"text":"A cornerstone of statistical inference, the maximum entropy framework is being increasingly applied to construct descriptive and predictive models of biological systems, especially complex biological networks, from large experimental data sets. Both its broad applicability and the success it obtained in different contexts hinge upon its conceptual simplicity and mathematical soundness. Here we try to concisely review the basic elements of the maximum entropy principle, starting from the notion of ‘entropy’, and describe its usefulness for the analysis of biological systems. As examples, we focus specifically on the problem of reconstructing gene interaction networks from expression data and on recent work attempting to expand our system-level understanding of bacterial metabolism. Finally, we highlight some extensions and potential limitations of the maximum entropy approach, and point to more recent developments that are likely to play a key role in the upcoming challenges of extracting structures and information from increasingly rich, high-throughput biological data.","lang":"eng"}],"volume":4,"issue":"4","ec_funded":1,"file":[{"file_name":"2018_Heliyon_DeMartino.pdf","date_created":"2019-02-06T07:36:24Z","creator":"dernst","file_size":994490,"date_updated":"2020-07-14T12:45:59Z","file_id":"5929","checksum":"67010cf5e3b3e0637c659371714a715a","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"306","file_date_updated":"2020-07-14T12:45:59Z","department":[{"_id":"GaTk"}],"ddc":["530"],"date_updated":"2021-01-12T07:40:46Z"},{"_id":"3300","status":"public","type":"book","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Clarke EM, Henzinger TA, Veith H, Bloem R. 2018. Handbook of Model Checking 1st ed., Cham: Springer Nature, XLVIII, 1212p.","chicago":"Clarke, Edmund M., Thomas A Henzinger, Helmut Veith, and Roderick Bloem. Handbook of Model Checking. 1st ed. Cham: Springer Nature, 2018. https://doi.org/10.1007/978-3-319-10575-8.","ama":"Clarke EM, Henzinger TA, Veith H, Bloem R. Handbook of Model Checking. 1st ed. Cham: Springer Nature; 2018. doi:10.1007/978-3-319-10575-8","apa":"Clarke, E. M., Henzinger, T. A., Veith, H., & Bloem, R. (2018). Handbook of Model Checking (1st ed.). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-10575-8","ieee":"E. M. Clarke, T. A. Henzinger, H. Veith, and R. Bloem, Handbook of Model Checking, 1st ed. Cham: Springer Nature, 2018.","short":"E.M. Clarke, T.A. Henzinger, H. Veith, R. Bloem, Handbook of Model Checking, 1st ed., Springer Nature, Cham, 2018.","mla":"Clarke, Edmund M., et al. Handbook of Model Checking. 1st ed., Springer Nature, 2018, doi:10.1007/978-3-319-10575-8."},"date_updated":"2021-12-21T10:49:36Z","title":"Handbook of Model Checking","department":[{"_id":"ToHe"}],"article_processing_charge":"No","author":[{"last_name":"Clarke","full_name":"Clarke, Edmund M.","first_name":"Edmund M."},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Helmut","last_name":"Veith","full_name":"Veith, Helmut"},{"first_name":"Roderick","full_name":"Bloem, Roderick","last_name":"Bloem"}],"publist_id":"3340","oa_version":"None","abstract":[{"lang":"eng","text":"This book first explores the origins of this idea, grounded in theoretical work on temporal logic and automata. The editors and authors are among the world's leading researchers in this domain, and they contributed 32 chapters representing a thorough view of the development and application of the technique. Topics covered include binary decision diagrams, symbolic model checking, satisfiability modulo theories, partial-order reduction, abstraction, interpolation, concurrency, security protocols, games, probabilistic model checking, and process algebra, and chapters on the transfer of theory to industrial practice, property specification languages for hardware, and verification of real-time systems and hybrid systems.\r\n\r\nThe book will be valuable for researchers and graduate students engaged with the development of formal methods and verification tools."}],"month":"06","place":"Cham","edition":"1","publisher":"Springer Nature","quality_controlled":"1","scopus_import":"1","language":[{"iso":"eng"}],"day":"08","publication_status":"published","year":"2018","publication_identifier":{"isbn":["978-3-319-10574-1"],"eisbn":["978-3-319-10575-8"]},"date_created":"2018-12-11T12:02:32Z","doi":"10.1007/978-3-319-10575-8","date_published":"2018-06-08T00:00:00Z","page":"XLVIII, 1212"},{"quality_controlled":"1","publisher":"Springer Nature","oa":1,"has_accepted_license":"1","year":"2018","day":"16","publication":"Morphogen Gradients ","page":"47 - 63","date_published":"2018-10-16T00:00:00Z","doi":"10.1007/978-1-4939-8772-6_4","date_created":"2018-12-11T11:44:17Z","project":[{"_id":"B6FC0238-B512-11E9-945C-1524E6697425","call_identifier":"H2020","grant_number":"680037","name":"Coordination of Patterning And Growth In the Spinal Cord"}],"citation":{"ista":"Zagórski MP, Kicheva A. 2018.Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In: Morphogen Gradients . Methods in Molecular Biology, vol. 1863, 47–63.","chicago":"Zagórski, Marcin P, and Anna Kicheva. “Measuring Dorsoventral Pattern and Morphogen Signaling Profiles in the Growing Neural Tube.” In Morphogen Gradients , 1863:47–63. MIMB. Springer Nature, 2018. https://doi.org/10.1007/978-1-4939-8772-6_4.","ama":"Zagórski MP, Kicheva A. Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In: Morphogen Gradients . Vol 1863. MIMB. Springer Nature; 2018:47-63. doi:10.1007/978-1-4939-8772-6_4","apa":"Zagórski, M. P., & Kicheva, A. (2018). Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In Morphogen Gradients (Vol. 1863, pp. 47–63). Springer Nature. https://doi.org/10.1007/978-1-4939-8772-6_4","ieee":"M. P. Zagórski and A. Kicheva, “Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube,” in Morphogen Gradients , vol. 1863, Springer Nature, 2018, pp. 47–63.","short":"M.P. Zagórski, A. Kicheva, in:, Morphogen Gradients , Springer Nature, 2018, pp. 47–63.","mla":"Zagórski, Marcin P., and Anna Kicheva. “Measuring Dorsoventral Pattern and Morphogen Signaling Profiles in the Growing Neural Tube.” Morphogen Gradients , vol. 1863, Springer Nature, 2018, pp. 47–63, doi:10.1007/978-1-4939-8772-6_4."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"8018","author":[{"id":"343DA0DC-F248-11E8-B48F-1D18A9856A87","first_name":"Marcin P","orcid":"0000-0001-7896-7762","full_name":"Zagórski, Marcin P","last_name":"Zagórski"},{"first_name":"Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","full_name":"Kicheva, Anna","orcid":"0000-0003-4509-4998","last_name":"Kicheva"}],"article_processing_charge":"No","title":"Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube","abstract":[{"text":"Developmental processes are inherently dynamic and understanding them requires quantitative measurements of gene and protein expression levels in space and time. While live imaging is a powerful approach for obtaining such data, it is still a challenge to apply it over long periods of time to large tissues, such as the embryonic spinal cord in mouse and chick. Nevertheless, dynamics of gene expression and signaling activity patterns in this organ can be studied by collecting tissue sections at different developmental stages. In combination with immunohistochemistry, this allows for measuring the levels of multiple developmental regulators in a quantitative manner with high spatiotemporal resolution. The mean protein expression levels over time, as well as embryo-to-embryo variability can be analyzed. A key aspect of the approach is the ability to compare protein levels across different samples. This requires a number of considerations in sample preparation, imaging and data analysis. Here we present a protocol for obtaining time course data of dorsoventral expression patterns from mouse and chick neural tube in the first 3 days of neural tube development. The described workflow starts from embryo dissection and ends with a processed dataset. Software scripts for data analysis are included. The protocol is adaptable and instructions that allow the user to modify different steps are provided. Thus, the procedure can be altered for analysis of time-lapse images and applied to systems other than the neural tube.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","alternative_title":["Methods in Molecular Biology"],"month":"10","intvolume":" 1863","publication_identifier":{"issn":["1064-3745"],"isbn":["978-1-4939-8771-9"]},"publication_status":"published","file":[{"file_name":"2018_MIMB_Zagorski.pdf","date_created":"2020-10-13T14:20:37Z","creator":"dernst","file_size":4906815,"date_updated":"2020-10-13T14:20:37Z","success":1,"checksum":"2a97d0649fdcfcf1bdca7c8ad1dce71b","file_id":"8656","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"volume":1863,"ec_funded":1,"series_title":"MIMB","_id":"37","type":"book_chapter","status":"public","date_updated":"2021-01-12T07:49:03Z","ddc":["570"],"department":[{"_id":"AnKi"}],"file_date_updated":"2020-10-13T14:20:37Z"},{"_id":"305","type":"journal_article","status":"public","date_updated":"2021-01-12T07:40:42Z","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"abstract":[{"lang":"eng","text":"The hanging-drop network (HDN) is a technology platform based on a completely open microfluidic network at the bottom of an inverted, surface-patterned substrate. The platform is predominantly used for the formation, culturing, and interaction of self-assembled spherical microtissues (spheroids) under precisely controlled flow conditions. Here, we describe design, fabrication, and operation of microfluidic hanging-drop networks."}],"oa_version":"None","scopus_import":1,"alternative_title":["MIMB"],"intvolume":" 1771","month":"01","publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"volume":1771,"project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"citation":{"ama":"Misun P, Birchler A, Lang M, Hierlemann A, Frey O. Fabrication and operation of microfluidic hanging drop networks. Methods in Molecular Biology. 2018;1771:183-202. doi:10.1007/978-1-4939-7792-5_15","apa":"Misun, P., Birchler, A., Lang, M., Hierlemann, A., & Frey, O. (2018). Fabrication and operation of microfluidic hanging drop networks. Methods in Molecular Biology. Springer. https://doi.org/10.1007/978-1-4939-7792-5_15","short":"P. Misun, A. Birchler, M. Lang, A. Hierlemann, O. Frey, Methods in Molecular Biology 1771 (2018) 183–202.","ieee":"P. Misun, A. Birchler, M. Lang, A. Hierlemann, and O. Frey, “Fabrication and operation of microfluidic hanging drop networks,” Methods in Molecular Biology, vol. 1771. Springer, pp. 183–202, 2018.","mla":"Misun, Patrick, et al. “Fabrication and Operation of Microfluidic Hanging Drop Networks.” Methods in Molecular Biology, vol. 1771, Springer, 2018, pp. 183–202, doi:10.1007/978-1-4939-7792-5_15.","ista":"Misun P, Birchler A, Lang M, Hierlemann A, Frey O. 2018. Fabrication and operation of microfluidic hanging drop networks. Methods in Molecular Biology. 1771, 183–202.","chicago":"Misun, Patrick, Axel Birchler, Moritz Lang, Andreas Hierlemann, and Olivier Frey. “Fabrication and Operation of Microfluidic Hanging Drop Networks.” Methods in Molecular Biology. Springer, 2018. https://doi.org/10.1007/978-1-4939-7792-5_15."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Patrick","full_name":"Misun, Patrick","last_name":"Misun"},{"last_name":"Birchler","full_name":"Birchler, Axel","first_name":"Axel"},{"first_name":"Moritz","id":"29E0800A-F248-11E8-B48F-1D18A9856A87","last_name":"Lang","full_name":"Lang, Moritz"},{"first_name":"Andreas","last_name":"Hierlemann","full_name":"Hierlemann, Andreas"},{"full_name":"Frey, Olivier","last_name":"Frey","first_name":"Olivier"}],"publist_id":"7574","title":"Fabrication and operation of microfluidic hanging drop networks","acknowledgement":"This work was financially supported by FP7 of the EU through the project “Body on a chip,” ICT-FET-296257, and the ERC Advanced Grant “NeuroCMOS” (contract 267351), as well as by an individual Ambizione Grant 142440 from the Swiss National Science Foundation for Olivier Frey. The research leading to these results also received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. [291734]. We would like to thank Alexander Stettler, ETH Zurich for his expertise and support in the cleanroom, and we acknowledge the Single Cell Unit of D-BSSE, ETH Zurich for assistance in microscopy issues. M.L. is grateful to the members of the Guet and Tkačik groups, IST Austria, for valuable comments and support.","quality_controlled":"1","publisher":"Springer","year":"2018","publication":"Methods in Molecular Biology","day":"01","page":"183 - 202","date_created":"2018-12-11T11:45:43Z","date_published":"2018-01-01T00:00:00Z","doi":"10.1007/978-1-4939-7792-5_15"},{"title":"Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs","external_id":{"arxiv":["1709.04037"]},"publist_id":"7540","author":[{"first_name":"Sheshansh","last_name":"Agrawal","full_name":"Agrawal, Sheshansh"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotny, Petr","last_name":"Novotny"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM, 2018, doi:10.1145/3158122.","apa":"Agrawal, S., Chatterjee, K., & Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122","ama":"Agrawal S, Chatterjee K, Novotný P. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. In: Vol 2. ACM; 2018. doi:10.1145/3158122","short":"S. Agrawal, K. Chatterjee, P. Novotný, in:, ACM, 2018.","ieee":"S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.","chicago":"Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.","ista":"Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34."},"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"article_number":"34","date_created":"2018-12-11T11:45:50Z","date_published":"2018-01-01T00:00:00Z","doi":"10.1145/3158122","day":"01","year":"2018","oa":1,"publisher":"ACM","quality_controlled":"1","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T07:42:07Z","status":"public","conference":{"name":"POPL: Principles of Programming Languages","location":"Los Angeles, CA, USA","end_date":"2018-01-13","start_date":"2018-01-07"},"type":"conference","_id":"325","issue":"POPL","volume":2,"language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 2","month":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1709.04037"}],"oa_version":"Preprint","abstract":[{"text":"Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem asks whether a given program program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). Although deep theoretical results have been established about RSMs, their application to probabilistic programs with nondeterminism has been limited only to programs of restricted control-flow structure. For non-probabilistic programs, lexicographic ranking functions provide a compositional and practical approach for termination analysis of real-world programs. In this work we introduce lexicographic RSMs and show that they present a sound method for almost-sure termination of probabilistic programs with nondeterminism. We show that lexicographic RSMs provide a tool for compositional reasoning about almost-sure termination, and for probabilistic programs with linear arithmetic they can be synthesized efficiently (in polynomial time). We also show that with additional restrictions even asymptotic bounds on expected termination time can be obtained through lexicographic RSMs. Finally, we present experimental results on benchmarks adapted from previous work to demonstrate the effectiveness of our approach.","lang":"eng"}]},{"department":[{"_id":"JiFr"}],"date_updated":"2021-01-12T07:54:21Z","type":"book_chapter","status":"public","_id":"408","volume":1761,"publication_status":"published","publication_identifier":{"issn":["1064-3745"]},"language":[{"iso":"eng"}],"alternative_title":["MIMB"],"scopus_import":"1","intvolume":" 1761","month":"03","abstract":[{"text":"Adventitious roots (AR) are de novo formed roots that emerge from any part of the plant or from callus in tissue culture, except root tissue. The plant tissue origin and the method by which they are induced determine the physiological properties of emerged ARs. Hence, a standard method encompassing all types of AR does not exist. Here we describe a method for the induction and analysis of AR that emerge from the etiolated hypocotyl of dicot plants. The hypocotyl is formed during embryogenesis and shows a determined developmental pattern which usually does not involve AR formation. However, the hypocotyl shows propensity to form de novo roots under specific circumstances such as removal of the root system, high humidity or flooding, or during de-etiolation. The hypocotyl AR emerge from a pericycle-like cell layer surrounding the vascular tissue of the central cylinder, which is reminiscent to the developmental program of lateral roots. Here we propose an easy protocol for in vitro hypocotyl AR induction from etiolated Arabidopsis seedlings.","lang":"eng"}],"pmid":1,"oa_version":"None","external_id":{"pmid":["29525951"]},"article_processing_charge":"No","publist_id":"7421","author":[{"first_name":"Hoang","last_name":"Trinh","full_name":"Trinh, Hoang"},{"last_name":"Verstraeten","full_name":"Verstraeten, Inge","orcid":"0000-0001-7241-2328","first_name":"Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Danny","full_name":"Geelen, Danny","last_name":"Geelen"}],"title":"In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls","citation":{"mla":"Trinh, Hoang, et al. “In Vitro Assay for Induction of Adventitious Rooting on Intact Arabidopsis Hypocotyls.” Root Development , vol. 1761, Springer Nature, 2018, pp. 95–102, doi:10.1007/978-1-4939-7747-5_7.","short":"H. Trinh, I. Verstraeten, D. Geelen, in:, Root Development , Springer Nature, 2018, pp. 95–102.","ieee":"H. Trinh, I. Verstraeten, and D. Geelen, “In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls,” in Root Development , vol. 1761, Springer Nature, 2018, pp. 95–102.","ama":"Trinh H, Verstraeten I, Geelen D. In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls. In: Root Development . Vol 1761. Springer Nature; 2018:95-102. doi:10.1007/978-1-4939-7747-5_7","apa":"Trinh, H., Verstraeten, I., & Geelen, D. (2018). In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls. In Root Development (Vol. 1761, pp. 95–102). Springer Nature. https://doi.org/10.1007/978-1-4939-7747-5_7","chicago":"Trinh, Hoang, Inge Verstraeten, and Danny Geelen. “In Vitro Assay for Induction of Adventitious Rooting on Intact Arabidopsis Hypocotyls.” In Root Development , 1761:95–102. Springer Nature, 2018. https://doi.org/10.1007/978-1-4939-7747-5_7.","ista":"Trinh H, Verstraeten I, Geelen D. 2018.In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls. In: Root Development . MIMB, vol. 1761, 95–102."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"95 - 102","date_created":"2018-12-11T11:46:18Z","doi":"10.1007/978-1-4939-7747-5_7","date_published":"2018-03-01T00:00:00Z","year":"2018","publication":"Root Development ","day":"01","quality_controlled":"1","publisher":"Springer Nature"},{"abstract":[{"lang":"eng","text":"Immunolocalization is a valuable tool for cell biology research that allows to rapidly determine the localization and expression levels of endogenous proteins. In plants, whole-mount in situ immunolocalization remains a challenging method, especially in tissues protected by waxy layers and complex cell wall carbohydrates. Here, we present a robust method for whole-mount in situ immunolocalization in primary root meristems and lateral root primordia in Arabidopsis thaliana. For good epitope preservation, fixation is done in an alkaline paraformaldehyde/glutaraldehyde mixture. This fixative is suitable for detecting a wide range of proteins, including integral transmembrane proteins and proteins peripherally attached to the plasma membrane. From initiation until emergence from the primary root, lateral root primordia are surrounded by several layers of differentiated tissues with a complex cell wall composition that interferes with the efficient penetration of all buffers. Therefore, immunolocalization in early lateral root primordia requires a modified method, including a strong solvent treatment for removal of hydrophobic barriers and a specific cocktail of cell wall-degrading enzymes. The presented method allows for easy, reliable, and high-quality in situ detection of the subcellular localization of endogenous proteins in primary and lateral root meristems without the need of time-consuming crosses or making translational fusions to fluorescent proteins."}],"oa_version":"None","alternative_title":["Methods in Molecular Biology"],"publisher":"Springer","scopus_import":1,"quality_controlled":"1","month":"03","intvolume":" 1761","year":"2018","publication_status":"published","day":"11","publication":"Root Development. Methods and Protocols","language":[{"iso":"eng"}],"page":"131 - 143","doi":"10.1007/978-1-4939-7747-5_10","date_published":"2018-03-11T00:00:00Z","volume":1761,"date_created":"2018-12-11T11:46:20Z","series_title":"MIMB","_id":"411","type":"book_chapter","status":"public","date_updated":"2021-01-12T07:54:34Z","citation":{"ista":"Karampelias M, Tejos R, Friml J, Vanneste S. 2018.Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In: Root Development. Methods and Protocols. Methods in Molecular Biology, vol. 1761, 131–143.","chicago":"Karampelias, Michael, Ricardo Tejos, Jiří Friml, and Steffen Vanneste. “Optimized Whole Mount in Situ Immunolocalization for Arabidopsis Thaliana Root Meristems and Lateral Root Primordia.” In Root Development. Methods and Protocols, edited by Daniela Ristova and Elke Barbez, 1761:131–43. MIMB. Springer, 2018. https://doi.org/10.1007/978-1-4939-7747-5_10.","apa":"Karampelias, M., Tejos, R., Friml, J., & Vanneste, S. (2018). Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In D. Ristova & E. Barbez (Eds.), Root Development. Methods and Protocols (Vol. 1761, pp. 131–143). Springer. https://doi.org/10.1007/978-1-4939-7747-5_10","ama":"Karampelias M, Tejos R, Friml J, Vanneste S. Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In: Ristova D, Barbez E, eds. Root Development. Methods and Protocols. Vol 1761. MIMB. Springer; 2018:131-143. doi:10.1007/978-1-4939-7747-5_10","short":"M. Karampelias, R. Tejos, J. Friml, S. Vanneste, in:, D. Ristova, E. Barbez (Eds.), Root Development. Methods and Protocols, Springer, 2018, pp. 131–143.","ieee":"M. Karampelias, R. Tejos, J. Friml, and S. Vanneste, “Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia,” in Root Development. Methods and Protocols, vol. 1761, D. Ristova and E. Barbez, Eds. Springer, 2018, pp. 131–143.","mla":"Karampelias, Michael, et al. “Optimized Whole Mount in Situ Immunolocalization for Arabidopsis Thaliana Root Meristems and Lateral Root Primordia.” Root Development. Methods and Protocols, edited by Daniela Ristova and Elke Barbez, vol. 1761, Springer, 2018, pp. 131–43, doi:10.1007/978-1-4939-7747-5_10."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"7418","author":[{"last_name":"Karampelias","full_name":"Karampelias, Michael","first_name":"Michael"},{"full_name":"Tejos, Ricardo","last_name":"Tejos","first_name":"Ricardo"},{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"},{"last_name":"Vanneste","full_name":"Vanneste, Steffen","first_name":"Steffen"}],"department":[{"_id":"JiFr"}],"title":"Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia","editor":[{"first_name":"Daniela","last_name":"Ristova","full_name":"Ristova, Daniela"},{"first_name":"Elke","last_name":"Barbez","full_name":"Barbez, Elke"}]},{"department":[{"_id":"GaNo"}],"title":"Zika-associated microcephaly: Reduce the stress and race for the treatment","author":[{"first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178"}],"publist_id":"7365","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:59:42Z","citation":{"ama":"Novarino G. Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. 2018;10(423). doi:10.1126/scitranslmed.aar7514","apa":"Novarino, G. (2018). Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aar7514","ieee":"G. Novarino, “Zika-associated microcephaly: Reduce the stress and race for the treatment,” Science Translational Medicine, vol. 10, no. 423. American Association for the Advancement of Science, 2018.","short":"G. Novarino, Science Translational Medicine 10 (2018).","mla":"Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race for the Treatment.” Science Translational Medicine, vol. 10, no. 423, eaar7514, American Association for the Advancement of Science, 2018, doi:10.1126/scitranslmed.aar7514.","ista":"Novarino G. 2018. Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. 10(423), eaar7514.","chicago":"Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race for the Treatment.” Science Translational Medicine. American Association for the Advancement of Science, 2018. https://doi.org/10.1126/scitranslmed.aar7514."},"status":"public","type":"journal_article","article_number":"eaar7514","_id":"456","date_created":"2018-12-11T11:46:34Z","volume":10,"doi":"10.1126/scitranslmed.aar7514","issue":"423","date_published":"2018-01-10T00:00:00Z","publication":"Science Translational Medicine","language":[{"iso":"eng"}],"day":"10","year":"2018","publication_status":"published","intvolume":" 10","month":"01","scopus_import":1,"quality_controlled":"1","publisher":"American Association for the Advancement of Science","oa_version":"None","abstract":[{"lang":"eng","text":"Inhibition of the endoplasmic reticulum stress pathway may hold the key to Zika virus-associated microcephaly treatment. "}]},{"language":[{"iso":"eng"}],"file":[{"file_name":"2018_VOEB_Petritsch.pdf","date_created":"2018-12-17T12:40:27Z","file_size":509434,"date_updated":"2020-07-14T12:46:38Z","creator":"dernst","checksum":"7ac61bade5f37db011ca435ebcf86797","file_id":"5702","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"publication_status":"published","volume":71,"issue":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"In 2013, a publication repository was implemented at IST Austria and 2015 after a thorough preparation phase a data repository was implemented - both based on the Open Source Software EPrints. In this text, designed as field report, we will reflect on our experiences with Open Source Software in general and specifically with EPrints regarding technical aspects but also regarding their characteristics of the user community. The second part is a pleading for including the end users in the process of implementation, adaption and evaluation."}],"intvolume":" 71","month":"10","scopus_import":1,"ddc":["020"],"date_updated":"2021-01-12T08:01:26Z","file_date_updated":"2020-07-14T12:46:38Z","department":[{"_id":"E-Lib"}],"_id":"53","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","publication":"VÖB Mitteilungen","day":"01","year":"2018","has_accepted_license":"1","date_created":"2018-12-11T11:44:22Z","doi":"10.31263/voebm.v71i1.1993","date_published":"2018-10-01T00:00:00Z","page":"199 - 206","oa":1,"publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018. https://doi.org/10.31263/voebm.v71i1.1993.","ista":"Petritsch B, Porsche J. 2018. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 71(1), 199–206.","mla":"Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen, vol. 71, no. 1, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018, pp. 199–206, doi:10.31263/voebm.v71i1.1993.","short":"B. Petritsch, J. Porsche, VÖB Mitteilungen 71 (2018) 199–206.","ieee":"B. Petritsch and J. Porsche, “IST PubRep and IST DataRep: the institutional repositories at IST Austria,” VÖB Mitteilungen, vol. 71, no. 1. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 199–206, 2018.","ama":"Petritsch B, Porsche J. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 2018;71(1):199-206. doi:10.31263/voebm.v71i1.1993","apa":"Petritsch, B., & Porsche, J. (2018). IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v71i1.1993"},"title":"IST PubRep and IST DataRep: the institutional repositories at IST Austria","author":[{"orcid":"0000-0003-2724-4614","full_name":"Petritsch, Barbara","last_name":"Petritsch","first_name":"Barbara","id":"406048EC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Porsche","full_name":"Porsche, Jana","first_name":"Jana","id":"3252EDC2-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"8001"},{"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"author":[{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh"},{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"full_name":"King, Valerie","last_name":"King","first_name":"Valerie"},{"last_name":"Saia","full_name":"Saia, Jared","first_name":"Jared"}],"publist_id":"7281","article_processing_charge":"Yes (via OA deal)","title":"Communication-efficient randomized consensus","citation":{"mla":"Alistarh, Dan-Adrian, et al. “Communication-Efficient Randomized Consensus.” Distributed Computing, vol. 31, no. 6, Springer, 2018, pp. 489–501, doi:10.1007/s00446-017-0315-1.","ama":"Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized consensus. Distributed Computing. 2018;31(6):489-501. doi:10.1007/s00446-017-0315-1","apa":"Alistarh, D.-A., Aspnes, J., King, V., & Saia, J. (2018). Communication-efficient randomized consensus. Distributed Computing. Springer. https://doi.org/10.1007/s00446-017-0315-1","ieee":"D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient randomized consensus,” Distributed Computing, vol. 31, no. 6. Springer, pp. 489–501, 2018.","short":"D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018) 489–501.","chicago":"Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient Randomized Consensus.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-017-0315-1.","ista":"Alistarh D-A, Aspnes J, King V, Saia J. 2018. Communication-efficient randomized consensus. Distributed Computing. 31(6), 489–501."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","quality_controlled":"1","oa":1,"page":"489-501","doi":"10.1007/s00446-017-0315-1","date_published":"2018-11-01T00:00:00Z","date_created":"2018-12-11T11:47:01Z","has_accepted_license":"1","year":"2018","day":"01","publication":"Distributed Computing","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"536","file_date_updated":"2020-07-14T12:46:38Z","department":[{"_id":"DaAl"}],"date_updated":"2023-02-23T12:23:25Z","ddc":["000"],"scopus_import":1,"month":"11","intvolume":" 31","abstract":[{"text":"We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary. We describe a new randomized consensus protocol with expected message complexity O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear improvement over the best previously known protocol, and within logarithmic factors of a known Ω(n2) message lower bound. The protocol further ensures that no process sends more than O(nlog3n) messages in expectation, which is again within logarithmic factors of optimal. We also present a generalization of the algorithm to an arbitrary number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach is to build a message-efficient, resilient mechanism for aggregating individual processor votes, implementing the message-passing equivalent of a weak shared coin. Roughly, in our protocol, a processor first announces its votes to small groups, then propagates them to increasingly larger groups as it generates more and more votes. To bound the number of messages that an individual process might have to send or receive, the protocol progressively increases the weight of generated votes. The main technical challenge is bounding the impact of votes that are still “in flight” (generated, but not fully propagated) on the final outcome of the shared coin, especially since such votes might have different weights. We achieve this by leveraging the structure of the algorithm, and a technical argument based on martingale concentration bounds. Overall, we show that it is possible to build an efficient message-passing implementation of a shared coin, and in the process (almost-optimally) solve the classic consensus problem in the asynchronous message-passing model.","lang":"eng"}],"oa_version":"Published Version","issue":"6","volume":31,"publication_identifier":{"issn":["01782770"]},"publication_status":"published","file":[{"date_created":"2019-01-22T07:25:51Z","file_name":"2017_DistribComp_Alistarh.pdf","creator":"dernst","date_updated":"2020-07-14T12:46:38Z","file_size":595707,"file_id":"5867","checksum":"69b46e537acdcac745237ddb853fcbb5","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}]},{"month":"05","intvolume":" 360","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.05953"}],"oa_version":"Submitted Version","abstract":[{"text":"We analyse the canonical Bogoliubov free energy functional in three dimensions at low temperatures in the dilute limit. We prove existence of a first-order phase transition and, in the limit (Formula presented.), we determine the critical temperature to be (Formula presented.) to leading order. Here, (Formula presented.) is the critical temperature of the free Bose gas, ρ is the density of the gas and a is the scattering length of the pair-interaction potential V. We also prove asymptotic expansions for the free energy. In particular, we recover the Lee–Huang–Yang formula in the limit (Formula presented.).","lang":"eng"}],"issue":"1","volume":360,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["00103616"]},"publication_status":"published","status":"public","type":"journal_article","_id":"554","department":[{"_id":"RoSe"}],"date_updated":"2021-01-12T08:02:35Z","quality_controlled":"1","publisher":"Springer","oa":1,"date_published":"2018-05-01T00:00:00Z","doi":"10.1007/s00220-017-3064-x","date_created":"2018-12-11T11:47:09Z","page":"347-403","day":"01","publication":"Communications in Mathematical Physics","year":"2018","project":[{"call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27"}],"title":"The Bogoliubov free energy functional II: The dilute Limit","author":[{"first_name":"Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","last_name":"Napiórkowski","full_name":"Napiórkowski, Marcin M"},{"first_name":"Robin","full_name":"Reuvers, Robin","last_name":"Reuvers"},{"full_name":"Solovej, Jan","last_name":"Solovej","first_name":"Jan"}],"publist_id":"7260","external_id":{"arxiv":["1511.05953"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Napiórkowski MM, Reuvers R, Solovej J. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 2018;360(1):347-403. doi:10.1007/s00220-017-3064-x","apa":"Napiórkowski, M. M., Reuvers, R., & Solovej, J. (2018). The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-017-3064-x","short":"M.M. Napiórkowski, R. Reuvers, J. Solovej, Communications in Mathematical Physics 360 (2018) 347–403.","ieee":"M. M. Napiórkowski, R. Reuvers, and J. Solovej, “The Bogoliubov free energy functional II: The dilute Limit,” Communications in Mathematical Physics, vol. 360, no. 1. Springer, pp. 347–403, 2018.","mla":"Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics, vol. 360, no. 1, Springer, 2018, pp. 347–403, doi:10.1007/s00220-017-3064-x.","ista":"Napiórkowski MM, Reuvers R, Solovej J. 2018. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 360(1), 347–403.","chicago":"Napiórkowski, Marcin M, Robin Reuvers, and Jan Solovej. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics. Springer, 2018. https://doi.org/10.1007/s00220-017-3064-x."}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Dimitrov, Dimitar, et al. “Culture of Mouse Giant Central Nervous System Synapses and Application for Imaging and Electrophysiological Analyses.” Neurotrophic Factors, edited by Stephen D. Skaper, vol. 1727, Springer, 2018, pp. 201–15, doi:10.1007/978-1-4939-7571-6_15.","short":"D. Dimitrov, L. Guillaud, K. Eguchi, T. Takahashi, in:, S.D. Skaper (Ed.), Neurotrophic Factors, Springer, 2018, pp. 201–215.","ieee":"D. Dimitrov, L. Guillaud, K. Eguchi, and T. Takahashi, “Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses,” in Neurotrophic Factors, vol. 1727, S. D. Skaper, Ed. Springer, 2018, pp. 201–215.","apa":"Dimitrov, D., Guillaud, L., Eguchi, K., & Takahashi, T. (2018). Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In S. D. Skaper (Ed.), Neurotrophic Factors (Vol. 1727, pp. 201–215). Springer. https://doi.org/10.1007/978-1-4939-7571-6_15","ama":"Dimitrov D, Guillaud L, Eguchi K, Takahashi T. Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In: Skaper SD, ed. Neurotrophic Factors. Vol 1727. Springer; 2018:201-215. doi:10.1007/978-1-4939-7571-6_15","chicago":"Dimitrov, Dimitar, Laurent Guillaud, Kohgaku Eguchi, and Tomoyuki Takahashi. “Culture of Mouse Giant Central Nervous System Synapses and Application for Imaging and Electrophysiological Analyses.” In Neurotrophic Factors, edited by Stephen D. Skaper, 1727:201–15. Springer, 2018. https://doi.org/10.1007/978-1-4939-7571-6_15.","ista":"Dimitrov D, Guillaud L, Eguchi K, Takahashi T. 2018.Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In: Neurotrophic Factors. Methods in Molecular Biology, vol. 1727, 201–215."},"editor":[{"last_name":"Skaper","full_name":"Skaper, Stephen D.","first_name":"Stephen D."}],"title":"Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses","author":[{"full_name":"Dimitrov, Dimitar","last_name":"Dimitrov","first_name":"Dimitar"},{"first_name":"Laurent","last_name":"Guillaud","full_name":"Guillaud, Laurent"},{"id":"2B7846DC-F248-11E8-B48F-1D18A9856A87","first_name":"Kohgaku","orcid":"0000-0002-6170-2546","full_name":"Eguchi, Kohgaku","last_name":"Eguchi"},{"full_name":"Takahashi, Tomoyuki","last_name":"Takahashi","first_name":"Tomoyuki"}],"publist_id":"7252","external_id":{"pmid":["29222783"]},"article_processing_charge":"No","day":"01","publication":"Neurotrophic Factors","has_accepted_license":"1","year":"2018","date_published":"2018-01-01T00:00:00Z","doi":"10.1007/978-1-4939-7571-6_15","date_created":"2018-12-11T11:47:11Z","page":"201 - 215","quality_controlled":"1","publisher":"Springer","oa":1,"ddc":["570"],"date_updated":"2021-01-12T08:03:05Z","department":[{"_id":"RySh"}],"file_date_updated":"2020-07-14T12:47:09Z","_id":"562","status":"public","type":"book_chapter","file":[{"file_id":"7046","checksum":"8aa174ca65a56fbb19e9f88cff3ac3fd","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2018_NeurotrophicFactors_Dimitrov.pdf","date_created":"2019-11-19T07:47:43Z","creator":"dernst","file_size":787407,"date_updated":"2020-07-14T12:47:09Z"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":1727,"oa_version":"Submitted Version","pmid":1,"abstract":[{"lang":"eng","text":"Primary neuronal cell culture preparations are widely used to investigate synaptic functions. This chapter describes a detailed protocol for the preparation of a neuronal cell culture in which giant calyx-type synaptic terminals are formed. This chapter also presents detailed protocols for utilizing the main technical advantages provided by such a preparation, namely, labeling and imaging of synaptic organelles and electrophysiological recordings directly from presynaptic terminals."}],"month":"01","intvolume":" 1727","alternative_title":["Methods in Molecular Biology"],"scopus_import":1},{"publist_id":"7995","author":[{"last_name":"Bloem","full_name":"Bloem, Roderick","first_name":"Roderick"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"}],"title":"Graph games and reactive synthesis","department":[{"_id":"KrCh"}],"editor":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Edmund M.","last_name":"Clarke","full_name":"Clarke, Edmund M."},{"first_name":"Helmut","full_name":"Veith, Helmut","last_name":"Veith"},{"first_name":"Roderick","full_name":"Bloem, Roderick","last_name":"Bloem"}],"date_updated":"2021-01-12T08:05:10Z","citation":{"mla":"Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.” Handbook of Model Checking, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:10.1007/978-3-319-10575-8_27.","short":"R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke, H. Veith, R. Bloem (Eds.), Handbook of Model Checking, 1st ed., Springer, 2018, pp. 921–962.","ieee":"R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in Handbook of Model Checking, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962.","apa":"Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27","ama":"Bloem R, Chatterjee K, Jobstmann B. Graph games and reactive synthesis. In: Henzinger TA, Clarke EM, Veith H, Bloem R, eds. Handbook of Model Checking. 1st ed. Springer; 2018:921-962. doi:10.1007/978-3-319-10575-8_27","chicago":"Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In Handbook of Model Checking, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_27.","ista":"Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 921–962."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"book_chapter","status":"public","_id":"59","page":"921 - 962","date_created":"2018-12-11T11:44:24Z","date_published":"2018-05-19T00:00:00Z","doi":"10.1007/978-3-319-10575-8_27","year":"2018","publication_status":"published","publication_identifier":{"isbn":["978-3-319-10574-1"]},"publication":"Handbook of Model Checking","language":[{"iso":"eng"}],"day":"19","edition":"1","publisher":"Springer","quality_controlled":"1","scopus_import":1,"month":"05","abstract":[{"text":"Graph-based games are an important tool in computer science. They have applications in synthesis, verification, refinement, and far beyond. We review graphbased games with objectives on infinite plays. We give definitions and algorithms to solve the games and to give a winning strategy. The objectives we consider are mostly Boolean, but we also look at quantitative graph-based games and their objectives. Synthesis aims to turn temporal logic specifications into correct reactive systems. We explain the reduction of synthesis to graph-based games (or equivalently tree automata) using synthesis of LTL specifications as an example. We treat the classical approach that uses determinization of parity automata and more modern approaches.","lang":"eng"}],"oa_version":"None"},{"_id":"60","series_title":"Handbook of Model Checking","status":"public","type":"book_chapter","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:05:35Z","citation":{"mla":"Clarke, Edmund, et al. “Introduction to Model Checking.” Handbook of Model Checking, edited by Thomas A Henzinger, Springer, 2018, pp. 1–26, doi:10.1007/978-3-319-10575-8_1.","apa":"Clarke, E., Henzinger, T. A., & Veith, H. (2018). Introduction to model checking. In T. A. Henzinger (Ed.), Handbook of Model Checking (pp. 1–26). Springer. https://doi.org/10.1007/978-3-319-10575-8_1","ama":"Clarke E, Henzinger TA, Veith H. Introduction to model checking. In: Henzinger TA, ed. Handbook of Model Checking. Handbook of Model Checking. Springer; 2018:1-26. doi:10.1007/978-3-319-10575-8_1","short":"E. Clarke, T.A. Henzinger, H. Veith, in:, T.A. Henzinger (Ed.), Handbook of Model Checking, Springer, 2018, pp. 1–26.","ieee":"E. Clarke, T. A. Henzinger, and H. Veith, “Introduction to model checking,” in Handbook of Model Checking, T. A. Henzinger, Ed. Springer, 2018, pp. 1–26.","chicago":"Clarke, Edmund, Thomas A Henzinger, and Helmut Veith. “Introduction to Model Checking.” In Handbook of Model Checking, edited by Thomas A Henzinger, 1–26. Handbook of Model Checking. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_1.","ista":"Clarke E, Henzinger TA, Veith H. 2018.Introduction to model checking. In: Handbook of Model Checking. , 1–26."},"title":"Introduction to model checking","editor":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"department":[{"_id":"ToHe"}],"author":[{"full_name":"Clarke, Edmund","last_name":"Clarke","first_name":"Edmund"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Veith, Helmut","last_name":"Veith","first_name":"Helmut"}],"publist_id":"7994","oa_version":"None","abstract":[{"lang":"eng","text":"Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. This chapter is an introduction and short survey of model checking. The chapter aims to motivate and link the individual chapters of the handbook, and to provide context for readers who are not familiar with model checking."}],"month":"05","scopus_import":1,"publisher":"Springer","quality_controlled":"1","day":"19","language":[{"iso":"eng"}],"publication":"Handbook of Model Checking","year":"2018","publication_status":"published","doi":"10.1007/978-3-319-10575-8_1","date_published":"2018-05-19T00:00:00Z","date_created":"2018-12-11T11:44:25Z","page":"1 - 26"},{"title":"There is no strongly regular graph with parameters (460; 153; 32; 60)","department":[{"_id":"TaHa"}],"publist_id":"7993","author":[{"first_name":"Andriy","last_name":"Bondarenko","full_name":"Bondarenko, Andriy"},{"full_name":"Mellit, Anton","last_name":"Mellit","id":"388D3134-F248-11E8-B48F-1D18A9856A87","first_name":"Anton"},{"last_name":"Prymak","full_name":"Prymak, Andriy","first_name":"Andriy"},{"first_name":"Danylo","full_name":"Radchenko, Danylo","last_name":"Radchenko"},{"last_name":"Viazovska","full_name":"Viazovska, Maryna","first_name":"Maryna"}],"external_id":{"arxiv":["1509.06286"]},"article_processing_charge":"No","extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:06:06Z","citation":{"short":"A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, M. Viazovska, in:, Contemporary Computational Mathematics, Springer, 2018, pp. 131–134.","ieee":"A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, and M. Viazovska, “There is no strongly regular graph with parameters (460; 153; 32; 60),” in Contemporary Computational Mathematics, Springer, 2018, pp. 131–134.","ama":"Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. There is no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational Mathematics. Springer; 2018:131-134. doi:10.1007/978-3-319-72456-0_7","apa":"Bondarenko, A., Mellit, A., Prymak, A., Radchenko, D., & Viazovska, M. (2018). There is no strongly regular graph with parameters (460; 153; 32; 60). In Contemporary Computational Mathematics (pp. 131–134). Springer. https://doi.org/10.1007/978-3-319-72456-0_7","mla":"Bondarenko, Andriy, et al. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” Contemporary Computational Mathematics, Springer, 2018, pp. 131–34, doi:10.1007/978-3-319-72456-0_7.","ista":"Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. 2018.There is no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational Mathematics. , 131–134.","chicago":"Bondarenko, Andriy, Anton Mellit, Andriy Prymak, Danylo Radchenko, and Maryna Viazovska. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” In Contemporary Computational Mathematics, 131–34. Springer, 2018. https://doi.org/10.1007/978-3-319-72456-0_7."},"status":"public","type":"book_chapter","_id":"61","date_published":"2018-05-23T00:00:00Z","doi":"10.1007/978-3-319-72456-0_7","date_created":"2018-12-11T11:44:25Z","page":"131 - 134","day":"23","language":[{"iso":"eng"}],"publication":"Contemporary Computational Mathematics","year":"2018","publication_status":"published","month":"05","publisher":"Springer","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.06286"}],"oa":1,"oa_version":"Preprint","abstract":[{"text":"We prove that there is no strongly regular graph (SRG) with parameters (460; 153; 32; 60). The proof is based on a recent lower bound on the number of 4-cliques in a SRG and some applications of Euclidean representation of SRGs. ","lang":"eng"}]}]