[{"related_material":{"record":[{"relation":"earlier_version","id":"1193","status":"public"}]},"publication_status":"published","abstract":[{"text":"We consider the recent formulation of the algorithmic Lov ́asz Local Lemma  [N. Har-vey and J. Vondr ́ak, inProceedings of FOCS, 2015, pp. 1327–1345; D. Achlioptas and F. Iliopoulos,inProceedings of SODA, 2016, pp. 2024–2038; D. Achlioptas, F. Iliopoulos, and V. Kolmogorov,ALocal Lemma for Focused Stochastic Algorithms, arXiv preprint, 2018] for finding objects that avoid“bad  features,”  or  “flaws.”   It  extends  the  Moser–Tardos  resampling  algorithm  [R.  A.  Moser  andG. Tardos,J. ACM, 57 (2010), 11] to more general discrete spaces.  At each step the method picks aflaw present in the current state and goes to a new state according to some prespecified probabilitydistribution (which depends on the current state and the selected flaw).  However, the recent formu-lation is less flexible than the Moser–Tardos method since it requires a specific flaw selection rule,whereas the algorithm of Moser and Tardos allows an arbitrary rule (and thus can potentially beimplemented more efficiently).  We formulate a new “commutativity” condition and prove that it issufficient for an arbitrary rule to work.  It also enables an efficient parallelization under an additionalassumption.  We then show that existing resampling oracles for perfect matchings and permutationsdo satisfy this condition.","lang":"eng"}],"arxiv":1,"year":"2018","oa":1,"date_published":"2018-11-08T00:00:00Z","volume":47,"month":"11","external_id":{"isi":["000453785100001"],"arxiv":["1506.08547"]},"ec_funded":1,"oa_version":"Preprint","day":"08","intvolume":"        47","type":"journal_article","date_created":"2019-02-13T12:59:33Z","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir"}],"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"doi":"10.1137/16m1093306","_id":"5975","publisher":"Society for Industrial and Applied Mathematics","main_file_link":[{"url":"https://arxiv.org/abs/1506.08547","open_access":"1"}],"publication":"SIAM Journal on Computing","page":"2029-2056","citation":{"apa":"Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma. <i>SIAM Journal on Computing</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/16m1093306\">https://doi.org/10.1137/16m1093306</a>","ama":"Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. <i>SIAM Journal on Computing</i>. 2018;47(6):2029-2056. doi:<a href=\"https://doi.org/10.1137/16m1093306\">10.1137/16m1093306</a>","ieee":"V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” <i>SIAM Journal on Computing</i>, vol. 47, no. 6. Society for Industrial and Applied Mathematics, pp. 2029–2056, 2018.","short":"V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.","chicago":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” <i>SIAM Journal on Computing</i>. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/16m1093306\">https://doi.org/10.1137/16m1093306</a>.","ista":"Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056.","mla":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” <i>SIAM Journal on Computing</i>, vol. 47, no. 6, Society for Industrial and Applied Mathematics, 2018, pp. 2029–56, doi:<a href=\"https://doi.org/10.1137/16m1093306\">10.1137/16m1093306</a>."},"scopus_import":"1","isi":1,"status":"public","department":[{"_id":"VlKo"}],"issue":"6","article_processing_charge":"No","title":"Commutativity in the algorithmic Lovász local lemma","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"date_updated":"2025-09-22T09:44:20Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1"},{"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","title":"FlexMaps: Computational design of flat flexible shells for shaping 3D objects","date_updated":"2025-03-31T15:59:13Z","publication_identifier":{"issn":["0730-0301"]},"article_processing_charge":"No","article_number":"241","ddc":["000"],"issue":"6","department":[{"_id":"BeBi"}],"pubrep_id":"1068","status":"public","citation":{"ama":"Malomo L, Perez Rodriguez J, Iarussi E, et al. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. <i>ACM Transactions on Graphics</i>. 2018;37(6). doi:<a href=\"https://doi.org/10.1145/3272127.3275076\">10.1145/3272127.3275076</a>","apa":"Malomo, L., Perez Rodriguez, J., Iarussi, E., Pietroni, N., Miguel, E., Cignoni, P., &#38; Bickel, B. (2018). FlexMaps: Computational design of flat flexible shells for shaping 3D objects. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3272127.3275076\">https://doi.org/10.1145/3272127.3275076</a>","ieee":"L. Malomo <i>et al.</i>, “FlexMaps: Computational design of flat flexible shells for shaping 3D objects,” <i>ACM Transactions on Graphics</i>, vol. 37, no. 6. Association for Computing Machinery, 2018.","chicago":"Malomo, Luigi, Jesus Perez Rodriguez, Emmanuel Iarussi, Nico Pietroni, Eder Miguel, Paolo Cignoni, and Bernd Bickel. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3272127.3275076\">https://doi.org/10.1145/3272127.3275076</a>.","ista":"Malomo L, Perez Rodriguez J, Iarussi E, Pietroni N, Miguel E, Cignoni P, Bickel B. 2018. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. 37(6), 241.","mla":"Malomo, Luigi, et al. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” <i>ACM Transactions on Graphics</i>, vol. 37, no. 6, 241, Association for Computing Machinery, 2018, doi:<a href=\"https://doi.org/10.1145/3272127.3275076\">10.1145/3272127.3275076</a>.","short":"L. Malomo, J. Perez Rodriguez, E. Iarussi, N. Pietroni, E. Miguel, P. Cignoni, B. Bickel, ACM Transactions on Graphics 37 (2018)."},"publication":"ACM Transactions on Graphics","isi":1,"scopus_import":"1","file":[{"access_level":"open_access","file_size":100109811,"content_type":"application/pdf","file_id":"6901","checksum":"d0529a41c78b37ab8840685579fb33b4","relation":"main_file","creator":"bbickel","file_name":"flexmaps_author_version.pdf","date_created":"2019-09-23T12:48:52Z","date_updated":"2020-07-14T12:47:14Z"}],"_id":"5976","publisher":"Association for Computing Machinery","author":[{"last_name":"Malomo","first_name":"Luigi","full_name":"Malomo, Luigi"},{"first_name":"Jesus","last_name":"Perez Rodriguez","full_name":"Perez Rodriguez, Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Emmanuel","last_name":"Iarussi","id":"33F19F16-F248-11E8-B48F-1D18A9856A87","full_name":"Iarussi, Emmanuel"},{"last_name":"Pietroni","first_name":"Nico","full_name":"Pietroni, Nico"},{"last_name":"Miguel","first_name":"Eder","full_name":"Miguel, Eder"},{"full_name":"Cignoni, Paolo","last_name":"Cignoni","first_name":"Paolo"},{"first_name":"Bernd","last_name":"Bickel","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"}],"date_created":"2019-02-13T13:12:53Z","doi":"10.1145/3272127.3275076","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767"},{"_id":"25082902-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Soft-bodied intelligence for Manipulation","grant_number":"645599"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"}],"intvolume":"        37","type":"journal_article","oa_version":"Published Version","external_id":{"isi":["000455953100064"]},"ec_funded":1,"day":"01","has_accepted_license":"1","month":"11","volume":37,"date_published":"2018-11-01T00:00:00Z","year":"2018","oa":1,"file_date_updated":"2020-07-14T12:47:14Z","abstract":[{"text":"We propose FlexMaps, a novel framework for fabricating smooth shapes out of flat, flexible panels with tailored mechanical properties. We start by mapping the 3D surface onto a 2D domain as in traditional UV mapping to design a set of deformable flat panels called FlexMaps. For these panels, we design and obtain specific mechanical properties such that, once they are assembled, the static equilibrium configuration matches the desired 3D shape. FlexMaps can be fabricated from an almost rigid material, such as wood or plastic, and are made flexible in a controlled way by using computationally designed spiraling microstructures.","lang":"eng"}],"publication_status":"published","article_type":"original"},{"citation":{"short":"Y. Zhang, Y. Liu, K.H. Lim, C. Xing, M. Li, T. Zhang, P. Tang, J. Arbiol, J. Llorca, K.M. Ng, M. Ibáñez, P. Guardia, M. Prato, D. Cadavid, A. Cabot, Angewandte Chemie International Edition 57 (2018) 17063–17068.","chicago":"Zhang, Yu, Yu Liu, Khak Ho Lim, Congcong Xing, Mengyao Li, Ting Zhang, Pengyi Tang, et al. “Tin Diselenide Molecular Precursor for Solution-Processable Thermoelectric Materials.” <i>Angewandte Chemie International Edition</i>. Wiley, 2018. <a href=\"https://doi.org/10.1002/anie.201809847\">https://doi.org/10.1002/anie.201809847</a>.","ista":"Zhang Y, Liu Y, Lim KH, Xing C, Li M, Zhang T, Tang P, Arbiol J, Llorca J, Ng KM, Ibáñez M, Guardia P, Prato M, Cadavid D, Cabot A. 2018. Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. 57(52), 17063–17068.","mla":"Zhang, Yu, et al. “Tin Diselenide Molecular Precursor for Solution-Processable Thermoelectric Materials.” <i>Angewandte Chemie International Edition</i>, vol. 57, no. 52, Wiley, 2018, pp. 17063–68, doi:<a href=\"https://doi.org/10.1002/anie.201809847\">10.1002/anie.201809847</a>.","apa":"Zhang, Y., Liu, Y., Lim, K. H., Xing, C., Li, M., Zhang, T., … Cabot, A. (2018). Tin diselenide molecular precursor for solution-processable thermoelectric materials. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201809847\">https://doi.org/10.1002/anie.201809847</a>","ama":"Zhang Y, Liu Y, Lim KH, et al. Tin diselenide molecular precursor for solution-processable thermoelectric materials. <i>Angewandte Chemie International Edition</i>. 2018;57(52):17063-17068. doi:<a href=\"https://doi.org/10.1002/anie.201809847\">10.1002/anie.201809847</a>","ieee":"Y. Zhang <i>et al.</i>, “Tin diselenide molecular precursor for solution-processable thermoelectric materials,” <i>Angewandte Chemie International Edition</i>, vol. 57, no. 52. Wiley, pp. 17063–17068, 2018."},"page":"17063-17068","publication":"Angewandte Chemie International Edition","isi":1,"scopus_import":"1","status":"public","department":[{"_id":"MaIb"}],"issue":"52","article_processing_charge":"No","title":"Tin diselenide molecular precursor for solution-processable thermoelectric materials","date_updated":"2023-09-19T14:28:31Z","publication_identifier":{"issn":["1433-7851"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"quality_controlled":"1","abstract":[{"text":"In the present work, we detail a fast and simple solution-based method to synthesize hexagonal SnSe2 nanoplates (NPLs) and their use to produce crystallographically textured SnSe2 nanomaterials. We also demonstrate that the same strategy can be used to produce orthorhombic SnSe nanostructures and nanomaterials. NPLs are grown through a screw dislocation-driven mechanism. This mechanism typically results in pyramidal structures, but we demonstrate here that the growth from multiple dislocations results in flower-like structures. Crystallographically textured SnSe2 bulk nanomaterials obtained from the hot pressing of these SnSe2 structures display highly anisotropic charge and heat transport properties and thermoelectric (TE) figures of merit limited by relatively low electrical conductivities. To improve this parameter, SnSe2 NPLs are blended here with metal nanoparticles. The electrical conductivities of the blends are significantly improved with respect to bare SnSe2 NPLs, what translates into a three-fold increase of the TE Figure of merit, reaching unprecedented ZT values up to 0.65.","lang":"eng"}],"publication_status":"published","article_type":"original","date_published":"2018-12-21T00:00:00Z","volume":57,"year":"2018","oa":1,"month":"12","oa_version":"Submitted Version","external_id":{"isi":["000454575500020"]},"day":"21","intvolume":"        57","type":"journal_article","date_created":"2019-02-14T10:23:27Z","author":[{"last_name":"Zhang","first_name":"Yu","full_name":"Zhang, Yu"},{"first_name":"Yu","last_name":"Liu","full_name":"Liu, Yu"},{"first_name":"Khak Ho","last_name":"Lim","full_name":"Lim, Khak Ho"},{"full_name":"Xing, Congcong","first_name":"Congcong","last_name":"Xing"},{"last_name":"Li","first_name":"Mengyao","full_name":"Li, Mengyao"},{"first_name":"Ting","last_name":"Zhang","full_name":"Zhang, Ting"},{"full_name":"Tang, Pengyi","first_name":"Pengyi","last_name":"Tang"},{"full_name":"Arbiol, Jordi","first_name":"Jordi","last_name":"Arbiol"},{"full_name":"Llorca, Jordi","last_name":"Llorca","first_name":"Jordi"},{"first_name":"Ka Ming","last_name":"Ng","full_name":"Ng, Ka Ming"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","first_name":"Maria","last_name":"Ibáñez"},{"last_name":"Guardia","first_name":"Pablo","full_name":"Guardia, Pablo"},{"full_name":"Prato, Mirko","first_name":"Mirko","last_name":"Prato"},{"full_name":"Cadavid, Doris","first_name":"Doris","last_name":"Cadavid"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"doi":"10.1002/anie.201809847","_id":"5982","publisher":"Wiley","main_file_link":[{"open_access":"1","url":"https://upcommons.upc.edu/bitstream/2117/130444/1/Zhang%20preprint.pdf"}]},{"issue":"22","department":[{"_id":"MiLe"},{"_id":"RoSe"}],"status":"public","isi":1,"scopus_import":"1","citation":{"ama":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. Theory of the rotating polaron: Spectrum and self-localization. <i>Physical Review B</i>. 2018;98(22). doi:<a href=\"https://doi.org/10.1103/physrevb.98.224506\">10.1103/physrevb.98.224506</a>","apa":"Yakaboylu, E., Midya, B., Deuchert, A., Leopold, N. K., &#38; Lemeshko, M. (2018). Theory of the rotating polaron: Spectrum and self-localization. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.98.224506\">https://doi.org/10.1103/physrevb.98.224506</a>","ieee":"E. Yakaboylu, B. Midya, A. Deuchert, N. K. Leopold, and M. Lemeshko, “Theory of the rotating polaron: Spectrum and self-localization,” <i>Physical Review B</i>, vol. 98, no. 22. American Physical Society, 2018.","chicago":"Yakaboylu, Enderalp, Bikashkali Midya, Andreas Deuchert, Nikolai K Leopold, and Mikhail Lemeshko. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” <i>Physical Review B</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/physrevb.98.224506\">https://doi.org/10.1103/physrevb.98.224506</a>.","ista":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. 2018. Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. 98(22), 224506.","mla":"Yakaboylu, Enderalp, et al. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” <i>Physical Review B</i>, vol. 98, no. 22, 224506, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/physrevb.98.224506\">10.1103/physrevb.98.224506</a>.","short":"E. Yakaboylu, B. Midya, A. Deuchert, N.K. Leopold, M. Lemeshko, Physical Review B 98 (2018)."},"publication":"Physical Review B","quality_controlled":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"date_updated":"2025-04-14T07:26:59Z","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"title":"Theory of the rotating polaron: Spectrum and self-localization","article_number":"224506","article_processing_charge":"No","day":"12","oa_version":"Preprint","external_id":{"isi":["000452992700008"],"arxiv":["1809.01204"]},"ec_funded":1,"month":"12","volume":98,"date_published":"2018-12-12T00:00:00Z","year":"2018","oa":1,"arxiv":1,"abstract":[{"lang":"eng","text":"We study a quantum impurity possessing both translational and internal rotational degrees of freedom interacting with a bosonic bath. Such a system corresponds to a “rotating polaron,” which can be used to model, e.g., a rotating molecule immersed in an ultracold Bose gas or superfluid helium. We derive the Hamiltonian of the rotating polaron and study its spectrum in the weak- and strong-coupling regimes using a combination of variational, diagrammatic, and mean-field approaches. We reveal how the coupling between linear and angular momenta affects stable quasiparticle states, and demonstrate that internal rotation leads to an enhanced self-localization in the translational degrees of freedom."}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01204"}],"publisher":"American Physical Society","_id":"5983","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"}],"doi":"10.1103/physrevb.98.224506","author":[{"first_name":"Enderalp","last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","full_name":"Yakaboylu, Enderalp","orcid":"0000-0001-5973-0874"},{"id":"456187FC-F248-11E8-B48F-1D18A9856A87","full_name":"Midya, Bikashkali","last_name":"Midya","first_name":"Bikashkali"},{"first_name":"Andreas","last_name":"Deuchert","full_name":"Deuchert, Andreas","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3146-6746"},{"first_name":"Nikolai K","last_name":"Leopold","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","full_name":"Leopold, Nikolai K","orcid":"0000-0002-0495-6822"},{"last_name":"Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2019-02-14T10:37:09Z","intvolume":"        98","type":"journal_article"},{"publisher":"Springer Nature","_id":"5984","file":[{"checksum":"8325fcc194264af4749e662a73bf66b5","relation":"main_file","file_id":"5985","content_type":"application/pdf","file_size":1349914,"access_level":"open_access","date_updated":"2020-07-14T12:47:14Z","creator":"kschuh","file_name":"2018_Springer_Morri.pdf","date_created":"2019-02-14T10:58:29Z"}],"intvolume":"         9","type":"journal_article","doi":"10.1038/s41467-018-04342-1","project":[{"grant_number":"303564","_id":"25548C20-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Microbial Ion Channels for Synthetic Neurobiology"},{"_id":"255A6082-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Molecular Drug Targets","grant_number":"W1232-B24"}],"date_created":"2019-02-14T10:50:24Z","author":[{"first_name":"Maurizio","last_name":"Morri","id":"4863116E-F248-11E8-B48F-1D18A9856A87","full_name":"Morri, Maurizio"},{"first_name":"Inmaculada","last_name":"Sanchez-Romero","id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87","full_name":"Sanchez-Romero, Inmaculada"},{"full_name":"Tichy, Alexandra-Madelaine","id":"29D8BB2C-F248-11E8-B48F-1D18A9856A87","first_name":"Alexandra-Madelaine","last_name":"Tichy"},{"first_name":"Stephanie","last_name":"Kainrath","full_name":"Kainrath, Stephanie","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Elliot J.","last_name":"Gerrard","full_name":"Gerrard, Elliot J."},{"id":"435ACB3A-F248-11E8-B48F-1D18A9856A87","full_name":"Hirschfeld, Priscila","first_name":"Priscila","last_name":"Hirschfeld"},{"id":"346C1EC6-F248-11E8-B48F-1D18A9856A87","full_name":"Schwarz, Jan","first_name":"Jan","last_name":"Schwarz"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315","first_name":"Harald L","last_name":"Janovjak"}],"month":"12","has_accepted_license":"1","day":"01","external_id":{"isi":["000432280000006"]},"ec_funded":1,"oa_version":"Published Version","publication_status":"published","abstract":[{"text":"G-protein-coupled receptors (GPCRs) form the largest receptor family, relay environmental stimuli to changes in cell behavior and represent prime drug targets. Many GPCRs are classified as orphan receptors because of the limited knowledge on their ligands and coupling to cellular signaling machineries. Here, we engineer a library of 63 chimeric receptors that contain the signaling domains of human orphan and understudied GPCRs functionally linked to the light-sensing domain of rhodopsin. Upon stimulation with visible light, we identify activation of canonical cell signaling pathways, including cAMP-, Ca2+-, MAPK/ERK-, and Rho-dependent pathways, downstream of the engineered receptors. For the human pseudogene GPR33, we resurrect a signaling function that supports its hypothesized role as a pathogen entry site. These results demonstrate that substituting unknown chemical activators with a light switch can reveal information about protein function and provide an optically controlled protein library for exploring the physiology and therapeutic potential of understudied GPCRs.","lang":"eng"}],"file_date_updated":"2020-07-14T12:47:14Z","year":"2018","oa":1,"volume":9,"date_published":"2018-12-01T00:00:00Z","quality_controlled":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"article_number":"1950","article_processing_charge":"No","publication_identifier":{"issn":["2041-1723"]},"date_updated":"2025-04-15T07:22:42Z","title":"Optical functionalization of human class A orphan G-protein-coupled receptors","department":[{"_id":"HaJa"},{"_id":"CaGu"},{"_id":"MiSi"}],"issue":"1","ddc":["570"],"scopus_import":"1","isi":1,"publication":"Nature Communications","citation":{"chicago":"Morri, Maurizio, Inmaculada Sanchez-Romero, Alexandra-Madelaine Tichy, Stephanie Kainrath, Elliot J. Gerrard, Priscila Hirschfeld, Jan Schwarz, and Harald L Janovjak. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” <i>Nature Communications</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1038/s41467-018-04342-1\">https://doi.org/10.1038/s41467-018-04342-1</a>.","mla":"Morri, Maurizio, et al. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” <i>Nature Communications</i>, vol. 9, no. 1, 1950, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1038/s41467-018-04342-1\">10.1038/s41467-018-04342-1</a>.","ista":"Morri M, Sanchez-Romero I, Tichy A-M, Kainrath S, Gerrard EJ, Hirschfeld P, Schwarz J, Janovjak HL. 2018. Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. 9(1), 1950.","short":"M. Morri, I. Sanchez-Romero, A.-M. Tichy, S. Kainrath, E.J. Gerrard, P. Hirschfeld, J. Schwarz, H.L. Janovjak, Nature Communications 9 (2018).","ama":"Morri M, Sanchez-Romero I, Tichy A-M, et al. Optical functionalization of human class A orphan G-protein-coupled receptors. <i>Nature Communications</i>. 2018;9(1). doi:<a href=\"https://doi.org/10.1038/s41467-018-04342-1\">10.1038/s41467-018-04342-1</a>","apa":"Morri, M., Sanchez-Romero, I., Tichy, A.-M., Kainrath, S., Gerrard, E. J., Hirschfeld, P., … Janovjak, H. L. (2018). Optical functionalization of human class A orphan G-protein-coupled receptors. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-018-04342-1\">https://doi.org/10.1038/s41467-018-04342-1</a>","ieee":"M. Morri <i>et al.</i>, “Optical functionalization of human class A orphan G-protein-coupled receptors,” <i>Nature Communications</i>, vol. 9, no. 1. Springer Nature, 2018."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"status":"public"},{"scopus_import":"1","isi":1,"publication":"Genome Biology and Evolution","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png"},"page":"840-856","citation":{"chicago":"Kincaid-Smith, Julien, Marion A L Picard, Céline Cosseau, Jérôme Boissier, Dany Severac, Christoph Grunau, and Eve Toulza. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” <i>Genome Biology and Evolution</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/gbe/evy037\">https://doi.org/10.1093/gbe/evy037</a>.","ista":"Kincaid-Smith J, Picard MAL, Cosseau C, Boissier J, Severac D, Grunau C, Toulza E. 2018. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. 10(3), 840–856.","mla":"Kincaid-Smith, Julien, et al. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” <i>Genome Biology and Evolution</i>, vol. 10, no. 3, Oxford University Press, 2018, pp. 840–56, doi:<a href=\"https://doi.org/10.1093/gbe/evy037\">10.1093/gbe/evy037</a>.","short":"J. Kincaid-Smith, M.A.L. Picard, C. Cosseau, J. Boissier, D. Severac, C. Grunau, E. Toulza, Genome Biology and Evolution 10 (2018) 840–856.","apa":"Kincaid-Smith, J., Picard, M. A. L., Cosseau, C., Boissier, J., Severac, D., Grunau, C., &#38; Toulza, E. (2018). Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. <i>Genome Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/gbe/evy037\">https://doi.org/10.1093/gbe/evy037</a>","ama":"Kincaid-Smith J, Picard MAL, Cosseau C, et al. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. <i>Genome Biology and Evolution</i>. 2018;10(3):840-856. doi:<a href=\"https://doi.org/10.1093/gbe/evy037\">10.1093/gbe/evy037</a>","ieee":"J. Kincaid-Smith <i>et al.</i>, “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites,” <i>Genome Biology and Evolution</i>, vol. 10, no. 3. Oxford University Press, pp. 840–856, 2018."},"status":"public","department":[{"_id":"BeVi"}],"issue":"3","ddc":["570"],"article_processing_charge":"No","publication_identifier":{"issn":["1759-6653"]},"date_updated":"2023-09-19T14:39:08Z","title":"Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","abstract":[{"lang":"eng","text":"Schistosomes are the causative agents of schistosomiasis, a neglected tropical disease affecting over 230 million people worldwide.Additionally to their major impact on human health, they are also models of choice in evolutionary biology. These parasitic flatwormsare unique among the common hermaphroditic trematodes as they have separate sexes. This so-called “evolutionary scandal”displays a female heterogametic genetic sex-determination system (ZZ males and ZW females), as well as a pronounced adult sexualdimorphism. These phenotypic differences are determined by a shared set of genes in both sexes, potentially leading to intralocussexual conflicts. To resolve these conflicts in sexually selected traits, molecular mechanisms such as sex-biased gene expression couldoccur, but parent-of-origin gene expression also provides an alternative. In this work we investigated the latter mechanism, that is,genes expressed preferentially from either the maternal or the paternal allele, inSchistosoma mansonispecies. To this end, tran-scriptomes from male and female hybrid adults obtained by strain crosses were sequenced. Strain-specific single nucleotide poly-morphism (SNP) markers allowed us to discriminate the parental origin, while reciprocal crosses helped to differentiate parentalexpression from strain-specific expression. We identified genes containing SNPs expressed in a parent-of-origin manner consistentwith paternal and maternal imprints. Although the majority of the SNPs was identified in mitochondrial and Z-specific loci, theremaining SNPs found in male and female transcriptomes were situated in genes that have the potential to explain sexual differencesin schistosome parasites. Furthermore, we identified and validated four new Z-specific scaffolds."}],"file_date_updated":"2020-07-14T12:47:15Z","oa":1,"year":"2018","volume":10,"date_published":"2018-03-01T00:00:00Z","month":"03","has_accepted_license":"1","day":"01","external_id":{"isi":["000429483700013"]},"oa_version":"Published Version","type":"journal_article","intvolume":"        10","doi":"10.1093/gbe/evy037","date_created":"2019-02-14T12:13:52Z","author":[{"full_name":"Kincaid-Smith, Julien","first_name":"Julien","last_name":"Kincaid-Smith"},{"last_name":"Picard","first_name":"Marion A L","orcid":"0000-0002-8101-2518","id":"2C921A7A-F248-11E8-B48F-1D18A9856A87","full_name":"Picard, Marion A L"},{"last_name":"Cosseau","first_name":"Céline","full_name":"Cosseau, Céline"},{"first_name":"Jérôme","last_name":"Boissier","full_name":"Boissier, Jérôme"},{"full_name":"Severac, Dany","first_name":"Dany","last_name":"Severac"},{"full_name":"Grunau, Christoph","first_name":"Christoph","last_name":"Grunau"},{"full_name":"Toulza, Eve","first_name":"Eve","last_name":"Toulza"}],"publisher":"Oxford University Press","_id":"5989","file":[{"file_id":"5991","relation":"main_file","checksum":"736a459cb77de5824354466bb0331caf","file_size":529755,"access_level":"open_access","content_type":"application/pdf","date_created":"2019-02-14T12:20:01Z","file_name":"2018_GBE_Kincaid_Smith.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:15Z"}]},{"article_number":"1802257","article_processing_charge":"No","publication_identifier":{"issn":["0935-9648"]},"date_updated":"2023-09-19T14:29:58Z","title":"Josephson effect in a few-hole quantum dot","quality_controlled":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"scopus_import":"1","isi":1,"publication":"Advanced Materials","citation":{"chicago":"Ridderbos, Joost, Matthias Brauns, Jie Shen, Folkert K. de Vries, Ang Li, Erik P. A. M. Bakkers, Alexander Brinkman, and Floris A. Zwanenburg. “Josephson Effect in a Few-Hole Quantum Dot.” <i>Advanced Materials</i>. Wiley, 2018. <a href=\"https://doi.org/10.1002/adma.201802257\">https://doi.org/10.1002/adma.201802257</a>.","mla":"Ridderbos, Joost, et al. “Josephson Effect in a Few-Hole Quantum Dot.” <i>Advanced Materials</i>, vol. 30, no. 44, 1802257, Wiley, 2018, doi:<a href=\"https://doi.org/10.1002/adma.201802257\">10.1002/adma.201802257</a>.","ista":"Ridderbos J, Brauns M, Shen J, de Vries FK, Li A, Bakkers EPAM, Brinkman A, Zwanenburg FA. 2018. Josephson effect in a few-hole quantum dot. Advanced Materials. 30(44), 1802257.","short":"J. Ridderbos, M. Brauns, J. Shen, F.K. de Vries, A. Li, E.P.A.M. Bakkers, A. Brinkman, F.A. Zwanenburg, Advanced Materials 30 (2018).","ama":"Ridderbos J, Brauns M, Shen J, et al. Josephson effect in a few-hole quantum dot. <i>Advanced Materials</i>. 2018;30(44). doi:<a href=\"https://doi.org/10.1002/adma.201802257\">10.1002/adma.201802257</a>","apa":"Ridderbos, J., Brauns, M., Shen, J., de Vries, F. K., Li, A., Bakkers, E. P. A. M., … Zwanenburg, F. A. (2018). Josephson effect in a few-hole quantum dot. <i>Advanced Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adma.201802257\">https://doi.org/10.1002/adma.201802257</a>","ieee":"J. Ridderbos <i>et al.</i>, “Josephson effect in a few-hole quantum dot,” <i>Advanced Materials</i>, vol. 30, no. 44. Wiley, 2018."},"status":"public","department":[{"_id":"GeKa"}],"issue":"44","type":"journal_article","intvolume":"        30","doi":"10.1002/adma.201802257","date_created":"2019-02-14T12:14:26Z","author":[{"last_name":"Ridderbos","first_name":"Joost","full_name":"Ridderbos, Joost"},{"first_name":"Matthias","last_name":"Brauns","full_name":"Brauns, Matthias","id":"33F94E3C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Shen, Jie","first_name":"Jie","last_name":"Shen"},{"last_name":"de Vries","first_name":"Folkert K.","full_name":"de Vries, Folkert K."},{"last_name":"Li","first_name":"Ang","full_name":"Li, Ang"},{"full_name":"Bakkers, Erik P. A. M.","last_name":"Bakkers","first_name":"Erik P. A. M."},{"full_name":"Brinkman, Alexander","last_name":"Brinkman","first_name":"Alexander"},{"last_name":"Zwanenburg","first_name":"Floris A.","full_name":"Zwanenburg, Floris A."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.08487"}],"publisher":"Wiley","_id":"5990","publication_status":"published","abstract":[{"lang":"eng","text":"A Ge–Si core–shell nanowire is used to realize a Josephson field‐effect transistor with highly transparent contacts to superconducting leads. By changing the electric field, access to two distinct regimes, not combined before in a single device, is gained: in the accumulation mode the device is highly transparent and the supercurrent is carried by multiple subbands, while near depletion, the supercurrent is carried by single‐particle levels of a strongly coupled quantum dot operating in the few‐hole regime. These results establish Ge–Si nanowires as an important platform for hybrid superconductor–semiconductor physics and Majorana fermions."}],"year":"2018","oa":1,"date_published":"2018-11-02T00:00:00Z","volume":30,"arxiv":1,"month":"11","day":"02","external_id":{"arxiv":["1809.08487"],"isi":["000450232800015"]},"oa_version":"Preprint"},{"article_number":"7","article_processing_charge":"No","publication_identifier":{"issn":["0164-0925"]},"date_updated":"2025-04-15T08:12:22Z","title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"scopus_import":"1","isi":1,"publication":"ACM Transactions on Programming Languages and Systems","citation":{"ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 40, no. 2. Association for Computing Machinery, 2018.","apa":"Chatterjee, K., Fu, H., Novotný, P., &#38; Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. <i>ACM Transactions on Programming Languages and Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3174800\">https://doi.org/10.1145/3174800</a>","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. <i>ACM Transactions on Programming Languages and Systems</i>. 2018;40(2). doi:<a href=\"https://doi.org/10.1145/3174800\">10.1145/3174800</a>","ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2018. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 40(2), 7.","mla":"Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 40, no. 2, 7, Association for Computing Machinery, 2018, doi:<a href=\"https://doi.org/10.1145/3174800\">10.1145/3174800</a>.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” <i>ACM Transactions on Programming Languages and Systems</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3174800\">https://doi.org/10.1145/3174800</a>.","short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming Languages and Systems 40 (2018)."},"status":"public","department":[{"_id":"KrCh"}],"issue":"2","type":"journal_article","intvolume":"        40","doi":"10.1145/3174800","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"date_created":"2019-02-14T12:29:10Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Novotný, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotný","first_name":"Petr"},{"last_name":"Hasheminezhad","first_name":"Rouzbeh","full_name":"Hasheminezhad, Rouzbeh"}],"publisher":"Association for Computing Machinery","main_file_link":[{"url":"https://arxiv.org/abs/1510.08517","open_access":"1"}],"_id":"5993","publication_status":"published","abstract":[{"lang":"eng","text":"In this article, we consider the termination problem of probabilistic programs with real-valued variables. Thequestions concerned are: qualitative ones that ask (i) whether the program terminates with probability 1(almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); andquantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) tocompute a boundBsuch that the probability not to terminate afterBsteps decreases exponentially (con-centration problem). To solve these questions, we utilize the notion of ranking supermartingales, which isa powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmicsynthesis of linear ranking-supermartingales over affine probabilistic programs (Apps) with both angelic anddemonic non-determinism. An important subclass of Apps is LRApp which is defined as the class of all Appsover which a linear ranking-supermartingale exists.Our main contributions are as follows. Firstly, we show that the membership problem of LRApp (i) canbe decided in polynomial time for Apps with at most demonic non-determinism, and (ii) isNP-hard and inPSPACEfor Apps with angelic non-determinism. Moreover, theNP-hardness result holds already for Appswithout probability and demonic non-determinism. Secondly, we show that the concentration problem overLRApp can be solved in the same complexity as for the membership problem of LRApp. Finally, we show thatthe expectation problem over LRApp can be solved in2EXPTIMEand isPSPACE-hard even for Apps withoutprobability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate theeffectiveness of our approach to answer the qualitative and quantitative questions over Apps with at mostdemonic non-determinism."}],"related_material":{"record":[{"id":"1438","status":"public","relation":"earlier_version"}]},"oa":1,"year":"2018","volume":40,"date_published":"2018-06-01T00:00:00Z","arxiv":1,"month":"06","day":"01","external_id":{"arxiv":["1510.08517"],"isi":["000434634500003"]},"ec_funded":1,"oa_version":"Submitted Version"},{"isi":1,"scopus_import":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"ama":"Velicky P, Meinhardt G, Plessl K, et al. Genome amplification and cellular senescence are hallmarks of human placenta development. <i>PLOS Genetics</i>. 2018;14(10). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007698\">10.1371/journal.pgen.1007698</a>","apa":"Velicky, P., Meinhardt, G., Plessl, K., Vondra, S., Weiss, T., Haslinger, P., … Pollheimer, J. (2018). Genome amplification and cellular senescence are hallmarks of human placenta development. <i>PLOS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1007698\">https://doi.org/10.1371/journal.pgen.1007698</a>","ieee":"P. Velicky <i>et al.</i>, “Genome amplification and cellular senescence are hallmarks of human placenta development,” <i>PLOS Genetics</i>, vol. 14, no. 10. Public Library of Science, 2018.","chicago":"Velicky, Philipp, Gudrun Meinhardt, Kerstin Plessl, Sigrid Vondra, Tamara Weiss, Peter Haslinger, Thomas Lendl, et al. “Genome Amplification and Cellular Senescence Are Hallmarks of Human Placenta Development.” <i>PLOS Genetics</i>. Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pgen.1007698\">https://doi.org/10.1371/journal.pgen.1007698</a>.","mla":"Velicky, Philipp, et al. “Genome Amplification and Cellular Senescence Are Hallmarks of Human Placenta Development.” <i>PLOS Genetics</i>, vol. 14, no. 10, e1007698, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007698\">10.1371/journal.pgen.1007698</a>.","ista":"Velicky P, Meinhardt G, Plessl K, Vondra S, Weiss T, Haslinger P, Lendl T, Aumayr K, Mairhofer M, Zhu X, Schütz B, Hannibal RL, Lindau R, Weil B, Ernerudh J, Neesen J, Egger G, Mikula M, Röhrl C, Urban AE, Baker J, Knöfler M, Pollheimer J. 2018. Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. 14(10), e1007698.","short":"P. Velicky, G. Meinhardt, K. Plessl, S. Vondra, T. Weiss, P. Haslinger, T. Lendl, K. Aumayr, M. Mairhofer, X. Zhu, B. Schütz, R.L. Hannibal, R. Lindau, B. Weil, J. Ernerudh, J. Neesen, G. Egger, M. Mikula, C. Röhrl, A.E. Urban, J. Baker, M. Knöfler, J. Pollheimer, PLOS Genetics 14 (2018)."},"publication":"PLOS Genetics","status":"public","department":[{"_id":"JoDa"}],"ddc":["570"],"issue":"10","article_number":"e1007698","article_processing_charge":"No","date_updated":"2023-09-19T14:31:43Z","publication_identifier":{"issn":["1553-7404"]},"title":"Genome amplification and cellular senescence are hallmarks of human placenta development","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"Genome amplification and cellular senescence are commonly associated with pathological processes. While physiological roles for polyploidization and senescence have been described in mouse development, controversy exists over their significance in humans. Here, we describe tetraploidization and senescence as phenomena of normal human placenta development. During pregnancy, placental extravillous trophoblasts (EVTs) invade the pregnant endometrium, termed decidua, to establish an adapted microenvironment required for the developing embryo. This process is critically dependent on continuous cell proliferation and differentiation, which is thought to follow the classical model of cell cycle arrest prior to terminal differentiation. Strikingly, flow cytometry and DNAseq revealed that EVT formation is accompanied with a genome-wide polyploidization, independent of mitotic cycles. DNA replication in these cells was analysed by a fluorescent cell-cycle indicator reporter system, cell cycle marker expression and EdU incorporation. Upon invasion into the decidua, EVTs widely lose their replicative potential and enter a senescent state characterized by high senescence-associated (SA) β-galactosidase activity, induction of a SA secretory phenotype as well as typical metabolic alterations. Furthermore, we show that the shift from endocycle-dependent genome amplification to growth arrest is disturbed in androgenic complete hydatidiform moles (CHM), a hyperplastic pregnancy disorder associated with increased risk of developing choriocarinoma. Senescence is decreased in CHM-EVTs, accompanied by exacerbated endoreduplication and hyperploidy. We propose induction of cellular senescence as a ploidy-limiting mechanism during normal human placentation and unravel a link between excessive polyploidization and reduced senescence in CHM."}],"publication_status":"published","file_date_updated":"2020-07-14T12:47:15Z","volume":14,"date_published":"2018-10-12T00:00:00Z","year":"2018","oa":1,"has_accepted_license":"1","month":"10","day":"12","oa_version":"Published Version","external_id":{"isi":["000449328500025"]},"intvolume":"        14","type":"journal_article","doi":"10.1371/journal.pgen.1007698","author":[{"id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","full_name":"Velicky, Philipp","orcid":"0000-0002-2340-7431","first_name":"Philipp","last_name":"Velicky"},{"last_name":"Meinhardt","first_name":"Gudrun","full_name":"Meinhardt, Gudrun"},{"full_name":"Plessl, Kerstin","last_name":"Plessl","first_name":"Kerstin"},{"full_name":"Vondra, Sigrid","first_name":"Sigrid","last_name":"Vondra"},{"last_name":"Weiss","first_name":"Tamara","full_name":"Weiss, Tamara"},{"first_name":"Peter","last_name":"Haslinger","full_name":"Haslinger, Peter"},{"full_name":"Lendl, Thomas","first_name":"Thomas","last_name":"Lendl"},{"first_name":"Karin","last_name":"Aumayr","full_name":"Aumayr, Karin"},{"full_name":"Mairhofer, Mario","last_name":"Mairhofer","first_name":"Mario"},{"first_name":"Xiaowei","last_name":"Zhu","full_name":"Zhu, Xiaowei"},{"full_name":"Schütz, Birgit","first_name":"Birgit","last_name":"Schütz"},{"first_name":"Roberta L.","last_name":"Hannibal","full_name":"Hannibal, Roberta L."},{"first_name":"Robert","last_name":"Lindau","full_name":"Lindau, Robert"},{"full_name":"Weil, Beatrix","last_name":"Weil","first_name":"Beatrix"},{"last_name":"Ernerudh","first_name":"Jan","full_name":"Ernerudh, Jan"},{"full_name":"Neesen, Jürgen","first_name":"Jürgen","last_name":"Neesen"},{"first_name":"Gerda","last_name":"Egger","full_name":"Egger, Gerda"},{"first_name":"Mario","last_name":"Mikula","full_name":"Mikula, Mario"},{"full_name":"Röhrl, Clemens","last_name":"Röhrl","first_name":"Clemens"},{"full_name":"Urban, Alexander E.","last_name":"Urban","first_name":"Alexander E."},{"full_name":"Baker, Julie","first_name":"Julie","last_name":"Baker"},{"first_name":"Martin","last_name":"Knöfler","full_name":"Knöfler, Martin"},{"full_name":"Pollheimer, Jürgen","last_name":"Pollheimer","first_name":"Jürgen"}],"date_created":"2019-02-14T13:07:45Z","publisher":"Public Library of Science","_id":"5998","file":[{"file_name":"2018_PLOS_Velicky.pdf","date_created":"2019-02-14T13:14:35Z","creator":"kschuh","date_updated":"2020-07-14T12:47:15Z","access_level":"open_access","file_size":4592947,"content_type":"application/pdf","file_id":"6000","relation":"main_file","checksum":"34aa9a5972f61889c19f18be8ee787a0"}]},{"publication_identifier":{"issn":["0024-6115"]},"date_updated":"2023-09-19T14:37:19Z","title":"The cohomological Hall algebra of a preprojective algebra","article_processing_charge":"No","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","scopus_import":"1","isi":1,"publication":"Proceedings of the London Mathematical Society","citation":{"short":"Y. Yang, G. Zhao, Proceedings of the London Mathematical Society 116 (2018) 1029–1074.","chicago":"Yang, Yaping, and Gufang Zhao. “The Cohomological Hall Algebra of a Preprojective Algebra.” <i>Proceedings of the London Mathematical Society</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1112/plms.12111\">https://doi.org/10.1112/plms.12111</a>.","mla":"Yang, Yaping, and Gufang Zhao. “The Cohomological Hall Algebra of a Preprojective Algebra.” <i>Proceedings of the London Mathematical Society</i>, vol. 116, no. 5, Oxford University Press, 2018, pp. 1029–74, doi:<a href=\"https://doi.org/10.1112/plms.12111\">10.1112/plms.12111</a>.","ista":"Yang Y, Zhao G. 2018. The cohomological Hall algebra of a preprojective algebra. Proceedings of the London Mathematical Society. 116(5), 1029–1074.","ama":"Yang Y, Zhao G. The cohomological Hall algebra of a preprojective algebra. <i>Proceedings of the London Mathematical Society</i>. 2018;116(5):1029-1074. doi:<a href=\"https://doi.org/10.1112/plms.12111\">10.1112/plms.12111</a>","apa":"Yang, Y., &#38; Zhao, G. (2018). The cohomological Hall algebra of a preprojective algebra. <i>Proceedings of the London Mathematical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1112/plms.12111\">https://doi.org/10.1112/plms.12111</a>","ieee":"Y. Yang and G. Zhao, “The cohomological Hall algebra of a preprojective algebra,” <i>Proceedings of the London Mathematical Society</i>, vol. 116, no. 5. Oxford University Press, pp. 1029–1074, 2018."},"page":"1029-1074","issue":"5","department":[{"_id":"TaHa"}],"doi":"10.1112/plms.12111","author":[{"last_name":"Yang","first_name":"Yaping","full_name":"Yang, Yaping"},{"id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","full_name":"Zhao, Gufang","first_name":"Gufang","last_name":"Zhao"}],"date_created":"2019-02-14T13:14:22Z","intvolume":"       116","type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/1407.7994","open_access":"1"}],"publisher":"Oxford University Press","_id":"5999","year":"2018","oa":1,"volume":116,"date_published":"2018-05-01T00:00:00Z","arxiv":1,"publication_status":"published","abstract":[{"lang":"eng","text":"We introduce for each quiver Q and each algebraic oriented cohomology theory A, the cohomological Hall algebra (CoHA) of Q, as the A-homology of the moduli of representations of the preprojective algebra of Q. This generalizes the K-theoretic Hall algebra of commuting varieties defined by Schiffmann-Vasserot. When A is the Morava K-theory, we show evidence that this algebra is a candidate for Lusztig's reformulated conjecture on modular representations of algebraic groups.\r\nWe construct an action of the preprojective CoHA on the A-homology of Nakajima quiver varieties. We compare this with the action of the Borel subalgebra of Yangian when A is the intersection theory. We also give a shuffle algebra description of this CoHA in terms of the underlying formal group law of A. As applications, we obtain a shuffle description of the Yangian. "}],"day":"01","external_id":{"arxiv":["1407.7994"],"isi":["000431506400001"]},"oa_version":"Preprint","month":"05"},{"citation":{"ama":"Clarke E, Henzinger TA, Veith H. Introduction to model checking. In: Henzinger TA, ed. <i>Handbook of Model Checking</i>. Handbook of Model Checking. Springer; 2018:1-26. doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">10.1007/978-3-319-10575-8_1</a>","apa":"Clarke, E., Henzinger, T. A., &#38; Veith, H. (2018). Introduction to model checking. In T. A. Henzinger (Ed.), <i>Handbook of Model Checking</i> (pp. 1–26). Springer. <a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">https://doi.org/10.1007/978-3-319-10575-8_1</a>","ieee":"E. Clarke, T. A. Henzinger, and H. Veith, “Introduction to model checking,” in <i>Handbook of Model Checking</i>, T. A. Henzinger, Ed. Springer, 2018, pp. 1–26.","chicago":"Clarke, Edmund, Thomas A Henzinger, and Helmut Veith. “Introduction to Model Checking.” In <i>Handbook of Model Checking</i>, edited by Thomas A Henzinger, 1–26. Handbook of Model Checking. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">https://doi.org/10.1007/978-3-319-10575-8_1</a>.","ista":"Clarke E, Henzinger TA, Veith H. 2018.Introduction to model checking. In: Handbook of Model Checking. , 1–26.","mla":"Clarke, Edmund, et al. “Introduction to Model Checking.” <i>Handbook of Model Checking</i>, edited by Thomas A Henzinger, Springer, 2018, pp. 1–26, doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">10.1007/978-3-319-10575-8_1</a>.","short":"E. Clarke, T.A. Henzinger, H. Veith, in:, T.A. Henzinger (Ed.), Handbook of Model Checking, Springer, 2018, pp. 1–26."},"page":"1 - 26","publist_id":"7994","publication":"Handbook of Model Checking","abstract":[{"lang":"eng","text":"Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. This chapter is an introduction and short survey of model checking. The chapter aims to motivate and link the individual chapters of the handbook, and to provide context for readers who are not familiar with model checking."}],"scopus_import":1,"publication_status":"published","date_published":"2018-05-19T00:00:00Z","status":"public","year":"2018","department":[{"_id":"ToHe"}],"series_title":"Handbook of Model Checking","month":"05","oa_version":"None","day":"19","type":"book_chapter","author":[{"last_name":"Clarke","first_name":"Edmund","full_name":"Clarke, Edmund"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Veith, Helmut","last_name":"Veith","first_name":"Helmut"}],"date_created":"2018-12-11T11:44:25Z","title":"Introduction to model checking","editor":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"date_updated":"2021-01-12T08:05:35Z","doi":"10.1007/978-3-319-10575-8_1","_id":"60","publisher":"Springer","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1"},{"issue":"4","day":"01","oa_version":"None","month":"09","department":[{"_id":"DaAl"}],"year":"2018","status":"public","volume":4,"date_published":"2018-09-01T00:00:00Z","publication_status":"published","scopus_import":1,"abstract":[{"lang":"eng","text":"The concurrent memory reclamation problem is that of devising a way for a deallocating thread to verify that no other concurrent threads hold references to a memory block being deallocated. To date, in the absence of automatic garbage collection, there is no satisfactory solution to this problem; existing tracking methods like hazard pointers, reference counters, or epoch-based techniques like RCU are either prohibitively expensive or require significant programming expertise to the extent that implementing them efficiently can be worthy of a publication. None of the existing techniques are automatic or even semi-automated.\r\nIn this article, we take a new approach to concurrent memory reclamation. Instead of manually tracking access to memory locations as done in techniques like hazard pointers, or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm, called ThreadScan, leverages operating system signaling to automatically detect which memory locations are being accessed by concurrent threads.\r\nInitial empirical evidence shows that ThreadScan scales surprisingly well and requires negligible programming effort beyond the standard use of Malloc and Free."}],"publication":"ACM Transactions on Parallel Computing","related_material":{"record":[{"id":"779","status":"public","relation":"earlier_version"}]},"citation":{"chicago":"Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation.” <i>ACM Transactions on Parallel Computing</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3201897\">https://doi.org/10.1145/3201897</a>.","mla":"Alistarh, Dan-Adrian, et al. “ThreadScan: Automatic and Scalable Memory Reclamation.” <i>ACM Transactions on Parallel Computing</i>, vol. 4, no. 4, 18, Association for Computing Machinery, 2018, doi:<a href=\"https://doi.org/10.1145/3201897\">10.1145/3201897</a>.","ista":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. 2018. ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. 4(4), 18.","short":"D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on Parallel Computing 4 (2018).","apa":"Alistarh, D.-A., Leiserson, W., Matveev, A., &#38; Shavit, N. (2018). ThreadScan: Automatic and scalable memory reclamation. <i>ACM Transactions on Parallel Computing</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3201897\">https://doi.org/10.1145/3201897</a>","ama":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. ThreadScan: Automatic and scalable memory reclamation. <i>ACM Transactions on Parallel Computing</i>. 2018;4(4). doi:<a href=\"https://doi.org/10.1145/3201897\">10.1145/3201897</a>","ieee":"D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “ThreadScan: Automatic and scalable memory reclamation,” <i>ACM Transactions on Parallel Computing</i>, vol. 4, no. 4. Association for Computing Machinery, 2018."},"quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Association for Computing Machinery","_id":"6001","publication_identifier":{"issn":["2329-4949"]},"doi":"10.1145/3201897","date_updated":"2023-02-23T13:17:54Z","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"first_name":"William","last_name":"Leiserson","full_name":"Leiserson, William"},{"full_name":"Matveev, Alexander","first_name":"Alexander","last_name":"Matveev"},{"last_name":"Shavit","first_name":"Nir","full_name":"Shavit, Nir"}],"date_created":"2019-02-14T13:24:11Z","title":"ThreadScan: Automatic and scalable memory reclamation","type":"journal_article","intvolume":"         4","article_number":"18"},{"title":"The Bogoliubov free energy functional I: Existence of minimizers and phase diagram","publication_identifier":{"issn":["0003-9527"],"eissn":["1432-0673"]},"date_updated":"2025-04-15T08:26:15Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"quality_controlled":"1","status":"public","publication":"Archive for Rational Mechanics and Analysis","citation":{"ieee":"M. M. Napiórkowski, R. Reuvers, and J. P. Solovej, “The Bogoliubov free energy functional I: Existence of minimizers and phase diagram,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 229, no. 3. Springer Nature, pp. 1037–1090, 2018.","apa":"Napiórkowski, M. M., Reuvers, R., &#38; Solovej, J. P. (2018). The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00205-018-1232-6\">https://doi.org/10.1007/s00205-018-1232-6</a>","ama":"Napiórkowski MM, Reuvers R, Solovej JP. The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. <i>Archive for Rational Mechanics and Analysis</i>. 2018;229(3):1037-1090. doi:<a href=\"https://doi.org/10.1007/s00205-018-1232-6\">10.1007/s00205-018-1232-6</a>","mla":"Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional I: Existence of Minimizers and Phase Diagram.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 229, no. 3, Springer Nature, 2018, pp. 1037–90, doi:<a href=\"https://doi.org/10.1007/s00205-018-1232-6\">10.1007/s00205-018-1232-6</a>.","ista":"Napiórkowski MM, Reuvers R, Solovej JP. 2018. The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. Archive for Rational Mechanics and Analysis. 229(3), 1037–1090.","chicago":"Napiórkowski, Marcin M, Robin Reuvers, and Jan Philip Solovej. “The Bogoliubov Free Energy Functional I: Existence of Minimizers and Phase Diagram.” <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/s00205-018-1232-6\">https://doi.org/10.1007/s00205-018-1232-6</a>.","short":"M.M. Napiórkowski, R. Reuvers, J.P. Solovej, Archive for Rational Mechanics and Analysis 229 (2018) 1037–1090."},"page":"1037-1090","scopus_import":"1","isi":1,"issue":"3","department":[{"_id":"RoSe"}],"date_created":"2019-02-14T13:40:53Z","author":[{"id":"4197AD04-F248-11E8-B48F-1D18A9856A87","full_name":"Napiórkowski, Marcin M","last_name":"Napiórkowski","first_name":"Marcin M"},{"first_name":"Robin","last_name":"Reuvers","full_name":"Reuvers, Robin"},{"full_name":"Solovej, Jan Philip","last_name":"Solovej","first_name":"Jan Philip"}],"doi":"10.1007/s00205-018-1232-6","project":[{"call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27"}],"type":"journal_article","intvolume":"       229","_id":"6002","publisher":"Springer Nature","main_file_link":[{"url":"https://arxiv.org/abs/1511.05935","open_access":"1"}],"arxiv":1,"year":"2018","oa":1,"date_published":"2018-09-01T00:00:00Z","volume":229,"publication_status":"published","abstract":[{"text":"The Bogoliubov free energy functional is analysed. The functional serves as a model of a translation-invariant Bose gas at positive temperature. We prove the existence of minimizers in the case of repulsive interactions given by a sufficiently regular two-body potential. Furthermore, we prove the existence of a phase transition in this model and provide its phase diagram.","lang":"eng"}],"external_id":{"isi":["000435367300003"],"arxiv":["1511.05935"]},"oa_version":"Preprint","day":"01","month":"09"},{"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","article_processing_charge":"No","title":"State of the art on stylized fabrication","date_updated":"2025-04-14T07:28:57Z","publication_identifier":{"issn":["0167-7055"]},"department":[{"_id":"BeBi"}],"ddc":["004"],"issue":"6","citation":{"mla":"Bickel, Bernd, et al. “State of the Art on Stylized Fabrication.” <i>Computer Graphics Forum</i>, vol. 37, no. 6, Wiley, 2018, pp. 325–42, doi:<a href=\"https://doi.org/10.1111/cgf.13327\">10.1111/cgf.13327</a>.","ista":"Bickel B, Cignoni P, Malomo L, Pietroni N. 2018. State of the art on stylized fabrication. Computer Graphics Forum. 37(6), 325–342.","chicago":"Bickel, Bernd, Paolo Cignoni, Luigi Malomo, and Nico Pietroni. “State of the Art on Stylized Fabrication.” <i>Computer Graphics Forum</i>. Wiley, 2018. <a href=\"https://doi.org/10.1111/cgf.13327\">https://doi.org/10.1111/cgf.13327</a>.","short":"B. Bickel, P. Cignoni, L. Malomo, N. Pietroni, Computer Graphics Forum 37 (2018) 325–342.","ieee":"B. Bickel, P. Cignoni, L. Malomo, and N. Pietroni, “State of the art on stylized fabrication,” <i>Computer Graphics Forum</i>, vol. 37, no. 6. Wiley, pp. 325–342, 2018.","apa":"Bickel, B., Cignoni, P., Malomo, L., &#38; Pietroni, N. (2018). State of the art on stylized fabrication. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.13327\">https://doi.org/10.1111/cgf.13327</a>","ama":"Bickel B, Cignoni P, Malomo L, Pietroni N. State of the art on stylized fabrication. <i>Computer Graphics Forum</i>. 2018;37(6):325-342. doi:<a href=\"https://doi.org/10.1111/cgf.13327\">10.1111/cgf.13327</a>"},"page":"325-342","publication":"Computer Graphics Forum","isi":1,"scopus_import":"1","status":"public","pubrep_id":"1051","_id":"6003","publisher":"Wiley","file":[{"relation":"main_file","checksum":"d2bbe5c658d8159fbe9016a4f5e82b19","file_id":"6004","content_type":"application/pdf","access_level":"open_access","file_size":6209349,"date_updated":"2020-07-14T12:47:15Z","creator":"kschuh","date_created":"2019-02-14T14:09:28Z","file_name":"StylizedFabricationSTAR-Personal.pdf"}],"type":"journal_article","intvolume":"        37","author":[{"last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Cignoni","first_name":"Paolo","full_name":"Cignoni, Paolo"},{"last_name":"Malomo","first_name":"Luigi","full_name":"Malomo, Luigi"},{"full_name":"Pietroni, Nico","last_name":"Pietroni","first_name":"Nico"}],"date_created":"2019-02-14T13:52:25Z","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767"}],"doi":"10.1111/cgf.13327","has_accepted_license":"1","month":"09","oa_version":"Submitted Version","ec_funded":1,"external_id":{"isi":["000437272800019"]},"day":"01","file_date_updated":"2020-07-14T12:47:15Z","abstract":[{"text":"Digital fabrication devices are powerful tools for creating tangible reproductions of 3D digital models. Most available printing technologies aim at producing an accurate copy of a tridimensional shape. However, fabrication technologies can also be used to create a stylistic representation of a digital shape. We refer to this class of methods as ‘stylized fabrication methods’. These methods abstract geometric and physical features of a given shape to create an unconventional representation, to produce an optical illusion or to devise a particular interaction with the fabricated model. In this state‐of‐the‐art report, we classify and overview this broad and emerging class of approaches and also propose possible directions for future research.","lang":"eng"}],"publication_status":"published","volume":37,"date_published":"2018-09-01T00:00:00Z","oa":1,"year":"2018"},{"_id":"6005","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"content_type":"application/pdf","access_level":"open_access","file_size":542889,"relation":"main_file","checksum":"41ab2ae9b63f5eb49fa995250c0ba128","file_id":"6007","date_updated":"2020-07-14T12:47:15Z","file_name":"2018_LIPIcs_Avni.pdf","date_created":"2019-02-14T14:22:04Z","creator":"dernst"}],"intvolume":"       117","type":"conference","date_created":"2019-02-14T14:12:09Z","author":[{"last_name":"Avni","first_name":"Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy"},{"full_name":"Guha, Shibashis","first_name":"Shibashis","last_name":"Guha"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"doi":"10.4230/LIPICS.MFCS.2018.23","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","month":"08","oa_version":"Published Version","day":"01","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"963"}]},"file_date_updated":"2020-07-14T12:47:15Z","abstract":[{"lang":"eng","text":"Network games are widely used as a model for selfish resource-allocation problems. In the classicalmodel, each player selects a path connecting her source and target vertices. The cost of traversingan edge depends on theload; namely, number of players that traverse it. Thus, it abstracts the factthat different users may use a resource at different times and for different durations, which playsan important role in determining the costs of the users in reality. For example, when transmittingpackets in a communication network, routing traffic in a road network, or processing a task in aproduction system, actual sharing and congestion of resources crucially depends on time.In [13], we introducedtimed network games, which add a time component to network games.Each vertexvin the network is associated with a cost function, mapping the load onvto theprice that a player pays for staying invfor one time unit with this load.  Each edge in thenetwork is guarded by the time intervals in which it can be traversed, which forces the players tospend time in the vertices. In this work we significantly extend the way time can be referred toin timed network games. In the model we study, the network is equipped withclocks, and, as intimed automata, edges are guarded by constraints on the values of the clocks, and their traversalmay involve a reset of some clocks. We argue that the stronger model captures many realisticnetworks.  The addition of clocks breaks the techniques we developed in [13] and we developnew techniques in order to show that positive results on classic network games carry over to thestronger timed setting."}],"publication_status":"published","alternative_title":["LIPIcs"],"date_published":"2018-08-01T00:00:00Z","volume":117,"oa":1,"year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","location":"Liverpool, United Kingdom","end_date":"2018-08-31","start_date":"2018-08-27"},"language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"No","article_number":"23","title":"Timed network games with clocks","date_updated":"2025-07-10T12:01:59Z","publication_identifier":{"issn":["1868-8969"]},"department":[{"_id":"ToHe"}],"ddc":["000"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"ieee":"G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom, 2018, vol. 117.","ama":"Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">10.4230/LIPICS.MFCS.2018.23</a>","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2018). Timed network games with clocks (Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">https://doi.org/10.4230/LIPICS.MFCS.2018.23</a>","ista":"Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.","mla":"Avni, Guy, et al. <i>Timed Network Games with Clocks</i>. Vol. 117, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">10.4230/LIPICS.MFCS.2018.23</a>.","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,” Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">https://doi.org/10.4230/LIPICS.MFCS.2018.23</a>.","short":"G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018."},"scopus_import":"1","status":"public"},{"file_date_updated":"2020-07-14T12:47:16Z","related_material":{"record":[{"id":"1003","status":"public","relation":"earlier_version"}]},"publication_status":"published","abstract":[{"text":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally-optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an over-approximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. We extend the abstraction-refinement methodology to labeled networks, where the objectives of the players are regular languages. Our experimental results demonstrate the effectiveness of the methodology. ","lang":"eng"}],"year":"2018","oa":1,"date_published":"2018-09-01T00:00:00Z","volume":9,"month":"09","has_accepted_license":"1","oa_version":"Published Version","day":"01","intvolume":"         9","type":"journal_article","date_created":"2019-02-14T14:17:54Z","author":[{"first_name":"Guy","last_name":"Avni","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287"},{"first_name":"Shibashis","last_name":"Guha","full_name":"Guha, Shibashis"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"doi":"10.3390/g9030039","project":[{"grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}],"_id":"6006","publisher":"MDPI","file":[{"content_type":"application/pdf","file_size":505155,"access_level":"open_access","checksum":"749d65ca4ce74256a029d9644a1b1cb0","relation":"main_file","file_id":"6008","date_updated":"2020-07-14T12:47:16Z","creator":"kschuh","date_created":"2019-02-14T14:20:31Z","file_name":"2018_MDPI_Avni.pdf"}],"publication":"Games","citation":{"chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” <i>Games</i>. MDPI, 2018. <a href=\"https://doi.org/10.3390/g9030039\">https://doi.org/10.3390/g9030039</a>.","ista":"Avni G, Guha S, Kupferman O. 2018. An abstraction-refinement methodology for reasoning about network games. Games. 9(3), 39.","mla":"Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” <i>Games</i>, vol. 9, no. 3, 39, MDPI, 2018, doi:<a href=\"https://doi.org/10.3390/g9030039\">10.3390/g9030039</a>.","short":"G. Avni, S. Guha, O. Kupferman, Games 9 (2018).","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2018). An abstraction-refinement methodology for reasoning about network games. <i>Games</i>. MDPI. <a href=\"https://doi.org/10.3390/g9030039\">https://doi.org/10.3390/g9030039</a>","ama":"Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. <i>Games</i>. 2018;9(3). doi:<a href=\"https://doi.org/10.3390/g9030039\">10.3390/g9030039</a>","ieee":"G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” <i>Games</i>, vol. 9, no. 3. MDPI, 2018."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"scopus_import":"1","status":"public","department":[{"_id":"ToHe"}],"issue":"3","ddc":["004"],"article_processing_charge":"No","article_number":"39","title":"An abstraction-refinement methodology for reasoning about network games","publication_identifier":{"issn":["2073-4336"]},"date_updated":"2025-07-10T11:49:38Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1"},{"date_created":"2019-02-14T14:33:34Z","author":[{"full_name":"Garrido-Charad, Florencia","first_name":"Florencia","last_name":"Garrido-Charad"},{"last_name":"Vega Zuniga","first_name":"Tomas A","full_name":"Vega Zuniga, Tomas A","id":"2E7C4E78-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Cristián","last_name":"Gutiérrez-Ibáñez","full_name":"Gutiérrez-Ibáñez, Cristián"},{"full_name":"Fernandez, Pedro","last_name":"Fernandez","first_name":"Pedro"},{"full_name":"López-Jury, Luciana","last_name":"López-Jury","first_name":"Luciana"},{"first_name":"Cristian","last_name":"González-Cabrera","full_name":"González-Cabrera, Cristian"},{"full_name":"Karten, Harvey J.","first_name":"Harvey J.","last_name":"Karten"},{"first_name":"Harald","last_name":"Luksch","full_name":"Luksch, Harald"},{"first_name":"Gonzalo J.","last_name":"Marín","full_name":"Marín, Gonzalo J."}],"doi":"10.1073/pnas.1804517115","intvolume":"       115","type":"journal_article","_id":"6010","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/30026198","open_access":"1"}],"publisher":"National Academy of Sciences","volume":115,"date_published":"2018-08-07T00:00:00Z","oa":1,"year":"2018","abstract":[{"text":"The optic tectum (TeO), or superior colliculus, is a multisensory midbrain center that organizes spatially orienting responses to relevant stimuli. To define the stimulus with the highest priority at each moment, a network of reciprocal connections between the TeO and the isthmi promotes competition between concurrent tectal inputs. In the avian midbrain, the neurons mediating enhancement and suppression of tectal inputs are located in separate isthmic nuclei, facilitating the analysis of the neural processes that mediate competition. A specific subset of radial neurons in the intermediate tectal layers relay retinal inputs to the isthmi, but at present it is unclear whether separate neurons innervate individual nuclei or a single neural type sends a common input to several of them. In this study, we used in vitro neural tracing and cell-filling experiments in chickens to show that single neurons innervate, via axon collaterals, the three nuclei that comprise the isthmotectal network. This demonstrates that the input signals representing the strength of the incoming stimuli are simultaneously relayed to the mechanisms promoting both enhancement and suppression of the input signals. By performing in vivo recordings in anesthetized chicks, we also show that this common input generates synchrony between both antagonistic mechanisms, demonstrating that activity enhancement and suppression are closely coordinated. From a computational point of view, these results suggest that these tectal neurons constitute integrative nodes that combine inputs from different sources to drive in parallel several concurrent neural processes, each performing complementary functions within the network through different firing patterns and connectivity.","lang":"eng"}],"publication_status":"published","oa_version":"Submitted Version","external_id":{"pmid":["30026198"],"isi":["000440982000020"]},"day":"07","month":"08","title":"“Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network","date_updated":"2023-09-19T14:35:36Z","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"quality_controlled":"1","status":"public","page":"E7615-E7623","citation":{"chicago":"Garrido-Charad, Florencia, Tomas A Vega Zuniga, Cristián Gutiérrez-Ibáñez, Pedro Fernandez, Luciana López-Jury, Cristian González-Cabrera, Harvey J. Karten, Harald Luksch, and Gonzalo J. Marín. ““Shepherd’s Crook” Neurons Drive and Synchronize the Enhancing and Suppressive Mechanisms of the Midbrain Stimulus Selection Network.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1804517115\">https://doi.org/10.1073/pnas.1804517115</a>.","mla":"Garrido-Charad, Florencia, et al. ““Shepherd’s Crook” Neurons Drive and Synchronize the Enhancing and Suppressive Mechanisms of the Midbrain Stimulus Selection Network.” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 32, National Academy of Sciences, 2018, pp. E7615–23, doi:<a href=\"https://doi.org/10.1073/pnas.1804517115\">10.1073/pnas.1804517115</a>.","ista":"Garrido-Charad F, Vega Zuniga TA, Gutiérrez-Ibáñez C, Fernandez P, López-Jury L, González-Cabrera C, Karten HJ, Luksch H, Marín GJ. 2018. “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. Proceedings of the National Academy of Sciences. 115(32), E7615–E7623.","short":"F. Garrido-Charad, T.A. Vega Zuniga, C. Gutiérrez-Ibáñez, P. Fernandez, L. López-Jury, C. González-Cabrera, H.J. Karten, H. Luksch, G.J. Marín, Proceedings of the National Academy of Sciences 115 (2018) E7615–E7623.","ama":"Garrido-Charad F, Vega Zuniga TA, Gutiérrez-Ibáñez C, et al. “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. <i>Proceedings of the National Academy of Sciences</i>. 2018;115(32):E7615-E7623. doi:<a href=\"https://doi.org/10.1073/pnas.1804517115\">10.1073/pnas.1804517115</a>","apa":"Garrido-Charad, F., Vega Zuniga, T. A., Gutiérrez-Ibáñez, C., Fernandez, P., López-Jury, L., González-Cabrera, C., … Marín, G. J. (2018). “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1804517115\">https://doi.org/10.1073/pnas.1804517115</a>","ieee":"F. Garrido-Charad <i>et al.</i>, ““Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network,” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 32. National Academy of Sciences, pp. E7615–E7623, 2018."},"publication":"Proceedings of the National Academy of Sciences","isi":1,"scopus_import":"1","issue":"32","pmid":1,"department":[{"_id":"MaJö"}]},{"department":[{"_id":"ChLa"}],"status":"public","scopus_import":"1","isi":1,"publication":"Proceedings of the 35 th International Conference on Machine Learning","page":"2815-2824","citation":{"ieee":"I. Kuzborskij and C. Lampert, “Data-dependent stability of stochastic gradient descent,” in <i>Proceedings of the 35 th International Conference on Machine Learning</i>, Stockholm, Sweden, 2018, vol. 80, pp. 2815–2824.","apa":"Kuzborskij, I., &#38; Lampert, C. (2018). Data-dependent stability of stochastic gradient descent. In <i>Proceedings of the 35 th International Conference on Machine Learning</i> (Vol. 80, pp. 2815–2824). Stockholm, Sweden: ML Research Press.","ama":"Kuzborskij I, Lampert C. Data-dependent stability of stochastic gradient descent. In: <i>Proceedings of the 35 Th International Conference on Machine Learning</i>. Vol 80. ML Research Press; 2018:2815-2824.","ista":"Kuzborskij I, Lampert C. 2018. Data-dependent stability of stochastic gradient descent. Proceedings of the 35 th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 80, 2815–2824.","mla":"Kuzborskij, Ilja, and Christoph Lampert. “Data-Dependent Stability of Stochastic Gradient Descent.” <i>Proceedings of the 35 Th International Conference on Machine Learning</i>, vol. 80, ML Research Press, 2018, pp. 2815–24.","chicago":"Kuzborskij, Ilja, and Christoph Lampert. “Data-Dependent Stability of Stochastic Gradient Descent.” In <i>Proceedings of the 35 Th International Conference on Machine Learning</i>, 80:2815–24. ML Research Press, 2018.","short":"I. Kuzborskij, C. Lampert, in:, Proceedings of the 35 Th International Conference on Machine Learning, ML Research Press, 2018, pp. 2815–2824."},"quality_controlled":"1","conference":{"end_date":"2018-07-15","location":"Stockholm, Sweden","name":"ICML: International Conference on Machine Learning","start_date":"2018-07-10"},"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-04-15T07:10:23Z","title":"Data-dependent stability of stochastic gradient descent","article_processing_charge":"No","day":"01","external_id":{"arxiv":["1703.01678"],"isi":["000683379202095"]},"ec_funded":1,"oa_version":"Preprint","month":"02","year":"2018","oa":1,"date_published":"2018-02-01T00:00:00Z","volume":80,"arxiv":1,"publication_status":"published","abstract":[{"lang":"eng","text":"We establish a data-dependent notion of algorithmic stability for Stochastic Gradient Descent (SGD), and employ it to develop novel generalization bounds. This is in contrast to previous distribution-free algorithmic stability results for SGD which depend on the worst-case constants. By virtue of the data-dependent argument, our bounds provide new insights into learning with SGD on convex and non-convex problems. In the convex case, we show that the bound on the generalization error depends on the risk at the initialization point. In the non-convex case, we prove that the expected curvature of the objective function around the initialization point has crucial influence on the generalization error. In both cases, our results suggest a simple data-driven strategy to stabilize SGD by pre-screening its initialization. As a corollary, our results allow us to show optimistic generalization bounds that exhibit fast convergence rates for SGD subject to a vanishing empirical risk and low noise of stochastic gradient. "}],"publisher":"ML Research Press","main_file_link":[{"url":"https://arxiv.org/abs/1703.01678","open_access":"1"}],"_id":"6011","project":[{"grant_number":"308036","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"date_created":"2019-02-14T14:51:57Z","author":[{"last_name":"Kuzborskij","first_name":"Ilja","full_name":"Kuzborskij, Ilja"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"}],"type":"conference","intvolume":"        80"},{"abstract":[{"text":"We present an approach to identify concise equations from data using a shallow neural network approach. In contrast to ordinary black-box regression, this approach allows understanding functional relations and generalizing them from observed data to unseen parts of the parameter space. We show how to extend the class of learnable equations for a recently proposed equation learning network to include divisions, and we improve the learning and model selection strategy to be useful for challenging real-world data. For systems governed by analytical expressions, our method can in many cases identify the true underlying equation and extrapolate to unseen domains. We demonstrate its effectiveness by experiments on a cart-pendulum system, where only 2 random rollouts are required to learn the forward dynamics and successfully achieve the swing-up task.","lang":"eng"}],"publication_status":"published","related_material":{"link":[{"url":"https://ist.ac.at/en/news/first-machine-learning-method-capable-of-accurate-extrapolation/","description":"News on IST Homepage","relation":"press_release"}]},"volume":80,"date_published":"2018-02-01T00:00:00Z","year":"2018","oa":1,"arxiv":1,"month":"02","day":"01","oa_version":"Preprint","ec_funded":1,"external_id":{"arxiv":["1806.07259"],"isi":["000683379204058"]},"intvolume":"        80","type":"conference","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Sahoo, Subham","first_name":"Subham","last_name":"Sahoo"},{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Georg S","last_name":"Martius","full_name":"Martius, Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2019-02-14T15:21:07Z","publisher":"ML Research Press","main_file_link":[{"url":"https://arxiv.org/abs/1806.07259","open_access":"1"}],"_id":"6012","isi":1,"scopus_import":"1","page":"4442-4450","citation":{"apa":"Sahoo, S., Lampert, C., &#38; Martius, G. S. (2018). Learning equations for extrapolation and control. In <i>Proceedings of the 35th International Conference on Machine Learning</i> (Vol. 80, pp. 4442–4450). Stockholm, Sweden: ML Research Press.","ama":"Sahoo S, Lampert C, Martius GS. Learning equations for extrapolation and control. In: <i>Proceedings of the 35th International Conference on Machine Learning</i>. Vol 80. ML Research Press; 2018:4442-4450.","ieee":"S. Sahoo, C. Lampert, and G. S. Martius, “Learning equations for extrapolation and control,” in <i>Proceedings of the 35th International Conference on Machine Learning</i>, Stockholm, Sweden, 2018, vol. 80, pp. 4442–4450.","short":"S. Sahoo, C. Lampert, G.S. Martius, in:, Proceedings of the 35th International Conference on Machine Learning, ML Research Press, 2018, pp. 4442–4450.","chicago":"Sahoo, Subham, Christoph Lampert, and Georg S Martius. “Learning Equations for Extrapolation and Control.” In <i>Proceedings of the 35th International Conference on Machine Learning</i>, 80:4442–50. ML Research Press, 2018.","mla":"Sahoo, Subham, et al. “Learning Equations for Extrapolation and Control.” <i>Proceedings of the 35th International Conference on Machine Learning</i>, vol. 80, ML Research Press, 2018, pp. 4442–50.","ista":"Sahoo S, Lampert C, Martius GS. 2018. Learning equations for extrapolation and control. Proceedings of the 35th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 80, 4442–4450."},"publication":"Proceedings of the 35th International Conference on Machine Learning","status":"public","department":[{"_id":"ChLa"}],"article_processing_charge":"No","date_updated":"2025-04-15T06:50:24Z","title":"Learning equations for extrapolation and control","quality_controlled":"1","conference":{"end_date":"2018-07-15","location":"Stockholm, Sweden","name":"ICML: International Conference on Machine Learning","start_date":"2018-07-10"},"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"conference":{"name":"SiPS: Workshop on Signal Processing Systems","end_date":"2018-10-24","location":"Cape Town, South Africa","start_date":"2018-10-21"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","_id":"6031","publisher":"IEEE","date_created":"2019-02-17T22:59:25Z","author":[{"last_name":"Stojanov","first_name":"Alen","full_name":"Stojanov, Alen"},{"last_name":"Smith","first_name":"Tyler Michael","full_name":"Smith, Tyler Michael"},{"first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"last_name":"Puschel","first_name":"Markus","full_name":"Puschel, Markus"}],"title":"Fast quantized arithmetic on x86: Trading compute for data movement","doi":"10.1109/SiPS.2018.8598402","date_updated":"2023-09-19T14:41:51Z","article_processing_charge":"No","type":"conference","article_number":"8598402","external_id":{"isi":["000465106800060"]},"oa_version":"None","day":"31","department":[{"_id":"DaAl"}],"month":"12","year":"2018","status":"public","volume":"2018-October","date_published":"2018-12-31T00:00:00Z","publication":"2018 IEEE International Workshop on Signal Processing Systems","citation":{"short":"A. Stojanov, T.M. Smith, D.-A. Alistarh, M. Puschel, in:, 2018 IEEE International Workshop on Signal Processing Systems, IEEE, 2018.","chicago":"Stojanov, Alen, Tyler Michael Smith, Dan-Adrian Alistarh, and Markus Puschel. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” In <i>2018 IEEE International Workshop on Signal Processing Systems</i>, Vol. 2018–October. IEEE, 2018. <a href=\"https://doi.org/10.1109/SiPS.2018.8598402\">https://doi.org/10.1109/SiPS.2018.8598402</a>.","mla":"Stojanov, Alen, et al. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” <i>2018 IEEE International Workshop on Signal Processing Systems</i>, vol. 2018–October, 8598402, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/SiPS.2018.8598402\">10.1109/SiPS.2018.8598402</a>.","ista":"Stojanov A, Smith TM, Alistarh D-A, Puschel M. 2018. Fast quantized arithmetic on x86: Trading compute for data movement. 2018 IEEE International Workshop on Signal Processing Systems. SiPS: Workshop on Signal Processing Systems vol. 2018–October, 8598402.","apa":"Stojanov, A., Smith, T. M., Alistarh, D.-A., &#38; Puschel, M. (2018). Fast quantized arithmetic on x86: Trading compute for data movement. In <i>2018 IEEE International Workshop on Signal Processing Systems</i> (Vol. 2018–October). Cape Town, South Africa: IEEE. <a href=\"https://doi.org/10.1109/SiPS.2018.8598402\">https://doi.org/10.1109/SiPS.2018.8598402</a>","ama":"Stojanov A, Smith TM, Alistarh D-A, Puschel M. Fast quantized arithmetic on x86: Trading compute for data movement. In: <i>2018 IEEE International Workshop on Signal Processing Systems</i>. Vol 2018-October. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/SiPS.2018.8598402\">10.1109/SiPS.2018.8598402</a>","ieee":"A. Stojanov, T. M. Smith, D.-A. Alistarh, and M. Puschel, “Fast quantized arithmetic on x86: Trading compute for data movement,” in <i>2018 IEEE International Workshop on Signal Processing Systems</i>, Cape Town, South Africa, 2018, vol. 2018–October."},"scopus_import":"1","publication_status":"published","isi":1,"abstract":[{"text":"We introduce Clover, a new library for efficient computation using low-precision data, providing mathematical routines required by fundamental methods in optimization and sparse recovery. Our library faithfully implements variants of stochastic quantization that guarantee convergence at low precision, and supports data formats from 4-bit quantized to 32-bit IEEE-754 on current Intel processors. In particular, we show that 4-bit can be implemented efficiently using Intel AVX despite the lack of native support for this data format. Experimental results with dot product, matrix-vector multiplication (MVM), gradient descent (GD), and iterative hard thresholding (IHT) demonstrate that the attainable speedups are in many cases close to linear with respect to the reduction of precision due to reduced data movement. Finally, for GD and IHT, we show examples of absolute speedup achieved by 4-bit versus 32-bit, by iterating until a given target error is achieved.","lang":"eng"}]}]