[{"date_updated":"2026-06-30T07:20:56Z","article_type":"original","publication_identifier":{"eissn":["1948-206X"],"issn":["2157-5045"]},"page":"1245-1270","type":"journal_article","publisher":"Mathematical Sciences Publishers","volume":16,"das_tickbox":"1","publication":"Analysis & PDE","has_accepted_license":"1","mathsc":["35Q55"],"date_created":"2026-06-19T08:15:32Z","issue":"5","main_file_link":[{"url":"https://doi.org/10.2140/apde.2023.16.1245","open_access":"1"}],"extern":"1","oa":1,"article_processing_charge":"No","OA_place":"publisher","arxiv":1,"scopus_import":"1","external_id":{"arxiv":["2101.12274"]},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["500"],"fulldoi":"https://doi.org/10.2140/apde.2023.16.1245","doi":"10.2140/apde.2023.16.1245","intvolume":"        16","_id":"22067","status":"public","author":[{"last_name":"Killip","full_name":"Killip, Rowan","first_name":"Rowan"},{"last_name":"Ntekoume","first_name":"Maria","full_name":"Ntekoume, Maria"},{"first_name":"Monica","full_name":"Visan, Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan"}],"quality_controlled":"1","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-08-12T00:00:00Z","abstract":[{"text":"We consider the derivative nonlinear Schrödinger equation in one space dimension, posed both on the line and on the circle. This model is known to be completely integrable and L^2-critical with respect to scaling. We first discuss whether ensembles of orbits with L^2-equicontinuous initial data remain equicontinuous under evolution. We prove that this is true under the restriction \r\nM(q)=∫∣∣q∣∣2<4π. We conjecture that this restriction is unnecessary. Further, we prove that the problem is globally well posed for initial data in H1∕6 under the same restriction on M. Moreover, we show that this restriction would be removed by a successful resolution of our equicontinuity conjecture.","lang":"eng"}],"citation":{"ista":"Killip R, Ntekoume M, Vişan M. 2023. On the well-posedness problem for the derivativenonlinear Schrödinger equation. Analysis &#38; PDE. 16(5), 1245–1270.","mla":"Killip, Rowan, et al. “On the Well-Posedness Problem for the Derivativenonlinear Schrödinger Equation.” <i>Analysis &#38; PDE</i>, vol. 16, no. 5, Mathematical Sciences Publishers, 2023, pp. 1245–70, doi:<a href=\"https://doi.org/10.2140/apde.2023.16.1245\">10.2140/apde.2023.16.1245</a>.","ama":"Killip R, Ntekoume M, Vişan M. On the well-posedness problem for the derivativenonlinear Schrödinger equation. <i>Analysis &#38; PDE</i>. 2023;16(5):1245-1270. doi:<a href=\"https://doi.org/10.2140/apde.2023.16.1245\">10.2140/apde.2023.16.1245</a>","chicago":"Killip, Rowan, Maria Ntekoume, and Monica Vişan. “On the Well-Posedness Problem for the Derivativenonlinear Schrödinger Equation.” <i>Analysis &#38; PDE</i>. Mathematical Sciences Publishers, 2023. <a href=\"https://doi.org/10.2140/apde.2023.16.1245\">https://doi.org/10.2140/apde.2023.16.1245</a>.","short":"R. Killip, M. Ntekoume, M. Vişan, Analysis &#38; PDE 16 (2023) 1245–1270.","ieee":"R. Killip, M. Ntekoume, and M. Vişan, “On the well-posedness problem for the derivativenonlinear Schrödinger equation,” <i>Analysis &#38; PDE</i>, vol. 16, no. 5. Mathematical Sciences Publishers, pp. 1245–1270, 2023.","apa":"Killip, R., Ntekoume, M., &#38; Vişan, M. (2023). On the well-posedness problem for the derivativenonlinear Schrödinger equation. <i>Analysis &#38; PDE</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/apde.2023.16.1245\">https://doi.org/10.2140/apde.2023.16.1245</a>"},"title":"On the well-posedness problem for the derivativenonlinear Schrödinger equation","month":"08","year":"2023","publication_status":"published","day":"12","language":[{"iso":"eng"}],"OA_type":"diamond"},{"publication_identifier":{"issn":["0002-9939"],"eissn":["1088-6826"]},"page":"2543-2557","type":"journal_article","publisher":"American Mathematical Society","date_updated":"2026-06-30T07:08:20Z","article_type":"original","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2207.02414"}],"oa":1,"extern":"1","volume":151,"publication":"Proceedings of the American Mathematical Society","das_tickbox":"1","mathsc":["35Q55"],"date_created":"2026-06-19T08:12:42Z","issue":"6","fulldoi":"https://doi.org/10.1090/proc/16297","intvolume":"       151","doi":"10.1090/proc/16297","status":"public","_id":"22064","quality_controlled":"1","author":[{"first_name":"Rowan","full_name":"Killip, Rowan","last_name":"Killip"},{"last_name":"Murphy","full_name":"Murphy, Jason","first_name":"Jason"},{"first_name":"Monica","full_name":"Visan, Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan"}],"oa_version":"Preprint","article_processing_charge":"No","OA_place":"repository","arxiv":1,"scopus_import":"1","external_id":{"arxiv":["2207.02414"]},"publication_status":"published","language":[{"iso":"eng"}],"day":"01","OA_type":"green","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-06-01T00:00:00Z","abstract":[{"text":"Using the two-dimensional nonlinear Schrödinger equation as a model example, we present a general method for recovering the nonlinearity of a nonlinear dispersive equation from its small-data scattering behavior. We prove that under very mild assumptions on the nonlinearity, the wave operator uniquely determines the nonlinearity, as does the scattering map. Evaluating the scattering map on well-chosen initial data, we reduce the problem to an inverse convolution problem, which we solve by means of an application of the Beurling–Lax Theorem.","lang":"eng"}],"citation":{"ista":"Killip R, Murphy J, Vişan M. 2023. The scattering map determines the nonlinearity. Proceedings of the American Mathematical Society. 151(6), 2543–2557.","mla":"Killip, Rowan, et al. “The Scattering Map Determines the Nonlinearity.” <i>Proceedings of the American Mathematical Society</i>, vol. 151, no. 6, American Mathematical Society, 2023, pp. 2543–57, doi:<a href=\"https://doi.org/10.1090/proc/16297\">10.1090/proc/16297</a>.","ama":"Killip R, Murphy J, Vişan M. The scattering map determines the nonlinearity. <i>Proceedings of the American Mathematical Society</i>. 2023;151(6):2543-2557. doi:<a href=\"https://doi.org/10.1090/proc/16297\">10.1090/proc/16297</a>","chicago":"Killip, Rowan, Jason Murphy, and Monica Vişan. “The Scattering Map Determines the Nonlinearity.” <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society, 2023. <a href=\"https://doi.org/10.1090/proc/16297\">https://doi.org/10.1090/proc/16297</a>.","short":"R. Killip, J. Murphy, M. Vişan, Proceedings of the American Mathematical Society 151 (2023) 2543–2557.","ieee":"R. Killip, J. Murphy, and M. Vişan, “The scattering map determines the nonlinearity,” <i>Proceedings of the American Mathematical Society</i>, vol. 151, no. 6. American Mathematical Society, pp. 2543–2557, 2023.","apa":"Killip, R., Murphy, J., &#38; Vişan, M. (2023). The scattering map determines the nonlinearity. <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/proc/16297\">https://doi.org/10.1090/proc/16297</a>"},"title":"The scattering map determines the nonlinearity","month":"06","year":"2023"},{"fulldoi":"https://doi.org/10.1093/imrn/rnab374","oa_version":"Preprint","intvolume":"      2023","doi":"10.1093/imrn/rnab374","quality_controlled":"1","_id":"22072","status":"public","author":[{"last_name":"Harrop-Griffiths","first_name":"Benjamin","full_name":"Harrop-Griffiths, Benjamin"},{"last_name":"Killip","full_name":"Killip, Rowan","first_name":"Rowan"},{"last_name":"Visan","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","full_name":"Visan, Monica","first_name":"Monica"}],"scopus_import":"1","OA_place":"repository","article_processing_charge":"No","arxiv":1,"external_id":{"arxiv":["2106.13333"]},"publication_status":"published","OA_type":"green","language":[{"iso":"eng"}],"day":"01","citation":{"chicago":"Harrop-Griffiths, Benjamin, Rowan Killip, and Monica Vişan. “Large-Data Equicontinuity for the Derivative NLS.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2023. <a href=\"https://doi.org/10.1093/imrn/rnab374\">https://doi.org/10.1093/imrn/rnab374</a>.","ama":"Harrop-Griffiths B, Killip R, Vişan M. Large-data equicontinuity for the derivative NLS. <i>International Mathematics Research Notices</i>. 2023;2023(6):4601-4642. doi:<a href=\"https://doi.org/10.1093/imrn/rnab374\">10.1093/imrn/rnab374</a>","apa":"Harrop-Griffiths, B., Killip, R., &#38; Vişan, M. (2023). Large-data equicontinuity for the derivative NLS. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnab374\">https://doi.org/10.1093/imrn/rnab374</a>","ieee":"B. Harrop-Griffiths, R. Killip, and M. Vişan, “Large-data equicontinuity for the derivative NLS,” <i>International Mathematics Research Notices</i>, vol. 2023, no. 6. Oxford University Press, pp. 4601–4642, 2023.","short":"B. Harrop-Griffiths, R. Killip, M. Vişan, International Mathematics Research Notices 2023 (2023) 4601–4642.","ista":"Harrop-Griffiths B, Killip R, Vişan M. 2023. Large-data equicontinuity for the derivative NLS. International Mathematics Research Notices. 2023(6), 4601–4642.","mla":"Harrop-Griffiths, Benjamin, et al. “Large-Data Equicontinuity for the Derivative NLS.” <i>International Mathematics Research Notices</i>, vol. 2023, no. 6, Oxford University Press, 2023, pp. 4601–42, doi:<a href=\"https://doi.org/10.1093/imrn/rnab374\">10.1093/imrn/rnab374</a>."},"month":"03","title":"Large-data equicontinuity for the derivative NLS","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-03-01T00:00:00Z","abstract":[{"text":"We consider the derivative nonlinear Schrödinger equation in one spatial dimension, which is known to be completely integrable. We prove that the orbits of L^2 bounded and equicontinuous sets of initial data remain bounded and equicontinuous, not only under this flow, but also under the entire hierarchy. This allows us to remove the small-data restriction from prior conservation laws and global well-posedness results.","lang":"eng"}],"year":"2023","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"type":"journal_article","publisher":"Oxford University Press","page":"4601-4642","date_updated":"2026-06-30T10:56:42Z","article_type":"original","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2106.13333","open_access":"1"}],"extern":"1","oa":1,"das_tickbox":"1","publication":"International Mathematics Research Notices","volume":2023,"date_created":"2026-06-19T08:22:03Z","issue":"6"},{"doi":"10.5194/egusphere-egu23-6157","author":[{"full_name":"Polesello, Andrea","first_name":"Andrea","last_name":"Polesello","id":"74c777f4-32da-11ee-b498-874db0835561"},{"full_name":"Muller, Caroline J","first_name":"Caroline J","last_name":"Muller","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","orcid":"0000-0001-5836-5350"},{"first_name":"Claudia","full_name":"Pasquero, Claudia","last_name":"Pasquero"},{"last_name":"Meroni","full_name":"Meroni, Agostino N.","first_name":"Agostino N."}],"status":"public","_id":"14863","corr_author":"1","oa_version":"Published Version","ddc":["550"],"fulldoi":"https://doi.org/10.5194/egusphere-egu23-6157","conference":{"location":"Vienna, Austria & Virtual","end_date":"2023-04-28","name":"EGU General Assembly","start_date":"2023-04-23"},"article_number":"EGU23-6157","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"No","day":"13","language":[{"iso":"eng"}],"publication_status":"published","department":[{"_id":"CaMu"},{"_id":"GradSch"}],"file_date_updated":"2024-01-24T11:19:54Z","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-04-13T00:00:00Z","title":"Intensification mechanisms of tropical cyclones","citation":{"ista":"Polesello A, Muller CJ, Pasquero C, Meroni AN. 2023. Intensification mechanisms of tropical cyclones. EGU General Assembly 2023. EGU General Assembly, EGU23-6157.","mla":"Polesello, Andrea, et al. “Intensification Mechanisms of Tropical Cyclones.” <i>EGU General Assembly 2023</i>, EGU23-6157, European Geosciences Union, 2023, doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-6157\">10.5194/egusphere-egu23-6157</a>.","ama":"Polesello A, Muller CJ, Pasquero C, Meroni AN. Intensification mechanisms of tropical cyclones. In: <i>EGU General Assembly 2023</i>. European Geosciences Union; 2023. doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-6157\">10.5194/egusphere-egu23-6157</a>","chicago":"Polesello, Andrea, Caroline J Muller, Claudia Pasquero, and Agostino N. Meroni. “Intensification Mechanisms of Tropical Cyclones.” In <i>EGU General Assembly 2023</i>. European Geosciences Union, 2023. <a href=\"https://doi.org/10.5194/egusphere-egu23-6157\">https://doi.org/10.5194/egusphere-egu23-6157</a>.","ieee":"A. Polesello, C. J. Muller, C. Pasquero, and A. N. Meroni, “Intensification mechanisms of tropical cyclones,” in <i>EGU General Assembly 2023</i>, Vienna, Austria &#38; Virtual, 2023.","short":"A. Polesello, C.J. Muller, C. Pasquero, A.N. Meroni, in:, EGU General Assembly 2023, European Geosciences Union, 2023.","apa":"Polesello, A., Muller, C. J., Pasquero, C., &#38; Meroni, A. N. (2023). Intensification mechanisms of tropical cyclones. In <i>EGU General Assembly 2023</i>. Vienna, Austria &#38; Virtual: European Geosciences Union. <a href=\"https://doi.org/10.5194/egusphere-egu23-6157\">https://doi.org/10.5194/egusphere-egu23-6157</a>"},"month":"04","type":"conference_abstract","publisher":"European Geosciences Union","file":[{"access_level":"open_access","success":1,"file_size":296769,"content_type":"application/pdf","checksum":"8cb88c1bc80ccee328478a62064d98f7","creator":"dernst","relation":"main_file","file_name":"2023_EGU_Polesello.pdf","file_id":"14883","date_updated":"2024-01-24T11:19:54Z","date_created":"2024-01-24T11:19:54Z"}],"date_updated":"2026-07-02T06:42:45Z","oa":1,"date_created":"2024-01-22T12:08:12Z","publication":"EGU General Assembly 2023","has_accepted_license":"1"},{"year":"2023","date_created":"2026-06-22T12:19:10Z","date_published":"2023-09-14T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","publication":"EGU General Assembly 2023","citation":{"ista":"Muñoz Hermosilla JM, De Andrés E, Shahateet K, Otero J, Navarro FJ. 2023. A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard. EGU General Assembly 2023. EGU General Assembly, EGU23-5510.","mla":"Muñoz Hermosilla, José M., et al. “A 3D Glacier Dynamics-Line Plume Model to Estimate the Frontal Ablation of Hansbreen, Svalbard.” <i>EGU General Assembly 2023</i>, EGU23-5510, European Geosciences Union, 2023, doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-5510\">10.5194/egusphere-egu23-5510</a>.","ama":"Muñoz Hermosilla JM, De Andrés E, Shahateet K, Otero J, Navarro FJ. A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard. In: <i>EGU General Assembly 2023</i>. European Geosciences Union; 2023. doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-5510\">10.5194/egusphere-egu23-5510</a>","chicago":"Muñoz Hermosilla, José M, Eva De Andrés, Kaian Shahateet, Jaime Otero, and Francisco J. Navarro. “A 3D Glacier Dynamics-Line Plume Model to Estimate the Frontal Ablation of Hansbreen, Svalbard.” In <i>EGU General Assembly 2023</i>. European Geosciences Union, 2023. <a href=\"https://doi.org/10.5194/egusphere-egu23-5510\">https://doi.org/10.5194/egusphere-egu23-5510</a>.","ieee":"J. M. Muñoz Hermosilla, E. De Andrés, K. Shahateet, J. Otero, and F. J. Navarro, “A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard,” in <i>EGU General Assembly 2023</i>, Vienna, Austria &#38; Virtual, 2023.","apa":"Muñoz Hermosilla, J. M., De Andrés, E., Shahateet, K., Otero, J., &#38; Navarro, F. J. (2023). A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard. In <i>EGU General Assembly 2023</i>. Vienna, Austria &#38; Virtual: European Geosciences Union. <a href=\"https://doi.org/10.5194/egusphere-egu23-5510\">https://doi.org/10.5194/egusphere-egu23-5510</a>","short":"J.M. Muñoz Hermosilla, E. De Andrés, K. Shahateet, J. Otero, F.J. Navarro, in:, EGU General Assembly 2023, European Geosciences Union, 2023."},"title":"A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard","month":"09","extern":"1","day":"14","language":[{"iso":"eng"}],"OA_type":"gold","publication_status":"published","conference":{"start_date":"2023-04-23","name":"EGU General Assembly","location":"Vienna, Austria & Virtual","end_date":"2023-04-28"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_number":"EGU23-5510","OA_place":"publisher","article_processing_charge":"No","date_updated":"2026-07-02T07:13:16Z","author":[{"orcid":"0000-0002-1990-8508","id":"e1037a6d-646e-11ef-b402-e0ed9ab0901e","last_name":"Muñoz Hermosilla","first_name":"José M","full_name":"Muñoz Hermosilla, José M"},{"last_name":"De Andrés","full_name":"De Andrés, Eva","first_name":"Eva"},{"last_name":"Shahateet","first_name":"Kaian","full_name":"Shahateet, Kaian"},{"first_name":"Jaime","full_name":"Otero, Jaime","last_name":"Otero"},{"full_name":"Navarro, Francisco J.","first_name":"Francisco J.","last_name":"Navarro"}],"_id":"22125","status":"public","related_material":{"record":[{"id":"22123","status":"public","relation":"later_version"}]},"doi":"10.5194/egusphere-egu23-5510","publisher":"European Geosciences Union","oa_version":"None","type":"conference_abstract","ddc":["550"],"fulldoi":"https://doi.org/10.5194/egusphere-egu23-5510"},{"file":[{"file_size":707344,"content_type":"application/pdf","access_level":"open_access","success":1,"creator":"dernst","relation":"main_file","checksum":"b0590aff6e7ec89cc149ba94d459d3a3","date_updated":"2024-01-09T09:25:34Z","file_id":"14764","file_name":"2023_QuantumTopol_Carqueville.pdf","date_created":"2024-01-09T09:25:34Z"}],"article_type":"original","date_updated":"2026-07-06T11:52:15Z","page":"467-532","keyword":["Geometry and Topology","Mathematical Physics"],"type":"journal_article","publisher":"EMS Press","isi":1,"publication_identifier":{"issn":["1663-487X"]},"date_created":"2024-01-08T13:14:48Z","issue":"3","volume":14,"das_tickbox":"1","publication":"Quantum Topology","acknowledgement":"N.C. is supported by the DFG Heisenberg Programme.\r\nWe are grateful to Tobias Dyckerhoff, Lukas Müller, Ingo Runkel, and Christopher Schommer-Pries for helpful discussions.","has_accepted_license":"1","oa":1,"external_id":{"isi":["001104620800003"]},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"Yes","scopus_import":"1","intvolume":"        14","doi":"10.4171/qt/193","status":"public","_id":"14756","author":[{"full_name":"Carqueville, Nils","first_name":"Nils","last_name":"Carqueville"},{"last_name":"Szegedy","orcid":"0000-0003-2834-5054","id":"7943226E-220E-11EA-94C7-D59F3DDC885E","full_name":"Szegedy, Lorant","first_name":"Lorant"}],"quality_controlled":"1","corr_author":"1","oa_version":"Published Version","ddc":["530"],"fulldoi":"https://doi.org/10.4171/qt/193","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-10-16T00:00:00Z","abstract":[{"lang":"eng","text":"We prove the r-spin cobordism hypothesis in the setting of (weak) 2-categories for every positive integer r: the 2-groupoid of 2-dimensional fully extended r-spin TQFTs with given target is equivalent to the homotopy fixed points of an induced Spin 2r -action. In particular, such TQFTs are classified by fully dualisable objects together with a trivialisation of the rth power of their Serre automorphisms. For r=1, we recover the oriented case (on which our proof builds), while ordinary spin structures correspond to r=2.\r\nTo construct examples, we explicitly describe Spin 2r​-homotopy fixed points in the equivariant completion of any symmetric monoidal 2-category. We also show that every object in a 2-category of Landau–Ginzburg models gives rise to fully extended spin TQFTs and that half of these do not factor through the oriented bordism 2-category."}],"title":"Fully extended r-spin TQFTs","month":"10","citation":{"short":"N. Carqueville, L. Szegedy, Quantum Topology 14 (2023) 467–532.","ieee":"N. Carqueville and L. Szegedy, “Fully extended r-spin TQFTs,” <i>Quantum Topology</i>, vol. 14, no. 3. EMS Press, pp. 467–532, 2023.","apa":"Carqueville, N., &#38; Szegedy, L. (2023). Fully extended r-spin TQFTs. <i>Quantum Topology</i>. EMS Press. <a href=\"https://doi.org/10.4171/qt/193\">https://doi.org/10.4171/qt/193</a>","ama":"Carqueville N, Szegedy L. Fully extended r-spin TQFTs. <i>Quantum Topology</i>. 2023;14(3):467-532. doi:<a href=\"https://doi.org/10.4171/qt/193\">10.4171/qt/193</a>","chicago":"Carqueville, Nils, and Lorant Szegedy. “Fully Extended R-Spin TQFTs.” <i>Quantum Topology</i>. EMS Press, 2023. <a href=\"https://doi.org/10.4171/qt/193\">https://doi.org/10.4171/qt/193</a>.","ista":"Carqueville N, Szegedy L. 2023. Fully extended r-spin TQFTs. Quantum Topology. 14(3), 467–532.","mla":"Carqueville, Nils, and Lorant Szegedy. “Fully Extended R-Spin TQFTs.” <i>Quantum Topology</i>, vol. 14, no. 3, EMS Press, 2023, pp. 467–532, doi:<a href=\"https://doi.org/10.4171/qt/193\">10.4171/qt/193</a>."},"language":[{"iso":"eng"}],"day":"16","publication_status":"published","department":[{"_id":"MiLe"}],"file_date_updated":"2024-01-09T09:25:34Z"},{"publication_identifier":{"eissn":["2475-1421"]},"type":"journal_article","publisher":"Association for Computing Machinery","date_updated":"2026-07-06T12:12:08Z","file":[{"date_created":"2023-07-03T13:09:39Z","file_id":"13187","file_name":"2023_ACMProgram.Lang._Koval.pdf","date_updated":"2023-07-03T13:09:39Z","checksum":"5dba6e73f0ed79adbdae14d165bc2f68","relation":"main_file","creator":"alisjak","success":1,"access_level":"open_access","file_size":1266773,"content_type":"application/pdf"}],"article_type":"original","oa":1,"volume":7,"publication":"Proceedings of the ACM on Programming Languages","das_tickbox":"1","has_accepted_license":"1","date_created":"2023-07-02T22:00:43Z","ddc":["000"],"fulldoi":"https://doi.org/10.1145/3591230","doi":"10.1145/3591230","intvolume":"         7","_id":"13179","status":"public","quality_controlled":"1","author":[{"first_name":"Nikita","full_name":"Koval, Nikita","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","last_name":"Koval"},{"full_name":"Khalanskiy, Dmitry","first_name":"Dmitry","last_name":"Khalanskiy"},{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh"}],"corr_author":"1","oa_version":"Published Version","article_processing_charge":"No","scopus_import":"1","article_number":"116","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","department":[{"_id":"DaAl"}],"file_date_updated":"2023-07-03T13:09:39Z","language":[{"iso":"eng"}],"day":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Writing concurrent code that is both correct and efficient is notoriously difficult. Thus, programmers often prefer to use synchronization abstractions, which render code simpler and easier to reason about. Despite a wealth of work on this topic, there is still a gap between the rich semantics provided by synchronization abstractions in modern programming languages—specifically, fair FIFO ordering of synchronization requests and support for abortable operations—and frameworks for implementing it correctly and efficiently. Supporting such semantics is critical given the rising popularity of constructs for asynchronous programming, such as coroutines, which abort frequently and are cheaper to suspend and resume compared to native threads.\r\n\r\nThis paper introduces a new framework called CancellableQueueSynchronizer (CQS), which enables simple yet efficient implementations of a wide range of fair and abortable synchronization primitives: mutexes, semaphores, barriers, count-down latches, and blocking pools. Our main contribution is algorithmic, as implementing both fairness and abortability efficiently at this level of generality is non-trivial. Importantly, all our algorithms, including the CQS framework and the primitives built on top of it, come with formal proofs in the Iris framework for Coq for many of their properties. These proofs are modular, so it is easy to show correctness for new primitives implemented on top of CQS. From a practical perspective, implementation of CQS for native threads on the JVM improves throughput by up to two orders of magnitude over Java’s AbstractQueuedSynchronizer, the only practical abstraction offering similar semantics. Further, we successfully integrated CQS as a core component of the popular Kotlin Coroutines library, validating the framework’s practical impact and expressiveness in a real-world environment. In sum, CancellableQueueSynchronizer is the first framework to combine expressiveness with formal guarantees and solid practical performance. Our approach should be extensible to other languages and families of synchronization primitives.","lang":"eng"}],"date_published":"2023-06-06T00:00:00Z","citation":{"ista":"Koval N, Khalanskiy D, Alistarh D-A. 2023. CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. 7, 116.","mla":"Koval, Nikita, et al. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 7, 116, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3591230\">10.1145/3591230</a>.","short":"N. Koval, D. Khalanskiy, D.-A. Alistarh, Proceedings of the ACM on Programming Languages 7 (2023).","ieee":"N. Koval, D. Khalanskiy, and D.-A. Alistarh, “CQS: A formally-verified framework for fair and abortable synchronization,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 7. Association for Computing Machinery, 2023.","apa":"Koval, N., Khalanskiy, D., &#38; Alistarh, D.-A. (2023). CQS: A formally-verified framework for fair and abortable synchronization. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3591230\">https://doi.org/10.1145/3591230</a>","ama":"Koval N, Khalanskiy D, Alistarh D-A. CQS: A formally-verified framework for fair and abortable synchronization. <i>Proceedings of the ACM on Programming Languages</i>. 2023;7. doi:<a href=\"https://doi.org/10.1145/3591230\">10.1145/3591230</a>","chicago":"Koval, Nikita, Dmitry Khalanskiy, and Dan-Adrian Alistarh. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3591230\">https://doi.org/10.1145/3591230</a>."},"month":"06","title":"CQS: A formally-verified framework for fair and abortable synchronization","year":"2023"},{"year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-01-12T00:00:00Z","abstract":[{"text":"The sinkless orientation problem plays a key role in understanding the foundations of distributed computing. The problem can be used to separate two fundamental models of distributed graph algorithms, LOCAL and SLOCAL: the locality of sinkless orientation is Ω(log n) in the deterministic LOCAL model and O(log log n) in the deterministic SLOCAL model. Both of these results are known by prior work, but here we give new simple, self-contained proofs for them.","lang":"eng"}],"citation":{"chicago":"Balliu, Alkida, Janne Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, et al. “Sinkless Orientation Made Simple.” In <i>Symposium on Simplicity in Algorithms</i>, 175–91. Society for Industrial and Applied Mathematics, 2023. <a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">https://doi.org/10.1137/1.9781611977585.ch17</a>.","ama":"Balliu A, Korhonen J, Kuhn F, et al. Sinkless Orientation Made Simple. In: <i>Symposium on Simplicity in Algorithms</i>. Society for Industrial and Applied Mathematics; 2023:175-191. doi:<a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">10.1137/1.9781611977585.ch17</a>","apa":"Balliu, A., Korhonen, J., Kuhn, F., Lievonen, H., Olivetti, D., Pai, S., … Uitto, J. (2023). Sinkless Orientation Made Simple. In <i>Symposium on Simplicity in Algorithms</i> (pp. 175–191). Florence, Italy: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">https://doi.org/10.1137/1.9781611977585.ch17</a>","ieee":"A. Balliu <i>et al.</i>, “Sinkless Orientation Made Simple,” in <i>Symposium on Simplicity in Algorithms</i>, Society for Industrial and Applied Mathematics, 2023, pp. 175–191.","short":"A. Balliu, J. Korhonen, F. Kuhn, H. Lievonen, D. Olivetti, S. Pai, A. Paz, J. Rybicki, S. Schmid, J. Studený, J. Suomela, J. Uitto, in:, Symposium on Simplicity in Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 175–191.","ista":"Balliu A, Korhonen J, Kuhn F, Lievonen H, Olivetti D, Pai S, Paz A, Rybicki J, Schmid S, Studený J, Suomela J, Uitto J. 2023.Sinkless Orientation Made Simple. In: Symposium on Simplicity in Algorithms. , 175–191.","mla":"Balliu, Alkida, et al. “Sinkless Orientation Made Simple.” <i>Symposium on Simplicity in Algorithms</i>, Society for Industrial and Applied Mathematics, 2023, pp. 175–91, doi:<a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">10.1137/1.9781611977585.ch17</a>."},"title":"Sinkless Orientation Made Simple","month":"01","language":[{"iso":"eng"}],"day":"12","project":[{"call_identifier":"H2020","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"},{"grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer"}],"OA_type":"green","publication_status":"published","department":[{"_id":"DaAl"}],"conference":{"start_date":"2023-01-23","name":"SOSA: Symposium on Simplicity in Algorithms","end_date":"2023-01-25","location":"Florence, Italy"},"external_id":{"arxiv":["2108.02655"]},"article_processing_charge":"No","OA_place":"repository","arxiv":1,"doi":"10.1137/1.9781611977585.ch17","quality_controlled":"1","_id":"19983","status":"public","author":[{"last_name":"Balliu","first_name":"Alkida","full_name":"Balliu, Alkida"},{"last_name":"Korhonen","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","full_name":"Korhonen, Janne","first_name":"Janne"},{"last_name":"Kuhn","first_name":"Fabian","full_name":"Kuhn, Fabian"},{"last_name":"Lievonen","first_name":"Henrik","full_name":"Lievonen, Henrik"},{"last_name":"Olivetti","first_name":"Dennis","full_name":"Olivetti, Dennis"},{"first_name":"Shreyas","full_name":"Pai, Shreyas","last_name":"Pai"},{"first_name":"Ami","full_name":"Paz, Ami","last_name":"Paz"},{"last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel","first_name":"Joel"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"first_name":"Jan","full_name":"Studený, Jan","last_name":"Studený"},{"first_name":"Jukka","full_name":"Suomela, Jukka","last_name":"Suomela"},{"full_name":"Uitto, Jara","first_name":"Jara","last_name":"Uitto"}],"oa_version":"Preprint","fulldoi":"https://doi.org/10.1137/1.9781611977585.ch17","date_created":"2025-07-10T13:11:47Z","ec_funded":1,"publication":"Symposium on Simplicity in Algorithms","das_tickbox":"1","acknowledgement":"We thank the anonymous reviewers for their helpful feedback on previous versions of this work. Parts ofthis work appeared in DISC 2021 as a brief announcement [ 21]. This work was supported in part by theEuropean Research Council (ERC) under the European Union’s Horizon 2020 research and innovationprogramme (grant agreement No 805223 ScaleML), the Academy of Finland (grant agreement No 333837),the Austrian Science Fund (FWF) and netIDEE (grant agreement No P 33775-N), and the AustrianScience Fund (FWF) project DELTA (grant agreement No I 5025-N).","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2108.02655","open_access":"1"}],"date_updated":"2026-07-06T11:57:38Z","page":"175-191","type":"book_chapter","publisher":"Society for Industrial and Applied Mathematics","publication_identifier":{"eisbn":["9781611977585"]}},{"year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"The ages of solar-like stars have been at the center of many studies such as exoplanet characterization or Galactic-archeology. While ages are usually computed from stellar evolution models, relations linking ages to other stellar properties, such as rotation and magnetic activity, have been investigated. With the large catalog of 55,232 rotation periods, Prot, and photometric magnetic activity index, Sph from Kepler data, we have the opportunity to look for such magneto-gyro-chronology relations. Stellar ages are obtained with two stellar evolution codes that include treatment of angular momentum evolution, hence using Prot as input in addition to classical atmospheric parameters. We explore two different ways of predicting stellar ages on three subsamples with spectroscopic observations: solar analogs, late-F and G dwarfs, and K dwarfs. We first perform a Bayesian analysis to derive relations between Sph and ages between 1 and 5 Gyr, and other stellar properties. For late-F and G dwarfs, and K dwarfs, the multivariate regression favors the model with Prot and Sph with median differences of 0.1% and 0.2%, respectively. We also apply Machine Learning techniques with a Random Forest algorithm to predict ages up to 14 Gyr with the same set of input parameters. For late-F, G and K dwarfs together, predicted ages are on average within 5.3% of the model ages and improve to 3.1% when including Prot. These are very promising results for a quick age estimation for solar-like stars with photometric observations, especially with current and future space missions.","lang":"eng"}],"date_published":"2023-08-01T00:00:00Z","citation":{"ama":"Mathur S, Claytor ZR, Santos ÂRG, et al. Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. <i>The Astrophysical Journal</i>. 2023;952(2). doi:<a href=\"https://doi.org/10.3847/1538-4357/acd118\">10.3847/1538-4357/acd118</a>","chicago":"Mathur, Savita, Zachary R. Claytor, Ângela R. G. Santos, Rafael A. García, Louis Amard, Lisa Annabelle Bugnet, Enrico Corsaro, et al. “Magnetic Activity Evolution of Solar-like Stars. I. Sph–Age Relation Derived from Kepler Observations.” <i>The Astrophysical Journal</i>. IOP Publishing, 2023. <a href=\"https://doi.org/10.3847/1538-4357/acd118\">https://doi.org/10.3847/1538-4357/acd118</a>.","apa":"Mathur, S., Claytor, Z. R., Santos, Â. R. G., García, R. A., Amard, L., Bugnet, L. A., … van Saders, J. (2023). Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. <i>The Astrophysical Journal</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-4357/acd118\">https://doi.org/10.3847/1538-4357/acd118</a>","short":"S. Mathur, Z.R. Claytor, Â.R.G. Santos, R.A. García, L. Amard, L.A. Bugnet, E. Corsaro, A. Bonanno, S.N. Breton, D. Godoy-Rivera, M.H. Pinsonneault, J. van Saders, The Astrophysical Journal 952 (2023).","ieee":"S. Mathur <i>et al.</i>, “Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations,” <i>The Astrophysical Journal</i>, vol. 952, no. 2. IOP Publishing, 2023.","mla":"Mathur, Savita, et al. “Magnetic Activity Evolution of Solar-like Stars. I. Sph–Age Relation Derived from Kepler Observations.” <i>The Astrophysical Journal</i>, vol. 952, no. 2, 131, IOP Publishing, 2023, doi:<a href=\"https://doi.org/10.3847/1538-4357/acd118\">10.3847/1538-4357/acd118</a>.","ista":"Mathur S, Claytor ZR, Santos ÂRG, García RA, Amard L, Bugnet LA, Corsaro E, Bonanno A, Breton SN, Godoy-Rivera D, Pinsonneault MH, van Saders J. 2023. Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. The Astrophysical Journal. 952(2), 131."},"title":"Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations","month":"08","day":"01","language":[{"iso":"eng"}],"publication_status":"published","department":[{"_id":"LiBu"}],"file_date_updated":"2023-08-02T07:42:26Z","external_id":{"isi":["001034185700001"]},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_number":"131","article_processing_charge":"Yes","scopus_import":"1","doi":"10.3847/1538-4357/acd118","intvolume":"       952","_id":"13443","quality_controlled":"1","status":"public","author":[{"full_name":"Mathur, Savita","first_name":"Savita","last_name":"Mathur"},{"first_name":"Zachary R.","full_name":"Claytor, Zachary R.","last_name":"Claytor"},{"full_name":"Santos, Ângela R. G.","first_name":"Ângela R. G.","last_name":"Santos"},{"full_name":"García, Rafael A.","first_name":"Rafael A.","last_name":"García"},{"last_name":"Amard","first_name":"Louis","full_name":"Amard, Louis"},{"full_name":"Bugnet, Lisa Annabelle","first_name":"Lisa Annabelle","last_name":"Bugnet","orcid":"0000-0003-0142-4000","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"full_name":"Corsaro, Enrico","first_name":"Enrico","last_name":"Corsaro"},{"last_name":"Bonanno","first_name":"Alfio","full_name":"Bonanno, Alfio"},{"full_name":"Breton, Sylvain N.","first_name":"Sylvain N.","last_name":"Breton"},{"full_name":"Godoy-Rivera, Diego","first_name":"Diego","last_name":"Godoy-Rivera"},{"full_name":"Pinsonneault, Marc H.","first_name":"Marc H.","last_name":"Pinsonneault"},{"first_name":"Jennifer","full_name":"van Saders, Jennifer","last_name":"van Saders"}],"oa_version":"Published Version","ddc":["520"],"fulldoi":"https://doi.org/10.3847/1538-4357/acd118","date_created":"2023-08-01T14:19:16Z","issue":"2","volume":952,"publication":"The Astrophysical Journal","das_tickbox":"1","acknowledgement":"This paper includes data collected by the Kepler mission and obtained from the MAST data archive at the Space Telescope Science Institute (STScI). Funding for the Kepler mission is provided by the NASA Science Mission Directorate. STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5–26555. We acknowledge that this research was supported in part by the National Science Foundation under grant No. NSF PHY-1748958. S.M. acknowledges support from the Spanish Ministry of Science and Innovation (MICINN) with the Ramón y Cajal fellowship No. RYC-2015-17697, the grant No. PID2019-107061GB-C66, and through AEI under the Severo Ochoa Centres of Excellence Programme 2020–2023 (CEX2019-000920-S). S.M. and D.G.R. acknowledge support from the Spanish Ministry of Science and Innovation (MICINN) with the grant No. PID2019-107187GB-I00. Z.R.C. acknowledges support from National Aeronautics and Space Administration via the TESS Guest Investigator Program (grant No. 80NSSC18K18584). The work presented here was partially supported by the NASA grant NNX17AF27G. A.R.G.S. acknowledges the support by FCT through national funds and by FEDER through COMPETE2020 by the following grants: UIDB/04434/2020 and UIDP/04434/2020. A.R.G.S. is supported by FCT through the work contract No. 2020.02480.CEECIND/CP1631/CT0001. R.A.G., L.A., and S.N.B. acknowledge the support from PLATO and GOLF CNES grants. S.N.B. acknowledges support from PLATO ASI-INAF agreement No. 2015-019-R.1-2018.","has_accepted_license":"1","oa":1,"file":[{"date_updated":"2023-08-02T07:42:26Z","file_id":"13448","file_name":"2023_AstrophysicalJour_Mathur.pdf","date_created":"2023-08-02T07:42:26Z","file_size":4192386,"content_type":"application/pdf","success":1,"access_level":"open_access","relation":"main_file","creator":"dernst","checksum":"f12452834d7ed6748dbf5ace18af4723"}],"article_type":"original","date_updated":"2026-07-06T12:20:17Z","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"type":"journal_article","publisher":"IOP Publishing","publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"isi":1},{"oa":1,"date_created":"2023-05-02T07:58:57Z","alternative_title":["ISTA Thesis"],"ec_funded":1,"has_accepted_license":"1","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"12237"},{"id":"10806","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"10123","relation":"part_of_dissertation"},{"status":"public","id":"9118","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"10042","status":"public"}]},"page":"82","publisher":"Institute of Science and Technology Austria","type":"dissertation","degree_awarded":"PhD","publication_identifier":{"isbn":["978-3-99078-028-2"],"issn":["2663-337X"]},"file":[{"date_updated":"2023-05-02T07:43:18Z","file_id":"12887","file_name":"Thesis_Calcabrini.docx","date_created":"2023-05-02T07:43:18Z","file_size":99627036,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","creator":"mcalcabr","relation":"source_file","checksum":"9347b0e09425f56fdcede5d3528404dc"},{"file_size":8742220,"content_type":"application/pdf","success":1,"access_level":"open_access","relation":"main_file","creator":"mcalcabr","checksum":"2d188b76621086cd384f0b9264b0a576","date_updated":"2023-05-02T07:42:45Z","file_id":"12888","file_name":"Thesis_Calcabrini_pdfa.pdf","date_created":"2023-05-02T07:42:45Z"}],"date_updated":"2026-07-06T12:16:05Z","project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385"}],"day":"28","language":[{"iso":"eng"}],"publication_status":"published","department":[{"_id":"GradSch"},{"_id":"MaIb"}],"file_date_updated":"2023-05-02T07:43:18Z","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"NanoFab"}],"year":"2023","date_published":"2023-04-28T00:00:00Z","abstract":[{"text":"High-performance semiconductors rely upon precise control of heat and charge transport. This can be achieved by precisely engineering defects in polycrystalline solids. There are multiple approaches to preparing such polycrystalline semiconductors, and the transformation of solution-processed colloidal nanoparticles is appealing because colloidal nanoparticles combine low cost with structural and compositional tunability along with rich surface chemistry. However, the multiple processes from nanoparticle synthesis to the final bulk nanocomposites are very complex. They involve nanoparticle purification, post-synthetic modifications, and finally consolidation (thermal treatments and densification). All these properties dictate the final material’s composition and microstructure, ultimately affecting its functional properties. This thesis explores the synthesis, surface chemistry and consolidation of colloidal semiconductor nanoparticles into dense solids. In particular, the transformations that take place during these processes, and their effect on the material’s transport properties are evaluated. ","lang":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"04","title":"Nanoparticle-based semiconductor solids: From synthesis to consolidation","citation":{"mla":"Calcabrini, Mariano. <i>Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/at:ista:12885\">10.15479/at:ista:12885</a>.","ista":"Calcabrini M. 2023. Nanoparticle-based semiconductor solids: From synthesis to consolidation. Institute of Science and Technology Austria.","chicago":"Calcabrini, Mariano. “Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/at:ista:12885\">https://doi.org/10.15479/at:ista:12885</a>.","ama":"Calcabrini M. Nanoparticle-based semiconductor solids: From synthesis to consolidation. 2023. doi:<a href=\"https://doi.org/10.15479/at:ista:12885\">10.15479/at:ista:12885</a>","apa":"Calcabrini, M. (2023). <i>Nanoparticle-based semiconductor solids: From synthesis to consolidation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12885\">https://doi.org/10.15479/at:ista:12885</a>","ieee":"M. Calcabrini, “Nanoparticle-based semiconductor solids: From synthesis to consolidation,” Institute of Science and Technology Austria, 2023.","short":"M. Calcabrini, Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation, Institute of Science and Technology Austria, 2023."},"_id":"12885","status":"public","author":[{"last_name":"Calcabrini","id":"45D7531A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4566-5877","full_name":"Calcabrini, Mariano","first_name":"Mariano"}],"doi":"10.15479/at:ista:12885","oa_version":"Published Version","corr_author":"1","ddc":["546","541"],"supervisor":[{"first_name":"Maria","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","last_name":"Ibáñez"}],"fulldoi":"https://doi.org/10.15479/at:ista:12885","article_processing_charge":"No","OA_place":"publisher"},{"publication_status":"published","department":[{"_id":"GaTk"}],"file_date_updated":"2024-01-30T14:07:08Z","day":"31","language":[{"iso":"eng"}],"project":[{"grant_number":"M03318","name":"Functional Advantages of Critical Brain Dynamics","_id":"eb943429-77a9-11ec-83b8-9f471cdf5c67"},{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Alpha oscillations are a distinctive feature of the awake resting state of the human brain. However, their functional role in resting-state neuronal dynamics remains poorly understood. Here we show that, during resting wakefulness, alpha oscillations drive an alternation of attenuation and amplification bouts in neural activity. Our analysis indicates that inhibition is activated in pulses that last for a single alpha cycle and gradually suppress neural activity, while excitation is successively enhanced over a few alpha cycles to amplify neural activity. Furthermore, we show that long-term alpha amplitude fluctuations—the “waxing and waning” phenomenon—are an attenuation-amplification mechanism described by a power-law decay of the activity rate in the “waning” phase. Importantly, we do not observe such dynamics during non-rapid eye movement (NREM) sleep with marginal alpha oscillations. The results suggest that alpha oscillations modulate neural activity not only through pulses of inhibition (pulsed inhibition hypothesis) but also by timely enhancement of excitation (or disinhibition)."}],"date_published":"2023-10-31T00:00:00Z","month":"10","citation":{"mla":"Lombardi, Fabrizio, et al. “Beyond Pulsed Inhibition: Alpha Oscillations Modulate Attenuation and Amplification of Neural Activity in the Awake Resting State.” <i>Cell Reports</i>, vol. 42, no. 10, 113162, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.celrep.2023.113162\">10.1016/j.celrep.2023.113162</a>.","ista":"Lombardi F, Herrmann HJ, Parrino L, Plenz D, Scarpetta S, Vaudano AE, De Arcangelis L, Shriki O. 2023. Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state. Cell Reports. 42(10), 113162.","ama":"Lombardi F, Herrmann HJ, Parrino L, et al. Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state. <i>Cell Reports</i>. 2023;42(10). doi:<a href=\"https://doi.org/10.1016/j.celrep.2023.113162\">10.1016/j.celrep.2023.113162</a>","chicago":"Lombardi, Fabrizio, Hans J. Herrmann, Liborio Parrino, Dietmar Plenz, Silvia Scarpetta, Anna Elisabetta Vaudano, Lucilla De Arcangelis, and Oren Shriki. “Beyond Pulsed Inhibition: Alpha Oscillations Modulate Attenuation and Amplification of Neural Activity in the Awake Resting State.” <i>Cell Reports</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.celrep.2023.113162\">https://doi.org/10.1016/j.celrep.2023.113162</a>.","short":"F. Lombardi, H.J. Herrmann, L. Parrino, D. Plenz, S. Scarpetta, A.E. Vaudano, L. De Arcangelis, O. Shriki, Cell Reports 42 (2023).","apa":"Lombardi, F., Herrmann, H. J., Parrino, L., Plenz, D., Scarpetta, S., Vaudano, A. E., … Shriki, O. (2023). Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state. <i>Cell Reports</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.celrep.2023.113162\">https://doi.org/10.1016/j.celrep.2023.113162</a>","ieee":"F. Lombardi <i>et al.</i>, “Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state,” <i>Cell Reports</i>, vol. 42, no. 10. Elsevier, 2023."},"title":"Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state","year":"2023","ddc":["570"],"fulldoi":"https://doi.org/10.1016/j.celrep.2023.113162","intvolume":"        42","doi":"10.1016/j.celrep.2023.113162","_id":"14402","quality_controlled":"1","author":[{"id":"A057D288-3E88-11E9-986D-0CF4E5697425","orcid":"0000-0003-2623-5249","last_name":"Lombardi","first_name":"Fabrizio","full_name":"Lombardi, Fabrizio"},{"last_name":"Herrmann","full_name":"Herrmann, Hans J.","first_name":"Hans J."},{"last_name":"Parrino","first_name":"Liborio","full_name":"Parrino, Liborio"},{"full_name":"Plenz, Dietmar","first_name":"Dietmar","last_name":"Plenz"},{"last_name":"Scarpetta","first_name":"Silvia","full_name":"Scarpetta, Silvia"},{"full_name":"Vaudano, Anna Elisabetta","first_name":"Anna Elisabetta","last_name":"Vaudano"},{"last_name":"De Arcangelis","full_name":"De Arcangelis, Lucilla","first_name":"Lucilla"},{"full_name":"Shriki, Oren","first_name":"Oren","last_name":"Shriki"}],"status":"public","corr_author":"1","oa_version":"Published Version","article_processing_charge":"Yes","scopus_import":"1","external_id":{"isi":["001086695500001"],"pmid":["37777965"]},"article_number":"113162","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"ec_funded":1,"volume":42,"publication":"Cell Reports","acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF) (grant PT1013M03318 to F.L.). For the purpose of open access, the author has applied a CC BY public copyright license to any Author Accepted Manuscript version arising from this submission. The study was supported by the European Union Horizon 2020 Research and Innovation Program under the Marie Sklodowska-Curie action (grant agreement 754411 to F.L.) and in part by the NextGenerationEU through the grant TAlent in ReSearch@University of Padua – STARS@UNIPD (to F.L.) (project BRAINCIP [brain criticality and information processing]). L.d.A. acknowledges support from the Italian MIUR project PRIN2017WZFTZP and partial support from NEXTGENERATIONEU (NGEU) funded by the Ministry of University and Research (MUR), National Recovery and Resilience Plan (NRRP), and project MNESYS (PE0000006)—a multiscale integrated approach to the study of the nervous system in health and disease (DN. 1553 11.10.2022). O.S. acknowledges support from the Israel Science Foundation, grant 504/17. The work was supported in part by DIRP ZIAMH02797 (to D.P.).","has_accepted_license":"1","date_created":"2023-10-08T22:01:15Z","issue":"10","pmid":1,"isi":1,"publication_identifier":{"eissn":["2211-1247"]},"related_material":{"record":[{"status":"public","id":"10821","relation":"earlier_version"}]},"type":"journal_article","publisher":"Elsevier","date_updated":"2026-07-06T12:48:55Z","file":[{"date_updated":"2024-01-30T14:07:08Z","file_name":"2023_CellReports_Lombardi.pdf","file_id":"14914","date_created":"2024-01-30T14:07:08Z","file_size":5599007,"content_type":"application/pdf","access_level":"open_access","success":1,"creator":"dernst","relation":"main_file","checksum":"9c71eb2a03aa160415f01ad95f49ceb5"}],"article_type":"original"},{"license":"https://choosealicense.com/licenses/agpl-3.0/","date_updated":"2026-07-06T12:57:43Z","file":[{"checksum":"a8b9adeb53a4109dea4d5e39fa1acccf","relation":"main_file","creator":"fschur","success":1,"access_level":"open_access","file_size":347641117,"content_type":"application/zip","date_created":"2023-11-08T20:23:07Z","file_name":"Computational_Toolbox_v1.2.zip","file_id":"14503","date_updated":"2023-11-08T20:23:07Z"},{"relation":"main_file","creator":"dernst","checksum":"14db2addbfca61a085ba301ed6f2900b","file_size":1522,"content_type":"text/plain","success":1,"access_level":"open_access","date_created":"2023-11-21T08:20:23Z","date_updated":"2023-11-21T08:20:23Z","file_id":"14586","file_name":"Readme.txt"}],"tmp":{"name":"GNU Affero General Public License v3.0","short":"GNU AGPLv3  ","legal_code_url":"https://www.gnu.org/licenses/agpl-3.0.html"},"ddc":["570"],"fulldoi":"https://doi.org/10.15479/AT:ISTA:14502","doi":"10.15479/AT:ISTA:14502","status":"public","_id":"14502","author":[{"first_name":"Georgi A","full_name":"Dimchev, Georgi A","id":"38C393BE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8370-6161","last_name":"Dimchev"},{"first_name":"Behnam","full_name":"Amiri, Behnam","last_name":"Amiri"},{"last_name":"Fäßler","id":"404F5528-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7149-769X","full_name":"Fäßler, Florian","first_name":"Florian"},{"last_name":"Falcke","full_name":"Falcke, Martin","first_name":"Martin"},{"last_name":"Schur","orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","full_name":"Schur, Florian KM","first_name":"Florian KM"}],"related_material":{"record":[{"relation":"used_for_analysis_in","id":"10290","status":"public"}]},"keyword":["cryo-electron tomography","actin cytoskeleton","toolbox"],"type":"software","corr_author":"1","publisher":"Institute of Science and Technology Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-11-21T00:00:00Z","abstract":[{"text":"A precise quantitative description of the ultrastructural characteristics underlying biological mechanisms is often key to their understanding. This is particularly true for dynamic extra- and intracellular filamentous assemblies, playing a role in cell motility, cell integrity, cytokinesis, tissue formation and maintenance. For example, genetic manipulation or modulation of actin regulatory proteins frequently manifests in changes of the morphology, dynamics, and ultrastructural architecture of actin filament-rich cell peripheral structures, such as lamellipodia or filopodia. However, the observed ultrastructural effects often remain subtle and require sufficiently large datasets for appropriate quantitative analysis. The acquisition of such large datasets has been enabled by recent advances in high-throughput cryo-electron tomography (cryo-ET) methods. This also necessitates the development of complementary approaches to maximize the extraction of relevant biological information. We have developed a computational toolbox for the semi-automatic quantification of segmented and vectorized fila- mentous networks from pre-processed cryo-electron tomograms, facilitating the analysis and cross-comparison of multiple experimental conditions. GUI-based components simplify the processing of data and allow users to obtain a large number of ultrastructural parameters describing filamentous assemblies. We demonstrate the feasibility of this workflow by analyzing cryo-ET data of untreated and chemically perturbed branched actin filament networks and that of parallel actin filament arrays. In principle, the computational toolbox presented here is applicable for data analysis comprising any type of filaments in regular (i.e. parallel) or random arrangement. We show that it can ease the identification of key differences between experimental groups and facilitate the in-depth analysis of ultrastructural data in a time-efficient manner.","lang":"eng"}],"month":"11","citation":{"apa":"Dimchev, G. A., Amiri, B., Fäßler, F., Falcke, M., &#38; Schur, F. K. (2023). Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:14502\">https://doi.org/10.15479/AT:ISTA:14502</a>","ieee":"G. A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, and F. K. Schur, “Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data.” Institute of Science and Technology Austria, 2023.","short":"G.A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, F.K. Schur, (2023).","chicago":"Dimchev, Georgi A, Behnam Amiri, Florian Fäßler, Martin Falcke, and Florian KM Schur. “Computational Toolbox for Ultrastructural Quantitative Analysis of Filament Networks in Cryo-ET Data.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/AT:ISTA:14502\">https://doi.org/10.15479/AT:ISTA:14502</a>.","ama":"Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data. 2023. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14502\">10.15479/AT:ISTA:14502</a>","ista":"Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. 2023. Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:14502\">10.15479/AT:ISTA:14502</a>.","mla":"Dimchev, Georgi A., et al. <i>Computational Toolbox for Ultrastructural Quantitative Analysis of Filament Networks in Cryo-ET Data</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14502\">10.15479/AT:ISTA:14502</a>."},"title":"Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data","has_accepted_license":"1","year":"2023","date_created":"2023-11-08T19:40:54Z","file_date_updated":"2023-11-21T08:20:23Z","department":[{"_id":"FlSc"}],"day":"21","project":[{"grant_number":"P33367","name":"Structure and isoform diversity of the Arp2/3 complex","_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A"}],"oa":1},{"type":"journal_article","publisher":"Elsevier","pmid":1,"isi":1,"publication_identifier":{"eissn":["2590-3462"]},"file":[{"file_name":"2023_PlantCommunications_Xia.pdf","file_id":"14900","date_updated":"2024-01-30T10:54:40Z","date_created":"2024-01-30T10:54:40Z","success":1,"access_level":"open_access","content_type":"application/pdf","file_size":1434862,"checksum":"f8ef92af6096834f91ce38587fb1db9f","relation":"main_file","creator":"dernst"}],"article_type":"original","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","date_updated":"2026-07-06T12:59:25Z","oa":1,"date_created":"2023-07-12T07:32:00Z","issue":"6","volume":4,"publication":"Plant Communications","das_tickbox":"1","acknowledgement":"This work was supported by the Strategic Priority Research Program of the Chinese Academy of Sciences (XDB37020103 to Linfeng Sun); research funds from the Center for Advanced Interdisciplinary Science\r\nand Biomedicine of IHM, Division of Life Sciences and Medicine, University of Science and Technology of China (QYPY20220012 to S.T.); start-up funding from the University of Science and Technology of China and the\r\nChinese Academy of Sciences (GG9100007007, KY9100000026,KY9100000051, and KJ2070000079 to S.T.); the National Natural Science Foundation of China (31900885 to X.L. and 31870732 to Linfeng Sun); the Natural Science Foundation of Anhui Province (2008085MC90 to X.L. and 2008085J15 to Linfeng Sun); the Fundamental Research Funds for the Central Universities (WK9100000021 to S.T. and WK9100000031 to Linfeng Sun); and the USTC Research Funds of the Double First-Class Initiative (YD9100002016 to S.T. and YD9100002004 to Linfeng Sun). Linfeng Sun is supported by an Outstanding Young Scholar Award from the Qiu Shi Science and Technologies Foundation and a Young Scholar Award from the Cyrus Tang Foundation.We thank Dr. Yang Zhao for sharing published materials (Center for Excellence in Molecular Plant Sciences, Chinese Academy of Sciences) and the Cryo-EM Center of the University of Science and Technology of China for the EM facility support. We are grateful to Y. Gao and all other staff members for their technical support on cryo-EM data collection. ","has_accepted_license":"1","intvolume":"         4","doi":"10.1016/j.xplc.2023.100632","_id":"13209","author":[{"first_name":"Jing","full_name":"Xia, Jing","last_name":"Xia"},{"last_name":"Kong","full_name":"Kong, Mengjuan","first_name":"Mengjuan"},{"last_name":"Yang","first_name":"Zhisen","full_name":"Yang, Zhisen"},{"full_name":"Sun, Lianghanxiao","first_name":"Lianghanxiao","last_name":"Sun"},{"full_name":"Peng, Yakun","first_name":"Yakun","last_name":"Peng"},{"last_name":"Mao","first_name":"Yanbo","full_name":"Mao, Yanbo"},{"last_name":"Wei","full_name":"Wei, Hong","first_name":"Hong"},{"first_name":"Wei","full_name":"Ying, Wei","last_name":"Ying"},{"first_name":"Yongxiao","full_name":"Gao, Yongxiao","last_name":"Gao"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","first_name":"Jiří"},{"last_name":"Weng","first_name":"Jianping","full_name":"Weng, Jianping"},{"last_name":"Liu","full_name":"Liu, Xin","first_name":"Xin"},{"full_name":"Sun, Linfeng","first_name":"Linfeng","last_name":"Sun"},{"full_name":"Tan, Shutang","first_name":"Shutang","last_name":"Tan"}],"quality_controlled":"1","status":"public","oa_version":"Published Version","ddc":["580"],"fulldoi":"https://doi.org/10.1016/j.xplc.2023.100632","external_id":{"isi":["001113003000001"],"pmid":["37254481"]},"article_number":"100632","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"article_processing_charge":"Yes","scopus_import":"1","day":"13","language":[{"iso":"eng"}],"publication_status":"published","file_date_updated":"2024-01-30T10:54:40Z","department":[{"_id":"JiFr"}],"year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-11-13T00:00:00Z","abstract":[{"lang":"eng","text":"The phytohormone auxin plays central roles in many growth and developmental processes in plants. Development of chemical tools targeting the auxin pathway is useful for both plant biology and agriculture. Here we reveal that naproxen, a synthetic compound with anti-inflammatory activity in humans, acts as an auxin transport inhibitor targeting PIN-FORMED (PIN) transporters in plants. Physiological experiments indicate that exogenous naproxen treatment affects pleiotropic auxin-regulated developmental processes. Additional cellular and biochemical evidence indicates that naproxen suppresses auxin transport, specifically PIN-mediated auxin efflux. Moreover, biochemical and structural analyses confirm that naproxen binds directly to PIN1 protein via the same binding cavity as the indole-3-acetic acid substrate. Thus, by combining cellular, biochemical, and structural approaches, this study clearly establishes that naproxen is a PIN inhibitor and elucidates the underlying mechanisms. Further use of this compound may advance our understanding of the molecular mechanisms of PIN-mediated auxin transport and expand our toolkit in auxin biology and agriculture."}],"title":"Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen","citation":{"chicago":"Xia, Jing, Mengjuan Kong, Zhisen Yang, Lianghanxiao Sun, Yakun Peng, Yanbo Mao, Hong Wei, et al. “Chemical Inhibition of Arabidopsis PIN-FORMED Auxin Transporters by the Anti-Inflammatory Drug Naproxen.” <i>Plant Communications</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.xplc.2023.100632\">https://doi.org/10.1016/j.xplc.2023.100632</a>.","ama":"Xia J, Kong M, Yang Z, et al. Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen. <i>Plant Communications</i>. 2023;4(6). doi:<a href=\"https://doi.org/10.1016/j.xplc.2023.100632\">10.1016/j.xplc.2023.100632</a>","apa":"Xia, J., Kong, M., Yang, Z., Sun, L., Peng, Y., Mao, Y., … Tan, S. (2023). Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen. <i>Plant Communications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.xplc.2023.100632\">https://doi.org/10.1016/j.xplc.2023.100632</a>","short":"J. Xia, M. Kong, Z. Yang, L. Sun, Y. Peng, Y. Mao, H. Wei, W. Ying, Y. Gao, J. Friml, J. Weng, X. Liu, L. Sun, S. Tan, Plant Communications 4 (2023).","ieee":"J. Xia <i>et al.</i>, “Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen,” <i>Plant Communications</i>, vol. 4, no. 6. Elsevier, 2023.","ista":"Xia J, Kong M, Yang Z, Sun L, Peng Y, Mao Y, Wei H, Ying W, Gao Y, Friml J, Weng J, Liu X, Sun L, Tan S. 2023. Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen. Plant Communications. 4(6), 100632.","mla":"Xia, Jing, et al. “Chemical Inhibition of Arabidopsis PIN-FORMED Auxin Transporters by the Anti-Inflammatory Drug Naproxen.” <i>Plant Communications</i>, vol. 4, no. 6, 100632, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.xplc.2023.100632\">10.1016/j.xplc.2023.100632</a>."},"month":"11"},{"oa":1,"date_created":"2023-06-23T11:03:18Z","has_accepted_license":"1","publication":"ASHPC23 - Austrian-Slovenian HPC Meeting 2023","publisher":"EuroCC Austria","type":"conference_abstract","page":"42-42","file":[{"access_level":"open_access","success":1,"content_type":"application/pdf","file_size":380354,"checksum":"0ab6173cd5c5634ed773cd37ff012681","creator":"dernst","relation":"main_file","file_id":"13250","file_name":"2023_ASHPC_Elefante.pdf","date_updated":"2023-07-18T09:28:30Z","date_created":"2023-07-18T09:28:30Z"}],"date_updated":"2026-07-06T13:01:58Z","day":"01","language":[{"iso":"eng"}],"file_date_updated":"2023-07-18T09:28:30Z","department":[{"_id":"ScienComp"}],"publication_status":"published","year":"2023","citation":{"apa":"Elefante, S., Stadlbauer, S., Alexander, M. F., &#38; Schlögl, A. (2023). Cryo-EM software packages: A sys-admins point of view. In <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i> (pp. 42–42). Maribor, Slovenia: EuroCC Austria.","short":"S. Elefante, S. Stadlbauer, M.F. Alexander, A. Schlögl, in:, ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC Austria, 2023, pp. 42–42.","ieee":"S. Elefante, S. Stadlbauer, M. F. Alexander, and A. Schlögl, “Cryo-EM software packages: A sys-admins point of view,” in <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>, Maribor, Slovenia, 2023, pp. 42–42.","ama":"Elefante S, Stadlbauer S, Alexander MF, Schlögl A. Cryo-EM software packages: A sys-admins point of view. In: <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>. EuroCC Austria; 2023:42-42.","chicago":"Elefante, Stefano, Stephan Stadlbauer, Michael F Alexander, and Alois Schlögl. “Cryo-EM Software Packages: A Sys-Admins Point of View.” In <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>, 42–42. EuroCC Austria, 2023.","mla":"Elefante, Stefano, et al. “Cryo-EM Software Packages: A Sys-Admins Point of View.” <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>, EuroCC Austria, 2023, pp. 42–42.","ista":"Elefante S, Stadlbauer S, Alexander MF, Schlögl A. 2023. Cryo-EM software packages: A sys-admins point of view. ASHPC23 - Austrian-Slovenian HPC Meeting 2023. ASHPC: Austrian-Slovenian HPC Meeting, 42–42."},"month":"07","title":"Cryo-EM software packages: A sys-admins point of view","date_published":"2023-07-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","corr_author":"1","_id":"13162","author":[{"id":"490F40CE-F248-11E8-B48F-1D18A9856A87","last_name":"Elefante","first_name":"Stefano","full_name":"Elefante, Stefano"},{"last_name":"Stadlbauer","id":"4D0BC184-F248-11E8-B48F-1D18A9856A87","full_name":"Stadlbauer, Stephan","first_name":"Stephan"},{"last_name":"Alexander","id":"3A02A8FA-F248-11E8-B48F-1D18A9856A87","full_name":"Alexander, Michael F","first_name":"Michael F"},{"first_name":"Alois","full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl"}],"status":"public","quality_controlled":"1","ddc":["000"],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"conference":{"location":"Maribor, Slovenia","end_date":"2023-06-15","name":"ASHPC: Austrian-Slovenian HPC Meeting","start_date":"2023-06-12"},"article_processing_charge":"No"},{"month":"07","title":"Running Windows-applications on a Linux HPC cluster using WINE","citation":{"ista":"Schlögl A, Elefante S, Hodirnau V-V. 2023. Running Windows-applications on a Linux HPC cluster using WINE. ASHPC23 - Austrian-Slovenian HPC Meeting 2023. ASHPC: Austrian-Slovenian HPC Meeting, 59–59.","mla":"Schlögl, Alois, et al. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>, EuroCC Austria, 2023, pp. 59–59.","apa":"Schlögl, A., Elefante, S., &#38; Hodirnau, V.-V. (2023). Running Windows-applications on a Linux HPC cluster using WINE. In <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i> (pp. 59–59). Maribor, Slovenia: EuroCC Austria.","ieee":"A. Schlögl, S. Elefante, and V.-V. Hodirnau, “Running Windows-applications on a Linux HPC cluster using WINE,” in <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>, Maribor, Slovenia, 2023, pp. 59–59.","short":"A. Schlögl, S. Elefante, V.-V. Hodirnau, in:, ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC Austria, 2023, pp. 59–59.","ama":"Schlögl A, Elefante S, Hodirnau V-V. Running Windows-applications on a Linux HPC cluster using WINE. In: <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>. EuroCC Austria; 2023:59-59.","chicago":"Schlögl, Alois, Stefano Elefante, and Victor-Valentin Hodirnau. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” In <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>, 59–59. EuroCC Austria, 2023."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-07-01T00:00:00Z","year":"2023","file_date_updated":"2023-07-18T09:18:55Z","department":[{"_id":"ScienComp"},{"_id":"EM-Fac"}],"publication_status":"published","language":[{"iso":"eng"}],"day":"01","article_processing_charge":"No","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"conference":{"start_date":"2023-06-13","name":"ASHPC: Austrian-Slovenian HPC Meeting","end_date":"2023-06-15","location":"Maribor, Slovenia"},"ddc":["000"],"corr_author":"1","oa_version":"Submitted Version","_id":"13161","author":[{"first_name":"Alois","full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl"},{"last_name":"Elefante","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","full_name":"Elefante, Stefano","first_name":"Stefano"},{"last_name":"Hodirnau","id":"3661B498-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3904-947X","full_name":"Hodirnau, Victor-Valentin","first_name":"Victor-Valentin"}],"quality_controlled":"1","status":"public","publication":"ASHPC23 - Austrian-Slovenian HPC Meeting 2023","acknowledgement":"Thanks to Jesse Hansen for his suggestions on improving the abstract.","has_accepted_license":"1","date_created":"2023-06-23T11:01:23Z","oa":1,"date_updated":"2026-07-06T13:01:46Z","file":[{"checksum":"ec8e4295d54171032cdd1b01423eb4a6","creator":"dernst","relation":"main_file","access_level":"open_access","success":1,"file_size":316959,"content_type":"application/pdf","date_created":"2023-07-18T09:18:55Z","file_name":"2023_ASHPC_Schloegl.pdf","file_id":"13249","date_updated":"2023-07-18T09:18:55Z"}],"type":"conference_abstract","publisher":"EuroCC Austria","page":"59-59"},{"date_published":"2023-06-21T00:00:00Z","abstract":[{"text":"We give a simple argument to prove Nagai’s conjecture for type II degenerations of compact hyperkähler manifolds and cohomology classes of middle degree. Under an additional assumption, the techniques yield the conjecture in arbitrary degree. This would complete the proof of Nagai’s conjecture in general, as it was proved already for type I degenerations by Kollár, Laza, Saccà, and Voisin [10] and independently by Soldatenkov [18], while it is immediate for type III degenerations. Our arguments are close in spirit to a recent paper by Harder [8] proving similar results for the restrictive class of good degenerations.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","citation":{"mla":"Huybrechts, D., and Mirko Mauri. “On Type II Degenerations of Hyperkähler Manifolds.” <i>Mathematical Research Letters</i>, vol. 30, no. 1, International Press of Boston, 2023, pp. 125–41, doi:<a href=\"https://doi.org/10.4310/mrl.2023.v30.n1.a6\">10.4310/mrl.2023.v30.n1.a6</a>.","ista":"Huybrechts D, Mauri M. 2023. On type II degenerations of hyperkähler manifolds. Mathematical Research Letters. 30(1), 125–141.","short":"D. Huybrechts, M. Mauri, Mathematical Research Letters 30 (2023) 125–141.","ieee":"D. Huybrechts and M. Mauri, “On type II degenerations of hyperkähler manifolds,” <i>Mathematical Research Letters</i>, vol. 30, no. 1. International Press of Boston, pp. 125–141, 2023.","apa":"Huybrechts, D., &#38; Mauri, M. (2023). On type II degenerations of hyperkähler manifolds. <i>Mathematical Research Letters</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/mrl.2023.v30.n1.a6\">https://doi.org/10.4310/mrl.2023.v30.n1.a6</a>","chicago":"Huybrechts, D., and Mirko Mauri. “On Type II Degenerations of Hyperkähler Manifolds.” <i>Mathematical Research Letters</i>. International Press of Boston, 2023. <a href=\"https://doi.org/10.4310/mrl.2023.v30.n1.a6\">https://doi.org/10.4310/mrl.2023.v30.n1.a6</a>.","ama":"Huybrechts D, Mauri M. On type II degenerations of hyperkähler manifolds. <i>Mathematical Research Letters</i>. 2023;30(1):125-141. doi:<a href=\"https://doi.org/10.4310/mrl.2023.v30.n1.a6\">10.4310/mrl.2023.v30.n1.a6</a>"},"title":"On type II degenerations of hyperkähler manifolds","year":"2023","publication_status":"published","department":[{"_id":"TaHa"}],"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413"}],"day":"21","language":[{"iso":"eng"}],"arxiv":1,"article_processing_charge":"No","scopus_import":"1","external_id":{"isi":["001027656000006"],"arxiv":["2108.01587"]},"fulldoi":"https://doi.org/10.4310/mrl.2023.v30.n1.a6","author":[{"last_name":"Huybrechts","full_name":"Huybrechts, D.","first_name":"D."},{"id":"2cf70c34-09c1-11ed-bd8d-c34fac206130","last_name":"Mauri","first_name":"Mirko","full_name":"Mauri, Mirko"}],"_id":"13268","status":"public","quality_controlled":"1","doi":"10.4310/mrl.2023.v30.n1.a6","intvolume":"        30","oa_version":"Preprint","corr_author":"1","volume":30,"ec_funded":1,"acknowledgement":"The first author is supported by the ERC Synergy Grant HyperK. The second author is supported by the Max Planck Institute for Mathematics and the Institute of Science and Technology Austria. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413.","publication":"Mathematical Research Letters","das_tickbox":"1","issue":"1","date_created":"2023-07-23T22:01:14Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2108.01587","open_access":"1"}],"oa":1,"date_updated":"2026-07-06T13:37:53Z","article_type":"original","publication_identifier":{"issn":["1073-2780"],"eissn":["1945-001X"]},"isi":1,"page":"125-141","publisher":"International Press of Boston","type":"journal_article"},{"date_created":"2023-11-26T23:00:55Z","volume":8,"publication":"32nd USENIX Security Symposium","das_tickbox":"1","acknowledgement":"The authors would like to thank Amit Agarwal, Andrew Miller, and Tom Yurek for the helpful discussions related to the paper. This work is funded in part by a VMware early career faculty grant, a Chainlink Labs Ph.D. fellowship, the National Science Foundation, and the Austrian Science Fund (FWF) F8512-N.","has_accepted_license":"1","oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2022/1389","open_access":"1"}],"file":[{"checksum":"1a730765930138e23c6efd2575872641","creator":"dernst","relation":"main_file","access_level":"open_access","success":1,"content_type":"application/pdf","file_size":704331,"date_created":"2023-11-28T09:14:34Z","file_id":"14621","file_name":"2023_USENIX_Das.pdf","date_updated":"2023-11-28T09:14:34Z"}],"date_updated":"2026-07-07T06:02:32Z","page":"5359-5376","type":"conference","publisher":"Usenix Association","publication_identifier":{"isbn":["9781713879497"]},"year":"2023","cryptoeprintid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems without a trusted party. DKG is an essential building block to many decentralized protocols such as randomness beacons, threshold signatures, Byzantine consensus, and multiparty computation. While significant progress has been made recently, existing asynchronous DKG constructions are inefficient when the reconstruction threshold is larger than one-third of the total nodes. In this paper, we present a simple and concretely efficient asynchronous DKG (ADKG) protocol among n = 3t + 1 nodes that can tolerate up to t malicious nodes and support any reconstruction threshold ℓ ≥ t. Our protocol has an expected O(κn3) communication cost, where κ is the security parameter, and only assumes the hardness of the Discrete Logarithm. The\r\ncore ingredient of our ADKG protocol is an asynchronous protocol to secret share a random polynomial of degree ℓ ≥ t, which has other applications, such as asynchronous proactive secret sharing and asynchronous multiparty computation. We implement our high-threshold ADKG protocol and evaluate it using a network of up to 128 geographically distributed nodes. Our evaluation shows that our high-threshold ADKG protocol reduces the running time by 90% and bandwidth usage by 80% over the state-of-the-art."}],"date_published":"2023-08-15T00:00:00Z","citation":{"ista":"Das S, Xiang Z, Kokoris Kogias E, Ren L. 2023. Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. 32nd USENIX Security Symposium. USENIX Security Symposium vol. 8, 5359–5376.","mla":"Das, Sourav, et al. “Practical Asynchronous High-Threshold Distributed Key Generation and Distributed Polynomial Sampling.” <i>32nd USENIX Security Symposium</i>, vol. 8, Usenix Association, 2023, pp. 5359–76.","ieee":"S. Das, Z. Xiang, E. Kokoris Kogias, and L. Ren, “Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling,” in <i>32nd USENIX Security Symposium</i>, Anaheim, CA, United States, 2023, vol. 8, pp. 5359–5376.","apa":"Das, S., Xiang, Z., Kokoris Kogias, E., &#38; Ren, L. (2023). Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. In <i>32nd USENIX Security Symposium</i> (Vol. 8, pp. 5359–5376). Anaheim, CA, United States: Usenix Association.","short":"S. Das, Z. Xiang, E. Kokoris Kogias, L. Ren, in:, 32nd USENIX Security Symposium, Usenix Association, 2023, pp. 5359–5376.","ama":"Das S, Xiang Z, Kokoris Kogias E, Ren L. Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. In: <i>32nd USENIX Security Symposium</i>. Vol 8. Usenix Association; 2023:5359-5376.","chicago":"Das, Sourav, Zhuolun Xiang, Eleftherios Kokoris Kogias, and Ling Ren. “Practical Asynchronous High-Threshold Distributed Key Generation and Distributed Polynomial Sampling.” In <i>32nd USENIX Security Symposium</i>, 8:5359–76. Usenix Association, 2023."},"month":"08","title":"Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling","language":[{"iso":"eng"}],"day":"15","project":[{"_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f","name":"Security and Privacy by Design for Complex Systems","grant_number":"F8512"}],"publication_status":"published","department":[{"_id":"ElKo"}],"file_date_updated":"2023-11-28T09:14:34Z","conference":{"start_date":"2023-08-09","name":"USENIX Security Symposium","location":"Anaheim, CA, United States","end_date":"2023-08-11"},"external_id":{"cryptoeprintid":["2022/1389"]},"article_processing_charge":"No","scopus_import":"1","intvolume":"         8","_id":"14609","quality_controlled":"1","author":[{"last_name":"Das","first_name":"Sourav","full_name":"Das, Sourav"},{"last_name":"Xiang","full_name":"Xiang, Zhuolun","first_name":"Zhuolun"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","orcid":"0000-0002-8827-3382","last_name":"Kokoris Kogias","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios"},{"last_name":"Ren","full_name":"Ren, Ling","first_name":"Ling"}],"status":"public","corr_author":"1","oa_version":"Published Version","ddc":["000"]},{"project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020"}],"day":"01","language":[{"iso":"eng"}],"publication_status":"published","department":[{"_id":"ToHe"}],"file_date_updated":"2024-01-02T08:14:23Z","year":"2023","abstract":[{"lang":"eng","text":"Binary decision diagrams (BDDs) are one of the fundamental data structures in formal methods and computer science in general. However, the performance of BDD-based algorithms greatly depends on memory latency due to the reliance on large hash tables and thus, by extension, on the speed of random memory access. This hinders the full utilisation of resources available on modern CPUs, since the absolute memory latency has not improved significantly for at least a decade. In this paper, we explore several implementation techniques that improve the performance of BDD manipulation either through enhanced memory locality or by partially eliminating random memory access. On a benchmark suite of 600+ BDDs derived from real-world applications, we demonstrate runtime that is comparable or better than parallelising the same operations on eight CPU cores. "}],"date_published":"2023-10-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Binary decision diagrams on modern hardware","month":"10","citation":{"chicago":"Pastva, Samuel, and Thomas A Henzinger. “Binary Decision Diagrams on Modern Hardware.” In <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>, 122–31. TU Wien Academic Press, 2023. <a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20</a>.","ama":"Pastva S, Henzinger TA. Binary decision diagrams on modern hardware. In: <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>. TU Wien Academic Press; 2023:122-131. doi:<a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">10.34727/2023/isbn.978-3-85448-060-0_20</a>","short":"S. Pastva, T.A. Henzinger, in:, Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2023, pp. 122–131.","apa":"Pastva, S., &#38; Henzinger, T. A. (2023). Binary decision diagrams on modern hardware. In <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i> (pp. 122–131). Ames, IA, United States: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20</a>","ieee":"S. Pastva and T. A. Henzinger, “Binary decision diagrams on modern hardware,” in <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>, Ames, IA, United States, 2023, pp. 122–131.","ista":"Pastva S, Henzinger TA. 2023. Binary decision diagrams on modern hardware. Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 122–131.","mla":"Pastva, Samuel, and Thomas A. Henzinger. “Binary Decision Diagrams on Modern Hardware.” <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>, TU Wien Academic Press, 2023, pp. 122–31, doi:<a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">10.34727/2023/isbn.978-3-85448-060-0_20</a>."},"author":[{"orcid":"0000-0003-1993-0331","id":"07c5ea74-f61c-11ec-a664-aa7c5d957b2b","last_name":"Pastva","first_name":"Samuel","full_name":"Pastva, Samuel"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"}],"_id":"14718","status":"public","quality_controlled":"1","doi":"10.34727/2023/isbn.978-3-85448-060-0_20","oa_version":"Published Version","corr_author":"1","ddc":["000"],"fulldoi":"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20","conference":{"start_date":"2023-10-25","name":"FMCAD: Formal Methods in Computer-Aided Design","location":"Ames, IA, United States","end_date":"2023-10-27"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"external_id":{"isi":["001504402400020"]},"article_processing_charge":"No","scopus_import":"1","oa":1,"date_created":"2023-12-31T23:01:03Z","ec_funded":1,"has_accepted_license":"1","acknowledgement":"This work was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413 and the\r\n“VAMOS” grant ERC-2020-AdG 101020093.","das_tickbox":"1","publication":"Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design","page":"122-131","publisher":"TU Wien Academic Press","type":"conference","publication_identifier":{"isbn":["9783854480600"]},"isi":1,"file":[{"date_created":"2024-01-02T08:14:23Z","file_id":"14721","file_name":"2023_FMCAD_Pastva.pdf","date_updated":"2024-01-02T08:14:23Z","checksum":"818d6e13dd508f3a04f0941081022e5d","creator":"dernst","relation":"main_file","access_level":"open_access","success":1,"content_type":"application/pdf","file_size":524321}],"date_updated":"2026-07-07T05:58:51Z"},{"oa_version":"Published Version","intvolume":"        56","doi":"10.1107/S1600576723008324","author":[{"last_name":"Pauw","full_name":"Pauw, Brian R.","first_name":"Brian R."},{"full_name":"Smales, Glen J.","first_name":"Glen J.","last_name":"Smales"},{"last_name":"Anker","full_name":"Anker, Andy S.","first_name":"Andy S."},{"last_name":"Annadurai","full_name":"Annadurai, Venkatasamy","first_name":"Venkatasamy"},{"full_name":"Balazs, Daniel","first_name":"Daniel","last_name":"Balazs","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","orcid":"0000-0001-7597-043X"},{"last_name":"Bienert","full_name":"Bienert, Ralf","first_name":"Ralf"},{"last_name":"Bouwman","first_name":"Wim G.","full_name":"Bouwman, Wim G."},{"last_name":"Breßler","first_name":"Ingo","full_name":"Breßler, Ingo"},{"full_name":"Breternitz, Joachim","first_name":"Joachim","last_name":"Breternitz"},{"last_name":"Brok","first_name":"Erik S.","full_name":"Brok, Erik S."},{"first_name":"Gary","full_name":"Bryant, Gary","last_name":"Bryant"},{"last_name":"Clulow","first_name":"Andrew J.","full_name":"Clulow, Andrew J."},{"last_name":"Crater","first_name":"Erin R.","full_name":"Crater, Erin R."},{"last_name":"De Geuser","full_name":"De Geuser, Frédéric","first_name":"Frédéric"},{"last_name":"Giudice","full_name":"Giudice, Alessandra Del","first_name":"Alessandra Del"},{"first_name":"Jérôme","full_name":"Deumer, Jérôme","last_name":"Deumer"},{"full_name":"Disch, Sabrina","first_name":"Sabrina","last_name":"Disch"},{"last_name":"Dutt","first_name":"Shankar","full_name":"Dutt, Shankar"},{"full_name":"Frank, Kilian","first_name":"Kilian","last_name":"Frank"},{"last_name":"Fratini","first_name":"Emiliano","full_name":"Fratini, Emiliano"},{"last_name":"Garcia","first_name":"Paulo R.A.F.","full_name":"Garcia, Paulo R.A.F."},{"full_name":"Gilbert, Elliot P.","first_name":"Elliot P.","last_name":"Gilbert"},{"full_name":"Hahn, Marc B.","first_name":"Marc B.","last_name":"Hahn"},{"last_name":"Hallett","first_name":"James","full_name":"Hallett, James"},{"full_name":"Hohenschutz, Max","first_name":"Max","last_name":"Hohenschutz"},{"full_name":"Hollamby, Martin","first_name":"Martin","last_name":"Hollamby"},{"last_name":"Huband","full_name":"Huband, Steven","first_name":"Steven"},{"first_name":"Jan","full_name":"Ilavsky, Jan","last_name":"Ilavsky"},{"last_name":"Jochum","first_name":"Johanna K.","full_name":"Jochum, Johanna K."},{"full_name":"Juelsholt, Mikkel","first_name":"Mikkel","last_name":"Juelsholt"},{"first_name":"Bradley W.","full_name":"Mansel, Bradley W.","last_name":"Mansel"},{"last_name":"Penttilä","first_name":"Paavo","full_name":"Penttilä, Paavo"},{"first_name":"Rebecca K.","full_name":"Pittkowski, Rebecca K.","last_name":"Pittkowski"},{"full_name":"Portale, Giuseppe","first_name":"Giuseppe","last_name":"Portale"},{"first_name":"Lilo D.","full_name":"Pozzo, Lilo D.","last_name":"Pozzo"},{"last_name":"Rochels","first_name":"Leonhard","full_name":"Rochels, Leonhard"},{"last_name":"Rosalie","first_name":"Julian M.","full_name":"Rosalie, Julian M."},{"last_name":"Saloga","full_name":"Saloga, Patrick E.J.","first_name":"Patrick E.J."},{"last_name":"Seibt","full_name":"Seibt, Susanne","first_name":"Susanne"},{"full_name":"Smith, Andrew J.","first_name":"Andrew J.","last_name":"Smith"},{"full_name":"Smith, Gregory N.","first_name":"Gregory N.","last_name":"Smith"},{"last_name":"Spiering","first_name":"Glenn A.","full_name":"Spiering, Glenn A."},{"last_name":"Stawski","full_name":"Stawski, Tomasz M.","first_name":"Tomasz M."},{"last_name":"Taché","first_name":"Olivier","full_name":"Taché, Olivier"},{"first_name":"Andreas F.","full_name":"Thünemann, Andreas F.","last_name":"Thünemann"},{"full_name":"Toth, Kristof","first_name":"Kristof","last_name":"Toth"},{"first_name":"Andrew E.","full_name":"Whitten, Andrew E.","last_name":"Whitten"},{"last_name":"Wuttke","first_name":"Joachim","full_name":"Wuttke, Joachim"}],"_id":"14799","status":"public","quality_controlled":"1","fulldoi":"https://doi.org/10.1107/S1600576723008324","ddc":["540"],"external_id":{"isi":["001120776200002"],"arxiv":["2303.03772"]},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","article_processing_charge":"Yes (via OA deal)","arxiv":1,"day":"01","language":[{"iso":"eng"}],"file_date_updated":"2024-01-17T07:47:35Z","department":[{"_id":"LifeSc"}],"publication_status":"published","year":"2023","title":"The human factor: Results of a small-angle scattering data analysis round robin","citation":{"ama":"Pauw BR, Smales GJ, Anker AS, et al. The human factor: Results of a small-angle scattering data analysis round robin. <i>Journal of Applied Crystallography</i>. 2023;56(6):1618-1629. doi:<a href=\"https://doi.org/10.1107/S1600576723008324\">10.1107/S1600576723008324</a>","chicago":"Pauw, Brian R., Glen J. Smales, Andy S. Anker, Venkatasamy Annadurai, Daniel Balazs, Ralf Bienert, Wim G. Bouwman, et al. “The Human Factor: Results of a Small-Angle Scattering Data Analysis Round Robin.” <i>Journal of Applied Crystallography</i>. International Union of Crystallography, 2023. <a href=\"https://doi.org/10.1107/S1600576723008324\">https://doi.org/10.1107/S1600576723008324</a>.","ieee":"B. R. Pauw <i>et al.</i>, “The human factor: Results of a small-angle scattering data analysis round robin,” <i>Journal of Applied Crystallography</i>, vol. 56, no. 6. International Union of Crystallography, pp. 1618–1629, 2023.","short":"B.R. Pauw, G.J. Smales, A.S. Anker, V. Annadurai, D. Balazs, R. Bienert, W.G. Bouwman, I. Breßler, J. Breternitz, E.S. Brok, G. Bryant, A.J. Clulow, E.R. Crater, F. De Geuser, A.D. Giudice, J. Deumer, S. Disch, S. Dutt, K. Frank, E. Fratini, P.R.A.F. Garcia, E.P. Gilbert, M.B. Hahn, J. Hallett, M. Hohenschutz, M. Hollamby, S. Huband, J. Ilavsky, J.K. Jochum, M. Juelsholt, B.W. Mansel, P. Penttilä, R.K. Pittkowski, G. Portale, L.D. Pozzo, L. Rochels, J.M. Rosalie, P.E.J. Saloga, S. Seibt, A.J. Smith, G.N. Smith, G.A. Spiering, T.M. Stawski, O. Taché, A.F. Thünemann, K. Toth, A.E. Whitten, J. Wuttke, Journal of Applied Crystallography 56 (2023) 1618–1629.","apa":"Pauw, B. R., Smales, G. J., Anker, A. S., Annadurai, V., Balazs, D., Bienert, R., … Wuttke, J. (2023). The human factor: Results of a small-angle scattering data analysis round robin. <i>Journal of Applied Crystallography</i>. International Union of Crystallography. <a href=\"https://doi.org/10.1107/S1600576723008324\">https://doi.org/10.1107/S1600576723008324</a>","ista":"Pauw BR, Smales GJ, Anker AS, Annadurai V, Balazs D, Bienert R, Bouwman WG, Breßler I, Breternitz J, Brok ES, Bryant G, Clulow AJ, Crater ER, De Geuser F, Giudice AD, Deumer J, Disch S, Dutt S, Frank K, Fratini E, Garcia PRAF, Gilbert EP, Hahn MB, Hallett J, Hohenschutz M, Hollamby M, Huband S, Ilavsky J, Jochum JK, Juelsholt M, Mansel BW, Penttilä P, Pittkowski RK, Portale G, Pozzo LD, Rochels L, Rosalie JM, Saloga PEJ, Seibt S, Smith AJ, Smith GN, Spiering GA, Stawski TM, Taché O, Thünemann AF, Toth K, Whitten AE, Wuttke J. 2023. The human factor: Results of a small-angle scattering data analysis round robin. Journal of Applied Crystallography. 56(6), 1618–1629.","mla":"Pauw, Brian R., et al. “The Human Factor: Results of a Small-Angle Scattering Data Analysis Round Robin.” <i>Journal of Applied Crystallography</i>, vol. 56, no. 6, International Union of Crystallography, 2023, pp. 1618–29, doi:<a href=\"https://doi.org/10.1107/S1600576723008324\">10.1107/S1600576723008324</a>."},"month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-12-01T00:00:00Z","abstract":[{"lang":"eng","text":"A round-robin study has been carried out to estimate the impact of the human element in small-angle scattering data analysis. Four corrected datasets were provided to participants ready for analysis. All datasets were measured on samples containing spherical scatterers, with two datasets in dilute dispersions and two from powders. Most of the 46 participants correctly identified the number of populations in the dilute dispersions, with half of the population\r\nmean entries within 1.5% and half of the population width entries within 40%. Due to the added complexity of the structure factor, far fewer people submitted answers on the powder datasets. For those that did, half of the entries for the means and widths were within 44 and 86%, respectively. This round-robin experiment highlights several causes for the discrepancies, for which solutions are proposed."}],"type":"journal_article","publisher":"International Union of Crystallography","page":"1618-1629","isi":1,"publication_identifier":{"eissn":["1600-5767"],"issn":["0021-8898"]},"article_type":"original","file":[{"content_type":"application/pdf","file_size":2165864,"success":1,"access_level":"open_access","relation":"main_file","creator":"dernst","checksum":"dab30d4556360f2cecf99f4b7efb0ee9","date_updated":"2024-01-17T07:47:35Z","file_name":"2023_JourApplCrystallography_Pauw.pdf","file_id":"14822","date_created":"2024-01-17T07:47:35Z"}],"date_updated":"2026-07-07T06:18:55Z","oa":1,"date_created":"2024-01-14T23:00:57Z","issue":"6","das_tickbox":"1","publication":"Journal of Applied Crystallography","has_accepted_license":"1","acknowledgement":"KT acknowledges the NIST–NRC postdoctoral fellowship program for support. This work was partially funded through the European Metrology Programme for Innovation and Research (EMPIR) project No. 17NRM04.\r\nCertain commercial equipment, instruments, materials or software are identified in this article in order to specify the experimental procedure adequately. Such identification is not intended to imply recommendation or endorsement by NIST, nor is it intended to imply that the materials or equipment identified are necessarily the best available for the purpose. Open access funding enabled and organized by Projekt DEAL.","volume":56},{"page":"5464-5471","type":"conference","publisher":"AAAI Press","publication_identifier":{"isbn":["9781577358800"]},"date_updated":"2026-07-07T06:24:15Z","oa":1,"main_file_link":[{"url":"https://doi.org/10.1609/aaai.v37i5.25679","open_access":"1"}],"date_created":"2023-08-27T22:01:18Z","issue":"5","ec_funded":1,"volume":37,"das_tickbox":"1","publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","acknowledgement":"This research was supported in part by ISF grant no.1679/21, by the ERC CoG 863818 (ForM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","doi":"10.1609/aaai.v37i5.25679","intvolume":"        37","author":[{"last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","first_name":"Guy"},{"full_name":"Jecker, Ismael R","first_name":"Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"},{"full_name":"Zikelic, Dorde","first_name":"Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"_id":"14243","quality_controlled":"1","status":"public","oa_version":"Published Version","ddc":["000"],"fulldoi":"https://doi.org/10.1609/aaai.v37i5.25679","conference":{"start_date":"2023-02-07","name":"AAAI: Conference on Artificial Intelligence","end_date":"2023-02-14","location":"Washington, DC, United States"},"external_id":{"arxiv":["2211.13626"]},"article_processing_charge":"No","arxiv":1,"scopus_import":"1","day":"27","language":[{"iso":"eng"}],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"}],"publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Two-player zero-sum \"graph games\" are central in logic, verification, and multi-agent systems. The game proceeds by placing a token on a vertex of a graph, and allowing the players to move it to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In \"bidding games\", however, the players have budgets and in each turn, an auction (bidding) determines which player moves the token. So far, bidding games have only been studied as full-information games. In this work we initiate the study of partial-information bidding games: we study bidding games in which a player's initial budget is drawn from a known probability distribution. We show that while for some bidding mechanisms and objectives, it is straightforward to adapt the results from the full-information setting to the partial-information setting, for others, the analysis is significantly more challenging, requires new techniques, and gives rise to interesting results. Specifically, we study games with \"mean-payoff\" objectives in combination with \"poorman\" bidding. We construct optimal strategies for a partially-informed player who plays against a fully-informed adversary. We show that, somewhat surprisingly, the \"value\" under pure strategies does not necessarily exist in such games."}],"date_published":"2023-06-27T00:00:00Z","citation":{"mla":"Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.” <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, vol. 37, no. 5, AAAI Press, 2023, pp. 5464–71, doi:<a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">10.1609/aaai.v37i5.25679</a>.","ista":"Avni G, Jecker IR, Zikelic D. 2023. Bidding graph games with partially-observable budgets. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 5464–5471.","ama":"Avni G, Jecker IR, Zikelic D. Bidding graph games with partially-observable budgets. In: <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>. Vol 37. AAAI Press; 2023:5464-5471. doi:<a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">10.1609/aaai.v37i5.25679</a>","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Bidding Graph Games with Partially-Observable Budgets.” In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, 37:5464–71. AAAI Press, 2023. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/10.1609/aaai.v37i5.25679</a>.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2023). Bidding graph games with partially-observable budgets. In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i> (Vol. 37, pp. 5464–5471). Washington, DC, United States: AAAI Press. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/10.1609/aaai.v37i5.25679</a>","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI Press, 2023, pp. 5464–5471."},"month":"06","title":"Bidding graph games with partially-observable budgets"}]
