[{"date_published":"2018-01-01T00:00:00Z","scopus_import":1,"publication":"Geometry and Physics: Volume I","publisher":"Oxford University Press","day":"01","language":[{"iso":"eng"}],"department":[{"_id":"TaHa"}],"abstract":[{"lang":"eng","text":"This chapter finds an agreement of equivariant indices of semi-classical homomorphisms between pairwise mirror branes in the GL2 Higgs moduli space on a Riemann surface. On one side of the agreement, components of the Lagrangian brane of U(1,1) Higgs bundles, whose mirror was proposed by Hitchin to be certain even exterior powers of the hyperholomorphic Dirac bundle on the SL2 Higgs moduli space, are present. The agreement arises from a mysterious functional equation. This gives strong computational evidence for Hitchin’s proposal."}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_created":"2019-06-06T12:42:01Z","doi":"10.1093/oso/9780198802013.003.0009","author":[{"full_name":"Hausel, Tamás","first_name":"Tamás","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel"},{"first_name":"Anton","full_name":"Mellit, Anton","last_name":"Mellit","id":"388D3134-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Du","full_name":"Pei, Du","last_name":"Pei"}],"status":"public","quality_controlled":"1","citation":{"mla":"Hausel, Tamás, et al. “Mirror Symmetry with Branes by Equivariant Verlinde Formulas.” <i>Geometry and Physics: Volume I</i>, Oxford University Press, 2018, pp. 189–218, doi:<a href=\"https://doi.org/10.1093/oso/9780198802013.003.0009\">10.1093/oso/9780198802013.003.0009</a>.","short":"T. Hausel, A. Mellit, D. Pei, in:, Geometry and Physics: Volume I, Oxford University Press, 2018, pp. 189–218.","ista":"Hausel T, Mellit A, Pei D. 2018.Mirror symmetry with branes by equivariant verlinde formulas. In: Geometry and Physics: Volume I. , 189–218.","ieee":"T. Hausel, A. Mellit, and D. Pei, “Mirror symmetry with branes by equivariant verlinde formulas,” in <i>Geometry and Physics: Volume I</i>, Oxford University Press, 2018, pp. 189–218.","apa":"Hausel, T., Mellit, A., &#38; Pei, D. (2018). Mirror symmetry with branes by equivariant verlinde formulas. In <i>Geometry and Physics: Volume I</i> (pp. 189–218). Oxford University Press. <a href=\"https://doi.org/10.1093/oso/9780198802013.003.0009\">https://doi.org/10.1093/oso/9780198802013.003.0009</a>","chicago":"Hausel, Tamás, Anton Mellit, and Du Pei. “Mirror Symmetry with Branes by Equivariant Verlinde Formulas.” In <i>Geometry and Physics: Volume I</i>, 189–218. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/oso/9780198802013.003.0009\">https://doi.org/10.1093/oso/9780198802013.003.0009</a>.","ama":"Hausel T, Mellit A, Pei D. Mirror symmetry with branes by equivariant verlinde formulas. In: <i>Geometry and Physics: Volume I</i>. Oxford University Press; 2018:189-218. doi:<a href=\"https://doi.org/10.1093/oso/9780198802013.003.0009\">10.1093/oso/9780198802013.003.0009</a>"},"oa_version":"None","publication_identifier":{"isbn":["9780198802013","9780191840500"]},"page":"189-218","month":"01","year":"2018","date_updated":"2021-01-12T08:07:52Z","type":"book_chapter","_id":"6525","title":"Mirror symmetry with branes by equivariant verlinde formulas"},{"publication_status":"published","quality_controlled":"1","citation":{"short":"D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 4613–4623.","mla":"Alistarh, Dan-Adrian, et al. “Byzantine Stochastic Gradient Descent.” <i>Advances in Neural Information Processing Systems</i>, vol. 2018, Neural Information Processing Systems Foundation, 2018, pp. 4613–23.","ista":"Alistarh D-A, Allen-Zhu Z, Li J. 2018. Byzantine stochastic gradient descent. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 2018, 4613–4623.","ieee":"D.-A. Alistarh, Z. Allen-Zhu, and J. Li, “Byzantine stochastic gradient descent,” in <i>Advances in Neural Information Processing Systems</i>, Montreal, Canada, 2018, vol. 2018, pp. 4613–4623.","chicago":"Alistarh, Dan-Adrian, Zeyuan Allen-Zhu, and Jerry Li. “Byzantine Stochastic Gradient Descent.” In <i>Advances in Neural Information Processing Systems</i>, 2018:4613–23. Neural Information Processing Systems Foundation, 2018.","apa":"Alistarh, D.-A., Allen-Zhu, Z., &#38; Li, J. (2018). Byzantine stochastic gradient descent. In <i>Advances in Neural Information Processing Systems</i> (Vol. 2018, pp. 4613–4623). Montreal, Canada: Neural Information Processing Systems Foundation.","ama":"Alistarh D-A, Allen-Zhu Z, Li J. Byzantine stochastic gradient descent. In: <i>Advances in Neural Information Processing Systems</i>. Vol 2018. Neural Information Processing Systems Foundation; 2018:4613-4623."},"publication":"Advances in Neural Information Processing Systems","scopus_import":"1","publisher":"Neural Information Processing Systems Foundation","language":[{"iso":"eng"}],"department":[{"_id":"DaAl"}],"abstract":[{"text":"This paper studies the problem of distributed stochastic optimization in an adversarial setting where, out of m machines which allegedly compute stochastic gradients every iteration, an α-fraction are Byzantine, and may behave adversarially. Our main result is a variant of stochastic gradient descent (SGD) which finds ε-approximate minimizers of convex functions in T=O~(1/ε²m+α²/ε²) iterations. In contrast, traditional mini-batch SGD needs T=O(1/ε²m) iterations, but cannot tolerate Byzantine failures. Further, we provide a lower bound showing that, up to logarithmic factors, our algorithm is information-theoretically optimal both in terms of sample complexity and time complexity.","lang":"eng"}],"type":"conference","main_file_link":[{"url":"https://arxiv.org/abs/1803.08917","open_access":"1"}],"arxiv":1,"page":"4613-4623","isi":1,"month":"12","intvolume":"      2018","date_created":"2019-06-13T08:22:37Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","volume":2018,"author":[{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Zeyuan","full_name":"Allen-Zhu, Zeyuan","last_name":"Allen-Zhu"},{"full_name":"Li, Jerry","first_name":"Jerry","last_name":"Li"}],"status":"public","oa_version":"Published Version","date_published":"2018-12-01T00:00:00Z","day":"01","external_id":{"isi":["000461823304061"],"arxiv":["1803.08917"]},"conference":{"start_date":"2018-12-02","end_date":"2018-12-08","location":"Montreal, Canada","name":"NeurIPS: Conference on Neural Information Processing Systems"},"date_updated":"2023-09-19T15:12:45Z","_id":"6558","article_processing_charge":"No","title":"Byzantine stochastic gradient descent","oa":1,"year":"2018"},{"arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1809.10505","open_access":"1"}],"type":"conference","isi":1,"month":"12","ec_funded":1,"page":"5973-5983","citation":{"apa":"Alistarh, D.-A., Hoefler, T., Johansson, M., Konstantinov, N. H., Khirirat, S., &#38; Renggli, C. (2018). The convergence of sparsified gradient methods. In <i>Advances in Neural Information Processing Systems 31</i> (Vol. Volume 2018, pp. 5973–5983). Montreal, Canada: Neural Information Processing Systems Foundation.","chicago":"Alistarh, Dan-Adrian, Torsten Hoefler, Mikael Johansson, Nikola H Konstantinov, Sarit Khirirat, and Cedric Renggli. “The Convergence of Sparsified Gradient Methods.” In <i>Advances in Neural Information Processing Systems 31</i>, Volume 2018:5973–83. Neural Information Processing Systems Foundation, 2018.","ama":"Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. The convergence of sparsified gradient methods. In: <i>Advances in Neural Information Processing Systems 31</i>. Vol Volume 2018. Neural Information Processing Systems Foundation; 2018:5973-5983.","mla":"Alistarh, Dan-Adrian, et al. “The Convergence of Sparsified Gradient Methods.” <i>Advances in Neural Information Processing Systems 31</i>, vol. Volume 2018, Neural Information Processing Systems Foundation, 2018, pp. 5973–83.","short":"D.-A. Alistarh, T. Hoefler, M. Johansson, N.H. Konstantinov, S. Khirirat, C. Renggli, in:, Advances in Neural Information Processing Systems 31, Neural Information Processing Systems Foundation, 2018, pp. 5973–5983.","ieee":"D.-A. Alistarh, T. Hoefler, M. Johansson, N. H. Konstantinov, S. Khirirat, and C. Renggli, “The convergence of sparsified gradient methods,” in <i>Advances in Neural Information Processing Systems 31</i>, Montreal, Canada, 2018, vol. Volume 2018, pp. 5973–5983.","ista":"Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. 2018. The convergence of sparsified gradient methods. Advances in Neural Information Processing Systems 31. NeurIPS: Conference on Neural Information Processing Systems vol. Volume 2018, 5973–5983."},"quality_controlled":"1","publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"DaAl"},{"_id":"ChLa"}],"abstract":[{"text":"Distributed training of massive machine learning models, in particular deep neural networks, via Stochastic Gradient Descent (SGD) is becoming commonplace. Several families of communication-reduction methods, such as quantization, large-batch methods, and gradient sparsification, have been proposed. To date, gradient sparsification methods--where each node sorts gradients by magnitude, and only communicates a subset of the components, accumulating the rest locally--are known to yield some of the largest practical gains. Such methods can reduce the amount of communication per step by up to \\emph{three orders of magnitude}, while preserving model accuracy. Yet, this family of methods currently has no theoretical justification. This is the question we address in this paper. We prove that, under analytic assumptions, sparsifying gradients by magnitude with local error correction provides convergence guarantees, for both convex and non-convex smooth objectives, for data-parallel SGD. The main insight is that sparsification methods implicitly maintain bounds on the maximum impact of stale updates, thanks to selection by magnitude. Our analysis and empirical validation also reveal that these methods do require analytical conditions to converge well, justifying existing heuristics.","lang":"eng"}],"scopus_import":"1","publication":"Advances in Neural Information Processing Systems 31","publisher":"Neural Information Processing Systems Foundation","title":"The convergence of sparsified gradient methods","article_processing_charge":"No","conference":{"location":"Montreal, Canada","name":"NeurIPS: Conference on Neural Information Processing Systems","end_date":"2018-12-08","start_date":"2018-12-02"},"_id":"6589","date_updated":"2023-10-17T11:47:20Z","year":"2018","project":[{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"oa":1,"author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"},{"full_name":"Hoefler, Torsten","first_name":"Torsten","last_name":"Hoefler"},{"last_name":"Johansson","first_name":"Mikael","full_name":"Johansson, Mikael"},{"id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","last_name":"Konstantinov","first_name":"Nikola H","full_name":"Konstantinov, Nikola H"},{"first_name":"Sarit","full_name":"Khirirat, Sarit","last_name":"Khirirat"},{"last_name":"Renggli","first_name":"Cedric","full_name":"Renggli, Cedric"}],"status":"public","oa_version":"Preprint","volume":"Volume 2018","date_created":"2019-06-27T09:32:55Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1809.10505"],"isi":["000461852000047"]},"date_published":"2018-12-01T00:00:00Z","day":"01"},{"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Amir","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady"},{"last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus"},{"full_name":"Velner, Yaron","first_name":"Yaron","last_name":"Velner"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:44:27Z","volume":118,"doi":"10.4230/LIPIcs.CONCUR.2018.11","external_id":{"arxiv":["1806.03108"]},"date_published":"2018-09-01T00:00:00Z","day":"01","article_processing_charge":"No","title":"Ergodic mean-payoff games for the analysis of attacks in crypto-currencies","conference":{"location":"Beijing, China","name":"CONCUR: Conference on Concurrency Theory","start_date":"2018-09-04","end_date":"2018-09-07"},"related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"date_updated":"2025-06-02T08:53:46Z","_id":"66","has_accepted_license":"1","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"year":"2018","publication_identifier":{"isbn":["978-3-95977-087-3"]},"oa":1,"alternative_title":["LIPIcs"],"quality_controlled":"1","citation":{"ama":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">10.4230/LIPIcs.CONCUR.2018.11</a>","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.11</a>.","apa":"Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., &#38; Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.11</a>","ista":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118, 11.","ieee":"K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.","short":"K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","mla":"Chatterjee, Krishnendu, et al. <i>Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies</i>. Vol. 118, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">10.4230/LIPIcs.CONCUR.2018.11</a>."},"publication_status":"published","license":"https://creativecommons.org/licenses/by/4.0/","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"publist_id":"7988","abstract":[{"lang":"eng","text":"Crypto-currencies are digital assets designed to work as a medium of exchange, e.g., Bitcoin, but they are susceptible to attacks (dishonest behavior of participants). A framework for the analysis of attacks in crypto-currencies requires (a) modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior; (b) concurrent interactions between participants; and (c) analysis of long-term monetary gains. Traditional game-theoretic approaches for the analysis of security protocols consider either qualitative temporal properties such as safety and termination, or the very special class of one-shot (stateless) games. However, to analyze general attacks on protocols for crypto-currencies, both stateful analysis and quantitative objectives are necessary. In this work our main contributions are as follows: (a) we show how a class of concurrent mean-payo games, namely ergodic games, can model various attacks that arise naturally in crypto-currencies; (b) we present the first practical implementation of algorithms for ergodic games that scales to model realistic problems for crypto-currencies; and (c) we present experimental results showing that our framework can handle games with thousands of states and millions of transitions."}],"file":[{"relation":"main_file","date_created":"2018-12-17T12:08:00Z","file_size":1078309,"date_updated":"2020-07-14T12:47:34Z","file_name":"2018_CONCUR_Chatterjee.pdf","checksum":"68a055b1aaa241cc38375083cf832a7d","content_type":"application/pdf","access_level":"open_access","creator":"dernst","file_id":"5696"}],"file_date_updated":"2020-07-14T12:47:34Z","scopus_import":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","arxiv":1,"ddc":["000"],"type":"conference","month":"09","intvolume":"       118","article_number":"11","ec_funded":1},{"citation":{"chicago":"Igler, Claudia, Mato Lagator, Gašper Tkačik, Jonathan P Bollback, and Calin C Guet. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.” <i>Nature Ecology and Evolution</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41559-018-0651-y\">https://doi.org/10.1038/s41559-018-0651-y</a>.","apa":"Igler, C., Lagator, M., Tkačik, G., Bollback, J. P., &#38; Guet, C. C. (2018). Evolutionary potential of transcription factors for gene regulatory rewiring. <i>Nature Ecology and Evolution</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41559-018-0651-y\">https://doi.org/10.1038/s41559-018-0651-y</a>","ama":"Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. Evolutionary potential of transcription factors for gene regulatory rewiring. <i>Nature Ecology and Evolution</i>. 2018;2(10):1633-1643. doi:<a href=\"https://doi.org/10.1038/s41559-018-0651-y\">10.1038/s41559-018-0651-y</a>","short":"C. Igler, M. Lagator, G. Tkačik, J.P. Bollback, C.C. Guet, Nature Ecology and Evolution 2 (2018) 1633–1643.","mla":"Igler, Claudia, et al. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.” <i>Nature Ecology and Evolution</i>, vol. 2, no. 10, Nature Publishing Group, 2018, pp. 1633–43, doi:<a href=\"https://doi.org/10.1038/s41559-018-0651-y\">10.1038/s41559-018-0651-y</a>.","ieee":"C. Igler, M. Lagator, G. Tkačik, J. P. Bollback, and C. C. Guet, “Evolutionary potential of transcription factors for gene regulatory rewiring,” <i>Nature Ecology and Evolution</i>, vol. 2, no. 10. Nature Publishing Group, pp. 1633–1643, 2018.","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."},"quality_controlled":"1","article_type":"original","publication_status":"published","abstract":[{"lang":"eng","text":"Gene regulatory networks evolve through rewiring of individual components—that is, through changes in regulatory connections. However, the mechanistic basis of regulatory rewiring is poorly understood. Using a canonical gene regulatory system, we quantify the properties of transcription factors that determine the evolutionary potential for rewiring of regulatory connections: robustness, tunability and evolvability. In vivo repression measurements of two repressors at mutated operator sites reveal their contrasting evolutionary potential: while robustness and evolvability were positively correlated, both were in trade-off with tunability. Epistatic interactions between adjacent operators alleviated this trade-off. A thermodynamic model explains how the differences in robustness, tunability and evolvability arise from biophysical characteristics of repressor–DNA binding. The model also uncovers that the energy matrix, which describes how mutations affect repressor–DNA binding, encodes crucial information about the evolutionary potential of a repressor. The biophysical determinants of evolutionary potential for regulatory rewiring constitute a mechanistic framework for understanding network evolution."}],"department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"JoBo"}],"language":[{"iso":"eng"}],"publist_id":"7987","publisher":"Nature Publishing Group","file_date_updated":"2020-07-14T12:47:37Z","file":[{"content_type":"application/pdf","checksum":"383a2e2c944a856e2e821ec8e7bf71b6","creator":"dernst","access_level":"open_access","file_id":"7830","relation":"main_file","file_size":1135973,"date_created":"2020-05-14T11:28:52Z","file_name":"2018_NatureEcology_Igler.pdf","date_updated":"2020-07-14T12:47:37Z"}],"scopus_import":"1","publication":"Nature Ecology and Evolution","type":"journal_article","ddc":["570"],"intvolume":"         2","month":"09","isi":1,"ec_funded":1,"page":"1633 - 1643","issue":"10","oa_version":"Submitted Version","status":"public","author":[{"full_name":"Igler, Claudia","first_name":"Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87","last_name":"Igler"},{"last_name":"Lagator","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","first_name":"Mato","full_name":"Lagator, Mato"},{"last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","first_name":"Gasper","full_name":"Tkacik, Gasper"},{"last_name":"Bollback","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4624-4612","first_name":"Jonathan P","full_name":"Bollback, Jonathan P"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet","first_name":"Calin C","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052"}],"doi":"10.1038/s41559-018-0651-y","volume":2,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:44:27Z","external_id":{"isi":["000447947600021"]},"day":"10","date_published":"2018-09-10T00:00:00Z","title":"Evolutionary potential of transcription factors for gene regulatory rewiring","article_processing_charge":"No","_id":"67","date_updated":"2024-03-25T23:30:27Z","related_material":{"record":[{"status":"public","id":"5585","relation":"popular_science"},{"relation":"dissertation_contains","status":"public","id":"6371"}]},"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"},{"name":"Selective Barriers to Horizontal Gene Transfer","_id":"2578D616-B435-11E9-9278-68D0E5697425","grant_number":"648440","call_identifier":"H2020"},{"grant_number":"24573","_id":"251EE76E-B435-11E9-9278-68D0E5697425","name":"Design principles underlying genetic switch architecture (DOC Fellowship)"}],"year":"2018","has_accepted_license":"1","oa":1},{"citation":{"chicago":"Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing Simplicial Representatives of Homotopy Group Elements.” <i>Journal of Applied and Computational Topology</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s41468-018-0021-5\">https://doi.org/10.1007/s41468-018-0021-5</a>.","apa":"Filakovský, M., Franek, P., Wagner, U., &#38; Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. <i>Journal of Applied and Computational Topology</i>. Springer. <a href=\"https://doi.org/10.1007/s41468-018-0021-5\">https://doi.org/10.1007/s41468-018-0021-5</a>","ama":"Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives of homotopy group elements. <i>Journal of Applied and Computational Topology</i>. 2018;2(3-4):177-231. doi:<a href=\"https://doi.org/10.1007/s41468-018-0021-5\">10.1007/s41468-018-0021-5</a>","mla":"Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.” <i>Journal of Applied and Computational Topology</i>, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:<a href=\"https://doi.org/10.1007/s41468-018-0021-5\">10.1007/s41468-018-0021-5</a>.","short":"M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.","ieee":"M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial representatives of homotopy group elements,” <i>Journal of Applied and Computational Topology</i>, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.","ista":"Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4), 177–231."},"quality_controlled":"1","publication_status":"published","article_type":"original","department":[{"_id":"UlWa"}],"language":[{"iso":"eng"}],"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(𝑋) ."}],"file":[{"access_level":"open_access","creator":"dernst","content_type":"application/pdf","checksum":"cf9e7fcd2a113dd4828774fc75cdb7e8","file_id":"6775","relation":"main_file","date_updated":"2020-07-14T12:47:40Z","file_name":"2018_JourAppliedComputTopology_Filakovsky.pdf","date_created":"2019-08-08T06:55:21Z","file_size":1056278}],"file_date_updated":"2020-07-14T12:47:40Z","publication":"Journal of Applied and Computational Topology","publisher":"Springer","type":"journal_article","ddc":["514"],"month":"12","intvolume":"         2","issue":"3-4","page":"177-231","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"last_name":"Filakovský","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","full_name":"Filakovský, Marek"},{"id":"473294AE-F248-11E8-B48F-1D18A9856A87","last_name":"Franek","first_name":"Peter","full_name":"Franek, Peter","orcid":"0000-0001-8878-8397"},{"full_name":"Wagner, Uli","first_name":"Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner"},{"id":"3AA52972-F248-11E8-B48F-1D18A9856A87","last_name":"Zhechev","full_name":"Zhechev, Stephan Y","first_name":"Stephan Y"}],"status":"public","oa_version":"Published Version","volume":2,"date_created":"2019-08-08T06:47:40Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/s41468-018-0021-5","date_published":"2018-12-01T00:00:00Z","day":"01","title":"Computing simplicial representatives of homotopy group elements","related_material":{"record":[{"id":"6681","relation":"dissertation_contains","status":"public"}]},"_id":"6774","date_updated":"2023-09-07T13:10:36Z","has_accepted_license":"1","year":"2018","project":[{"grant_number":"M01980","call_identifier":"FWF","name":"Robust invariants of Nonlinear Systems","_id":"25F8B9BC-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"}],"publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"oa":1},{"type":"dissertation","ddc":["004","519"],"degree_awarded":"PhD","ec_funded":1,"page":"92","month":"09","pubrep_id":"1048","supervisor":[{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887"}],"publication_status":"published","citation":{"short":"A. Zimin, Learning from Dependent Data, Institute of Science and Technology Austria, 2018.","mla":"Zimin, Alexander. <i>Learning from Dependent Data</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH1048\">10.15479/AT:ISTA:TH1048</a>.","ieee":"A. Zimin, “Learning from dependent data,” Institute of Science and Technology Austria, 2018.","ista":"Zimin A. 2018. Learning from dependent data. Institute of Science and Technology Austria.","apa":"Zimin, A. (2018). <i>Learning from dependent data</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:TH1048\">https://doi.org/10.15479/AT:ISTA:TH1048</a>","chicago":"Zimin, Alexander. “Learning from Dependent Data.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:TH1048\">https://doi.org/10.15479/AT:ISTA:TH1048</a>.","ama":"Zimin A. Learning from dependent data. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH1048\">10.15479/AT:ISTA:TH1048</a>"},"alternative_title":["ISTA Thesis"],"file_date_updated":"2020-07-14T12:47:40Z","file":[{"relation":"main_file","date_updated":"2020-07-14T12:47:40Z","file_name":"2018_Thesis_Zimin.pdf","file_size":1036137,"date_created":"2019-04-09T07:32:47Z","access_level":"open_access","creator":"dernst","checksum":"e849dd40a915e4d6c5572b51b517f098","content_type":"application/pdf","file_id":"6253"},{"file_id":"6254","access_level":"closed","creator":"dernst","content_type":"application/zip","checksum":"da092153cec55c97461bd53c45c5d139","date_updated":"2020-07-14T12:47:40Z","file_name":"2018_Thesis_Zimin_Source.zip","date_created":"2019-04-09T07:32:47Z","file_size":637490,"relation":"source_file"}],"publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"publist_id":"7986","department":[{"_id":"ChLa"}],"abstract":[{"lang":"eng","text":"The most common assumption made in statistical learning theory is the assumption of the independent and identically distributed (i.i.d.) data. While being very convenient mathematically, it is often very clearly violated in practice. This disparity between the machine learning theory and applications underlies a growing demand in the development of algorithms that learn from dependent data and theory that can provide generalization guarantees similar to the independent situations. This thesis is dedicated to two variants of dependencies that can arise in practice. One is a dependence on the level of samples in a single learning task. Another dependency type arises in the multi-task setting when the tasks are dependent on each other even though the data for them can be i.i.d. In both cases we model the data (samples or tasks) as stochastic processes and introduce new algorithms for both settings that take into account and exploit the resulting dependencies. We prove the theoretical guarantees on the performance of the introduced algorithms under different evaluation criteria and, in addition, we compliment the theoretical study by the empirical one, where we evaluate some of the algorithms on two real world datasets to highlight their practical applicability."}],"_id":"68","date_updated":"2023-09-07T12:29:07Z","article_processing_charge":"No","title":"Learning from dependent data","publication_identifier":{"issn":["2663-337X"]},"oa":1,"has_accepted_license":"1","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","grant_number":"308036"}],"year":"2018","date_created":"2018-12-11T11:44:27Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.15479/AT:ISTA:TH1048","author":[{"first_name":"Alexander","full_name":"Zimin, Alexander","id":"37099E9C-F248-11E8-B48F-1D18A9856A87","last_name":"Zimin"}],"status":"public","oa_version":"Published Version","date_published":"2018-09-01T00:00:00Z","day":"01"},{"article_processing_charge":"No","title":"Charge sensing and spin relaxation times of holes in Ge hut wires","related_material":{"record":[{"status":"public","id":"23","relation":"part_of_dissertation"},{"id":"840","status":"public","relation":"part_of_dissertation"}]},"date_updated":"2023-09-26T15:50:22Z","_id":"69","has_accepted_license":"1","year":"2018","publication_identifier":{"issn":["2663-337X"]},"oa":1,"author":[{"orcid":"0000-0003-2424-8636","first_name":"Lada","full_name":"Vukušić, Lada","last_name":"Vukušić","id":"31E9F056-F248-11E8-B48F-1D18A9856A87"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","oa_version":"Published Version","date_created":"2018-12-11T11:44:28Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.15479/AT:ISTA:TH_1047","date_published":"2018-09-01T00:00:00Z","day":"01","ddc":["530","600"],"type":"dissertation","month":"09","pubrep_id":"1047","degree_awarded":"PhD","page":"103","alternative_title":["ISTA Thesis"],"citation":{"mla":"Vukušić, Lada. <i>Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1047\">10.15479/AT:ISTA:TH_1047</a>.","short":"L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires, Institute of Science and Technology Austria, 2018.","ista":"Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria.","ieee":"L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,” Institute of Science and Technology Austria, 2018.","apa":"Vukušić, L. (2018). <i>Charge sensing and spin relaxation times of holes in Ge hut wires</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1047\">https://doi.org/10.15479/AT:ISTA:TH_1047</a>","chicago":"Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1047\">https://doi.org/10.15479/AT:ISTA:TH_1047</a>.","ama":"Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1047\">10.15479/AT:ISTA:TH_1047</a>"},"publication_status":"published","supervisor":[{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","full_name":"Katsaros, Georgios","first_name":"Georgios","orcid":"0000-0001-8342-202X"}],"language":[{"iso":"eng"}],"publist_id":"7985","department":[{"_id":"GeKa"},{"_id":"GradSch"}],"abstract":[{"lang":"eng","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."}],"file":[{"date_updated":"2020-07-14T12:47:44Z","file_name":"2018_Thesis_Vukusic.pdf","date_created":"2019-04-09T07:00:40Z","file_size":28452385,"relation":"main_file","file_id":"6247","access_level":"open_access","creator":"dernst","checksum":"c570b656e30749cd65b1c7e13a9ce0a8","content_type":"application/pdf"},{"access_level":"closed","creator":"dernst","content_type":"application/zip","checksum":"7856771d9cd401fe0b311191076db6e1","file_id":"6248","relation":"source_file","date_updated":"2020-07-14T12:47:44Z","file_name":"2018_Thesis_Vukusic_source.zip","file_size":53058704,"date_created":"2019-04-09T07:00:40Z"}],"file_date_updated":"2020-07-14T12:47:44Z","publisher":"Institute of Science and Technology Austria"},{"arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1605.08767","open_access":"1"}],"type":"journal_article","article_number":"543-616","intvolume":"       171","month":"06","ec_funded":1,"issue":"1-2","citation":{"chicago":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” <i>Probability Theory and Related Fields</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00440-017-0787-8\">https://doi.org/10.1007/s00440-017-0787-8</a>.","apa":"Lee, J., &#38; Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse random matrices. <i>Probability Theory and Related Fields</i>. Springer. <a href=\"https://doi.org/10.1007/s00440-017-0787-8\">https://doi.org/10.1007/s00440-017-0787-8</a>","ama":"Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices. <i>Probability Theory and Related Fields</i>. 2018;171(1-2). doi:<a href=\"https://doi.org/10.1007/s00440-017-0787-8\">10.1007/s00440-017-0787-8</a>","short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).","mla":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” <i>Probability Theory and Related Fields</i>, vol. 171, no. 1–2, 543–616, Springer, 2018, doi:<a href=\"https://doi.org/10.1007/s00440-017-0787-8\">10.1007/s00440-017-0787-8</a>.","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.","ieee":"J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random matrices,” <i>Probability Theory and Related Fields</i>, vol. 171, no. 1–2. Springer, 2018."},"quality_controlled":"1","publication_status":"published","abstract":[{"text":"We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density up to the spectral edges. Under a suitable condition on the sparsity, we also prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations if a deterministic shift of the spectral edge due to the sparsity is included. For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom fluctuations of the second largest eigenvalue when p is much larger than N−2/3 with a deterministic shift of order (Np)−1.","lang":"eng"}],"language":[{"iso":"eng"}],"department":[{"_id":"LaEr"}],"publist_id":"7017","publisher":"Springer","scopus_import":1,"publication":"Probability Theory and Related Fields","title":"Local law and Tracy–Widom limit for sparse random matrices","_id":"690","date_updated":"2021-01-12T08:09:33Z","project":[{"grant_number":"338804","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"year":"2018","oa":1,"oa_version":"Preprint","status":"public","author":[{"last_name":"Lee","first_name":"Jii","full_name":"Lee, Jii"},{"last_name":"Schnelli","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0954-3231","first_name":"Kevin","full_name":"Schnelli, Kevin"}],"doi":"10.1007/s00440-017-0787-8","volume":171,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:47:56Z","external_id":{"arxiv":["1605.08767"]},"day":"14","date_published":"2018-06-14T00:00:00Z"},{"status":"public","author":[{"orcid":"0000-0002-7903-3010","full_name":"Laukoter, Susanne","first_name":"Susanne","last_name":"Laukoter","id":"2D6B7A9A-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:44:08Z","doi":"10.15479/AT:ISTA:th1057","date_published":"2018-11-21T00:00:00Z","day":"21","title":"Role of genomic imprinting in cerebral cortex development","article_processing_charge":"No","_id":"10","date_updated":"2023-09-07T12:40:44Z","has_accepted_license":"1","year":"2018","publication_identifier":{"issn":["2663-337X"]},"oa":1,"citation":{"mla":"Laukoter, Susanne. <i>Role of Genomic Imprinting in Cerebral Cortex Development</i>. Institute of Science and Technology Austria, 2018, pp. 1–139, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1057\">10.15479/AT:ISTA:th1057</a>.","short":"S. Laukoter, Role of Genomic Imprinting in Cerebral Cortex Development, Institute of Science and Technology Austria, 2018.","ista":"Laukoter S. 2018. Role of genomic imprinting in cerebral cortex development. Institute of Science and Technology Austria.","ieee":"S. Laukoter, “Role of genomic imprinting in cerebral cortex development,” Institute of Science and Technology Austria, 2018.","apa":"Laukoter, S. (2018). <i>Role of genomic imprinting in cerebral cortex development</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th1057\">https://doi.org/10.15479/AT:ISTA:th1057</a>","chicago":"Laukoter, Susanne. “Role of Genomic Imprinting in Cerebral Cortex Development.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th1057\">https://doi.org/10.15479/AT:ISTA:th1057</a>.","ama":"Laukoter S. Role of genomic imprinting in cerebral cortex development. 2018:1-139. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1057\">10.15479/AT:ISTA:th1057</a>"},"alternative_title":["ISTA Thesis"],"supervisor":[{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso","full_name":"Vicoso, Beatriz","first_name":"Beatriz","orcid":"0000-0002-4579-8306"}],"publication_status":"published","publist_id":"8046","department":[{"_id":"SiHi"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Genomic imprinting is an epigenetic process that leads to parent of origin-specific gene expression in a subset of genes. Imprinted genes are essential for brain development, and deregulation of imprinting is associated with neurodevelopmental diseases and the pathogenesis of psychiatric disorders. However, the cell-type specificity of imprinting at single cell resolution, and how imprinting and thus gene dosage regulates neuronal circuit assembly is still largely unknown. Here, MADM (Mosaic Analysis with Double Markers) technology was employed to assess genomic imprinting at single cell level. By visualizing MADM-induced uniparental disomies (UPDs) in distinct colors at single cell level in genetic mosaic animals, this experimental paradigm provides a unique quantitative platform to systematically assay the UPD-mediated imbalances in imprinted gene expression at unprecedented resolution. An experimental pipeline based on FACS, RNA-seq and bioinformatics analysis was established and applied to systematically map cell-type-specific ‘imprintomes’ in the mouse brain. The results revealed that parental-specific expression of imprinted genes per se is rarely cell-type-specific even at the individual cell level. Conversely, when we extended the comparison to downstream responses resulting from imbalanced imprinted gene expression, we discovered an unexpectedly high degree of cell-type specificity. Furthermore, we determined a novel function of genomic imprinting in cortical astrocyte production and in olfactory bulb (OB) granule cell generation. These results suggest important functional implication of genomic imprinting for generating cell-type diversity in the brain. In addition, MADM provides a powerful tool to study candidate genes by concomitant genetic manipulation and fluorescent labelling of single cells. MADM-based candidate gene approach was utilized to identify potential imprinted genes involved in the generation of cortical astrocytes and OB granule cells. We investigated p57Kip2, a maternally expressed gene and known cell cycle regulator. Although we found that p57Kip2 does not play a role in these processes, we detected an unexpected function of the paternal allele previously thought to be silent. Finally, we took advantage of a key property of MADM which is to allow unambiguous investigation of environmental impact on single cells. The experimental pipeline based on FACS and RNA-seq analysis of MADM-labeled cells was established to probe the functional differences of single cell loss of gene function compared to global loss of function on a transcriptional level. With this method, both common and distinct responses were isolated due to cell-autonomous and non-autonomous effects acting on genotypically identical cells. As a result, transcriptional changes were identified which result solely from the surrounding environment. Using the MADM technology to study genomic imprinting at single cell resolution, we have identified cell-type-specific gene expression, novel gene function and the impact of environment on single cell transcriptomes. Together, these provide important insights to the understanding of mechanisms regulating cell-type specificity and thus diversity in the brain."}],"file":[{"date_created":"2019-05-10T07:47:04Z","file_size":17949175,"date_updated":"2019-11-23T23:30:03Z","file_name":"Thesis_LaukoterSusanne_FINAL.docx","relation":"source_file","embargo_to":"open_access","file_id":"6396","checksum":"41fdbf5fdce312802935d88a8ad9932c","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","creator":"dernst"},{"file_id":"6397","content_type":"application/pdf","checksum":"53001a9a0c9e570e598d861bb0af28aa","access_level":"open_access","embargo":"2019-11-21","creator":"dernst","date_created":"2019-05-10T07:47:04Z","file_size":21187245,"date_updated":"2021-02-11T11:17:16Z","file_name":"Thesis_LaukoterSusanne_FINAL.pdf","relation":"main_file"}],"file_date_updated":"2021-02-11T11:17:16Z","publisher":"Institute of Science and Technology Austria","type":"dissertation","ddc":["570"],"month":"11","pubrep_id":"1057","degree_awarded":"PhD","page":"1 - 139"},{"year":"2018","project":[{"call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems"}],"publication_identifier":{"issn":["10737928"]},"oa":1,"article_processing_charge":"No","title":"Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6179"}]},"_id":"1012","date_updated":"2023-09-22T09:44:21Z","external_id":{"arxiv":["1608.05163"],"isi":["000441668300009"]},"date_published":"2018-05-18T00:00:00Z","day":"18","author":[{"first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"first_name":"Dominik J","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","id":"408ED176-F248-11E8-B48F-1D18A9856A87","last_name":"Schröder"}],"status":"public","oa_version":"Preprint","volume":2018,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:49:41Z","doi":"10.1093/imrn/rnw330","month":"05","isi":1,"intvolume":"      2018","issue":"10","ec_funded":1,"page":"3255-3298","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1608.05163"}],"type":"journal_article","department":[{"_id":"LaEr"}],"publist_id":"6383","language":[{"iso":"eng"}],"abstract":[{"text":"We prove a new central limit theorem (CLT) for the difference of linear eigenvalue statistics of a Wigner random matrix H and its minor H and find that the fluctuation is much smaller than the fluctuations of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of H and H. In particular, our theorem identifies the fluctuation of Kerov's rectangular Young diagrams, defined by the interlacing eigenvalues ofH and H, around their asymptotic shape, the Vershik'Kerov'Logan'Shepp curve. Young diagrams equipped with the Plancherel measure follow the same limiting shape. For this, algebraically motivated, ensemble a CLT has been obtained in Ivanov and Olshanski [20] which is structurally similar to our result but the variance is different, indicating that the analogy between the two models has its limitations. Moreover, our theorem shows that Borodin's result [7] on the convergence of the spectral distribution of Wigner matrices to a Gaussian free field also holds in derivative sense.","lang":"eng"}],"publication":"International Mathematics Research Notices","scopus_import":"1","publisher":"Oxford University Press","citation":{"short":"L. Erdös, D.J. Schröder, International Mathematics Research Notices 2018 (2018) 3255–3298.","mla":"Erdös, László, and Dominik J. Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” <i>International Mathematics Research Notices</i>, vol. 2018, no. 10, Oxford University Press, 2018, pp. 3255–98, doi:<a href=\"https://doi.org/10.1093/imrn/rnw330\">10.1093/imrn/rnw330</a>.","ieee":"L. Erdös and D. J. Schröder, “Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues,” <i>International Mathematics Research Notices</i>, vol. 2018, no. 10. Oxford University Press, pp. 3255–3298, 2018.","ista":"Erdös L, Schröder DJ. 2018. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. 2018(10), 3255–3298.","apa":"Erdös, L., &#38; Schröder, D. J. (2018). Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnw330\">https://doi.org/10.1093/imrn/rnw330</a>","chicago":"Erdös, László, and Dominik J Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/imrn/rnw330\">https://doi.org/10.1093/imrn/rnw330</a>.","ama":"Erdös L, Schröder DJ. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. <i>International Mathematics Research Notices</i>. 2018;2018(10):3255-3298. doi:<a href=\"https://doi.org/10.1093/imrn/rnw330\">10.1093/imrn/rnw330</a>"},"quality_controlled":"1","publication_status":"published"},{"issue":"3","page":"214-242","month":"01","intvolume":"      2018","ddc":["000"],"type":"journal_article","publication":"IACR Transactions on Cryptographic Hardware and Embedded Systems","scopus_import":"1","file_date_updated":"2021-11-15T10:27:29Z","file":[{"file_name":"2018_IACR_Allini.pdf","date_updated":"2021-11-15T10:27:29Z","date_created":"2021-11-15T10:27:29Z","success":1,"file_size":955755,"relation":"main_file","file_id":"10289","creator":"cchlebak","access_level":"open_access","content_type":"application/pdf","checksum":"b816b848f046c48a8357700d9305dce5"}],"publisher":"International Association for Cryptologic Research","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"abstract":[{"text":"In this paper, we evaluate clock signals generated in ring oscillators and self-timed rings and the way their jitter can be transformed into random numbers. We show that counting the periods of the jittery clock signal produces random numbers of significantly better quality than the methods in which the jittery signal is simply sampled (the case in almost all current methods). Moreover, we use the counter values to characterize and continuously monitor the source of randomness. However, instead of using the widely used statistical variance, we propose to use Allan variance to do so. There are two main advantages: Allan variance is insensitive to low frequency noises such as flicker noise that are known to be autocorrelated and significantly less circuitry is required for its computation than that used to compute commonly used variance. We also show that it is essential to use a differential principle of randomness extraction from the jitter based on the use of two identical oscillators to avoid autocorrelations originating from external and internal global jitter sources and that this fact is valid for both kinds of rings. Last but not least, we propose a method of statistical testing based on high order Markov model to show the reduced dependencies when the proposed randomness extraction is applied.","lang":"eng"}],"publication_status":"published","article_type":"original","quality_controlled":"1","citation":{"apa":"Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., &#38; Fischer, V. (2018). Evaluation and monitoring of free running oscillators serving as source of randomness. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. International Association for Cryptologic Research. <a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">https://doi.org/10.13154/tches.v2018.i3.214-242</a>","chicago":"Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. International Association for Cryptologic Research, 2018. <a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">https://doi.org/10.13154/tches.v2018.i3.214-242</a>.","ama":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and monitoring of free running oscillators serving as source of randomness. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. 2018;2018(3):214-242. doi:<a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">10.13154/tches.v2018.i3.214-242</a>","short":"E.N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, V. Fischer, IACR Transactions on Cryptographic Hardware and Embedded Systems 2018 (2018) 214–242.","mla":"Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2018, no. 3, International Association for Cryptologic Research, 2018, pp. 214–42, doi:<a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">10.13154/tches.v2018.i3.214-242</a>.","ieee":"E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer, “Evaluation and monitoring of free running oscillators serving as source of randomness,” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2018, no. 3. International Association for Cryptologic Research, pp. 214–242, 2018.","ista":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242."},"publication_identifier":{"eissn":["2569-2925"]},"oa":1,"has_accepted_license":"1","year":"2018","date_updated":"2021-11-15T10:48:49Z","_id":"10286","title":"Evaluation and monitoring of free running oscillators serving as source of randomness","article_processing_charge":"No","date_published":"2018-01-01T00:00:00Z","day":"01","date_created":"2021-11-14T23:01:25Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","volume":2018,"doi":"10.13154/tches.v2018.i3.214-242","author":[{"last_name":"Allini","first_name":"Elie Noumon","full_name":"Allini, Elie Noumon"},{"full_name":"Skórski, Maciej","first_name":"Maciej","last_name":"Skórski","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD"},{"last_name":"Petura","first_name":"Oto","full_name":"Petura, Oto"},{"last_name":"Bernard","full_name":"Bernard, Florent","first_name":"Florent"},{"last_name":"Laban","full_name":"Laban, Marek","first_name":"Marek"},{"last_name":"Fischer","full_name":"Fischer, Viktor","first_name":"Viktor"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","oa_version":"Published Version"},{"oa_version":"Published Version","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"full_name":"Seitner, Denise","first_name":"Denise","last_name":"Seitner"},{"full_name":"Uhse, Simon","first_name":"Simon","last_name":"Uhse"},{"orcid":"0000-0003-1286-7368","full_name":"Gallei, Michelle C","first_name":"Michelle C","last_name":"Gallei","id":"35A03822-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Djamei, Armin","first_name":"Armin","last_name":"Djamei"}],"doi":"10.1111/mpp.12698","volume":19,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:44:39Z","external_id":{"isi":["000445624100006"]},"day":"01","date_published":"2018-10-01T00:00:00Z","article_processing_charge":"No","title":"The core effector Cce1 is required for early infection of maize by Ustilago maydis","_id":"104","date_updated":"2023-09-19T10:06:42Z","acknowledgement":"the Austrian Science Fund (FWF): [P27429‐B22, P27818‐B22, I 3033‐B22], and the Austrian Academy of Science (OEAW).","year":"2018","has_accepted_license":"1","oa":1,"citation":{"ama":"Seitner D, Uhse S, Gallei MC, Djamei A. The core effector Cce1 is required for early infection of maize by Ustilago maydis. <i>Molecular Plant Pathology</i>. 2018;19(10):2277-2287. doi:<a href=\"https://doi.org/10.1111/mpp.12698\">10.1111/mpp.12698</a>","apa":"Seitner, D., Uhse, S., Gallei, M. C., &#38; Djamei, A. (2018). The core effector Cce1 is required for early infection of maize by Ustilago maydis. <i>Molecular Plant Pathology</i>. Wiley. <a href=\"https://doi.org/10.1111/mpp.12698\">https://doi.org/10.1111/mpp.12698</a>","chicago":"Seitner, Denise, Simon Uhse, Michelle C Gallei, and Armin Djamei. “The Core Effector Cce1 Is Required for Early Infection of Maize by Ustilago Maydis.” <i>Molecular Plant Pathology</i>. Wiley, 2018. <a href=\"https://doi.org/10.1111/mpp.12698\">https://doi.org/10.1111/mpp.12698</a>.","ista":"Seitner D, Uhse S, Gallei MC, Djamei A. 2018. The core effector Cce1 is required for early infection of maize by Ustilago maydis. Molecular Plant Pathology. 19(10), 2277–2287.","ieee":"D. Seitner, S. Uhse, M. C. Gallei, and A. Djamei, “The core effector Cce1 is required for early infection of maize by Ustilago maydis,” <i>Molecular Plant Pathology</i>, vol. 19, no. 10. Wiley, pp. 2277–2287, 2018.","short":"D. Seitner, S. Uhse, M.C. Gallei, A. Djamei, Molecular Plant Pathology 19 (2018) 2277–2287.","mla":"Seitner, Denise, et al. “The Core Effector Cce1 Is Required for Early Infection of Maize by Ustilago Maydis.” <i>Molecular Plant Pathology</i>, vol. 19, no. 10, Wiley, 2018, pp. 2277–87, doi:<a href=\"https://doi.org/10.1111/mpp.12698\">10.1111/mpp.12698</a>."},"quality_controlled":"1","publication_status":"published","abstract":[{"lang":"eng","text":"The biotrophic pathogen Ustilago maydis, the causative agent of corn smut disease, infects one of the most important crops worldwide – Zea mays. To successfully colonize its host, U. maydis secretes proteins, known as effectors, that suppress plant defense responses and facilitate the establishment of biotrophy. In this work, we describe the U. maydis effector protein Cce1. Cce1 is essential for virulence and is upregulated during infection. Through microscopic analysis and in vitro assays, we show that Cce1 is secreted from hyphae during filamentous growth of the fungus. Strikingly, Δcce1 mutants are blocked at early stages of infection and induce callose deposition as a plant defense response. Cce1 is highly conserved among smut fungi and the Ustilago bromivora ortholog complemented the virulence defect of the SG200Δcce1 deletion strain. These data indicate that Cce1 is a core effector with apoplastic localization that is essential for U. maydis to infect its host."}],"language":[{"iso":"eng"}],"publist_id":"7950","department":[{"_id":"GradSch"}],"publisher":"Wiley","file":[{"file_id":"5740","access_level":"open_access","creator":"dernst","content_type":"application/pdf","date_updated":"2018-12-18T09:46:00Z","file_name":"2018_MolecPlantPath_Seitner.pdf","file_size":682335,"success":1,"date_created":"2018-12-18T09:46:00Z","relation":"main_file"}],"file_date_updated":"2018-12-18T09:46:00Z","publication":"Molecular Plant Pathology","scopus_import":"1","type":"journal_article","ddc":["580"],"intvolume":"        19","month":"10","isi":1,"page":"2277 - 2287","issue":"10"},{"publication_status":"published","quality_controlled":"1","citation":{"mla":"Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.” <i>Mathematical Intelligencer</i>, vol. 40, no. 3, Springer, 2018, pp. 26–31, doi:<a href=\"https://doi.org/10.1007/s00283-018-9795-5\">10.1007/s00283-018-9795-5</a>.","short":"A. Akopyan, A. Petrunin, Mathematical Intelligencer 40 (2018) 26–31.","ista":"Akopyan A, Petrunin A. 2018. Long geodesics on convex surfaces. Mathematical Intelligencer. 40(3), 26–31.","ieee":"A. Akopyan and A. Petrunin, “Long geodesics on convex surfaces,” <i>Mathematical Intelligencer</i>, vol. 40, no. 3. Springer, pp. 26–31, 2018.","apa":"Akopyan, A., &#38; Petrunin, A. (2018). Long geodesics on convex surfaces. <i>Mathematical Intelligencer</i>. Springer. <a href=\"https://doi.org/10.1007/s00283-018-9795-5\">https://doi.org/10.1007/s00283-018-9795-5</a>","chicago":"Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.” <i>Mathematical Intelligencer</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00283-018-9795-5\">https://doi.org/10.1007/s00283-018-9795-5</a>.","ama":"Akopyan A, Petrunin A. Long geodesics on convex surfaces. <i>Mathematical Intelligencer</i>. 2018;40(3):26-31. doi:<a href=\"https://doi.org/10.1007/s00283-018-9795-5\">10.1007/s00283-018-9795-5</a>"},"publication":"Mathematical Intelligencer","scopus_import":"1","publisher":"Springer","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"publist_id":"7948","abstract":[{"text":"The goal of this article is to introduce the reader to the theory of intrinsic geometry of convex surfaces. We illustrate the power of the tools by proving a theorem on convex surfaces containing an arbitrarily long closed simple geodesic. Let us remind ourselves that a curve in a surface is called geodesic if every sufficiently short arc of the curve is length minimizing; if, in addition, it has no self-intersections, we call it simple geodesic. A tetrahedron with equal opposite edges is called isosceles. The axiomatic method of Alexandrov geometry allows us to work with the metrics of convex surfaces directly, without approximating it first by a smooth or polyhedral metric. Such approximations destroy the closed geodesics on the surface; therefore it is difficult (if at all possible) to apply approximations in the proof of our theorem. On the other hand, a proof in the smooth or polyhedral case usually admits a translation into Alexandrov’s language; such translation makes the result more general. In fact, our proof resembles a translation of the proof given by Protasov. Note that the main theorem implies in particular that a smooth convex surface does not have arbitrarily long simple closed geodesics. However we do not know a proof of this corollary that is essentially simpler than the one presented below.","lang":"eng"}],"type":"journal_article","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1702.05172"}],"arxiv":1,"issue":"3","page":"26 - 31","month":"09","isi":1,"intvolume":"        40","date_created":"2018-12-11T11:44:40Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","volume":40,"doi":"10.1007/s00283-018-9795-5","author":[{"orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Petrunin","first_name":"Anton","full_name":"Petrunin, Anton"}],"status":"public","oa_version":"Preprint","date_published":"2018-09-01T00:00:00Z","day":"01","external_id":{"isi":["000444141200005"],"arxiv":["1702.05172"]},"date_updated":"2023-09-13T08:49:16Z","_id":"106","article_processing_charge":"No","title":"Long geodesics on convex surfaces","oa":1,"year":"2018"},{"language":[{"iso":"eng"}],"publist_id":"6324","department":[{"_id":"HeEd"}],"abstract":[{"text":"In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot be separated into two subfamilies by a straight line disjoint from the disks. In this note we show that essentially the same idea may work for different analogues and generalizations of their result. In particular, we prove the following: Given a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane disjoint from the homothets.","lang":"eng"}],"file":[{"relation":"main_file","file_name":"2018_DiscreteComp_Akopyan.pdf","date_updated":"2019-01-18T09:27:36Z","date_created":"2019-01-18T09:27:36Z","success":1,"file_size":482518,"creator":"dernst","access_level":"open_access","content_type":"application/pdf","file_id":"5844"}],"scopus_import":"1","publication":"Discrete & Computational Geometry","file_date_updated":"2019-01-18T09:27:36Z","publisher":"Springer","citation":{"ista":"Akopyan A, Balitskiy A, Grigorev M. 2018. On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete &#38; Computational Geometry. 59(4), 1001–1009.","ieee":"A. Akopyan, A. Balitskiy, and M. Grigorev, “On the circle covering theorem by A.W. Goodman and R.E. Goodman,” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4. Springer, pp. 1001–1009, 2018.","mla":"Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4, Springer, 2018, pp. 1001–09, doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>.","short":"A. Akopyan, A. Balitskiy, M. Grigorev, Discrete &#38; Computational Geometry 59 (2018) 1001–1009.","ama":"Akopyan A, Balitskiy A, Grigorev M. On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. 2018;59(4):1001-1009. doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>","chicago":"Akopyan, Arseniy, Alexey Balitskiy, and Mikhail Grigorev. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>.","apa":"Akopyan, A., Balitskiy, A., &#38; Grigorev, M. (2018). On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>"},"quality_controlled":"1","publication_status":"published","article_type":"original","isi":1,"month":"06","intvolume":"        59","issue":"4","ec_funded":1,"page":"1001-1009","type":"journal_article","ddc":["516","000"],"external_id":{"isi":["000432205500011"]},"date_published":"2018-06-01T00:00:00Z","day":"01","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","author":[{"last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","full_name":"Akopyan, Arseniy"},{"full_name":"Balitskiy, Alexey","first_name":"Alexey","last_name":"Balitskiy"},{"full_name":"Grigorev, Mikhail","first_name":"Mikhail","last_name":"Grigorev"}],"oa_version":"Published Version","volume":59,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:49:57Z","doi":"10.1007/s00454-017-9883-x","has_accepted_license":"1","year":"2018","project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"eissn":["14320444"],"issn":["01795376"]},"oa":1,"title":"On the circle covering theorem by A.W. Goodman and R.E. Goodman","article_processing_charge":"Yes (via OA deal)","_id":"1064","date_updated":"2023-09-20T12:08:51Z"},{"date_published":"2018-08-01T00:00:00Z","day":"01","external_id":{"isi":["000442938200004"]},"volume":65,"date_created":"2018-12-11T11:44:40Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.1145/3178432","status":"public","author":[{"last_name":"Dziembowski","first_name":"Stefan","full_name":"Dziembowski, Stefan"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"},{"first_name":"Daniel","full_name":"Wichs, Daniel","last_name":"Wichs"}],"oa_version":"Preprint","oa":1,"project":[{"name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020"},{"call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography"}],"year":"2018","_id":"107","date_updated":"2023-09-13T09:05:17Z","title":"Non-malleable codes","article_processing_charge":"No","publication":"Journal of the ACM","scopus_import":"1","publisher":"ACM","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"publist_id":"7947","abstract":[{"text":"We introduce the notion of “non-malleable codes” which relaxes the notion of error correction and error detection. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely unrelated value. In contrast to error correction and error detection, non-malleability can be achieved for very rich classes of modifications. We construct an efficient code that is non-malleable with respect to modifications that affect each bit of the codeword arbitrarily (i.e., leave it untouched, flip it, or set it to either 0 or 1), but independently of the value of the other bits of the codeword. Using the probabilistic method, we also show a very strong and general statement: there exists a non-malleable code for every “small enough” family F of functions via which codewords can be modified. Although this probabilistic method argument does not directly yield efficient constructions, it gives us efficient non-malleable codes in the random-oracle model for very general classes of tampering functions—e.g., functions where every bit in the tampered codeword can depend arbitrarily on any 99% of the bits in the original codeword. As an application of non-malleable codes, we show that they provide an elegant algorithmic solution to the task of protecting functionalities implemented in hardware (e.g., signature cards) against “tampering attacks.” In such attacks, the secret state of a physical system is tampered, in the hopes that future interaction with the modified system will reveal some secret information. This problem was previously studied in the work of Gennaro et al. in 2004 under the name “algorithmic tamper proof security” (ATP). We show that non-malleable codes can be used to achieve important improvements over the prior work. In particular, we show that any functionality can be made secure against a large class of tampering attacks, simply by encoding the secret state with a non-malleable code while it is stored in memory.","lang":"eng"}],"publication_status":"published","article_type":"original","citation":{"ista":"Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of the ACM. 65(4), 20.","ieee":"S. Dziembowski, K. Z. Pietrzak, and D. Wichs, “Non-malleable codes,” <i>Journal of the ACM</i>, vol. 65, no. 4. ACM, 2018.","short":"S. Dziembowski, K.Z. Pietrzak, D. Wichs, Journal of the ACM 65 (2018).","mla":"Dziembowski, Stefan, et al. “Non-Malleable Codes.” <i>Journal of the ACM</i>, vol. 65, no. 4, 20, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3178432\">10.1145/3178432</a>.","ama":"Dziembowski S, Pietrzak KZ, Wichs D. Non-malleable codes. <i>Journal of the ACM</i>. 2018;65(4). doi:<a href=\"https://doi.org/10.1145/3178432\">10.1145/3178432</a>","apa":"Dziembowski, S., Pietrzak, K. Z., &#38; Wichs, D. (2018). Non-malleable codes. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3178432\">https://doi.org/10.1145/3178432</a>","chicago":"Dziembowski, Stefan, Krzysztof Z Pietrzak, and Daniel Wichs. “Non-Malleable Codes.” <i>Journal of the ACM</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3178432\">https://doi.org/10.1145/3178432</a>."},"quality_controlled":"1","issue":"4","ec_funded":1,"isi":1,"month":"08","article_number":"20","intvolume":"        65","type":"journal_article","main_file_link":[{"url":"https://eprint.iacr.org/2009/608","open_access":"1"}]},{"publication_status":"published","quality_controlled":"1","alternative_title":["ISIT Proceedings"],"citation":{"ama":"Obremski M, Skórski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>","apa":"Obremski, M., &#38; Skórski, M. (2018). Inverted leftover hash lemma (Vol. 2018). Presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA: IEEE. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>","chicago":"Obremski, Marciej, and Maciej Skórski. “Inverted Leftover Hash Lemma,” Vol. 2018. IEEE, 2018. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>.","ista":"Obremski M, Skórski M. 2018. Inverted leftover hash lemma. ISIT: International Symposium on Information Theory, ISIT Proceedings, vol. 2018.","ieee":"M. Obremski and M. Skórski, “Inverted leftover hash lemma,” presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA, 2018, vol. 2018.","mla":"Obremski, Marciej, and Maciej Skórski. <i>Inverted Leftover Hash Lemma</i>. Vol. 2018, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>.","short":"M. Obremski, M. Skórski, in:, IEEE, 2018."},"scopus_import":"1","publisher":"IEEE","language":[{"iso":"eng"}],"publist_id":"7946","department":[{"_id":"KrPi"}],"abstract":[{"text":"Universal hashing found a lot of applications in computer science. In cryptography the most important fact about universal families is the so called Leftover Hash Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography it states that almost universal families are good extractors. In this work we provide a somewhat surprising characterization in the opposite direction. Namely, every extractor with sufficiently good parameters yields a universal family on a noticeable fraction of its inputs. Our proof technique is based on tools from extremal graph theory applied to the \\'collision graph\\' induced by the extractor, and may be of independent interest. We discuss possible applications to the theory of randomness extractors and non-malleable codes.","lang":"eng"}],"type":"conference","main_file_link":[{"url":"https://eprint.iacr.org/2017/507","open_access":"1"}],"isi":1,"month":"08","intvolume":"      2018","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:44:40Z","volume":2018,"doi":"10.1109/ISIT.2018.8437654","status":"public","author":[{"last_name":"Obremski","full_name":"Obremski, Marciej","first_name":"Marciej"},{"first_name":"Maciej","full_name":"Skorski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skorski"}],"oa_version":"Submitted Version","date_published":"2018-08-16T00:00:00Z","day":"16","external_id":{"isi":["000448139300368"]},"conference":{"end_date":"2018-06-22","start_date":"2018-06-17 ","location":"Vail, CO, USA","name":"ISIT: International Symposium on Information Theory"},"date_updated":"2023-09-13T08:23:18Z","_id":"108","article_processing_charge":"No","title":"Inverted leftover hash lemma","oa":1,"year":"2018"},{"publisher":"National Academy of Sciences","scopus_import":"1","publication":"Proceedings of the National Academy of Sciences","file":[{"relation":"main_file","success":1,"file_size":3045260,"date_created":"2021-06-07T06:16:38Z","date_updated":"2021-06-07T06:16:38Z","file_name":"2018_PNAS_Frost.pdf","checksum":"810260dc0e3cc3033e15c19ad0dc123e","content_type":"application/pdf","access_level":"open_access","creator":"asandaue","file_id":"9472"}],"file_date_updated":"2021-06-07T06:16:38Z","abstract":[{"text":"The DEMETER (DME) DNA glycosylase catalyzes genome-wide DNA demethylation and is required for endosperm genomic imprinting and embryo viability. Targets of DME-mediated DNA demethylation reside in small, euchromatic, AT-rich transposons and at the boundaries of large transposons, but how DME interacts with these diverse chromatin states is unknown. The STRUCTURE SPECIFIC RECOGNITION PROTEIN 1 (SSRP1) subunit of the chromatin remodeler FACT (facilitates chromatin transactions), was previously shown to be involved in the DME-dependent regulation of genomic imprinting in Arabidopsis endosperm. Therefore, to investigate the interaction between DME and chromatin, we focused on the activity of the two FACT subunits, SSRP1 and SUPPRESSOR of TY16 (SPT16), during reproduction in Arabidopsis. We found that FACT colocalizes with nuclear DME in vivo, and that DME has two classes of target sites, the first being euchromatic and accessible to DME, but the second, representing over half of DME targets, requiring the action of FACT for DME-mediated DNA demethylation genome-wide. Our results show that the FACT-dependent DME targets are GC-rich heterochromatin domains with high nucleosome occupancy enriched with H3K9me2 and H3K27me1. Further, we demonstrate that heterochromatin-associated linker histone H1 specifically mediates the requirement for FACT at a subset of DME-target loci. Overall, our results demonstrate that FACT is required for DME targeting by facilitating its access to heterochromatin.","lang":"eng"}],"language":[{"iso":"eng"}],"department":[{"_id":"DaZi"}],"article_type":"original","publication_status":"published","keyword":["Multidisciplinary"],"citation":{"ieee":"J. M. Frost <i>et al.</i>, “FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis,” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 20. National Academy of Sciences, pp. E4720–E4729, 2018.","ista":"Frost JM, Kim MY, Park GT, Hsieh P-H, Nakamura M, Lin SJH, Yoo H, Choi J, Ikeda Y, Kinoshita T, Choi Y, Zilberman D, Fischer RL. 2018. FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis. Proceedings of the National Academy of Sciences. 115(20), E4720–E4729.","mla":"Frost, Jennifer M., et al. “FACT Complex Is Required for DNA Demethylation at Heterochromatin during Reproduction in Arabidopsis.” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 20, National Academy of Sciences, 2018, pp. E4720–29, doi:<a href=\"https://doi.org/10.1073/pnas.1713333115\">10.1073/pnas.1713333115</a>.","short":"J.M. Frost, M.Y. Kim, G.T. Park, P.-H. Hsieh, M. Nakamura, S.J.H. Lin, H. Yoo, J. Choi, Y. Ikeda, T. Kinoshita, Y. Choi, D. Zilberman, R.L. Fischer, Proceedings of the National Academy of Sciences 115 (2018) E4720–E4729.","ama":"Frost JM, Kim MY, Park GT, et al. FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis. <i>Proceedings of the National Academy of Sciences</i>. 2018;115(20):E4720-E4729. doi:<a href=\"https://doi.org/10.1073/pnas.1713333115\">10.1073/pnas.1713333115</a>","chicago":"Frost, Jennifer M., M. Yvonne Kim, Guen Tae Park, Ping-Hung Hsieh, Miyuki Nakamura, Samuel J. H. Lin, Hyunjin Yoo, et al. “FACT Complex Is Required for DNA Demethylation at Heterochromatin during Reproduction in Arabidopsis.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1713333115\">https://doi.org/10.1073/pnas.1713333115</a>.","apa":"Frost, J. M., Kim, M. Y., Park, G. T., Hsieh, P.-H., Nakamura, M., Lin, S. J. H., … Fischer, R. L. (2018). FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1713333115\">https://doi.org/10.1073/pnas.1713333115</a>"},"quality_controlled":"1","page":"E4720-E4729","issue":"20","intvolume":"       115","month":"05","type":"journal_article","ddc":["580"],"day":"15","date_published":"2018-05-15T00:00:00Z","external_id":{"pmid":["29712855"]},"pmid":1,"doi":"10.1073/pnas.1713333115","volume":115,"date_created":"2021-06-07T06:11:28Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa_version":"Published Version","extern":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"author":[{"full_name":"Frost, Jennifer M.","first_name":"Jennifer M.","last_name":"Frost"},{"first_name":"M. Yvonne","full_name":"Kim, M. Yvonne","last_name":"Kim"},{"first_name":"Guen Tae","full_name":"Park, Guen Tae","last_name":"Park"},{"full_name":"Hsieh, Ping-Hung","first_name":"Ping-Hung","last_name":"Hsieh"},{"last_name":"Nakamura","full_name":"Nakamura, Miyuki","first_name":"Miyuki"},{"full_name":"Lin, Samuel J. H.","first_name":"Samuel J. H.","last_name":"Lin"},{"last_name":"Yoo","full_name":"Yoo, Hyunjin","first_name":"Hyunjin"},{"last_name":"Choi","first_name":"Jaemyung","full_name":"Choi, Jaemyung"},{"last_name":"Ikeda","first_name":"Yoko","full_name":"Ikeda, Yoko"},{"last_name":"Kinoshita","first_name":"Tetsu","full_name":"Kinoshita, Tetsu"},{"first_name":"Yeonhee","full_name":"Choi, Yeonhee","last_name":"Choi"},{"orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel","first_name":"Daniel","last_name":"Zilberman","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1"},{"last_name":"Fischer","full_name":"Fischer, Robert L.","first_name":"Robert L."}],"status":"public","oa":1,"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"year":"2018","has_accepted_license":"1","_id":"9471","date_updated":"2021-12-14T07:53:40Z","related_material":{"link":[{"relation":"earlier_version","url":"https://doi.org/10.1101/187674 "}]},"article_processing_charge":"No","title":"FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis"},{"month":"11","year":"2018","oa":1,"article_processing_charge":"No","title":"Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.7295339.v1"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"20"}]},"date_updated":"2023-09-13T09:10:47Z","_id":"9807","type":"research_data_reference","department":[{"_id":"SiHi"}],"abstract":[{"text":"Table S1. Genes with highest betweenness. Table S2. Local and Master regulators up-regulated. Table S3. Local and Master regulators down-regulated (XLSX 23 kb).","lang":"eng"}],"date_published":"2018-11-03T00:00:00Z","day":"03","publisher":"Springer Nature","status":"public","author":[{"last_name":"Higareda Almaraz","full_name":"Higareda Almaraz, Juan","first_name":"Juan"},{"full_name":"Karbiener, Michael","first_name":"Michael","last_name":"Karbiener"},{"first_name":"Maude","full_name":"Giroud, Maude","last_name":"Giroud"},{"id":"48EA0138-F248-11E8-B48F-1D18A9856A87","last_name":"Pauler","first_name":"Florian","full_name":"Pauler, Florian","orcid":"0000-0002-7462-0048"},{"full_name":"Gerhalter, Teresa","first_name":"Teresa","last_name":"Gerhalter"},{"last_name":"Herzig","full_name":"Herzig, Stephan","first_name":"Stephan"},{"first_name":"Marcel","full_name":"Scheideler, Marcel","last_name":"Scheideler"}],"citation":{"short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (2018).","mla":"Higareda Almaraz, Juan, et al. <i>Additional File 1: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes</i>. Springer Nature, 2018, doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">10.6084/m9.figshare.7295339.v1</a>.","ieee":"J. Higareda Almaraz <i>et al.</i>, “Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes.” Springer Nature, 2018.","ista":"Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S, Scheideler M. 2018. Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes, Springer Nature, <a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">10.6084/m9.figshare.7295339.v1</a>.","apa":"Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T., Herzig, S., &#38; Scheideler, M. (2018). Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. Springer Nature. <a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">https://doi.org/10.6084/m9.figshare.7295339.v1</a>","chicago":"Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler, Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Additional File 1: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.” Springer Nature, 2018. <a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">https://doi.org/10.6084/m9.figshare.7295339.v1</a>.","ama":"Higareda Almaraz J, Karbiener M, Giroud M, et al. Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. 2018. doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">10.6084/m9.figshare.7295339.v1</a>"},"oa_version":"Published Version","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_created":"2021-08-06T12:26:53Z","doi":"10.6084/m9.figshare.7295339.v1"},{"date_updated":"2023-09-13T09:10:47Z","type":"research_data_reference","_id":"9808","related_material":{"record":[{"id":"20","status":"public","relation":"used_in_publication"}]},"main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.7295369.v1","open_access":"1"}],"title":"Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","article_processing_charge":"No","oa":1,"year":"2018","month":"11","doi":"10.6084/m9.figshare.7295369.v1","date_created":"2021-08-06T12:31:57Z","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Published Version","status":"public","author":[{"last_name":"Higareda Almaraz","full_name":"Higareda Almaraz, Juan","first_name":"Juan"},{"first_name":"Michael","full_name":"Karbiener, Michael","last_name":"Karbiener"},{"full_name":"Giroud, Maude","first_name":"Maude","last_name":"Giroud"},{"id":"48EA0138-F248-11E8-B48F-1D18A9856A87","last_name":"Pauler","first_name":"Florian","full_name":"Pauler, Florian","orcid":"0000-0002-7462-0048"},{"full_name":"Gerhalter, Teresa","first_name":"Teresa","last_name":"Gerhalter"},{"first_name":"Stephan","full_name":"Herzig, Stephan","last_name":"Herzig"},{"first_name":"Marcel","full_name":"Scheideler, Marcel","last_name":"Scheideler"}],"citation":{"mla":"Higareda Almaraz, Juan, et al. <i>Additional File 3: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes</i>. Springer Nature, 2018, doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">10.6084/m9.figshare.7295369.v1</a>.","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (2018).","ista":"Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S, Scheideler M. 2018. Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes, Springer Nature, <a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">10.6084/m9.figshare.7295369.v1</a>.","ieee":"J. Higareda Almaraz <i>et al.</i>, “Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes.” Springer Nature, 2018.","apa":"Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T., Herzig, S., &#38; Scheideler, M. (2018). Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. Springer Nature. <a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">https://doi.org/10.6084/m9.figshare.7295369.v1</a>","chicago":"Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler, Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Additional File 3: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.” Springer Nature, 2018. <a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">https://doi.org/10.6084/m9.figshare.7295369.v1</a>.","ama":"Higareda Almaraz J, Karbiener M, Giroud M, et al. Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. 2018. doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">10.6084/m9.figshare.7295369.v1</a>"},"day":"03","publisher":"Springer Nature","date_published":"2018-11-03T00:00:00Z","abstract":[{"lang":"eng","text":"Table S4. Counts per Gene per Million Reads Mapped. (XLSX 2751 kb)."}],"department":[{"_id":"SiHi"}]}]