[{"oa":1,"title":"Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes","_id":"9932","date_published":"2014-01-27T00:00:00Z","citation":{"chicago":"Dhar, Riddhiman, Tobias Bergmiller, and Andreas Wagner. “Data from: Increased Gene Dosage Plays a Predominant Role in the Initial Stages of Evolution of Duplicate TEM-1 Beta Lactamase Genes.” Dryad, 2014. <a href=\"https://doi.org/10.5061/dryad.jc402\">https://doi.org/10.5061/dryad.jc402</a>.","mla":"Dhar, Riddhiman, et al. <i>Data from: Increased Gene Dosage Plays a Predominant Role in the Initial Stages of Evolution of Duplicate TEM-1 Beta Lactamase Genes</i>. Dryad, 2014, doi:<a href=\"https://doi.org/10.5061/dryad.jc402\">10.5061/dryad.jc402</a>.","short":"R. Dhar, T. Bergmiller, A. Wagner, (2014).","ieee":"R. Dhar, T. Bergmiller, and A. Wagner, “Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes.” Dryad, 2014.","ama":"Dhar R, Bergmiller T, Wagner A. Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes. 2014. doi:<a href=\"https://doi.org/10.5061/dryad.jc402\">10.5061/dryad.jc402</a>","apa":"Dhar, R., Bergmiller, T., &#38; Wagner, A. (2014). Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes. Dryad. <a href=\"https://doi.org/10.5061/dryad.jc402\">https://doi.org/10.5061/dryad.jc402</a>","ista":"Dhar R, Bergmiller T, Wagner A. 2014. Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes, Dryad, <a href=\"https://doi.org/10.5061/dryad.jc402\">10.5061/dryad.jc402</a>."},"date_created":"2021-08-17T09:11:40Z","doi":"10.5061/dryad.jc402","publisher":"Dryad","department":[{"_id":"CaGu"}],"month":"01","article_processing_charge":"No","status":"public","type":"research_data_reference","year":"2014","day":"27","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","main_file_link":[{"url":"https://doi.org/10.5061/dryad.jc402","open_access":"1"}],"oa_version":"Published Version","author":[{"last_name":"Dhar","first_name":"Riddhiman","full_name":"Dhar, Riddhiman"},{"first_name":"Tobias","full_name":"Bergmiller, Tobias","orcid":"0000-0001-5396-4346","last_name":"Bergmiller","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wagner, Andreas","first_name":"Andreas","last_name":"Wagner"}],"related_material":{"record":[{"id":"9931","status":"public","relation":"used_in_publication"}]},"abstract":[{"text":"Gene duplication is important in evolution, because it provides new raw material for evolutionary adaptations. Several existing hypotheses about the causes of duplicate retention and diversification differ in their emphasis on gene dosage, sub-functionalization, and neo-functionalization. Little experimental data exists on the relative importance of gene expression changes and changes in coding regions for the evolution of duplicate genes. Furthermore, we do not know how strongly the environment could affect this importance. To address these questions, we performed evolution experiments with the TEM-1 beta lactamase gene in E. coli to study the initial stages of duplicate gene evolution in the laboratory. We mimicked tandem duplication by inserting two copies of the TEM-1 gene on the same plasmid. We then subjected these copies to repeated cycles of mutagenesis and selection in various environments that contained antibiotics in different combinations and concentrations. Our experiments showed that gene dosage is the most important factor in the initial stages of duplicate gene evolution, and overshadows the importance of point mutations in the coding region.","lang":"eng"}],"date_updated":"2023-02-23T14:13:24Z"},{"oa":1,"volume":9,"doi":"10.1371/journal.pone.0107518","publication":"PLoS One","year":"2014","status":"public","language":[{"iso":"eng"}],"month":"09","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","pubrep_id":"954","publist_id":"7352","day":"23","scopus_import":1,"oa_version":"Published Version","has_accepted_license":"1","quality_controlled":"1","_id":"468","date_published":"2014-09-23T00:00:00Z","title":"Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin's finches","citation":{"ama":"Cimadom A, Ulloa A, Meidl P, et al. Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. <i>PLoS One</i>. 2014;9(9). doi:<a href=\"https://doi.org/10.1371/journal.pone.0107518\">10.1371/journal.pone.0107518</a>","ieee":"A. Cimadom <i>et al.</i>, “Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches,” <i>PLoS One</i>, vol. 9, no. 9. Public Library of Science, 2014.","apa":"Cimadom, A., Ulloa, A., Meidl, P., Zöttl, M., Zöttl, E., Fessl, B., … Tebbich, S. (2014). Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0107518\">https://doi.org/10.1371/journal.pone.0107518</a>","mla":"Cimadom, Arno, et al. “Invasive Parasites Habitat Change and Heavy Rainfall Reduce Breeding Success in Darwin’s Finches.” <i>PLoS One</i>, vol. 9, no. 9, 0107518, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0107518\">10.1371/journal.pone.0107518</a>.","chicago":"Cimadom, Arno, Angel Ulloa, Patrick Meidl, Markus Zöttl, Elisabet Zöttl, Birgit Fessl, Erwin Nemeth, Michael Dvorak, Francesca Cunninghame, and Sabine Tebbich. “Invasive Parasites Habitat Change and Heavy Rainfall Reduce Breeding Success in Darwin’s Finches.” <i>PLoS One</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0107518\">https://doi.org/10.1371/journal.pone.0107518</a>.","short":"A. Cimadom, A. Ulloa, P. Meidl, M. Zöttl, E. Zöttl, B. Fessl, E. Nemeth, M. Dvorak, F. Cunninghame, S. Tebbich, PLoS One 9 (2014).","ista":"Cimadom A, Ulloa A, Meidl P, Zöttl M, Zöttl E, Fessl B, Nemeth E, Dvorak M, Cunninghame F, Tebbich S. 2014. Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. PLoS One. 9(9), 0107518."},"publication_status":"published","date_created":"2018-12-11T11:46:38Z","publisher":"Public Library of Science","department":[{"_id":"CampIT"}],"license":"https://creativecommons.org/licenses/by/4.0/","file":[{"file_id":"5103","file_size":489387,"creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:34Z","checksum":"b24e7518ccd41effed0d7d9e2498f67f","content_type":"application/pdf","date_created":"2018-12-12T10:14:48Z","file_name":"IST-2018-954-v1+1_2014_Meidl_Invasive_parasites.PDF"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"type":"journal_article","intvolume":"         9","ddc":["576"],"issue":"9","file_date_updated":"2020-07-14T12:46:34Z","acknowledgement":"The study was funded by the University of Vienna (Focus of Excellence grant), the Galápagos Conservation Trust, and the Ethologische Gesellschaft e.V.","author":[{"last_name":"Cimadom","first_name":"Arno","full_name":"Cimadom, Arno"},{"full_name":"Ulloa, Angel","first_name":"Angel","last_name":"Ulloa"},{"first_name":"Patrick","full_name":"Meidl, Patrick","last_name":"Meidl","id":"4709BCE6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zöttl","first_name":"Markus","full_name":"Zöttl, Markus"},{"first_name":"Elisabet","full_name":"Zöttl, Elisabet","last_name":"Zöttl"},{"last_name":"Fessl","first_name":"Birgit","full_name":"Fessl, Birgit"},{"first_name":"Erwin","full_name":"Nemeth, Erwin","last_name":"Nemeth"},{"first_name":"Michael","full_name":"Dvorak, Michael","last_name":"Dvorak"},{"last_name":"Cunninghame","first_name":"Francesca","full_name":"Cunninghame, Francesca"},{"first_name":"Sabine","full_name":"Tebbich, Sabine","last_name":"Tebbich"}],"date_updated":"2021-01-12T08:00:48Z","article_number":"0107518","abstract":[{"lang":"eng","text":"Invasive alien parasites and pathogens are a growing threat to biodiversity worldwide, which can contribute to the extinction of endemic species. On the Galápagos Islands, the invasive parasitic fly Philornis downsi poses a major threat to the endemic avifauna. Here, we investigated the influence of this parasite on the breeding success of two Darwin's finch species, the warbler finch (Certhidea olivacea) and the sympatric small tree finch (Camarhynchus parvulus), on Santa Cruz Island in 2010 and 2012. While the population of the small tree finch appeared to be stable, the warbler finch has experienced a dramatic decline in population size on Santa Cruz Island since 1997. We aimed to identify whether warbler finches are particularly vulnerable during different stages of the breeding cycle. Contrary to our prediction, breeding success was lower in the small tree finch than in the warbler finch. In both species P. downsi had a strong negative impact on breeding success and our data suggest that heavy rain events also lowered the fledging success. On the one hand parents might be less efficient in compensating their chicks' energy loss due to parasitism as they might be less efficient in foraging on days of heavy rain. On the other hand, intense rainfalls might lead to increased humidity and more rapid cooling of the nests. In the case of the warbler finch we found that the control of invasive plant species with herbicides had a significant additive negative impact on the breeding success. It is very likely that the availability of insects (i.e. food abundance) is lower in such controlled areas, as herbicide usage led to the removal of the entire understory. Predation seems to be a minor factor in brood loss."}]},{"intvolume":"       146","type":"conference","ddc":["004"],"author":[{"full_name":"Aminof, Benjamin","first_name":"Benjamin","last_name":"Aminof","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rubin, Sasha","first_name":"Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","last_name":"Rubin"}],"file_date_updated":"2020-07-14T12:46:35Z","conference":{"name":"SR: Strategic Reasoning","location":"Grenoble, France","start_date":"2014-04-05","end_date":"2014-04-06"},"page":"83 - 90","abstract":[{"lang":"eng","text":"First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of the edges (or nodes) forming this cycle. These games are traditionally of interest because of their connection with infinite-duration games such as parity and mean-payoff games. We study the memory requirements for winning strategies of FCGs and certain associated infinite duration games. We exhibit a simple FCG that is not memoryless determined (this corrects a mistake in Memoryless determinacy of parity and mean payoff games: a simple proof by Bj⋯orklund, Sandberg, Vorobyov (2004) that claims that FCGs for which Y is closed under cyclic permutations are memoryless determined). We show that θ (n)! memory (where n is the number of nodes in the graph), which is always sufficient, may be necessary to win some FCGs. On the other hand, we identify easy to check conditions on Y (i.e., Y is closed under cyclic permutations, and both Y and its complement are closed under concatenation) that are sufficient to ensure that the corresponding FCGs and their associated infinite duration games are memoryless determined. We demonstrate that many games considered in the literature, such as mean-payoff, parity, energy, etc., satisfy these conditions. On the complexity side, we show (for efficiently computable Y) that while solving FCGs is in PSPACE, solving some families of FCGs is PSPACE-hard. "}],"date_updated":"2021-01-12T08:00:53Z","ec_funded":1,"title":"First cycle games","_id":"475","date_published":"2014-04-01T00:00:00Z","citation":{"ieee":"B. Aminof and S. Rubin, “First cycle games,” in <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, Grenoble, France, 2014, vol. 146, pp. 83–90.","ama":"Aminof B, Rubin S. First cycle games. In: <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>. Vol 146. Open Publishing Association; 2014:83-90. doi:<a href=\"https://doi.org/10.4204/EPTCS.146.11\">10.4204/EPTCS.146.11</a>","apa":"Aminof, B., &#38; Rubin, S. (2014). First cycle games. In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i> (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.146.11\">https://doi.org/10.4204/EPTCS.146.11</a>","chicago":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, 146:83–90. Open Publishing Association, 2014. <a href=\"https://doi.org/10.4204/EPTCS.146.11\">https://doi.org/10.4204/EPTCS.146.11</a>.","mla":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, vol. 146, Open Publishing Association, 2014, pp. 83–90, doi:<a href=\"https://doi.org/10.4204/EPTCS.146.11\">10.4204/EPTCS.146.11</a>.","short":"B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.","ista":"Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90."},"publication_status":"published","date_created":"2018-12-11T11:46:41Z","publisher":"Open Publishing Association","department":[{"_id":"KrCh"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:35Z","checksum":"4d7b4ab82980cca2b96ac7703992a8c8","creator":"system","file_size":100115,"file_id":"5260","date_created":"2018-12-12T10:17:08Z","file_name":"IST-2018-952-v1+1_2014_Rubin_First_cycle.pdf","content_type":"application/pdf"}],"month":"04","year":"2014","status":"public","language":[{"iso":"eng"}],"day":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"7345","alternative_title":["EPTCS"],"pubrep_id":"952","oa_version":"Published Version","scopus_import":1,"quality_controlled":"1","has_accepted_license":"1","oa":1,"volume":146,"doi":"10.4204/EPTCS.146.11","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS"},{"type":"journal_article","intvolume":"        70","issue":"3","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"full_name":"Krinninger, Sebastian","first_name":"Sebastian","last_name":"Krinninger"},{"first_name":"Danupon","full_name":"Nanongkai, Danupon","last_name":"Nanongkai"}],"main_file_link":[{"url":"https://arxiv.org/abs/1604.08234","open_access":"1"}],"date_updated":"2023-09-05T14:09:29Z","article_type":"original","page":"457 - 492","abstract":[{"lang":"eng","text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP∩co-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time. In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several worst-case instances on which previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting the graph structure does not necessarily help."}],"_id":"535","date_published":"2014-11-01T00:00:00Z","title":"Polynomial-time algorithms for energy games with special weight structures","ec_funded":1,"publication_status":"published","citation":{"ista":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2014. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492.","short":"K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica 70 (2014) 457–492.","mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithmica</i>, vol. 70, no. 3, Springer, 2014, pp. 457–92, doi:<a href=\"https://doi.org/10.1007/s00453-013-9843-7\">10.1007/s00453-013-9843-7</a>.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithmica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00453-013-9843-7\">https://doi.org/10.1007/s00453-013-9843-7</a>.","apa":"Chatterjee, K., Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2014). Polynomial-time algorithms for energy games with special weight structures. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/s00453-013-9843-7\">https://doi.org/10.1007/s00453-013-9843-7</a>","ieee":"K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” <i>Algorithmica</i>, vol. 70, no. 3. Springer, pp. 457–492, 2014.","ama":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. <i>Algorithmica</i>. 2014;70(3):457-492. doi:<a href=\"https://doi.org/10.1007/s00453-013-9843-7\">10.1007/s00453-013-9843-7</a>"},"date_created":"2018-12-11T11:47:01Z","publisher":"Springer","department":[{"_id":"KrCh"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","year":"2014","month":"11","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","publist_id":"7282","day":"01","scopus_import":"1","related_material":{"record":[{"id":"10905","status":"public","relation":"earlier_version"}]},"oa_version":"Preprint","external_id":{"arxiv":["1604.08234"]},"quality_controlled":"1","oa":1,"volume":70,"doi":"10.1007/s00453-013-9843-7","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publication":"Algorithmica","arxiv":1},{"has_accepted_license":"1","scopus_import":1,"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"934","publist_id":"7280","day":"19","language":[{"iso":"eng"}],"year":"2014","status":"public","month":"07","publication":"Ecology and Evolution","doi":"10.1002/ece3.1150","oa":1,"volume":4,"date_updated":"2021-01-12T08:01:30Z","abstract":[{"text":"Transgenerational effects are broader than only parental relationships. Despite mounting evidence that multigenerational effects alter phenotypic and life-history traits, our understanding of how they combine to determine fitness is not well developed because of the added complexity necessary to study them. Here, we derive a quantitative genetic model of adaptation to an extraordinary new environment by an additive genetic component, phenotypic plasticity, maternal and grandmaternal effects. We show how, at equilibrium, negative maternal and negative grandmaternal effects maximize expected population mean fitness. We define negative transgenerational effects as those that have a negative effect on trait expression in the subsequent generation, that is, they slow, or potentially reverse, the expected evolutionary dynamic. When maternal effects are positive, negative grandmaternal effects are preferred. As expected under Mendelian inheritance, the grandmaternal effects have a lower impact on fitness than the maternal effects, but this dual inheritance model predicts a more complex relationship between maternal and grandmaternal effects to constrain phenotypic variance and so maximize expected population mean fitness in the offspring.","lang":"eng"}],"page":"3139 - 3145","issue":"15","file_date_updated":"2020-07-14T12:46:38Z","author":[{"full_name":"Prizak, Roshan","first_name":"Roshan","last_name":"Prizak","id":"4456104E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ezard","first_name":"Thomas","full_name":"Ezard, Thomas"},{"last_name":"Hoyle","first_name":"Rebecca","full_name":"Hoyle, Rebecca"}],"ddc":["530","571"],"type":"journal_article","intvolume":"         4","file":[{"creator":"system","file_id":"4886","file_size":621582,"checksum":"e32abf75a248e7a11811fd7f60858769","date_updated":"2020-07-14T12:46:38Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2018-934-v1+1_Prizak_et_al-2014-Ecology_and_Evolution.pdf","date_created":"2018-12-12T10:11:31Z"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Wiley-Blackwell","department":[{"_id":"NiBa"},{"_id":"GaTk"}],"publication_status":"published","citation":{"ista":"Prizak R, Ezard T, Hoyle R. 2014. Fitness consequences of maternal and grandmaternal effects. Ecology and Evolution. 4(15), 3139–3145.","ama":"Prizak R, Ezard T, Hoyle R. Fitness consequences of maternal and grandmaternal effects. <i>Ecology and Evolution</i>. 2014;4(15):3139-3145. doi:<a href=\"https://doi.org/10.1002/ece3.1150\">10.1002/ece3.1150</a>","ieee":"R. Prizak, T. Ezard, and R. Hoyle, “Fitness consequences of maternal and grandmaternal effects,” <i>Ecology and Evolution</i>, vol. 4, no. 15. Wiley-Blackwell, pp. 3139–3145, 2014.","apa":"Prizak, R., Ezard, T., &#38; Hoyle, R. (2014). Fitness consequences of maternal and grandmaternal effects. <i>Ecology and Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/ece3.1150\">https://doi.org/10.1002/ece3.1150</a>","mla":"Prizak, Roshan, et al. “Fitness Consequences of Maternal and Grandmaternal Effects.” <i>Ecology and Evolution</i>, vol. 4, no. 15, Wiley-Blackwell, 2014, pp. 3139–45, doi:<a href=\"https://doi.org/10.1002/ece3.1150\">10.1002/ece3.1150</a>.","chicago":"Prizak, Roshan, Thomas Ezard, and Rebecca Hoyle. “Fitness Consequences of Maternal and Grandmaternal Effects.” <i>Ecology and Evolution</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/ece3.1150\">https://doi.org/10.1002/ece3.1150</a>.","short":"R. Prizak, T. Ezard, R. Hoyle, Ecology and Evolution 4 (2014) 3139–3145."},"date_created":"2018-12-11T11:47:02Z","date_published":"2014-07-19T00:00:00Z","_id":"537","title":"Fitness consequences of maternal and grandmaternal effects"},{"ddc":["000","004"],"intvolume":"      8616","type":"conference","editor":[{"last_name":"Garay","full_name":"Garay, Juan","first_name":"Juan"},{"first_name":"Rosario","full_name":"Gennaro, Rosario","last_name":"Gennaro"}],"date_updated":"2023-09-07T12:02:27Z","conference":{"end_date":"2014-08-21","start_date":"2014-08-17","name":"CRYPTO: International Cryptology Conference","location":"Santa Barbara, USA"},"abstract":[{"text":"NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular and widely deployed message authentication code (MAC). Security proofs and attacks for NMAC can typically be lifted to HMAC. NMAC was introduced by Bellare, Canetti and Krawczyk [Crypto'96], who proved it to be a secure pseudorandom function (PRF), and thus also a MAC, assuming that (1) f is a PRF and (2) the function we get when cascading f is weakly collision-resistant. Unfortunately, HMAC is typically instantiated with cryptographic hash functions like MD5 or SHA-1 for which (2) has been found to be wrong. To restore the provable guarantees for NMAC, Bellare [Crypto'06] showed its security based solely on the assumption that f is a PRF, albeit via a non-uniform reduction. - Our first contribution is a simpler and uniform proof for this fact: If f is an ε-secure PRF (against q queries) and a δ-non-adaptively secure PRF (against q queries), then NMAC f is an (ε+ℓqδ)-secure PRF against q queries of length at most ℓ blocks each. - We then show that this ε+ℓqδ bound is basically tight. For the most interesting case where ℓqδ ≥ ε we prove this by constructing an f for which an attack with advantage ℓqδ exists. This also violates the bound O(ℓε) on the PRF-security of NMAC recently claimed by Koblitz and Menezes. - Finally, we analyze the PRF-security of a modification of NMAC called NI [An and Bellare, Crypto'99] that differs mainly by using a compression function with an additional keying input. This avoids the constant rekeying on multi-block messages in NMAC and allows for a security proof starting by the standard switch from a PRF to a random function, followed by an information-theoretic analysis. We carry out such an analysis, obtaining a tight ℓq2/2 c bound for this step, improving over the trivial bound of ℓ2q2/2c. The proof borrows combinatorial techniques originally developed for proving the security of CBC-MAC [Bellare et al., Crypto'05].","lang":"eng"}],"page":"113 - 130","issue":"1","file_date_updated":"2020-07-14T12:45:28Z","author":[{"last_name":"Gazi","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","full_name":"Gazi, Peter"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"},{"first_name":"Michal","full_name":"Rybar, Michal","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","last_name":"Rybar"}],"publication_status":"published","citation":{"short":"P. Gazi, K.Z. Pietrzak, M. Rybar, in:, J. Garay, R. Gennaro (Eds.), Springer, 2014, pp. 113–130.","chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact PRF-Security of NMAC and HMAC.” edited by Juan Garay and Rosario Gennaro, 8616:113–30. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">https://doi.org/10.1007/978-3-662-44371-2_7</a>.","mla":"Gazi, Peter, et al. <i>The Exact PRF-Security of NMAC and HMAC</i>. Edited by Juan Garay and Rosario Gennaro, vol. 8616, no. 1, Springer, 2014, pp. 113–30, doi:<a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">10.1007/978-3-662-44371-2_7</a>.","apa":"Gazi, P., Pietrzak, K. Z., &#38; Rybar, M. (2014). The exact PRF-security of NMAC and HMAC. In J. Garay &#38; R. Gennaro (Eds.) (Vol. 8616, pp. 113–130). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">https://doi.org/10.1007/978-3-662-44371-2_7</a>","ieee":"P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact PRF-security of NMAC and HMAC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA, 2014, vol. 8616, no. 1, pp. 113–130.","ama":"Gazi P, Pietrzak KZ, Rybar M. The exact PRF-security of NMAC and HMAC. In: Garay J, Gennaro R, eds. Vol 8616. Springer; 2014:113-130. doi:<a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">10.1007/978-3-662-44371-2_7</a>","ista":"Gazi P, Pietrzak KZ, Rybar M. 2014. The exact PRF-security of NMAC and HMAC. CRYPTO: International Cryptology Conference, LNCS, vol. 8616, 113–130."},"date_created":"2018-12-11T11:55:36Z","_id":"2082","date_published":"2014-01-01T00:00:00Z","ec_funded":1,"title":"The exact PRF-security of NMAC and HMAC","file":[{"file_name":"IST-2016-682-v1+1_578.pdf","date_created":"2018-12-12T10:13:17Z","content_type":"application/pdf","checksum":"dab6ab36a5f6af94f2b597e6404ed11d","date_updated":"2020-07-14T12:45:28Z","access_level":"open_access","relation":"main_file","file_size":492310,"file_id":"4999","creator":"system"}],"publisher":"Springer","department":[{"_id":"KrPi"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"pubrep_id":"682","publist_id":"4955","day":"01","status":"public","language":[{"iso":"eng"}],"year":"2014","month":"01","has_accepted_license":"1","quality_controlled":"1","related_material":{"record":[{"id":"838","status":"public","relation":"dissertation_contains"}]},"oa_version":"Submitted Version","oa":1,"volume":8616,"doi":"10.1007/978-3-662-44371-2_7","project":[{"grant_number":"259668","call_identifier":"FP7","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425"}]},{"publisher":"Wiley","department":[{"_id":"CaGu"}],"file":[{"date_created":"2020-05-14T16:40:31Z","file_name":"2014_Evolution_Lagator.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:45:28Z","checksum":"8d459b07e4a11bb5fde92d969184fe48","creator":"dernst","file_id":"7845","file_size":467254}],"title":"Role of sex and migration in adaptation to sink environments","_id":"2083","date_published":"2014-04-25T00:00:00Z","publication_status":"published","citation":{"ista":"Lagator M, Morgan A, Neve P, Colegrave N. 2014. Role of sex and migration in adaptation to sink environments. Evolution. 68(8), 2296–2305.","short":"M. Lagator, A. Morgan, P. Neve, N. Colegrave, Evolution 68 (2014) 2296–2305.","mla":"Lagator, Mato, et al. “Role of Sex and Migration in Adaptation to Sink Environments.” <i>Evolution</i>, vol. 68, no. 8, Wiley, 2014, pp. 2296–305, doi:<a href=\"https://doi.org/10.1111/evo.12440\">10.1111/evo.12440</a>.","chicago":"Lagator, Mato, Andrew Morgan, Paul Neve, and Nick Colegrave. “Role of Sex and Migration in Adaptation to Sink Environments.” <i>Evolution</i>. Wiley, 2014. <a href=\"https://doi.org/10.1111/evo.12440\">https://doi.org/10.1111/evo.12440</a>.","apa":"Lagator, M., Morgan, A., Neve, P., &#38; Colegrave, N. (2014). Role of sex and migration in adaptation to sink environments. <i>Evolution</i>. Wiley. <a href=\"https://doi.org/10.1111/evo.12440\">https://doi.org/10.1111/evo.12440</a>","ama":"Lagator M, Morgan A, Neve P, Colegrave N. Role of sex and migration in adaptation to sink environments. <i>Evolution</i>. 2014;68(8):2296-2305. doi:<a href=\"https://doi.org/10.1111/evo.12440\">10.1111/evo.12440</a>","ieee":"M. Lagator, A. Morgan, P. Neve, and N. Colegrave, “Role of sex and migration in adaptation to sink environments,” <i>Evolution</i>, vol. 68, no. 8. Wiley, pp. 2296–2305, 2014."},"date_created":"2018-12-11T11:55:36Z","author":[{"first_name":"Mato","full_name":"Lagator, Mato","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","last_name":"Lagator"},{"first_name":"Andrew","full_name":"Morgan, Andrew","last_name":"Morgan"},{"full_name":"Neve, Paul","first_name":"Paul","last_name":"Neve"},{"first_name":"Nick","full_name":"Colegrave, Nick","last_name":"Colegrave"}],"acknowledgement":"The authors are grateful to the Leverhulme Trust (F/00 215/AW) for funding this work.","issue":"8","file_date_updated":"2020-07-14T12:45:28Z","abstract":[{"lang":"eng","text":"Understanding the effects of sex and migration on adaptation to novel environments remains a key problem in evolutionary biology. Using a single-cell alga Chlamydomonas reinhardtii, we investigated how sex and migration affected rates of evolutionary rescue in a sink environment, and subsequent changes in fitness following evolutionary rescue. We show that sex and migration affect both the rate of evolutionary rescue and subsequent adaptation. However, their combined effects change as the populations adapt to a sink habitat. Both sex and migration independently increased rates of evolutionary rescue, but the effect of sex on subsequent fitness improvements, following initial rescue, changed with migration, as sex was beneficial in the absence of migration but constraining adaptation when combined with migration. These results suggest that sex and migration are beneficial during the initial stages of adaptation, but can become detrimental as the population adapts to its environment."}],"article_type":"original","page":"2296 - 2305","date_updated":"2023-02-23T14:06:51Z","intvolume":"        68","type":"journal_article","ddc":["570"],"doi":"10.1111/evo.12440","publication":"Evolution","oa":1,"volume":68,"oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"9747","relation":"research_data"}]},"scopus_import":1,"quality_controlled":"1","has_accepted_license":"1","month":"04","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"year":"2014","day":"25","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4954"},{"issue":"15","acknowledgement":"European Union Seventh Framework Programme; Human Frontier Science Program; Oesterreichische Nationalbank Anniversary Fund 14211; Austrian Research Promotion Agency; FemTech","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4194103/","open_access":"1"}],"author":[{"first_name":"Michael","full_name":"Grusch, Michael","last_name":"Grusch"},{"full_name":"Schelch, Karin","first_name":"Karin","last_name":"Schelch"},{"first_name":"Robert","full_name":"Riedler, Robert","last_name":"Riedler"},{"full_name":"Gschaider-Reichhart, Eva","first_name":"Eva","orcid":"0000-0002-7218-7738","last_name":"Gschaider-Reichhart","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Differ","full_name":"Differ, Christopher","first_name":"Christopher"},{"full_name":"Berger, Walter","first_name":"Walter","last_name":"Berger"},{"first_name":"Álvaro","full_name":"Inglés Prieto, Álvaro","orcid":"0000-0002-5409-8571","last_name":"Inglés Prieto","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","full_name":"Janovjak, Harald L","first_name":"Harald L"}],"date_updated":"2023-09-07T12:49:09Z","abstract":[{"lang":"eng","text":"Receptor tyrosine kinases (RTKs) are a large family of cell surface receptors that sense growth factors and hormones and regulate a variety of cell behaviours in health and disease. Contactless activation of RTKs with spatial and temporal precision is currently not feasible. Here, we generated RTKs that are insensitive to endogenous ligands but can be selectively activated by low-intensity blue light. We screened light-oxygen-voltage (LOV)-sensing domains for their ability to activate RTKs by light-activated dimerization. Incorporation of LOV domains found in aureochrome photoreceptors of stramenopiles resulted in robust activation of the fibroblast growth factor receptor 1 (FGFR1), epidermal growth factor receptor (EGFR) and rearranged during transfection (RET). In human cancer and endothelial cells, light induced cellular signalling with spatial and temporal precision. Furthermore, light faithfully mimicked complex mitogenic and morphogenic cell behaviour induced by growth factors. RTKs under optical control (Opto-RTKs) provide a powerful optogenetic approach to actuate cellular signals and manipulate cell behaviour."}],"page":"1713 - 1726","type":"journal_article","intvolume":"        33","department":[{"_id":"HaJa"}],"publisher":"Wiley-Blackwell","_id":"2084","date_published":"2014-07-01T00:00:00Z","title":"Spatio-temporally precise activation of engineered receptor tyrosine kinases by light","date_created":"2018-12-11T11:55:37Z","publication_status":"published","citation":{"ista":"Grusch M, Schelch K, Riedler R, Gschaider-Reichhart E, Differ C, Berger W, Inglés Prieto Á, Janovjak HL. 2014. Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. EMBO Journal. 33(15), 1713–1726.","mla":"Grusch, Michael, et al. “Spatio-Temporally Precise Activation of Engineered Receptor Tyrosine Kinases by Light.” <i>EMBO Journal</i>, vol. 33, no. 15, Wiley-Blackwell, 2014, pp. 1713–26, doi:<a href=\"https://doi.org/10.15252/embj.201387695\">10.15252/embj.201387695</a>.","chicago":"Grusch, Michael, Karin Schelch, Robert Riedler, Eva Gschaider-Reichhart, Christopher Differ, Walter Berger, Álvaro Inglés Prieto, and Harald L Janovjak. “Spatio-Temporally Precise Activation of Engineered Receptor Tyrosine Kinases by Light.” <i>EMBO Journal</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.15252/embj.201387695\">https://doi.org/10.15252/embj.201387695</a>.","short":"M. Grusch, K. Schelch, R. Riedler, E. Gschaider-Reichhart, C. Differ, W. Berger, Á. Inglés Prieto, H.L. Janovjak, EMBO Journal 33 (2014) 1713–1726.","ama":"Grusch M, Schelch K, Riedler R, et al. Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. <i>EMBO Journal</i>. 2014;33(15):1713-1726. doi:<a href=\"https://doi.org/10.15252/embj.201387695\">10.15252/embj.201387695</a>","ieee":"M. Grusch <i>et al.</i>, “Spatio-temporally precise activation of engineered receptor tyrosine kinases by light,” <i>EMBO Journal</i>, vol. 33, no. 15. Wiley-Blackwell, pp. 1713–1726, 2014.","apa":"Grusch, M., Schelch, K., Riedler, R., Gschaider-Reichhart, E., Differ, C., Berger, W., … Janovjak, H. L. (2014). Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.15252/embj.201387695\">https://doi.org/10.15252/embj.201387695</a>"},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"418"}]},"scopus_import":1,"oa_version":"Submitted Version","quality_controlled":"1","status":"public","year":"2014","language":[{"iso":"eng"}],"month":"07","publist_id":"4953","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","doi":"10.15252/embj.201387695","publication":"EMBO Journal","volume":33,"oa":1},{"pubrep_id":"437","publist_id":"4949","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"06","status":"public","language":[{"iso":"eng"}],"year":"2014","month":"08","has_accepted_license":"1","quality_controlled":"1","scopus_import":1,"related_material":{"record":[{"status":"public","id":"9888","relation":"research_data"}]},"oa_version":"Published Version","volume":9,"oa":1,"publication":"PLoS One","doi":"10.1371/journal.pone.0103989","ddc":["570"],"intvolume":"         9","type":"journal_article","date_updated":"2023-02-23T14:11:56Z","article_number":"e103989","abstract":[{"lang":"eng","text":"Pathogens may gain a fitness advantage through manipulation of the behaviour of their hosts. Likewise, host behavioural changes can be a defence mechanism, counteracting the impact of pathogens on host fitness. We apply harmonic radar technology to characterize the impact of an emerging pathogen - Nosema ceranae (Microsporidia) - on honeybee (Apis mellifera) flight and orientation performance in the field. Honeybees are the most important commercial pollinators. Emerging diseases have been proposed to play a prominent role in colony decline, partly through sub-lethal behavioural manipulation of their hosts. We found that homing success was significantly reduced in diseased (65.8%) versus healthy foragers (92.5%). Although lost bees had significantly reduced continuous flight times and prolonged resting times, other flight characteristics and navigational abilities showed no significant difference between infected and non-infected bees. Our results suggest that infected bees express normal flight characteristics but are constrained in their homing ability, potentially compromising the colony by reducing its resource inputs, but also counteracting the intra-colony spread of infection. We provide the first high-resolution analysis of sub-lethal effects of an emerging disease on insect flight behaviour. The potential causes and the implications for both host and parasite are discussed."}],"file_date_updated":"2020-07-14T12:45:28Z","issue":"8","author":[{"full_name":"Wolf, Stephan","first_name":"Stephan","last_name":"Wolf"},{"last_name":"Mcmahon","first_name":"Dino","full_name":"Mcmahon, Dino"},{"last_name":"Lim","first_name":"Ka","full_name":"Lim, Ka"},{"last_name":"Pull","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher","full_name":"Pull, Christopher","orcid":"0000-0003-1122-3982"},{"last_name":"Clark","first_name":"Suzanne","full_name":"Clark, Suzanne"},{"first_name":"Robert","full_name":"Paxton, Robert","last_name":"Paxton"},{"full_name":"Osborne, Juliet","first_name":"Juliet","last_name":"Osborne"}],"acknowledgement":"This study was funded jointly by a grant from BBSRC, Defra, NERC, the Scottish Government and the Wellcome Trust, under the Insect Pollinators Initiative (grant numbers BB/I00097/1 and BB/I000100/1). Rothamsted Research is a national institute of bioscience strategically funded by the UK Biotechnology and Biological Sciences Research Council (BBSRC).","date_created":"2018-12-11T11:55:37Z","citation":{"chicago":"Wolf, Stephan, Dino Mcmahon, Ka Lim, Christopher Pull, Suzanne Clark, Robert Paxton, and Juliet Osborne. “So near and yet so Far: Harmonic Radar Reveals Reduced Homing Ability of Nosema Infected Honeybees.” <i>PLoS One</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0103989\">https://doi.org/10.1371/journal.pone.0103989</a>.","mla":"Wolf, Stephan, et al. “So near and yet so Far: Harmonic Radar Reveals Reduced Homing Ability of Nosema Infected Honeybees.” <i>PLoS One</i>, vol. 9, no. 8, e103989, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0103989\">10.1371/journal.pone.0103989</a>.","short":"S. Wolf, D. Mcmahon, K. Lim, C. Pull, S. Clark, R. Paxton, J. Osborne, PLoS One 9 (2014).","ama":"Wolf S, Mcmahon D, Lim K, et al. So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. <i>PLoS One</i>. 2014;9(8). doi:<a href=\"https://doi.org/10.1371/journal.pone.0103989\">10.1371/journal.pone.0103989</a>","ieee":"S. Wolf <i>et al.</i>, “So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees,” <i>PLoS One</i>, vol. 9, no. 8. Public Library of Science, 2014.","apa":"Wolf, S., Mcmahon, D., Lim, K., Pull, C., Clark, S., Paxton, R., &#38; Osborne, J. (2014). So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0103989\">https://doi.org/10.1371/journal.pone.0103989</a>","ista":"Wolf S, Mcmahon D, Lim K, Pull C, Clark S, Paxton R, Osborne J. 2014. So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. PLoS One. 9(8), e103989."},"publication_status":"published","_id":"2086","date_published":"2014-08-06T00:00:00Z","title":"So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees","file":[{"file_name":"IST-2016-437-v1+1_journal.pone.0103989.pdf","date_created":"2018-12-12T10:13:55Z","content_type":"application/pdf","checksum":"2fc62c6739eada4bddf026afbae669db","date_updated":"2020-07-14T12:45:28Z","relation":"main_file","access_level":"open_access","creator":"system","file_id":"5042","file_size":1013386}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"SyCr"}],"publisher":"Public Library of Science"},{"publication":"Journal of the ACM","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1145/2597631","volume":61,"oa":1,"quality_controlled":"1","oa_version":"Submitted Version","related_material":{"record":[{"relation":"earlier_version","id":"3165","status":"public"}]},"scopus_import":"1","day":"01","publist_id":"4883","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","month":"05","year":"2014","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"KrCh"}],"publisher":"ACM","date_created":"2018-12-11T11:55:57Z","publication_status":"published","citation":{"ieee":"K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” <i>Journal of the ACM</i>, vol. 61, no. 3. ACM, 2014.","ama":"Chatterjee K, Henzinger MH. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. <i>Journal of the ACM</i>. 2014;61(3). doi:<a href=\"https://doi.org/10.1145/2597631\">10.1145/2597631</a>","apa":"Chatterjee, K., &#38; Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2597631\">https://doi.org/10.1145/2597631</a>","mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” <i>Journal of the ACM</i>, vol. 61, no. 3, a15, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2597631\">10.1145/2597631</a>.","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” <i>Journal of the ACM</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2597631\">https://doi.org/10.1145/2597631</a>.","short":"K. Chatterjee, M.H. Henzinger, Journal of the ACM 61 (2014).","ista":"Chatterjee K, Henzinger MH. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), a15."},"title":"Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition","ec_funded":1,"date_published":"2014-05-01T00:00:00Z","_id":"2141","abstract":[{"text":"The computation of the winning set for Büchi objectives in alternating games on graphs is a central problem in computer-aided verification with a large number of applications. The long-standing best known upper bound for solving the problem is Õ(n ⋅ m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the Õ(n ⋅ m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2)-time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of Õ(n ⋅ m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m&gt;n4/3 an earlier bound of O(m ⋅ √m)). We then show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. Our algorithms are the first dynamic algorithms for this problem. We then consider another core graph theoretic problem in verification of probabilistic systems, namely computing the maximal end-component decomposition of a graph. We present two improved static algorithms for the maximal end-component decomposition problem. Our first algorithm is an O(m ⋅ √m)-time algorithm, and our second algorithm is an O(n2)-time algorithm which is obtained using the same technique as for alternating Büchi games. Thus, we obtain an O(min &amp;lcu;m ⋅ √m,n2})-time algorithm improving the long-standing O(n ⋅ m) time bound. Finally, we show how to maintain the maximal end-component decomposition of a graph under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per edge deletion, and O(m) worst-case time per edge insertion. Again, our algorithms are the first dynamic algorithms for this problem.","lang":"eng"}],"article_number":"a15","date_updated":"2025-06-02T08:53:48Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"main_file_link":[{"url":"https://eprints.cs.univie.ac.at/3933/","open_access":"1"}],"issue":"3","intvolume":"        61","type":"journal_article"},{"date_created":"2018-12-11T11:56:01Z","citation":{"ista":"Bauer U, Lesnick M. 2014. Induced matchings of barcodes and the algebraic stability of persistence. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 355–364.","mla":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 355–64, doi:<a href=\"https://doi.org/10.1145/2582112.2582168\">10.1145/2582112.2582168</a>.","chicago":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 355–64. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582168\">https://doi.org/10.1145/2582112.2582168</a>.","short":"U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–364.","ieee":"U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic stability of persistence,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 355–364.","ama":"Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability of persistence. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:355-364. doi:<a href=\"https://doi.org/10.1145/2582112.2582168\">10.1145/2582112.2582168</a>","apa":"Bauer, U., &#38; Lesnick, M. (2014). Induced matchings of barcodes and the algebraic stability of persistence. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 355–364). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582168\">https://doi.org/10.1145/2582112.2582168</a>"},"publication_status":"published","_id":"2153","date_published":"2014-06-01T00:00:00Z","ec_funded":1,"title":"Induced matchings of barcodes and the algebraic stability of persistence","oa":1,"publication":"Proceedings of the Annual Symposium on Computational Geometry","project":[{"grant_number":"318493","call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"HeEd"}],"publisher":"ACM","doi":"10.1145/2582112.2582168","publist_id":"4853","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","status":"public","language":[{"iso":"eng"}],"year":"2014","type":"conference","month":"06","date_updated":"2021-01-12T06:55:38Z","abstract":[{"lang":"eng","text":"We define a simple, explicit map sending a morphism f : M → N of pointwise finite dimensional persistence modules to a matching between the barcodes of M and N. Our main result is that, in a precise sense, the quality of this matching is tightly controlled by the lengths of the longest intervals in the barcodes of ker f and coker f . As an immediate corollary, we obtain a new proof of the algebraic stability theorem for persistence barcodes [5, 9], a fundamental result in the theory of persistent homology. In contrast to previous proofs, ours shows explicitly how a δ-interleaving morphism between two persistence modules induces a δ-matching between the barcodes of the two modules. Our main result also specializes to a structure theorem for submodules and quotients of persistence modules. Copyright is held by the owner/author(s)."}],"quality_controlled":"1","page":"355 - 364","conference":{"end_date":"2014-06-11","start_date":"2014-06-08","location":"Kyoto, Japan","name":"SoCG: Symposium on Computational Geometry"},"scopus_import":1,"oa_version":"Submitted Version","author":[{"full_name":"Bauer, Ulrich","first_name":"Ulrich","orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer"},{"last_name":"Lesnick","full_name":"Lesnick, Michael","first_name":"Michael"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1311.3681"}]},{"_id":"2154","date_published":"2014-07-01T00:00:00Z","title":"On Gromov's method of selecting heavily covered points","date_created":"2018-12-11T11:56:01Z","citation":{"ista":"Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered points. Discrete &#38; Computational Geometry. 52(1), 1–33.","ieee":"J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered points,” <i>Discrete &#38; Computational Geometry</i>, vol. 52, no. 1. Springer, pp. 1–33, 2014.","ama":"Matoušek J, Wagner U. On Gromov’s method of selecting heavily covered points. <i>Discrete &#38; Computational Geometry</i>. 2014;52(1):1-33. doi:<a href=\"https://doi.org/10.1007/s00454-014-9584-7\">10.1007/s00454-014-9584-7</a>","apa":"Matoušek, J., &#38; Wagner, U. (2014). On Gromov’s method of selecting heavily covered points. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-014-9584-7\">https://doi.org/10.1007/s00454-014-9584-7</a>","mla":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” <i>Discrete &#38; Computational Geometry</i>, vol. 52, no. 1, Springer, 2014, pp. 1–33, doi:<a href=\"https://doi.org/10.1007/s00454-014-9584-7\">10.1007/s00454-014-9584-7</a>.","chicago":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00454-014-9584-7\">https://doi.org/10.1007/s00454-014-9584-7</a>.","short":"J. Matoušek, U. Wagner, Discrete &#38; Computational Geometry 52 (2014) 1–33."},"publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Springer","intvolume":"        52","type":"journal_article","issue":"1","main_file_link":[{"url":"http://arxiv.org/abs/1102.3515","open_access":"1"}],"author":[{"full_name":"Matoušek, Jiří","first_name":"Jiří","last_name":"Matoušek"},{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","first_name":"Uli"}],"acknowledgement":"Swiss National Science Foundation (SNF 200021-125309, 200020-138230, 200020-12507)","date_updated":"2021-01-12T06:55:38Z","abstract":[{"text":"A result of Boros and Füredi (d = 2) and of Bárány (arbitrary d) asserts that for every d there exists cd &gt; 0 such that for every n-point set P ⊂ ℝd, some point of ℝd is covered by at least (Formula presented.) of the d-simplices spanned by the points of P. The largest possible value of cd has been the subject of ongoing research. Recently Gromov improved the existing lower bounds considerably by introducing a new, topological proof method. We provide an exposition of the combinatorial component of Gromov's approach, in terms accessible to combinatorialists and discrete geometers, and we investigate the limits of his method. In particular, we give tighter bounds on the cofilling profiles for the (n - 1)-simplex. These bounds yield a minor improvement over Gromov's lower bounds on cd for large d, but they also show that the room for further improvement through the cofilling profiles alone is quite small. We also prove a slightly better lower bound for c3 by an approach using an additional structure besides the cofilling profiles. We formulate a combinatorial extremal problem whose solution might perhaps lead to a tight lower bound for cd.","lang":"eng"}],"page":"1 - 33","volume":52,"oa":1,"project":[{"_id":"25FA3206-B435-11E9-9278-68D0E5697425","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","grant_number":"PP00P2_138948"}],"doi":"10.1007/s00454-014-9584-7","publication":"Discrete & Computational Geometry","language":[{"iso":"eng"}],"year":"2014","status":"public","month":"07","publist_id":"4852","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","scopus_import":1,"oa_version":"Submitted Version","quality_controlled":"1"},{"oa":1,"publication":"Proceedings of the Annual Symposium on Computational Geometry","doi":"10.1145/2582112.2582167","project":[{"name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","call_identifier":"FP7"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"4851","day":"01","status":"public","language":[{"iso":"eng"}],"year":"2014","month":"06","quality_controlled":"1","scopus_import":1,"oa_version":"Submitted Version","publication_status":"published","citation":{"chicago":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 484–90. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582167\">https://doi.org/10.1145/2582112.2582167</a>.","mla":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 484–90, doi:<a href=\"https://doi.org/10.1145/2582112.2582167\">10.1145/2582112.2582167</a>.","short":"U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–490.","ama":"Bauer U, Edelsbrunner H. The morse theory of Čech and Delaunay filtrations. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:484-490. doi:<a href=\"https://doi.org/10.1145/2582112.2582167\">10.1145/2582112.2582167</a>","ieee":"U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 484–490.","apa":"Bauer, U., &#38; Edelsbrunner, H. (2014). The morse theory of Čech and Delaunay filtrations. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 484–490). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582167\">https://doi.org/10.1145/2582112.2582167</a>","ista":"Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 484–490."},"date_created":"2018-12-11T11:56:01Z","_id":"2155","date_published":"2014-06-01T00:00:00Z","title":"The morse theory of Čech and Delaunay filtrations","ec_funded":1,"publisher":"ACM","department":[{"_id":"HeEd"}],"type":"conference","date_updated":"2021-01-12T06:55:38Z","conference":{"name":"SoCG: Symposium on Computational Geometry","location":"Kyoto, Japan","end_date":"2014-06-11","start_date":"2014-06-08"},"page":"484 - 490","abstract":[{"lang":"eng","text":"Given a finite set of points in Rn and a positive radius, we study the Čech, Delaunay-Čech, alpha, and wrap complexes as instances of a generalized discrete Morse theory. We prove that the latter three complexes are simple-homotopy equivalent. Our results have applications in topological data analysis and in the reconstruction of shapes from sampled data. Copyright is held by the owner/author(s)."}],"acknowledgement":"This research is partially supported by ESF under the ACAT Research Network Programme, and by the Russian Government under mega project 11.G34.31.0053","author":[{"last_name":"Bauer","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9683-0724","first_name":"Ulrich","full_name":"Bauer, Ulrich"},{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"}],"main_file_link":[{"url":"http://arxiv.org/abs/1312.1231","open_access":"1"}]},{"year":"2014","language":[{"iso":"eng"}],"status":"public","month":"06","publist_id":"4850","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","scopus_import":1,"oa_version":"Submitted Version","quality_controlled":"1","oa":1,"project":[{"name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","call_identifier":"FP7"}],"doi":"10.1145/2582112.2582169","publication":"Proceedings of the Annual Symposium on Computational Geometry","type":"conference","main_file_link":[{"url":"http://arxiv.org/abs/1307.2839","open_access":"1"}],"acknowledgement":"National Science Foundation under grants CCF-1319406, CCF-1116258.","author":[{"last_name":"Bauer","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","first_name":"Ulrich","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724"},{"first_name":"Xiaoyin","full_name":"Ge, Xiaoyin","last_name":"Ge"},{"last_name":"Wang","full_name":"Wang, Yusu","first_name":"Yusu"}],"date_updated":"2021-01-12T06:55:39Z","abstract":[{"lang":"eng","text":"We propose a metric for Reeb graphs, called the functional distortion distance. Under this distance, the Reeb graph is stable against small changes of input functions. At the same time, it remains discriminative at differentiating input functions. In particular, the main result is that the functional distortion distance between two Reeb graphs is bounded from below by the bottleneck distance between both the ordinary and extended persistence diagrams for appropriate dimensions. As an application of our results, we analyze a natural simplification scheme for Reeb graphs, and show that persistent features in Reeb graph remains persistent under simplification. Understanding the stability of important features of the Reeb graph under simplification is an interesting problem on its own right, and critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s)."}],"page":"464 - 473","conference":{"name":"SoCG: Symposium on Computational Geometry","location":"Kyoto, Japan","end_date":"2014-06-11","start_date":"2014-06-08"},"date_published":"2014-06-01T00:00:00Z","_id":"2156","title":"Measuring distance between Reeb graphs","ec_funded":1,"date_created":"2018-12-11T11:56:02Z","citation":{"short":"U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–473.","mla":"Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 464–73, doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>.","chicago":"Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb Graphs.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 464–73. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>.","apa":"Bauer, U., Ge, X., &#38; Wang, Y. (2014). Measuring distance between Reeb graphs. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 464–473). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>","ama":"Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:464-473. doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>","ieee":"U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 464–473.","ista":"Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 464–473."},"publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"ACM"},{"publication":"Proceedings of the Annual Symposium on Computational Geometry","department":[{"_id":"UlWa"}],"publisher":"ACM","doi":"10.1145/2582112.2582137","date_created":"2018-12-11T11:56:02Z","publication_status":"published","citation":{"apa":"Matoušek, J., Sedgwick, E., Tancer, M., &#38; Wagner, U. (2014). Embeddability in the 3 sphere is decidable. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 78–84). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582137\">https://doi.org/10.1145/2582112.2582137</a>","ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3 sphere is decidable,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 78–84.","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Embeddability in the 3 sphere is decidable. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:78-84. doi:<a href=\"https://doi.org/10.1145/2582112.2582137\">10.1145/2582112.2582137</a>","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 78–84.","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability in the 3 Sphere Is Decidable.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 78–84. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582137\">https://doi.org/10.1145/2582112.2582137</a>.","mla":"Matoušek, Jiří, et al. “Embeddability in the 3 Sphere Is Decidable.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 78–84, doi:<a href=\"https://doi.org/10.1145/2582112.2582137\">10.1145/2582112.2582137</a>.","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2014. Embeddability in the 3 sphere is decidable. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 78–84."},"date_published":"2014-06-01T00:00:00Z","_id":"2157","title":"Embeddability in the 3 sphere is decidable","oa":1,"date_updated":"2023-09-11T13:38:49Z","page":"78 - 84","abstract":[{"lang":"eng","text":"We show that the following algorithmic problem is decidable: given a 2-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in ℝ3? By a known reduction, it suffices to decide the embeddability of a given triangulated 3-manifold X into the 3-sphere S3. The main step, which allows us to simplify X and recurse, is in proving that if X can be embedded in S3, then there is also an embedding in which X has a short meridian, i.e., an essential curve in the boundary of X bounding a disk in S3 nX with length bounded by a computable function of the number of tetrahedra of X."}],"quality_controlled":"1","conference":{"start_date":"2014-06-08","end_date":"2014-06-11","location":"Kyoto, Japan","name":"SoCG: Symposium on Computational Geometry"},"related_material":{"record":[{"relation":"later_version","status":"public","id":"425"}]},"scopus_import":1,"author":[{"last_name":"Matoušek","full_name":"Matoušek, Jiří","first_name":"Jiří"},{"last_name":"Sedgwick","full_name":"Sedgwick, Eric","first_name":"Eric"},{"orcid":"0000-0002-1191-6714","full_name":"Tancer, Martin","first_name":"Martin","last_name":"Tancer","id":"38AC689C-F248-11E8-B48F-1D18A9856A87"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","full_name":"Wagner, Uli","first_name":"Uli","orcid":"0000-0002-1494-0568"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.0815"}],"oa_version":"Submitted Version","acknowledgement":"ERC Advanced Grant No. 267165; Grant GRADR Eurogiga GIG/11/E023  (SNSF-PP00P2-138948); Swiss National Science Foundation  (SNSF-200020-138230).","publist_id":"4849","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","type":"conference","year":"2014","language":[{"iso":"eng"}],"status":"public","month":"06"},{"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4177954/"}],"acknowledgement":"This effort was supported by the Intramural Research Program of the Center for Cancer Research, NCI, National Institutes of Health and the European Research Council (ERC).","author":[{"last_name":"Majumdar","full_name":"Majumdar, Ritankar","first_name":"Ritankar"},{"full_name":"Sixt, Michael K","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt"},{"first_name":"Carole","full_name":"Parent, Carole","last_name":"Parent"}],"issue":"1","page":"33 - 40","abstract":[{"text":"Directional guidance of migrating cells is relatively well explored in the reductionist setting of cell culture experiments. Here spatial gradients of chemical cues as well as gradients of mechanical substrate characteristics prove sufficient to attract single cells as well as their collectives. How such gradients present and act in the context of an organism is far less clear. Here we review recent advances in understanding how guidance cues emerge and operate in the physiological context.","lang":"eng"}],"date_updated":"2021-01-12T06:55:40Z","type":"journal_article","intvolume":"        30","department":[{"_id":"MiSi"}],"publisher":"Elsevier","title":"New paradigms in the establishment and maintenance of gradients during directed cell migration","_id":"2158","date_published":"2014-10-01T00:00:00Z","date_created":"2018-12-11T11:56:03Z","citation":{"mla":"Majumdar, Ritankar, et al. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” <i>Current Opinion in Cell Biology</i>, vol. 30, no. 1, Elsevier, 2014, pp. 33–40, doi:<a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">10.1016/j.ceb.2014.05.010</a>.","chicago":"Majumdar, Ritankar, Michael K Sixt, and Carole Parent. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">https://doi.org/10.1016/j.ceb.2014.05.010</a>.","short":"R. Majumdar, M.K. Sixt, C. Parent, Current Opinion in Cell Biology 30 (2014) 33–40.","ama":"Majumdar R, Sixt MK, Parent C. New paradigms in the establishment and maintenance of gradients during directed cell migration. <i>Current Opinion in Cell Biology</i>. 2014;30(1):33-40. doi:<a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">10.1016/j.ceb.2014.05.010</a>","ieee":"R. Majumdar, M. K. Sixt, and C. Parent, “New paradigms in the establishment and maintenance of gradients during directed cell migration,” <i>Current Opinion in Cell Biology</i>, vol. 30, no. 1. Elsevier, pp. 33–40, 2014.","apa":"Majumdar, R., Sixt, M. K., &#38; Parent, C. (2014). New paradigms in the establishment and maintenance of gradients during directed cell migration. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">https://doi.org/10.1016/j.ceb.2014.05.010</a>","ista":"Majumdar R, Sixt MK, Parent C. 2014. New paradigms in the establishment and maintenance of gradients during directed cell migration. Current Opinion in Cell Biology. 30(1), 33–40."},"publication_status":"published","oa_version":"Submitted Version","scopus_import":1,"quality_controlled":"1","external_id":{"pmid":["24959970"]},"month":"10","status":"public","year":"2014","language":[{"iso":"eng"}],"pmid":1,"day":"01","publist_id":"4848","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","doi":"10.1016/j.ceb.2014.05.010","publication":"Current Opinion in Cell Biology","volume":30,"oa":1},{"date_published":"2014-06-08T00:00:00Z","_id":"2159","title":"Eliminating Tverberg points, I. An analogue of the Whitney trick","date_created":"2018-12-11T11:56:03Z","publication_status":"published","citation":{"ista":"Mabillard I, Wagner U. 2014. Eliminating Tverberg points, I. An analogue of the Whitney trick. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 171–180.","apa":"Mabillard, I., &#38; Wagner, U. (2014). Eliminating Tverberg points, I. An analogue of the Whitney trick. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 171–180). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582134\">https://doi.org/10.1145/2582112.2582134</a>","ieee":"I. Mabillard and U. Wagner, “Eliminating Tverberg points, I. An analogue of the Whitney trick,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 171–180.","ama":"Mabillard I, Wagner U. Eliminating Tverberg points, I. An analogue of the Whitney trick. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:171-180. doi:<a href=\"https://doi.org/10.1145/2582112.2582134\">10.1145/2582112.2582134</a>","short":"I. Mabillard, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 171–180.","mla":"Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 171–80, doi:<a href=\"https://doi.org/10.1145/2582112.2582134\">10.1145/2582112.2582134</a>.","chicago":"Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 171–80. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582134\">https://doi.org/10.1145/2582112.2582134</a>."},"department":[{"_id":"UlWa"}],"publisher":"ACM","file":[{"checksum":"2aae223fee8ffeaf57bbabd8d92b6a2c","date_updated":"2020-07-14T12:45:30Z","access_level":"open_access","relation":"main_file","file_id":"4735","file_size":914396,"creator":"system","file_name":"IST-2016-534-v1+1_Eliminating_Tverberg_points_I._An_analogue_of_the_Whitney_trick.pdf","date_created":"2018-12-12T10:09:12Z","content_type":"application/pdf"}],"type":"conference","ddc":["510"],"file_date_updated":"2020-07-14T12:45:30Z","author":[{"last_name":"Mabillard","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","full_name":"Mabillard, Isaac","first_name":"Isaac"},{"first_name":"Uli","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"Swiss National Science Foundation (Project SNSF-PP00P2-138948)","date_updated":"2023-09-07T11:56:27Z","abstract":[{"text":"Motivated by topological Tverberg-type problems, we consider multiple (double, triple, and higher multiplicity) selfintersection points of maps from finite simplicial complexes (compact polyhedra) into ℝd and study conditions under which such multiple points can be eliminated. The most classical case is that of embeddings (i.e., maps without double points) of a κ-dimensional complex K into ℝ2κ. For this problem, the work of van Kampen, Shapiro, and Wu provides an efficiently testable necessary condition for embeddability (namely, vanishing of the van Kampen ob-struction). For κ ≥ 3, the condition is also sufficient, and yields a polynomial-time algorithm for deciding embeddability: One starts with an arbitrary map f : K→ℝ2κ, which generically has finitely many double points; if k ≥ 3 and if the obstruction vanishes then one can successively remove these double points by local modifications of the map f. One of the main tools is the famous Whitney trick that permits eliminating pairs of double points of opposite intersection sign. We are interested in generalizing this approach to intersection points of higher multiplicity. We call a point y 2 ℝd an r-fold Tverberg point of a map f : Kκ →ℝd if y lies in the intersection f(σ1)∩. ∩f(σr) of the images of r pairwise disjoint simplices of K. The analogue of (non-)embeddability that we study is the problem Tverbergκ r→d: Given a κ-dimensional complex K, does it satisfy a Tverberg-type theorem with parameters r and d, i.e., does every map f : K κ → ℝd have an r-fold Tverberg point? Here, we show that for fixed r, κ and d of the form d = rm and k = (r-1)m, m ≥ 3, there is a polynomial-time algorithm for deciding this (based on the vanishing of a cohomological obstruction, as in the case of embeddings). Our main tool is an r-fold analogue of the Whitney trick: Given r pairwise disjoint simplices of K such that the intersection of their images contains two r-fold Tverberg points y+ and y- of opposite intersection sign, we can eliminate y+ and y- by a local isotopy of f. In a subsequent paper, we plan to develop this further and present a generalization of the classical Haeiger-Weber Theorem (which yields a necessary and sufficient condition for embeddability of κ-complexes into ℝd for a wider range of dimensions) to intersection points of higher multiplicity.","lang":"eng"}],"page":"171 - 180","conference":{"end_date":"2014-06-11","start_date":"2014-06-08","location":"Kyoto, Japan","name":"SoCG: Symposium on Computational Geometry"},"oa":1,"doi":"10.1145/2582112.2582134","publication":"Proceedings of the Annual Symposium on Computational Geometry","year":"2014","language":[{"iso":"eng"}],"status":"public","month":"06","publist_id":"4847","pubrep_id":"534","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"08","related_material":{"record":[{"status":"public","id":"1123","relation":"dissertation_contains"}]},"scopus_import":1,"oa_version":"Submitted Version","has_accepted_license":"1","quality_controlled":"1"},{"date_published":"2014-05-10T00:00:00Z","_id":"2160","volume":32,"title":"A PAC-Bayesian bound for Lifelong Learning","oa":1,"date_created":"2018-12-11T11:56:03Z","citation":{"ista":"Pentina A, Lampert C. 2014. A PAC-Bayesian bound for Lifelong Learning. ICML: International Conference on Machine Learning vol. 32, 991–999.","ama":"Pentina A, Lampert C. A PAC-Bayesian bound for Lifelong Learning. In: Vol 32. ML Research Press; 2014:991-999.","ieee":"A. Pentina and C. Lampert, “A PAC-Bayesian bound for Lifelong Learning,” presented at the ICML: International Conference on Machine Learning, Beijing, China, 2014, vol. 32, pp. 991–999.","apa":"Pentina, A., &#38; Lampert, C. (2014). A PAC-Bayesian bound for Lifelong Learning (Vol. 32, pp. 991–999). Presented at the ICML: International Conference on Machine Learning, Beijing, China: ML Research Press.","mla":"Pentina, Anastasia, and Christoph Lampert. <i>A PAC-Bayesian Bound for Lifelong Learning</i>. Vol. 32, ML Research Press, 2014, pp. 991–99.","chicago":"Pentina, Anastasia, and Christoph Lampert. “A PAC-Bayesian Bound for Lifelong Learning,” 32:991–99. ML Research Press, 2014.","short":"A. Pentina, C. Lampert, in:, ML Research Press, 2014, pp. 991–999."},"publication_status":"published","department":[{"_id":"ChLa"}],"publisher":"ML Research Press","language":[{"iso":"eng"}],"status":"public","intvolume":"        32","year":"2014","type":"conference","article_processing_charge":"No","month":"05","publist_id":"4844","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"10","scopus_import":"1","oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/citation.cfm?id=3045003"}],"author":[{"id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","last_name":"Pentina","first_name":"Anastasia","full_name":"Pentina, Anastasia"},{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"date_updated":"2023-10-17T11:54:24Z","page":"991 - 999","quality_controlled":"1","abstract":[{"text":"Transfer learning has received a lot of attention in the machine learning community over the last years, and several effective algorithms have been developed. However, relatively little is known about their theoretical properties, especially in the setting of lifelong learning, where the goal is to transfer information to tasks for which no data have been observed so far. In this work we study lifelong learning from a theoretical perspective. Our main result is a PAC-Bayesian generalization bound that offers a unified view on existing paradigms for transfer learning, such as the transfer of parameters or the transfer of low-dimensional representations. We also use the bound to derive two principled lifelong learning algorithms, and we show that these yield results comparable with existing methods.","lang":"eng"}],"conference":{"start_date":"2014-06-21","end_date":"2014-06-26","location":"Beijing, China","name":"ICML: International Conference on Machine Learning"}},{"publication":"Behavioral Ecology and Sociobiology","project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"25DC711C-B435-11E9-9278-68D0E5697425","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","call_identifier":"FP7","grant_number":"243071"},{"grant_number":"CR-118/3-1","name":"Host-Parasite Coevolution","_id":"25DAF0B2-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/s00265-014-1778-8","volume":68,"quality_controlled":"1","oa_version":"None","related_material":{"record":[{"relation":"research_data","id":"9742","status":"public"}]},"scopus_import":"1","day":"23","publist_id":"4823","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","status":"public","year":"2014","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"SyCr"}],"publisher":"Springer","date_created":"2018-12-11T11:56:03Z","publication_status":"published","citation":{"ista":"Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. 2014. Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. Behavioral Ecology and Sociobiology. 68(10), 1701–1710.","ieee":"C. Westhus, L. V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, and S. Cremer, “Increased grooming after repeated brood care provides sanitary benefits in a clonal ant,” <i>Behavioral Ecology and Sociobiology</i>, vol. 68, no. 10. Springer, pp. 1701–1710, 2014.","ama":"Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. <i>Behavioral Ecology and Sociobiology</i>. 2014;68(10):1701-1710. doi:<a href=\"https://doi.org/10.1007/s00265-014-1778-8\">10.1007/s00265-014-1778-8</a>","apa":"Westhus, C., Ugelvig, L. V., Tourdot, E., Heinze, J., Doums, C., &#38; Cremer, S. (2014). Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. <i>Behavioral Ecology and Sociobiology</i>. Springer. <a href=\"https://doi.org/10.1007/s00265-014-1778-8\">https://doi.org/10.1007/s00265-014-1778-8</a>","mla":"Westhus, Claudia, et al. “Increased Grooming after Repeated Brood Care Provides Sanitary Benefits in a Clonal Ant.” <i>Behavioral Ecology and Sociobiology</i>, vol. 68, no. 10, Springer, 2014, pp. 1701–10, doi:<a href=\"https://doi.org/10.1007/s00265-014-1778-8\">10.1007/s00265-014-1778-8</a>.","chicago":"Westhus, Claudia, Line V Ugelvig, Edouard Tourdot, Jürgen Heinze, Claudie Doums, and Sylvia Cremer. “Increased Grooming after Repeated Brood Care Provides Sanitary Benefits in a Clonal Ant.” <i>Behavioral Ecology and Sociobiology</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00265-014-1778-8\">https://doi.org/10.1007/s00265-014-1778-8</a>.","short":"C. Westhus, L.V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, S. Cremer, Behavioral Ecology and Sociobiology 68 (2014) 1701–1710."},"ec_funded":1,"title":"Increased grooming after repeated brood care provides sanitary benefits in a clonal ant","date_published":"2014-07-23T00:00:00Z","_id":"2161","article_type":"original","abstract":[{"lang":"eng","text":"Repeated pathogen exposure is a common threat in colonies of social insects, posing selection pressures on colony members to respond with improved disease-defense performance. We here tested whether experience gained by repeated tending of low-level fungus-exposed (Metarhizium robertsii) larvae may alter the performance of sanitary brood care in the clonal ant, Platythyrea punctata. We trained ants individually over nine consecutive trials to either sham-treated or fungus-exposed larvae. We then compared the larval grooming behavior of naive and trained ants and measured how effectively they removed infectious fungal conidiospores from the fungus-exposed larvae. We found that the ants changed the duration of larval grooming in response to both, larval treatment and their level of experience: (1) sham-treated larvae received longer grooming than the fungus-exposed larvae and (2) trained ants performed less self-grooming but longer larval grooming than naive ants, which was true for both, ants trained to fungus-exposed and also to sham-treated larvae. Ants that groomed the fungus-exposed larvae for longer periods removed a higher number of fungal conidiospores from the surface of the fungus-exposed larvae. As experienced ants performed longer larval grooming, they were more effective in fungal removal, thus making them better caretakers under pathogen attack of the colony. By studying this clonal ant, we can thus conclude that even in the absence of genetic variation between colony members, differences in experience levels of brood care may affect performance of sanitary brood care in social insects."}],"page":"1701 - 1710","date_updated":"2023-02-23T14:06:46Z","acknowledgement":"We thank Katrin Kellner for colony establishment and characterization, Mike Bidochka for the fungal strain, Meghan Vyleta for fungal strain characterization, Martina Klatt and Simon Tragust for help in the laboratory, Dimitri Missoh for developing the software BioLogic, and Mark Brown and Raphaël Jeanson for discussion and help with data analysis. The study was funded by the European Research Council (ERC Starting Grant to SC; Marie Curie IEF to LVU) and the German Research Foundation DFG (to SC and to JH), and CW received funding by the doctoral school Diversité du Vivant (Cotutelle project to CD and SC).\r\n","author":[{"full_name":"Westhus, Claudia","first_name":"Claudia","id":"ca9c6ca9-e8aa-11ec-a586-b9471ede0494","last_name":"Westhus"},{"last_name":"Ugelvig","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","full_name":"Ugelvig, Line V","first_name":"Line V","orcid":"0000-0003-1832-8883"},{"first_name":"Edouard","full_name":"Tourdot, Edouard","last_name":"Tourdot"},{"full_name":"Heinze, Jürgen","first_name":"Jürgen","last_name":"Heinze"},{"full_name":"Doums, Claudie","first_name":"Claudie","last_name":"Doums"},{"orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer"}],"issue":"10","publication_identifier":{"issn":["0340-5443"]},"type":"journal_article","intvolume":"        68"},{"date_updated":"2023-02-23T12:24:48Z","abstract":[{"text":"We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of ergodic games was initiated in a seminal work of Hoffman and Karp in 1966, but all basic complexity questions have remained unresolved. Our main results for ergodic games are as follows: We establish (1) an optimal exponential bound on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and represents a complexity measure of a stationary strategy); (2) the approximation problem lies in FNP; (3) the approximation problem is at least as hard as the decision problem for simple stochastic games (for which NP ∩ coNP is the long-standing best known bound). We present a variant of the strategy-iteration algorithm by Hoffman and Karp; show that both our algorithm and the classical value-iteration algorithm can approximate the value in exponential time; and identify a subclass where the value-iteration algorithm is a FPTAS. We also show that the exact value can be expressed in the existential theory of the reals, and establish square-root sum hardness for a related class of games.","lang":"eng"}],"page":"122 - 133","conference":{"start_date":"2014-07-08","end_date":"2014-07-11","name":"ICST: International Conference on Software Testing, Verification and Validation","location":"Copenhagen, Denmark"},"issue":"Part 2","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.5734"}],"type":"conference","intvolume":"      8573","department":[{"_id":"KrCh"}],"publisher":"Springer","date_created":"2018-12-11T11:56:04Z","citation":{"ista":"Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff games. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573, 122–133.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">https://doi.org/10.1007/978-3-662-43951-7_11</a>","ama":"Chatterjee K, Ibsen-Jensen R. The complexity of ergodic mean payoff games. In: Vol 8573. Springer; 2014:122-133. doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">10.1007/978-3-662-43951-7_11</a>","ieee":"K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.","short":"K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Complexity of Ergodic Mean Payoff Games</i>. Vol. 8573, no. Part 2, Springer, 2014, pp. 122–33, doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">10.1007/978-3-662-43951-7_11</a>.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">https://doi.org/10.1007/978-3-662-43951-7_11</a>."},"publication_status":"published","_id":"2162","date_published":"2014-01-01T00:00:00Z","ec_funded":1,"title":"The complexity of ergodic mean payoff games","external_id":{"arxiv":["1404.5734"]},"quality_controlled":"1","related_material":{"record":[{"relation":"earlier_version","id":"5404","status":"public"}]},"oa_version":"Preprint","publist_id":"4822","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","language":[{"iso":"eng"}],"year":"2014","status":"public","month":"01","arxiv":1,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1007/978-3-662-43951-7_11","volume":8573,"oa":1}]