[{"citation":{"ista":"Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. 2020. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 75(6), 1156–1158.","apa":"Avvakumov, S., Wagner, U., Mabillard, I., & Skopenkov, A. B. (2020). Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. IOP Publishing. https://doi.org/10.1070/RM9943","ieee":"S. Avvakumov, U. Wagner, I. Mabillard, and A. B. Skopenkov, “Eliminating higher-multiplicity intersections, III. Codimension 2,” Russian Mathematical Surveys, vol. 75, no. 6. IOP Publishing, pp. 1156–1158, 2020.","ama":"Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 2020;75(6):1156-1158. doi:10.1070/RM9943","chicago":"Avvakumov, Sergey, Uli Wagner, Isaac Mabillard, and A. B. Skopenkov. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys. IOP Publishing, 2020. https://doi.org/10.1070/RM9943.","mla":"Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys, vol. 75, no. 6, IOP Publishing, 2020, pp. 1156–58, doi:10.1070/RM9943.","short":"S. Avvakumov, U. Wagner, I. Mabillard, A.B. Skopenkov, Russian Mathematical Surveys 75 (2020) 1156–1158."},"publication":"Russian Mathematical Surveys","page":"1156-1158","article_type":"original","date_published":"2020-12-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9308","intvolume":" 75","title":"Eliminating higher-multiplicity intersections, III. Codimension 2","status":"public","oa_version":"Preprint","type":"journal_article","issue":"6","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.03501"}],"external_id":{"arxiv":["1511.03501"],"isi":["000625983100001"]},"quality_controlled":"1","isi":1,"doi":"10.1070/RM9943","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0036-0279"]},"month":"12","acknowledgement":"This research was carried out with the support of the Russian Foundation for Basic Research(grant no. 19-01-00169)","year":"2020","publisher":"IOP Publishing","department":[{"_id":"UlWa"}],"publication_status":"published","related_material":{"record":[{"id":"8183","relation":"earlier_version","status":"public"},{"id":"10220","status":"public","relation":"later_version"}]},"author":[{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov","first_name":"Sergey","full_name":"Avvakumov, Sergey"},{"full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner"},{"full_name":"Mabillard, Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","first_name":"Isaac","last_name":"Mabillard"},{"last_name":"Skopenkov","first_name":"A. B.","full_name":"Skopenkov, A. B."}],"volume":75,"date_created":"2021-04-04T22:01:22Z","date_updated":"2023-08-14T11:43:54Z"},{"doi":"10.1007/s10955-019-02434-w","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1811.04572"],"isi":["000498933300001"]},"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"},{"_id":"260482E2-B435-11E9-9278-68D0E5697425","grant_number":" F06504","name":"Taming Complexity in Partial Di erential Systems","call_identifier":"FWF"}],"isi":1,"quality_controlled":"1","publication_identifier":{"issn":["00224715"],"eissn":["15729613"]},"month":"01","related_material":{"link":[{"url":"https://doi.org/10.1007/s10955-020-02671-4","relation":"erratum"}]},"author":[{"full_name":"Carlen, Eric A.","last_name":"Carlen","first_name":"Eric A."},{"full_name":"Maas, Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","last_name":"Maas"}],"volume":178,"date_created":"2019-04-30T07:34:18Z","date_updated":"2023-08-17T13:49:40Z","year":"2020","publisher":"Springer Nature","department":[{"_id":"JaMa"}],"publication_status":"published","ec_funded":1,"file_date_updated":"2020-07-14T12:47:28Z","license":"https://creativecommons.org/licenses/by/4.0/","date_published":"2020-01-01T00:00:00Z","citation":{"ama":"Carlen EA, Maas J. Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems. Journal of Statistical Physics. 2020;178(2):319-378. doi:10.1007/s10955-019-02434-w","ieee":"E. A. Carlen and J. Maas, “Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems,” Journal of Statistical Physics, vol. 178, no. 2. Springer Nature, pp. 319–378, 2020.","apa":"Carlen, E. A., & Maas, J. (2020). Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems. Journal of Statistical Physics. Springer Nature. https://doi.org/10.1007/s10955-019-02434-w","ista":"Carlen EA, Maas J. 2020. Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems. Journal of Statistical Physics. 178(2), 319–378.","short":"E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378.","mla":"Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities in Dissipative Quantum Systems.” Journal of Statistical Physics, vol. 178, no. 2, Springer Nature, 2020, pp. 319–78, doi:10.1007/s10955-019-02434-w.","chicago":"Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities in Dissipative Quantum Systems.” Journal of Statistical Physics. Springer Nature, 2020. https://doi.org/10.1007/s10955-019-02434-w."},"publication":"Journal of Statistical Physics","page":"319-378","article_type":"original","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"01","scopus_import":"1","oa_version":"Published Version","file":[{"file_name":"2019_JourStatistPhysics_Carlen.pdf","access_level":"open_access","file_size":905538,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"7209","date_created":"2019-12-23T12:03:09Z","date_updated":"2020-07-14T12:47:28Z","checksum":"7b04befbdc0d4982c0ee945d25d19872"}],"_id":"6358","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 178","title":"Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems","ddc":["500"],"status":"public","issue":"2","abstract":[{"lang":"eng","text":"We study dynamical optimal transport metrics between density matricesassociated to symmetric Dirichlet forms on finite-dimensional C∗-algebras. Our settingcovers arbitrary skew-derivations and it provides a unified framework that simultaneously generalizes recently constructed transport metrics for Markov chains, Lindblad equations, and the Fermi Ornstein–Uhlenbeck semigroup. We develop a non-nommutative differential calculus that allows us to obtain non-commutative Ricci curvature bounds, logarithmic Sobolev inequalities, transport-entropy inequalities, andspectral gap estimates."}],"type":"journal_article"},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-36020-7_1","project":[{"name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"}],"isi":1,"quality_controlled":"1","external_id":{"arxiv":["1808.07350"],"isi":["000557689300003"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.07350"}],"oa":1,"publication_identifier":{"eissn":["16179692"],"isbn":["9783030360191"],"eisbn":["9783030360207"],"issn":["00758434"]},"month":"06","volume":2256,"date_updated":"2023-08-17T13:48:31Z","date_created":"2018-12-11T11:44:29Z","author":[{"full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan"},{"last_name":"Karasev","first_name":"Roman","full_name":"Karasev, Roman"}],"publisher":"Springer Nature","department":[{"_id":"HeEd"},{"_id":"JaMa"}],"editor":[{"full_name":"Klartag, Bo'az","first_name":"Bo'az","last_name":"Klartag"},{"first_name":"Emanuel","last_name":"Milman","full_name":"Milman, Emanuel"}],"publication_status":"published","year":"2020","ec_funded":1,"date_published":"2020-06-21T00:00:00Z","page":"1-27","citation":{"chicago":"Akopyan, Arseniy, and Roman Karasev. “Gromov’s Waist of Non-Radial Gaussian Measures and Radial Non-Gaussian Measures.” In Geometric Aspects of Functional Analysis, edited by Bo’az Klartag and Emanuel Milman, 2256:1–27. LNM. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-36020-7_1.","short":"A. Akopyan, R. Karasev, in:, B. Klartag, E. Milman (Eds.), Geometric Aspects of Functional Analysis, Springer Nature, 2020, pp. 1–27.","mla":"Akopyan, Arseniy, and Roman Karasev. “Gromov’s Waist of Non-Radial Gaussian Measures and Radial Non-Gaussian Measures.” Geometric Aspects of Functional Analysis, edited by Bo’az Klartag and Emanuel Milman, vol. 2256, Springer Nature, 2020, pp. 1–27, doi:10.1007/978-3-030-36020-7_1.","apa":"Akopyan, A., & Karasev, R. (2020). Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures. In B. Klartag & E. Milman (Eds.), Geometric Aspects of Functional Analysis (Vol. 2256, pp. 1–27). Springer Nature. https://doi.org/10.1007/978-3-030-36020-7_1","ieee":"A. Akopyan and R. Karasev, “Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures,” in Geometric Aspects of Functional Analysis, vol. 2256, B. Klartag and E. Milman, Eds. Springer Nature, 2020, pp. 1–27.","ista":"Akopyan A, Karasev R. 2020.Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures. In: Geometric Aspects of Functional Analysis. vol. 2256, 1–27.","ama":"Akopyan A, Karasev R. Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures. In: Klartag B, Milman E, eds. Geometric Aspects of Functional Analysis. Vol 2256. LNM. Springer Nature; 2020:1-27. doi:10.1007/978-3-030-36020-7_1"},"publication":"Geometric Aspects of Functional Analysis","article_processing_charge":"No","day":"21","series_title":"LNM","scopus_import":"1","oa_version":"Preprint","intvolume":" 2256","title":"Gromov's waist of non-radial Gaussian measures and radial non-Gaussian measures","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"74","abstract":[{"lang":"eng","text":"We study the Gromov waist in the sense of t-neighborhoods for measures in the Euclidean space, motivated by the famous theorem of Gromov about the waist of radially symmetric Gaussian measures. In particular, it turns our possible to extend Gromov’s original result to the case of not necessarily radially symmetric Gaussian measure. We also provide examples of measures having no t-neighborhood waist property, including a rather wide class\r\nof compactly supported radially symmetric measures and their maps into the Euclidean space of dimension at least 2.\r\nWe use a simpler form of Gromov’s pancake argument to produce some estimates of t-neighborhoods of (weighted) volume-critical submanifolds in the spirit of the waist theorems, including neighborhoods of algebraic manifolds in the complex projective space. In the appendix of this paper we provide for reader’s convenience a more detailed explanation of the Caffarelli theorem that we use to handle not necessarily radially symmetric Gaussian\r\nmeasures."}],"type":"book_chapter"},{"intvolume":" 191","status":"public","title":"A geometric version of the circle method","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"177","oa_version":"Preprint","type":"journal_article","issue":"3","abstract":[{"text":"We develop a geometric version of the circle method and use it to compute the compactly supported cohomology of the space of rational curves through a point on a smooth affine hypersurface of sufficiently low degree.","lang":"eng"}],"page":"893-948","article_type":"original","citation":{"ista":"Browning TD, Sawin W. 2020. A geometric version of the circle method. Annals of Mathematics. 191(3), 893–948.","apa":"Browning, T. D., & Sawin, W. (2020). A geometric version of the circle method. Annals of Mathematics. Princeton University. https://doi.org/10.4007/annals.2020.191.3.4","ieee":"T. D. Browning and W. Sawin, “A geometric version of the circle method,” Annals of Mathematics, vol. 191, no. 3. Princeton University, pp. 893–948, 2020.","ama":"Browning TD, Sawin W. A geometric version of the circle method. Annals of Mathematics. 2020;191(3):893-948. doi:10.4007/annals.2020.191.3.4","chicago":"Browning, Timothy D, and Will Sawin. “A Geometric Version of the Circle Method.” Annals of Mathematics. Princeton University, 2020. https://doi.org/10.4007/annals.2020.191.3.4.","mla":"Browning, Timothy D., and Will Sawin. “A Geometric Version of the Circle Method.” Annals of Mathematics, vol. 191, no. 3, Princeton University, 2020, pp. 893–948, doi:10.4007/annals.2020.191.3.4.","short":"T.D. Browning, W. Sawin, Annals of Mathematics 191 (2020) 893–948."},"publication":"Annals of Mathematics","date_published":"2020-05-01T00:00:00Z","article_processing_charge":"No","day":"01","department":[{"_id":"TiBr"}],"publisher":"Princeton University","publication_status":"published","year":"2020","volume":191,"date_created":"2018-12-11T11:45:02Z","date_updated":"2023-08-17T07:12:37Z","author":[{"first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D"},{"full_name":"Sawin, Will","last_name":"Sawin","first_name":"Will"}],"publist_id":"7744","quality_controlled":"1","isi":1,"external_id":{"arxiv":["1711.10451"],"isi":["000526986300004"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.10451"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.4007/annals.2020.191.3.4","month":"05"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6649","status":"public","title":"Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime","ddc":["530"],"intvolume":" 374","oa_version":"Published Version","file":[{"checksum":"f9dd6dd615a698f1d3636c4a092fed23","date_updated":"2020-07-14T12:47:35Z","date_created":"2019-07-24T07:19:10Z","file_id":"6668","relation":"main_file","creator":"dernst","file_size":853289,"content_type":"application/pdf","access_level":"open_access","file_name":"2019_CommMathPhysics_Benedikter.pdf"}],"type":"journal_article","abstract":[{"lang":"eng","text":"While Hartree–Fock theory is well established as a fundamental approximation for interacting fermions, it has been unclear how to describe corrections to it due to many-body correlations. In this paper we start from the Hartree–Fock state given by plane waves and introduce collective particle–hole pair excitations. These pairs can be approximately described by a bosonic quadratic Hamiltonian. We use Bogoliubov theory to construct a trial state yielding a rigorous Gell-Mann–Brueckner–type upper bound to the ground state energy. Our result justifies the random-phase approximation in the mean-field scaling regime, for repulsive, regular interaction potentials.\r\n"}],"publication":"Communications in Mathematical Physics","citation":{"ieee":"N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime,” Communications in Mathematical Physics, vol. 374. Springer Nature, pp. 2097–2150, 2020.","apa":"Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., & Seiringer, R. (2020). Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03505-5","ista":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2020. Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime. Communications in Mathematical Physics. 374, 2097–2150.","ama":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime. Communications in Mathematical Physics. 2020;374:2097–2150. doi:10.1007/s00220-019-03505-5","chicago":"Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein, and Robert Seiringer. “Optimal Upper Bound for the Correlation Energy of a Fermi Gas in the Mean-Field Regime.” Communications in Mathematical Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03505-5.","short":"N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Communications in Mathematical Physics 374 (2020) 2097–2150.","mla":"Benedikter, Niels P., et al. “Optimal Upper Bound for the Correlation Energy of a Fermi Gas in the Mean-Field Regime.” Communications in Mathematical Physics, vol. 374, Springer Nature, 2020, pp. 2097–2150, doi:10.1007/s00220-019-03505-5."},"article_type":"original","page":"2097–2150","date_published":"2020-03-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1","year":"2020","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"RoSe"}],"author":[{"id":"3DE6C32A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1071-6091","first_name":"Niels P","last_name":"Benedikter","full_name":"Benedikter, Niels P"},{"last_name":"Nam","first_name":"Phan Thành","full_name":"Nam, Phan Thành"},{"full_name":"Porta, Marcello","first_name":"Marcello","last_name":"Porta"},{"full_name":"Schlein, Benjamin","last_name":"Schlein","first_name":"Benjamin"},{"full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521"}],"date_created":"2019-07-18T13:30:04Z","date_updated":"2023-08-17T13:51:50Z","volume":374,"file_date_updated":"2020-07-14T12:47:35Z","ec_funded":1,"external_id":{"isi":["000527910700019"],"arxiv":["1809.01902"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"isi":1,"quality_controlled":"1","project":[{"name":"FWF Open Access Fund","call_identifier":"FWF","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"},{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF","grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425"},{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"doi":"10.1007/s00220-019-03505-5","language":[{"iso":"eng"}],"month":"03","publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]}},{"file_date_updated":"2020-07-14T12:47:40Z","author":[{"full_name":"Stella, Federico","first_name":"Federico","last_name":"Stella","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9439-3148"},{"first_name":"Eugenio","last_name":"Urdapilleta","full_name":"Urdapilleta, Eugenio"},{"full_name":"Luo, Yifan","last_name":"Luo","first_name":"Yifan"},{"full_name":"Treves, Alessandro","first_name":"Alessandro","last_name":"Treves"}],"date_created":"2019-08-11T21:59:24Z","date_updated":"2023-08-17T13:53:14Z","volume":30,"year":"2020","pmid":1,"publication_status":"published","publisher":"Wiley","department":[{"_id":"JoCs"}],"month":"04","publication_identifier":{"issn":["10509631"],"eissn":["10981063"]},"doi":"10.1002/hipo.23144","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000477299600001"],"pmid":["31339190"]},"quality_controlled":"1","isi":1,"abstract":[{"lang":"eng","text":"Nearby grid cells have been observed to express a remarkable degree of long-rangeorder, which is often idealized as extending potentially to infinity. Yet their strict peri-odic firing and ensemble coherence are theoretically possible only in flat environments, much unlike the burrows which rodents usually live in. Are the symmetrical, coherent grid maps inferred in the lab relevant to chart their way in their natural habitat? We consider spheres as simple models of curved environments and waiting for the appropriate experiments to be performed, we use our adaptation model to predict what grid maps would emerge in a network with the same type of recurrent connections, which on the plane produce coherence among the units. We find that on the sphere such connections distort the maps that single grid units would express on their own, and aggregate them into clusters. When remapping to a different spherical environment, units in each cluster maintain only partial coherence, similar to what is observed in disordered materials, such as spin glasses."}],"issue":"4","type":"journal_article","oa_version":"Published Version","file":[{"creator":"dernst","content_type":"application/pdf","file_size":2370658,"access_level":"open_access","file_name":"2019_Hippocampus_Stella.pdf","checksum":"7b54d22bfbfc0d1188a9ea24d985bfb2","date_updated":"2020-07-14T12:47:40Z","date_created":"2019-08-12T07:53:33Z","file_id":"6800","relation":"main_file"}],"_id":"6796","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Partial coherence and frustration in self-organizing spherical grids","ddc":["570"],"status":"public","intvolume":" 30","day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2020-04-01T00:00:00Z","publication":"Hippocampus","citation":{"ista":"Stella F, Urdapilleta E, Luo Y, Treves A. 2020. Partial coherence and frustration in self-organizing spherical grids. Hippocampus. 30(4), 302–313.","apa":"Stella, F., Urdapilleta, E., Luo, Y., & Treves, A. (2020). Partial coherence and frustration in self-organizing spherical grids. Hippocampus. Wiley. https://doi.org/10.1002/hipo.23144","ieee":"F. Stella, E. Urdapilleta, Y. Luo, and A. Treves, “Partial coherence and frustration in self-organizing spherical grids,” Hippocampus, vol. 30, no. 4. Wiley, pp. 302–313, 2020.","ama":"Stella F, Urdapilleta E, Luo Y, Treves A. Partial coherence and frustration in self-organizing spherical grids. Hippocampus. 2020;30(4):302-313. doi:10.1002/hipo.23144","chicago":"Stella, Federico, Eugenio Urdapilleta, Yifan Luo, and Alessandro Treves. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” Hippocampus. Wiley, 2020. https://doi.org/10.1002/hipo.23144.","mla":"Stella, Federico, et al. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” Hippocampus, vol. 30, no. 4, Wiley, 2020, pp. 302–13, doi:10.1002/hipo.23144.","short":"F. Stella, E. Urdapilleta, Y. Luo, A. Treves, Hippocampus 30 (2020) 302–313."},"article_type":"original","page":"302-313"},{"doi":"10.1016/j.tcs.2019.06.031","language":[{"iso":"eng"}],"external_id":{"isi":["000512219400004"]},"oa":1,"project":[{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory"}],"isi":1,"quality_controlled":"1","publication_identifier":{"issn":["03043975"]},"month":"02","related_material":{"record":[{"id":"1341","status":"public","relation":"earlier_version"}]},"author":[{"first_name":"Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"volume":807,"date_updated":"2023-08-17T13:52:49Z","date_created":"2019-08-04T21:59:20Z","year":"2020","department":[{"_id":"ToHe"}],"publisher":"Elsevier","publication_status":"published","file_date_updated":"2020-10-09T06:31:22Z","date_published":"2020-02-06T00:00:00Z","citation":{"ieee":"G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.","apa":"Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.06.031","ista":"Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games. Theoretical Computer Science. 807, 42–55.","ama":"Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031","chicago":"Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation Games.” Theoretical Computer Science. Elsevier, 2020. https://doi.org/10.1016/j.tcs.2019.06.031.","short":"G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55.","mla":"Avni, Guy, et al. “Dynamic Resource Allocation Games.” Theoretical Computer Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031."},"publication":"Theoretical Computer Science","page":"42-55","article_type":"original","has_accepted_license":"1","article_processing_charge":"No","day":"06","scopus_import":"1","oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"8639","checksum":"e86635417f45eb2cd75778f91382f737","success":1,"date_created":"2020-10-09T06:31:22Z","date_updated":"2020-10-09T06:31:22Z","access_level":"open_access","file_name":"2020_TheoreticalCS_Avni.pdf","file_size":1413001,"content_type":"application/pdf","creator":"dernst"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6761","intvolume":" 807","ddc":["000"],"status":"public","title":"Dynamic resource allocation games","abstract":[{"lang":"eng","text":"In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability."}],"type":"journal_article"},{"publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"Springer Nature","year":"2020","acknowledgement":"The research of this author is supported by the ERC grant at the IST.","date_updated":"2023-08-17T13:51:18Z","date_created":"2019-06-27T20:09:33Z","volume":84,"author":[{"full_name":"Shehu, Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9224-7139","first_name":"Yekini","last_name":"Shehu"},{"full_name":"Li, Xiao-Huan","first_name":"Xiao-Huan","last_name":"Li"},{"full_name":"Dong, Qiao-Li","first_name":"Qiao-Li","last_name":"Dong"}],"file_date_updated":"2020-07-14T12:47:34Z","ec_funded":1,"isi":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"external_id":{"isi":["000528979000015"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s11075-019-00758-y","month":"05","publication_identifier":{"issn":["1017-1398"],"eissn":["1572-9265"]},"title":"An efficient projection-type method for monotone variational inequalities in Hilbert spaces","ddc":["000"],"status":"public","intvolume":" 84","_id":"6593","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"file_id":"6927","relation":"main_file","date_created":"2019-10-01T13:14:10Z","date_updated":"2020-07-14T12:47:34Z","checksum":"bb1a1eb3ebb2df380863d0db594673ba","file_name":"ExtragradientMethodPaper.pdf","access_level":"open_access","creator":"kschuh","file_size":359654,"content_type":"application/pdf"}],"oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"We consider the monotone variational inequality problem in a Hilbert space and describe a projection-type method with inertial terms under the following properties: (a) The method generates a strongly convergent iteration sequence; (b) The method requires, at each iteration, only one projection onto the feasible set and two evaluations of the operator; (c) The method is designed for variational inequality for which the underline operator is monotone and uniformly continuous; (d) The method includes an inertial term. The latter is also shown to speed up the convergence in our numerical results. A comparison with some related methods is given and indicates that the new method is promising."}],"article_type":"original","page":"365-388","publication":"Numerical Algorithms","citation":{"ista":"Shehu Y, Li X-H, Dong Q-L. 2020. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. 84, 365–388.","apa":"Shehu, Y., Li, X.-H., & Dong, Q.-L. (2020). An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. Springer Nature. https://doi.org/10.1007/s11075-019-00758-y","ieee":"Y. Shehu, X.-H. Li, and Q.-L. Dong, “An efficient projection-type method for monotone variational inequalities in Hilbert spaces,” Numerical Algorithms, vol. 84. Springer Nature, pp. 365–388, 2020.","ama":"Shehu Y, Li X-H, Dong Q-L. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. 2020;84:365-388. doi:10.1007/s11075-019-00758-y","chicago":"Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” Numerical Algorithms. Springer Nature, 2020. https://doi.org/10.1007/s11075-019-00758-y.","mla":"Shehu, Yekini, et al. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” Numerical Algorithms, vol. 84, Springer Nature, 2020, pp. 365–88, doi:10.1007/s11075-019-00758-y.","short":"Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms 84 (2020) 365–388."},"date_published":"2020-05-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1"},{"language":[{"iso":"eng"}],"doi":"10.1016/j.ymeth.2019.07.019","isi":1,"quality_controlled":"1","project":[{"name":"Optical control of synaptic function via adhesion molecules","call_identifier":"FWF","grant_number":"I03600","_id":"265CB4D0-B435-11E9-9278-68D0E5697425"},{"name":"High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration","grant_number":"LT00057","_id":"2668BFA0-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7100895/"}],"oa":1,"external_id":{"pmid":["31344404"],"isi":["000525860400005"]},"month":"03","publication_identifier":{"issn":["1046-2023"]},"date_updated":"2023-08-17T13:59:57Z","date_created":"2019-08-12T16:36:32Z","volume":174,"author":[{"full_name":"Jahr, Wiebke","id":"425C1CE8-F248-11E8-B48F-1D18A9856A87","last_name":"Jahr","first_name":"Wiebke"},{"full_name":"Velicky, Philipp","first_name":"Philipp","last_name":"Velicky","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2340-7431"},{"full_name":"Danzl, Johann G","first_name":"Johann G","last_name":"Danzl","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973"}],"publication_status":"published","publisher":"Elsevier","department":[{"_id":"JoDa"}],"year":"2020","pmid":1,"date_published":"2020-03-01T00:00:00Z","article_type":"original","page":"27-41","publication":"Methods","citation":{"chicago":"Jahr, Wiebke, Philipp Velicky, and Johann G Danzl. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” Methods. Elsevier, 2020. https://doi.org/10.1016/j.ymeth.2019.07.019.","short":"W. Jahr, P. Velicky, J.G. Danzl, Methods 174 (2020) 27–41.","mla":"Jahr, Wiebke, et al. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” Methods, vol. 174, no. 3, Elsevier, 2020, pp. 27–41, doi:10.1016/j.ymeth.2019.07.019.","apa":"Jahr, W., Velicky, P., & Danzl, J. G. (2020). Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. Elsevier. https://doi.org/10.1016/j.ymeth.2019.07.019","ieee":"W. Jahr, P. Velicky, and J. G. Danzl, “Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens,” Methods, vol. 174, no. 3. Elsevier, pp. 27–41, 2020.","ista":"Jahr W, Velicky P, Danzl JG. 2020. Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. 174(3), 27–41.","ama":"Jahr W, Velicky P, Danzl JG. Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. 2020;174(3):27-41. doi:10.1016/j.ymeth.2019.07.019"},"day":"01","article_processing_charge":"No","scopus_import":"1","oa_version":"Submitted Version","status":"public","title":"Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens","intvolume":" 174","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6808","abstract":[{"lang":"eng","text":"Super-resolution fluorescence microscopy has become an important catalyst for discovery in the life sciences. In STimulated Emission Depletion (STED) microscopy, a pattern of light drives fluorophores from a signal-emitting on-state to a non-signalling off-state. Only emitters residing in a sub-diffraction volume around an intensity minimum are allowed to fluoresce, rendering them distinguishable from the nearby, but dark fluorophores. STED routinely achieves resolution in the few tens of nanometers range in biological samples and is suitable for live imaging. Here, we review the working principle of STED and provide general guidelines for successful STED imaging. The strive for ever higher resolution comes at the cost of increased light burden. We discuss techniques to reduce light exposure and mitigate its detrimental effects on the specimen. These include specialized illumination strategies as well as protecting fluorophores from photobleaching mediated by high-intensity STED light. This opens up the prospect of volumetric imaging in living cells and tissues with diffraction-unlimited resolution in all three spatial dimensions."}],"issue":"3","type":"journal_article"},{"project":[{"name":"Algorithms for Embeddings and Homotopy Theory","call_identifier":"FWF","_id":"26611F5C-B435-11E9-9278-68D0E5697425","grant_number":"P31312"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000522437400004"],"arxiv":["1312.2337"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1312.2337","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1007/s10208-019-09419-x","publication_identifier":{"issn":["16153375"],"eissn":["16153383"]},"month":"04","publisher":"Springer Nature","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2020","volume":20,"date_created":"2019-06-16T21:59:14Z","date_updated":"2023-08-17T13:50:44Z","author":[{"full_name":"Filakovský, Marek","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","last_name":"Filakovský"},{"full_name":"Vokřínek, Lukas","last_name":"Vokřínek","first_name":"Lukas"}],"page":"311-330","article_type":"original","citation":{"ista":"Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 20, 311–330.","ieee":"M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic viewpoint,” Foundations of Computational Mathematics, vol. 20. Springer Nature, pp. 311–330, 2020.","apa":"Filakovský, M., & Vokřínek, L. (2020). Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. Springer Nature. https://doi.org/10.1007/s10208-019-09419-x","ama":"Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 2020;20:311-330. doi:10.1007/s10208-019-09419-x","chicago":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics. Springer Nature, 2020. https://doi.org/10.1007/s10208-019-09419-x.","mla":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics, vol. 20, Springer Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x.","short":"M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330."},"publication":"Foundations of Computational Mathematics","date_published":"2020-04-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","intvolume":" 20","title":"Are two given maps homotopic? An algorithmic viewpoint","status":"public","_id":"6563","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"This paper presents two algorithms. The first decides the existence of a pointed homotopy between given simplicial maps 𝑓,𝑔:𝑋→𝑌, and the second computes the group [𝛴𝑋,𝑌]∗ of pointed homotopy classes of maps from a suspension; in both cases, the target Y is assumed simply connected. More generally, these algorithms work relative to 𝐴⊆𝑋.","lang":"eng"}]}]