[{"publication_status":"published","ec_funded":1,"day":"25","month":"10","related_material":{"record":[{"id":"7977","relation":"popular_science"},{"relation":"dissertation_contains","id":"69","status":"public"},{"relation":"dissertation_contains","id":"7996","status":"public"}]},"isi":1,"issue":"11","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"doi":"10.1021/acs.nanolett.8b03217","abstract":[{"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.","lang":"eng"}],"publist_id":"8032","status":"public","pmid":1,"publication_identifier":{"issn":["15306984"]},"language":[{"iso":"eng"}],"intvolume":" 18","page":"7141 - 7145","publisher":"American Chemical Society","department":[{"_id":"GeKa"}],"file":[{"access_level":"open_access","file_id":"5194","date_created":"2018-12-12T10:16:08Z","file_name":"IST-2018-1065-v1+1_ACS_nanoletters_8b03217.pdf","date_updated":"2020-07-14T12:45:37Z","content_type":"application/pdf","file_size":1361441,"checksum":"3e6034a94c6b5335e939145d88bdb371","relation":"main_file","creator":"system"}],"oa_version":"Published Version","date_updated":"2023-09-18T09:30:37Z","author":[{"last_name":"Vukušić","full_name":"Vukušić, Lada","first_name":"Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2424-8636"},{"last_name":"Kukucka","full_name":"Kukucka, Josip","first_name":"Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","full_name":"Watzinger, Hannes","last_name":"Watzinger"},{"last_name":"Milem","first_name":"Joshua M","id":"4CDE0A96-F248-11E8-B48F-1D18A9856A87","full_name":"Milem, Joshua M"},{"full_name":"Schäffler, Friedrich","first_name":"Friedrich","last_name":"Schäffler"},{"last_name":"Katsaros","orcid":"0000-0001-8342-202X","first_name":"Georgios","full_name":"Katsaros, Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"citation":{"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.” Nano Letters. American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.8b03217.","ama":"Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. Single-shot readout of hole spins in Ge. Nano Letters. 2018;18(11):7141-7145. doi:10.1021/acs.nanolett.8b03217","short":"L. Vukušić, J. Kukucka, H. Watzinger, J.M. Milem, F. Schäffler, G. Katsaros, Nano Letters 18 (2018) 7141–7145.","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,” Nano Letters, vol. 18, no. 11. American Chemical Society, pp. 7141–7145, 2018.","apa":"Vukušić, L., Kukucka, J., Watzinger, H., Milem, J. M., Schäffler, F., & Katsaros, G. (2018). Single-shot readout of hole spins in Ge. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.8b03217","mla":"Vukušić, Lada, et al. “Single-Shot Readout of Hole Spins in Ge.” Nano Letters, vol. 18, no. 11, American Chemical Society, 2018, pp. 7141–45, doi:10.1021/acs.nanolett.8b03217.","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."},"has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","pubrep_id":"1065","type":"journal_article","external_id":{"pmid":["30359041"],"isi":["000451102100064"]},"scopus_import":"1","file_date_updated":"2020-07-14T12:45:37Z","_id":"23","year":"2018","volume":18,"article_processing_charge":"No","publication":"Nano Letters","date_created":"2018-12-11T11:44:13Z","ddc":["530"],"title":"Single-shot readout of hole spins in Ge","date_published":"2018-10-25T00:00:00Z","project":[{"_id":"25517E86-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","grant_number":"335497"}],"quality_controlled":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"date_created":"2018-12-11T11:44:13Z","volume":2018,"article_processing_charge":"No","year":"2018","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10601"}],"conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19","start_date":"2018-07-13","location":"Stockholm, Sweden"},"quality_controlled":"1","title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","date_published":"2018-07-01T00:00:00Z","project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"type":"conference","oa":1,"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Adrian","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","full_name":"Elgyütt, Adrian","last_name":"Elgyütt"},{"first_name":"Petr","full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny"},{"last_name":"Rouillé","full_name":"Rouillé, Owen","first_name":"Owen"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"apa":"Chatterjee, K., Elgyütt, A., Novotný, P., & 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. https://doi.org/10.24963/ijcai.2018/652","mla":"Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.","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.","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. https://doi.org/10.24963/ijcai.2018/652.","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:10.24963/ijcai.2018/652","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.","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."},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"oa_version":"Preprint","date_updated":"2025-06-02T08:53:48Z","_id":"24","scopus_import":"1","external_id":{"isi":["000764175404117"],"arxiv":["1804.10601"]},"page":"4692 - 4699","intvolume":" 2018","arxiv":1,"language":[{"iso":"eng"}],"publisher":"IJCAI","month":"07","isi":1,"ec_funded":1,"day":"01","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","publication_status":"published","status":"public","doi":"10.24963/ijcai.2018/652","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"}],"publist_id":"8031"},{"issue":"10","doi":"10.1038/s41559-018-0651-y","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."}],"publist_id":"7987","status":"public","publication_status":"published","day":"10","ec_funded":1,"isi":1,"month":"09","related_material":{"record":[{"id":"5585","relation":"popular_science","status":"public"},{"status":"public","relation":"dissertation_contains","id":"6371"}]},"publisher":"Nature Publishing Group","language":[{"iso":"eng"}],"intvolume":" 2","article_type":"original","page":"1633 - 1643","external_id":{"isi":["000447947600021"]},"file_date_updated":"2020-07-14T12:47:37Z","scopus_import":"1","_id":"67","date_updated":"2024-03-25T23:30:27Z","oa_version":"Submitted Version","file":[{"checksum":"383a2e2c944a856e2e821ec8e7bf71b6","relation":"main_file","creator":"dernst","access_level":"open_access","file_id":"7830","date_created":"2020-05-14T11:28:52Z","file_name":"2018_NatureEcology_Igler.pdf","date_updated":"2020-07-14T12:47:37Z","content_type":"application/pdf","file_size":1135973}],"department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"JoBo"}],"citation":{"apa":"Igler, C., Lagator, M., Tkačik, G., Bollback, J. P., & Guet, C. C. (2018). Evolutionary potential of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution. Nature Publishing Group. https://doi.org/10.1038/s41559-018-0651-y","mla":"Igler, Claudia, et al. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.” Nature Ecology and Evolution, vol. 2, no. 10, Nature Publishing Group, 2018, pp. 1633–43, doi:10.1038/s41559-018-0651-y.","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.” Nature Ecology and Evolution. Nature Publishing Group, 2018. https://doi.org/10.1038/s41559-018-0651-y.","ama":"Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. Evolutionary potential of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution. 2018;2(10):1633-1643. doi:10.1038/s41559-018-0651-y","short":"C. Igler, M. Lagator, G. Tkačik, J.P. Bollback, C.C. Guet, Nature Ecology and Evolution 2 (2018) 1633–1643.","ieee":"C. Igler, M. Lagator, G. Tkačik, J. P. Bollback, and C. C. Guet, “Evolutionary potential of transcription factors for gene regulatory rewiring,” Nature Ecology and Evolution, vol. 2, no. 10. Nature Publishing Group, pp. 1633–1643, 2018."},"has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"author":[{"first_name":"Claudia","full_name":"Igler, Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87","last_name":"Igler"},{"last_name":"Lagator","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","full_name":"Lagator, Mato","first_name":"Mato"},{"full_name":"Tkacik, Gasper","first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","last_name":"Tkacik"},{"last_name":"Bollback","orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P","full_name":"Bollback, Jonathan P"},{"last_name":"Guet","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","full_name":"Guet, Calin C"}],"type":"journal_article","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"648440","name":"Selective Barriers to Horizontal Gene Transfer","call_identifier":"H2020","_id":"2578D616-B435-11E9-9278-68D0E5697425"},{"_id":"251EE76E-B435-11E9-9278-68D0E5697425","name":"Design principles underlying genetic switch architecture (DOC Fellowship)","grant_number":"24573"}],"date_published":"2018-09-10T00:00:00Z","title":"Evolutionary potential of transcription factors for gene regulatory rewiring","quality_controlled":"1","year":"2018","publication":"Nature Ecology and Evolution","volume":2,"article_processing_charge":"No","ddc":["570"],"date_created":"2018-12-11T11:44:27Z"},{"file_date_updated":"2020-07-14T12:47:40Z","_id":"6774","citation":{"ieee":"M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial representatives of homotopy group elements,” Journal of Applied and Computational Topology, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.","short":"M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.","ama":"Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5","chicago":"Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology. Springer, 2018. https://doi.org/10.1007/s41468-018-0021-5.","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.","apa":"Filakovský, M., Franek, P., Wagner, U., & Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. Springer. https://doi.org/10.1007/s41468-018-0021-5","mla":"Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5."},"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","full_name":"Filakovský, Marek","last_name":"Filakovský"},{"full_name":"Franek, Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","orcid":"0000-0001-8878-8397","last_name":"Franek"},{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"},{"last_name":"Zhechev","first_name":"Stephan Y","full_name":"Zhechev, Stephan Y","id":"3AA52972-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"date_updated":"2023-09-07T13:10:36Z","oa_version":"Published Version","department":[{"_id":"UlWa"}],"file":[{"access_level":"open_access","date_created":"2019-08-08T06:55:21Z","file_id":"6775","file_name":"2018_JourAppliedComputTopology_Filakovsky.pdf","file_size":1056278,"content_type":"application/pdf","date_updated":"2020-07-14T12:47:40Z","relation":"main_file","checksum":"cf9e7fcd2a113dd4828774fc75cdb7e8","creator":"dernst"}],"type":"journal_article","quality_controlled":"1","project":[{"name":"Robust invariants of Nonlinear Systems","grant_number":"M01980","_id":"25F8B9BC-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","name":"FWF Open Access Fund"}],"date_published":"2018-12-01T00:00:00Z","title":"Computing simplicial representatives of homotopy group elements","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication":"Journal of Applied and Computational Topology","volume":2,"year":"2018","ddc":["514"],"date_created":"2019-08-08T06:47:40Z","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(𝑋) ."}],"doi":"10.1007/s41468-018-0021-5","issue":"3-4","publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"status":"public","day":"01","publication_status":"published","month":"12","related_material":{"record":[{"status":"public","id":"6681","relation":"dissertation_contains"}]},"publisher":"Springer","language":[{"iso":"eng"}],"page":"177-231","article_type":"original","intvolume":" 2"},{"file":[{"creator":"dernst","checksum":"e849dd40a915e4d6c5572b51b517f098","relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:47:40Z","file_size":1036137,"file_name":"2018_Thesis_Zimin.pdf","file_id":"6253","date_created":"2019-04-09T07:32:47Z","access_level":"open_access"},{"creator":"dernst","checksum":"da092153cec55c97461bd53c45c5d139","relation":"source_file","file_id":"6254","date_created":"2019-04-09T07:32:47Z","access_level":"closed","content_type":"application/zip","date_updated":"2020-07-14T12:47:40Z","file_size":637490,"file_name":"2018_Thesis_Zimin_Source.zip"}],"department":[{"_id":"ChLa"}],"oa_version":"Published Version","date_updated":"2023-09-07T12:29:07Z","oa":1,"author":[{"last_name":"Zimin","full_name":"Zimin, Alexander","first_name":"Alexander","id":"37099E9C-F248-11E8-B48F-1D18A9856A87"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","citation":{"short":"A. Zimin, Learning from Dependent Data, Institute of Science and Technology Austria, 2018.","ama":"Zimin A. Learning from dependent data. 2018. doi:10.15479/AT:ISTA:TH1048","chicago":"Zimin, Alexander. “Learning from Dependent Data.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH1048.","ieee":"A. Zimin, “Learning from dependent data,” Institute of Science and Technology Austria, 2018.","ista":"Zimin A. 2018. Learning from dependent data. Institute of Science and Technology Austria.","mla":"Zimin, Alexander. Learning from Dependent Data. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH1048.","apa":"Zimin, A. (2018). Learning from dependent data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH1048"},"pubrep_id":"1048","type":"dissertation","file_date_updated":"2020-07-14T12:47:40Z","_id":"68","year":"2018","article_processing_charge":"No","date_created":"2018-12-11T11:44:27Z","ddc":["004","519"],"title":"Learning from dependent data","date_published":"2018-09-01T00:00:00Z","project":[{"name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","ec_funded":1,"day":"01","alternative_title":["ISTA Thesis"],"month":"09","doi":"10.15479/AT:ISTA:TH1048","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"}],"publist_id":"7986","degree_awarded":"PhD","status":"public","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"page":"92","supervisor":[{"last_name":"Lampert","orcid":"0000-0001-8622-7887","first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Institute of Science and Technology Austria"},{"type":"dissertation","pubrep_id":"1047","oa":1,"author":[{"last_name":"Vukušić","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","first_name":"Lada","full_name":"Vukušić, Lada","orcid":"0000-0003-2424-8636"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria.","mla":"Vukušić, Lada. Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1047.","apa":"Vukušić, L. (2018). Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1047","short":"L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires, Institute of Science and Technology Austria, 2018.","ama":"Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires. 2018. doi:10.15479/AT:ISTA:TH_1047","chicago":"Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1047.","ieee":"L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,” Institute of Science and Technology Austria, 2018."},"has_accepted_license":"1","department":[{"_id":"GeKa"},{"_id":"GradSch"}],"file":[{"relation":"main_file","checksum":"c570b656e30749cd65b1c7e13a9ce0a8","creator":"dernst","access_level":"open_access","date_created":"2019-04-09T07:00:40Z","file_id":"6247","file_name":"2018_Thesis_Vukusic.pdf","file_size":28452385,"content_type":"application/pdf","date_updated":"2020-07-14T12:47:44Z"},{"checksum":"7856771d9cd401fe0b311191076db6e1","relation":"source_file","creator":"dernst","access_level":"closed","file_id":"6248","date_created":"2019-04-09T07:00:40Z","file_name":"2018_Thesis_Vukusic_source.zip","date_updated":"2020-07-14T12:47:44Z","content_type":"application/zip","file_size":53058704}],"date_updated":"2023-09-26T15:50:22Z","oa_version":"Published Version","_id":"69","file_date_updated":"2020-07-14T12:47:44Z","date_created":"2018-12-11T11:44:28Z","ddc":["530","600"],"article_processing_charge":"No","year":"2018","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2018-09-01T00:00:00Z","title":"Charge sensing and spin relaxation times of holes in Ge hut wires","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"23"},{"status":"public","id":"840","relation":"part_of_dissertation"}]},"month":"09","alternative_title":["ISTA Thesis"],"day":"01","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"status":"public","degree_awarded":"PhD","publist_id":"7985","doi":"10.15479/AT:ISTA:TH_1047","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"}],"page":"103","language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","supervisor":[{"last_name":"Katsaros","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X"}]},{"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer, 2018.","short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).","ama":"Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8","chicago":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields. Springer, 2018. https://doi.org/10.1007/s00440-017-0787-8.","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.","apa":"Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8","mla":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616, Springer, 2018, doi:10.1007/s00440-017-0787-8."},"oa":1,"author":[{"last_name":"Lee","full_name":"Lee, Jii","first_name":"Jii"},{"id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","first_name":"Kevin","full_name":"Schnelli, Kevin","orcid":"0000-0003-0954-3231","last_name":"Schnelli"}],"oa_version":"Preprint","date_updated":"2021-01-12T08:09:33Z","department":[{"_id":"LaEr"}],"_id":"690","scopus_import":1,"external_id":{"arxiv":["1605.08767"]},"date_created":"2018-12-11T11:47:56Z","publication":"Probability Theory and Related Fields","volume":171,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.08767"}],"year":"2018","quality_controlled":"1","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"title":"Local law and Tracy–Widom limit for sparse random matrices","date_published":"2018-06-14T00:00:00Z","month":"06","day":"14","ec_funded":1,"publication_status":"published","status":"public","publist_id":"7017","doi":"10.1007/s00440-017-0787-8","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"}],"issue":"1-2","article_number":"543-616","intvolume":" 171","arxiv":1,"language":[{"iso":"eng"}],"publisher":"Springer"},{"external_id":{"isi":["000418199800007"],"pmid":["28626029"]},"scopus_import":"1","_id":"691","oa_version":"Submitted Version","date_updated":"2023-10-16T09:55:43Z","department":[{"_id":"GaNo"}],"citation":{"ieee":"I. Marin Valencia et al., “A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features,” Journal of Medical Genetics, vol. 55, no. 1. BMJ Publishing Group, pp. 48–54, 2018.","chicago":"Marin Valencia, Isaac, Gaia Novarino, Anide Johansen, Başak Rosti, Mahmoud Issa, Damir Musaev, Gifty Bhat, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” Journal of Medical Genetics. BMJ Publishing Group, 2018. https://doi.org/10.1136/jmedgenet-2017-104627.","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. Journal of Medical Genetics. 2018;55(1):48-54. doi:10.1136/jmedgenet-2017-104627","apa":"Marin Valencia, I., Novarino, G., Johansen, A., Rosti, B., Issa, M., Musaev, D., … Gleeson, J. (2018). A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. BMJ Publishing Group. https://doi.org/10.1136/jmedgenet-2017-104627","mla":"Marin Valencia, Isaac, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” Journal of Medical Genetics, vol. 55, no. 1, BMJ Publishing Group, 2018, pp. 48–54, doi:10.1136/jmedgenet-2017-104627.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Marin Valencia","first_name":"Isaac","full_name":"Marin Valencia, Isaac"},{"full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia","orcid":"0000-0002-7673-7178","last_name":"Novarino"},{"last_name":"Johansen","first_name":"Anide","full_name":"Johansen, Anide"},{"last_name":"Rosti","full_name":"Rosti, Başak","first_name":"Başak"},{"last_name":"Issa","first_name":"Mahmoud","full_name":"Issa, Mahmoud"},{"full_name":"Musaev, Damir","first_name":"Damir","last_name":"Musaev"},{"last_name":"Bhat","first_name":"Gifty","full_name":"Bhat, Gifty"},{"last_name":"Scott","first_name":"Eric","full_name":"Scott, Eric"},{"full_name":"Silhavy, Jennifer","first_name":"Jennifer","last_name":"Silhavy"},{"last_name":"Stanley","first_name":"Valentina","full_name":"Stanley, Valentina"},{"first_name":"Rasim","full_name":"Rosti, Rasim","last_name":"Rosti"},{"last_name":"Gleeson","full_name":"Gleeson, Jeremy","first_name":"Jeremy"},{"last_name":"Imam","first_name":"Farhad","full_name":"Imam, Farhad"},{"last_name":"Zaki","full_name":"Zaki, Maha","first_name":"Maha"},{"last_name":"Gleeson","full_name":"Gleeson, Joseph","first_name":"Joseph"}],"oa":1,"type":"journal_article","project":[{"grant_number":"401299","name":"Probing development and reversibility of autism spectrum disorders","_id":"254BA948-B435-11E9-9278-68D0E5697425"}],"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","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6056005/"}],"year":"2018","publication":"Journal of Medical Genetics","article_processing_charge":"No","volume":55,"date_created":"2018-12-11T11:47:57Z","issue":"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."}],"publist_id":"7016","doi":"10.1136/jmedgenet-2017-104627","status":"public","pmid":1,"publication_identifier":{"issn":["0022-2593"]},"publication_status":"published","day":"01","isi":1,"month":"01","publisher":"BMJ Publishing Group","language":[{"iso":"eng"}],"intvolume":" 55","page":"48 - 54","article_type":"original"},{"date_created":"2018-12-11T11:47:57Z","ddc":["510"],"article_processing_charge":"Yes (via OA deal)","volume":194,"publication":"Geometriae Dedicata","year":"2018","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","title":"3-Webs generated by confocal conics and circles","date_published":"2018-06-01T00:00:00Z","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"type":"journal_article","oa":1,"author":[{"last_name":"Akopyan","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy"}],"citation":{"chicago":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0265-6.","short":"A. Akopyan, Geometriae Dedicata 194 (2018) 55–64.","ama":"Akopyan A. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 2018;194(1):55-64. doi:10.1007/s10711-017-0265-6","ieee":"A. Akopyan, “3-Webs generated by confocal conics and circles,” Geometriae Dedicata, vol. 194, no. 1. Springer, pp. 55–64, 2018.","apa":"Akopyan, A. (2018). 3-Webs generated by confocal conics and circles. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0265-6","mla":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae Dedicata, vol. 194, no. 1, Springer, 2018, pp. 55–64, doi:10.1007/s10711-017-0265-6.","ista":"Akopyan A. 2018. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 194(1), 55–64."},"has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"file_size":1140860,"content_type":"application/pdf","date_updated":"2020-07-14T12:47:44Z","file_name":"2018_Springer_Akopyan.pdf","date_created":"2020-01-03T11:35:08Z","file_id":"7222","access_level":"open_access","creator":"kschuh","relation":"main_file","checksum":"1febcfc1266486053a069e3425ea3713"}],"department":[{"_id":"HeEd"}],"oa_version":"Published Version","date_updated":"2023-09-08T11:40:29Z","_id":"692","scopus_import":"1","file_date_updated":"2020-07-14T12:47:44Z","external_id":{"isi":["000431418800004"]},"article_type":"original","page":"55 - 64","intvolume":" 194","language":[{"iso":"eng"}],"publisher":"Springer","month":"06","isi":1,"ec_funded":1,"day":"01","publication_status":"published","status":"public","abstract":[{"lang":"eng","text":"We consider families of confocal conics and two pencils of Apollonian circles having the same foci. We will show that these families of curves generate trivial 3-webs and find the exact formulas describing them."}],"doi":"10.1007/s10711-017-0265-6","publist_id":"7014","issue":"1"},{"publisher":"Springer Nature","language":[{"iso":"eng"}],"intvolume":" 10957","page":"480-499","doi":"10.1007/978-3-662-58387-6_26","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"}],"status":"public","publication_identifier":{"isbn":["9783662583869","9783662583876"],"eissn":["1611-3349"],"issn":["0302-9743"]},"publication_status":"published","day":"07","ec_funded":1,"alternative_title":["LNCS"],"isi":1,"month":"12","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"title":"SpaceMint: A cryptocurrency based on proofs of space","date_published":"2018-12-07T00:00:00Z","quality_controlled":"1","conference":{"name":"FC: Financial Cryptography and Data Security","end_date":"2018-03-02","start_date":"2018-02-26","location":"Nieuwpoort, Curacao"},"main_file_link":[{"url":"https://eprint.iacr.org/2015/528","open_access":"1"}],"year":"2018","publication":"22nd International Conference on Financial Cryptography and Data Security","article_processing_charge":"No","volume":10957,"date_created":"2019-10-14T06:35:38Z","external_id":{"isi":["000540656400026"]},"scopus_import":"1","_id":"6941","oa_version":"Submitted Version","date_updated":"2023-09-19T15:02:13Z","department":[{"_id":"KrPi"}],"citation":{"apa":"Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., & Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd International Conference on Financial Cryptography and Data Security (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. https://doi.org/10.1007/978-3-662-58387-6_26","mla":"Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” 22nd International Conference on Financial Cryptography and Data Security, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26.","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.","ieee":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak, “SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.","chicago":"Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen, and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” In 22nd International Conference on Financial Cryptography and Data Security, 10957:480–99. Springer Nature, 2018. https://doi.org/10.1007/978-3-662-58387-6_26.","ama":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: 22nd International Conference on Financial Cryptography and Data Security. Vol 10957. Springer Nature; 2018:480-499. doi:10.1007/978-3-662-58387-6_26","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."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Sunoo","full_name":"Park, Sunoo","last_name":"Park"},{"last_name":"Kwon","full_name":"Kwon, Albert","first_name":"Albert"},{"last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter","last_name":"Gazi"},{"last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","last_name":"Pietrzak"}],"oa":1,"type":"conference"},{"date_updated":"2023-10-17T11:50:05Z","oa_version":"Published Version","department":[{"_id":"SyCr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"N. Stroeymeyt, A. V. Grasse, A. Crespi, D. Mersch, S. Cremer, and L. Keller, “Social network plasticity decreases disease transmission in a eusocial insect,” Science, vol. 362, no. 6417. AAAS, pp. 941–945, 2018.","ama":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network plasticity decreases disease transmission in a eusocial insect. Science. 2018;362(6417):941-945. doi:10.1126/science.aat4793","short":"N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, Science 362 (2018) 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.” Science. AAAS, 2018. https://doi.org/10.1126/science.aat4793.","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.","mla":"Stroeymeyt, Nathalie, et al. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Science, vol. 362, no. 6417, AAAS, 2018, pp. 941–45, doi:10.1126/science.aat4793.","apa":"Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., & Keller, L. (2018). Social network plasticity decreases disease transmission in a eusocial insect. Science. AAAS. https://doi.org/10.1126/science.aat4793"},"oa":1,"author":[{"last_name":"Stroeymeyt","full_name":"Stroeymeyt, Nathalie","first_name":"Nathalie"},{"first_name":"Anna V","full_name":"Grasse, Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87","last_name":"Grasse"},{"last_name":"Crespi","first_name":"Alessandro","full_name":"Crespi, Alessandro"},{"first_name":"Danielle","full_name":"Mersch, Danielle","last_name":"Mersch"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","last_name":"Cremer"},{"last_name":"Keller","first_name":"Laurent","full_name":"Keller, Laurent"}],"type":"journal_article","external_id":{"isi":["000451124500041"]},"scopus_import":"1","_id":"7","year":"2018","main_file_link":[{"open_access":"1","url":"https://serval.unil.ch/resource/serval:BIB_E9228C205467.P001/REF.pdf"}],"publication":"Science","volume":362,"article_processing_charge":"No","date_created":"2018-12-11T11:44:07Z","project":[{"_id":"25DC711C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"243071","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects"}],"date_published":"2018-11-23T00:00:00Z","title":"Social network plasticity decreases disease transmission in a eusocial insect","quality_controlled":"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.","publication_status":"published","day":"23","ec_funded":1,"isi":1,"month":"11","related_material":{"record":[{"status":"public","relation":"research_data","id":"13055"}],"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/for-ants-unity-is-strength-and-health/","relation":"press_release"}]},"issue":"6417","publist_id":"8049","abstract":[{"lang":"eng","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."}],"doi":"10.1126/science.aat4793","status":"public","publication_identifier":{"issn":["1095-9203"]},"language":[{"iso":"eng"}],"intvolume":" 362","page":"941 - 945","article_type":"original","publisher":"AAAS"},{"oa_version":"Published Version","date_updated":"2023-10-10T13:11:29Z","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"file":[{"checksum":"2ded46aa284a836a8cbb34133a64f1cb","relation":"main_file","creator":"kschuh","access_level":"open_access","file_id":"5981","date_created":"2019-02-14T09:44:10Z","file_name":"2018_ALEA_Nejjar.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:46Z","file_size":394851}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"ieee":"P. Nejjar, “Transition to shocks in TASEP and decoupling of last passage times,” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1311–1334, 2018.","chicago":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada, 2018. https://doi.org/10.30757/ALEA.v15-49.","ama":"Nejjar P. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 2018;15(2):1311-1334. doi:10.30757/ALEA.v15-49","short":"P. Nejjar, Latin American Journal of Probability and Mathematical Statistics 15 (2018) 1311–1334.","apa":"Nejjar, P. (2018). Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v15-49","mla":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2, Instituto Nacional de Matematica Pura e Aplicada, 2018, pp. 1311–34, doi:10.30757/ALEA.v15-49.","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."},"author":[{"last_name":"Nejjar","first_name":"Peter","full_name":"Nejjar, Peter","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"type":"journal_article","external_id":{"arxiv":["1705.08836"],"isi":["000460475800022"]},"file_date_updated":"2020-07-14T12:47:46Z","scopus_import":"1","_id":"70","year":"2018","publication":"Latin American Journal of Probability and Mathematical Statistics","article_processing_charge":"No","volume":15,"ddc":["510"],"date_created":"2018-12-11T11:44:28Z","project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"},{"name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"title":"Transition to shocks in TASEP and decoupling of last passage times","date_published":"2018-10-01T00:00:00Z","quality_controlled":"1","publication_status":"published","day":"01","ec_funded":1,"isi":1,"month":"10","issue":"2","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."}],"doi":"10.30757/ALEA.v15-49","status":"public","publication_identifier":{"issn":["1980-0436"]},"arxiv":1,"language":[{"iso":"eng"}],"intvolume":" 15","page":"1311-1334","article_type":"original","publisher":"Instituto Nacional de Matematica Pura e Aplicada"},{"month":"07","day":"01","publication_status":"published","publication_identifier":{"issn":["01628828"]},"status":"public","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."}],"publist_id":"6992","doi":"10.1109/TPAMI.2017.2730884","issue":"7","page":"1668-1682","intvolume":" 40","language":[{"iso":"eng"}],"arxiv":1,"publisher":"IEEE","type":"journal_article","oa":1,"author":[{"last_name":"Shekhovtsov","first_name":"Alexander","full_name":"Shekhovtsov, Alexander"},{"last_name":"Swoboda","first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","full_name":"Swoboda, Paul"},{"full_name":"Savchynskyy, Bogdan","first_name":"Bogdan","last_name":"Savchynskyy"}],"citation":{"mla":"Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.","apa":"Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884","ista":"Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682.","ieee":"A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.","chicago":"Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884.","short":"A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.","ama":"Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"VlKo"}],"date_updated":"2021-01-12T08:11:32Z","oa_version":"Preprint","_id":"703","scopus_import":1,"external_id":{"arxiv":["1508.07902"]},"date_created":"2018-12-11T11:48:01Z","volume":40,"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","year":"2018","main_file_link":[{"url":"https://arxiv.org/abs/1508.07902","open_access":"1"}],"quality_controlled":"1","title":"Maximum persistency via iterative relaxed inference with graphical models","date_published":"2018-07-01T00:00:00Z"},{"publisher":"Springer","language":[{"iso":"eng"}],"intvolume":" 55","page":"4857 – 4869","issue":"6","abstract":[{"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.","lang":"eng"}],"publist_id":"6991","doi":"10.1007/s12035-017-0688-y","status":"public","publication_status":"published","day":"01","isi":1,"month":"06","date_published":"2018-06-01T00:00:00Z","title":"Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes","quality_controlled":"1","year":"2018","publication":"Molecular Neurobiology","volume":55,"article_processing_charge":"No","date_created":"2018-12-11T11:48:02Z","external_id":{"isi":["000431991500025"]},"scopus_import":"1","_id":"705","oa_version":"None","date_updated":"2023-09-19T09:58:11Z","department":[{"_id":"RySh"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Miklosi, Andras, Giorgia Del Favero, Tanja Bulat, Harald Höger, Ryuichi Shigemoto, Doris Marko, and Gert Lubec. “Super Resolution Microscopical Localization of Dopamine Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology. Springer, 2018. https://doi.org/10.1007/s12035-017-0688-y.","short":"A. Miklosi, G. Del Favero, T. Bulat, H. Höger, R. Shigemoto, D. Marko, G. Lubec, Molecular Neurobiology 55 (2018) 4857 – 4869.","ama":"Miklosi A, Del Favero G, Bulat T, et al. Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology. 2018;55(6):4857 – 4869. doi:10.1007/s12035-017-0688-y","ieee":"A. Miklosi et al., “Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes,” Molecular Neurobiology, vol. 55, no. 6. Springer, pp. 4857 – 4869, 2018.","apa":"Miklosi, A., Del Favero, G., Bulat, T., Höger, H., Shigemoto, R., Marko, D., & Lubec, G. (2018). Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology. Springer. https://doi.org/10.1007/s12035-017-0688-y","mla":"Miklosi, Andras, et al. “Super Resolution Microscopical Localization of Dopamine Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology, vol. 55, no. 6, Springer, 2018, pp. 4857 – 4869, doi:10.1007/s12035-017-0688-y.","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."},"author":[{"first_name":"Andras","full_name":"Miklosi, Andras","last_name":"Miklosi"},{"full_name":"Del Favero, Giorgia","first_name":"Giorgia","last_name":"Del Favero"},{"first_name":"Tanja","full_name":"Bulat, Tanja","last_name":"Bulat"},{"first_name":"Harald","full_name":"Höger, Harald","last_name":"Höger"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"first_name":"Doris","full_name":"Marko, Doris","last_name":"Marko"},{"full_name":"Lubec, Gert","first_name":"Gert","last_name":"Lubec"}],"type":"journal_article"},{"publication_identifier":{"isbn":["9783893180783"],"issn":["2367-2005"]},"status":"public","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"}],"doi":"10.5441/002/EDBT.2018.14","month":"03","day":"26","publication_status":"published","publisher":"OpenProceedings","page":"145-156","language":[{"iso":"eng"}],"_id":"7116","file_date_updated":"2020-07-14T12:47:49Z","scopus_import":1,"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Grubic, Demjan, Leo Tam, Dan-Adrian Alistarh, and Ce Zhang. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” In Proceedings of the 21st International Conference on Extending Database Technology, 145–56. OpenProceedings, 2018. https://doi.org/10.5441/002/EDBT.2018.14.","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.","ama":"Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In: Proceedings of the 21st International Conference on Extending Database Technology. OpenProceedings; 2018:145-156. doi:10.5441/002/EDBT.2018.14","ieee":"D. Grubic, L. Tam, D.-A. Alistarh, and C. Zhang, “Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study,” in Proceedings of the 21st International Conference on Extending Database Technology, Vienna, Austria, 2018, pp. 145–156.","apa":"Grubic, D., Tam, L., Alistarh, D.-A., & Zhang, C. (2018). Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In Proceedings of the 21st International Conference on Extending Database Technology (pp. 145–156). Vienna, Austria: OpenProceedings. https://doi.org/10.5441/002/EDBT.2018.14","mla":"Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–56, doi:10.5441/002/EDBT.2018.14.","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."},"has_accepted_license":"1","author":[{"last_name":"Grubic","first_name":"Demjan","full_name":"Grubic, Demjan"},{"full_name":"Tam, Leo","first_name":"Leo","last_name":"Tam"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"last_name":"Zhang","full_name":"Zhang, Ce","first_name":"Ce"}],"oa":1,"oa_version":"Published Version","date_updated":"2023-02-23T12:59:17Z","file":[{"creator":"dernst","relation":"main_file","checksum":"ec979b56abc71016d6e6adfdadbb4afe","file_size":1603204,"content_type":"application/pdf","date_updated":"2020-07-14T12:47:49Z","file_name":"2018_OpenProceedings_Grubic.pdf","date_created":"2019-11-26T14:23:04Z","file_id":"7118","access_level":"open_access"}],"department":[{"_id":"DaAl"}],"tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"conference":{"name":"EDBT: Conference on Extending Database Technology","location":"Vienna, Austria","start_date":"2018-03-26","end_date":"2018-03-29"},"quality_controlled":"1","title":"Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study","date_published":"2018-03-26T00:00:00Z","ddc":["000"],"date_created":"2019-11-26T14:19:11Z","publication":"Proceedings of the 21st International Conference on Extending Database Technology","article_processing_charge":"No","year":"2018"},{"publication":"Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms","article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/1704.04947","open_access":"1"}],"year":"2018","date_created":"2019-11-26T15:10:55Z","quality_controlled":"1","title":"Space-optimal majority in population protocols","date_published":"2018-01-30T00:00:00Z","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2018-01-10","start_date":"2018-01-07","location":"New Orleans, LA, United States"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"D.-A. Alistarh, J. Aspnes, and R. Gelashvili, “Space-optimal majority in population protocols,” in Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 2221–2239.","short":"D.-A. Alistarh, J. Aspnes, R. Gelashvili, in:, Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–2239.","ama":"Alistarh D-A, Aspnes J, Gelashvili R. Space-optimal majority in population protocols. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM; 2018:2221-2239. doi:10.1137/1.9781611975031.144","chicago":"Alistarh, Dan-Adrian, James Aspnes, and Rati Gelashvili. “Space-Optimal Majority in Population Protocols.” In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, 2221–39. ACM, 2018. https://doi.org/10.1137/1.9781611975031.144.","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.","mla":"Alistarh, Dan-Adrian, et al. “Space-Optimal Majority in Population Protocols.” Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–39, doi:10.1137/1.9781611975031.144.","apa":"Alistarh, D.-A., Aspnes, J., & Gelashvili, R. (2018). Space-optimal majority in population protocols. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2221–2239). New Orleans, LA, United States: ACM. https://doi.org/10.1137/1.9781611975031.144"},"oa":1,"author":[{"last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"},{"last_name":"Aspnes","first_name":"James","full_name":"Aspnes, James"},{"first_name":"Rati","full_name":"Gelashvili, Rati","last_name":"Gelashvili"}],"date_updated":"2023-09-19T15:03:16Z","oa_version":"Preprint","department":[{"_id":"DaAl"}],"type":"conference","external_id":{"isi":["000483921200145"],"arxiv":["1704.04947"]},"_id":"7123","language":[{"iso":"eng"}],"arxiv":1,"page":"2221-2239","publisher":"ACM","day":"30","publication_status":"published","isi":1,"month":"01","doi":"10.1137/1.9781611975031.144","abstract":[{"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.","lang":"eng"}],"publication_identifier":{"isbn":["9781611975031"]},"status":"public"},{"year":"2018","publication":"Algorithmica","article_processing_charge":"No","volume":80,"ddc":["576"],"date_created":"2018-12-11T11:48:09Z","project":[{"call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation"}],"title":"How to escape local optima in black box optimisation when non elitism outperforms elitism","date_published":"2018-05-01T00:00:00Z","quality_controlled":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa_version":"Published Version","date_updated":"2023-09-11T14:11:35Z","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"file":[{"file_name":"IST-2018-1014-v1+1_2018_Paixao_Escape.pdf","date_updated":"2020-07-14T12:47:54Z","content_type":"application/pdf","file_size":691245,"access_level":"open_access","file_id":"4674","date_created":"2018-12-12T10:08:14Z","checksum":"7d92f5d7be81e387edeec4f06442791c","relation":"main_file","creator":"system"}],"citation":{"apa":"Oliveto, P., Paixao, T., Pérez Heredia, J., Sudholt, D., & Trubenova, B. (2018). How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. Springer. https://doi.org/10.1007/s00453-017-0369-2","mla":"Oliveto, Pietro, et al. “How to Escape Local Optima in Black Box Optimisation When Non Elitism Outperforms Elitism.” Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1604–33, doi:10.1007/s00453-017-0369-2.","ista":"Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. 2018. How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. 80(5), 1604–1633.","chicago":"Oliveto, Pietro, Tiago Paixao, Jorge Pérez Heredia, Dirk Sudholt, and Barbora Trubenova. “How to Escape Local Optima in Black Box Optimisation When Non Elitism Outperforms Elitism.” Algorithmica. Springer, 2018. https://doi.org/10.1007/s00453-017-0369-2.","short":"P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, B. Trubenova, Algorithmica 80 (2018) 1604–1633.","ama":"Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. 2018;80(5):1604-1633. doi:10.1007/s00453-017-0369-2","ieee":"P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, and B. Trubenova, “How to escape local optima in black box optimisation when non elitism outperforms elitism,” Algorithmica, vol. 80, no. 5. Springer, pp. 1604–1633, 2018."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","author":[{"full_name":"Oliveto, Pietro","first_name":"Pietro","last_name":"Oliveto"},{"orcid":"0000-0003-2361-3953","full_name":"Paixao, Tiago","first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","last_name":"Paixao"},{"full_name":"Pérez Heredia, Jorge","first_name":"Jorge","last_name":"Pérez Heredia"},{"last_name":"Sudholt","first_name":"Dirk","full_name":"Sudholt, Dirk"},{"first_name":"Barbora","full_name":"Trubenova, Barbora","id":"42302D54-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6873-2967","last_name":"Trubenova"}],"oa":1,"pubrep_id":"1014","type":"journal_article","external_id":{"isi":["000428239300010"]},"file_date_updated":"2020-07-14T12:47:54Z","scopus_import":"1","_id":"723","language":[{"iso":"eng"}],"intvolume":" 80","page":"1604 - 1633","publisher":"Springer","publication_status":"published","day":"01","ec_funded":1,"isi":1,"month":"05","issue":"5","doi":"10.1007/s00453-017-0369-2","publist_id":"6957","abstract":[{"lang":"eng","text":"Escaping local optima is one of the major obstacles to function optimisation. Using the metaphor of a fitness landscape, local optima correspond to hills separated by fitness valleys that have to be overcome. We define a class of fitness valleys of tunable difficulty by considering their length, representing the Hamming path between the two optima and their depth, the drop in fitness. For this function class we present a runtime comparison between stochastic search algorithms using different search strategies. The (1+1) EA is a simple and well-studied evolutionary algorithm that has to jump across the valley to a point of higher fitness because it does not accept worsening moves (elitism). In contrast, the Metropolis algorithm and the Strong Selection Weak Mutation (SSWM) algorithm, a famous process in population genetics, are both able to cross the fitness valley by accepting worsening moves. We show that the runtime of the (1+1) EA depends critically on the length of the valley while the runtimes of the non-elitist algorithms depend crucially on the depth of the valley. Moreover, we show that both SSWM and Metropolis can also efficiently optimise a rugged function consisting of consecutive valleys."}],"status":"public"},{"pubrep_id":"960","type":"journal_article","file":[{"creator":"system","checksum":"c2590ef160709d8054cf29ee173f1454","relation":"main_file","file_id":"5267","date_created":"2018-12-12T10:17:14Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:47:56Z","file_size":1163507,"file_name":"IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf"}],"department":[{"_id":"KrCh"}],"oa_version":"Published Version","date_updated":"2023-09-27T12:52:38Z","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexander","full_name":"Kößler, Alexander","last_name":"Kößler"},{"last_name":"Schmid","full_name":"Schmid, Ulrich","first_name":"Ulrich"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","citation":{"ama":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 2018;54(1):166-207. doi:10.1007/s11241-017-9293-4","short":"K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54 (2018) 166–207.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4.","ieee":"K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1. Springer, pp. 166–207, 2018.","ista":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.","apa":"Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. Springer. https://doi.org/10.1007/s11241-017-9293-4","mla":"Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems, vol. 54, no. 1, Springer, 2018, pp. 166–207, doi:10.1007/s11241-017-9293-4."},"_id":"738","external_id":{"isi":["000419955500006"]},"scopus_import":"1","file_date_updated":"2020-07-14T12:47:56Z","date_created":"2018-12-11T11:48:14Z","ddc":["000"],"year":"2018","volume":54,"article_processing_charge":"No","publication":"Real-Time Systems","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Automated competitive analysis of real time scheduling with graph games","date_published":"2018-01-01T00:00:00Z","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2820"}]},"month":"01","isi":1,"publication_status":"published","ec_funded":1,"day":"01","status":"public","issue":"1","doi":"10.1007/s11241-017-9293-4","publist_id":"6929","abstract":[{"text":"This paper is devoted to automatic competitive analysis of real-time scheduling algorithms for firm-deadline tasksets, where only completed tasks con- tribute some utility to the system. Given such a taskset T , the competitive ratio of an on-line scheduling algorithm A for T is the worst-case utility ratio of A over the utility achieved by a clairvoyant algorithm. We leverage the theory of quantitative graph games to address the competitive analysis and competitive synthesis problems. For the competitive analysis case, given any taskset T and any finite-memory on- line scheduling algorithm A , we show that the competitive ratio of A in T can be computed in polynomial time in the size of the state space of A . Our approach is flexible as it also provides ways to model meaningful constraints on the released task sequences that determine the competitive ratio. We provide an experimental study of many well-known on-line scheduling algorithms, which demonstrates the feasibility of our competitive analysis approach that effectively replaces human ingenuity (required Preliminary versions of this paper have appeared in Chatterjee et al. ( 2013 , 2014 ). B Andreas Pavlogiannis pavlogiannis@ist.ac.at Krishnendu Chatterjee krish.chat@ist.ac.at Alexander Kößler koe@ecs.tuwien.ac.at Ulrich Schmid s@ecs.tuwien.ac.at 1 IST Austria (Institute of Science and Technology Austria), Am Campus 1, 3400 Klosterneuburg, Austria 2 Embedded Computing Systems Group, Vienna University of Technology, Treitlstrasse 3, 1040 Vienna, Austria 123 Real-Time Syst for finding worst-case scenarios) by computing power. For the competitive synthesis case, we are just given a taskset T , and the goal is to automatically synthesize an opti- mal on-line scheduling algorithm A , i.e., one that guarantees the largest competitive ratio possible for T . We show how the competitive synthesis problem can be reduced to a two-player graph game with partial information, and establish that the compu- tational complexity of solving this game is Np -complete. The competitive synthesis problem is hence in Np in the size of the state space of the non-deterministic labeled transition system encoding the taskset. Overall, the proposed framework assists in the selection of suitable scheduling algorithms for a given taskset, which is in fact the most common situation in real-time systems design. ","lang":"eng"}],"intvolume":" 54","page":"166 - 207","language":[{"iso":"eng"}],"publisher":"Springer"},{"quality_controlled":"1","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"date_published":"2018-12-31T00:00:00Z","title":"Proofs of catalytic space","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"conference":{"name":"ITCS: Innovations in theoretical Computer Science Conference","end_date":"2019-01-12","start_date":"2019-01-10","location":"San Diego, CA, United States"},"publication":"10th Innovations in Theoretical Computer Science Conference (ITCS 2019)","article_processing_charge":"No","volume":124,"year":"2018","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/194"}],"ddc":["000"],"date_created":"2020-01-30T09:16:05Z","file_date_updated":"2020-07-14T12:47:57Z","scopus_import":1,"_id":"7407","has_accepted_license":"1","citation":{"ista":"Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). ITCS: Innovations in theoretical Computer Science Conference, LIPIcs, vol. 124, 59:1-59:25.","mla":"Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.","apa":"Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.59","ama":"Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.","chicago":"Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 124:59:1-59:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59.","ieee":"K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), San Diego, CA, United States, 2018, vol. 124, p. 59:1-59:25."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"oa":1,"date_updated":"2021-01-12T08:13:26Z","oa_version":"Published Version","department":[{"_id":"KrPi"}],"file":[{"relation":"main_file","checksum":"5cebb7f7849a3beda898f697d755dd96","creator":"dernst","file_name":"2018_LIPIcs_Pietrzak.pdf","file_size":822884,"content_type":"application/pdf","date_updated":"2020-07-14T12:47:57Z","access_level":"open_access","date_created":"2020-02-04T08:17:52Z","file_id":"7443"}],"type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","language":[{"iso":"eng"}],"page":"59:1-59:25","intvolume":" 124","doi":"10.4230/LIPICS.ITCS.2019.59","abstract":[{"lang":"eng","text":"Proofs of space (PoS) [Dziembowski et al., CRYPTO'15] are proof systems where a prover can convince a verifier that he \"wastes\" disk space. PoS were introduced as a more ecological and economical replacement for proofs of work which are currently used to secure blockchains like Bitcoin. In this work we investigate extensions of PoS which allow the prover to embed useful data into the dedicated space, which later can be recovered. Our first contribution is a security proof for the original PoS from CRYPTO'15 in the random oracle model (the original proof only applied to a restricted class of adversaries which can store a subset of the data an honest prover would store). When this PoS is instantiated with recent constructions of maximally depth robust graphs, our proof implies basically optimal security. As a second contribution we show three different extensions of this PoS where useful data can be embedded into the space required by the prover. Our security proof for the PoS extends (non-trivially) to these constructions. We discuss how some of these variants can be used as proofs of catalytic space (PoCS), a notion we put forward in this work, and which basically is a PoS where most of the space required by the prover can be used to backup useful data. Finally we discuss how one of the extensions is a candidate construction for a proof of replication (PoR), a proof system recently suggested in the Filecoin whitepaper. "}],"publication_identifier":{"isbn":["978-3-95977-095-8"],"issn":["1868-8969"]},"status":"public","day":"31","ec_funded":1,"publication_status":"published","month":"12","alternative_title":["LIPIcs"]},{"publication_status":"published","day":"01","isi":1,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1378"}]},"month":"08","issue":"1","doi":"10.1007/s10711-017-0291-4","abstract":[{"text":"We give a detailed and easily accessible proof of Gromov’s Topological Overlap Theorem. Let X be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension d. Informally, the theorem states that if X has sufficiently strong higher-dimensional expansion properties (which generalize edge expansion of graphs and are defined in terms of cellular cochains of X) then X has the following topological overlap property: for every continuous map (Formula presented.) there exists a point (Formula presented.) that is contained in the images of a positive fraction (Formula presented.) of the d-cells of X. More generally, the conclusion holds if (Formula presented.) is replaced by any d-dimensional piecewise-linear manifold M, with a constant (Formula presented.) that depends only on d and on the expansion properties of X, but not on M.","lang":"eng"}],"publist_id":"6925","status":"public","language":[{"iso":"eng"}],"intvolume":" 195","page":"307–317","publisher":"Springer","date_updated":"2023-09-27T12:29:57Z","oa_version":"Published Version","file":[{"relation":"main_file","checksum":"d2f70fc132156504aa4c626aa378a7ab","creator":"kschuh","access_level":"open_access","date_created":"2019-01-15T13:44:05Z","file_id":"5835","file_name":"s10711-017-0291-4.pdf","file_size":412486,"date_updated":"2020-07-14T12:47:58Z","content_type":"application/pdf"}],"department":[{"_id":"UlWa"}],"has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"D. Dotterrer, T. Kaufman, U. Wagner, Geometriae Dedicata 195 (2018) 307–317.","ama":"Dotterrer D, Kaufman T, Wagner U. On expansion and topological overlap. Geometriae Dedicata. 2018;195(1):307–317. doi:10.1007/s10711-017-0291-4","chicago":"Dotterrer, Dominic, Tali Kaufman, and Uli Wagner. “On Expansion and Topological Overlap.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0291-4.","ieee":"D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,” Geometriae Dedicata, vol. 195, no. 1. Springer, pp. 307–317, 2018.","ista":"Dotterrer D, Kaufman T, Wagner U. 2018. On expansion and topological overlap. Geometriae Dedicata. 195(1), 307–317.","apa":"Dotterrer, D., Kaufman, T., & Wagner, U. (2018). On expansion and topological overlap. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0291-4","mla":"Dotterrer, Dominic, et al. “On Expansion and Topological Overlap.” Geometriae Dedicata, vol. 195, no. 1, Springer, 2018, pp. 307–317, doi:10.1007/s10711-017-0291-4."},"oa":1,"author":[{"first_name":"Dominic","full_name":"Dotterrer, Dominic","last_name":"Dotterrer"},{"last_name":"Kaufman","first_name":"Tali","full_name":"Kaufman, Tali"},{"orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","full_name":"Wagner, Uli","last_name":"Wagner"}],"pubrep_id":"912","type":"journal_article","external_id":{"isi":["000437122700017"]},"file_date_updated":"2020-07-14T12:47:58Z","scopus_import":"1","_id":"742","year":"2018","publication":"Geometriae Dedicata","article_processing_charge":"Yes (via OA deal)","volume":195,"ddc":["514","516"],"date_created":"2018-12-11T11:48:16Z","project":[{"grant_number":"PP00P2_138948","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","_id":"25FA3206-B435-11E9-9278-68D0E5697425"}],"title":"On expansion and topological overlap","date_published":"2018-08-01T00:00:00Z","quality_controlled":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}}]