[{"quality_controlled":"1","intvolume":"        97","external_id":{"arxiv":["1802.02243"]},"oa":1,"language":[{"iso":"eng"}],"month":"06","publication":"Physical Review B","day":"04","date_created":"2019-05-03T09:29:49Z","status":"public","_id":"6369","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1","publisher":"American Physical Society (APS)","arxiv":1,"doi":"10.1103/physrevb.97.220301","author":[{"full_name":"Rosenthal, Eric I.","first_name":"Eric I.","last_name":"Rosenthal"},{"full_name":"Ehrlich, Nicole K.","first_name":"Nicole K.","last_name":"Ehrlich"},{"last_name":"Rudner","first_name":"Mark S.","full_name":"Rudner, Mark S."},{"orcid":"0000-0003-2607-2363","full_name":"Higginbotham, Andrew P","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","first_name":"Andrew P","last_name":"Higginbotham"},{"first_name":"K. W.","last_name":"Lehnert","full_name":"Lehnert, K. W."}],"publication_status":"published","oa_version":"Preprint","citation":{"chicago":"Rosenthal, Eric I., Nicole K. Ehrlich, Mark S. Rudner, Andrew P Higginbotham, and K. W. Lehnert. “Topological Phase Transition Measured in a Dissipative Metamaterial.” <i>Physical Review B</i>. American Physical Society (APS), 2018. <a href=\"https://doi.org/10.1103/physrevb.97.220301\">https://doi.org/10.1103/physrevb.97.220301</a>.","ista":"Rosenthal EI, Ehrlich NK, Rudner MS, Higginbotham AP, Lehnert KW. 2018. Topological phase transition measured in a dissipative metamaterial. Physical Review B. 97(22), 220301.","mla":"Rosenthal, Eric I., et al. “Topological Phase Transition Measured in a Dissipative Metamaterial.” <i>Physical Review B</i>, vol. 97, no. 22, 220301, American Physical Society (APS), 2018, doi:<a href=\"https://doi.org/10.1103/physrevb.97.220301\">10.1103/physrevb.97.220301</a>.","ieee":"E. I. Rosenthal, N. K. Ehrlich, M. S. Rudner, A. P. Higginbotham, and K. W. Lehnert, “Topological phase transition measured in a dissipative metamaterial,” <i>Physical Review B</i>, vol. 97, no. 22. American Physical Society (APS), 2018.","short":"E.I. Rosenthal, N.K. Ehrlich, M.S. Rudner, A.P. Higginbotham, K.W. Lehnert, Physical Review B 97 (2018).","apa":"Rosenthal, E. I., Ehrlich, N. K., Rudner, M. S., Higginbotham, A. P., &#38; Lehnert, K. W. (2018). Topological phase transition measured in a dissipative metamaterial. <i>Physical Review B</i>. American Physical Society (APS). <a href=\"https://doi.org/10.1103/physrevb.97.220301\">https://doi.org/10.1103/physrevb.97.220301</a>","ama":"Rosenthal EI, Ehrlich NK, Rudner MS, Higginbotham AP, Lehnert KW. Topological phase transition measured in a dissipative metamaterial. <i>Physical Review B</i>. 2018;97(22). doi:<a href=\"https://doi.org/10.1103/physrevb.97.220301\">10.1103/physrevb.97.220301</a>"},"publication_identifier":{"issn":["2469-9950","2469-9969"]},"type":"journal_article","volume":97,"year":"2018","article_number":"220301","title":"Topological phase transition measured in a dissipative metamaterial","abstract":[{"text":"We construct a metamaterial from radio-frequency harmonic oscillators, and find two topologically distinct phases resulting from dissipation engineered into the system. These phases are distinguished by a quantized value of bulk energy transport. The impulse response of our circuit is measured and used to reconstruct the band structure and winding number of circuit eigenfunctions around a dark mode. Our results demonstrate that dissipative topological transport can occur in a wider class of physical systems than considered before.","lang":"eng"}],"issue":"22","date_published":"2018-06-04T00:00:00Z","main_file_link":[{"url":"https://arxiv.org/abs/1802.02243","open_access":"1"}],"date_updated":"2021-01-12T08:07:16Z"},{"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"64","department":[{"_id":"TaHa"}],"publication_status":"published","author":[{"full_name":"Kalinin, Nikita","last_name":"Kalinin","first_name":"Nikita"},{"full_name":"Guzmán Sáenz, Aldo","first_name":"Aldo","last_name":"Guzmán Sáenz"},{"full_name":"Prieto, Y","last_name":"Prieto","first_name":"Y"},{"last_name":"Shkolnikov","first_name":"Mikhail","id":"35084A62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4310-178X","full_name":"Shkolnikov, Mikhail"},{"first_name":"V","last_name":"Kalinina","full_name":"Kalinina, V"},{"full_name":"Lupercio, Ernesto","first_name":"Ernesto","last_name":"Lupercio"}],"doi":"10.1073/pnas.1805847115","ec_funded":1,"arxiv":1,"publisher":"National Academy of Sciences","scopus_import":"1","year":"2018","volume":115,"type":"journal_article","publication_identifier":{"issn":["00278424"]},"citation":{"ama":"Kalinin N, Guzmán Sáenz A, Prieto Y, Shkolnikov M, Kalinina V, Lupercio E. Self-organized criticality and pattern emergence through the lens of tropical geometry. <i>PNAS: Proceedings of the National Academy of Sciences of the United States of America</i>. 2018;115(35):E8135-E8142. doi:<a href=\"https://doi.org/10.1073/pnas.1805847115\">10.1073/pnas.1805847115</a>","apa":"Kalinin, N., Guzmán Sáenz, A., Prieto, Y., Shkolnikov, M., Kalinina, V., &#38; Lupercio, E. (2018). Self-organized criticality and pattern emergence through the lens of tropical geometry. <i>PNAS: Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1805847115\">https://doi.org/10.1073/pnas.1805847115</a>","ieee":"N. Kalinin, A. Guzmán Sáenz, Y. Prieto, M. Shkolnikov, V. Kalinina, and E. Lupercio, “Self-organized criticality and pattern emergence through the lens of tropical geometry,” <i>PNAS: Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 115, no. 35. National Academy of Sciences, pp. E8135–E8142, 2018.","mla":"Kalinin, Nikita, et al. “Self-Organized Criticality and Pattern Emergence through the Lens of Tropical Geometry.” <i>PNAS: Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 115, no. 35, National Academy of Sciences, 2018, pp. E8135–42, doi:<a href=\"https://doi.org/10.1073/pnas.1805847115\">10.1073/pnas.1805847115</a>.","short":"N. Kalinin, A. Guzmán Sáenz, Y. Prieto, M. Shkolnikov, V. Kalinina, E. Lupercio, PNAS: Proceedings of the National Academy of Sciences of the United States of America 115 (2018) E8135–E8142.","ista":"Kalinin N, Guzmán Sáenz A, Prieto Y, Shkolnikov M, Kalinina V, Lupercio E. 2018. Self-organized criticality and pattern emergence through the lens of tropical geometry. PNAS: Proceedings of the National Academy of Sciences of the United States of America. 115(35), E8135–E8142.","chicago":"Kalinin, Nikita, Aldo Guzmán Sáenz, Y Prieto, Mikhail Shkolnikov, V Kalinina, and Ernesto Lupercio. “Self-Organized Criticality and Pattern Emergence through the Lens of Tropical Geometry.” <i>PNAS: Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1805847115\">https://doi.org/10.1073/pnas.1805847115</a>."},"oa_version":"Preprint","date_updated":"2023-09-18T08:41:16Z","date_published":"2018-08-28T00:00:00Z","main_file_link":[{"url":"https://arxiv.org/abs/1806.09153","open_access":"1"}],"issue":"35","abstract":[{"text":"Tropical geometry, an established field in pure mathematics, is a place where string theory, mirror symmetry, computational algebra, auction theory, and so forth meet and influence one another. In this paper, we report on our discovery of a tropical model with self-organized criticality (SOC) behavior. Our model is continuous, in contrast to all known models of SOC, and is a certain scaling limit of the sandpile model, the first and archetypical model of SOC. We describe how our model is related to pattern formation and proportional growth phenomena and discuss the dichotomy between continuous and discrete models in several contexts. Our aim in this context is to present an idealized tropical toy model (cf. Turing reaction-diffusion model), requiring further investigation.","lang":"eng"}],"title":"Self-organized criticality and pattern emergence through the lens of tropical geometry","intvolume":"       115","quality_controlled":"1","article_processing_charge":"No","oa":1,"publist_id":"7990","external_id":{"isi":["000442861600009"],"arxiv":["1806.09153"]},"isi":1,"month":"08","article_type":"original","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T11:44:26Z","day":"28","publication":"PNAS: Proceedings of the National Academy of Sciences of the United States of America","page":"E8135 - E8142"},{"oa":1,"author":[{"full_name":"Petritsch, Barbara","orcid":"0000-0003-2724-4614","id":"406048EC-F248-11E8-B48F-1D18A9856A87","first_name":"Barbara","last_name":"Petritsch"}],"publication_status":"published","department":[{"_id":"E-Lib"}],"publisher":"IST Austria","file":[{"content_type":"application/pdf","creator":"dernst","file_name":"Poster_Beitrag_125_Petritsch.pdf","date_created":"2019-05-16T07:26:25Z","access_level":"open_access","file_size":1967778,"checksum":"9063ab4d10ea93353c3a03bbf53fbcf1","date_updated":"2020-07-14T12:47:30Z","file_id":"6460","relation":"main_file"}],"has_accepted_license":"1","doi":"10.5281/zenodo.1410279","_id":"6459","file_date_updated":"2020-07-14T12:47:30Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["020"],"date_created":"2019-05-16T07:27:14Z","date_published":"2018-09-24T00:00:00Z","status":"public","date_updated":"2020-07-14T23:06:21Z","license":"https://creativecommons.org/licenses/by/4.0/","conference":{"location":"Graz, Austria","start_date":"2018-09-24","name":"Open-Access-Tage","end_date":"2018-09-26"},"title":"Open Access at IST Austria 2009-2017","day":"24","month":"09","type":"conference_poster","year":"2018","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"ieee":"B. Petritsch, <i>Open Access at IST Austria 2009-2017</i>. IST Austria, 2018.","mla":"Petritsch, Barbara. <i>Open Access at IST Austria 2009-2017</i>. IST Austria, 2018, doi:<a href=\"https://doi.org/10.5281/zenodo.1410279\">10.5281/zenodo.1410279</a>.","short":"B. Petritsch, Open Access at IST Austria 2009-2017, IST Austria, 2018.","ama":"Petritsch B. <i>Open Access at IST Austria 2009-2017</i>. IST Austria; 2018. doi:<a href=\"https://doi.org/10.5281/zenodo.1410279\">10.5281/zenodo.1410279</a>","apa":"Petritsch, B. (2018). <i>Open Access at IST Austria 2009-2017</i>. Presented at the Open-Access-Tage, Graz, Austria: IST Austria. <a href=\"https://doi.org/10.5281/zenodo.1410279\">https://doi.org/10.5281/zenodo.1410279</a>","chicago":"Petritsch, Barbara. <i>Open Access at IST Austria 2009-2017</i>. IST Austria, 2018. <a href=\"https://doi.org/10.5281/zenodo.1410279\">https://doi.org/10.5281/zenodo.1410279</a>.","ista":"Petritsch B. 2018. Open Access at IST Austria 2009-2017, IST Austria,p."},"keyword":["Open Access","Publication Analysis"],"language":[{"iso":"eng"}]},{"oa":1,"has_accepted_license":"1","file":[{"relation":"main_file","file_id":"6498","checksum":"86ae5331f9bfced9a6358a790a04bef4","date_updated":"2020-07-14T12:47:32Z","file_size":3841660,"access_level":"open_access","file_name":"2018_rupress_Moalli.pdf","date_created":"2019-05-28T12:40:05Z","creator":"kschuh","content_type":"application/pdf"}],"external_id":{"isi":["000440822900011"]},"isi":1,"intvolume":"      2015","file_date_updated":"2020-07-14T12:47:32Z","article_processing_charge":"No","quality_controlled":"1","status":"public","date_created":"2019-05-28T12:36:47Z","day":"06","publication":"The Journal of Experimental Medicine","page":"1869–1890","month":"06","language":[{"iso":"eng"}],"tmp":{"short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"department":[{"_id":"MiSi"}],"author":[{"last_name":"Moalli","first_name":"Federica","full_name":"Moalli, Federica"},{"full_name":"Ficht, Xenia","first_name":"Xenia","last_name":"Ficht"},{"last_name":"Germann","first_name":"Philipp","full_name":"Germann, Philipp"},{"full_name":"Vladymyrov, Mykhailo","first_name":"Mykhailo","last_name":"Vladymyrov"},{"full_name":"Stolp, Bettina","first_name":"Bettina","last_name":"Stolp"},{"full_name":"de Vries, Ingrid","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","first_name":"Ingrid","last_name":"de Vries"},{"full_name":"Lyck, Ruth","first_name":"Ruth","last_name":"Lyck"},{"first_name":"Jasmin","last_name":"Balmer","full_name":"Balmer, Jasmin"},{"full_name":"Fiocchi, Amleto","first_name":"Amleto","last_name":"Fiocchi"},{"full_name":"Kreutzfeldt, Mario","first_name":"Mario","last_name":"Kreutzfeldt"},{"full_name":"Merkler, Doron","first_name":"Doron","last_name":"Merkler"},{"last_name":"Iannacone","first_name":"Matteo","full_name":"Iannacone, Matteo"},{"full_name":"Ariga, Akitaka","last_name":"Ariga","first_name":"Akitaka"},{"full_name":"Stoffel, Michael H.","last_name":"Stoffel","first_name":"Michael H."},{"last_name":"Sharpe","first_name":"James","full_name":"Sharpe, James"},{"full_name":"Bähler, Martin","last_name":"Bähler","first_name":"Martin"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K"},{"full_name":"Diz-Muñoz, Alba","first_name":"Alba","last_name":"Diz-Muñoz"},{"last_name":"Stein","first_name":"Jens V.","full_name":"Stein, Jens V."}],"publication_status":"published","doi":"10.1084/jem.20170896","publisher":"Rockefeller University Press","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6497","date_updated":"2023-09-19T14:52:08Z","date_published":"2018-06-06T00:00:00Z","ddc":["570"],"issue":"7","abstract":[{"text":"T cells are actively scanning pMHC-presenting cells in lymphoid organs and nonlymphoid tissues (NLTs) with divergent topologies and confinement. How the T cell actomyosin cytoskeleton facilitates this task in distinct environments is incompletely understood. Here, we show that lack of Myosin IXb (Myo9b), a negative regulator of the small GTPase Rho, led to increased Rho-GTP levels and cell surface stiffness in primary T cells. Nonetheless, intravital imaging revealed robust motility of Myo9b−/− CD8+ T cells in lymphoid tissue and similar expansion and differentiation during immune responses. In contrast, accumulation of Myo9b−/− CD8+ T cells in NLTs was strongly impaired. Specifically, Myo9b was required for T cell crossing of basement membranes, such as those which are present between dermis and epidermis. As consequence, Myo9b−/− CD8+ T cells showed impaired control of skin infections. In sum, we show that Myo9b is critical for the CD8+ T cell adaptation from lymphoid to NLT surveillance and the establishment of protective tissue–resident T cell populations.","lang":"eng"}],"title":"The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","scopus_import":"1","volume":2015,"year":"2018","type":"journal_article","publication_identifier":{"issn":["0022-1007"],"eissn":["1540-9538"]},"oa_version":"Published Version","citation":{"chicago":"Moalli, Federica, Xenia Ficht, Philipp Germann, Mykhailo Vladymyrov, Bettina Stolp, Ingrid de Vries, Ruth Lyck, et al. “The Rho Regulator Myosin IXb Enables Nonlymphoid Tissue Seeding of Protective CD8+T Cells.” <i>The Journal of Experimental Medicine</i>. Rockefeller University Press, 2018. <a href=\"https://doi.org/10.1084/jem.20170896\">https://doi.org/10.1084/jem.20170896</a>.","ista":"Moalli F, Ficht X, Germann P, Vladymyrov M, Stolp B, de Vries I, Lyck R, Balmer J, Fiocchi A, Kreutzfeldt M, Merkler D, Iannacone M, Ariga A, Stoffel MH, Sharpe J, Bähler M, Sixt MK, Diz-Muñoz A, Stein JV. 2018. The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells. The Journal of Experimental Medicine. 2015(7), 1869–1890.","mla":"Moalli, Federica, et al. “The Rho Regulator Myosin IXb Enables Nonlymphoid Tissue Seeding of Protective CD8+T Cells.” <i>The Journal of Experimental Medicine</i>, vol. 2015, no. 7, Rockefeller University Press, 2018, pp. 1869–1890, doi:<a href=\"https://doi.org/10.1084/jem.20170896\">10.1084/jem.20170896</a>.","ieee":"F. Moalli <i>et al.</i>, “The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells,” <i>The Journal of Experimental Medicine</i>, vol. 2015, no. 7. Rockefeller University Press, pp. 1869–1890, 2018.","short":"F. Moalli, X. Ficht, P. Germann, M. Vladymyrov, B. Stolp, I. de Vries, R. Lyck, J. Balmer, A. Fiocchi, M. Kreutzfeldt, D. Merkler, M. Iannacone, A. Ariga, M.H. Stoffel, J. Sharpe, M. Bähler, M.K. Sixt, A. Diz-Muñoz, J.V. Stein, The Journal of Experimental Medicine 2015 (2018) 1869–1890.","ama":"Moalli F, Ficht X, Germann P, et al. The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells. <i>The Journal of Experimental Medicine</i>. 2018;2015(7):1869–1890. doi:<a href=\"https://doi.org/10.1084/jem.20170896\">10.1084/jem.20170896</a>","apa":"Moalli, F., Ficht, X., Germann, P., Vladymyrov, M., Stolp, B., de Vries, I., … Stein, J. V. (2018). The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells. <i>The Journal of Experimental Medicine</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1084/jem.20170896\">https://doi.org/10.1084/jem.20170896</a>"}},{"_id":"6499","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Truckenbrodt, Sven M","id":"45812BD4-F248-11E8-B48F-1D18A9856A87","first_name":"Sven M","last_name":"Truckenbrodt"},{"first_name":"Manuel","last_name":"Maidorn","full_name":"Maidorn, Manuel"},{"full_name":"Crzan, Dagmar","first_name":"Dagmar","last_name":"Crzan"},{"last_name":"Wildhagen","first_name":"Hanna","full_name":"Wildhagen, Hanna"},{"full_name":"Kabatas, Selda","last_name":"Kabatas","first_name":"Selda"},{"full_name":"Rizzoli, Silvio O","last_name":"Rizzoli","first_name":"Silvio O"}],"publication_status":"published","department":[{"_id":"JoDa"}],"publisher":"EMBO","doi":"10.15252/embr.201845836","publication_identifier":{"eissn":["1469-3178"],"issn":["1469-221X"]},"type":"journal_article","year":"2018","volume":19,"scopus_import":"1","oa_version":"Published Version","citation":{"ista":"Truckenbrodt SM, Maidorn M, Crzan D, Wildhagen H, Kabatas S, Rizzoli SO. 2018. X10 expansion microscopy enables 25‐nm resolution on conventional microscopes. EMBO reports. 19(9), e45836.","chicago":"Truckenbrodt, Sven M, Manuel Maidorn, Dagmar Crzan, Hanna Wildhagen, Selda Kabatas, and Silvio O Rizzoli. “X10 Expansion Microscopy Enables 25‐nm Resolution on Conventional Microscopes.” <i>EMBO Reports</i>. EMBO, 2018. <a href=\"https://doi.org/10.15252/embr.201845836\">https://doi.org/10.15252/embr.201845836</a>.","ama":"Truckenbrodt SM, Maidorn M, Crzan D, Wildhagen H, Kabatas S, Rizzoli SO. X10 expansion microscopy enables 25‐nm resolution on conventional microscopes. <i>EMBO reports</i>. 2018;19(9). doi:<a href=\"https://doi.org/10.15252/embr.201845836\">10.15252/embr.201845836</a>","apa":"Truckenbrodt, S. M., Maidorn, M., Crzan, D., Wildhagen, H., Kabatas, S., &#38; Rizzoli, S. O. (2018). X10 expansion microscopy enables 25‐nm resolution on conventional microscopes. <i>EMBO Reports</i>. EMBO. <a href=\"https://doi.org/10.15252/embr.201845836\">https://doi.org/10.15252/embr.201845836</a>","short":"S.M. Truckenbrodt, M. Maidorn, D. Crzan, H. Wildhagen, S. Kabatas, S.O. Rizzoli, EMBO Reports 19 (2018).","ieee":"S. M. Truckenbrodt, M. Maidorn, D. Crzan, H. Wildhagen, S. Kabatas, and S. O. Rizzoli, “X10 expansion microscopy enables 25‐nm resolution on conventional microscopes,” <i>EMBO reports</i>, vol. 19, no. 9. EMBO, 2018.","mla":"Truckenbrodt, Sven M., et al. “X10 Expansion Microscopy Enables 25‐nm Resolution on Conventional Microscopes.” <i>EMBO Reports</i>, vol. 19, no. 9, e45836, EMBO, 2018, doi:<a href=\"https://doi.org/10.15252/embr.201845836\">10.15252/embr.201845836</a>."},"issue":"9","ddc":["580"],"date_published":"2018-09-01T00:00:00Z","date_updated":"2023-09-19T14:52:32Z","title":"X10 expansion microscopy enables 25‐nm resolution on conventional microscopes","article_number":"e45836","abstract":[{"lang":"eng","text":"Expansion microscopy is a recently introduced imaging technique that achieves super‐resolution through physically expanding the specimen by ~4×, after embedding into a swellable gel. The resolution attained is, correspondingly, approximately fourfold better than the diffraction limit, or ~70 nm. This is a major improvement over conventional microscopy, but still lags behind modern STED or STORM setups, whose resolution can reach 20–30 nm. We addressed this issue here by introducing an improved gel recipe that enables an expansion factor of ~10× in each dimension, which corresponds to an expansion of the sample volume by more than 1,000‐fold. Our protocol, which we termed X10 microscopy, achieves a resolution of 25–30 nm on conventional epifluorescence microscopes. X10 provides multi‐color images similar or even superior to those produced with more challenging methods, such as STED, STORM, and iterative expansion microscopy (iExM). X10 is therefore the cheapest and easiest option for high‐quality super‐resolution imaging currently available. X10 should be usable in any laboratory, irrespective of the machinery owned or of the technical knowledge."}],"quality_controlled":"1","article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:32Z","intvolume":"        19","oa":1,"isi":1,"file":[{"relation":"main_file","checksum":"6ec90abc637f09cca3a7b6424d7e7a26","date_updated":"2020-07-14T12:47:32Z","file_id":"6500","access_level":"open_access","file_name":"2018_embo_Truckenbrodt.pdf","date_created":"2019-05-28T13:17:19Z","file_size":2005572,"content_type":"application/pdf","creator":"kschuh"}],"external_id":{"isi":["000443682200009"]},"has_accepted_license":"1","month":"09","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"date_created":"2019-05-28T13:16:08Z","status":"public","publication":"EMBO reports","day":"01"},{"doi":"10.1093/oso/9780198802013.003.0009","publisher":"Oxford University Press","department":[{"_id":"TaHa"}],"author":[{"full_name":"Hausel, Tamás","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamás","last_name":"Hausel"},{"last_name":"Mellit","first_name":"Anton","id":"388D3134-F248-11E8-B48F-1D18A9856A87","full_name":"Mellit, Anton"},{"full_name":"Pei, Du","first_name":"Du","last_name":"Pei"}],"publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","_id":"6525","day":"01","abstract":[{"lang":"eng","text":"This chapter finds an agreement of equivariant indices of semi-classical homomorphisms between pairwise mirror branes in the GL2 Higgs moduli space on a Riemann surface. On one side of the agreement, components of the Lagrangian brane of U(1,1) Higgs bundles, whose mirror was proposed by Hitchin to be certain even exterior powers of the hyperholomorphic Dirac bundle on the SL2 Higgs moduli space, are present. The agreement arises from a mysterious functional equation. This gives strong computational evidence for Hitchin’s proposal."}],"publication":"Geometry and Physics: Volume I","title":"Mirror symmetry with branes by equivariant verlinde formulas","page":"189-218","status":"public","date_updated":"2021-01-12T08:07:52Z","date_published":"2018-01-01T00:00:00Z","date_created":"2019-06-06T12:42:01Z","language":[{"iso":"eng"}],"citation":{"chicago":"Hausel, Tamás, Anton Mellit, and Du Pei. “Mirror Symmetry with Branes by Equivariant Verlinde Formulas.” In <i>Geometry and Physics: Volume I</i>, 189–218. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/oso/9780198802013.003.0009\">https://doi.org/10.1093/oso/9780198802013.003.0009</a>.","ista":"Hausel T, Mellit A, Pei D. 2018.Mirror symmetry with branes by equivariant verlinde formulas. In: Geometry and Physics: Volume I. , 189–218.","ieee":"T. Hausel, A. Mellit, and D. Pei, “Mirror symmetry with branes by equivariant verlinde formulas,” in <i>Geometry and Physics: Volume I</i>, Oxford University Press, 2018, pp. 189–218.","mla":"Hausel, Tamás, et al. “Mirror Symmetry with Branes by Equivariant Verlinde Formulas.” <i>Geometry and Physics: Volume I</i>, Oxford University Press, 2018, pp. 189–218, doi:<a href=\"https://doi.org/10.1093/oso/9780198802013.003.0009\">10.1093/oso/9780198802013.003.0009</a>.","short":"T. Hausel, A. Mellit, D. Pei, in:, Geometry and Physics: Volume I, Oxford University Press, 2018, pp. 189–218.","ama":"Hausel T, Mellit A, Pei D. Mirror symmetry with branes by equivariant verlinde formulas. In: <i>Geometry and Physics: Volume I</i>. Oxford University Press; 2018:189-218. doi:<a href=\"https://doi.org/10.1093/oso/9780198802013.003.0009\">10.1093/oso/9780198802013.003.0009</a>","apa":"Hausel, T., Mellit, A., &#38; Pei, D. (2018). Mirror symmetry with branes by equivariant verlinde formulas. In <i>Geometry and Physics: Volume I</i> (pp. 189–218). Oxford University Press. <a href=\"https://doi.org/10.1093/oso/9780198802013.003.0009\">https://doi.org/10.1093/oso/9780198802013.003.0009</a>"},"oa_version":"None","scopus_import":1,"year":"2018","type":"book_chapter","month":"01","publication_identifier":{"isbn":["9780198802013","9780191840500"]}},{"date_created":"2019-06-13T08:22:37Z","status":"public","page":"4613-4623","conference":{"name":"NeurIPS: Conference on Neural Information Processing Systems","end_date":"2018-12-08","start_date":"2018-12-02","location":"Montreal, Canada"},"publication":"Advances in Neural Information Processing Systems","day":"01","month":"12","language":[{"iso":"eng"}],"oa":1,"isi":1,"external_id":{"isi":["000461823304061"],"arxiv":["1803.08917"]},"quality_controlled":"1","article_processing_charge":"No","intvolume":"      2018","date_published":"2018-12-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.08917"}],"date_updated":"2023-09-19T15:12:45Z","title":"Byzantine stochastic gradient descent","abstract":[{"text":"This paper studies the problem of distributed stochastic optimization in an adversarial setting where, out of m machines which allegedly compute stochastic gradients every iteration, an α-fraction are Byzantine, and may behave adversarially. Our main result is a variant of stochastic gradient descent (SGD) which finds ε-approximate minimizers of convex functions in T=O~(1/ε²m+α²/ε²) iterations. In contrast, traditional mini-batch SGD needs T=O(1/ε²m) iterations, but cannot tolerate Byzantine failures. Further, we provide a lower bound showing that, up to logarithmic factors, our algorithm is information-theoretically optimal both in terms of sample complexity and time complexity.","lang":"eng"}],"type":"conference","volume":2018,"year":"2018","scopus_import":"1","oa_version":"Published Version","citation":{"ista":"Alistarh D-A, Allen-Zhu Z, Li J. 2018. Byzantine stochastic gradient descent. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 2018, 4613–4623.","chicago":"Alistarh, Dan-Adrian, Zeyuan Allen-Zhu, and Jerry Li. “Byzantine Stochastic Gradient Descent.” In <i>Advances in Neural Information Processing Systems</i>, 2018:4613–23. Neural Information Processing Systems Foundation, 2018.","ama":"Alistarh D-A, Allen-Zhu Z, Li J. Byzantine stochastic gradient descent. In: <i>Advances in Neural Information Processing Systems</i>. Vol 2018. Neural Information Processing Systems Foundation; 2018:4613-4623.","apa":"Alistarh, D.-A., Allen-Zhu, Z., &#38; Li, J. (2018). Byzantine stochastic gradient descent. In <i>Advances in Neural Information Processing Systems</i> (Vol. 2018, pp. 4613–4623). Montreal, Canada: Neural Information Processing Systems Foundation.","short":"D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 4613–4623.","mla":"Alistarh, Dan-Adrian, et al. “Byzantine Stochastic Gradient Descent.” <i>Advances in Neural Information Processing Systems</i>, vol. 2018, Neural Information Processing Systems Foundation, 2018, pp. 4613–23.","ieee":"D.-A. Alistarh, Z. Allen-Zhu, and J. Li, “Byzantine stochastic gradient descent,” in <i>Advances in Neural Information Processing Systems</i>, Montreal, Canada, 2018, vol. 2018, pp. 4613–4623."},"author":[{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh"},{"last_name":"Allen-Zhu","first_name":"Zeyuan","full_name":"Allen-Zhu, Zeyuan"},{"first_name":"Jerry","last_name":"Li","full_name":"Li, Jerry"}],"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Neural Information Processing Systems Foundation","arxiv":1,"_id":"6558","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"article_processing_charge":"No","quality_controlled":"1","external_id":{"isi":["000461852000047"],"arxiv":["1809.10505"]},"isi":1,"oa":1,"language":[{"iso":"eng"}],"month":"12","conference":{"end_date":"2018-12-08","name":"NeurIPS: Conference on Neural Information Processing Systems","start_date":"2018-12-02","location":"Montreal, Canada"},"publication":"Advances in Neural Information Processing Systems 31","page":"5973-5983","day":"01","date_created":"2019-06-27T09:32:55Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6589","project":[{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"arxiv":1,"ec_funded":1,"publisher":"Neural Information Processing Systems Foundation","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hoefler, Torsten","last_name":"Hoefler","first_name":"Torsten"},{"full_name":"Johansson, Mikael","first_name":"Mikael","last_name":"Johansson"},{"first_name":"Nikola H","last_name":"Konstantinov","full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sarit","last_name":"Khirirat","full_name":"Khirirat, Sarit"},{"first_name":"Cedric","last_name":"Renggli","full_name":"Renggli, Cedric"}],"publication_status":"published","department":[{"_id":"DaAl"},{"_id":"ChLa"}],"citation":{"chicago":"Alistarh, Dan-Adrian, Torsten Hoefler, Mikael Johansson, Nikola H Konstantinov, Sarit Khirirat, and Cedric Renggli. “The Convergence of Sparsified Gradient Methods.” In <i>Advances in Neural Information Processing Systems 31</i>, Volume 2018:5973–83. Neural Information Processing Systems Foundation, 2018.","ista":"Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. 2018. The convergence of sparsified gradient methods. Advances in Neural Information Processing Systems 31. NeurIPS: Conference on Neural Information Processing Systems vol. Volume 2018, 5973–5983.","short":"D.-A. Alistarh, T. Hoefler, M. Johansson, N.H. Konstantinov, S. Khirirat, C. Renggli, in:, Advances in Neural Information Processing Systems 31, Neural Information Processing Systems Foundation, 2018, pp. 5973–5983.","ieee":"D.-A. Alistarh, T. Hoefler, M. Johansson, N. H. Konstantinov, S. Khirirat, and C. Renggli, “The convergence of sparsified gradient methods,” in <i>Advances in Neural Information Processing Systems 31</i>, Montreal, Canada, 2018, vol. Volume 2018, pp. 5973–5983.","mla":"Alistarh, Dan-Adrian, et al. “The Convergence of Sparsified Gradient Methods.” <i>Advances in Neural Information Processing Systems 31</i>, vol. Volume 2018, Neural Information Processing Systems Foundation, 2018, pp. 5973–83.","apa":"Alistarh, D.-A., Hoefler, T., Johansson, M., Konstantinov, N. H., Khirirat, S., &#38; Renggli, C. (2018). The convergence of sparsified gradient methods. In <i>Advances in Neural Information Processing Systems 31</i> (Vol. Volume 2018, pp. 5973–5983). Montreal, Canada: Neural Information Processing Systems Foundation.","ama":"Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. The convergence of sparsified gradient methods. In: <i>Advances in Neural Information Processing Systems 31</i>. Vol Volume 2018. Neural Information Processing Systems Foundation; 2018:5973-5983."},"oa_version":"Preprint","type":"conference","scopus_import":"1","volume":"Volume 2018","year":"2018","title":"The convergence of sparsified gradient methods","abstract":[{"text":"Distributed training of massive machine learning models, in particular deep neural networks, via Stochastic Gradient Descent (SGD) is becoming commonplace. Several families of communication-reduction methods, such as quantization, large-batch methods, and gradient sparsification, have been proposed. To date, gradient sparsification methods--where each node sorts gradients by magnitude, and only communicates a subset of the components, accumulating the rest locally--are known to yield some of the largest practical gains. Such methods can reduce the amount of communication per step by up to \\emph{three orders of magnitude}, while preserving model accuracy. Yet, this family of methods currently has no theoretical justification. This is the question we address in this paper. We prove that, under analytic assumptions, sparsifying gradients by magnitude with local error correction provides convergence guarantees, for both convex and non-convex smooth objectives, for data-parallel SGD. The main insight is that sparsification methods implicitly maintain bounds on the maximum impact of stale updates, thanks to selection by magnitude. Our analysis and empirical validation also reveal that these methods do require analytical conditions to converge well, justifying existing heuristics.","lang":"eng"}],"date_published":"2018-12-01T00:00:00Z","main_file_link":[{"url":"https://arxiv.org/abs/1809.10505","open_access":"1"}],"date_updated":"2023-10-17T11:47:20Z"},{"day":"01","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8934"}]},"conference":{"location":"Beijing, China","start_date":"2018-09-04","name":"CONCUR: Conference on Concurrency Theory","end_date":"2018-09-07"},"status":"public","date_created":"2018-12-11T11:44:27Z","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"month":"09","has_accepted_license":"1","publist_id":"7988","external_id":{"arxiv":["1806.03108"]},"file":[{"relation":"main_file","content_type":"application/pdf","creator":"dernst","date_updated":"2020-07-14T12:47:34Z","checksum":"68a055b1aaa241cc38375083cf832a7d","file_id":"5696","access_level":"open_access","file_name":"2018_CONCUR_Chatterjee.pdf","date_created":"2018-12-17T12:08:00Z","file_size":1078309}],"oa":1,"intvolume":"       118","file_date_updated":"2020-07-14T12:47:34Z","article_processing_charge":"No","quality_controlled":"1","abstract":[{"text":"Crypto-currencies are digital assets designed to work as a medium of exchange, e.g., Bitcoin, but they are susceptible to attacks (dishonest behavior of participants). A framework for the analysis of attacks in crypto-currencies requires (a) modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior; (b) concurrent interactions between participants; and (c) analysis of long-term monetary gains. Traditional game-theoretic approaches for the analysis of security protocols consider either qualitative temporal properties such as safety and termination, or the very special class of one-shot (stateless) games. However, to analyze general attacks on protocols for crypto-currencies, both stateful analysis and quantitative objectives are necessary. In this work our main contributions are as follows: (a) we show how a class of concurrent mean-payo games, namely ergodic games, can model various attacks that arise naturally in crypto-currencies; (b) we present the first practical implementation of algorithms for ergodic games that scales to model realistic problems for crypto-currencies; and (c) we present experimental results showing that our framework can handle games with thousands of states and millions of transitions.","lang":"eng"}],"article_number":"11","title":"Ergodic mean-payoff games for the analysis of attacks in crypto-currencies","date_updated":"2025-06-02T08:53:46Z","date_published":"2018-09-01T00:00:00Z","ddc":["000"],"oa_version":"Published Version","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies</i>. Vol. 118, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">10.4230/LIPIcs.CONCUR.2018.11</a>.","ieee":"K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.","short":"K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ama":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">10.4230/LIPIcs.CONCUR.2018.11</a>","apa":"Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., &#38; Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.11</a>","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.11</a>.","ista":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118, 11."},"scopus_import":"1","volume":118,"year":"2018","type":"conference","publication_identifier":{"isbn":["978-3-95977-087-3"]},"doi":"10.4230/LIPIcs.CONCUR.2018.11","arxiv":1,"ec_funded":1,"alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Amir","last_name":"Goharshady","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"full_name":"Velner, Yaron","last_name":"Velner","first_name":"Yaron"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"66","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}]},{"status":"public","date_updated":"2021-01-12T08:08:29Z","date_published":"2018-12-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.03912"}],"date_created":"2019-07-23T09:12:43Z","day":"01","abstract":[{"text":"Reed-Muller (RM) and polar codes are a class of capacity-achieving channel coding schemes with the same factor graph representation. Low-complexity decoding algorithms fall short in providing a good error-correction performance for RM and polar codes. Using the symmetric group of RM and polar codes, the specific decoding algorithm can be carried out on multiple permutations of the factor graph to boost the error-correction performance. However, this approach results in high decoding complexity. In this paper, we first derive the total number of factor graph permutations on which the decoding can be performed. We further propose a successive permutation (SP) scheme which finds the permutations on the fly, thus the decoding always progresses on a single factor graph permutation. We show that SP can be used to improve the error-correction performance of RM and polar codes under successive-cancellation (SC) and SC list (SCL) decoding, while keeping the memory requirements of the decoders unaltered. Our results for RM and polar codes of length 128 and rate 0.5 show that when SP is used and at a target frame error rate of 10 -4 , up to 0.5 dB and 0.1 dB improvement can be achieved for RM and polar codes respectively.","lang":"eng"}],"publication":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing","conference":{"location":"Hong Kong, China","start_date":"2018-12-03","name":"ISTC: Symposium on Turbo Codes & Iterative Information Processing","end_date":"2018-12-07"},"title":"Decoding Reed-Muller and polar codes by successive factor graph permutations","page":"1-5","year":"2018","type":"conference","month":"12","language":[{"iso":"eng"}],"oa_version":"Preprint","citation":{"ama":"Hashemi SA, Doan N, Mondelli M, Gross W. Decoding Reed-Muller and polar codes by successive factor graph permutations. In: <i>2018 IEEE 10th International Symposium on Turbo Codes &#38; Iterative Information Processing</i>. IEEE; 2018:1-5. doi:<a href=\"https://doi.org/10.1109/istc.2018.8625281\">10.1109/istc.2018.8625281</a>","apa":"Hashemi, S. A., Doan, N., Mondelli, M., &#38; Gross, W. (2018). Decoding Reed-Muller and polar codes by successive factor graph permutations. In <i>2018 IEEE 10th International Symposium on Turbo Codes &#38; Iterative Information Processing</i> (pp. 1–5). Hong Kong, China: IEEE. <a href=\"https://doi.org/10.1109/istc.2018.8625281\">https://doi.org/10.1109/istc.2018.8625281</a>","mla":"Hashemi, Seyyed Ali, et al. “Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations.” <i>2018 IEEE 10th International Symposium on Turbo Codes &#38; Iterative Information Processing</i>, IEEE, 2018, pp. 1–5, doi:<a href=\"https://doi.org/10.1109/istc.2018.8625281\">10.1109/istc.2018.8625281</a>.","ieee":"S. A. Hashemi, N. Doan, M. Mondelli, and W. Gross, “Decoding Reed-Muller and polar codes by successive factor graph permutations,” in <i>2018 IEEE 10th International Symposium on Turbo Codes &#38; Iterative Information Processing</i>, Hong Kong, China, 2018, pp. 1–5.","short":"S.A. Hashemi, N. Doan, M. Mondelli, W. Gross, in:, 2018 IEEE 10th International Symposium on Turbo Codes &#38; Iterative Information Processing, IEEE, 2018, pp. 1–5.","ista":"Hashemi SA, Doan N, Mondelli M, Gross W. 2018. Decoding Reed-Muller and polar codes by successive factor graph permutations. 2018 IEEE 10th International Symposium on Turbo Codes &#38; Iterative Information Processing. ISTC: Symposium on Turbo Codes &#38; Iterative Information Processing, 1–5.","chicago":"Hashemi, Seyyed Ali, Nghia Doan, Marco Mondelli, and Warren  Gross. “Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations.” In <i>2018 IEEE 10th International Symposium on Turbo Codes &#38; Iterative Information Processing</i>, 1–5. IEEE, 2018. <a href=\"https://doi.org/10.1109/istc.2018.8625281\">https://doi.org/10.1109/istc.2018.8625281</a>."},"publication_status":"published","author":[{"full_name":"Hashemi, Seyyed Ali","last_name":"Hashemi","first_name":"Seyyed Ali"},{"first_name":"Nghia","last_name":"Doan","full_name":"Doan, Nghia"},{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli"},{"full_name":"Gross, Warren ","last_name":"Gross","first_name":"Warren "}],"oa":1,"doi":"10.1109/istc.2018.8625281","external_id":{"arxiv":["1807.03912"]},"arxiv":1,"publisher":"IEEE","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","_id":"6664"},{"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6665","quality_controlled":"1","publication_status":"published","author":[{"full_name":"Fazeli, Arman","first_name":"Arman","last_name":"Fazeli"},{"full_name":"Hassani, Hamed","first_name":"Hamed","last_name":"Hassani"},{"last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"first_name":"Alexander","last_name":"Vardy","full_name":"Vardy, Alexander"}],"oa":1,"doi":"10.1109/itw.2018.8613428","external_id":{"arxiv":["1711.01339"]},"arxiv":1,"publisher":"IEEE","year":"2018","type":"conference","month":"11","language":[{"iso":"eng"}],"citation":{"ama":"Fazeli A, Hassani H, Mondelli M, Vardy A. Binary linear codes with optimal scaling: Polar codes with large kernels. In: <i>2018 IEEE Information Theory Workshop</i>. IEEE; 2018:1-5. doi:<a href=\"https://doi.org/10.1109/itw.2018.8613428\">10.1109/itw.2018.8613428</a>","apa":"Fazeli, A., Hassani, H., Mondelli, M., &#38; Vardy, A. (2018). Binary linear codes with optimal scaling: Polar codes with large kernels. In <i>2018 IEEE Information Theory Workshop</i> (pp. 1–5). Guangzhou, China: IEEE. <a href=\"https://doi.org/10.1109/itw.2018.8613428\">https://doi.org/10.1109/itw.2018.8613428</a>","mla":"Fazeli, Arman, et al. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” <i>2018 IEEE Information Theory Workshop</i>, IEEE, 2018, pp. 1–5, doi:<a href=\"https://doi.org/10.1109/itw.2018.8613428\">10.1109/itw.2018.8613428</a>.","ieee":"A. Fazeli, H. Hassani, M. Mondelli, and A. Vardy, “Binary linear codes with optimal scaling: Polar codes with large kernels,” in <i>2018 IEEE Information Theory Workshop</i>, Guangzhou, China, 2018, pp. 1–5.","short":"A. Fazeli, H. Hassani, M. Mondelli, A. Vardy, in:, 2018 IEEE Information Theory Workshop, IEEE, 2018, pp. 1–5.","ista":"Fazeli A, Hassani H, Mondelli M, Vardy A. 2018. Binary linear codes with optimal scaling: Polar codes with large kernels. 2018 IEEE Information Theory Workshop. ITW: Information Theory Workshop, 1–5.","chicago":"Fazeli, Arman, Hamed Hassani, Marco Mondelli, and Alexander Vardy. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” In <i>2018 IEEE Information Theory Workshop</i>, 1–5. IEEE, 2018. <a href=\"https://doi.org/10.1109/itw.2018.8613428\">https://doi.org/10.1109/itw.2018.8613428</a>."},"oa_version":"Preprint","date_updated":"2024-03-07T12:18:50Z","status":"public","date_published":"2018-11-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.01339"}],"date_created":"2019-07-23T11:01:42Z","day":"01","abstract":[{"lang":"eng","text":"We prove that, at least for the binary erasure channel, the polar-coding paradigm gives rise to codes that not only approach the Shannon limit but, in fact, do so under the best possible scaling of their block length as a function of the gap to capacity. This result exhibits the first known family of binary codes that attain both optimal scaling and quasi-linear complexity of encoding and decoding. Specifically, for any fixed δ > 0, we exhibit binary linear codes that ensure reliable communication at rates within ε > 0 of capacity with block length n = O(1/ε 2+δ ), construction complexity Θ(n), and encoding/decoding complexity Θ(n log n)."}],"related_material":{"record":[{"status":"public","id":"9002","relation":"later_version"}]},"conference":{"location":"Guangzhou, China","start_date":"2018-11-25","end_date":"2018-11-29","name":"ITW: Information Theory Workshop"},"publication":"2018 IEEE Information Theory Workshop","title":"Binary linear codes with optimal scaling: Polar codes with large kernels","page":"1-5"},{"abstract":[{"text":"Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming 5G standard. As such, a lot of attention has been devoted to the development of decoding algorithms with good error performance and efficient hardware implementation. One of the leading candidates in this regard is represented by successive-cancellation list (SCL) decoding. However, its hardware implementation requires a large amount of memory. Recently, a partitioned SCL (PSCL) decoder has been proposed to significantly reduce the memory consumption. In this paper, we consider the paradigm of PSCL decoding from a practical standpoint, and we provide several improvements. First, by changing the target signal-to-noise ratio and consequently modifying the construction of the code, we are able to improve the performance at no additional computational, latency, or memory cost. Second, we bridge the performance gap between SCL and PSCL decoding by introducing a generalized PSCL decoder and a layered PSCL decoder. In this way, we obtain almost the same performance of the SCL decoder with a significantly lower memory requirement, as testified by hardware implementation results. Third, we present an optimal scheme to allocate cyclic redundancy checks. Finally, we provide a lower bound on the list size that guarantees optimal maximum a posteriori performance for the binary erasure channel.","lang":"eng"}],"day":"01","page":"3749-3759","publication":"IEEE Transactions on Communications","title":"Decoder partitioning: Towards practical list decoding of polar codes","status":"public","date_updated":"2021-01-12T08:08:31Z","date_created":"2019-07-24T08:59:41Z","issue":"9","date_published":"2018-09-01T00:00:00Z","language":[{"iso":"eng"}],"citation":{"ista":"Hashemi SA, Mondelli M, Hassani SH, Condo C, Urbanke RL, Gross WJ. 2018. Decoder partitioning: Towards practical list decoding of polar codes. IEEE Transactions on Communications. 66(9), 3749–3759.","chicago":"Hashemi, Seyyed Ali, Marco Mondelli, S. Hamed Hassani, Carlo Condo, Rudiger L. Urbanke, and Warren J. Gross. “Decoder Partitioning: Towards Practical List Decoding of Polar Codes.” <i>IEEE Transactions on Communications</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/tcomm.2018.2832207\">https://doi.org/10.1109/tcomm.2018.2832207</a>.","apa":"Hashemi, S. A., Mondelli, M., Hassani, S. H., Condo, C., Urbanke, R. L., &#38; Gross, W. J. (2018). Decoder partitioning: Towards practical list decoding of polar codes. <i>IEEE Transactions on Communications</i>. IEEE. <a href=\"https://doi.org/10.1109/tcomm.2018.2832207\">https://doi.org/10.1109/tcomm.2018.2832207</a>","ama":"Hashemi SA, Mondelli M, Hassani SH, Condo C, Urbanke RL, Gross WJ. Decoder partitioning: Towards practical list decoding of polar codes. <i>IEEE Transactions on Communications</i>. 2018;66(9):3749-3759. doi:<a href=\"https://doi.org/10.1109/tcomm.2018.2832207\">10.1109/tcomm.2018.2832207</a>","ieee":"S. A. Hashemi, M. Mondelli, S. H. Hassani, C. Condo, R. L. Urbanke, and W. J. Gross, “Decoder partitioning: Towards practical list decoding of polar codes,” <i>IEEE Transactions on Communications</i>, vol. 66, no. 9. IEEE, pp. 3749–3759, 2018.","mla":"Hashemi, Seyyed Ali, et al. “Decoder Partitioning: Towards Practical List Decoding of Polar Codes.” <i>IEEE Transactions on Communications</i>, vol. 66, no. 9, IEEE, 2018, pp. 3749–59, doi:<a href=\"https://doi.org/10.1109/tcomm.2018.2832207\">10.1109/tcomm.2018.2832207</a>.","short":"S.A. Hashemi, M. Mondelli, S.H. Hassani, C. Condo, R.L. Urbanke, W.J. Gross, IEEE Transactions on Communications 66 (2018) 3749–3759."},"oa_version":"None","volume":66,"year":"2018","publication_identifier":{"eissn":["1558-0857"]},"month":"09","type":"journal_article","doi":"10.1109/tcomm.2018.2832207","publisher":"IEEE","author":[{"full_name":"Hashemi, Seyyed Ali","last_name":"Hashemi","first_name":"Seyyed Ali"},{"last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020"},{"first_name":"S. Hamed","last_name":"Hassani","full_name":"Hassani, S. Hamed"},{"first_name":"Carlo","last_name":"Condo","full_name":"Condo, Carlo"},{"full_name":"Urbanke, Rudiger L.","last_name":"Urbanke","first_name":"Rudiger L."},{"last_name":"Gross","first_name":"Warren J.","full_name":"Gross, Warren J."}],"publication_status":"published","extern":"1","intvolume":"        66","_id":"6674","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"day":"16","abstract":[{"lang":"eng","text":"We present a coding paradigm that provides a new achievable rate for the primitive relay channel by combining compress-and-forward and decode-and-forward with a chaining construction. In the primitive relay channel model, the source broadcasts a message to the relay and to the destination; and the relay facilitates this communication by sending an additional message to the destination through a separate channel. Two well-known coding approaches for this setting are decode-and-forward and compress-and-forward: in the former, the relay decodes the message and sends some of the information to the destination; in the latter, the relay does not attempt to decode, but it sends a compressed description of the received sequence to the destination via Wyner-Ziv coding. In our scheme, we transmit over pairs of blocks and we use compress-and-forward for the first block and decode-and-forward for the second. In particular, in the first block, the relay does not attempt to decode and it sends only a part of the compressed description of the received sequence; in the second block, the relay decodes the message and sends this information plus the remaining part of the compressed sequence relative to the first block. As a result, we strictly outperform both compress-and- forward and decode-and-forward. Furthermore, this paradigm can be implemented with a low-complexity polar coding scheme that has the typical attractive features of polar codes, i.e., quasi-linear encoding/decoding complexity and super-polynomial decay of the error probability. Throughout the paper we consider as a running example the special case of the erasure relay channel and we compare the rates achievable by our proposed scheme with the existing upper and lower bounds."}],"title":"A new coding paradigm for the primitive relay channel","related_material":{"record":[{"status":"public","id":"7007","relation":"later_version"}]},"conference":{"start_date":"2018-06-17","location":"Vail, CO, United States","name":"ISIT: International Symposium on Information Theory ","end_date":"2018-06-22"},"publication":"2018 IEEE International Symposium on Information Theory","page":"351-355","status":"public","date_updated":"2023-02-23T12:56:49Z","date_published":"2018-06-16T00:00:00Z","main_file_link":[{"url":"https://arxiv.org/abs/1801.03153","open_access":"1"}],"date_created":"2019-07-24T09:10:38Z","language":[{"iso":"eng"}],"oa_version":"Preprint","citation":{"ama":"Mondelli M, Hassani H, Urbanke R. A new coding paradigm for the primitive relay channel. In: <i>2018 IEEE International Symposium on Information Theory</i>. IEEE; 2018:351-355. doi:<a href=\"https://doi.org/10.1109/isit.2018.8437479\">10.1109/isit.2018.8437479</a>","apa":"Mondelli, M., Hassani, H., &#38; Urbanke, R. (2018). A new coding paradigm for the primitive relay channel. In <i>2018 IEEE International Symposium on Information Theory</i> (pp. 351–355). Vail, CO, United States: IEEE. <a href=\"https://doi.org/10.1109/isit.2018.8437479\">https://doi.org/10.1109/isit.2018.8437479</a>","short":"M. Mondelli, H. Hassani, R. Urbanke, in:, 2018 IEEE International Symposium on Information Theory, IEEE, 2018, pp. 351–355.","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” in <i>2018 IEEE International Symposium on Information Theory</i>, Vail, CO, United States, 2018, pp. 351–355.","mla":"Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.” <i>2018 IEEE International Symposium on Information Theory</i>, IEEE, 2018, pp. 351–55, doi:<a href=\"https://doi.org/10.1109/isit.2018.8437479\">10.1109/isit.2018.8437479</a>.","ista":"Mondelli M, Hassani H, Urbanke R. 2018. A new coding paradigm for the primitive relay channel. 2018 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory , 351–355.","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.” In <i>2018 IEEE International Symposium on Information Theory</i>, 351–55. IEEE, 2018. <a href=\"https://doi.org/10.1109/isit.2018.8437479\">https://doi.org/10.1109/isit.2018.8437479</a>."},"year":"2018","type":"conference","publication_identifier":{"eissn":["2157-8117"]},"month":"06","doi":"10.1109/isit.2018.8437479","arxiv":1,"external_id":{"arxiv":["1801.03153"]},"publisher":"IEEE","oa":1,"publication_status":"published","author":[{"first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"full_name":"Hassani, Hamed","last_name":"Hassani","first_name":"Hamed"},{"full_name":"Urbanke, Rudiger","first_name":"Rudiger","last_name":"Urbanke"}],"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6675","quality_controlled":"1"},{"intvolume":"        64","quality_controlled":"1","oa":1,"external_id":{"arxiv":["1406.7373"]},"month":"05","article_type":"original","language":[{"iso":"eng"}],"status":"public","date_created":"2019-07-24T12:38:49Z","day":"01","publication":"IEEE Transactions on Information Theory","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"6740"}]},"page":"3371-3393","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6678","publication_status":"published","author":[{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli"},{"full_name":"Hassani, Hamed","last_name":"Hassani","first_name":"Hamed"},{"full_name":"Urbanke, Rudiger ","first_name":"Rudiger ","last_name":"Urbanke"}],"doi":"10.1109/tit.2018.2789885","arxiv":1,"publisher":"IEEE","year":"2018","volume":64,"type":"journal_article","publication_identifier":{"issn":["0018-9448","1557-9654"]},"oa_version":"Preprint","citation":{"apa":"Mondelli, M., Hassani, H., &#38; Urbanke, R. (2018). How to achieve the capacity of asymmetric channels. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/tit.2018.2789885\">https://doi.org/10.1109/tit.2018.2789885</a>","ama":"Mondelli M, Hassani H, Urbanke R. How to achieve the capacity of asymmetric channels. <i>IEEE Transactions on Information Theory</i>. 2018;64(5):3371-3393. doi:<a href=\"https://doi.org/10.1109/tit.2018.2789885\">10.1109/tit.2018.2789885</a>","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “How to achieve the capacity of asymmetric channels,” <i>IEEE Transactions on Information Theory</i>, vol. 64, no. 5. IEEE, pp. 3371–3393, 2018.","mla":"Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.” <i>IEEE Transactions on Information Theory</i>, vol. 64, no. 5, IEEE, 2018, pp. 3371–93, doi:<a href=\"https://doi.org/10.1109/tit.2018.2789885\">10.1109/tit.2018.2789885</a>.","short":"M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory 64 (2018) 3371–3393.","ista":"Mondelli M, Hassani H, Urbanke R. 2018. How to achieve the capacity of asymmetric channels. IEEE Transactions on Information Theory. 64(5), 3371–3393.","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger  Urbanke. “How to Achieve the Capacity of Asymmetric Channels.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/tit.2018.2789885\">https://doi.org/10.1109/tit.2018.2789885</a>."},"date_updated":"2023-02-23T12:50:46Z","main_file_link":[{"url":"https://arxiv.org/abs/1406.7373","open_access":"1"}],"date_published":"2018-05-01T00:00:00Z","issue":"5","abstract":[{"text":"We survey coding techniques that enable reliable transmission at rates that approach the capacity of an arbitrary discrete memoryless channel. In particular, we take the point of view of modern coding theory and discuss how recent advances in coding for symmetric channels help provide more efficient solutions for the asymmetric case. We consider, in more detail, three basic coding paradigms. The first one is Gallager's scheme that consists of concatenating a linear code with a non-linear mapping so that the input distribution can be appropriately shaped. We explicitly show that both polar codes and spatially coupled codes can be employed in this scenario. Furthermore, we derive a scaling law between the gap to capacity, the cardinality of the input and output alphabets, and the required size of the mapper. The second one is an integrated scheme in which the code is used both for source coding, in order to create codewords distributed according to the capacity-achieving input distribution, and for channel coding, in order to provide error protection. Such a technique has been recently introduced by Honda and Yamamoto in the context of polar codes, and we show how to apply it also to the design of sparse graph codes. The third paradigm is based on an idea of Böcherer and Mathar, and separates the two tasks of source coding and channel coding by a chaining construction that binds together several codewords. We present conditions for the source code and the channel code, and we describe how to combine any source code with any channel code that fulfill those conditions, in order to provide capacity-achieving schemes for asymmetric channels. In particular, we show that polar codes, spatially coupled codes, and homophonic codes are suitable as basic building blocks of the proposed coding strategy. Rather than focusing on the exact details of the schemes, the purpose of this tutorial is to present different coding techniques that can then be implemented with many variants. There is no absolute winner and, in order to understand the most suitable technique for a specific application scenario, we provide a detailed comparison that takes into account several performance metrics.","lang":"eng"}],"title":"How to achieve the capacity of asymmetric channels"},{"title":"Evolutionary potential of transcription factors for gene regulatory rewiring","abstract":[{"lang":"eng","text":"Gene regulatory networks evolve through rewiring of individual components—that is, through changes in regulatory connections. However, the mechanistic basis of regulatory rewiring is poorly understood. Using a canonical gene regulatory system, we quantify the properties of transcription factors that determine the evolutionary potential for rewiring of regulatory connections: robustness, tunability and evolvability. In vivo repression measurements of two repressors at mutated operator sites reveal their contrasting evolutionary potential: while robustness and evolvability were positively correlated, both were in trade-off with tunability. Epistatic interactions between adjacent operators alleviated this trade-off. A thermodynamic model explains how the differences in robustness, tunability and evolvability arise from biophysical characteristics of repressor–DNA binding. The model also uncovers that the energy matrix, which describes how mutations affect repressor–DNA binding, encodes crucial information about the evolutionary potential of a repressor. The biophysical determinants of evolutionary potential for regulatory rewiring constitute a mechanistic framework for understanding network evolution."}],"date_published":"2018-09-10T00:00:00Z","ddc":["570"],"issue":"10","date_updated":"2024-03-25T23:30:27Z","citation":{"ista":"Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. 2018. Evolutionary potential of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution. 2(10), 1633–1643.","chicago":"Igler, Claudia, Mato Lagator, Gašper Tkačik, Jonathan P Bollback, and Calin C Guet. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.” <i>Nature Ecology and Evolution</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41559-018-0651-y\">https://doi.org/10.1038/s41559-018-0651-y</a>.","ama":"Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. Evolutionary potential of transcription factors for gene regulatory rewiring. <i>Nature Ecology and Evolution</i>. 2018;2(10):1633-1643. doi:<a href=\"https://doi.org/10.1038/s41559-018-0651-y\">10.1038/s41559-018-0651-y</a>","apa":"Igler, C., Lagator, M., Tkačik, G., Bollback, J. P., &#38; Guet, C. C. (2018). Evolutionary potential of transcription factors for gene regulatory rewiring. <i>Nature Ecology and Evolution</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41559-018-0651-y\">https://doi.org/10.1038/s41559-018-0651-y</a>","mla":"Igler, Claudia, et al. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.” <i>Nature Ecology and Evolution</i>, vol. 2, no. 10, Nature Publishing Group, 2018, pp. 1633–43, doi:<a href=\"https://doi.org/10.1038/s41559-018-0651-y\">10.1038/s41559-018-0651-y</a>.","ieee":"C. Igler, M. Lagator, G. Tkačik, J. P. Bollback, and C. C. Guet, “Evolutionary potential of transcription factors for gene regulatory rewiring,” <i>Nature Ecology and Evolution</i>, vol. 2, no. 10. Nature Publishing Group, pp. 1633–1643, 2018.","short":"C. Igler, M. Lagator, G. Tkačik, J.P. Bollback, C.C. Guet, Nature Ecology and Evolution 2 (2018) 1633–1643."},"oa_version":"Submitted Version","type":"journal_article","scopus_import":"1","year":"2018","volume":2,"ec_funded":1,"publisher":"Nature Publishing Group","doi":"10.1038/s41559-018-0651-y","author":[{"first_name":"Claudia","last_name":"Igler","full_name":"Igler, Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87"},{"id":"345D25EC-F248-11E8-B48F-1D18A9856A87","full_name":"Lagator, Mato","last_name":"Lagator","first_name":"Mato"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","last_name":"Tkacik","first_name":"Gasper"},{"full_name":"Bollback, Jonathan P","orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P","last_name":"Bollback"},{"first_name":"Calin C","last_name":"Guet","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"JoBo"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"67","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2578D616-B435-11E9-9278-68D0E5697425","grant_number":"648440","name":"Selective Barriers to Horizontal Gene Transfer","call_identifier":"H2020"},{"_id":"251EE76E-B435-11E9-9278-68D0E5697425","name":"Design principles underlying genetic switch architecture (DOC Fellowship)","grant_number":"24573"}],"publication":"Nature Ecology and Evolution","related_material":{"record":[{"status":"public","relation":"popular_science","id":"5585"},{"status":"public","relation":"dissertation_contains","id":"6371"}]},"page":"1633 - 1643","day":"10","date_created":"2018-12-11T11:44:27Z","status":"public","language":[{"iso":"eng"}],"month":"09","article_type":"original","file":[{"relation":"main_file","file_size":1135973,"access_level":"open_access","date_created":"2020-05-14T11:28:52Z","file_name":"2018_NatureEcology_Igler.pdf","file_id":"7830","checksum":"383a2e2c944a856e2e821ec8e7bf71b6","date_updated":"2020-07-14T12:47:37Z","creator":"dernst","content_type":"application/pdf"}],"external_id":{"isi":["000447947600021"]},"isi":1,"has_accepted_license":"1","publist_id":"7987","oa":1,"file_date_updated":"2020-07-14T12:47:37Z","quality_controlled":"1","article_processing_charge":"No","intvolume":"         2"},{"oa":1,"publication_status":"published","author":[{"first_name":"Nghia","last_name":"Doan","full_name":"Doan, Nghia"},{"full_name":"Hashemi, Seyyed Ali","last_name":"Hashemi","first_name":"Seyyed Ali"},{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli"},{"first_name":"Warren J.","last_name":"Gross","full_name":"Gross, Warren J."}],"doi":"10.1109/glocom.2018.8647308","arxiv":1,"external_id":{"arxiv":["1806.11195"]},"publisher":"IEEE","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6728","quality_controlled":"1","date_updated":"2021-01-12T08:08:42Z","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1806.11195","open_access":"1"}],"date_published":"2018-12-01T00:00:00Z","date_created":"2019-07-30T06:43:15Z","day":"01","abstract":[{"text":"Polar codes are a channel coding scheme for the next generation of wireless communications standard (5G). The belief propagation (BP) decoder allows for parallel decoding of polar codes, making it suitable for high throughput applications. However, the error-correction performance of polar codes under BP decoding is far from the requirements of 5G. It has been shown that the error-correction performance of BP can be improved if the decoding is performed on multiple permuted factor graphs of polar codes. However, a different BP decoding scheduling is required for each factor graph permutation which results in the design of a different decoder for each permutation. Moreover, the selection of the different factor graph permutations is at random, which prevents the decoder to achieve a desirable error correction performance with a small number of permutations. In this paper, we first show that the permutations on the factor graph can be mapped into suitable permutations on the codeword positions. As a result, we can make use of a single decoder for all the permutations. In addition, we introduce a method to construct a set of predetermined permutations which can provide the correct codeword if the decoding fails on the original permutation. We show that for the 5G polar code of length 1024, the error-correction performance of the proposed decoder is more than 0.25 dB better than that of the BP decoder with the same number of random permutations at the frame error rate of 10 -4 .","lang":"eng"}],"publication":"2018 IEEE Global Communications Conference ","conference":{"name":"GLOBECOM: Global Communications Conference","end_date":"2018-12-13","start_date":"2018-12-09","location":"Abu Dhabi, United Arab Emirates"},"title":"On the decoding of polar codes on permuted factor graphs","year":"2018","type":"conference","month":"12","publication_identifier":{"isbn":["9781538647271"]},"language":[{"iso":"eng"}],"oa_version":"Preprint","citation":{"chicago":"Doan, Nghia, Seyyed Ali Hashemi, Marco Mondelli, and Warren J. Gross. “On the Decoding of Polar Codes on Permuted Factor Graphs.” In <i>2018 IEEE Global Communications Conference </i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/glocom.2018.8647308\">https://doi.org/10.1109/glocom.2018.8647308</a>.","ista":"Doan N, Hashemi SA, Mondelli M, Gross WJ. 2018. On the decoding of polar codes on permuted factor graphs. 2018 IEEE Global Communications Conference . GLOBECOM: Global Communications Conference.","short":"N. Doan, S.A. Hashemi, M. Mondelli, W.J. Gross, in:, 2018 IEEE Global Communications Conference , IEEE, 2018.","mla":"Doan, Nghia, et al. “On the Decoding of Polar Codes on Permuted Factor Graphs.” <i>2018 IEEE Global Communications Conference </i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/glocom.2018.8647308\">10.1109/glocom.2018.8647308</a>.","ieee":"N. Doan, S. A. Hashemi, M. Mondelli, and W. J. Gross, “On the decoding of polar codes on permuted factor graphs,” in <i>2018 IEEE Global Communications Conference </i>, Abu Dhabi, United Arab Emirates, 2018.","apa":"Doan, N., Hashemi, S. A., Mondelli, M., &#38; Gross, W. J. (2018). On the decoding of polar codes on permuted factor graphs. In <i>2018 IEEE Global Communications Conference </i>. Abu Dhabi, United Arab Emirates: IEEE. <a href=\"https://doi.org/10.1109/glocom.2018.8647308\">https://doi.org/10.1109/glocom.2018.8647308</a>","ama":"Doan N, Hashemi SA, Mondelli M, Gross WJ. On the decoding of polar codes on permuted factor graphs. In: <i>2018 IEEE Global Communications Conference </i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/glocom.2018.8647308\">10.1109/glocom.2018.8647308</a>"}},{"project":[{"call_identifier":"FWF","_id":"25F8B9BC-B435-11E9-9278-68D0E5697425","name":"Robust invariants of Nonlinear Systems","grant_number":"M01980"},{"_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","name":"FWF Open Access Fund","call_identifier":"FWF"}],"_id":"6774","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","full_name":"Filakovský, Marek","last_name":"Filakovský","first_name":"Marek"},{"id":"473294AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8878-8397","full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner","first_name":"Uli"},{"last_name":"Zhechev","first_name":"Stephan Y","id":"3AA52972-F248-11E8-B48F-1D18A9856A87","full_name":"Zhechev, Stephan Y"}],"publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Springer","doi":"10.1007/s41468-018-0021-5","publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"type":"journal_article","year":"2018","volume":2,"citation":{"ama":"Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives of homotopy group elements. <i>Journal of Applied and Computational Topology</i>. 2018;2(3-4):177-231. doi:<a href=\"https://doi.org/10.1007/s41468-018-0021-5\">10.1007/s41468-018-0021-5</a>","apa":"Filakovský, M., Franek, P., Wagner, U., &#38; Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. <i>Journal of Applied and Computational Topology</i>. Springer. <a href=\"https://doi.org/10.1007/s41468-018-0021-5\">https://doi.org/10.1007/s41468-018-0021-5</a>","short":"M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.","mla":"Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.” <i>Journal of Applied and Computational Topology</i>, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:<a href=\"https://doi.org/10.1007/s41468-018-0021-5\">10.1007/s41468-018-0021-5</a>.","ieee":"M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial representatives of homotopy group elements,” <i>Journal of Applied and Computational Topology</i>, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.","ista":"Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4), 177–231.","chicago":"Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing Simplicial Representatives of Homotopy Group Elements.” <i>Journal of Applied and Computational Topology</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s41468-018-0021-5\">https://doi.org/10.1007/s41468-018-0021-5</a>."},"oa_version":"Published Version","issue":"3-4","ddc":["514"],"date_published":"2018-12-01T00:00:00Z","date_updated":"2023-09-07T13:10:36Z","title":"Computing simplicial representatives of homotopy group elements","abstract":[{"lang":"eng","text":"A central problem of algebraic topology is to understand the homotopy groups  𝜋𝑑(𝑋)  of a topological space X. For the computational version of the problem, it is well known that there is no algorithm to decide whether the fundamental group  𝜋1(𝑋)  of a given finite simplicial complex X is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex X that is simply connected (i.e., with   𝜋1(𝑋)  trivial), compute the higher homotopy group   𝜋𝑑(𝑋)  for any given   𝑑≥2 . However, these algorithms come with a caveat: They compute the isomorphism type of   𝜋𝑑(𝑋) ,   𝑑≥2  as an abstract finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of   𝜋𝑑(𝑋) . Converting elements of this abstract group into explicit geometric maps from the d-dimensional sphere   𝑆𝑑  to X has been one of the main unsolved problems in the emerging field of computational homotopy theory. Here we present an algorithm that, given a simply connected space X, computes   𝜋𝑑(𝑋)  and represents its elements as simplicial maps from a suitable triangulation of the d-sphere   𝑆𝑑  to X. For fixed d, the algorithm runs in time exponential in   size(𝑋) , the number of simplices of X. Moreover, we prove that this is optimal: For every fixed   𝑑≥2 , we construct a family of simply connected spaces X such that for any simplicial map representing a generator of   𝜋𝑑(𝑋) , the size of the triangulation of   𝑆𝑑  on which the map is defined, is exponential in size(𝑋) ."}],"quality_controlled":"1","file_date_updated":"2020-07-14T12:47:40Z","intvolume":"         2","oa":1,"file":[{"creator":"dernst","content_type":"application/pdf","file_id":"6775","date_updated":"2020-07-14T12:47:40Z","checksum":"cf9e7fcd2a113dd4828774fc75cdb7e8","file_size":1056278,"file_name":"2018_JourAppliedComputTopology_Filakovsky.pdf","access_level":"open_access","date_created":"2019-08-08T06:55:21Z","relation":"main_file"}],"has_accepted_license":"1","article_type":"original","month":"12","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"date_created":"2019-08-08T06:47:40Z","status":"public","page":"177-231","publication":"Journal of Applied and Computational Topology","related_material":{"record":[{"status":"public","id":"6681","relation":"dissertation_contains"}]},"day":"01"},{"oa_version":"Published Version","citation":{"apa":"Zimin, A. (2018). <i>Learning from dependent data</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:TH1048\">https://doi.org/10.15479/AT:ISTA:TH1048</a>","ama":"Zimin A. Learning from dependent data. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH1048\">10.15479/AT:ISTA:TH1048</a>","short":"A. Zimin, Learning from Dependent Data, Institute of Science and Technology Austria, 2018.","mla":"Zimin, Alexander. <i>Learning from Dependent Data</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH1048\">10.15479/AT:ISTA:TH1048</a>.","ieee":"A. Zimin, “Learning from dependent data,” Institute of Science and Technology Austria, 2018.","ista":"Zimin A. 2018. Learning from dependent data. Institute of Science and Technology Austria.","chicago":"Zimin, Alexander. “Learning from Dependent Data.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:TH1048\">https://doi.org/10.15479/AT:ISTA:TH1048</a>."},"year":"2018","type":"dissertation","publication_identifier":{"issn":["2663-337X"]},"abstract":[{"lang":"eng","text":"The most common assumption made in statistical learning theory is the assumption of the independent and identically distributed (i.i.d.) data. While being very convenient mathematically, it is often very clearly violated in practice. This disparity between the machine learning theory and applications underlies a growing demand in the development of algorithms that learn from dependent data and theory that can provide generalization guarantees similar to the independent situations. This thesis is dedicated to two variants of dependencies that can arise in practice. One is a dependence on the level of samples in a single learning task. Another dependency type arises in the multi-task setting when the tasks are dependent on each other even though the data for them can be i.i.d. In both cases we model the data (samples or tasks) as stochastic processes and introduce new algorithms for both settings that take into account and exploit the resulting dependencies. We prove the theoretical guarantees on the performance of the introduced algorithms under different evaluation criteria and, in addition, we compliment the theoretical study by the empirical one, where we evaluate some of the algorithms on two real world datasets to highlight their practical applicability."}],"title":"Learning from dependent data","date_updated":"2023-09-07T12:29:07Z","date_published":"2018-09-01T00:00:00Z","ddc":["004","519"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"68","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"}],"doi":"10.15479/AT:ISTA:TH1048","ec_funded":1,"alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"ChLa"}],"publication_status":"published","author":[{"full_name":"Zimin, Alexander","id":"37099E9C-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander","last_name":"Zimin"}],"language":[{"iso":"eng"}],"supervisor":[{"first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"pubrep_id":"1048","month":"09","day":"01","page":"92","status":"public","date_created":"2018-12-11T11:44:27Z","file_date_updated":"2020-07-14T12:47:40Z","article_processing_charge":"No","degree_awarded":"PhD","has_accepted_license":"1","publist_id":"7986","file":[{"relation":"main_file","access_level":"open_access","date_created":"2019-04-09T07:32:47Z","file_name":"2018_Thesis_Zimin.pdf","file_size":1036137,"date_updated":"2020-07-14T12:47:40Z","checksum":"e849dd40a915e4d6c5572b51b517f098","file_id":"6253","content_type":"application/pdf","creator":"dernst"},{"relation":"source_file","file_size":637490,"access_level":"closed","date_created":"2019-04-09T07:32:47Z","file_name":"2018_Thesis_Zimin_Source.zip","file_id":"6254","checksum":"da092153cec55c97461bd53c45c5d139","date_updated":"2020-07-14T12:47:40Z","creator":"dernst","content_type":"application/zip"}],"oa":1},{"supervisor":[{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","last_name":"Katsaros","first_name":"Georgios"}],"pubrep_id":"1047","month":"09","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"status":"public","date_created":"2018-12-11T11:44:28Z","day":"01","related_material":{"record":[{"id":"23","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"840","status":"public"}]},"page":"103","file_date_updated":"2020-07-14T12:47:44Z","article_processing_charge":"No","degree_awarded":"PhD","oa":1,"has_accepted_license":"1","publist_id":"7985","file":[{"relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":28452385,"date_created":"2019-04-09T07:00:40Z","file_name":"2018_Thesis_Vukusic.pdf","access_level":"open_access","file_id":"6247","date_updated":"2020-07-14T12:47:44Z","checksum":"c570b656e30749cd65b1c7e13a9ce0a8"},{"relation":"source_file","content_type":"application/zip","creator":"dernst","date_updated":"2020-07-14T12:47:44Z","checksum":"7856771d9cd401fe0b311191076db6e1","file_id":"6248","date_created":"2019-04-09T07:00:40Z","file_name":"2018_Thesis_Vukusic_source.zip","access_level":"closed","file_size":53058704}],"year":"2018","type":"dissertation","publication_identifier":{"issn":["2663-337X"]},"oa_version":"Published Version","citation":{"ista":"Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria.","chicago":"Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1047\">https://doi.org/10.15479/AT:ISTA:TH_1047</a>.","apa":"Vukušić, L. (2018). <i>Charge sensing and spin relaxation times of holes in Ge hut wires</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1047\">https://doi.org/10.15479/AT:ISTA:TH_1047</a>","ama":"Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1047\">10.15479/AT:ISTA:TH_1047</a>","short":"L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires, Institute of Science and Technology Austria, 2018.","mla":"Vukušić, Lada. <i>Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1047\">10.15479/AT:ISTA:TH_1047</a>.","ieee":"L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,” Institute of Science and Technology Austria, 2018."},"date_updated":"2023-09-26T15:50:22Z","date_published":"2018-09-01T00:00:00Z","ddc":["530","600"],"abstract":[{"text":"A qubit, a unit of quantum information, is essentially any quantum mechanical two-level system which can be coherently controlled. Still, to be used for computation, it has to fulfill criteria. Qubits, regardless of the system in which they are realized, suffer from decoherence. This leads to loss of the information stored in the qubit. The upper bound of the time scale on which decoherence happens is set by the spin relaxation time. In this thesis I studied a two-level system consisting of a Zeeman-split hole spin confined in a quantum dot formed in a Ge hut wire. Such Ge hut wires have emerged as a promising material system for the realization of spin qubits, due to the combination of two significant properties: long spin coherence time as expected for group IV semiconductors due to the low hyperfine interaction and a strong valence band spin-orbit coupling. Here, I present how to fabricate quantum dot devices suitable for electrical transport measurements. Coupled quantum dot devices allowed the realization of a charge sensor, which is electrostatically and tunnel coupled to a quantum dot. By integrating the charge sensor into a radio-frequency reflectometry setup, I performed for the first time single-shot readout measurements of hole spins and extracted the hole spin relaxation times in Ge hut wires.","lang":"eng"}],"title":"Charge sensing and spin relaxation times of holes in Ge hut wires","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"69","department":[{"_id":"GeKa"},{"_id":"GradSch"}],"publication_status":"published","author":[{"id":"31E9F056-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2424-8636","full_name":"Vukušić, Lada","last_name":"Vukušić","first_name":"Lada"}],"doi":"10.15479/AT:ISTA:TH_1047","alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria"},{"status":"public","date_created":"2018-12-11T11:47:56Z","day":"14","publication":"Probability Theory and Related Fields","month":"06","language":[{"iso":"eng"}],"oa":1,"publist_id":"7017","external_id":{"arxiv":["1605.08767"]},"intvolume":"       171","quality_controlled":"1","date_updated":"2021-01-12T08:09:33Z","issue":"1-2","date_published":"2018-06-14T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.08767"}],"abstract":[{"lang":"eng","text":"We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density up to the spectral edges. Under a suitable condition on the sparsity, we also prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations if a deterministic shift of the spectral edge due to the sparsity is included. For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom fluctuations of the second largest eigenvalue when p is much larger than N−2/3 with a deterministic shift of order (Np)−1."}],"title":"Local law and Tracy–Widom limit for sparse random matrices","article_number":"543-616","year":"2018","volume":171,"scopus_import":1,"type":"journal_article","citation":{"ista":"Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 171(1–2), 543–616.","chicago":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” <i>Probability Theory and Related Fields</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00440-017-0787-8\">https://doi.org/10.1007/s00440-017-0787-8</a>.","ama":"Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices. <i>Probability Theory and Related Fields</i>. 2018;171(1-2). doi:<a href=\"https://doi.org/10.1007/s00440-017-0787-8\">10.1007/s00440-017-0787-8</a>","apa":"Lee, J., &#38; Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse random matrices. <i>Probability Theory and Related Fields</i>. Springer. <a href=\"https://doi.org/10.1007/s00440-017-0787-8\">https://doi.org/10.1007/s00440-017-0787-8</a>","ieee":"J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random matrices,” <i>Probability Theory and Related Fields</i>, vol. 171, no. 1–2. Springer, 2018.","mla":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” <i>Probability Theory and Related Fields</i>, vol. 171, no. 1–2, 543–616, Springer, 2018, doi:<a href=\"https://doi.org/10.1007/s00440-017-0787-8\">10.1007/s00440-017-0787-8</a>.","short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018)."},"oa_version":"Preprint","department":[{"_id":"LaEr"}],"author":[{"full_name":"Lee, Jii","last_name":"Lee","first_name":"Jii"},{"full_name":"Schnelli, Kevin","orcid":"0000-0003-0954-3231","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","first_name":"Kevin","last_name":"Schnelli"}],"publication_status":"published","doi":"10.1007/s00440-017-0787-8","publisher":"Springer","arxiv":1,"ec_funded":1,"project":[{"call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"_id":"690","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]