[{"title":"Revealing hidden spin-momentum locking in a high-temperature cuprate superconductor","date_updated":"2026-06-18T18:55:21Z","acknowledgement":" M.S. was supported by the Gordon and Betty Moore Foundation s EPiQS Initiative through grant GBMF4307","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","status":"public","citation":{"apa":"Gotlieb, K., Lin, C.-Y., Serbyn, M., Zhang, W., Smallwood, C. L., Jozwiak, C., … Lanzara, A. (2018). Revealing hidden spin-momentum locking in a high-temperature cuprate superconductor. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aao0980","ama":"Gotlieb K, Lin C-Y, Serbyn M, et al. Revealing hidden spin-momentum locking in a high-temperature cuprate superconductor. Science. 2018;362(6420):1271-1275. doi:10.1126/science.aao0980","ieee":"K. Gotlieb et al., “Revealing hidden spin-momentum locking in a high-temperature cuprate superconductor,” Science, vol. 362, no. 6420. American Association for the Advancement of Science, pp. 1271–1275, 2018.","chicago":"Gotlieb, Kenneth, Chiu-Yun Lin, Maksym Serbyn, Wentao Zhang, Christopher L. Smallwood, Christopher Jozwiak, Hiroshi Eisaki, Zahid Hussain, Ashvin Vishwanath, and Alessandra Lanzara. “Revealing Hidden Spin-Momentum Locking in a High-Temperature Cuprate Superconductor.” Science. American Association for the Advancement of Science, 2018. https://doi.org/10.1126/science.aao0980.","mla":"Gotlieb, Kenneth, et al. “Revealing Hidden Spin-Momentum Locking in a High-Temperature Cuprate Superconductor.” Science, vol. 362, no. 6420, American Association for the Advancement of Science, 2018, pp. 1271–75, doi:10.1126/science.aao0980.","ista":"Gotlieb K, Lin C-Y, Serbyn M, Zhang W, Smallwood CL, Jozwiak C, Eisaki H, Hussain Z, Vishwanath A, Lanzara A. 2018. Revealing hidden spin-momentum locking in a high-temperature cuprate superconductor. Science. 362(6420), 1271–1275.","short":"K. Gotlieb, C.-Y. Lin, M. Serbyn, W. Zhang, C.L. Smallwood, C. Jozwiak, H. Eisaki, Z. Hussain, A. Vishwanath, A. Lanzara, Science 362 (2018) 1271–1275."},"page":"1271-1275","publication":"Science","isi":1,"scopus_import":"1","ddc":["530"],"issue":"6420","department":[{"_id":"MaSe"}],"date_created":"2018-12-19T14:53:50Z","author":[{"full_name":"Gotlieb, Kenneth","first_name":"Kenneth","last_name":"Gotlieb"},{"full_name":"Lin, Chiu-Yun","first_name":"Chiu-Yun","last_name":"Lin"},{"orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn","first_name":"Maksym"},{"last_name":"Zhang","first_name":"Wentao","full_name":"Zhang, Wentao"},{"full_name":"Smallwood, Christopher L.","first_name":"Christopher L.","last_name":"Smallwood"},{"first_name":"Christopher","last_name":"Jozwiak","full_name":"Jozwiak, Christopher"},{"last_name":"Eisaki","first_name":"Hiroshi","full_name":"Eisaki, Hiroshi"},{"full_name":"Hussain, Zahid","first_name":"Zahid","last_name":"Hussain"},{"full_name":"Vishwanath, Ashvin","last_name":"Vishwanath","first_name":"Ashvin"},{"full_name":"Lanzara, Alessandra","last_name":"Lanzara","first_name":"Alessandra"}],"doi":"10.1126/science.aao0980","intvolume":" 362","type":"journal_article","_id":"5767","publisher":"American Association for the Advancement of Science","main_file_link":[{"url":"https://doi.org/10.1126/science.aao0980","open_access":"1"}],"date_published":"2018-12-14T00:00:00Z","volume":362,"oa":1,"year":"2018","abstract":[{"text":"Cuprate superconductors have long been thought of as having strong electronic correlations but negligible spin-orbit coupling. Using spin- and angle-resolved photoemission spectroscopy, we discovered that one of the most studied cuprate superconductors, Bi2212, has a nontrivial spin texture with a spin-momentum locking that circles the Brillouin zone center and a spin-layer locking that allows states of opposite spin to be localized in different parts of the unit cell. Our findings pose challenges for the vast majority of models of cuprates, such as the Hubbard model and its variants, where spin-orbit interaction has been mostly neglected, and open the intriguing question of how the high-temperature superconducting state emerges in the presence of this nontrivial spin texture. ","lang":"eng"}],"article_type":"original","publication_status":"published","oa_version":"Published Version","external_id":{"isi":["000452994400048"]},"day":"14","month":"12"},{"volume":115,"date_published":"2018-12-11T00:00:00Z","year":"2018","oa":1,"abstract":[{"lang":"eng","text":"Retroviruses assemble and bud from infected cells in an immature form and require proteolytic maturation for infectivity. The CA (capsid) domains of the Gag polyproteins assemble a protein lattice as a truncated sphere in the immature virion. Proteolytic cleavage of Gag induces dramatic structural rearrangements; a subset of cleaved CA subsequently assembles into the mature core, whose architecture varies among retroviruses. Murine leukemia virus (MLV) is the prototypical γ-retrovirus and serves as the basis of retroviral vectors, but the structure of the MLV CA layer is unknown. Here we have combined X-ray crystallography with cryoelectron tomography to determine the structures of immature and mature MLV CA layers within authentic viral particles. This reveals the structural changes associated with maturation, and, by comparison with HIV-1, uncovers conserved and variable features. In contrast to HIV-1, most MLV CA is used for assembly of the mature core, which adopts variable, multilayered morphologies and does not form a closed structure. Unlike in HIV-1, there is similarity between protein–protein interfaces in the immature MLV CA layer and those in the mature CA layer, and structural maturation of MLV could be achieved through domain rotations that largely maintain hexameric interactions. Nevertheless, the dramatic architectural change on maturation indicates that extensive disassembly and reassembly are required for mature core growth. The core morphology suggests that wrapping of the genome in CA sheets may be sufficient to protect the MLV ribonucleoprotein during cell entry."}],"publication_status":"published","day":"11","oa_version":"Submitted Version","external_id":{"pmid":["30478053"],"isi":["000452866000022"]},"month":"12","doi":"10.1073/pnas.1811580115","date_created":"2018-12-20T21:09:37Z","author":[{"full_name":"Qu, Kun","last_name":"Qu","first_name":"Kun"},{"full_name":"Glass, Bärbel","last_name":"Glass","first_name":"Bärbel"},{"full_name":"Doležal, Michal","first_name":"Michal","last_name":"Doležal"},{"orcid":"0000-0003-4790-8078","full_name":"Schur, Florian","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","first_name":"Florian"},{"last_name":"Murciano","first_name":"Brice","full_name":"Murciano, Brice"},{"first_name":"Alan","last_name":"Rein","full_name":"Rein, Alan"},{"first_name":"Michaela","last_name":"Rumlová","full_name":"Rumlová, Michaela"},{"first_name":"Tomáš","last_name":"Ruml","full_name":"Ruml, Tomáš"},{"last_name":"Kräusslich","first_name":"Hans-Georg","full_name":"Kräusslich, Hans-Georg"},{"full_name":"Briggs, John A. G.","last_name":"Briggs","first_name":"John A. G."}],"intvolume":" 115","type":"journal_article","publisher":"National Academy of Sciences","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30478053"}],"_id":"5770","status":"public","isi":1,"scopus_import":"1","page":"E11751-E11760","citation":{"apa":"Qu, K., Glass, B., Doležal, M., Schur, F. K., Murciano, B., Rein, A., … Briggs, J. A. G. (2018). Structure and architecture of immature and mature murine leukemia virus capsids. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.1811580115","ama":"Qu K, Glass B, Doležal M, et al. Structure and architecture of immature and mature murine leukemia virus capsids. Proceedings of the National Academy of Sciences of the United States of America. 2018;115(50):E11751-E11760. doi:10.1073/pnas.1811580115","ieee":"K. Qu et al., “Structure and architecture of immature and mature murine leukemia virus capsids,” Proceedings of the National Academy of Sciences of the United States of America, vol. 115, no. 50. National Academy of Sciences, pp. E11751–E11760, 2018.","short":"K. Qu, B. Glass, M. Doležal, F.K. Schur, B. Murciano, A. Rein, M. Rumlová, T. Ruml, H.-G. Kräusslich, J.A.G. Briggs, Proceedings of the National Academy of Sciences of the United States of America 115 (2018) E11751–E11760.","chicago":"Qu, Kun, Bärbel Glass, Michal Doležal, Florian KM Schur, Brice Murciano, Alan Rein, Michaela Rumlová, Tomáš Ruml, Hans-Georg Kräusslich, and John A. G. Briggs. “Structure and Architecture of Immature and Mature Murine Leukemia Virus Capsids.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1811580115.","ista":"Qu K, Glass B, Doležal M, Schur FK, Murciano B, Rein A, Rumlová M, Ruml T, Kräusslich H-G, Briggs JAG. 2018. Structure and architecture of immature and mature murine leukemia virus capsids. Proceedings of the National Academy of Sciences of the United States of America. 115(50), E11751–E11760.","mla":"Qu, Kun, et al. “Structure and Architecture of Immature and Mature Murine Leukemia Virus Capsids.” Proceedings of the National Academy of Sciences of the United States of America, vol. 115, no. 50, National Academy of Sciences, 2018, pp. E11751–60, doi:10.1073/pnas.1811580115."},"publication":"Proceedings of the National Academy of Sciences of the United States of America","issue":"50","department":[{"_id":"FlSc"}],"pmid":1,"date_updated":"2025-06-03T11:56:09Z","publication_identifier":{"issn":["0027-8424"]},"title":"Structure and architecture of immature and mature murine leukemia virus capsids","article_processing_charge":"No","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}]},{"department":[{"_id":"FyKo"}],"issue":"50","ddc":["580"],"publication":"Proceedings of the National Academy of Sciences of the United States of America","page":"12728-12732","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"citation":{"short":"A.A. Kotlobay, K. Sarkisyan, Y.A. Mokrushina, M. Marcet-Houben, E.O. Serebrovskaya, N.M. Markina, L. Gonzalez Somermeyer, A.Y. Gorokhovatsky, A. Vvedensky, K.V. Purtov, V.N. Petushkov, N.S. Rodionova, T.V. Chepurnyh, L. Fakhranurova, E.B. Guglya, R. Ziganshin, A.S. Tsarkova, Z.M. Kaskova, V. Shender, M. Abakumov, T.O. Abakumova, I.S. Povolotskaya, F.M. Eroshkin, A.G. Zaraisky, A.S. Mishin, S.V. Dolgov, T.Y. Mitiouchkina, E.P. Kopantzev, H.E. Waldenmaier, A.G. Oliveira, Y. Oba, E. Barsova, E.A. Bogdanova, T. Gabaldón, C.V. Stevani, S. Lukyanov, I.V. Smirnov, J.I. Gitelson, F. Kondrashov, I.V. Yampolsky, Proceedings of the National Academy of Sciences of the United States of America 115 (2018) 12728–12732.","ista":"Kotlobay AA, Sarkisyan K, Mokrushina YA, Marcet-Houben M, Serebrovskaya EO, Markina NM, Gonzalez Somermeyer L, Gorokhovatsky AY, Vvedensky A, Purtov KV, Petushkov VN, Rodionova NS, Chepurnyh TV, Fakhranurova L, Guglya EB, Ziganshin R, Tsarkova AS, Kaskova ZM, Shender V, Abakumov M, Abakumova TO, Povolotskaya IS, Eroshkin FM, Zaraisky AG, Mishin AS, Dolgov SV, Mitiouchkina TY, Kopantzev EP, Waldenmaier HE, Oliveira AG, Oba Y, Barsova E, Bogdanova EA, Gabaldón T, Stevani CV, Lukyanov S, Smirnov IV, Gitelson JI, Kondrashov F, Yampolsky IV. 2018. Genetically encodable bioluminescent system from fungi. Proceedings of the National Academy of Sciences of the United States of America. 115(50), 12728–12732.","mla":"Kotlobay, Alexey A., et al. “Genetically Encodable Bioluminescent System from Fungi.” Proceedings of the National Academy of Sciences of the United States of America, vol. 115, no. 50, National Academy of Sciences, 2018, pp. 12728–32, doi:10.1073/pnas.1803615115.","chicago":"Kotlobay, Alexey A., Karen Sarkisyan, Yuliana A. Mokrushina, Marina Marcet-Houben, Ekaterina O. Serebrovskaya, Nadezhda M. Markina, Louisa Gonzalez Somermeyer, et al. “Genetically Encodable Bioluminescent System from Fungi.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1803615115.","ieee":"A. A. Kotlobay et al., “Genetically encodable bioluminescent system from fungi,” Proceedings of the National Academy of Sciences of the United States of America, vol. 115, no. 50. National Academy of Sciences, pp. 12728–12732, 2018.","ama":"Kotlobay AA, Sarkisyan K, Mokrushina YA, et al. Genetically encodable bioluminescent system from fungi. Proceedings of the National Academy of Sciences of the United States of America. 2018;115(50):12728-12732. doi:10.1073/pnas.1803615115","apa":"Kotlobay, A. A., Sarkisyan, K., Mokrushina, Y. A., Marcet-Houben, M., Serebrovskaya, E. O., Markina, N. M., … Yampolsky, I. V. (2018). Genetically encodable bioluminescent system from fungi. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.1803615115"},"scopus_import":"1","isi":1,"status":"public","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","article_processing_charge":"No","title":"Genetically encodable bioluminescent system from fungi","publication_identifier":{"issn":["0027-8424"]},"date_updated":"2025-07-10T11:52:58Z","month":"12","has_accepted_license":"1","external_id":{"isi":["000452866000068"]},"oa_version":"Published Version","day":"11","file_date_updated":"2020-07-14T12:47:11Z","publication_status":"published","abstract":[{"lang":"eng","text":"Bioluminescence is found across the entire tree of life, conferring a spectacular set of visually oriented functions from attracting mates to scaring off predators. Half a dozen different luciferins, molecules that emit light when enzymatically oxidized, are known. However, just one biochemical pathway for luciferin biosynthesis has been described in full, which is found only in bacteria. Here, we report identification of the fungal luciferase and three other key enzymes that together form the biosynthetic cycle of the fungal luciferin from caffeic acid, a simple and widespread metabolite. Introduction of the identified genes into the genome of the yeast Pichia pastoris along with caffeic acid biosynthesis genes resulted in a strain that is autoluminescent in standard media. We analyzed evolution of the enzymes of the luciferin biosynthesis cycle and found that fungal bioluminescence emerged through a series of events that included two independent gene duplications. The retention of the duplicated enzymes of the luciferin pathway in nonluminescent fungi shows that the gene duplication was followed by functional sequence divergence of enzymes of at least one gene in the biosynthetic pathway and suggests that the evolution of fungal bioluminescence proceeded through several closely related stepping stone nonluminescent biochemical reactions with adaptive roles. The availability of a complete eukaryotic luciferin biosynthesis pathway provides several applications in biomedicine and bioengineering."}],"oa":1,"year":"2018","date_published":"2018-12-11T00:00:00Z","volume":115,"_id":"5780","publisher":"National Academy of Sciences","file":[{"creator":"dernst","file_name":"2018_PNAS_Kotlobay.pdf","date_created":"2019-02-05T15:21:40Z","date_updated":"2020-07-14T12:47:11Z","file_id":"5926","relation":"main_file","checksum":"46b2c12185eb2ddb598f4c7b4bd267bf","file_size":1271988,"access_level":"open_access","content_type":"application/pdf"}],"type":"journal_article","intvolume":" 115","author":[{"full_name":"Kotlobay, Alexey A.","last_name":"Kotlobay","first_name":"Alexey A."},{"full_name":"Sarkisyan, Karen","id":"39A7BF80-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5375-6341","first_name":"Karen","last_name":"Sarkisyan"},{"full_name":"Mokrushina, Yuliana A.","first_name":"Yuliana A.","last_name":"Mokrushina"},{"first_name":"Marina","last_name":"Marcet-Houben","full_name":"Marcet-Houben, Marina"},{"full_name":"Serebrovskaya, Ekaterina O.","last_name":"Serebrovskaya","first_name":"Ekaterina O."},{"last_name":"Markina","first_name":"Nadezhda M.","full_name":"Markina, Nadezhda M."},{"full_name":"Gonzalez Somermeyer, Louisa","id":"4720D23C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9139-5383","first_name":"Louisa","last_name":"Gonzalez Somermeyer"},{"last_name":"Gorokhovatsky","first_name":"Andrey Y.","full_name":"Gorokhovatsky, Andrey Y."},{"last_name":"Vvedensky","first_name":"Andrey","full_name":"Vvedensky, Andrey"},{"first_name":"Konstantin V.","last_name":"Purtov","full_name":"Purtov, Konstantin V."},{"first_name":"Valentin N.","last_name":"Petushkov","full_name":"Petushkov, Valentin N."},{"full_name":"Rodionova, Natalja S.","last_name":"Rodionova","first_name":"Natalja S."},{"last_name":"Chepurnyh","first_name":"Tatiana V.","full_name":"Chepurnyh, Tatiana V."},{"last_name":"Fakhranurova","first_name":"Liliia","full_name":"Fakhranurova, Liliia"},{"full_name":"Guglya, Elena B.","last_name":"Guglya","first_name":"Elena B."},{"full_name":"Ziganshin, Rustam","first_name":"Rustam","last_name":"Ziganshin"},{"full_name":"Tsarkova, Aleksandra S.","first_name":"Aleksandra S.","last_name":"Tsarkova"},{"last_name":"Kaskova","first_name":"Zinaida M.","full_name":"Kaskova, Zinaida M."},{"full_name":"Shender, Victoria","last_name":"Shender","first_name":"Victoria"},{"first_name":"Maxim","last_name":"Abakumov","full_name":"Abakumov, Maxim"},{"last_name":"Abakumova","first_name":"Tatiana O.","full_name":"Abakumova, Tatiana O."},{"full_name":"Povolotskaya, Inna S.","first_name":"Inna S.","last_name":"Povolotskaya"},{"full_name":"Eroshkin, Fedor M.","last_name":"Eroshkin","first_name":"Fedor M."},{"full_name":"Zaraisky, Andrey G.","first_name":"Andrey G.","last_name":"Zaraisky"},{"full_name":"Mishin, Alexander S.","first_name":"Alexander S.","last_name":"Mishin"},{"first_name":"Sergey V.","last_name":"Dolgov","full_name":"Dolgov, Sergey V."},{"full_name":"Mitiouchkina, Tatiana Y.","first_name":"Tatiana Y.","last_name":"Mitiouchkina"},{"full_name":"Kopantzev, Eugene P.","first_name":"Eugene P.","last_name":"Kopantzev"},{"full_name":"Waldenmaier, Hans E.","last_name":"Waldenmaier","first_name":"Hans E."},{"last_name":"Oliveira","first_name":"Anderson G.","full_name":"Oliveira, Anderson G."},{"full_name":"Oba, Yuichi","first_name":"Yuichi","last_name":"Oba"},{"full_name":"Barsova, Ekaterina","first_name":"Ekaterina","last_name":"Barsova"},{"first_name":"Ekaterina A.","last_name":"Bogdanova","full_name":"Bogdanova, Ekaterina A."},{"first_name":"Toni","last_name":"Gabaldón","full_name":"Gabaldón, Toni"},{"full_name":"Stevani, Cassius V.","first_name":"Cassius V.","last_name":"Stevani"},{"full_name":"Lukyanov, Sergey","first_name":"Sergey","last_name":"Lukyanov"},{"full_name":"Smirnov, Ivan V.","first_name":"Ivan V.","last_name":"Smirnov"},{"last_name":"Gitelson","first_name":"Josef I.","full_name":"Gitelson, Josef I."},{"full_name":"Kondrashov, Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694","first_name":"Fyodor","last_name":"Kondrashov"},{"full_name":"Yampolsky, Ilia V.","first_name":"Ilia V.","last_name":"Yampolsky"}],"date_created":"2018-12-23T22:59:18Z","doi":"10.1073/pnas.1803615115"},{"file":[{"access_level":"open_access","file_size":1313606,"content_type":"application/pdf","file_id":"5933","relation":"main_file","checksum":"a6d30b0785db902c734a84fecb2eadd9","creator":"dernst","file_name":"2018_DevGrowh_Hannezo.pdf","date_created":"2019-02-06T10:40:46Z","date_updated":"2020-07-14T12:47:11Z"}],"_id":"5787","publisher":"Wiley","author":[{"first_name":"Edouard B","last_name":"Hannezo","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561"},{"full_name":"Simons, Benjamin D.","last_name":"Simons","first_name":"Benjamin D."}],"date_created":"2018-12-30T22:59:14Z","doi":"10.1111/dgd.12570","intvolume":" 60","type":"journal_article","oa_version":"Published Version","external_id":{"isi":["000453555100002"]},"day":"09","has_accepted_license":"1","month":"12","date_published":"2018-12-09T00:00:00Z","volume":60,"year":"2018","oa":1,"file_date_updated":"2020-07-14T12:47:11Z","abstract":[{"text":"Branching morphogenesis remains a subject of abiding interest. Although much is \r\nknown about the gene regulatory programs and signaling pathways that operate at \r\nthe cellular scale, it has remained unclear how the macroscopic features of branched \r\norgans, including their size, network topology and spatial patterning, are encoded. \r\nLately, it has been proposed that, these features can be explained quantitatively in \r\nseveral organs within a single unifying framework. Based on large-\r\nscale organ recon\r\n-\r\nstructions and cell lineage tracing, it has been argued that morphogenesis follows \r\nfrom the collective dynamics of sublineage- \r\nrestricted self- \r\nrenewing progenitor cells, \r\nlocalized at ductal tips, that act cooperatively to drive a serial process of ductal elon\r\n-\r\ngation and stochastic tip bifurcation. By correlating differentiation or cell cycle exit \r\nwith proximity to maturing ducts, this dynamic results in the specification of a com-\r\nplex network of defined density and statistical organization. These results suggest \r\nthat, for several mammalian tissues, branched epithelial structures develop as a self- \r\norganized process, reliant upon a strikingly simple, but generic, set of local rules, \r\nwithout recourse to a rigid and deterministic sequence of genetically programmed \r\nevents. Here, we review the basis of these findings and discuss their implications.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","title":"Statistical theory of branching morphogenesis","date_updated":"2025-07-10T11:52:59Z","publication_identifier":{"issn":["0012-1592"]},"article_processing_charge":"No","ddc":["570"],"issue":"9","department":[{"_id":"EdHa"}],"status":"public","citation":{"chicago":"Hannezo, Edouard B, and Benjamin D. Simons. “Statistical Theory of Branching Morphogenesis.” Development Growth and Differentiation. Wiley, 2018. https://doi.org/10.1111/dgd.12570.","mla":"Hannezo, Edouard B., and Benjamin D. Simons. “Statistical Theory of Branching Morphogenesis.” Development Growth and Differentiation, vol. 60, no. 9, Wiley, 2018, pp. 512–21, doi:10.1111/dgd.12570.","ista":"Hannezo EB, Simons BD. 2018. Statistical theory of branching morphogenesis. Development Growth and Differentiation. 60(9), 512–521.","short":"E.B. Hannezo, B.D. Simons, Development Growth and Differentiation 60 (2018) 512–521.","ama":"Hannezo EB, Simons BD. Statistical theory of branching morphogenesis. Development Growth and Differentiation. 2018;60(9):512-521. doi:10.1111/dgd.12570","apa":"Hannezo, E. B., & Simons, B. D. (2018). Statistical theory of branching morphogenesis. Development Growth and Differentiation. Wiley. https://doi.org/10.1111/dgd.12570","ieee":"E. B. Hannezo and B. D. Simons, “Statistical theory of branching morphogenesis,” Development Growth and Differentiation, vol. 60, no. 9. Wiley, pp. 512–521, 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"},"page":"512-521","publication":"Development Growth and Differentiation","isi":1,"scopus_import":"1"},{"_id":"5788","publisher":"Springer","main_file_link":[{"url":"https://arxiv.org/abs/1804.04372","open_access":"1"}],"intvolume":" 11316","type":"conference","date_created":"2018-12-30T22:59:14Z","author":[{"last_name":"Avni","first_name":"Guy","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"}],"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"M02369","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-3-030-04612-5_2","month":"11","oa_version":"Preprint","external_id":{"arxiv":["1804.04372"],"isi":["000865933000002"]},"day":"21","abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. Such games are central in formal verification since they model the interaction between a non-terminating system and its environment. We study bidding games in which the players bid for the right to move the token. Two bidding rules have been defined. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the “bank” rather than the other player. While poorman reachability games have been studied before, we present, for the first time, results on infinite-duration poorman games. A central quantity in these games is the ratio between the two players’ initial budgets. The questions we study concern a necessary and sufficient ratio with which a player can achieve a goal. For reachability objectives, such threshold ratios are known to exist for both bidding rules. We show that the properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case. Our most interesting results concern quantitative poorman games, namely poorman mean-payoff games, where we construct optimal strategies depending on the initial ratio, by showing a connection with random-turn based games. The connection in itself is interesting, because it does not hold for reachability poorman games. We also solve the complexity problems that arise in poorman bidding games.","lang":"eng"}],"alternative_title":["LNCS"],"arxiv":1,"date_published":"2018-11-21T00:00:00Z","volume":11316,"oa":1,"year":"2018","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","conference":{"location":"Oxford, UK","end_date":"2018-12-17","name":"14th International Conference on Web and Internet Economics, WINE","start_date":"2018-12-15"},"language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"No","title":"Infinite-duration poorman-bidding games","date_updated":"2026-04-16T09:54:39Z","publication_identifier":{"isbn":["9783030046118"],"issn":["0302-9743"]},"department":[{"_id":"ToHe"}],"citation":{"short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.","chicago":"Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,” 11316:21–36. Springer, 2018. https://doi.org/10.1007/978-3-030-04612-5_2.","ista":"Avni G, Henzinger TA, Ibsen-Jensen R. 2018. Infinite-duration poorman-bidding games. 14th International Conference on Web and Internet Economics, WINE, LNCS, vol. 11316, 21–36.","mla":"Avni, Guy, et al. Infinite-Duration Poorman-Bidding Games. Vol. 11316, Springer, 2018, pp. 21–36, doi:10.1007/978-3-030-04612-5_2.","apa":"Avni, G., Henzinger, T. A., & Ibsen-Jensen, R. (2018). Infinite-duration poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK: Springer. https://doi.org/10.1007/978-3-030-04612-5_2","ama":"Avni G, Henzinger TA, Ibsen-Jensen R. Infinite-duration poorman-bidding games. In: Vol 11316. Springer; 2018:21-36. doi:10.1007/978-3-030-04612-5_2","ieee":"G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36."},"page":"21-36","isi":1,"scopus_import":"1","status":"public"},{"alternative_title":["LNCS"],"arxiv":1,"date_published":"2018-12-18T00:00:00Z","volume":"11282 ","oa":1,"year":"2018","abstract":[{"lang":"eng","text":"Due to data compression or low resolution, nearby vertices and edges of a graph drawing may be bundled to a common node or arc. We model such a “compromised” drawing by a piecewise linear map φ:G → ℝ. We wish to perturb φ by an arbitrarily small ε>0 into a proper drawing (in which the vertices are distinct points, any two edges intersect in finitely many points, and no three edges have a common interior point) that minimizes the number of crossings. An ε-perturbation, for every ε>0, is given by a piecewise linear map (Formula Presented), where with ||·|| is the uniform norm (i.e., sup norm). We present a polynomial-time solution for this optimization problem when G is a cycle and the map φ has no spurs (i.e., no two adjacent edges are mapped to overlapping arcs). We also show that the problem becomes NP-complete (i) when G is an arbitrary graph and φ has no spurs, and (ii) when φ may have spurs and G is a cycle or a union of disjoint paths."}],"publication_status":"published","oa_version":"Preprint","external_id":{"arxiv":["1808.07608"],"isi":["000672802500016"]},"day":"18","month":"12","date_created":"2018-12-30T22:59:15Z","author":[{"first_name":"Radoslav","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774"},{"full_name":"Tóth, Csaba D.","first_name":"Csaba D.","last_name":"Tóth"}],"doi":"10.1007/978-3-030-04414-5_16","type":"conference","_id":"5791","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.07608"}],"publisher":"Springer","status":"public","page":"229-241","citation":{"chicago":"Fulek, Radoslav, and Csaba D. Tóth. “Crossing Minimization in Perturbed Drawings,” 11282:229–41. Springer, 2018. https://doi.org/10.1007/978-3-030-04414-5_16.","ista":"Fulek R, Tóth CD. 2018. Crossing minimization in perturbed drawings. GD: Graph Drawing and Network Visualization, LNCS, vol. 11282, 229–241.","mla":"Fulek, Radoslav, and Csaba D. Tóth. Crossing Minimization in Perturbed Drawings. Vol. 11282, Springer, 2018, pp. 229–41, doi:10.1007/978-3-030-04414-5_16.","short":"R. Fulek, C.D. Tóth, in:, Springer, 2018, pp. 229–241.","apa":"Fulek, R., & Tóth, C. D. (2018). Crossing minimization in perturbed drawings (Vol. 11282, pp. 229–241). Presented at the GD: Graph Drawing and Network Visualization, Barcelona, Spain: Springer. https://doi.org/10.1007/978-3-030-04414-5_16","ama":"Fulek R, Tóth CD. Crossing minimization in perturbed drawings. In: Vol 11282. Springer; 2018:229-241. doi:10.1007/978-3-030-04414-5_16","ieee":"R. Fulek and C. D. Tóth, “Crossing minimization in perturbed drawings,” presented at the GD: Graph Drawing and Network Visualization, Barcelona, Spain, 2018, vol. 11282, pp. 229–241."},"isi":1,"scopus_import":"1","department":[{"_id":"UlWa"}],"title":"Crossing minimization in perturbed drawings","date_updated":"2025-07-10T11:53:00Z","publication_identifier":{"isbn":["9783030044138"]},"article_processing_charge":"No","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Barcelona, Spain","end_date":"2018-09-28","name":"GD: Graph Drawing and Network Visualization","start_date":"2018-09-26"},"quality_controlled":"1"},{"type":"journal_article","intvolume":" 121","doi":"10.1103/PhysRevLett.121.255302","project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"26031614-B435-11E9-9278-68D0E5697425","name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF","grant_number":"P29902"}],"date_created":"2019-01-06T22:59:12Z","author":[{"first_name":"Enderalp","last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","full_name":"Yakaboylu, Enderalp","orcid":"0000-0001-5973-0874"},{"first_name":"Mikhail","last_name":"Shkolnikov","id":"35084A62-F248-11E8-B48F-1D18A9856A87","full_name":"Shkolnikov, Mikhail","orcid":"0000-0002-4310-178X"},{"first_name":"Mikhail","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"}],"main_file_link":[{"url":"https://arxiv.org/abs/1809.00222","open_access":"1"}],"publisher":"American Physical Society","_id":"5794","publication_status":"published","article_type":"original","abstract":[{"text":"We present an approach to interacting quantum many-body systems based on the notion of quantum groups, also known as q-deformed Lie algebras. In particular, we show that, if the symmetry of a free quantum particle corresponds to a Lie group G, in the presence of a many-body environment this particle can be described by a deformed group, Gq. Crucially, the single deformation parameter, q, contains all the information about the many-particle interactions in the system. We exemplify our approach by considering a quantum rotor interacting with a bath of bosons, and demonstrate that extracting the value of q from closed-form solutions in the perturbative regime allows one to predict the behavior of the system for arbitrary values of the impurity-bath coupling strength, in good agreement with nonperturbative calculations. Furthermore, the value of the deformation parameter allows one to predict at which coupling strengths rotor-bath interactions result in a formation of a stable quasiparticle. The approach based on quantum groups does not only allow for a drastic simplification of impurity problems, but also provides valuable insights into hidden symmetries of interacting many-particle systems.","lang":"eng"}],"year":"2018","oa":1,"date_published":"2018-12-17T00:00:00Z","volume":121,"arxiv":1,"month":"12","day":"17","ec_funded":1,"external_id":{"isi":["000454178600009"],"arxiv":["1809.00222"]},"oa_version":"Preprint","article_number":"255302","article_processing_charge":"No","publication_identifier":{"issn":["00319007"]},"date_updated":"2025-04-15T06:50:24Z","title":"Quantum groups as hidden symmetries of quantum impurities","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","isi":1,"publication":"Physical Review Letters","citation":{"ieee":"E. Yakaboylu, M. Shkolnikov, and M. Lemeshko, “Quantum groups as hidden symmetries of quantum impurities,” Physical Review Letters, vol. 121, no. 25. American Physical Society, 2018.","ama":"Yakaboylu E, Shkolnikov M, Lemeshko M. Quantum groups as hidden symmetries of quantum impurities. Physical Review Letters. 2018;121(25). doi:10.1103/PhysRevLett.121.255302","apa":"Yakaboylu, E., Shkolnikov, M., & Lemeshko, M. (2018). Quantum groups as hidden symmetries of quantum impurities. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.121.255302","short":"E. Yakaboylu, M. Shkolnikov, M. Lemeshko, Physical Review Letters 121 (2018).","ista":"Yakaboylu E, Shkolnikov M, Lemeshko M. 2018. Quantum groups as hidden symmetries of quantum impurities. Physical Review Letters. 121(25), 255302.","mla":"Yakaboylu, Enderalp, et al. “Quantum Groups as Hidden Symmetries of Quantum Impurities.” Physical Review Letters, vol. 121, no. 25, 255302, American Physical Society, 2018, doi:10.1103/PhysRevLett.121.255302.","chicago":"Yakaboylu, Enderalp, Mikhail Shkolnikov, and Mikhail Lemeshko. “Quantum Groups as Hidden Symmetries of Quantum Impurities.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.121.255302."},"status":"public","department":[{"_id":"MiLe"}],"issue":"25"},{"department":[{"_id":"EdHa"}],"pmid":1,"ddc":["570"],"issue":"12","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":{"chicago":"Corominas-Murtra, Bernat, Martí Sànchez Fibla, Sergi Valverde, and Ricard Solé. “Chromatic Transitions in the Emergence of Syntax Networks.” Royal Society Open Science. The Royal Society, 2018. https://doi.org/10.1098/rsos.181286.","ista":"Corominas-Murtra B, Fibla MS, Valverde S, Solé R. 2018. Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. 5(12), 181286.","mla":"Corominas-Murtra, Bernat, et al. “Chromatic Transitions in the Emergence of Syntax Networks.” Royal Society Open Science, vol. 5, no. 12, 181286, The Royal Society, 2018, doi:10.1098/rsos.181286.","short":"B. Corominas-Murtra, M.S. Fibla, S. Valverde, R. Solé, Royal Society Open Science 5 (2018).","apa":"Corominas-Murtra, B., Fibla, M. S., Valverde, S., & Solé, R. (2018). Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. The Royal Society. https://doi.org/10.1098/rsos.181286","ama":"Corominas-Murtra B, Fibla MS, Valverde S, Solé R. Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. 2018;5(12). doi:10.1098/rsos.181286","ieee":"B. Corominas-Murtra, M. S. Fibla, S. Valverde, and R. Solé, “Chromatic transitions in the emergence of syntax networks,” Royal Society Open Science, vol. 5, no. 12. The Royal Society, 2018."},"publication":"Royal Society Open Science","status":"public","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"article_number":"181286","article_processing_charge":"No","acknowledgement":"This work was supported by the James McDonnell Foundation (B.C-M., S.V. and R.S.)","date_updated":"2023-10-18T06:41:12Z","publication_identifier":{"issn":["2054-5703"]},"title":"Chromatic transitions in the emergence of syntax networks","has_accepted_license":"1","month":"12","day":"12","oa_version":"Published Version","external_id":{"pmid":["30662738"],"isi":["000456566500027"]},"abstract":[{"lang":"eng","text":"The emergence of syntax during childhood is a remarkable example of how complex correlations unfold in nonlinear ways through development. In particular, rapid transitions seem to occur as children reach the age of two, which seems to separate a two-word, tree-like network of syntactic relations among words from the scale-free graphs associated with the adult, complex grammar. Here, we explore the evolution of syntax networks through language acquisition using the chromatic number, which captures the transition and provides a natural link to standard theories on syntactic structures. The data analysis is compared to a null model of network growth dynamics which is shown to display non-trivial and sensible differences. At a more general level, we observe that the chromatic classes define independent regions of the graph, and thus, can be interpreted as the footprints of incompatibility relations, somewhat as opposed to modularity considerations."}],"publication_status":"published","article_type":"original","file_date_updated":"2020-07-14T12:47:13Z","volume":5,"date_published":"2018-12-12T00:00:00Z","oa":1,"year":"2018","publisher":"The Royal Society","_id":"5859","file":[{"date_updated":"2020-07-14T12:47:13Z","creator":"dernst","file_name":"2018_RoyalSocOS_Corominas.pdf","date_created":"2019-02-05T14:38:09Z","content_type":"application/pdf","access_level":"open_access","file_size":646732,"checksum":"9664d4417f6b792242e31eea77ce9501","relation":"main_file","file_id":"5924"}],"type":"journal_article","intvolume":" 5","doi":"10.1098/rsos.181286","date_created":"2019-01-20T22:59:18Z","author":[{"last_name":"Corominas-Murtra","first_name":"Bernat","orcid":"0000-0001-9806-5643","full_name":"Corominas-Murtra, Bernat","id":"43BE2298-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Fibla","first_name":"Martí Sànchez","full_name":"Fibla, Martí Sànchez"},{"full_name":"Valverde, Sergi","last_name":"Valverde","first_name":"Sergi"},{"last_name":"Solé","first_name":"Ricard","full_name":"Solé, Ricard"}]},{"corr_author":"1","ddc":["570"],"department":[{"_id":"MiSi"}],"status":"public","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":{"short":"J.H. Alanko, M.K. Sixt, ELife 7 (2018).","chicago":"Alanko, Jonna H, and Michael K Sixt. “The Cell Sets the Tone.” ELife. eLife Sciences Publications, 2018. https://doi.org/10.7554/eLife.37888.","ista":"Alanko JH, Sixt MK. 2018. The cell sets the tone. eLife. 7, e37888.","mla":"Alanko, Jonna H., and Michael K. Sixt. “The Cell Sets the Tone.” ELife, vol. 7, e37888, eLife Sciences Publications, 2018, doi:10.7554/eLife.37888.","ama":"Alanko JH, Sixt MK. The cell sets the tone. eLife. 2018;7. doi:10.7554/eLife.37888","apa":"Alanko, J. H., & Sixt, M. K. (2018). The cell sets the tone. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.37888","ieee":"J. H. Alanko and M. K. Sixt, “The cell sets the tone,” eLife, vol. 7. eLife Sciences Publications, 2018."},"publication":"eLife","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2025-07-10T11:53:05Z","publication_identifier":{"issn":["2050-084X"]},"title":"The cell sets the tone","article_number":"e37888","article_processing_charge":"No","day":"06","oa_version":"Published Version","external_id":{"isi":["000434375000001"]},"has_accepted_license":"1","month":"06","volume":7,"date_published":"2018-06-06T00:00:00Z","oa":1,"year":"2018","abstract":[{"text":"In zebrafish larvae, it is the cell type that determines how the cell responds to a chemokine signal.","lang":"eng"}],"article_type":"original","publication_status":"published","file_date_updated":"2020-07-14T12:47:13Z","file":[{"file_size":358141,"access_level":"open_access","content_type":"application/pdf","file_id":"5973","relation":"main_file","checksum":"f1c7ec2a809408d763c4b529a98f9a3b","date_created":"2019-02-13T10:52:11Z","file_name":"2018_eLife_Alanko.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:13Z"}],"publisher":"eLife Sciences Publications","_id":"5861","doi":"10.7554/eLife.37888","author":[{"last_name":"Alanko","first_name":"Jonna H","orcid":"0000-0002-7698-3061","full_name":"Alanko, Jonna H","id":"2CC12E8C-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K"}],"date_created":"2019-01-20T22:59:19Z","intvolume":" 7","type":"journal_article"},{"file":[{"file_id":"5893","relation":"main_file","checksum":"4498301c8c53097c9a1a8ef990936eb5","file_size":1237482,"access_level":"open_access","content_type":"application/pdf","creator":"dernst","date_created":"2019-01-28T15:18:02Z","file_name":"2018_EMM_Tarlungeanu.pdf","date_updated":"2020-07-14T12:47:13Z"}],"_id":"5888","publisher":"Springer Nature","date_created":"2019-01-27T22:59:11Z","author":[{"last_name":"Tarlungeanu","first_name":"Dora-Clara","full_name":"Tarlungeanu, Dora-Clara","id":"2ABCE612-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","first_name":"Gaia"}],"doi":"10.1038/s12276-018-0129-7","intvolume":" 50","type":"journal_article","external_id":{"pmid":["30089840"],"isi":["000441266700006"]},"oa_version":"Published Version","day":"07","month":"08","has_accepted_license":"1","oa":1,"year":"2018","date_published":"2018-08-07T00:00:00Z","volume":50,"file_date_updated":"2020-07-14T12:47:13Z","publication_status":"published","abstract":[{"text":"Despite the remarkable number of scientific breakthroughs of the last 100 years, the treatment of neurodevelopmental\r\ndisorders (e.g., autism spectrum disorder, intellectual disability) remains a great challenge. Recent advancements in\r\ngenomics, such as whole-exome or whole-genome sequencing, have enabled scientists to identify numerous\r\nmutations underlying neurodevelopmental disorders. Given the few hundred risk genes that have been discovered,\r\nthe etiological variability and the heterogeneous clinical presentation, the need for genotype — along with phenotype-\r\nbased diagnosis of individual patients has become a requisite. In this review we look at recent advancements in\r\ngenomic analysis and their translation into clinical practice.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"quality_controlled":"1","title":"Genomics in neurodevelopmental disorders: an avenue to personalized medicine","publication_identifier":{"issn":["2092-6413"]},"date_updated":"2023-09-11T14:04:41Z","article_processing_charge":"No","article_number":"100","issue":"8","ddc":["570"],"department":[{"_id":"GaNo"}],"pmid":1,"status":"public","publication":"Experimental & Molecular Medicine","citation":{"ieee":"D.-C. Tarlungeanu and G. Novarino, “Genomics in neurodevelopmental disorders: an avenue to personalized medicine,” Experimental & Molecular Medicine, vol. 50, no. 8. Springer Nature, 2018.","apa":"Tarlungeanu, D.-C., & Novarino, G. (2018). Genomics in neurodevelopmental disorders: an avenue to personalized medicine. Experimental & Molecular Medicine. Springer Nature. https://doi.org/10.1038/s12276-018-0129-7","ama":"Tarlungeanu D-C, Novarino G. Genomics in neurodevelopmental disorders: an avenue to personalized medicine. Experimental & Molecular Medicine. 2018;50(8). doi:10.1038/s12276-018-0129-7","mla":"Tarlungeanu, Dora-Clara, and Gaia Novarino. “Genomics in Neurodevelopmental Disorders: An Avenue to Personalized Medicine.” Experimental & Molecular Medicine, vol. 50, no. 8, 100, Springer Nature, 2018, doi:10.1038/s12276-018-0129-7.","ista":"Tarlungeanu D-C, Novarino G. 2018. Genomics in neurodevelopmental disorders: an avenue to personalized medicine. Experimental & Molecular Medicine. 50(8), 100.","chicago":"Tarlungeanu, Dora-Clara, and Gaia Novarino. “Genomics in Neurodevelopmental Disorders: An Avenue to Personalized Medicine.” Experimental & Molecular Medicine. Springer Nature, 2018. https://doi.org/10.1038/s12276-018-0129-7.","short":"D.-C. Tarlungeanu, G. Novarino, Experimental & Molecular Medicine 50 (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","isi":1},{"edition":"1","publisher":"Springer","_id":"59","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"type":"book_chapter","publication_identifier":{"isbn":["978-3-319-10574-1"]},"doi":"10.1007/978-3-319-10575-8_27","date_updated":"2021-01-12T08:05:10Z","author":[{"last_name":"Bloem","first_name":"Roderick","full_name":"Bloem, Roderick"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"}],"date_created":"2018-12-11T11:44:24Z","editor":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Clarke, Edmund M.","last_name":"Clarke","first_name":"Edmund M."},{"last_name":"Veith","first_name":"Helmut","full_name":"Veith, Helmut"},{"last_name":"Bloem","first_name":"Roderick","full_name":"Bloem, Roderick"}],"title":"Graph games and reactive synthesis","month":"05","department":[{"_id":"KrCh"}],"day":"19","oa_version":"None","scopus_import":1,"publication_status":"published","abstract":[{"lang":"eng","text":"Graph-based games are an important tool in computer science. They have applications in synthesis, verification, refinement, and far beyond. We review graphbased games with objectives on infinite plays. We give definitions and algorithms to solve the games and to give a winning strategy. The objectives we consider are mostly Boolean, but we also look at quantitative graph-based games and their objectives. Synthesis aims to turn temporal logic specifications into correct reactive systems. We explain the reduction of synthesis to graph-based games (or equivalently tree automata) using synthesis of LTL specifications as an example. We treat the classical approach that uses determinization of parity automata and more modern approaches."}],"publication":"Handbook of Model Checking","citation":{"ieee":"R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in Handbook of Model Checking, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962.","apa":"Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27","ama":"Bloem R, Chatterjee K, Jobstmann B. Graph games and reactive synthesis. In: Henzinger TA, Clarke EM, Veith H, Bloem R, eds. Handbook of Model Checking. 1st ed. Springer; 2018:921-962. doi:10.1007/978-3-319-10575-8_27","ista":"Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 921–962.","mla":"Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.” Handbook of Model Checking, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:10.1007/978-3-319-10575-8_27.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In Handbook of Model Checking, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_27.","short":"R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke, H. Veith, R. Bloem (Eds.), Handbook of Model Checking, 1st ed., Springer, 2018, pp. 921–962."},"publist_id":"7995","page":"921 - 962","year":"2018","date_published":"2018-05-19T00:00:00Z","status":"public"},{"date_created":"2019-02-13T09:19:28Z","author":[{"full_name":"Bakhirkin, Alexey","last_name":"Bakhirkin","first_name":"Alexey"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","orcid":"0000-0001-5199-3143","first_name":"Thomas","last_name":"Ferrere"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Nickovicl","first_name":"Deian","full_name":"Nickovicl, Deian"}],"project":[{"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"}],"doi":"10.1109/emsoft.2018.8537203","type":"conference","file":[{"date_updated":"2020-07-14T12:47:13Z","creator":"dernst","file_name":"2018_EMSOFT_Bakhirkin.pdf","date_created":"2020-05-14T16:01:29Z","relation":"main_file","checksum":"234a33ad9055b3458fcdda6af251b33a","file_id":"7839","content_type":"application/pdf","access_level":"open_access","file_size":338006}],"_id":"5959","publisher":"IEEE","date_published":"2018-09-30T00:00:00Z","year":"2018","oa":1,"file_date_updated":"2020-07-14T12:47:13Z","abstract":[{"lang":"eng","text":"Formalizing properties of systems with continuous dynamics is a challenging task. In this paper, we propose a formal framework for specifying and monitoring rich temporal properties of real-valued signals. We introduce signal first-order logic (SFO) as a specification language that combines first-order logic with linear-real arithmetic and unary function symbols interpreted as piecewise-linear signals. We first show that while the satisfiability problem for SFO is undecidable, its membership and monitoring problems are decidable. We develop an offline monitoring procedure for SFO that has polynomial complexity in the size of the input trace and the specification, for a fixed number of quantifiers and function symbols. We show that the algorithm has computation time linear in the size of the input trace for the important fragment of bounded-response specifications interpreted over input traces with finite variability. We can use our results to extend signal temporal logic with first-order quantifiers over time and value parameters, while preserving its efficient monitoring. We finally demonstrate the practical appeal of our logic through a case study in the micro-electronics domain."}],"publication_status":"published","oa_version":"Published Version","external_id":{"isi":["000492828500005"]},"day":"30","has_accepted_license":"1","month":"09","title":"Keynote: The first-order logic of signals","date_updated":"2025-07-10T11:53:06Z","publication_identifier":{"isbn":["9781538655603"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2018-09-30","name":"EMSOFT: Embedded Software","location":"Turin, Italy","end_date":"2018-10-05"},"language":[{"iso":"eng"}],"quality_controlled":"1","status":"public","page":"1-10","citation":{"mla":"Bakhirkin, Alexey, et al. “Keynote: The First-Order Logic of Signals.” 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10, doi:10.1109/emsoft.2018.8537203.","ista":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. 2018. Keynote: The first-order logic of signals. 2018 International Conference on Embedded Software. EMSOFT: Embedded Software, 1–10.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Thomas A Henzinger, and Deian Nickovicl. “Keynote: The First-Order Logic of Signals.” In 2018 International Conference on Embedded Software, 1–10. IEEE, 2018. https://doi.org/10.1109/emsoft.2018.8537203.","short":"A. Bakhirkin, T. Ferrere, T.A. Henzinger, D. Nickovicl, in:, 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10.","ieee":"A. Bakhirkin, T. Ferrere, T. A. Henzinger, and D. Nickovicl, “Keynote: The first-order logic of signals,” in 2018 International Conference on Embedded Software, Turin, Italy, 2018, pp. 1–10.","apa":"Bakhirkin, A., Ferrere, T., Henzinger, T. A., & Nickovicl, D. (2018). Keynote: The first-order logic of signals. In 2018 International Conference on Embedded Software (pp. 1–10). Turin, Italy: IEEE. https://doi.org/10.1109/emsoft.2018.8537203","ama":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. Keynote: The first-order logic of signals. In: 2018 International Conference on Embedded Software. IEEE; 2018:1-10. doi:10.1109/emsoft.2018.8537203"},"publication":"2018 International Conference on Embedded Software","isi":1,"scopus_import":"1","ddc":["000"],"department":[{"_id":"ToHe"}]},{"abstract":[{"lang":"eng","text":"In this paper we present a reliable method to verify the existence of loops along the uncertain trajectory of a robot, based on proprioceptive measurements only, within a bounded-error context. The loop closure detection is one of the key points in simultaneous localization and mapping (SLAM) methods, especially in homogeneous environments with difficult scenes recognitions. The proposed approach is generic and could be coupled with conventional SLAM algorithms to reliably reduce their computing burden, thus improving the localization and mapping processes in the most challenging environments such as unexplored underwater extents. To prove that a robot performed a loop whatever the uncertainties in its evolution, we employ the notion of topological degree that originates in the field of differential topology. We show that a verification tool based on the topological degree is an optimal method for proving robot loops. This is demonstrated both on datasets from real missions involving autonomous underwater vehicles and by a mathematical discussion."}],"publication_status":"published","arxiv":1,"date_published":"2018-10-24T00:00:00Z","volume":37,"oa":1,"year":"2018","month":"10","oa_version":"Preprint","external_id":{"isi":["000456881100004"],"arxiv":["1712.01341"]},"day":"24","type":"journal_article","intvolume":" 37","date_created":"2019-02-13T09:36:20Z","author":[{"first_name":"Simon","last_name":"Rohou","full_name":"Rohou, Simon"},{"orcid":"0000-0001-8878-8397","id":"473294AE-F248-11E8-B48F-1D18A9856A87","full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter"},{"first_name":"Clément","last_name":"Aubry","full_name":"Aubry, Clément"},{"full_name":"Jaulin, Luc","last_name":"Jaulin","first_name":"Luc"}],"doi":"10.1177/0278364918808367","_id":"5960","main_file_link":[{"url":"https://arxiv.org/abs/1712.01341","open_access":"1"}],"publisher":"SAGE Publications","page":"1500-1516","citation":{"short":"S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics Research 37 (2018) 1500–1516.","chicago":"Rohou, Simon, Peter Franek, Clément Aubry, and Luc Jaulin. “Proving the Existence of Loops in Robot Trajectories.” The International Journal of Robotics Research. SAGE Publications, 2018. https://doi.org/10.1177/0278364918808367.","mla":"Rohou, Simon, et al. “Proving the Existence of Loops in Robot Trajectories.” The International Journal of Robotics Research, vol. 37, no. 12, SAGE Publications, 2018, pp. 1500–16, doi:10.1177/0278364918808367.","ista":"Rohou S, Franek P, Aubry C, Jaulin L. 2018. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 37(12), 1500–1516.","apa":"Rohou, S., Franek, P., Aubry, C., & Jaulin, L. (2018). Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. SAGE Publications. https://doi.org/10.1177/0278364918808367","ama":"Rohou S, Franek P, Aubry C, Jaulin L. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 2018;37(12):1500-1516. doi:10.1177/0278364918808367","ieee":"S. Rohou, P. Franek, C. Aubry, and L. Jaulin, “Proving the existence of loops in robot trajectories,” The International Journal of Robotics Research, vol. 37, no. 12. SAGE Publications, pp. 1500–1516, 2018."},"publication":"The International Journal of Robotics Research","isi":1,"scopus_import":"1","status":"public","department":[{"_id":"UlWa"}],"issue":"12","article_processing_charge":"No","title":"Proving the existence of loops in robot trajectories","date_updated":"2023-09-19T10:41:59Z","publication_identifier":{"issn":["0278-3649"],"eissn":["1741-3176"]},"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1"},{"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2018-07-23","end_date":"2018-07-27","location":"Egham, United Kingdom","name":"PODC: Principles of Distributed Computing"},"quality_controlled":"1","_id":"5961","publisher":"ACM","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"}],"date_created":"2019-02-13T09:48:55Z","title":"A brief tutorial on distributed and concurrent machine learning","date_updated":"2025-06-03T11:56:33Z","publication_identifier":{"isbn":["9781450357951"]},"doi":"10.1145/3212734.3212798","article_processing_charge":"No","type":"conference","oa_version":"None","external_id":{"isi":["000458186900063"]},"day":"27","department":[{"_id":"DaAl"}],"month":"07","status":"public","date_published":"2018-07-27T00:00:00Z","year":"2018","page":"487-488","citation":{"mla":"Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 487–88, doi:10.1145/3212734.3212798.","ista":"Alistarh D-A. 2018. A brief tutorial on distributed and concurrent machine learning. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 487–488.","chicago":"Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 487–88. ACM, 2018. https://doi.org/10.1145/3212734.3212798.","short":"D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 487–488.","ieee":"D.-A. Alistarh, “A brief tutorial on distributed and concurrent machine learning,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 487–488.","ama":"Alistarh D-A. A brief tutorial on distributed and concurrent machine learning. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM; 2018:487-488. doi:10.1145/3212734.3212798","apa":"Alistarh, D.-A. (2018). A brief tutorial on distributed and concurrent machine learning. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 487–488). Egham, United Kingdom: ACM. https://doi.org/10.1145/3212734.3212798"},"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","isi":1,"abstract":[{"lang":"eng","text":"The area of machine learning has made considerable progress over the past decade, enabled by the widespread availability of large datasets, as well as by improved algorithms and models. Given the large computational demands of machine learning workloads, parallelism, implemented either through single-node concurrency or through multi-node distribution, has been a third key ingredient to advances in machine learning.\r\nThe goal of this tutorial is to provide the audience with an overview of standard distribution techniques in machine learning, with an eye towards the intriguing trade-offs between synchronization and communication costs of distributed machine learning algorithms, on the one hand, and their convergence, on the other.The tutorial will focus on parallelization strategies for the fundamental stochastic gradient descent (SGD) algorithm, which is a key tool when training machine learning models, from classical instances such as linear regression, to state-of-the-art neural network architectures.\r\nThe tutorial will describe the guarantees provided by this algorithm in the sequential case, and then move on to cover both shared-memory and message-passing parallelization strategies, together with the guarantees they provide, and corresponding trade-offs. The presentation will conclude with a broad overview of ongoing research in distributed and concurrent machine learning. The tutorial will assume no prior knowledge beyond familiarity with basic concepts in algebra and analysis.\r\n"}],"publication_status":"published","scopus_import":"1"},{"arxiv":1,"date_published":"2018-07-23T00:00:00Z","oa":1,"year":"2018","abstract":[{"lang":"eng","text":"Stochastic Gradient Descent (SGD) is a fundamental algorithm in machine learning, representing the optimization backbone for training several classic models, from regression to neural networks. Given the recent practical focus on distributed machine learning, significant work has been dedicated to the convergence properties of this algorithm under the inconsistent and noisy updates arising from execution in a distributed environment. However, surprisingly, the convergence properties of this classic algorithm in the standard shared-memory model are still not well-understood. In this work, we address this gap, and provide new convergence bounds for lock-free concurrent stochastic gradient descent, executing in the classic asynchronous shared memory model, against a strong adaptive adversary. Our results give improved upper and lower bounds on the \"price of asynchrony'' when executing the fundamental SGD algorithm in a concurrent setting. They show that this classic optimization tool can converge faster and with a wider range of parameters than previously known under asynchronous iterations. At the same time, we exhibit a fundamental trade-off between the maximum delay in the system and the rate at which SGD can converge, which governs the set of parameters under which this algorithm can still work efficiently."}],"publication_status":"published","oa_version":"Preprint","external_id":{"arxiv":["1803.08841"],"isi":["000458186900022"]},"day":"23","month":"07","date_created":"2019-02-13T09:58:58Z","author":[{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"full_name":"De Sa, Christopher","last_name":"De Sa","first_name":"Christopher"},{"id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","full_name":"Konstantinov, Nikola H","last_name":"Konstantinov","first_name":"Nikola H"}],"doi":"10.1145/3212734.3212763","type":"conference","_id":"5962","publisher":"ACM","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.08841"}],"status":"public","citation":{"ieee":"D.-A. Alistarh, C. De Sa, and N. H. Konstantinov, “The convergence of stochastic gradient descent in asynchronous shared memory,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 169–178.","ama":"Alistarh D-A, De Sa C, Konstantinov NH. The convergence of stochastic gradient descent in asynchronous shared memory. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM; 2018:169-178. doi:10.1145/3212734.3212763","apa":"Alistarh, D.-A., De Sa, C., & Konstantinov, N. H. (2018). The convergence of stochastic gradient descent in asynchronous shared memory. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 169–178). Egham, United Kingdom: ACM. https://doi.org/10.1145/3212734.3212763","ista":"Alistarh D-A, De Sa C, Konstantinov NH. 2018. The convergence of stochastic gradient descent in asynchronous shared memory. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 169–178.","mla":"Alistarh, Dan-Adrian, et al. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 169–78, doi:10.1145/3212734.3212763.","chicago":"Alistarh, Dan-Adrian, Christopher De Sa, and Nikola H Konstantinov. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 169–78. ACM, 2018. https://doi.org/10.1145/3212734.3212763.","short":"D.-A. Alistarh, C. De Sa, N.H. Konstantinov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 169–178."},"page":"169-178","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","isi":1,"scopus_import":"1","department":[{"_id":"DaAl"}],"title":"The convergence of stochastic gradient descent in asynchronous shared memory","date_updated":"2025-06-03T11:56:41Z","publication_identifier":{"isbn":["9781450357951"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2018-07-27","location":"Egham, United Kingdom","name":"PODC: Principles of Distributed Computing","start_date":"2018-07-23"},"language":[{"iso":"eng"}],"quality_controlled":"1"},{"department":[{"_id":"DaAl"}],"citation":{"mla":"Alistarh, Dan-Adrian, et al. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 377–86, doi:10.1145/3212734.3212756.","ista":"Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. 2018. Relaxed schedulers can efficiently parallelize iterative algorithms. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 377–386.","chicago":"Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, and Giorgi Nadiradze. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 377–86. ACM, 2018. https://doi.org/10.1145/3212734.3212756.","short":"D.-A. Alistarh, T.A. Brown, J. Kopinsky, G. Nadiradze, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 377–386.","ieee":"D.-A. Alistarh, T. A. Brown, J. Kopinsky, and G. Nadiradze, “Relaxed schedulers can efficiently parallelize iterative algorithms,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 377–386.","apa":"Alistarh, D.-A., Brown, T. A., Kopinsky, J., & Nadiradze, G. (2018). Relaxed schedulers can efficiently parallelize iterative algorithms. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 377–386). Egham, United Kingdom: ACM. https://doi.org/10.1145/3212734.3212756","ama":"Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. Relaxed schedulers can efficiently parallelize iterative algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM; 2018:377-386. doi:10.1145/3212734.3212756"},"page":"377-386","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","isi":1,"scopus_import":"1","status":"public","conference":{"start_date":"2018-07-23","name":"PODC: Principles of Distributed Computing","location":"Egham, United Kingdom","end_date":"2018-07-27"},"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","article_processing_charge":"No","title":"Relaxed schedulers can efficiently parallelize iterative algorithms","date_updated":"2025-06-03T11:56:49Z","publication_identifier":{"isbn":["9781450357951"]},"month":"07","oa_version":"Preprint","external_id":{"isi":["000458186900048"],"arxiv":["1808.04155"]},"day":"23","abstract":[{"text":"There has been significant progress in understanding the parallelism inherent to iterative sequential algorithms: for many classic algorithms, the depth of the dependence structure is now well understood, and scheduling techniques have been developed to exploit this shallow dependence structure for efficient parallel implementations. A related, applied research strand has studied methods by which certain iterative task-based algorithms can be efficiently parallelized via relaxed concurrent priority schedulers. These allow for high concurrency when inserting and removing tasks, at the cost of executing superfluous work due to the relaxed semantics of the scheduler. In this work, we take a step towards unifying these two research directions, by showing that there exists a family of relaxed priority schedulers that can efficiently and deterministically execute classic iterative algorithms such as greedy maximal independent set (MIS) and matching. Our primary result shows that, given a randomized scheduler with an expected relaxation factor of k in terms of the maximum allowed priority inversions on a task, and any graph on n vertices, the scheduler is able to execute greedy MIS with only an additive factor of \\poly(k) expected additional iterations compared to an exact (but not scalable) scheduler. This counter-intuitive result demonstrates that the overhead of relaxation when computing MIS is not dependent on the input size or structure of the input graph. Experimental results show that this overhead can be clearly offset by the gain in performance due to the highly scalable scheduler. In sum, we present an efficient method to deterministically parallelize iterative sequential algorithms, with provable runtime guarantees in terms of the number of executed tasks to completion.","lang":"eng"}],"publication_status":"published","arxiv":1,"date_published":"2018-07-23T00:00:00Z","year":"2018","oa":1,"_id":"5963","publisher":"ACM","main_file_link":[{"url":"https://arxiv.org/abs/1808.04155","open_access":"1"}],"type":"conference","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"last_name":"Brown","first_name":"Trevor A","full_name":"Brown, Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kopinsky","first_name":"Justin","full_name":"Kopinsky, Justin"},{"full_name":"Nadiradze, Giorgi","last_name":"Nadiradze","first_name":"Giorgi"}],"date_created":"2019-02-13T10:03:25Z","doi":"10.1145/3212734.3212756"},{"article_processing_charge":"No","date_updated":"2025-06-03T11:58:00Z","publication_identifier":{"isbn":["9781450357951"]},"title":"Brief Announcement: Performance prediction for coarse-grained locking","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"conference":{"start_date":"2018-07-23","location":"Egham, United Kingdom","end_date":"2018-07-27","name":"PODC: Principles of Distributed Computing"},"isi":1,"scopus_import":"1","page":"411-413","citation":{"apa":"Aksenov, V., Alistarh, D.-A., & Kuznetsov, P. (2018). Brief Announcement: Performance prediction for coarse-grained locking. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 411–413). Egham, United Kingdom: ACM. https://doi.org/10.1145/3212734.3212785","ama":"Aksenov V, Alistarh D-A, Kuznetsov P. Brief Announcement: Performance prediction for coarse-grained locking. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM; 2018:411-413. doi:10.1145/3212734.3212785","ieee":"V. Aksenov, D.-A. Alistarh, and P. Kuznetsov, “Brief Announcement: Performance prediction for coarse-grained locking,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 411–413.","short":"V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 411–413.","chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, and Petr Kuznetsov. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 411–13. ACM, 2018. https://doi.org/10.1145/3212734.3212785.","ista":"Aksenov V, Alistarh D-A, Kuznetsov P. 2018. Brief Announcement: Performance prediction for coarse-grained locking. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 411–413.","mla":"Aksenov, Vitaly, et al. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 411–13, doi:10.1145/3212734.3212785."},"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","status":"public","department":[{"_id":"DaAl"}],"type":"conference","doi":"10.1145/3212734.3212785","author":[{"full_name":"Aksenov, Vitaly","first_name":"Vitaly","last_name":"Aksenov"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Kuznetsov, Petr","last_name":"Kuznetsov","first_name":"Petr"}],"date_created":"2019-02-13T10:08:19Z","main_file_link":[{"url":"https://hal-univ-lyon3.archives-ouvertes.fr/INRIA/hal-01887733v1","open_access":"1"}],"publisher":"ACM","_id":"5964","abstract":[{"lang":"eng","text":"A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is an alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. A lock can be viewed as a queue that arbitrates the order in which the critical sections are executed, and a natural question is whether we can use stochastic analysis to predict the resulting throughput. As a preliminary evidence to the affirmative, we describe a simple model that can be used to predict the throughput of coarse-grained lock-based algorithms. We show that our model works well for CLH lock, and we expect it to work for other popular lock designs such as TTAS, MCS, etc."}],"publication_status":"published","date_published":"2018-07-23T00:00:00Z","oa":1,"year":"2018","month":"07","day":"23","oa_version":"Submitted Version","external_id":{"isi":["000458186900052"]}},{"_id":"5965","publisher":"ACM","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.01018"}],"author":[{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A","last_name":"Brown","first_name":"Trevor A"},{"full_name":"Kopinsky, Justin","first_name":"Justin","last_name":"Kopinsky"},{"full_name":"Li, Jerry Z.","first_name":"Jerry Z.","last_name":"Li"},{"full_name":"Nadiradze, Giorgi","first_name":"Giorgi","last_name":"Nadiradze"}],"date_created":"2019-02-13T10:17:19Z","doi":"10.1145/3210377.3210411","type":"conference","external_id":{"isi":["000545269600016"],"arxiv":["1804.01018"]},"oa_version":"Preprint","day":"16","month":"07","arxiv":1,"year":"2018","oa":1,"date_published":"2018-07-16T00:00:00Z","related_material":{"record":[{"relation":"dissertation_contains","id":"10429","status":"public"}]},"publication_status":"published","abstract":[{"lang":"eng","text":"Relaxed concurrent data structures have become increasingly popular, due to their scalability in graph processing and machine learning applications (\\citeNguyen13, gonzalez2012powergraph ). Despite considerable interest, there exist families of natural, high performing randomized relaxed concurrent data structures, such as the popular MultiQueue~\\citeMQ pattern for implementing relaxed priority queue data structures, for which no guarantees are known in the concurrent setting~\\citeAKLN17. Our main contribution is in showing for the first time that, under a set of analytic assumptions, a family of relaxed concurrent data structures, including variants of MultiQueues, but also a new approximate counting algorithm we call the MultiCounter, provides strong probabilistic guarantees on the degree of relaxation with respect to the sequential specification, in arbitrary concurrent executions. We formalize these guarantees via a new correctness condition called distributional linearizability, tailored to concurrent implementations with randomized relaxations. Our result is based on a new analysis of an asynchronous variant of the classic power-of-two-choices load balancing algorithm, in which placement choices can be based on inconsistent, outdated information (this result may be of independent interest). We validate our results empirically, showing that the MultiCounter algorithm can implement scalable relaxed timestamps."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2018-07-16","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","end_date":"2018-07-18","location":"Vienna, Austria"},"language":[{"iso":"eng"}],"quality_controlled":"1","title":"Distributionally linearizable data structures","publication_identifier":{"isbn":["9781450357999"]},"date_updated":"2026-04-08T07:00:45Z","article_processing_charge":"No","department":[{"_id":"DaAl"}],"status":"public","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","page":"133-142","citation":{"apa":"Alistarh, D.-A., Brown, T. A., Kopinsky, J., Li, J. Z., & Nadiradze, G. (2018). Distributionally linearizable data structures. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18 (pp. 133–142). Vienna, Austria: ACM. https://doi.org/10.1145/3210377.3210411","ama":"Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable data structures. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM; 2018:133-142. doi:10.1145/3210377.3210411","ieee":"D.-A. Alistarh, T. A. Brown, J. Kopinsky, J. Z. Li, and G. Nadiradze, “Distributionally linearizable data structures,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 133–142.","short":"D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM, 2018, pp. 133–142.","chicago":"Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, 133–42. ACM, 2018. https://doi.org/10.1145/3210377.3210411.","ista":"Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. 2018. Distributionally linearizable data structures. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 133–142.","mla":"Alistarh, Dan-Adrian, et al. “Distributionally Linearizable Data Structures.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM, 2018, pp. 133–42, doi:10.1145/3210377.3210411."},"scopus_import":"1","isi":1},{"oa_version":"Preprint","external_id":{"arxiv":["1804.00947"],"isi":["000545269600046"]},"day":"16","month":"07","arxiv":1,"date_published":"2018-07-16T00:00:00Z","year":"2018","oa":1,"abstract":[{"text":"The transactional conflict problem arises in transactional systems whenever two or more concurrent transactions clash on a data item. While the standard solution to such conflicts is to immediately abort one of the transactions, some practical systems consider the alternative of delaying conflict resolution for a short interval, which may allow one of the transactions to commit. The challenge in the transactional conflict problem is to choose the optimal length of this delay interval so as to minimize the overall running time penalty for the conflicting transactions. In this paper, we propose a family of optimal online algorithms for the transactional conflict problem. Specifically, we consider variants of this problem which arise in different implementations of transactional systems, namely \"requestor wins'' and \"requestor aborts'' implementations: in the former, the recipient of a coherence request is aborted, whereas in the latter, it is the requestor which has to abort. Both strategies are implemented by real systems. We show that the requestor aborts case can be reduced to a classic instance of the ski rental problem, while the requestor wins case leads to a new version of this classical problem, for which we derive optimal deterministic and randomized algorithms. Moreover, we prove that, under a simplified adversarial model, our algorithms are constant-competitive with the offline optimum in terms of throughput. We validate our algorithmic results empirically through a hardware simulation of hardware transactional memory (HTM), showing that our algorithms can lead to non-trivial performance improvements for classic concurrent data structures.","lang":"eng"}],"publication_status":"published","_id":"5966","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.00947"}],"publisher":"ACM","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"last_name":"Haider","first_name":"Syed Kamran","full_name":"Haider, Syed Kamran"},{"full_name":"Kübler, Raphael","last_name":"Kübler","first_name":"Raphael"},{"full_name":"Nadiradze, Giorgi","last_name":"Nadiradze","first_name":"Giorgi"}],"date_created":"2019-02-13T10:26:07Z","doi":"10.1145/3210377.3210406","type":"conference","department":[{"_id":"DaAl"}],"status":"public","citation":{"ama":"Alistarh D-A, Haider SK, Kübler R, Nadiradze G. The transactional conflict problem. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM; 2018:383-392. doi:10.1145/3210377.3210406","apa":"Alistarh, D.-A., Haider, S. K., Kübler, R., & Nadiradze, G. (2018). The transactional conflict problem. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18 (pp. 383–392). Vienna, Austria: ACM. https://doi.org/10.1145/3210377.3210406","ieee":"D.-A. Alistarh, S. K. Haider, R. Kübler, and G. Nadiradze, “The transactional conflict problem,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 383–392.","short":"D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM, 2018, pp. 383–392.","chicago":"Alistarh, Dan-Adrian, Syed Kamran Haider, Raphael Kübler, and Giorgi Nadiradze. “The Transactional Conflict Problem.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, 383–92. ACM, 2018. https://doi.org/10.1145/3210377.3210406.","mla":"Alistarh, Dan-Adrian, et al. “The Transactional Conflict Problem.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM, 2018, pp. 383–92, doi:10.1145/3210377.3210406.","ista":"Alistarh D-A, Haider SK, Kübler R, Nadiradze G. 2018. The transactional conflict problem. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 383–392."},"page":"383-392","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","isi":1,"scopus_import":"1","conference":{"start_date":"2018-07-16","location":"Vienna, Austria","end_date":"2018-07-18","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","title":"The transactional conflict problem","date_updated":"2025-06-03T11:58:22Z","publication_identifier":{"isbn":["9781450357999"]},"article_processing_charge":"No"},{"date_published":"2018-06-18T00:00:00Z","oa":1,"year":"2018","file_date_updated":"2020-07-14T12:47:14Z","abstract":[{"text":"The Big Match is a multi-stage two-player game. In each stage Player 1 hides one or two pebbles in his hand, and his opponent has to guess that number; Player 1 loses a point if Player 2 is correct, and otherwise he wins a point. As soon as Player 1 hides one pebble, the players cannot change their choices in any future stage.\r\nBlackwell and Ferguson (1968) give an ε-optimal strategy for Player 1 that hides, in each stage, one pebble with a probability that depends on the entire past history. Any strategy that depends just on the clock or on a finite memory is worthless. The long-standing natural open problem has been whether every strategy that depends just on the clock and a finite memory is worthless. We prove that there is such a strategy that is ε-optimal. In fact, we show that just two states of memory are sufficient.\r\n","lang":"eng"}],"publication_status":"published","oa_version":"Submitted Version","external_id":{"isi":["000492755100020"]},"day":"18","has_accepted_license":"1","month":"06","author":[{"full_name":"Hansen, Kristoffer Arnsfelt","last_name":"Hansen","first_name":"Kristoffer Arnsfelt"},{"orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"first_name":"Abraham","last_name":"Neyman","full_name":"Neyman, Abraham"}],"date_created":"2019-02-13T10:31:41Z","doi":"10.1145/3219166.3219198","type":"conference","file":[{"date_created":"2019-11-19T08:24:24Z","file_name":"2018_EC18_Hansen.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:14Z","file_id":"7054","checksum":"bb52683e349cfd864f4769a8f38f2798","relation":"main_file","access_level":"open_access","file_size":302539,"content_type":"application/pdf"}],"_id":"5967","publisher":"ACM","status":"public","page":"149-150","citation":{"ieee":"K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.","ama":"Hansen KA, Ibsen-Jensen R, Neyman A. The Big Match with a clock and a bit of memory. In: Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18. ACM; 2018:149-150. doi:10.1145/3219166.3219198","apa":"Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The Big Match with a clock and a bit of memory. In Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18 (pp. 149–150). Ithaca, NY, United States: ACM. https://doi.org/10.1145/3219166.3219198","mla":"Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.” Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM, 2018, pp. 149–50, doi:10.1145/3219166.3219198.","ista":"Hansen KA, Ibsen-Jensen R, Neyman A. 2018. The Big Match with a clock and a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18. EC: Conference on Economics and Computation, 149–150.","chicago":"Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, 149–50. ACM, 2018. https://doi.org/10.1145/3219166.3219198.","short":"K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM, 2018, pp. 149–150."},"publication":"Proceedings of the 2018 ACM Conference on Economics and Computation - EC '18","isi":1,"scopus_import":"1","ddc":["000"],"department":[{"_id":"KrCh"}],"title":"The Big Match with a clock and a bit of memory","date_updated":"2025-05-14T11:24:35Z","publication_identifier":{"isbn":["9781450358293"]},"article_processing_charge":"No","conference":{"name":"EC: Conference on Economics and Computation","end_date":"2018-06-22","location":"Ithaca, NY, United States","start_date":"2018-06-18"},"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1"}]