[{"publist_id":"7986","page":"92","title":"Learning from dependent data","oa":1,"date_created":"2018-12-11T11:44:27Z","citation":{"ama":"Zimin A. Learning from dependent data. 2018. doi:10.15479/AT:ISTA:TH1048","ieee":"A. Zimin, “Learning from dependent data,” Institute of Science and Technology Austria, 2018.","short":"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.","mla":"Zimin, Alexander. Learning from Dependent Data. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH1048.","apa":"Zimin, A. (2018). Learning from dependent data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH1048","chicago":"Zimin, Alexander. “Learning from Dependent Data.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH1048."},"doi":"10.15479/AT:ISTA:TH1048","file_date_updated":"2020-07-14T12:47:40Z","article_processing_charge":"No","ec_funded":1,"day":"01","has_accepted_license":"1","degree_awarded":"PhD","date_published":"2018-09-01T00:00:00Z","publication_identifier":{"issn":["2663-337X"]},"year":"2018","month":"09","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036"}],"department":[{"_id":"ChLa"}],"supervisor":[{"orcid":"0000-0001-8622-7887","last_name":"Lampert","full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"pubrep_id":"1048","publisher":"Institute of Science and Technology Austria","ddc":["004","519"],"type":"dissertation","oa_version":"Published Version","file":[{"creator":"dernst","file_id":"6253","relation":"main_file","file_name":"2018_Thesis_Zimin.pdf","checksum":"e849dd40a915e4d6c5572b51b517f098","file_size":1036137,"date_created":"2019-04-09T07:32:47Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:40Z"},{"file_name":"2018_Thesis_Zimin_Source.zip","relation":"source_file","creator":"dernst","file_id":"6254","date_updated":"2020-07-14T12:47:40Z","content_type":"application/zip","access_level":"closed","date_created":"2019-04-09T07:32:47Z","checksum":"da092153cec55c97461bd53c45c5d139","file_size":637490}],"_id":"68","alternative_title":["ISTA Thesis"],"publication_status":"published","author":[{"first_name":"Alexander","id":"37099E9C-F248-11E8-B48F-1D18A9856A87","full_name":"Zimin, Alexander","last_name":"Zimin"}],"status":"public","date_updated":"2023-09-07T12:29:07Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}]},{"license":"https://creativecommons.org/licenses/by/4.0/","author":[{"first_name":"Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","full_name":"Vukušić, Lada","last_name":"Vukušić","orcid":"0000-0003-2424-8636"}],"status":"public","date_updated":"2023-09-26T15:50:22Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"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"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"23"},{"id":"840","status":"public","relation":"part_of_dissertation"}]},"publication_identifier":{"issn":["2663-337X"]},"year":"2018","month":"09","department":[{"_id":"GeKa"},{"_id":"GradSch"}],"pubrep_id":"1047","supervisor":[{"full_name":"Katsaros, Georgios","last_name":"Katsaros","orcid":"0000-0001-8342-202X","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Institute of Science and Technology Austria","ddc":["530","600"],"oa_version":"Published Version","type":"dissertation","file":[{"creator":"dernst","file_id":"6247","relation":"main_file","file_name":"2018_Thesis_Vukusic.pdf","file_size":28452385,"checksum":"c570b656e30749cd65b1c7e13a9ce0a8","date_created":"2019-04-09T07:00:40Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:44Z"},{"date_updated":"2020-07-14T12:47:44Z","content_type":"application/zip","access_level":"closed","date_created":"2019-04-09T07:00:40Z","file_size":53058704,"checksum":"7856771d9cd401fe0b311191076db6e1","file_name":"2018_Thesis_Vukusic_source.zip","relation":"source_file","creator":"dernst","file_id":"6248"}],"_id":"69","alternative_title":["ISTA Thesis"],"publication_status":"published","doi":"10.15479/AT:ISTA:TH_1047","file_date_updated":"2020-07-14T12:47:44Z","article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"01","has_accepted_license":"1","degree_awarded":"PhD","date_published":"2018-09-01T00:00:00Z","page":"103","publist_id":"7985","title":"Charge sensing and spin relaxation times of holes in Ge hut wires","oa":1,"citation":{"ama":"Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires. 2018. doi:10.15479/AT:ISTA:TH_1047","ista":"Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria.","short":"L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires, Institute of Science and Technology Austria, 2018.","ieee":"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. Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1047.","apa":"Vukušić, L. (2018). Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1047","chicago":"Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1047."},"date_created":"2018-12-11T11:44:28Z"},{"main_file_link":[{"url":"https://arxiv.org/abs/1605.08767","open_access":"1"}],"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."}],"scopus_import":1,"date_updated":"2021-01-12T08:09:33Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","author":[{"last_name":"Lee","full_name":"Lee, Jii","first_name":"Jii"},{"id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","first_name":"Kevin","last_name":"Schnelli","full_name":"Schnelli, Kevin","orcid":"0000-0003-0954-3231"}],"type":"journal_article","oa_version":"Preprint","external_id":{"arxiv":["1605.08767"]},"publication_status":"published","_id":"690","issue":"1-2","publisher":"Springer","department":[{"_id":"LaEr"}],"project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems"}],"month":"06","year":"2018","intvolume":" 171","date_published":"2018-06-14T00:00:00Z","day":"14","publication":"Probability Theory and Related Fields","volume":171,"ec_funded":1,"doi":"10.1007/s00440-017-0787-8","citation":{"apa":"Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8","chicago":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields. Springer, 2018. https://doi.org/10.1007/s00440-017-0787-8.","mla":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616, Springer, 2018, doi:10.1007/s00440-017-0787-8.","ama":"Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8","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.","short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).","ieee":"J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer, 2018."},"date_created":"2018-12-11T11:47:56Z","quality_controlled":"1","arxiv":1,"oa":1,"article_number":"543-616","title":"Local law and Tracy–Widom limit for sparse random matrices","publist_id":"7017"},{"publisher":"BMJ Publishing Group","_id":"691","issue":"1","publication_status":"published","external_id":{"isi":["000418199800007"],"pmid":["28626029"]},"type":"journal_article","oa_version":"Submitted Version","year":"2018","month":"01","project":[{"_id":"254BA948-B435-11E9-9278-68D0E5697425","name":"Probing development and reversibility of autism spectrum disorders","grant_number":"401299"}],"isi":1,"publication_identifier":{"issn":["0022-2593"]},"article_type":"original","department":[{"_id":"GaNo"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-10-16T09:55:43Z","scopus_import":"1","abstract":[{"lang":"eng","text":"Background: Transport protein particle (TRAPP) is a multisubunit complex that regulates membrane trafficking through the Golgi apparatus. The clinical phenotype associated with mutations in various TRAPP subunits has allowed elucidation of their functions in specific tissues. The role of some subunits in human disease, however, has not been fully established, and their functions remain uncertain.\r\n\r\nObjective: We aimed to expand the range of neurodevelopmental disorders associated with mutations in TRAPP subunits by exome sequencing of consanguineous families.\r\n\r\nMethods: Linkage and homozygosity mapping and candidate gene analysis were used to identify homozygous mutations in families. Patient fibroblasts were used to study splicing defect and zebrafish to model the disease.\r\n\r\nResults: We identified six individuals from three unrelated families with a founder homozygous splice mutation in TRAPPC6B, encoding a core subunit of the complex TRAPP I. Patients manifested a neurodevelopmental disorder characterised by microcephaly, epilepsy and autistic features, and showed splicing defect. Zebrafish trappc6b morphants replicated the human phenotype, displaying decreased head size and neuronal hyperexcitability, leading to a lower seizure threshold.\r\n\r\nConclusion: This study provides clinical and functional evidence of the role of TRAPPC6B in brain development and function."}],"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6056005/","open_access":"1"}],"author":[{"full_name":"Marin Valencia, Isaac","last_name":"Marin Valencia","first_name":"Isaac"},{"orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia"},{"first_name":"Anide","full_name":"Johansen, Anide","last_name":"Johansen"},{"full_name":"Rosti, Başak","last_name":"Rosti","first_name":"Başak"},{"first_name":"Mahmoud","last_name":"Issa","full_name":"Issa, Mahmoud"},{"first_name":"Damir","full_name":"Musaev, Damir","last_name":"Musaev"},{"last_name":"Bhat","full_name":"Bhat, Gifty","first_name":"Gifty"},{"first_name":"Eric","full_name":"Scott, Eric","last_name":"Scott"},{"full_name":"Silhavy, Jennifer","last_name":"Silhavy","first_name":"Jennifer"},{"last_name":"Stanley","full_name":"Stanley, Valentina","first_name":"Valentina"},{"last_name":"Rosti","full_name":"Rosti, Rasim","first_name":"Rasim"},{"first_name":"Jeremy","last_name":"Gleeson","full_name":"Gleeson, Jeremy"},{"first_name":"Farhad","last_name":"Imam","full_name":"Imam, Farhad"},{"last_name":"Zaki","full_name":"Zaki, Maha","first_name":"Maha"},{"last_name":"Gleeson","full_name":"Gleeson, Joseph","first_name":"Joseph"}],"status":"public","oa":1,"quality_controlled":"1","citation":{"ama":"Marin Valencia I, Novarino G, Johansen A, et al. A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. 2018;55(1):48-54. doi:10.1136/jmedgenet-2017-104627","ieee":"I. Marin Valencia et al., “A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features,” Journal of Medical Genetics, vol. 55, no. 1. BMJ Publishing Group, pp. 48–54, 2018.","ista":"Marin Valencia I, Novarino G, Johansen A, Rosti B, Issa M, Musaev D, Bhat G, Scott E, Silhavy J, Stanley V, Rosti R, Gleeson J, Imam F, Zaki M, Gleeson J. 2018. A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. 55(1), 48–54.","short":"I. Marin Valencia, G. Novarino, A. Johansen, B. Rosti, M. Issa, D. Musaev, G. Bhat, E. Scott, J. Silhavy, V. Stanley, R. Rosti, J. Gleeson, F. Imam, M. Zaki, J. Gleeson, Journal of Medical Genetics 55 (2018) 48–54.","mla":"Marin Valencia, Isaac, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” Journal of Medical Genetics, vol. 55, no. 1, BMJ Publishing Group, 2018, pp. 48–54, doi:10.1136/jmedgenet-2017-104627.","apa":"Marin Valencia, I., Novarino, G., Johansen, A., Rosti, B., Issa, M., Musaev, D., … Gleeson, J. (2018). A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. BMJ Publishing Group. https://doi.org/10.1136/jmedgenet-2017-104627","chicago":"Marin Valencia, Isaac, Gaia Novarino, Anide Johansen, Başak Rosti, Mahmoud Issa, Damir Musaev, Gifty Bhat, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” Journal of Medical Genetics. BMJ Publishing Group, 2018. https://doi.org/10.1136/jmedgenet-2017-104627."},"date_created":"2018-12-11T11:47:57Z","page":"48 - 54","publist_id":"7016","title":"A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features","pmid":1,"volume":55,"publication":"Journal of Medical Genetics","day":"01","date_published":"2018-01-01T00:00:00Z","intvolume":" 55","doi":"10.1136/jmedgenet-2017-104627","article_processing_charge":"No"},{"isi":1,"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"year":"2018","month":"06","department":[{"_id":"HeEd"}],"article_type":"original","publisher":"Springer","ddc":["510"],"oa_version":"Published Version","type":"journal_article","file":[{"relation":"main_file","file_id":"7222","creator":"kschuh","file_name":"2018_Springer_Akopyan.pdf","date_created":"2020-01-03T11:35:08Z","file_size":1140860,"checksum":"1febcfc1266486053a069e3425ea3713","date_updated":"2020-07-14T12:47:44Z","access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","external_id":{"isi":["000431418800004"]},"_id":"692","issue":"1","status":"public","author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy","last_name":"Akopyan","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X"}],"date_updated":"2023-09-08T11:40:29Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We consider families of confocal conics and two pencils of Apollonian circles having the same foci. We will show that these families of curves generate trivial 3-webs and find the exact formulas describing them."}],"scopus_import":"1","page":"55 - 64","publist_id":"7014","title":"3-Webs generated by confocal conics and circles","oa":1,"date_created":"2018-12-11T11:47:57Z","citation":{"apa":"Akopyan, A. (2018). 3-Webs generated by confocal conics and circles. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0265-6","chicago":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0265-6.","mla":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae Dedicata, vol. 194, no. 1, Springer, 2018, pp. 55–64, doi:10.1007/s10711-017-0265-6.","ama":"Akopyan A. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 2018;194(1):55-64. doi:10.1007/s10711-017-0265-6","ieee":"A. Akopyan, “3-Webs generated by confocal conics and circles,” Geometriae Dedicata, vol. 194, no. 1. Springer, pp. 55–64, 2018.","ista":"Akopyan A. 2018. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 194(1), 55–64.","short":"A. Akopyan, Geometriae Dedicata 194 (2018) 55–64."},"quality_controlled":"1","doi":"10.1007/s10711-017-0265-6","file_date_updated":"2020-07-14T12:47:44Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"Yes (via OA deal)","ec_funded":1,"publication":"Geometriae Dedicata","day":"01","volume":194,"has_accepted_license":"1","intvolume":" 194","date_published":"2018-06-01T00:00:00Z"},{"doi":"10.1007/978-3-662-58387-6_26","article_processing_charge":"No","ec_funded":1,"volume":10957,"day":"07","publication":"22nd International Conference on Financial Cryptography and Data Security","date_published":"2018-12-07T00:00:00Z","intvolume":" 10957","page":"480-499","title":"SpaceMint: A cryptocurrency based on proofs of space","oa":1,"conference":{"start_date":"2018-02-26","name":"FC: Financial Cryptography and Data Security","end_date":"2018-03-02","location":"Nieuwpoort, Curacao"},"quality_controlled":"1","citation":{"ieee":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak, “SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.","ista":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957, 480–499.","short":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.","ama":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: 22nd International Conference on Financial Cryptography and Data Security. Vol 10957. Springer Nature; 2018:480-499. doi:10.1007/978-3-662-58387-6_26","chicago":"Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen, and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” In 22nd International Conference on Financial Cryptography and Data Security, 10957:480–99. Springer Nature, 2018. https://doi.org/10.1007/978-3-662-58387-6_26.","apa":"Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., & Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd International Conference on Financial Cryptography and Data Security (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. https://doi.org/10.1007/978-3-662-58387-6_26","mla":"Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” 22nd International Conference on Financial Cryptography and Data Security, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26."},"date_created":"2019-10-14T06:35:38Z","author":[{"full_name":"Park, Sunoo","last_name":"Park","first_name":"Sunoo"},{"first_name":"Albert","full_name":"Kwon, Albert","last_name":"Kwon"},{"id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg"},{"last_name":"Gazi","full_name":"Gazi, Peter","first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Alwen","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"date_updated":"2023-09-19T15:02:13Z","scopus_import":"1","abstract":[{"text":"Bitcoin has become the most successful cryptocurrency ever deployed, and its most distinctive feature is that it is decentralized. Its underlying protocol (Nakamoto consensus) achieves this by using proof of work, which has the drawback that it causes the consumption of vast amounts of energy to maintain the ledger. Moreover, Bitcoin mining dynamics have become less distributed over time.\r\n\r\nTowards addressing these issues, we propose SpaceMint, a cryptocurrency based on proofs of space instead of proofs of work. Miners in SpaceMint dedicate disk space rather than computation. We argue that SpaceMint’s design solves or alleviates several of Bitcoin’s issues: most notably, its large energy consumption. SpaceMint also rewards smaller miners fairly according to their contribution to the network, thus incentivizing more distributed participation.\r\n\r\nThis paper adapts proof of space to enable its use in cryptocurrency, studies the attacks that can arise against a Bitcoin-like blockchain that uses proof of space, and proposes a new blockchain format and transaction types to address these attacks. Our prototype shows that initializing 1 TB for mining takes about a day (a one-off setup cost), and miners spend on average just a fraction of a second per block mined. Finally, we provide a game-theoretic analysis modeling SpaceMint as an extensive game (the canonical game-theoretic notion for games that take place over time) and show that this stylized game satisfies a strong equilibrium notion, thereby arguing for SpaceMint ’s stability and consensus.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2015/528"}],"month":"12","year":"2018","project":[{"grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"isi":1,"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783662583869","9783662583876"]},"department":[{"_id":"KrPi"}],"publisher":"Springer Nature","_id":"6941","publication_status":"published","external_id":{"isi":["000540656400026"]},"alternative_title":["LNCS"],"oa_version":"Submitted Version","type":"conference"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2023-10-17T11:50:05Z","scopus_import":"1","abstract":[{"text":"Animal social networks are shaped by multiple selection pressures, including the need to ensure efficient communication and functioning while simultaneously limiting disease transmission. Social animals could potentially further reduce epidemic risk by altering their social networks in the presence of pathogens, yet there is currently no evidence for such pathogen-triggered responses. We tested this hypothesis experimentally in the ant Lasius niger using a combination of automated tracking, controlled pathogen exposure, transmission quantification, and temporally explicit simulations. Pathogen exposure induced behavioral changes in both exposed ants and their nestmates, which helped contain the disease by reinforcing key transmission-inhibitory properties of the colony's contact network. This suggests that social network plasticity in response to pathogens is an effective strategy for mitigating the effects of disease in social groups.","lang":"eng"}],"related_material":{"record":[{"id":"13055","status":"public","relation":"research_data"}],"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/for-ants-unity-is-strength-and-health/"}]},"main_file_link":[{"url":"https://serval.unil.ch/resource/serval:BIB_E9228C205467.P001/REF.pdf","open_access":"1"}],"author":[{"first_name":"Nathalie","last_name":"Stroeymeyt","full_name":"Stroeymeyt, Nathalie"},{"full_name":"Grasse, Anna V","last_name":"Grasse","first_name":"Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alessandro","last_name":"Crespi","full_name":"Crespi, Alessandro"},{"full_name":"Mersch, Danielle","last_name":"Mersch","first_name":"Danielle"},{"full_name":"Cremer, Sylvia","last_name":"Cremer","orcid":"0000-0002-2193-3868","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Keller","full_name":"Keller, Laurent"}],"status":"public","publisher":"AAAS","_id":"7","issue":"6417","external_id":{"isi":["000451124500041"]},"publication_status":"published","type":"journal_article","oa_version":"Published Version","year":"2018","month":"11","project":[{"name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","call_identifier":"FP7","_id":"25DC711C-B435-11E9-9278-68D0E5697425","grant_number":"243071"}],"isi":1,"publication_identifier":{"issn":["1095-9203"]},"article_type":"original","department":[{"_id":"SyCr"}],"volume":362,"publication":"Science","day":"23","acknowledgement":"This project was funded by two European Research Council Advanced Grants (Social Life, 249375, and resiliANT, 741491) and two Swiss National Science Foundation grants (CR32I3_141063 and 310030_156732) to L.K. and a European Research Council Starting Grant (SocialVaccines, 243071) to S.C.","date_published":"2018-11-23T00:00:00Z","intvolume":" 362","doi":"10.1126/science.aat4793","article_processing_charge":"No","ec_funded":1,"oa":1,"quality_controlled":"1","citation":{"mla":"Stroeymeyt, Nathalie, et al. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Science, vol. 362, no. 6417, AAAS, 2018, pp. 941–45, doi:10.1126/science.aat4793.","chicago":"Stroeymeyt, Nathalie, Anna V Grasse, Alessandro Crespi, Danielle Mersch, Sylvia Cremer, and Laurent Keller. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Science. AAAS, 2018. https://doi.org/10.1126/science.aat4793.","apa":"Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., & Keller, L. (2018). Social network plasticity decreases disease transmission in a eusocial insect. Science. AAAS. https://doi.org/10.1126/science.aat4793","ieee":"N. Stroeymeyt, A. V. Grasse, A. Crespi, D. Mersch, S. Cremer, and L. Keller, “Social network plasticity decreases disease transmission in a eusocial insect,” Science, vol. 362, no. 6417. AAAS, pp. 941–945, 2018.","short":"N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, Science 362 (2018) 941–945.","ista":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. 2018. Social network plasticity decreases disease transmission in a eusocial insect. Science. 362(6417), 941–945.","ama":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network plasticity decreases disease transmission in a eusocial insect. Science. 2018;362(6417):941-945. doi:10.1126/science.aat4793"},"date_created":"2018-12-11T11:44:07Z","publist_id":"8049","page":"941 - 945","title":"Social network plasticity decreases disease transmission in a eusocial insect"},{"article_type":"original","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"project":[{"call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"},{"name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"}],"year":"2018","month":"10","publication_identifier":{"issn":["1980-0436"]},"isi":1,"external_id":{"arxiv":["1705.08836"],"isi":["000460475800022"]},"publication_status":"published","_id":"70","issue":"2","file":[{"file_name":"2018_ALEA_Nejjar.pdf","file_id":"5981","creator":"kschuh","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:47:46Z","checksum":"2ded46aa284a836a8cbb34133a64f1cb","file_size":394851,"date_created":"2019-02-14T09:44:10Z"}],"type":"journal_article","ddc":["510"],"oa_version":"Published Version","publisher":"Instituto Nacional de Matematica Pura e Aplicada","status":"public","author":[{"full_name":"Nejjar, Peter","last_name":"Nejjar","first_name":"Peter","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","abstract":[{"lang":"eng","text":"We consider the totally asymmetric simple exclusion process in a critical scaling parametrized by a≥0, which creates a shock in the particle density of order aT−1/3, T the observation time. When starting from step initial data, we provide bounds on the limiting law which in particular imply that in the double limit lima→∞limT→∞ one recovers the product limit law and the degeneration of the correlation length observed at shocks of order 1. This result is shown to apply to a general last-passage percolation model. We also obtain bounds on the two-point functions of several airy processes."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2023-10-10T13:11:29Z","title":"Transition to shocks in TASEP and decoupling of last passage times","page":"1311-1334","quality_controlled":"1","arxiv":1,"date_created":"2018-12-11T11:44:28Z","citation":{"ama":"Nejjar P. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 2018;15(2):1311-1334. doi:10.30757/ALEA.v15-49","short":"P. Nejjar, Latin American Journal of Probability and Mathematical Statistics 15 (2018) 1311–1334.","ista":"Nejjar P. 2018. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 15(2), 1311–1334.","ieee":"P. Nejjar, “Transition to shocks in TASEP and decoupling of last passage times,” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1311–1334, 2018.","mla":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2, Instituto Nacional de Matematica Pura e Aplicada, 2018, pp. 1311–34, doi:10.30757/ALEA.v15-49.","apa":"Nejjar, P. (2018). Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v15-49","chicago":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada, 2018. https://doi.org/10.30757/ALEA.v15-49."},"oa":1,"article_processing_charge":"No","ec_funded":1,"file_date_updated":"2020-07-14T12:47:46Z","doi":"10.30757/ALEA.v15-49","date_published":"2018-10-01T00:00:00Z","has_accepted_license":"1","intvolume":" 15","day":"01","publication":"Latin American Journal of Probability and Mathematical Statistics","volume":15},{"doi":"10.1109/TPAMI.2017.2730884","date_published":"2018-07-01T00:00:00Z","intvolume":" 40","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","day":"01","volume":40,"title":"Maximum persistency via iterative relaxed inference with graphical models","publist_id":"6992","page":"1668-1682","arxiv":1,"quality_controlled":"1","date_created":"2018-12-11T11:48:01Z","citation":{"ama":"Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884","ista":"Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682.","ieee":"A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.","short":"A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.","mla":"Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.","apa":"Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884","chicago":"Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884."},"oa":1,"status":"public","author":[{"first_name":"Alexander","full_name":"Shekhovtsov, Alexander","last_name":"Shekhovtsov"},{"last_name":"Swoboda","full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul"},{"full_name":"Savchynskyy, Bogdan","last_name":"Savchynskyy","first_name":"Bogdan"}],"scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1508.07902","open_access":"1"}],"abstract":[{"text":"We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some labels of the considered graphical model either as (i) optimal, meaning that they belong to all optimal solutions of the inference problem; (ii) non-optimal if they provably do not belong to any solution. With access to an exact solver of a linear programming relaxation to the MAP-inference problem, our algorithm marks the maximal possible (in a specified sense) number of labels. We also present a version of the algorithm, which has access to a suboptimal dual solver only and still can ensure the (non-)optimality for the marked labels, although the overall number of the marked labels may decrease. We propose an efficient implementation, which runs in time comparable to a single run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art results on computational benchmarks from machine learning and computer vision.","lang":"eng"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:11:32Z","department":[{"_id":"VlKo"}],"year":"2018","month":"07","publication_identifier":{"issn":["01628828"]},"publication_status":"published","external_id":{"arxiv":["1508.07902"]},"_id":"703","issue":"7","type":"journal_article","oa_version":"Preprint","publisher":"IEEE"},{"department":[{"_id":"RySh"}],"isi":1,"year":"2018","month":"06","type":"journal_article","oa_version":"None","issue":"6","_id":"705","external_id":{"isi":["000431991500025"]},"publication_status":"published","publisher":"Springer","author":[{"last_name":"Miklosi","full_name":"Miklosi, Andras","first_name":"Andras"},{"full_name":"Del Favero, Giorgia","last_name":"Del Favero","first_name":"Giorgia"},{"full_name":"Bulat, Tanja","last_name":"Bulat","first_name":"Tanja"},{"first_name":"Harald","last_name":"Höger","full_name":"Höger, Harald"},{"orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"first_name":"Doris","full_name":"Marko, Doris","last_name":"Marko"},{"first_name":"Gert","full_name":"Lubec, Gert","last_name":"Lubec"}],"status":"public","abstract":[{"lang":"eng","text":"Although dopamine receptors D1 and D2 play key roles in hippocampal function, their synaptic localization within the hippocampus has not been fully elucidated. In order to understand precise functions of pre- or postsynaptic dopamine receptors (DRs), the development of protocols to differentiate pre- and postsynaptic DRs is essential. So far, most studies on determination and quantification of DRs did not discriminate between subsynaptic localization. Therefore, the aim of the study was to generate a robust workflow for the localization of DRs. This work provides the basis for future work on hippocampal DRs, in light that DRs may have different functions at pre- or postsynaptic sites. Synaptosomes from rat hippocampi isolated by a sucrose gradient protocol were prepared for super-resolution direct stochastic optical reconstruction microscopy (dSTORM) using Bassoon as a presynaptic zone and Homer1 as postsynaptic density marker. Direct labeling of primary validated antibodies against dopamine receptors D1 (D1R) and D2 (D2R) with Alexa Fluor 594 enabled unequivocal assignment of D1R and D2R to both, pre- and postsynaptic sites. D1R immunoreactivity clusters were observed within the presynaptic active zone as well as at perisynaptic sites at the edge of the presynaptic active zone. The results may be useful for the interpretation of previous studies and the design of future work on DRs in the hippocampus. Moreover, the reduction of the complexity of brain tissue by the use of synaptosomal preparations and dSTORM technology may represent a useful tool for synaptic localization of brain proteins."}],"scopus_import":"1","date_updated":"2023-09-19T09:58:11Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes","page":"4857 – 4869","publist_id":"6991","citation":{"ista":"Miklosi A, Del Favero G, Bulat T, Höger H, Shigemoto R, Marko D, Lubec G. 2018. Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology. 55(6), 4857 – 4869.","short":"A. Miklosi, G. Del Favero, T. Bulat, H. Höger, R. Shigemoto, D. Marko, G. Lubec, Molecular Neurobiology 55 (2018) 4857 – 4869.","ieee":"A. Miklosi et al., “Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes,” Molecular Neurobiology, vol. 55, no. 6. Springer, pp. 4857 – 4869, 2018.","ama":"Miklosi A, Del Favero G, Bulat T, et al. Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology. 2018;55(6):4857 – 4869. doi:10.1007/s12035-017-0688-y","mla":"Miklosi, Andras, et al. “Super Resolution Microscopical Localization of Dopamine Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology, vol. 55, no. 6, Springer, 2018, pp. 4857 – 4869, doi:10.1007/s12035-017-0688-y.","chicago":"Miklosi, Andras, Giorgia Del Favero, Tanja Bulat, Harald Höger, Ryuichi Shigemoto, Doris Marko, and Gert Lubec. “Super Resolution Microscopical Localization of Dopamine Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology. Springer, 2018. https://doi.org/10.1007/s12035-017-0688-y.","apa":"Miklosi, A., Del Favero, G., Bulat, T., Höger, H., Shigemoto, R., Marko, D., & Lubec, G. (2018). Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology. Springer. https://doi.org/10.1007/s12035-017-0688-y"},"date_created":"2018-12-11T11:48:02Z","quality_controlled":"1","article_processing_charge":"No","doi":"10.1007/s12035-017-0688-y","intvolume":" 55","date_published":"2018-06-01T00:00:00Z","volume":55,"publication":"Molecular Neurobiology","day":"01"},{"conference":{"name":"EDBT: Conference on Extending Database Technology","start_date":"2018-03-26","location":"Vienna, Austria","end_date":"2018-03-29"},"quality_controlled":"1","citation":{"ama":"Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In: Proceedings of the 21st International Conference on Extending Database Technology. OpenProceedings; 2018:145-156. doi:10.5441/002/EDBT.2018.14","ieee":"D. Grubic, L. Tam, D.-A. Alistarh, and C. Zhang, “Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study,” in Proceedings of the 21st International Conference on Extending Database Technology, Vienna, Austria, 2018, pp. 145–156.","ista":"Grubic D, Tam L, Alistarh D-A, Zhang C. 2018. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. Proceedings of the 21st International Conference on Extending Database Technology. EDBT: Conference on Extending Database Technology, 145–156.","short":"D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–156.","apa":"Grubic, D., Tam, L., Alistarh, D.-A., & Zhang, C. (2018). Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In Proceedings of the 21st International Conference on Extending Database Technology (pp. 145–156). Vienna, Austria: OpenProceedings. https://doi.org/10.5441/002/EDBT.2018.14","chicago":"Grubic, Demjan, Leo Tam, Dan-Adrian Alistarh, and Ce Zhang. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” In Proceedings of the 21st International Conference on Extending Database Technology, 145–56. OpenProceedings, 2018. https://doi.org/10.5441/002/EDBT.2018.14.","mla":"Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–56, doi:10.5441/002/EDBT.2018.14."},"date_created":"2019-11-26T14:19:11Z","oa":1,"title":"Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study","page":"145-156","date_published":"2018-03-26T00:00:00Z","has_accepted_license":"1","day":"26","publication":"Proceedings of the 21st International Conference on Extending Database Technology","article_processing_charge":"No","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"file_date_updated":"2020-07-14T12:47:49Z","doi":"10.5441/002/EDBT.2018.14","_id":"7116","publication_status":"published","oa_version":"Published Version","type":"conference","file":[{"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:47:49Z","file_size":1603204,"checksum":"ec979b56abc71016d6e6adfdadbb4afe","date_created":"2019-11-26T14:23:04Z","file_name":"2018_OpenProceedings_Grubic.pdf","file_id":"7118","creator":"dernst","relation":"main_file"}],"ddc":["000"],"publisher":"OpenProceedings","department":[{"_id":"DaAl"}],"year":"2018","month":"03","publication_identifier":{"isbn":["9783893180783"],"issn":["2367-2005"]},"scopus_import":1,"abstract":[{"lang":"eng","text":"Training deep learning models has received tremendous research interest recently. In particular, there has been intensive research on reducing the communication cost of training when using multiple computational devices, through reducing the precision of the underlying data representation. Naturally, such methods induce system trade-offs—lowering communication precision could de-crease communication overheads and improve scalability; but, on the other hand, it can also reduce the accuracy of training. In this paper, we study this trade-off space, and ask:Can low-precision communication consistently improve the end-to-end performance of training modern neural networks, with no accuracy loss?From the performance point of view, the answer to this question may appear deceptively easy: compressing communication through low precision should help when the ratio between communication and computation is high. However, this answer is less straightforward when we try to generalize this principle across various neural network architectures (e.g., AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g., EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL), and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is not clear how a realistic realization of all these factors maps to the speed up provided by low-precision communication. In this paper, we conduct an empirical study to answer this question and report the insights."}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:59:17Z","author":[{"first_name":"Demjan","full_name":"Grubic, Demjan","last_name":"Grubic"},{"last_name":"Tam","full_name":"Tam, Leo","first_name":"Leo"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"first_name":"Ce","full_name":"Zhang, Ce","last_name":"Zhang"}],"status":"public","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/"},{"month":"01","year":"2018","publication_identifier":{"isbn":["9781611975031"]},"isi":1,"department":[{"_id":"DaAl"}],"publisher":"ACM","external_id":{"isi":["000483921200145"],"arxiv":["1704.04947"]},"publication_status":"published","_id":"7123","oa_version":"Preprint","type":"conference","status":"public","author":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"first_name":"James","last_name":"Aspnes","full_name":"Aspnes, James"},{"first_name":"Rati","last_name":"Gelashvili","full_name":"Gelashvili, Rati"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"date_updated":"2023-09-19T15:03:16Z","main_file_link":[{"url":"https://arxiv.org/abs/1704.04947","open_access":"1"}],"abstract":[{"lang":"eng","text":"Population protocols are a popular model of distributed computing, in which n agents with limited local state interact randomly, and cooperate to collectively compute global predicates. Inspired by recent developments in DNA programming, an extensive series of papers, across different communities, has examined the computability and complexity characteristics of this model. Majority, or consensus, is a central task in this model, in which agents need to collectively reach a decision as to which one of two states A or B had a higher initial count. Two metrics are important: the time that a protocol requires to stabilize to an output decision, and the state space size that each agent requires to do so. It is known that majority requires Ω(log log n) states per agent to allow for fast (poly-logarithmic time) stabilization, and that O(log2 n) states are sufficient. Thus, there is an exponential gap between the space upper and lower bounds for this problem. This paper addresses this question.\r\n\r\nOn the negative side, we provide a new lower bound of Ω(log n) states for any protocol which stabilizes in O(n1–c) expected time, for any constant c > 0. This result is conditional on monotonicity and output assumptions, satisfied by all known protocols. Technically, it represents a departure from previous lower bounds, in that it does not rely on the existence of dense configurations. Instead, we introduce a new generalized surgery technique to prove the existence of incorrect executions for any algorithm which would contradict the lower bound. Subsequently, our lower bound also applies to general initial configurations, including ones with a leader. On the positive side, we give a new algorithm for majority which uses O(log n) states, and stabilizes in O(log2 n) expected time. Central to the algorithm is a new leaderless phase clock technique, which allows agents to synchronize in phases of Θ(n log n) consecutive interactions using O(log n) states per agent, exploiting a new connection between population protocols and power-of-two-choices load balancing mechanisms. We also employ our phase clock to build a leader election algorithm with a state space of size O(log n), which stabilizes in O(log2 n) expected time."}],"page":"2221-2239","title":"Space-optimal majority in population protocols","oa":1,"arxiv":1,"quality_controlled":"1","conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2018-01-07","end_date":"2018-01-10","location":"New Orleans, LA, United States"},"date_created":"2019-11-26T15:10:55Z","citation":{"ieee":"D.-A. Alistarh, J. Aspnes, and R. Gelashvili, “Space-optimal majority in population protocols,” in Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 2221–2239.","short":"D.-A. Alistarh, J. Aspnes, R. Gelashvili, in:, Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–2239.","ista":"Alistarh D-A, Aspnes J, Gelashvili R. 2018. Space-optimal majority in population protocols. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2221–2239.","ama":"Alistarh D-A, Aspnes J, Gelashvili R. Space-optimal majority in population protocols. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM; 2018:2221-2239. doi:10.1137/1.9781611975031.144","mla":"Alistarh, Dan-Adrian, et al. “Space-Optimal Majority in Population Protocols.” Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–39, doi:10.1137/1.9781611975031.144.","chicago":"Alistarh, Dan-Adrian, James Aspnes, and Rati Gelashvili. “Space-Optimal Majority in Population Protocols.” In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, 2221–39. ACM, 2018. https://doi.org/10.1137/1.9781611975031.144.","apa":"Alistarh, D.-A., Aspnes, J., & Gelashvili, R. (2018). Space-optimal majority in population protocols. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2221–2239). New Orleans, LA, United States: ACM. https://doi.org/10.1137/1.9781611975031.144"},"doi":"10.1137/1.9781611975031.144","article_processing_charge":"No","publication":"Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms","day":"30","date_published":"2018-01-30T00:00:00Z"},{"title":"How to escape local optima in black box optimisation when non elitism outperforms elitism","publist_id":"6957","page":"1604 - 1633","quality_controlled":"1","citation":{"mla":"Oliveto, Pietro, et al. “How to Escape Local Optima in Black Box Optimisation When Non Elitism Outperforms Elitism.” Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1604–33, doi:10.1007/s00453-017-0369-2.","apa":"Oliveto, P., Paixao, T., Pérez Heredia, J., Sudholt, D., & Trubenova, B. (2018). How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. Springer. https://doi.org/10.1007/s00453-017-0369-2","chicago":"Oliveto, Pietro, Tiago Paixao, Jorge Pérez Heredia, Dirk Sudholt, and Barbora Trubenova. “How to Escape Local Optima in Black Box Optimisation When Non Elitism Outperforms Elitism.” Algorithmica. Springer, 2018. https://doi.org/10.1007/s00453-017-0369-2.","ama":"Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. 2018;80(5):1604-1633. doi:10.1007/s00453-017-0369-2","ista":"Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. 2018. How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. 80(5), 1604–1633.","short":"P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, B. Trubenova, Algorithmica 80 (2018) 1604–1633.","ieee":"P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, and B. Trubenova, “How to escape local optima in black box optimisation when non elitism outperforms elitism,” Algorithmica, vol. 80, no. 5. Springer, pp. 1604–1633, 2018."},"date_created":"2018-12-11T11:48:09Z","oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"No","ec_funded":1,"file_date_updated":"2020-07-14T12:47:54Z","doi":"10.1007/s00453-017-0369-2","date_published":"2018-05-01T00:00:00Z","intvolume":" 80","has_accepted_license":"1","day":"01","publication":"Algorithmica","volume":80,"department":[{"_id":"NiBa"},{"_id":"CaGu"}],"project":[{"grant_number":"618091","call_identifier":"FP7","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425"}],"month":"05","year":"2018","isi":1,"external_id":{"isi":["000428239300010"]},"publication_status":"published","_id":"723","issue":"5","ddc":["576"],"type":"journal_article","file":[{"creator":"system","file_id":"4674","relation":"main_file","file_name":"IST-2018-1014-v1+1_2018_Paixao_Escape.pdf","file_size":691245,"checksum":"7d92f5d7be81e387edeec4f06442791c","date_created":"2018-12-12T10:08:14Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:54Z"}],"oa_version":"Published Version","publisher":"Springer","pubrep_id":"1014","status":"public","author":[{"first_name":"Pietro","full_name":"Oliveto, Pietro","last_name":"Oliveto"},{"orcid":"0000-0003-2361-3953","full_name":"Paixao, Tiago","last_name":"Paixao","first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jorge","last_name":"Pérez Heredia","full_name":"Pérez Heredia, Jorge"},{"last_name":"Sudholt","full_name":"Sudholt, Dirk","first_name":"Dirk"},{"first_name":"Barbora","id":"42302D54-F248-11E8-B48F-1D18A9856A87","full_name":"Trubenova, Barbora","last_name":"Trubenova","orcid":"0000-0002-6873-2967"}],"scopus_import":"1","abstract":[{"text":"Escaping local optima is one of the major obstacles to function optimisation. Using the metaphor of a fitness landscape, local optima correspond to hills separated by fitness valleys that have to be overcome. We define a class of fitness valleys of tunable difficulty by considering their length, representing the Hamming path between the two optima and their depth, the drop in fitness. For this function class we present a runtime comparison between stochastic search algorithms using different search strategies. The (1+1) EA is a simple and well-studied evolutionary algorithm that has to jump across the valley to a point of higher fitness because it does not accept worsening moves (elitism). In contrast, the Metropolis algorithm and the Strong Selection Weak Mutation (SSWM) algorithm, a famous process in population genetics, are both able to cross the fitness valley by accepting worsening moves. We show that the runtime of the (1+1) EA depends critically on the length of the valley while the runtimes of the non-elitist algorithms depend crucially on the depth of the valley. Moreover, we show that both SSWM and Metropolis can also efficiently optimise a rugged function consisting of consecutive valleys.","lang":"eng"}],"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-11T14:11:35Z"},{"pubrep_id":"960","publisher":"Springer","issue":"1","_id":"738","publication_status":"published","external_id":{"isi":["000419955500006"]},"oa_version":"Published Version","type":"journal_article","file":[{"content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:56Z","file_size":1163507,"checksum":"c2590ef160709d8054cf29ee173f1454","date_created":"2018-12-12T10:17:14Z","file_name":"IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf","creator":"system","file_id":"5267","relation":"main_file"}],"ddc":["000"],"month":"01","year":"2018","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"isi":1,"department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-27T12:52:38Z","scopus_import":"1","abstract":[{"text":"This paper is devoted to automatic competitive analysis of real-time scheduling algorithms for firm-deadline tasksets, where only completed tasks con- tribute some utility to the system. Given such a taskset T , the competitive ratio of an on-line scheduling algorithm A for T is the worst-case utility ratio of A over the utility achieved by a clairvoyant algorithm. We leverage the theory of quantitative graph games to address the competitive analysis and competitive synthesis problems. For the competitive analysis case, given any taskset T and any finite-memory on- line scheduling algorithm A , we show that the competitive ratio of A in T can be computed in polynomial time in the size of the state space of A . Our approach is flexible as it also provides ways to model meaningful constraints on the released task sequences that determine the competitive ratio. We provide an experimental study of many well-known on-line scheduling algorithms, which demonstrates the feasibility of our competitive analysis approach that effectively replaces human ingenuity (required Preliminary versions of this paper have appeared in Chatterjee et al. ( 2013 , 2014 ). B Andreas Pavlogiannis pavlogiannis@ist.ac.at Krishnendu Chatterjee krish.chat@ist.ac.at Alexander Kößler koe@ecs.tuwien.ac.at Ulrich Schmid s@ecs.tuwien.ac.at 1 IST Austria (Institute of Science and Technology Austria), Am Campus 1, 3400 Klosterneuburg, Austria 2 Embedded Computing Systems Group, Vienna University of Technology, Treitlstrasse 3, 1040 Vienna, Austria 123 Real-Time Syst for finding worst-case scenarios) by computing power. For the competitive synthesis case, we are just given a taskset T , and the goal is to automatically synthesize an opti- mal on-line scheduling algorithm A , i.e., one that guarantees the largest competitive ratio possible for T . We show how the competitive synthesis problem can be reduced to a two-player graph game with partial information, and establish that the compu- tational complexity of solving this game is Np -complete. The competitive synthesis problem is hence in Np in the size of the state space of the non-deterministic labeled transition system encoding the taskset. Overall, the proposed framework assists in the selection of suitable scheduling algorithms for a given taskset, which is in fact the most common situation in real-time systems design. ","lang":"eng"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2820"}]},"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas"},{"full_name":"Kößler, Alexander","last_name":"Kößler","first_name":"Alexander"},{"full_name":"Schmid, Ulrich","last_name":"Schmid","first_name":"Ulrich"}],"status":"public","oa":1,"quality_controlled":"1","citation":{"ista":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.","ieee":"K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1. Springer, pp. 166–207, 2018.","short":"K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54 (2018) 166–207.","ama":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 2018;54(1):166-207. doi:10.1007/s11241-017-9293-4","mla":"Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems, vol. 54, no. 1, Springer, 2018, pp. 166–207, doi:10.1007/s11241-017-9293-4.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4.","apa":"Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. Springer. https://doi.org/10.1007/s11241-017-9293-4"},"date_created":"2018-12-11T11:48:14Z","page":"166 - 207","publist_id":"6929","title":"Automated competitive analysis of real time scheduling with graph games","volume":54,"day":"01","publication":"Real-Time Systems","date_published":"2018-01-01T00:00:00Z","has_accepted_license":"1","intvolume":" 54","file_date_updated":"2020-07-14T12:47:56Z","doi":"10.1007/s11241-017-9293-4","article_processing_charge":"No","ec_funded":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"}],"status":"public","abstract":[{"lang":"eng","text":"Proofs of space (PoS) [Dziembowski et al., CRYPTO'15] are proof systems where a prover can convince a verifier that he \"wastes\" disk space. PoS were introduced as a more ecological and economical replacement for proofs of work which are currently used to secure blockchains like Bitcoin. In this work we investigate extensions of PoS which allow the prover to embed useful data into the dedicated space, which later can be recovered. Our first contribution is a security proof for the original PoS from CRYPTO'15 in the random oracle model (the original proof only applied to a restricted class of adversaries which can store a subset of the data an honest prover would store). When this PoS is instantiated with recent constructions of maximally depth robust graphs, our proof implies basically optimal security. As a second contribution we show three different extensions of this PoS where useful data can be embedded into the space required by the prover. Our security proof for the PoS extends (non-trivially) to these constructions. We discuss how some of these variants can be used as proofs of catalytic space (PoCS), a notion we put forward in this work, and which basically is a PoS where most of the space required by the prover can be used to backup useful data. Finally we discuss how one of the extensions is a candidate construction for a proof of replication (PoR), a proof system recently suggested in the Filecoin whitepaper. "}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/194"}],"scopus_import":1,"date_updated":"2021-01-12T08:13:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"publication_identifier":{"isbn":["978-3-95977-095-8"],"issn":["1868-8969"]},"year":"2018","month":"12","project":[{"grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"ddc":["000"],"oa_version":"Published Version","type":"conference","file":[{"file_name":"2018_LIPIcs_Pietrzak.pdf","relation":"main_file","file_id":"7443","creator":"dernst","date_updated":"2020-07-14T12:47:57Z","access_level":"open_access","content_type":"application/pdf","date_created":"2020-02-04T08:17:52Z","file_size":822884,"checksum":"5cebb7f7849a3beda898f697d755dd96"}],"_id":"7407","alternative_title":["LIPIcs"],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_processing_charge":"No","ec_funded":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.4230/LIPICS.ITCS.2019.59","file_date_updated":"2020-07-14T12:47:57Z","intvolume":" 124","has_accepted_license":"1","date_published":"2018-12-31T00:00:00Z","volume":124,"day":"31","publication":"10th Innovations in Theoretical Computer Science Conference (ITCS 2019)","title":"Proofs of catalytic space","page":"59:1-59:25","citation":{"ista":"Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). ITCS: Innovations in theoretical Computer Science Conference, LIPIcs, vol. 124, 59:1-59:25.","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.","ieee":"K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), San Diego, CA, United States, 2018, vol. 124, p. 59:1-59:25.","ama":"Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59","chicago":"Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 124:59:1-59:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59.","apa":"Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.59","mla":"Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59."},"date_created":"2020-01-30T09:16:05Z","conference":{"location":"San Diego, CA, United States","end_date":"2019-01-12","start_date":"2019-01-10","name":"ITCS: Innovations in theoretical Computer Science Conference"},"quality_controlled":"1","oa":1},{"project":[{"grant_number":"PP00P2_138948","_id":"25FA3206-B435-11E9-9278-68D0E5697425","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics"}],"month":"08","year":"2018","isi":1,"department":[{"_id":"UlWa"}],"publisher":"Springer","pubrep_id":"912","external_id":{"isi":["000437122700017"]},"publication_status":"published","_id":"742","issue":"1","ddc":["514","516"],"type":"journal_article","oa_version":"Published Version","file":[{"file_name":"s10711-017-0291-4.pdf","file_id":"5835","creator":"kschuh","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:47:58Z","checksum":"d2f70fc132156504aa4c626aa378a7ab","file_size":412486,"date_created":"2019-01-15T13:44:05Z"}],"status":"public","author":[{"last_name":"Dotterrer","full_name":"Dotterrer, Dominic","first_name":"Dominic"},{"full_name":"Kaufman, Tali","last_name":"Kaufman","first_name":"Tali"},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"date_updated":"2023-09-27T12:29:57Z","scopus_import":"1","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1378"}]},"abstract":[{"lang":"eng","text":"We give a detailed and easily accessible proof of Gromov’s Topological Overlap Theorem. Let X be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension d. Informally, the theorem states that if X has sufficiently strong higher-dimensional expansion properties (which generalize edge expansion of graphs and are defined in terms of cellular cochains of X) then X has the following topological overlap property: for every continuous map (Formula presented.) there exists a point (Formula presented.) that is contained in the images of a positive fraction (Formula presented.) of the d-cells of X. More generally, the conclusion holds if (Formula presented.) is replaced by any d-dimensional piecewise-linear manifold M, with a constant (Formula presented.) that depends only on d and on the expansion properties of X, but not on M."}],"publist_id":"6925","page":"307–317","title":"On expansion and topological overlap","oa":1,"quality_controlled":"1","date_created":"2018-12-11T11:48:16Z","citation":{"apa":"Dotterrer, D., Kaufman, T., & Wagner, U. (2018). On expansion and topological overlap. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0291-4","chicago":"Dotterrer, Dominic, Tali Kaufman, and Uli Wagner. “On Expansion and Topological Overlap.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0291-4.","mla":"Dotterrer, Dominic, et al. “On Expansion and Topological Overlap.” Geometriae Dedicata, vol. 195, no. 1, Springer, 2018, pp. 307–317, doi:10.1007/s10711-017-0291-4.","ama":"Dotterrer D, Kaufman T, Wagner U. On expansion and topological overlap. Geometriae Dedicata. 2018;195(1):307–317. doi:10.1007/s10711-017-0291-4","ieee":"D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,” Geometriae Dedicata, vol. 195, no. 1. Springer, pp. 307–317, 2018.","short":"D. Dotterrer, T. Kaufman, U. Wagner, Geometriae Dedicata 195 (2018) 307–317.","ista":"Dotterrer D, Kaufman T, Wagner U. 2018. On expansion and topological overlap. Geometriae Dedicata. 195(1), 307–317."},"file_date_updated":"2020-07-14T12:47:58Z","doi":"10.1007/s10711-017-0291-4","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"Yes (via OA deal)","day":"01","publication":"Geometriae Dedicata","volume":195,"date_published":"2018-08-01T00:00:00Z","intvolume":" 195","has_accepted_license":"1"},{"day":"13","date_updated":"2023-12-18T10:51:02Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.03057"}],"related_material":{"record":[{"id":"8156","relation":"dissertation_contains","status":"public"}]},"abstract":[{"text":"We prove that any convex body in the plane can be partitioned into m convex parts of equal areas and perimeters for any integer m≥2; this result was previously known for prime powers m=pk. We also give a higher-dimensional generalization.","lang":"eng"}],"date_published":"2018-09-13T00:00:00Z","doi":"10.48550/arXiv.1804.03057","status":"public","article_processing_charge":"No","author":[{"first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy","last_name":"Akopyan","orcid":"0000-0002-2548-617X"},{"full_name":"Avvakumov, Sergey","last_name":"Avvakumov","first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Roman","last_name":"Karasev","full_name":"Karasev, Roman"}],"ec_funded":1,"publisher":"arXiv","oa":1,"article_number":"1804.03057","type":"preprint","oa_version":"Preprint","citation":{"short":"A. Akopyan, S. Avvakumov, R. Karasev, (2018).","ista":"Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary number of pieces. 1804.03057.","ieee":"A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary number of pieces.” arXiv, 2018.","ama":"Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number of pieces. 2018. doi:10.48550/arXiv.1804.03057","chicago":"Akopyan, Arseniy, Sergey Avvakumov, and Roman Karasev. “Convex Fair Partitions into Arbitrary Number of Pieces.” arXiv, 2018. https://doi.org/10.48550/arXiv.1804.03057.","apa":"Akopyan, A., Avvakumov, S., & Karasev, R. (2018). Convex fair partitions into arbitrary number of pieces. arXiv. https://doi.org/10.48550/arXiv.1804.03057","mla":"Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of Pieces. 1804.03057, arXiv, 2018, doi:10.48550/arXiv.1804.03057."},"date_created":"2018-12-11T11:44:30Z","publication_status":"published","arxiv":1,"external_id":{"arxiv":["1804.03057"]},"_id":"75","project":[{"call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"}],"year":"2018","month":"09","department":[{"_id":"HeEd"},{"_id":"JaMa"}],"title":"Convex fair partitions into arbitrary number of pieces"},{"citation":{"ista":"Lenzen C, Rybicki J. 2018. Near-optimal self-stabilising counting and firing squads. Distributed Computing.","short":"C. Lenzen, J. Rybicki, Distributed Computing (2018).","ieee":"C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” Distributed Computing. Springer, 2018.","ama":"Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads. Distributed Computing. 2018. doi:10.1007/s00446-018-0342-6","mla":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing, Springer, 2018, doi:10.1007/s00446-018-0342-6.","chicago":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-018-0342-6.","apa":"Lenzen, C., & Rybicki, J. (2018). Near-optimal self-stabilising counting and firing squads. Distributed Computing. Springer. https://doi.org/10.1007/s00446-018-0342-6"},"date_created":"2018-12-11T11:44:30Z","quality_controlled":"1","oa":1,"title":"Near-optimal self-stabilising counting and firing squads","publist_id":"7978","has_accepted_license":"1","date_published":"2018-09-12T00:00:00Z","publication":"Distributed Computing","day":"12","article_processing_charge":"Yes (via OA deal)","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1007/s00446-018-0342-6","file_date_updated":"2020-07-14T12:48:01Z","file":[{"file_name":"2018_DistributedComputing_Lenzen.pdf","file_id":"5711","creator":"dernst","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:48:01Z","checksum":"872db70bba9b401500abe3c6ae2f1a61","file_size":799337,"date_created":"2018-12-17T14:21:22Z"}],"oa_version":"Published Version","type":"journal_article","ddc":["000"],"_id":"76","external_id":{"isi":["000475627800005"]},"publication_status":"published","publisher":"Springer","department":[{"_id":"DaAl"}],"isi":1,"year":"2018","month":"09","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"abstract":[{"text":"Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a counter that is increased by one modulo C in each round for given C>1. In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external “go” signal as input, then all correct nodes should agree on a round (in the not-too-distant future) in which to jointly output a “fire” signal. Moreover, no node should generate a “fire” signal without some correct node having previously received a “go” signal as input. We present a framework reducing both tasks to binary consensus at very small cost. For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f<n/3, asymptotically optimal stabilisation and response time O(f), and message size O(log f). As our framework does not restrict the type of consensus routines used, we also obtain efficient randomised solutions.","lang":"eng"}],"scopus_import":"1","date_updated":"2023-09-13T09:01:06Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Christoph","last_name":"Lenzen","full_name":"Lenzen, Christoph"},{"orcid":"0000-0002-6432-6646","last_name":"Rybicki","full_name":"Rybicki, Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel"}],"status":"public"},{"oa":1,"quality_controlled":"1","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"citation":{"mla":"Watzinger, Hannes, et al. “A Germanium Hole Spin Qubit.” Nature Communications, vol. 9, no. 3902, Nature Publishing Group, 2018, doi:10.1038/s41467-018-06418-4.","apa":"Watzinger, H., Kukucka, J., Vukušić, L., Gao, F., Wang, T., Schäffler, F., … Katsaros, G. (2018). A germanium hole spin qubit. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-018-06418-4","chicago":"Watzinger, Hannes, Josip Kukucka, Lada Vukušić, Fei Gao, Ting Wang, Friedrich Schäffler, Jian Zhang, and Georgios Katsaros. “A Germanium Hole Spin Qubit.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-06418-4.","ama":"Watzinger H, Kukucka J, Vukušić L, et al. A germanium hole spin qubit. Nature Communications. 2018;9(3902). doi:10.1038/s41467-018-06418-4","ista":"Watzinger H, Kukucka J, Vukušić L, Gao F, Wang T, Schäffler F, Zhang J, Katsaros G. 2018. A germanium hole spin qubit. Nature Communications. 9(3902).","short":"H. Watzinger, J. Kukucka, L. Vukušić, F. Gao, T. Wang, F. Schäffler, J. Zhang, G. Katsaros, Nature Communications 9 (2018).","ieee":"H. Watzinger et al., “A germanium hole spin qubit,” Nature Communications, vol. 9, no. 3902. Nature Publishing Group, 2018."},"date_created":"2018-12-11T11:44:30Z","title":"A germanium hole spin qubit","day":"25","publication":"Nature Communications","volume":9,"date_published":"2018-09-25T00:00:00Z","has_accepted_license":"1","intvolume":" 9","file_date_updated":"2020-07-14T12:48:02Z","doi":"10.1038/s41467-018-06418-4","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"Yes","ec_funded":1,"publisher":"Nature Publishing Group","publication_status":"published","external_id":{"isi":["000445560800010"]},"issue":"3902 ","_id":"77","ddc":["530"],"oa_version":"Published Version","type":"journal_article","file":[{"creator":"dernst","file_id":"5687","relation":"main_file","file_name":"2018_NatureComm_Watzinger.pdf","checksum":"e7148c10a64497e279c4de570b6cc544","file_size":1063469,"date_created":"2018-12-17T10:28:30Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:48:02Z"}],"project":[{"name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","call_identifier":"FP7","_id":"25517E86-B435-11E9-9278-68D0E5697425","grant_number":"335497"},{"grant_number":"Y00715","_id":"2552F888-B435-11E9-9278-68D0E5697425","name":"Loch Spin-Qubits und Majorana-Fermionen in Germanium","call_identifier":"FWF"}],"month":"09","year":"2018","isi":1,"article_type":"original","department":[{"_id":"GeKa"}],"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-08T11:44:02Z","scopus_import":"1","related_material":{"record":[{"relation":"popular_science","id":"7977"},{"status":"public","relation":"dissertation_contains","id":"7996"}]},"abstract":[{"text":"Holes confined in quantum dots have gained considerable interest in the past few years due to their potential as spin qubits. Here we demonstrate two-axis control of a spin 3/2 qubit in natural Ge. The qubit is formed in a hut wire double quantum dot device. The Pauli spin blockade principle allowed us to demonstrate electric dipole spin resonance by applying a radio frequency electric field to one of the electrodes defining the double quantum dot. Coherent hole spin oscillations with Rabi frequencies reaching 140 MHz are demonstrated and dephasing times of 130 ns are measured. The reported results emphasize the potential of Ge as a platform for fast and electrically tunable hole spin qubit devices.","lang":"eng"}],"status":"public","author":[{"first_name":"Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","last_name":"Watzinger","full_name":"Watzinger, Hannes"},{"first_name":"Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","full_name":"Kukucka, Josip","last_name":"Kukucka"},{"last_name":"Vukusic","full_name":"Vukusic, Lada","orcid":"0000-0003-2424-8636","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","first_name":"Lada"},{"first_name":"Fei","last_name":"Gao","full_name":"Gao, Fei"},{"full_name":"Wang, Ting","last_name":"Wang","first_name":"Ting"},{"last_name":"Schäffler","full_name":"Schäffler, Friedrich","first_name":"Friedrich"},{"full_name":"Zhang, Jian","last_name":"Zhang","first_name":"Jian"},{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","orcid":"0000-0001-8342-202X","last_name":"Katsaros","full_name":"Katsaros, Georgios"}]},{"intvolume":" 10","abstract":[{"lang":"eng","text":"Inhibition of the endoplasmic reticulum stress pathway may hold the key to Zika virus-associated microcephaly treatment. "}],"date_published":"2018-01-10T00:00:00Z","scopus_import":1,"day":"10","publication":"Science Translational Medicine","volume":10,"date_updated":"2021-01-12T07:59:42Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"status":"public","author":[{"first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178"}],"doi":"10.1126/scitranslmed.aar7514","oa_version":"None","type":"journal_article","date_created":"2018-12-11T11:46:34Z","citation":{"ama":"Novarino G. Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. 2018;10(423). doi:10.1126/scitranslmed.aar7514","ieee":"G. Novarino, “Zika-associated microcephaly: Reduce the stress and race for the treatment,” Science Translational Medicine, vol. 10, no. 423. American Association for the Advancement of Science, 2018.","short":"G. Novarino, Science Translational Medicine 10 (2018).","ista":"Novarino G. 2018. Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. 10(423), eaar7514.","mla":"Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race for the Treatment.” Science Translational Medicine, vol. 10, no. 423, eaar7514, American Association for the Advancement of Science, 2018, doi:10.1126/scitranslmed.aar7514.","apa":"Novarino, G. (2018). Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aar7514","chicago":"Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race for the Treatment.” Science Translational Medicine. American Association for the Advancement of Science, 2018. https://doi.org/10.1126/scitranslmed.aar7514."},"publication_status":"published","quality_controlled":"1","issue":"423","_id":"456","publisher":"American Association for the Advancement of Science","article_number":"eaar7514","department":[{"_id":"GaNo"}],"title":"Zika-associated microcephaly: Reduce the stress and race for the treatment","publist_id":"7365","year":"2018","month":"01"}]