[{"day":"03","month":"11","article_processing_charge":"No","oa":1,"citation":{"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. https://doi.org/10.6084/m9.figshare.7295369.v1.","mla":"Higareda Almaraz, Juan, et al. Additional File 3: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes. Springer Nature, 2018, doi:10.6084/m9.figshare.7295369.v1.","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, 10.6084/m9.figshare.7295369.v1.","apa":"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. https://doi.org/10.6084/m9.figshare.7295369.v1","ieee":"J. Higareda Almaraz et al., “Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes.” Springer Nature, 2018.","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:10.6084/m9.figshare.7295369.v1"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.7295369.v1"}],"date_published":"2018-11-03T00:00:00Z","doi":"10.6084/m9.figshare.7295369.v1","type":"research_data_reference","abstract":[{"text":"Table S4. Counts per Gene per Million Reads Mapped. (XLSX 2751 kb).","lang":"eng"}],"title":"Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","status":"public","department":[{"_id":"SiHi"}],"publisher":"Springer Nature","_id":"9808","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2018","date_created":"2021-08-06T12:31:57Z","date_updated":"2023-09-13T09:10:47Z","oa_version":"Published Version","author":[{"first_name":"Juan","last_name":"Higareda Almaraz","full_name":"Higareda Almaraz, Juan"},{"first_name":"Michael","last_name":"Karbiener","full_name":"Karbiener, Michael"},{"first_name":"Maude","last_name":"Giroud","full_name":"Giroud, Maude"},{"first_name":"Florian","last_name":"Pauler","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7462-0048","full_name":"Pauler, Florian"},{"full_name":"Gerhalter, Teresa","first_name":"Teresa","last_name":"Gerhalter"},{"first_name":"Stephan","last_name":"Herzig","full_name":"Herzig, Stephan"},{"full_name":"Scheideler, Marcel","first_name":"Marcel","last_name":"Scheideler"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"20"}]}},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"193","title":"On the memory hardness of data independent password hashing functions","status":"public","oa_version":"Submitted Version","type":"conference","abstract":[{"lang":"eng","text":"We show attacks on five data-independent memory-hard functions (iMHF) that were submitted to the password hashing competition (PHC). Informally, an MHF is a function which cannot be evaluated on dedicated hardware, like ASICs, at significantly lower hardware and/or energy cost than evaluating a single instance on a standard single-core architecture. Data-independent means the memory access pattern of the function is independent of the input; this makes iMHFs harder to construct than data-dependent ones, but the latter can be attacked by various side-channel attacks. Following [Alwen-Blocki'16], we capture the evaluation of an iMHF as a directed acyclic graph (DAG). The cumulative parallel pebbling complexity of this DAG is a measure for the hardware cost of evaluating the iMHF on an ASIC. Ideally, one would like the complexity of a DAG underlying an iMHF to be as close to quadratic in the number of nodes of the graph as possible. Instead, we show that (the DAGs underlying) the following iMHFs are far from this bound: Rig.v2, TwoCats and Gambit each having an exponent no more than 1.75. Moreover, we show that the complexity of the iMHF modes of the PHC finalists Pomelo and Lyra2 have exponents at most 1.83 and 1.67 respectively. To show this we investigate a combinatorial property of each underlying DAG (called its depth-robustness. By establishing upper bounds on this property we are then able to apply the general technique of [Alwen-Block'16] for analyzing the hardware costs of an iMHF."}],"citation":{"apa":"Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak, K. Z., … Rybar, M. (2018). On the memory hardness of data independent password hashing functions. In Proceedings of the 2018 on Asia Conference on Computer and Communication Security (pp. 51–65). Incheon, Republic of Korea: ACM. https://doi.org/10.1145/3196494.3196534","ieee":"J. F. Alwen et al., “On the memory hardness of data independent password hashing functions,” in Proceedings of the 2018 on Asia Conference on Computer and Communication Security, Incheon, Republic of Korea, 2018, pp. 51–65.","ista":"Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security , 51–65.","ama":"Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534","chicago":"Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar. “On the Memory Hardness of Data Independent Password Hashing Functions.” In Proceedings of the 2018 on Asia Conference on Computer and Communication Security, 51–65. ACM, 2018. https://doi.org/10.1145/3196494.3196534.","short":"J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.","mla":"Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534."},"publication":"Proceedings of the 2018 on Asia Conference on Computer and Communication Security","page":"51 - 65","date_published":"2018-06-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","year":"2018","acknowledgement":"Leonid Reyzin was supported in part by IST Austria and by US NSF grants 1012910, 1012798, and 1422965; this research was performed while he was visiting IST Austria.","department":[{"_id":"KrPi"},{"_id":"HeEd"},{"_id":"VlKo"}],"publisher":"ACM","publication_status":"published","author":[{"full_name":"Alwen, Joel F","last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Peter","last_name":"Gazi","full_name":"Gazi, Peter"},{"full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","first_name":"Chethan","last_name":"Kamath Hosdurg"},{"first_name":"Karen","last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen"},{"full_name":"Osang, Georg F","first_name":"Georg F","last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8882-5116"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"last_name":"Reyzin","first_name":"Lenoid","full_name":"Reyzin, Lenoid"},{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek","first_name":"Michal"},{"full_name":"Rybar, Michal","last_name":"Rybar","first_name":"Michal","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-09-13T09:13:12Z","date_created":"2018-12-11T11:45:07Z","publist_id":"7723","ec_funded":1,"external_id":{"isi":["000516620100005"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/783"}],"project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"doi":"10.1145/3196494.3196534","conference":{"name":"ASIACCS: Asia Conference on Computer and Communications Security ","start_date":"2018-06-04","location":"Incheon, Republic of Korea","end_date":"2018-06-08"},"language":[{"iso":"eng"}],"month":"06"},{"alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"We introduce a formal quantitative notion of “bit security” for a general type of cryptographic games (capturing both decision and search problems), aimed at capturing the intuition that a cryptographic primitive with k-bit security is as hard to break as an ideal cryptographic function requiring a brute force attack on a k-bit key space. Our new definition matches the notion of bit security commonly used by cryptographers and cryptanalysts when studying search (e.g., key recovery) problems, where the use of the traditional definition is well established. However, it produces a quantitatively different metric in the case of decision (indistinguishability) problems, where the use of (a straightforward generalization of) the traditional definition is more problematic and leads to a number of paradoxical situations or mismatches between theoretical/provable security and practical/common sense intuition. Key to our new definition is to consider adversaries that may explicitly declare failure of the attack. We support and justify the new definition by proving a number of technical results, including tight reductions between several standard cryptographic problems, a new hybrid theorem that preserves bit security, and an application to the security analysis of indistinguishability primitives making use of (approximate) floating point numbers. This is the first result showing that (standard precision) 53-bit floating point numbers can be used to achieve 100-bit security in the context of cryptographic primitives with general indistinguishability-based security definitions. Previous results of this type applied only to search problems, or special types of decision problems."}],"status":"public","title":"On the bit security of cryptographic primitives","intvolume":" 10820","_id":"300","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","scopus_import":"1","day":"31","article_processing_charge":"No","page":"3 - 28","citation":{"chicago":"Micciancio, Daniele, and Michael Walter. “On the Bit Security of Cryptographic Primitives,” 10820:3–28. Springer, 2018. https://doi.org/10.1007/978-3-319-78381-9_1.","short":"D. Micciancio, M. Walter, in:, Springer, 2018, pp. 3–28.","mla":"Micciancio, Daniele, and Michael Walter. On the Bit Security of Cryptographic Primitives. Vol. 10820, Springer, 2018, pp. 3–28, doi:10.1007/978-3-319-78381-9_1.","ieee":"D. Micciancio and M. Walter, “On the bit security of cryptographic primitives,” presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10820, pp. 3–28.","apa":"Micciancio, D., & Walter, M. (2018). On the bit security of cryptographic primitives (Vol. 10820, pp. 3–28). Presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78381-9_1","ista":"Micciancio D, Walter M. 2018. On the bit security of cryptographic primitives. Eurocrypt: Advances in Cryptology, LNCS, vol. 10820, 3–28.","ama":"Micciancio D, Walter M. On the bit security of cryptographic primitives. In: Vol 10820. Springer; 2018:3-28. doi:10.1007/978-3-319-78381-9_1"},"date_published":"2018-03-31T00:00:00Z","publist_id":"7581","ec_funded":1,"publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer","acknowledgement":"Research supported in part by the Defense Advanced Research Projects Agency (DARPA) and the U.S. Army Research Office under the SafeWare program. Opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views, position or policy of the Government. The second author was also supported by the European Research Council, ERC consolidator grant (682815 - TOCNeT).","year":"2018","date_created":"2018-12-11T11:45:42Z","date_updated":"2023-09-13T09:12:04Z","volume":10820,"author":[{"first_name":"Daniele","last_name":"Micciancio","full_name":"Micciancio, Daniele"},{"full_name":"Walter, Michael","last_name":"Walter","first_name":"Michael","orcid":"0000-0003-3186-2482","id":"488F98B0-F248-11E8-B48F-1D18A9856A87"}],"month":"03","isi":1,"quality_controlled":"1","project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"external_id":{"isi":["000517097500001"]},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/077"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2018-05-03","location":"Tel Aviv, Israel","start_date":"2018-04-29","name":"Eurocrypt: Advances in Cryptology"},"doi":"10.1007/978-3-319-78381-9_1"},{"oa":1,"main_file_link":[{"open_access":"1","url":"http://pdfs.semanticscholar.org/d2d5/6da00fbc674e6a8b1bb9d857167e54200dc6.pdf"}],"external_id":{"isi":["000428958900038"]},"quality_controlled":"1","isi":1,"project":[{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}],"doi":"10.1137/16M1097201","language":[{"iso":"eng"}],"month":"03","publication_identifier":{"issn":["08954801"]},"year":"2018","acknowledgement":"This work was partially supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics,” through grant I02979-N35 of the Austrian Science Fund (FWF).","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Society for Industrial and Applied Mathematics ","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Iglesias Ham, Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","last_name":"Iglesias Ham","first_name":"Mabel"}],"date_created":"2018-12-11T11:45:46Z","date_updated":"2023-09-13T09:34:38Z","volume":32,"publist_id":"7553","publication":"SIAM J Discrete Math","citation":{"chicago":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” SIAM J Discrete Math. Society for Industrial and Applied Mathematics , 2018. https://doi.org/10.1137/16M1097201.","short":"H. Edelsbrunner, M. Iglesias Ham, SIAM J Discrete Math 32 (2018) 750–782.","mla":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” SIAM J Discrete Math, vol. 32, no. 1, Society for Industrial and Applied Mathematics , 2018, pp. 750–82, doi:10.1137/16M1097201.","apa":"Edelsbrunner, H., & Iglesias Ham, M. (2018). On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/16M1097201","ieee":"H. Edelsbrunner and M. Iglesias Ham, “On the optimality of the FCC lattice for soft sphere packing,” SIAM J Discrete Math, vol. 32, no. 1. Society for Industrial and Applied Mathematics , pp. 750–782, 2018.","ista":"Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782.","ama":"Edelsbrunner H, Iglesias Ham M. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 2018;32(1):750-782. doi:10.1137/16M1097201"},"article_type":"original","page":"750 - 782","date_published":"2018-03-29T00:00:00Z","scopus_import":"1","day":"29","article_processing_charge":"No","_id":"312","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"On the optimality of the FCC lattice for soft sphere packing","status":"public","intvolume":" 32","oa_version":"Submitted Version","type":"journal_article","abstract":[{"text":"Motivated by biological questions, we study configurations of equal spheres that neither pack nor cover. Placing their centers on a lattice, we define the soft density of the configuration by penalizing multiple overlaps. Considering the 1-parameter family of diagonally distorted 3-dimensional integer lattices, we show that the soft density is maximized at the FCC lattice.","lang":"eng"}],"issue":"1"},{"article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2018-04-01T00:00:00Z","page":"412-414","article_type":"original","citation":{"ama":"Akopyan A. On the number of non-hexagons in a planar tiling. Comptes Rendus Mathematique. 2018;356(4):412-414. doi:10.1016/j.crma.2018.03.005","ista":"Akopyan A. 2018. On the number of non-hexagons in a planar tiling. Comptes Rendus Mathematique. 356(4), 412–414.","apa":"Akopyan, A. (2018). On the number of non-hexagons in a planar tiling. Comptes Rendus Mathematique. Elsevier. https://doi.org/10.1016/j.crma.2018.03.005","ieee":"A. Akopyan, “On the number of non-hexagons in a planar tiling,” Comptes Rendus Mathematique, vol. 356, no. 4. Elsevier, pp. 412–414, 2018.","mla":"Akopyan, Arseniy. “On the Number of Non-Hexagons in a Planar Tiling.” Comptes Rendus Mathematique, vol. 356, no. 4, Elsevier, 2018, pp. 412–14, doi:10.1016/j.crma.2018.03.005.","short":"A. Akopyan, Comptes Rendus Mathematique 356 (2018) 412–414.","chicago":"Akopyan, Arseniy. “On the Number of Non-Hexagons in a Planar Tiling.” Comptes Rendus Mathematique. Elsevier, 2018. https://doi.org/10.1016/j.crma.2018.03.005."},"publication":"Comptes Rendus Mathematique","issue":"4","abstract":[{"text":"We give a simple proof of T. Stehling's result [4], whereby in any normal tiling of the plane with convex polygons with number of sides not less than six, all tiles except a finite number are hexagons.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","intvolume":" 356","status":"public","title":"On the number of non-hexagons in a planar tiling","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"409","publication_identifier":{"issn":["1631073X"]},"month":"04","language":[{"iso":"eng"}],"doi":"10.1016/j.crma.2018.03.005","isi":1,"quality_controlled":"1","external_id":{"arxiv":["1805.01652"],"isi":["000430402700009"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1805.01652","open_access":"1"}],"publist_id":"7420","volume":356,"date_created":"2018-12-11T11:46:19Z","date_updated":"2023-09-13T09:34:12Z","author":[{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","first_name":"Arseniy"}],"publisher":"Elsevier","department":[{"_id":"HeEd"}],"publication_status":"published","year":"2018"},{"month":"03","project":[{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","external_id":{"isi":["000446612000016"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1038/s41562-018-0320-9","ec_funded":1,"publist_id":"7404","file_date_updated":"2020-07-14T12:46:25Z","department":[{"_id":"KrCh"}],"publisher":"Nature Publishing Group","publication_status":"published","year":"2018","volume":2,"date_created":"2018-12-11T11:46:22Z","date_updated":"2023-09-13T09:38:54Z","related_material":{"link":[{"relation":"erratum","url":"http://doi.org/10.1038/s41562-018-0342-3"}]},"author":[{"last_name":"Hilbe","first_name":"Christian","orcid":"0000-0001-5116-955X","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","full_name":"Hilbe, Christian"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"19","page":"469–477","article_type":"review","citation":{"ista":"Hilbe C, Chatterjee K, Nowak M. 2018. Partners and rivals in direct reciprocity. Nature Human Behaviour. 2, 469–477.","ieee":"C. Hilbe, K. Chatterjee, and M. Nowak, “Partners and rivals in direct reciprocity,” Nature Human Behaviour, vol. 2. Nature Publishing Group, pp. 469–477, 2018.","apa":"Hilbe, C., Chatterjee, K., & Nowak, M. (2018). Partners and rivals in direct reciprocity. Nature Human Behaviour. Nature Publishing Group. https://doi.org/10.1038/s41562-018-0320-9","ama":"Hilbe C, Chatterjee K, Nowak M. Partners and rivals in direct reciprocity. Nature Human Behaviour. 2018;2:469–477. doi:10.1038/s41562-018-0320-9","chicago":"Hilbe, Christian, Krishnendu Chatterjee, and Martin Nowak. “Partners and Rivals in Direct Reciprocity.” Nature Human Behaviour. Nature Publishing Group, 2018. https://doi.org/10.1038/s41562-018-0320-9.","mla":"Hilbe, Christian, et al. “Partners and Rivals in Direct Reciprocity.” Nature Human Behaviour, vol. 2, Nature Publishing Group, 2018, pp. 469–477, doi:10.1038/s41562-018-0320-9.","short":"C. Hilbe, K. Chatterjee, M. Nowak, Nature Human Behaviour 2 (2018) 469–477."},"publication":"Nature Human Behaviour","date_published":"2018-03-19T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Reciprocity is a major factor in human social life and accounts for a large part of cooperation in our communities. Direct reciprocity arises when repeated interactions occur between the same individuals. The framework of iterated games formalizes this phenomenon. Despite being introduced more than five decades ago, the concept keeps offering beautiful surprises. Recent theoretical research driven by new mathematical tools has proposed a remarkable dichotomy among the crucial strategies: successful individuals either act as partners or as rivals. Rivals strive for unilateral advantages by applying selfish or extortionate strategies. Partners aim to share the payoff for mutual cooperation, but are ready to fight back when being exploited. Which of these behaviours evolves depends on the environment. Whereas small population sizes and a limited number of rounds favour rivalry, partner strategies are selected when populations are large and relationships stable. Only partners allow for evolution of cooperation, while the rivals’ attempt to put themselves first leads to defection. Hilbe et al. synthesize recent theoretical work on zero-determinant and ‘rival’ versus ‘partner’ strategies in social dilemmas. They describe the environments under which these contrasting selfish or cooperative strategies emerge in evolution."}],"intvolume":" 2","status":"public","title":"Partners and rivals in direct reciprocity","ddc":["000"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"419","file":[{"creator":"dernst","content_type":"application/pdf","file_size":598033,"file_name":"2018_NatureHumanBeh_Hilbe.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:25Z","date_created":"2019-11-19T08:19:51Z","checksum":"571b8cc0ba14e8d5d8b18e439a9835eb","file_id":"7052","relation":"main_file"}],"oa_version":"Submitted Version"},{"author":[{"first_name":"Alexey","last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey"},{"full_name":"Ferrere, Thomas","last_name":"Ferrere","first_name":"Thomas","orcid":"0000-0001-5199-3143","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan"},{"first_name":"Oded","last_name":"Maler","full_name":"Maler, Oded"},{"last_name":"Asarin","first_name":"Eugene","full_name":"Asarin, Eugene"}],"volume":11022,"date_created":"2018-12-11T11:44:31Z","date_updated":"2023-09-13T09:35:46Z","year":"2018","publisher":"Springer","department":[{"_id":"ToHe"}],"publication_status":"published","publist_id":"7976","file_date_updated":"2020-07-14T12:48:03Z","doi":"10.1007/978-3-030-00151-3_13","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2018-09-06","location":"Bejing, China","start_date":"2018-09-04"},"language":[{"iso":"eng"}],"oa":1,"external_id":{"isi":["000884993200013"]},"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"quality_controlled":"1","isi":1,"publication_identifier":{"isbn":["978-3-030-00150-6"]},"month":"08","file":[{"file_id":"7831","relation":"main_file","checksum":"436b7574934324cfa7d1d3986fddc65b","date_updated":"2020-07-14T12:48:03Z","date_created":"2020-05-14T11:34:34Z","access_level":"open_access","file_name":"2018_LNCS_Bakhirkin.pdf","creator":"dernst","content_type":"application/pdf","file_size":374851}],"oa_version":"Submitted Version","_id":"78","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 11022","title":"Online timed pattern matching using automata","ddc":["000"],"status":"public","abstract":[{"lang":"eng","text":"We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by ϕ and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads ω, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated."}],"type":"conference","alternative_title":["LNCS"],"date_published":"2018-08-26T00:00:00Z","citation":{"chicago":"Bakhirkin, Alexey, Thomas Ferrere, Dejan Nickovic, Oded Maler, and Eugene Asarin. “Online Timed Pattern Matching Using Automata,” 11022:215–32. Springer, 2018. https://doi.org/10.1007/978-3-030-00151-3_13.","short":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, E. Asarin, in:, Springer, 2018, pp. 215–232.","mla":"Bakhirkin, Alexey, et al. Online Timed Pattern Matching Using Automata. Vol. 11022, Springer, 2018, pp. 215–32, doi:10.1007/978-3-030-00151-3_13.","apa":"Bakhirkin, A., Ferrere, T., Nickovic, D., Maler, O., & Asarin, E. (2018). Online timed pattern matching using automata (Vol. 11022, pp. 215–232). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China: Springer. https://doi.org/10.1007/978-3-030-00151-3_13","ieee":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, and E. Asarin, “Online timed pattern matching using automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China, 2018, vol. 11022, pp. 215–232.","ista":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. 2018. Online timed pattern matching using automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 215–232.","ama":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. Online timed pattern matching using automata. In: Vol 11022. Springer; 2018:215-232. doi:10.1007/978-3-030-00151-3_13"},"page":"215 - 232","has_accepted_license":"1","article_processing_charge":"No","day":"26","scopus_import":"1"},{"publication":"Scientific Reports","citation":{"short":"M. Brauns, S. Amitonov, P. Spruijtenburg, F. Zwanenburg, Scientific Reports 8 (2018).","mla":"Brauns, Matthias, et al. “Palladium Gates for Reproducible Quantum Dots in Silicon.” Scientific Reports, vol. 8, no. 1, 5690, Nature Publishing Group, 2018, doi:10.1038/s41598-018-24004-y.","chicago":"Brauns, Matthias, Sergey Amitonov, Paul Spruijtenburg, and Floris Zwanenburg. “Palladium Gates for Reproducible Quantum Dots in Silicon.” Scientific Reports. Nature Publishing Group, 2018. https://doi.org/10.1038/s41598-018-24004-y.","ama":"Brauns M, Amitonov S, Spruijtenburg P, Zwanenburg F. Palladium gates for reproducible quantum dots in silicon. Scientific Reports. 2018;8(1). doi:10.1038/s41598-018-24004-y","ieee":"M. Brauns, S. Amitonov, P. Spruijtenburg, and F. Zwanenburg, “Palladium gates for reproducible quantum dots in silicon,” Scientific Reports, vol. 8, no. 1. Nature Publishing Group, 2018.","apa":"Brauns, M., Amitonov, S., Spruijtenburg, P., & Zwanenburg, F. (2018). Palladium gates for reproducible quantum dots in silicon. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-018-24004-y","ista":"Brauns M, Amitonov S, Spruijtenburg P, Zwanenburg F. 2018. Palladium gates for reproducible quantum dots in silicon. Scientific Reports. 8(1), 5690."},"date_published":"2018-04-09T00:00:00Z","scopus_import":"1","day":"09","has_accepted_license":"1","article_processing_charge":"No","ddc":["539"],"title":"Palladium gates for reproducible quantum dots in silicon","status":"public","intvolume":" 8","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"317","oa_version":"Published Version","file":[{"file_id":"5256","relation":"main_file","checksum":"20af238ca4ba6491b77270be8d826bf5","date_updated":"2020-07-14T12:46:02Z","date_created":"2018-12-12T10:17:04Z","access_level":"open_access","file_name":"IST-2018-1016-v1+1_2018_Brauns_Palladium_gates.pdf","creator":"system","file_size":1850530,"content_type":"application/pdf"}],"pubrep_id":"1016","type":"journal_article","abstract":[{"lang":"eng","text":"We replace the established aluminium gates for the formation of quantum dots in silicon with gates made from palladium. We study the morphology of both aluminium and palladium gates with transmission electron microscopy. The native aluminium oxide is found to be formed all around the aluminium gates, which could lead to the formation of unintentional dots. Therefore, we report on a novel fabrication route that replaces aluminium and its native oxide by palladium with atomic-layer-deposition-grown aluminium oxide. Using this approach, we show the formation of low-disorder gate-defined quantum dots, which are reproducibly fabricated. Furthermore, palladium enables us to further shrink the gate design, allowing us to perform electron transport measurements in the few-electron regime in devices comprising only two gate layers, a major technological advancement. It remains to be seen, whether the introduction of palladium gates can improve the excellent results on electron and nuclear spin qubits defined with an aluminium gate stack."}],"issue":"1","isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000429404300013"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1038/s41598-018-24004-y","month":"04","publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"GeKa"}],"year":"2018","date_updated":"2023-09-13T09:38:00Z","date_created":"2018-12-11T11:45:47Z","volume":8,"author":[{"id":"33F94E3C-F248-11E8-B48F-1D18A9856A87","last_name":"Brauns","first_name":"Matthias","full_name":"Brauns, Matthias"},{"last_name":"Amitonov","first_name":"Sergey","full_name":"Amitonov, Sergey"},{"first_name":"Paul","last_name":"Spruijtenburg","full_name":"Spruijtenburg, Paul"},{"full_name":"Zwanenburg, Floris","first_name":"Floris","last_name":"Zwanenburg"}],"article_number":"5690","license":"https://creativecommons.org/licenses/by/4.0/","file_date_updated":"2020-07-14T12:46:02Z","publist_id":"7548"},{"publication":"The FASEB Journal","citation":{"ieee":"Z. Liutkeviciute et al., “Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity,” The FASEB Journal, vol. 32, no. 12. FASEB, pp. 6808–6821, 2018.","apa":"Liutkeviciute, Z., Gil Mansilla, E., Eder, T., Casillas Perez, B. E., Giulia Di Giglio, M., Muratspahić, E., … Gruber, C. (2018). Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity. The FASEB Journal. FASEB. https://doi.org/10.1096/fj.201800443","ista":"Liutkeviciute Z, Gil Mansilla E, Eder T, Casillas Perez BE, Giulia Di Giglio M, Muratspahić E, Grebien F, Rattei T, Muttenthaler M, Cremer S, Gruber C. 2018. Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity. The FASEB Journal. 32(12), 6808–6821.","ama":"Liutkeviciute Z, Gil Mansilla E, Eder T, et al. Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity. The FASEB Journal. 2018;32(12):6808-6821. doi:10.1096/fj.201800443","chicago":"Liutkeviciute, Zita, Esther Gil Mansilla, Thomas Eder, Barbara E Casillas Perez, Maria Giulia Di Giglio, Edin Muratspahić, Florian Grebien, et al. “Oxytocin-like Signaling in Ants Influences Metabolic Gene Expression and Locomotor Activity.” The FASEB Journal. FASEB, 2018. https://doi.org/10.1096/fj.201800443.","short":"Z. Liutkeviciute, E. Gil Mansilla, T. Eder, B.E. Casillas Perez, M. Giulia Di Giglio, E. Muratspahić, F. Grebien, T. Rattei, M. Muttenthaler, S. Cremer, C. Gruber, The FASEB Journal 32 (2018) 6808–6821.","mla":"Liutkeviciute, Zita, et al. “Oxytocin-like Signaling in Ants Influences Metabolic Gene Expression and Locomotor Activity.” The FASEB Journal, vol. 32, no. 12, FASEB, 2018, pp. 6808–21, doi:10.1096/fj.201800443."},"article_type":"original","page":"6808-6821","date_published":"2018-11-29T00:00:00Z","scopus_import":"1","day":"29","article_processing_charge":"No","_id":"194","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity","intvolume":" 32","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Ants are emerging model systems to study cellular signaling because distinct castes possess different physiologic phenotypes within the same colony. Here we studied the functionality of inotocin signaling, an insect ortholog of mammalian oxytocin (OT), which was recently discovered in ants. In Lasius ants, we determined that specialization within the colony, seasonal factors, and physiologic conditions down-regulated the expression of the OT-like signaling system. Given this natural variation, we interrogated its function using RNAi knockdowns. Next-generation RNA sequencing of OT-like precursor knock-down ants highlighted its role in the regulation of genes involved in metabolism. Knock-down ants exhibited higher walking activity and increased self-grooming in the brood chamber. We propose that OT-like signaling in ants is important for regulating metabolic processes and locomotion.","lang":"eng"}],"issue":"12","oa":1,"external_id":{"isi":["000449359700035"],"pmid":["29939785"]},"main_file_link":[{"url":" https://doi.org/10.1096/fj.201800443","open_access":"1"}],"isi":1,"quality_controlled":"1","project":[{"name":"Individual function and social role of oxytocin-like neuropeptides in ants","_id":"25E3D34E-B435-11E9-9278-68D0E5697425"}],"doi":"10.1096/fj.201800443","language":[{"iso":"eng"}],"month":"11","publication_identifier":{"issn":["08926638"]},"year":"2018","pmid":1,"publication_status":"published","publisher":"FASEB","department":[{"_id":"SyCr"}],"author":[{"full_name":"Liutkeviciute, Zita","first_name":"Zita","last_name":"Liutkeviciute"},{"first_name":"Esther","last_name":"Gil Mansilla","full_name":"Gil Mansilla, Esther"},{"full_name":"Eder, Thomas","first_name":"Thomas","last_name":"Eder"},{"first_name":"Barbara E","last_name":"Casillas Perez","id":"351ED2AA-F248-11E8-B48F-1D18A9856A87","full_name":"Casillas Perez, Barbara E"},{"full_name":"Giulia Di Giglio, Maria","first_name":"Maria","last_name":"Giulia Di Giglio"},{"last_name":"Muratspahić","first_name":"Edin","full_name":"Muratspahić, Edin"},{"full_name":"Grebien, Florian","last_name":"Grebien","first_name":"Florian"},{"full_name":"Rattei, Thomas","first_name":"Thomas","last_name":"Rattei"},{"first_name":"Markus","last_name":"Muttenthaler","full_name":"Muttenthaler, Markus"},{"full_name":"Cremer, Sylvia","first_name":"Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868"},{"first_name":"Christian","last_name":"Gruber","full_name":"Gruber, Christian"}],"date_updated":"2023-09-13T09:37:32Z","date_created":"2018-12-11T11:45:08Z","volume":32,"publist_id":"7721"},{"year":"2018","publication_status":"published","department":[{"_id":"JoDa"}],"publisher":"Nature Publishing Group","author":[{"full_name":"Fehrentz, Timm","last_name":"Fehrentz","first_name":"Timm"},{"first_name":"Florian","last_name":"Huber","full_name":"Huber, Florian"},{"full_name":"Hartrampf, Nina","first_name":"Nina","last_name":"Hartrampf"},{"full_name":"Bruegmann, Tobias","last_name":"Bruegmann","first_name":"Tobias"},{"full_name":"Frank, James","last_name":"Frank","first_name":"James"},{"full_name":"Fine, Nicholas","last_name":"Fine","first_name":"Nicholas"},{"full_name":"Malan, Daniela","last_name":"Malan","first_name":"Daniela"},{"full_name":"Danzl, Johann G","last_name":"Danzl","first_name":"Johann G","orcid":"0000-0001-8559-3973","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tikhonov, Denis","first_name":"Denis","last_name":"Tikhonov"},{"first_name":"Maritn","last_name":"Sumser","full_name":"Sumser, Maritn"},{"full_name":"Sasse, Philipp","first_name":"Philipp","last_name":"Sasse"},{"full_name":"Hodson, David","last_name":"Hodson","first_name":"David"},{"full_name":"Zhorov, Boris","first_name":"Boris","last_name":"Zhorov"},{"last_name":"Klocker","first_name":"Nikolaj","full_name":"Klocker, Nikolaj"},{"full_name":"Trauner, Dirk","first_name":"Dirk","last_name":"Trauner"}],"related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1038/s41589-021-00744-3"}]},"date_updated":"2023-09-13T09:36:35Z","date_created":"2018-12-11T11:44:56Z","volume":14,"file_date_updated":"2020-07-14T12:45:03Z","publist_id":"7762","oa":1,"external_id":{"isi":["000438970200010"]},"isi":1,"quality_controlled":"1","doi":"10.1038/s41589-018-0090-8","language":[{"iso":"eng"}],"month":"07","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"159","ddc":["570"],"status":"public","title":"Optical control of L-type Ca2+ channels using a diltiazem photoswitch","intvolume":" 14","file":[{"file_name":"2018_NatureChemicalBiology_Fehrentz.pdf","access_level":"open_access","creator":"dernst","file_size":6321000,"content_type":"application/pdf","file_id":"7832","relation":"main_file","date_updated":"2020-07-14T12:45:03Z","date_created":"2020-05-14T12:14:09Z","checksum":"d42935094ec845f54a0688bf12986d62"}],"oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"L-type Ca2+ channels (LTCCs) play a crucial role in excitation-contraction coupling and release of hormones from secretory cells. They are targets of antihypertensive and antiarrhythmic drugs such as diltiazem. Here, we present a photoswitchable diltiazem, FHU-779, which can be used to reversibly block endogenous LTCCs by light. FHU-779 is as potent as diltiazem and can be used to place pancreatic β-cell function and cardiac activity under optical control."}],"issue":"8","publication":"Nature Chemical Biology","citation":{"mla":"Fehrentz, Timm, et al. “Optical Control of L-Type Ca2+ Channels Using a Diltiazem Photoswitch.” Nature Chemical Biology, vol. 14, no. 8, Nature Publishing Group, 2018, pp. 764–67, doi:10.1038/s41589-018-0090-8.","short":"T. Fehrentz, F. Huber, N. Hartrampf, T. Bruegmann, J. Frank, N. Fine, D. Malan, J.G. Danzl, D. Tikhonov, M. Sumser, P. Sasse, D. Hodson, B. Zhorov, N. Klocker, D. Trauner, Nature Chemical Biology 14 (2018) 764–767.","chicago":"Fehrentz, Timm, Florian Huber, Nina Hartrampf, Tobias Bruegmann, James Frank, Nicholas Fine, Daniela Malan, et al. “Optical Control of L-Type Ca2+ Channels Using a Diltiazem Photoswitch.” Nature Chemical Biology. Nature Publishing Group, 2018. https://doi.org/10.1038/s41589-018-0090-8.","ama":"Fehrentz T, Huber F, Hartrampf N, et al. Optical control of L-type Ca2+ channels using a diltiazem photoswitch. Nature Chemical Biology. 2018;14(8):764-767. doi:10.1038/s41589-018-0090-8","ista":"Fehrentz T, Huber F, Hartrampf N, Bruegmann T, Frank J, Fine N, Malan D, Danzl JG, Tikhonov D, Sumser M, Sasse P, Hodson D, Zhorov B, Klocker N, Trauner D. 2018. Optical control of L-type Ca2+ channels using a diltiazem photoswitch. Nature Chemical Biology. 14(8), 764–767.","ieee":"T. Fehrentz et al., “Optical control of L-type Ca2+ channels using a diltiazem photoswitch,” Nature Chemical Biology, vol. 14, no. 8. Nature Publishing Group, pp. 764–767, 2018.","apa":"Fehrentz, T., Huber, F., Hartrampf, N., Bruegmann, T., Frank, J., Fine, N., … Trauner, D. (2018). Optical control of L-type Ca2+ channels using a diltiazem photoswitch. Nature Chemical Biology. Nature Publishing Group. https://doi.org/10.1038/s41589-018-0090-8"},"article_type":"original","page":"764 - 767","date_published":"2018-07-16T00:00:00Z","scopus_import":"1","day":"16","has_accepted_license":"1","article_processing_charge":"No"}]