[{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","alternative_title":["ISTA Thesis"],"degree_awarded":"PhD","citation":{"short":"M. Iglesias Ham, Multiple Covers with Balls, Institute of Science and Technology Austria, 2018.","mla":"Iglesias Ham, Mabel. <i>Multiple Covers with Balls</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_1026\">10.15479/AT:ISTA:th_1026</a>.","ieee":"M. Iglesias Ham, “Multiple covers with balls,” Institute of Science and Technology Austria, 2018.","ista":"Iglesias Ham M. 2018. Multiple covers with balls. Institute of Science and Technology Austria.","chicago":"Iglesias Ham, Mabel. “Multiple Covers with Balls.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th_1026\">https://doi.org/10.15479/AT:ISTA:th_1026</a>.","ama":"Iglesias Ham M. Multiple covers with balls. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_1026\">10.15479/AT:ISTA:th_1026</a>","apa":"Iglesias Ham, M. (2018). <i>Multiple covers with balls</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_1026\">https://doi.org/10.15479/AT:ISTA:th_1026</a>"},"date_updated":"2023-09-07T12:25:32Z","department":[{"_id":"HeEd"}],"title":"Multiple covers with balls","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:45:24Z","date_published":"2018-06-11T00:00:00Z","ddc":["514","516"],"abstract":[{"text":"We describe arrangements of three-dimensional spheres from a geometrical and topological point of view. Real data (fitting this setup) often consist of soft spheres which show certain degree of deformation while strongly packing against each other. In this context, we answer the following questions: If we model a soft packing of spheres by hard spheres that are allowed to overlap, can we measure the volume in the overlapped areas? Can we be more specific about the overlap volume, i.e. quantify how much volume is there covered exactly twice, three times, or k times? What would be a good optimization criteria that rule the arrangement of soft spheres while making a good use of the available space? Fixing a particular criterion, what would be the optimal sphere configuration? The first result of this thesis are short formulas for the computation of volumes covered by at least k of the balls. The formulas exploit information contained in the order-k Voronoi diagrams and its closely related Level-k complex. The used complexes lead to a natural generalization into poset diagrams, a theoretical formalism that contains the order-k and degree-k diagrams as special cases. In parallel, we define different criteria to determine what could be considered an optimal arrangement from a geometrical point of view. Fixing a criterion, we find optimal soft packing configurations in 2D and 3D where the ball centers lie on a lattice. As a last step, we use tools from computational topology on real physical data, to show the potentials of higher-order diagrams in the description of melting crystals. The results of the experiments leaves us with an open window to apply the theories developed in this thesis in real applications.","lang":"eng"}],"publication_status":"published","page":"171","doi":"10.15479/AT:ISTA:th_1026","year":"2018","day":"11","oa":1,"publist_id":"7712","supervisor":[{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"}],"author":[{"first_name":"Mabel","last_name":"Iglesias Ham","full_name":"Iglesias Ham, Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","article_processing_charge":"No","language":[{"iso":"eng"}],"file":[{"relation":"source_file","access_level":"closed","file_size":11827713,"file_id":"5918","checksum":"dd699303623e96d1478a6ae07210dd05","creator":"kschuh","date_created":"2019-02-05T07:43:31Z","date_updated":"2020-07-14T12:45:24Z","content_type":"application/zip","file_name":"IST-2018-1025-v2+5_ist-thesis-iglesias-11June2018(1).zip"},{"file_name":"IST-2018-1025-v2+4_ThesisIglesiasFinal11June2018.pdf","content_type":"application/pdf","date_created":"2019-02-05T07:43:45Z","date_updated":"2020-07-14T12:45:24Z","checksum":"ba163849a190d2b41d66fef0e4983294","file_id":"5919","creator":"kschuh","access_level":"open_access","file_size":4783846,"relation":"main_file"}],"has_accepted_license":"1","month":"06","publication_identifier":{"issn":["2663-337X"]},"status":"public","_id":"201","type":"dissertation","date_created":"2018-12-11T11:45:10Z","pubrep_id":"1026"},{"month":"06","issue":"26","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":115,"quality_controlled":"1","project":[{"call_identifier":"FP7","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants"}],"oa_version":"None","author":[{"last_name":"Abbas","first_name":"Mohamad","id":"47E8FC1C-F248-11E8-B48F-1D18A9856A87","full_name":"Abbas, Mohamad"},{"full_name":"Hernández, García J","first_name":"García J","last_name":"Hernández"},{"last_name":"Pollmann","first_name":"Stephan","full_name":"Pollmann, Stephan"},{"full_name":"Samodelov, Sophia L","first_name":"Sophia L","last_name":"Samodelov"},{"full_name":"Kolb, Martina","first_name":"Martina","last_name":"Kolb"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","first_name":"Jirí","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hammes, Ulrich Z","first_name":"Ulrich Z","last_name":"Hammes"},{"full_name":"Zurbriggen, Matias D","last_name":"Zurbriggen","first_name":"Matias D"},{"first_name":"Miguel","last_name":"Blázquez","full_name":"Blázquez, Miguel"},{"full_name":"Alabadí, David","first_name":"David","last_name":"Alabadí"}],"ec_funded":1,"date_created":"2018-12-11T11:45:11Z","_id":"203","type":"journal_article","status":"public","main_file_link":[{"open_access":"1","url":"http://eprints.nottingham.ac.uk/52388/"}],"abstract":[{"text":"Asymmetric auxin distribution is instrumental for the differential growth that causes organ bending on tropic stimuli and curvatures during plant development. Local differences in auxin concentrations are achieved mainly by polarized cellular distribution of PIN auxin transporters, but whether other mechanisms involving auxin homeostasis are also relevant for the formation of auxin gradients is not clear. Here we show that auxin methylation is required for asymmetric auxin distribution across the hypocotyl, particularly during its response to gravity. We found that loss-of-function mutants in Arabidopsis IAA CARBOXYL METHYLTRANSFERASE1 (IAMT1) prematurely unfold the apical hook, and that their hypocotyls are impaired in gravitropic reorientation. This defect is linked to an auxin-dependent increase in PIN gene expression, leading to an increased polar auxin transport and lack of asymmetric distribution of PIN3 in the iamt1 mutant. Gravitropic reorientation in the iamt1 mutant could be restored with either endodermis-specific expression of IAMT1 or partial inhibition of polar auxin transport, which also results in normal PIN gene expression levels. We propose that IAA methylation is necessary in gravity-sensing cells to restrict polar auxin transport within the range of auxin levels that allow for differential responses.","lang":"eng"}],"publication_status":"published","isi":1,"date_published":"2018-06-26T00:00:00Z","publisher":"National Academy of Sciences","title":"Auxin methylation is required for differential growth in Arabidopsis","date_updated":"2025-05-07T11:12:32Z","department":[{"_id":"JiFr"}],"citation":{"ieee":"M. Abbas <i>et al.</i>, “Auxin methylation is required for differential growth in Arabidopsis,” <i>PNAS</i>, vol. 115, no. 26. National Academy of Sciences, pp. 6864–6869, 2018.","apa":"Abbas, M., Hernández, G. J., Pollmann, S., Samodelov, S. L., Kolb, M., Friml, J., … Alabadí, D. (2018). Auxin methylation is required for differential growth in Arabidopsis. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1806565115\">https://doi.org/10.1073/pnas.1806565115</a>","chicago":"Abbas, Mohamad, García J Hernández, Stephan Pollmann, Sophia L Samodelov, Martina Kolb, Jiří Friml, Ulrich Z Hammes, Matias D Zurbriggen, Miguel Blázquez, and David Alabadí. “Auxin Methylation Is Required for Differential Growth in Arabidopsis.” <i>PNAS</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1806565115\">https://doi.org/10.1073/pnas.1806565115</a>.","ama":"Abbas M, Hernández GJ, Pollmann S, et al. Auxin methylation is required for differential growth in Arabidopsis. <i>PNAS</i>. 2018;115(26):6864-6869. doi:<a href=\"https://doi.org/10.1073/pnas.1806565115\">10.1073/pnas.1806565115</a>","ista":"Abbas M, Hernández GJ, Pollmann S, Samodelov SL, Kolb M, Friml J, Hammes UZ, Zurbriggen MD, Blázquez M, Alabadí D. 2018. Auxin methylation is required for differential growth in Arabidopsis. PNAS. 115(26), 6864–6869.","short":"M. Abbas, G.J. Hernández, S. Pollmann, S.L. Samodelov, M. Kolb, J. Friml, U.Z. Hammes, M.D. Zurbriggen, M. Blázquez, D. Alabadí, PNAS 115 (2018) 6864–6869.","mla":"Abbas, Mohamad, et al. “Auxin Methylation Is Required for Differential Growth in Arabidopsis.” <i>PNAS</i>, vol. 115, no. 26, National Academy of Sciences, 2018, pp. 6864–69, doi:<a href=\"https://doi.org/10.1073/pnas.1806565115\">10.1073/pnas.1806565115</a>."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000436245000096"]},"scopus_import":"1","intvolume":"       115","publist_id":"7710","publication":"PNAS","oa":1,"day":"26","page":"6864-6869","year":"2018","doi":"10.1073/pnas.1806565115"},{"article_processing_charge":"No","volume":9,"language":[{"iso":"eng"}],"issue":"1","article_number":"4605","file":[{"file_name":"2018_NatureComm_Espinoza.pdf","date_updated":"2020-07-14T12:45:28Z","date_created":"2018-12-17T15:41:57Z","content_type":"application/pdf","file_size":4651930,"access_level":"open_access","creator":"dernst","checksum":"9fe2a63bd95a5067d896c087d07998f3","file_id":"5715","relation":"main_file"}],"month":"11","has_accepted_license":"1","author":[{"full_name":"Espinoza Martinez, Claudia ","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4710-2082","last_name":"Espinoza Martinez","first_name":"Claudia "},{"full_name":"Guzmán, José","id":"30CC5506-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2209-5242","last_name":"Guzmán","first_name":"José"},{"last_name":"Zhang","first_name":"Xiaomin","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87","full_name":"Zhang, Xiaomin"},{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","first_name":"Peter M","last_name":"Jonas"}],"oa_version":"Published Version","project":[{"call_identifier":"H2020","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692"},{"name":"The Wittgenstein Prize","grant_number":"Z00312","_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"quality_controlled":"1","ec_funded":1,"status":"public","type":"journal_article","_id":"21","article_type":"original","date_created":"2018-12-11T11:44:12Z","title":"Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus","publisher":"Nature Publishing Group","date_published":"2018-11-02T00:00:00Z","file_date_updated":"2020-07-14T12:45:28Z","ddc":["570"],"isi":1,"abstract":[{"text":"Parvalbumin-positive (PV+) GABAergic interneurons in hippocampal microcircuits are thought to play a key role in several higher network functions, such as feedforward and feedback inhibition, network oscillations, and pattern separation. Fast lateral inhibition mediated by GABAergic interneurons may implement a winner-takes-all mechanism in the hippocampal input layer. However, it is not clear whether the functional connectivity rules of granule cells (GCs) and interneurons in the dentate gyrus are consistent with such a mechanism. Using simultaneous patch-clamp recordings from up to seven GCs and up to four PV+ interneurons in the dentate gyrus, we find that connectivity is structured in space, synapse-specific, and enriched in specific disynaptic motifs. In contrast to the neocortex, lateral inhibition in the dentate gyrus (in which a GC inhibits neighboring GCs via a PV+ interneuron) is ~ 10-times more abundant than recurrent inhibition (in which a GC inhibits itself). Thus, unique connectivity rules may enable the dentate gyrus to perform specific higher-order computations","lang":"eng"}],"publication_status":"published","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"external_id":{"isi":["000449069700009"]},"citation":{"apa":"Espinoza Martinez, C., Guzmán, J., Zhang, X., &#38; Jonas, P. M. (2018). Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41467-018-06899-3\">https://doi.org/10.1038/s41467-018-06899-3</a>","ista":"Espinoza Martinez C, Guzmán J, Zhang X, Jonas PM. 2018. Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. Nature Communications. 9(1), 4605.","chicago":"Espinoza Martinez, Claudia , José Guzmán, Xiaomin Zhang, and Peter M Jonas. “Parvalbumin+ Interneurons Obey Unique Connectivity Rules and Establish a Powerful Lateral-Inhibition Microcircuit in Dentate Gyrus.” <i>Nature Communications</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41467-018-06899-3\">https://doi.org/10.1038/s41467-018-06899-3</a>.","ama":"Espinoza Martinez C, Guzmán J, Zhang X, Jonas PM. Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. <i>Nature Communications</i>. 2018;9(1). doi:<a href=\"https://doi.org/10.1038/s41467-018-06899-3\">10.1038/s41467-018-06899-3</a>","ieee":"C. Espinoza Martinez, J. Guzmán, X. Zhang, and P. M. Jonas, “Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus,” <i>Nature Communications</i>, vol. 9, no. 1. Nature Publishing Group, 2018.","short":"C. Espinoza Martinez, J. Guzmán, X. Zhang, P.M. Jonas, Nature Communications 9 (2018).","mla":"Espinoza Martinez, Claudia, et al. “Parvalbumin+ Interneurons Obey Unique Connectivity Rules and Establish a Powerful Lateral-Inhibition Microcircuit in Dentate Gyrus.” <i>Nature Communications</i>, vol. 9, no. 1, 4605, Nature Publishing Group, 2018, doi:<a href=\"https://doi.org/10.1038/s41467-018-06899-3\">10.1038/s41467-018-06899-3</a>."},"date_updated":"2024-03-25T23:30:16Z","department":[{"_id":"PeJo"}],"publication":"Nature Communications","intvolume":"         9","publist_id":"8034","related_material":{"record":[{"status":"public","id":"6363","relation":"dissertation_contains"}],"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/lateral-inhibition-keeps-similar-memories-apart/"}]},"scopus_import":"1","doi":"10.1038/s41467-018-06899-3","day":"02","year":"2018","acknowledgement":"This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 692692) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award), both to P.J..","oa":1},{"type":"journal_article","_id":"22","article_type":"original","date_created":"2018-12-11T11:44:12Z","publication_identifier":{"issn":["23342536"]},"main_file_link":[{"open_access":"1","url":"www.doi.org/10.1364/OPTICA.5.001210 "}],"status":"public","issue":"10","month":"10","article_processing_charge":"No","volume":5,"language":[{"iso":"eng"}],"oa_version":"Published Version","quality_controlled":"1","author":[{"last_name":"Botello","first_name":"Gabriel","full_name":"Botello, Gabriel"},{"first_name":"Florian","last_name":"Sedlmeir","full_name":"Sedlmeir, Florian"},{"first_name":"Alfredo R","last_name":"Rueda Sanchez","orcid":"0000-0001-6249-5860","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","full_name":"Rueda Sanchez, Alfredo R"},{"first_name":"Kerlos","last_name":"Abdalmalak","full_name":"Abdalmalak, Kerlos"},{"first_name":"Elliott","last_name":"Brown","full_name":"Brown, Elliott"},{"last_name":"Leuchs","first_name":"Gerd","full_name":"Leuchs, Gerd"},{"last_name":"Preu","first_name":"Sascha","full_name":"Preu, Sascha"},{"full_name":"Segovia Vargas, Daniel","last_name":"Segovia Vargas","first_name":"Daniel"},{"full_name":"Strekalov, Dmitry","first_name":"Dmitry","last_name":"Strekalov"},{"last_name":"Munoz","first_name":"Luis","full_name":"Munoz, Luis"},{"full_name":"Schwefel, Harald","first_name":"Harald","last_name":"Schwefel"}],"scopus_import":"1","publication":"Optica","intvolume":"         5","publist_id":"8033","oa":1,"day":"20","doi":"10.1364/OPTICA.5.001210","page":"1210 - 1219","year":"2018","isi":1,"abstract":[{"lang":"eng","text":"Conventional ultra-high sensitivity detectors in the millimeter-wave range are usually cooled as their own thermal noise at room temperature would mask the weak received radiation. The need for cryogenic systems increases the cost and complexity of the instruments, hindering the development of, among others, airborne and space applications. In this work, the nonlinear parametric upconversion of millimeter-wave radiation to the optical domain inside high-quality (Q) lithium niobate whispering-gallery mode (WGM) resonators is proposed for ultra-low noise detection. We experimentally demonstrate coherent upconversion of millimeter-wave signals to a 1550 nm telecom carrier, with a photon conversion efficiency surpassing the state-of-the-art by 2 orders of magnitude. Moreover, a theoretical model shows that the thermal equilibrium of counterpropagating WGMs is broken by overcoupling the millimeter-wave WGM, effectively cooling the upconverted mode and allowing ultra-low noise detection. By theoretically estimating the sensitivity of a correlation radiometer based on the presented scheme, it is found that room-temperature radiometers with better sensitivity than state-of-the-art high-electron-mobility transistor (HEMT)-based radiometers can be designed. This detection paradigm can be used to develop room-temperature instrumentation for radio astronomy, earth observation, planetary missions, and imaging systems."}],"publication_status":"published","title":"Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters","date_published":"2018-10-20T00:00:00Z","citation":{"ieee":"G. Botello <i>et al.</i>, “Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters,” <i>Optica</i>, vol. 5, no. 10. pp. 1210–1219, 2018.","apa":"Botello, G., Sedlmeir, F., Rueda Sanchez, A. R., Abdalmalak, K., Brown, E., Leuchs, G., … Schwefel, H. (2018). Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. <i>Optica</i>. <a href=\"https://doi.org/10.1364/OPTICA.5.001210\">https://doi.org/10.1364/OPTICA.5.001210</a>","ista":"Botello G, Sedlmeir F, Rueda Sanchez AR, Abdalmalak K, Brown E, Leuchs G, Preu S, Segovia Vargas D, Strekalov D, Munoz L, Schwefel H. 2018. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. 5(10), 1210–1219.","ama":"Botello G, Sedlmeir F, Rueda Sanchez AR, et al. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. <i>Optica</i>. 2018;5(10):1210-1219. doi:<a href=\"https://doi.org/10.1364/OPTICA.5.001210\">10.1364/OPTICA.5.001210</a>","chicago":"Botello, Gabriel, Florian Sedlmeir, Alfredo R Rueda Sanchez, Kerlos Abdalmalak, Elliott Brown, Gerd Leuchs, Sascha Preu, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” <i>Optica</i>, 2018. <a href=\"https://doi.org/10.1364/OPTICA.5.001210\">https://doi.org/10.1364/OPTICA.5.001210</a>.","mla":"Botello, Gabriel, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” <i>Optica</i>, vol. 5, no. 10, 2018, pp. 1210–19, doi:<a href=\"https://doi.org/10.1364/OPTICA.5.001210\">10.1364/OPTICA.5.001210</a>.","short":"G. Botello, F. Sedlmeir, A.R. Rueda Sanchez, K. Abdalmalak, E. Brown, G. Leuchs, S. Preu, D. Segovia Vargas, D. Strekalov, L. Munoz, H. Schwefel, Optica 5 (2018) 1210–1219."},"date_updated":"2023-10-17T12:12:40Z","department":[{"_id":"JoFi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"isi":["000447853100007"]}},{"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"article_processing_charge":"No","volume":18,"month":"10","has_accepted_license":"1","issue":"11","file":[{"access_level":"open_access","file_size":1361441,"file_id":"5194","checksum":"3e6034a94c6b5335e939145d88bdb371","creator":"system","relation":"main_file","file_name":"IST-2018-1065-v1+1_ACS_nanoletters_8b03217.pdf","date_created":"2018-12-12T10:16:08Z","date_updated":"2020-07-14T12:45:37Z","content_type":"application/pdf"}],"author":[{"orcid":"0000-0003-2424-8636","first_name":"Lada","last_name":"Vukušić","full_name":"Vukušić, Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Josip","last_name":"Kukucka","full_name":"Kukucka, Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87"},{"id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","full_name":"Watzinger, Hannes","last_name":"Watzinger","first_name":"Hannes"},{"full_name":"Milem, Joshua M","id":"4CDE0A96-F248-11E8-B48F-1D18A9856A87","last_name":"Milem","first_name":"Joshua M"},{"full_name":"Schäffler, Friedrich","last_name":"Schäffler","first_name":"Friedrich"},{"first_name":"Georgios","last_name":"Katsaros","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios"}],"project":[{"_id":"25517E86-B435-11E9-9278-68D0E5697425","grant_number":"335497","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","call_identifier":"FP7"}],"quality_controlled":"1","oa_version":"Published Version","ec_funded":1,"pubrep_id":"1065","publication_identifier":{"issn":["15306984"]},"status":"public","date_created":"2018-12-11T11:44:13Z","type":"journal_article","_id":"23","file_date_updated":"2020-07-14T12:45:37Z","publisher":"American Chemical Society","date_published":"2018-10-25T00:00:00Z","pmid":1,"title":"Single-shot readout of hole spins in Ge","abstract":[{"lang":"eng","text":"The strong atomistic spin–orbit coupling of holes makes single-shot spin readout measurements difficult because it reduces the spin lifetimes. By integrating the charge sensor into a high bandwidth radio frequency reflectometry setup, we were able to demonstrate single-shot readout of a germanium quantum dot hole spin and measure the spin lifetime. Hole spin relaxation times of about 90 μs at 500 mT are reported, with a total readout visibility of about 70%. By analyzing separately the spin-to-charge conversion and charge readout fidelities, we have obtained insight into the processes limiting the visibilities of hole spins. The analyses suggest that high hole visibilities are feasible at realistic experimental conditions, underlying the potential of hole spins for the realization of viable qubit devices."}],"publication_status":"published","ddc":["530"],"isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000451102100064"],"pmid":["30359041"]},"date_updated":"2023-09-18T09:30:37Z","department":[{"_id":"GeKa"}],"citation":{"ieee":"L. Vukušić, J. Kukucka, H. Watzinger, J. M. Milem, F. Schäffler, and G. Katsaros, “Single-shot readout of hole spins in Ge,” <i>Nano Letters</i>, vol. 18, no. 11. American Chemical Society, pp. 7141–7145, 2018.","ama":"Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. Single-shot readout of hole spins in Ge. <i>Nano Letters</i>. 2018;18(11):7141-7145. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.8b03217\">10.1021/acs.nanolett.8b03217</a>","ista":"Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. 2018. Single-shot readout of hole spins in Ge. Nano Letters. 18(11), 7141–7145.","chicago":"Vukušić, Lada, Josip Kukucka, Hannes Watzinger, Joshua M Milem, Friedrich Schäffler, and Georgios Katsaros. “Single-Shot Readout of Hole Spins in Ge.” <i>Nano Letters</i>. American Chemical Society, 2018. <a href=\"https://doi.org/10.1021/acs.nanolett.8b03217\">https://doi.org/10.1021/acs.nanolett.8b03217</a>.","apa":"Vukušić, L., Kukucka, J., Watzinger, H., Milem, J. M., Schäffler, F., &#38; Katsaros, G. (2018). Single-shot readout of hole spins in Ge. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.nanolett.8b03217\">https://doi.org/10.1021/acs.nanolett.8b03217</a>","short":"L. Vukušić, J. Kukucka, H. Watzinger, J.M. Milem, F. Schäffler, G. Katsaros, Nano Letters 18 (2018) 7141–7145.","mla":"Vukušić, Lada, et al. “Single-Shot Readout of Hole Spins in Ge.” <i>Nano Letters</i>, vol. 18, no. 11, American Chemical Society, 2018, pp. 7141–45, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.8b03217\">10.1021/acs.nanolett.8b03217</a>."},"intvolume":"        18","publist_id":"8032","publication":"Nano Letters","related_material":{"record":[{"relation":"popular_science","id":"7977"},{"relation":"dissertation_contains","id":"69","status":"public"},{"status":"public","id":"7996","relation":"dissertation_contains"}]},"scopus_import":"1","day":"25","doi":"10.1021/acs.nanolett.8b03217","year":"2018","page":"7141 - 7145","oa":1},{"day":"01","page":"4692 - 4699","year":"2018","doi":"10.24963/ijcai.2018/652","acknowledgement":"This research was supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and an ERC Start Grant (279307:Graph Games).\r\n","oa":1,"intvolume":"      2018","publist_id":"8031","arxiv":1,"scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000764175404117"],"arxiv":["1804.10601"]},"citation":{"short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.","mla":"Chatterjee, Krishnendu, et al. <i>Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives</i>. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:<a href=\"https://doi.org/10.24963/ijcai.2018/652\">10.24963/ijcai.2018/652</a>.","apa":"Chatterjee, K., Elgyütt, A., Novotný, P., &#38; Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. <a href=\"https://doi.org/10.24963/ijcai.2018/652\">https://doi.org/10.24963/ijcai.2018/652</a>","chicago":"Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. <a href=\"https://doi.org/10.24963/ijcai.2018/652\">https://doi.org/10.24963/ijcai.2018/652</a>.","ista":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.","ama":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:<a href=\"https://doi.org/10.24963/ijcai.2018/652\">10.24963/ijcai.2018/652</a>","ieee":"K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699."},"date_updated":"2025-06-02T08:53:48Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","date_published":"2018-07-01T00:00:00Z","publisher":"IJCAI","isi":1,"abstract":[{"text":"Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it.","lang":"eng"}],"publication_status":"published","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1804.10601","open_access":"1"}],"type":"conference","_id":"24","date_created":"2018-12-11T11:44:13Z","ec_funded":1,"conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","location":"Stockholm, Sweden","end_date":"2018-07-19","start_date":"2018-07-13"},"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Adrian","last_name":"Elgyütt","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","full_name":"Elgyütt, Adrian"},{"full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny","first_name":"Petr"},{"last_name":"Rouillé","first_name":"Owen","full_name":"Rouillé, Owen"}],"oa_version":"Preprint","quality_controlled":"1","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"article_processing_charge":"No","volume":2018,"language":[{"iso":"eng"}],"month":"07"},{"volume":2,"article_processing_charge":"No","language":[{"iso":"eng"}],"file":[{"relation":"main_file","creator":"dernst","checksum":"383a2e2c944a856e2e821ec8e7bf71b6","file_id":"7830","file_size":1135973,"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:47:37Z","date_created":"2020-05-14T11:28:52Z","file_name":"2018_NatureEcology_Igler.pdf"}],"issue":"10","month":"09","has_accepted_license":"1","author":[{"last_name":"Igler","first_name":"Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87","full_name":"Igler, Claudia"},{"id":"345D25EC-F248-11E8-B48F-1D18A9856A87","full_name":"Lagator, Mato","first_name":"Mato","last_name":"Lagator"},{"orcid":"0000-0002-6699-1455","last_name":"Tkacik","first_name":"Gasper","full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","full_name":"Bollback, Jonathan P","first_name":"Jonathan P","last_name":"Bollback","orcid":"0000-0002-4624-4612"},{"first_name":"Calin C","last_name":"Guet","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C"}],"oa_version":"Submitted Version","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"H2020","_id":"2578D616-B435-11E9-9278-68D0E5697425","grant_number":"648440","name":"Selective Barriers to Horizontal Gene Transfer"},{"name":"Design principles underlying genetic switch architecture (DOC Fellowship)","grant_number":"24573","_id":"251EE76E-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","ec_funded":1,"status":"public","article_type":"original","type":"journal_article","_id":"67","date_created":"2018-12-11T11:44:27Z","title":"Evolutionary potential of transcription factors for gene regulatory rewiring","file_date_updated":"2020-07-14T12:47:37Z","date_published":"2018-09-10T00:00:00Z","publisher":"Nature Publishing Group","ddc":["570"],"isi":1,"publication_status":"published","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."}],"external_id":{"isi":["000447947600021"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"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.","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>","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>","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>.","short":"C. Igler, M. Lagator, G. Tkačik, J.P. Bollback, C.C. Guet, Nature Ecology and Evolution 2 (2018) 1633–1643."},"department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"JoBo"}],"date_updated":"2024-03-25T23:30:27Z","publication":"Nature Ecology and Evolution","publist_id":"7987","intvolume":"         2","scopus_import":"1","related_material":{"record":[{"relation":"popular_science","id":"5585","status":"public"},{"relation":"dissertation_contains","id":"6371","status":"public"}]},"year":"2018","day":"10","page":"1633 - 1643","doi":"10.1038/s41559-018-0651-y","oa":1},{"author":[{"last_name":"Filakovský","first_name":"Marek","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","full_name":"Filakovský, Marek"},{"full_name":"Franek, Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8878-8397","first_name":"Peter","last_name":"Franek"},{"full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","last_name":"Wagner","first_name":"Uli"},{"full_name":"Zhechev, Stephan Y","id":"3AA52972-F248-11E8-B48F-1D18A9856A87","last_name":"Zhechev","first_name":"Stephan Y"}],"project":[{"call_identifier":"FWF","grant_number":"M01980","_id":"25F8B9BC-B435-11E9-9278-68D0E5697425","name":"Robust invariants of Nonlinear Systems"},{"_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","name":"FWF Open Access Fund","call_identifier":"FWF"}],"quality_controlled":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"volume":2,"has_accepted_license":"1","month":"12","file":[{"content_type":"application/pdf","date_created":"2019-08-08T06:55:21Z","date_updated":"2020-07-14T12:47:40Z","file_name":"2018_JourAppliedComputTopology_Filakovsky.pdf","relation":"main_file","checksum":"cf9e7fcd2a113dd4828774fc75cdb7e8","file_id":"6775","creator":"dernst","access_level":"open_access","file_size":1056278}],"issue":"3-4","status":"public","publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"date_created":"2019-08-08T06:47:40Z","article_type":"original","_id":"6774","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"UlWa"}],"date_updated":"2023-09-07T13:10:36Z","citation":{"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.","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>","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>.","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.","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>","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>."},"date_published":"2018-12-01T00:00:00Z","file_date_updated":"2020-07-14T12:47:40Z","publisher":"Springer","title":"Computing simplicial representatives of homotopy group elements","publication_status":"published","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(𝑋) ."}],"ddc":["514"],"year":"2018","doi":"10.1007/s41468-018-0021-5","page":"177-231","day":"01","oa":1,"intvolume":"         2","publication":"Journal of Applied and Computational Topology","related_material":{"record":[{"relation":"dissertation_contains","id":"6681","status":"public"}]}},{"file_date_updated":"2020-07-14T12:47:40Z","publisher":"Institute of Science and Technology Austria","date_published":"2018-09-01T00:00:00Z","title":"Learning from dependent data","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"}],"publication_status":"published","ddc":["004","519"],"degree_awarded":"PhD","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","alternative_title":["ISTA Thesis"],"date_updated":"2023-09-07T12:29:07Z","department":[{"_id":"ChLa"}],"citation":{"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>.","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.","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>.","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>","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>","ieee":"A. Zimin, “Learning from dependent data,” Institute of Science and Technology Austria, 2018."},"publist_id":"7986","supervisor":[{"orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"day":"01","year":"2018","doi":"10.15479/AT:ISTA:TH1048","page":"92","oa":1,"language":[{"iso":"eng"}],"article_processing_charge":"No","has_accepted_license":"1","month":"09","file":[{"file_name":"2018_Thesis_Zimin.pdf","date_created":"2019-04-09T07:32:47Z","date_updated":"2020-07-14T12:47:40Z","content_type":"application/pdf","access_level":"open_access","file_size":1036137,"file_id":"6253","checksum":"e849dd40a915e4d6c5572b51b517f098","creator":"dernst","relation":"main_file"},{"relation":"source_file","file_id":"6254","checksum":"da092153cec55c97461bd53c45c5d139","creator":"dernst","access_level":"closed","file_size":637490,"content_type":"application/zip","date_created":"2019-04-09T07:32:47Z","date_updated":"2020-07-14T12:47:40Z","file_name":"2018_Thesis_Zimin_Source.zip"}],"author":[{"last_name":"Zimin","first_name":"Alexander","id":"37099E9C-F248-11E8-B48F-1D18A9856A87","full_name":"Zimin, Alexander"}],"project":[{"grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"}],"oa_version":"Published Version","ec_funded":1,"pubrep_id":"1048","publication_identifier":{"issn":["2663-337X"]},"status":"public","date_created":"2018-12-11T11:44:27Z","_id":"68","type":"dissertation"},{"ddc":["530","600"],"publication_status":"published","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","file_date_updated":"2020-07-14T12:47:44Z","publisher":"Institute of Science and Technology Austria","date_published":"2018-09-01T00:00:00Z","citation":{"ieee":"L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,” Institute of Science and Technology Austria, 2018.","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>.","ista":"Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria.","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>","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>","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>."},"department":[{"_id":"GeKa"},{"_id":"GradSch"}],"date_updated":"2023-09-26T15:50:22Z","alternative_title":["ISTA Thesis"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"degree_awarded":"PhD","supervisor":[{"orcid":"0000-0001-8342-202X","first_name":"Georgios","last_name":"Katsaros","full_name":"Katsaros, Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"23","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"840","relation":"part_of_dissertation"}]},"publist_id":"7985","oa":1,"year":"2018","page":"103","day":"01","doi":"10.15479/AT:ISTA:TH_1047","file":[{"relation":"main_file","checksum":"c570b656e30749cd65b1c7e13a9ce0a8","file_id":"6247","creator":"dernst","access_level":"open_access","file_size":28452385,"content_type":"application/pdf","date_created":"2019-04-09T07:00:40Z","date_updated":"2020-07-14T12:47:44Z","file_name":"2018_Thesis_Vukusic.pdf"},{"date_created":"2019-04-09T07:00:40Z","date_updated":"2020-07-14T12:47:44Z","content_type":"application/zip","file_name":"2018_Thesis_Vukusic_source.zip","relation":"source_file","access_level":"closed","file_size":53058704,"file_id":"6248","checksum":"7856771d9cd401fe0b311191076db6e1","creator":"dernst"}],"month":"09","has_accepted_license":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Published Version","author":[{"full_name":"Vukušić, Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2424-8636","first_name":"Lada","last_name":"Vukušić"}],"pubrep_id":"1047","type":"dissertation","_id":"69","date_created":"2018-12-11T11:44:28Z","status":"public","publication_identifier":{"issn":["2663-337X"]}},{"publication":"Probability Theory and Related Fields","arxiv":1,"publist_id":"7017","intvolume":"       171","scopus_import":1,"day":"14","year":"2018","doi":"10.1007/s00440-017-0787-8","oa":1,"title":"Local law and Tracy–Widom limit for sparse random matrices","publisher":"Springer","date_published":"2018-06-14T00:00:00Z","publication_status":"published","abstract":[{"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.","lang":"eng"}],"external_id":{"arxiv":["1605.08767"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (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>.","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.","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>","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>.","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>"},"department":[{"_id":"LaEr"}],"date_updated":"2021-01-12T08:09:33Z","ec_funded":1,"status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1605.08767","open_access":"1"}],"type":"journal_article","_id":"690","date_created":"2018-12-11T11:47:56Z","volume":171,"language":[{"iso":"eng"}],"article_number":"543-616","issue":"1-2","month":"06","author":[{"last_name":"Lee","first_name":"Jii","full_name":"Lee, Jii"},{"id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","full_name":"Schnelli, Kevin","first_name":"Kevin","last_name":"Schnelli","orcid":"0000-0003-0954-3231"}],"oa_version":"Preprint","quality_controlled":"1","project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}]},{"citation":{"mla":"Marin Valencia, Isaac, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” <i>Journal of Medical Genetics</i>, vol. 55, no. 1, BMJ Publishing Group, 2018, pp. 48–54, doi:<a href=\"https://doi.org/10.1136/jmedgenet-2017-104627\">10.1136/jmedgenet-2017-104627</a>.","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.","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. <i>Journal of Medical Genetics</i>. 2018;55(1):48-54. doi:<a href=\"https://doi.org/10.1136/jmedgenet-2017-104627\">10.1136/jmedgenet-2017-104627</a>","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.” <i>Journal of Medical Genetics</i>. BMJ Publishing Group, 2018. <a href=\"https://doi.org/10.1136/jmedgenet-2017-104627\">https://doi.org/10.1136/jmedgenet-2017-104627</a>.","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.","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. <i>Journal of Medical Genetics</i>. BMJ Publishing Group. <a href=\"https://doi.org/10.1136/jmedgenet-2017-104627\">https://doi.org/10.1136/jmedgenet-2017-104627</a>","ieee":"I. Marin Valencia <i>et al.</i>, “A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features,” <i>Journal of Medical Genetics</i>, vol. 55, no. 1. BMJ Publishing Group, pp. 48–54, 2018."},"date_updated":"2023-10-16T09:55:43Z","department":[{"_id":"GaNo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["28626029"],"isi":["000418199800007"]},"isi":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."}],"publication_status":"published","title":"A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features","date_published":"2018-01-01T00:00:00Z","publisher":"BMJ Publishing Group","pmid":1,"oa":1,"day":"01","page":"48 - 54","doi":"10.1136/jmedgenet-2017-104627","year":"2018","scopus_import":"1","publication":"Journal of Medical Genetics","intvolume":"        55","publist_id":"7016","oa_version":"Submitted Version","project":[{"_id":"254BA948-B435-11E9-9278-68D0E5697425","grant_number":"401299","name":"Probing development and reversibility of autism spectrum disorders"}],"quality_controlled":"1","author":[{"full_name":"Marin Valencia, Isaac","last_name":"Marin Valencia","first_name":"Isaac"},{"orcid":"0000-0002-7673-7178","last_name":"Novarino","first_name":"Gaia","full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Johansen","first_name":"Anide","full_name":"Johansen, Anide"},{"full_name":"Rosti, Başak","first_name":"Başak","last_name":"Rosti"},{"first_name":"Mahmoud","last_name":"Issa","full_name":"Issa, Mahmoud"},{"first_name":"Damir","last_name":"Musaev","full_name":"Musaev, Damir"},{"full_name":"Bhat, Gifty","last_name":"Bhat","first_name":"Gifty"},{"full_name":"Scott, Eric","first_name":"Eric","last_name":"Scott"},{"full_name":"Silhavy, Jennifer","first_name":"Jennifer","last_name":"Silhavy"},{"first_name":"Valentina","last_name":"Stanley","full_name":"Stanley, Valentina"},{"full_name":"Rosti, Rasim","last_name":"Rosti","first_name":"Rasim"},{"full_name":"Gleeson, Jeremy","first_name":"Jeremy","last_name":"Gleeson"},{"last_name":"Imam","first_name":"Farhad","full_name":"Imam, Farhad"},{"last_name":"Zaki","first_name":"Maha","full_name":"Zaki, Maha"},{"last_name":"Gleeson","first_name":"Joseph","full_name":"Gleeson, Joseph"}],"issue":"1","month":"01","article_processing_charge":"No","volume":55,"language":[{"iso":"eng"}],"type":"journal_article","_id":"691","article_type":"original","date_created":"2018-12-11T11:47:57Z","status":"public","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6056005/","open_access":"1"}],"publication_identifier":{"issn":["0022-2593"]}},{"article_processing_charge":"Yes (via OA deal)","volume":194,"language":[{"iso":"eng"}],"issue":"1","file":[{"file_id":"7222","checksum":"1febcfc1266486053a069e3425ea3713","creator":"kschuh","access_level":"open_access","file_size":1140860,"relation":"main_file","file_name":"2018_Springer_Akopyan.pdf","content_type":"application/pdf","date_created":"2020-01-03T11:35:08Z","date_updated":"2020-07-14T12:47:44Z"}],"has_accepted_license":"1","month":"06","author":[{"last_name":"Akopyan","first_name":"Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy"}],"oa_version":"Published Version","quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"ec_funded":1,"status":"public","_id":"692","type":"journal_article","article_type":"original","date_created":"2018-12-11T11:47:57Z","title":"3-Webs generated by confocal conics and circles","date_published":"2018-06-01T00:00:00Z","file_date_updated":"2020-07-14T12:47:44Z","publisher":"Springer","isi":1,"ddc":["510"],"abstract":[{"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.","lang":"eng"}],"publication_status":"published","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"external_id":{"isi":["000431418800004"]},"citation":{"mla":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” <i>Geometriae Dedicata</i>, vol. 194, no. 1, Springer, 2018, pp. 55–64, doi:<a href=\"https://doi.org/10.1007/s10711-017-0265-6\">10.1007/s10711-017-0265-6</a>.","short":"A. Akopyan, Geometriae Dedicata 194 (2018) 55–64.","apa":"Akopyan, A. (2018). 3-Webs generated by confocal conics and circles. <i>Geometriae Dedicata</i>. Springer. <a href=\"https://doi.org/10.1007/s10711-017-0265-6\">https://doi.org/10.1007/s10711-017-0265-6</a>","ista":"Akopyan A. 2018. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 194(1), 55–64.","chicago":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” <i>Geometriae Dedicata</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s10711-017-0265-6\">https://doi.org/10.1007/s10711-017-0265-6</a>.","ama":"Akopyan A. 3-Webs generated by confocal conics and circles. <i>Geometriae Dedicata</i>. 2018;194(1):55-64. doi:<a href=\"https://doi.org/10.1007/s10711-017-0265-6\">10.1007/s10711-017-0265-6</a>","ieee":"A. Akopyan, “3-Webs generated by confocal conics and circles,” <i>Geometriae Dedicata</i>, vol. 194, no. 1. Springer, pp. 55–64, 2018."},"date_updated":"2023-09-08T11:40:29Z","department":[{"_id":"HeEd"}],"publication":"Geometriae Dedicata","intvolume":"       194","publist_id":"7014","scopus_import":"1","year":"2018","doi":"10.1007/s10711-017-0265-6","page":"55 - 64","day":"01","oa":1},{"conference":{"location":"Nieuwpoort, Curacao","name":"FC: Financial Cryptography and Data Security","end_date":"2018-03-02","start_date":"2018-02-26"},"ec_funded":1,"type":"conference","_id":"6941","date_created":"2019-10-14T06:35:38Z","main_file_link":[{"url":"https://eprint.iacr.org/2015/528","open_access":"1"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783662583869","9783662583876"]},"status":"public","month":"12","volume":10957,"article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Submitted Version","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"quality_controlled":"1","author":[{"first_name":"Sunoo","last_name":"Park","full_name":"Park, Sunoo"},{"full_name":"Kwon, Albert","first_name":"Albert","last_name":"Kwon"},{"id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg","first_name":"Georg","last_name":"Fuchsbauer"},{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter","first_name":"Peter","last_name":"Gazi"},{"last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z"}],"scopus_import":"1","publication":"22nd International Conference on Financial Cryptography and Data Security","intvolume":"     10957","oa":1,"year":"2018","page":"480-499","doi":"10.1007/978-3-662-58387-6_26","day":"07","isi":1,"publication_status":"published","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"}],"title":"SpaceMint: A cryptocurrency based on proofs of space","date_published":"2018-12-07T00:00:00Z","publisher":"Springer Nature","citation":{"mla":"Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” <i>22nd International Conference on Financial Cryptography and Data Security</i>, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:<a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">10.1007/978-3-662-58387-6_26</a>.","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.","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 <i>22nd International Conference on Financial Cryptography and Data Security</i>, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.","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 <i>22nd International Conference on Financial Cryptography and Data Security</i>, 10957:480–99. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">https://doi.org/10.1007/978-3-662-58387-6_26</a>.","ama":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: <i>22nd International Conference on Financial Cryptography and Data Security</i>. Vol 10957. Springer Nature; 2018:480-499. doi:<a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">10.1007/978-3-662-58387-6_26</a>","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.","apa":"Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., &#38; Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In <i>22nd International Conference on Financial Cryptography and Data Security</i> (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">https://doi.org/10.1007/978-3-662-58387-6_26</a>"},"department":[{"_id":"KrPi"}],"date_updated":"2023-09-19T15:02:13Z","alternative_title":["LNCS"],"external_id":{"isi":["000540656400026"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"intvolume":"       362","publist_id":"8049","publication":"Science","related_material":{"record":[{"status":"public","id":"13055","relation":"research_data"}],"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/for-ants-unity-is-strength-and-health/"}]},"scopus_import":"1","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.","page":"941 - 945","doi":"10.1126/science.aat4793","year":"2018","day":"23","oa":1,"date_published":"2018-11-23T00:00:00Z","publisher":"AAAS","title":"Social network plasticity decreases disease transmission in a eusocial insect","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"}],"publication_status":"published","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"isi":["000451124500041"]},"date_updated":"2023-10-17T11:50:05Z","department":[{"_id":"SyCr"}],"citation":{"mla":"Stroeymeyt, Nathalie, et al. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” <i>Science</i>, vol. 362, no. 6417, AAAS, 2018, pp. 941–45, doi:<a href=\"https://doi.org/10.1126/science.aat4793\">10.1126/science.aat4793</a>.","short":"N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, Science 362 (2018) 941–945.","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,” <i>Science</i>, vol. 362, no. 6417. AAAS, pp. 941–945, 2018.","ama":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network plasticity decreases disease transmission in a eusocial insect. <i>Science</i>. 2018;362(6417):941-945. doi:<a href=\"https://doi.org/10.1126/science.aat4793\">10.1126/science.aat4793</a>","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.","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.” <i>Science</i>. AAAS, 2018. <a href=\"https://doi.org/10.1126/science.aat4793\">https://doi.org/10.1126/science.aat4793</a>.","apa":"Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., &#38; Keller, L. (2018). Social network plasticity decreases disease transmission in a eusocial insect. <i>Science</i>. AAAS. <a href=\"https://doi.org/10.1126/science.aat4793\">https://doi.org/10.1126/science.aat4793</a>"},"ec_funded":1,"publication_identifier":{"issn":["1095-9203"]},"status":"public","main_file_link":[{"url":"https://serval.unil.ch/resource/serval:BIB_E9228C205467.P001/REF.pdf","open_access":"1"}],"date_created":"2018-12-11T11:44:07Z","type":"journal_article","_id":"7","article_type":"original","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":362,"month":"11","issue":"6417","author":[{"full_name":"Stroeymeyt, Nathalie","last_name":"Stroeymeyt","first_name":"Nathalie"},{"full_name":"Grasse, Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87","last_name":"Grasse","first_name":"Anna V"},{"last_name":"Crespi","first_name":"Alessandro","full_name":"Crespi, Alessandro"},{"full_name":"Mersch, Danielle","first_name":"Danielle","last_name":"Mersch"},{"full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","last_name":"Cremer","first_name":"Sylvia"},{"first_name":"Laurent","last_name":"Keller","full_name":"Keller, Laurent"}],"project":[{"name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","_id":"25DC711C-B435-11E9-9278-68D0E5697425","grant_number":"243071","call_identifier":"FP7"}],"quality_controlled":"1","oa_version":"Published Version"},{"scopus_import":"1","arxiv":1,"intvolume":"        15","publication":"Latin American Journal of Probability and Mathematical Statistics","oa":1,"day":"01","page":"1311-1334","doi":"10.30757/ALEA.v15-49","year":"2018","publication_status":"published","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."}],"ddc":["510"],"isi":1,"publisher":"Instituto Nacional de Matematica Pura e Aplicada","date_published":"2018-10-01T00:00:00Z","file_date_updated":"2020-07-14T12:47:46Z","title":"Transition to shocks in TASEP and decoupling of last passage times","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"date_updated":"2023-10-10T13:11:29Z","citation":{"short":"P. Nejjar, Latin American Journal of Probability and Mathematical Statistics 15 (2018) 1311–1334.","mla":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” <i>Latin American Journal of Probability and Mathematical Statistics</i>, vol. 15, no. 2, Instituto Nacional de Matematica Pura e Aplicada, 2018, pp. 1311–34, doi:<a href=\"https://doi.org/10.30757/ALEA.v15-49\">10.30757/ALEA.v15-49</a>.","apa":"Nejjar, P. (2018). Transition to shocks in TASEP and decoupling of last passage times. <i>Latin American Journal of Probability and Mathematical Statistics</i>. Instituto Nacional de Matematica Pura e Aplicada. <a href=\"https://doi.org/10.30757/ALEA.v15-49\">https://doi.org/10.30757/ALEA.v15-49</a>","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.","chicago":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” <i>Latin American Journal of Probability and Mathematical Statistics</i>. Instituto Nacional de Matematica Pura e Aplicada, 2018. <a href=\"https://doi.org/10.30757/ALEA.v15-49\">https://doi.org/10.30757/ALEA.v15-49</a>.","ama":"Nejjar P. Transition to shocks in TASEP and decoupling of last passage times. <i>Latin American Journal of Probability and Mathematical Statistics</i>. 2018;15(2):1311-1334. doi:<a href=\"https://doi.org/10.30757/ALEA.v15-49\">10.30757/ALEA.v15-49</a>","ieee":"P. Nejjar, “Transition to shocks in TASEP and decoupling of last passage times,” <i>Latin American Journal of Probability and Mathematical Statistics</i>, vol. 15, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1311–1334, 2018."},"external_id":{"arxiv":["1705.08836"],"isi":["000460475800022"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"date_created":"2018-12-11T11:44:28Z","article_type":"original","type":"journal_article","_id":"70","publication_identifier":{"issn":["1980-0436"]},"status":"public","has_accepted_license":"1","month":"10","file":[{"file_name":"2018_ALEA_Nejjar.pdf","content_type":"application/pdf","date_created":"2019-02-14T09:44:10Z","date_updated":"2020-07-14T12:47:46Z","file_id":"5981","checksum":"2ded46aa284a836a8cbb34133a64f1cb","creator":"kschuh","access_level":"open_access","file_size":394851,"relation":"main_file"}],"issue":"2","language":[{"iso":"eng"}],"volume":15,"article_processing_charge":"No","quality_controlled":"1","project":[{"call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems"},{"name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","call_identifier":"H2020"}],"oa_version":"Published Version","author":[{"full_name":"Nejjar, Peter","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Nejjar"}]},{"volume":40,"language":[{"iso":"eng"}],"issue":"7","month":"07","author":[{"last_name":"Shekhovtsov","first_name":"Alexander","full_name":"Shekhovtsov, Alexander"},{"full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","first_name":"Paul"},{"full_name":"Savchynskyy, Bogdan","first_name":"Bogdan","last_name":"Savchynskyy"}],"oa_version":"Preprint","quality_controlled":"1","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1508.07902","open_access":"1"}],"publication_identifier":{"issn":["01628828"]},"type":"journal_article","_id":"703","date_created":"2018-12-11T11:48:01Z","title":"Maximum persistency via iterative relaxed inference with graphical models","date_published":"2018-07-01T00:00:00Z","publisher":"IEEE","publication_status":"published","abstract":[{"lang":"eng","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."}],"external_id":{"arxiv":["1508.07902"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.","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.","ama":"Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2018;40(7):1668-1682. doi:<a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">10.1109/TPAMI.2017.2730884</a>","chicago":"Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">https://doi.org/10.1109/TPAMI.2017.2730884</a>.","apa":"Shekhovtsov, A., Swoboda, P., &#38; Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">https://doi.org/10.1109/TPAMI.2017.2730884</a>","mla":"Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:<a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">10.1109/TPAMI.2017.2730884</a>.","short":"A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682."},"department":[{"_id":"VlKo"}],"date_updated":"2021-01-12T08:11:32Z","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","arxiv":1,"publist_id":"6992","intvolume":"        40","scopus_import":1,"year":"2018","doi":"10.1109/TPAMI.2017.2730884","page":"1668-1682","day":"01","oa":1},{"author":[{"full_name":"Miklosi, Andras","last_name":"Miklosi","first_name":"Andras"},{"first_name":"Giorgia","last_name":"Del Favero","full_name":"Del Favero, Giorgia"},{"first_name":"Tanja","last_name":"Bulat","full_name":"Bulat, Tanja"},{"full_name":"Höger, Harald","last_name":"Höger","first_name":"Harald"},{"last_name":"Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"},{"full_name":"Marko, Doris","first_name":"Doris","last_name":"Marko"},{"full_name":"Lubec, Gert","last_name":"Lubec","first_name":"Gert"}],"quality_controlled":"1","oa_version":"None","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":55,"month":"06","issue":"6","status":"public","date_created":"2018-12-11T11:48:02Z","type":"journal_article","_id":"705","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000431991500025"]},"date_updated":"2023-09-19T09:58:11Z","department":[{"_id":"RySh"}],"citation":{"short":"A. Miklosi, G. Del Favero, T. Bulat, H. Höger, R. Shigemoto, D. Marko, G. Lubec, Molecular Neurobiology 55 (2018) 4857 – 4869.","mla":"Miklosi, Andras, et al. “Super Resolution Microscopical Localization of Dopamine Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” <i>Molecular Neurobiology</i>, vol. 55, no. 6, Springer, 2018, pp. 4857 – 4869, doi:<a href=\"https://doi.org/10.1007/s12035-017-0688-y\">10.1007/s12035-017-0688-y</a>.","apa":"Miklosi, A., Del Favero, G., Bulat, T., Höger, H., Shigemoto, R., Marko, D., &#38; Lubec, G. (2018). Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. <i>Molecular Neurobiology</i>. Springer. <a href=\"https://doi.org/10.1007/s12035-017-0688-y\">https://doi.org/10.1007/s12035-017-0688-y</a>","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.","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.” <i>Molecular Neurobiology</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s12035-017-0688-y\">https://doi.org/10.1007/s12035-017-0688-y</a>.","ama":"Miklosi A, Del Favero G, Bulat T, et al. Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. <i>Molecular Neurobiology</i>. 2018;55(6):4857 – 4869. doi:<a href=\"https://doi.org/10.1007/s12035-017-0688-y\">10.1007/s12035-017-0688-y</a>","ieee":"A. Miklosi <i>et al.</i>, “Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes,” <i>Molecular Neurobiology</i>, vol. 55, no. 6. Springer, pp. 4857 – 4869, 2018."},"publisher":"Springer","date_published":"2018-06-01T00:00:00Z","title":"Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes","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."}],"publication_status":"published","isi":1,"year":"2018","day":"01","doi":"10.1007/s12035-017-0688-y","page":"4857 – 4869","intvolume":"        55","publist_id":"6991","publication":"Molecular Neurobiology","scopus_import":"1"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” <i>Proceedings of the 21st International Conference on Extending Database Technology</i>, OpenProceedings, 2018, pp. 145–56, doi:<a href=\"https://doi.org/10.5441/002/EDBT.2018.14\">10.5441/002/EDBT.2018.14</a>.","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.","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 <i>Proceedings of the 21st International Conference on Extending Database Technology</i>, 145–56. OpenProceedings, 2018. <a href=\"https://doi.org/10.5441/002/EDBT.2018.14\">https://doi.org/10.5441/002/EDBT.2018.14</a>.","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.","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: <i>Proceedings of the 21st International Conference on Extending Database Technology</i>. OpenProceedings; 2018:145-156. doi:<a href=\"https://doi.org/10.5441/002/EDBT.2018.14\">10.5441/002/EDBT.2018.14</a>","apa":"Grubic, D., Tam, L., Alistarh, D.-A., &#38; Zhang, C. (2018). Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In <i>Proceedings of the 21st International Conference on Extending Database Technology</i> (pp. 145–156). Vienna, Austria: OpenProceedings. <a href=\"https://doi.org/10.5441/002/EDBT.2018.14\">https://doi.org/10.5441/002/EDBT.2018.14</a>","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 <i>Proceedings of the 21st International Conference on Extending Database Technology</i>, Vienna, Austria, 2018, pp. 145–156."},"date_updated":"2023-02-23T12:59:17Z","department":[{"_id":"DaAl"}],"title":"Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study","date_published":"2018-03-26T00:00:00Z","publisher":"OpenProceedings","file_date_updated":"2020-07-14T12:47:49Z","ddc":["000"],"abstract":[{"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.","lang":"eng"}],"publication_status":"published","year":"2018","day":"26","page":"145-156","doi":"10.5441/002/EDBT.2018.14","oa":1,"publication":"Proceedings of the 21st International Conference on Extending Database Technology","scopus_import":1,"author":[{"full_name":"Grubic, Demjan","first_name":"Demjan","last_name":"Grubic"},{"first_name":"Leo","last_name":"Tam","full_name":"Tam, Leo"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X"},{"full_name":"Zhang, Ce","first_name":"Ce","last_name":"Zhang"}],"oa_version":"Published Version","quality_controlled":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"file":[{"file_name":"2018_OpenProceedings_Grubic.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:49Z","date_created":"2019-11-26T14:23:04Z","creator":"dernst","checksum":"ec979b56abc71016d6e6adfdadbb4afe","file_id":"7118","file_size":1603204,"access_level":"open_access","relation":"main_file"}],"has_accepted_license":"1","month":"03","status":"public","publication_identifier":{"isbn":["9783893180783"],"issn":["2367-2005"]},"_id":"7116","type":"conference","date_created":"2019-11-26T14:19:11Z","conference":{"end_date":"2018-03-29","start_date":"2018-03-26","location":"Vienna, Austria","name":"EDBT: Conference on Extending Database Technology"}},{"isi":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."}],"publication_status":"published","title":"Space-optimal majority in population protocols","date_published":"2018-01-30T00:00:00Z","publisher":"ACM","citation":{"mla":"Alistarh, Dan-Adrian, et al. “Space-Optimal Majority in Population Protocols.” <i>Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, ACM, 2018, pp. 2221–39, doi:<a href=\"https://doi.org/10.1137/1.9781611975031.144\">10.1137/1.9781611975031.144</a>.","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.","chicago":"Alistarh, Dan-Adrian, James Aspnes, and Rati Gelashvili. “Space-Optimal Majority in Population Protocols.” In <i>Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2221–39. ACM, 2018. <a href=\"https://doi.org/10.1137/1.9781611975031.144\">https://doi.org/10.1137/1.9781611975031.144</a>.","ama":"Alistarh D-A, Aspnes J, Gelashvili R. Space-optimal majority in population protocols. In: <i>Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. ACM; 2018:2221-2239. doi:<a href=\"https://doi.org/10.1137/1.9781611975031.144\">10.1137/1.9781611975031.144</a>","apa":"Alistarh, D.-A., Aspnes, J., &#38; Gelashvili, R. (2018). Space-optimal majority in population protocols. In <i>Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 2221–2239). New Orleans, LA, United States: ACM. <a href=\"https://doi.org/10.1137/1.9781611975031.144\">https://doi.org/10.1137/1.9781611975031.144</a>","ieee":"D.-A. Alistarh, J. Aspnes, and R. Gelashvili, “Space-optimal majority in population protocols,” in <i>Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, New Orleans, LA, United States, 2018, pp. 2221–2239."},"date_updated":"2023-09-19T15:03:16Z","department":[{"_id":"DaAl"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"arxiv":["1704.04947"],"isi":["000483921200145"]},"publication":"Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms","arxiv":1,"oa":1,"page":"2221-2239","doi":"10.1137/1.9781611975031.144","day":"30","year":"2018","month":"01","article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Preprint","quality_controlled":"1","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Aspnes","first_name":"James","full_name":"Aspnes, James"},{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"}],"conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"New Orleans, LA, United States","start_date":"2018-01-07","end_date":"2018-01-10"},"type":"conference","_id":"7123","date_created":"2019-11-26T15:10:55Z","status":"public","publication_identifier":{"isbn":["9781611975031"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.04947"}]}]