[{"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publication_status":"published","abstract":[{"text":"This dissertation concerns the automatic verification of probabilistic systems and programs with arrays by statistical and logical methods. Although statistical and logical methods are different in nature, we show that they can be successfully combined for system analysis. In the first part of the dissertation we present a new statistical algorithm for the verification of probabilistic systems with respect to unbounded properties, including linear temporal logic. Our algorithm often performs faster than the previous approaches, and at the same time requires less information about the system. In addition, our method can be generalized to unbounded quantitative properties such as mean-payoff bounds. In the second part, we introduce two techniques for comparing probabilistic systems. Probabilistic systems are typically compared using the notion of equivalence, which requires the systems to have the equal probability of all behaviors. However, this notion is often too strict, since probabilities are typically only empirically estimated, and any imprecision may break the relation between processes. On the one hand, we propose to replace the Boolean notion of equivalence by a quantitative distance of similarity. For this purpose, we introduce a statistical framework for estimating distances between Markov chains based on their simulation runs, and we investigate which distances can be approximated in our framework. On the other hand, we propose to compare systems with respect to a new qualitative logic, which expresses that behaviors occur with probability one or a positive probability. This qualitative analysis is robust with respect to modeling errors and applicable to many domains. In the last part, we present a new quantifier-free logic for integer arrays, which allows us to express counting. Counting properties are prevalent in array-manipulating programs, however they cannot be expressed in the quantified fragments of the theory of arrays. We present a decision procedure for our logic, and provide several complexity results.","lang":"eng"}],"title":"Statistical and logical methods for property checking","related_material":{"record":[{"id":"1093","relation":"part_of_dissertation","status":"public"},{"id":"1230","relation":"part_of_dissertation","status":"public"},{"id":"1234","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"1391"},{"relation":"part_of_dissertation","status":"public","id":"1501"},{"relation":"part_of_dissertation","status":"public","id":"1502"},{"id":"2063","status":"public","relation":"part_of_dissertation"},{"id":"2167","relation":"part_of_dissertation","status":"public"}]},"oa":1,"ddc":["004","005"],"_id":"1155","year":"2017","citation":{"ama":"Daca P. Statistical and logical methods for property checking. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_730\">10.15479/AT:ISTA:TH_730</a>","ieee":"P. Daca, “Statistical and logical methods for property checking,” Institute of Science and Technology Austria, 2017.","ista":"Daca P. 2017. Statistical and logical methods for property checking. Institute of Science and Technology Austria.","short":"P. Daca, Statistical and Logical Methods for Property Checking, Institute of Science and Technology Austria, 2017.","chicago":"Daca, Przemyslaw. “Statistical and Logical Methods for Property Checking.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_730\">https://doi.org/10.15479/AT:ISTA:TH_730</a>.","mla":"Daca, Przemyslaw. <i>Statistical and Logical Methods for Property Checking</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_730\">10.15479/AT:ISTA:TH_730</a>.","apa":"Daca, P. (2017). <i>Statistical and logical methods for property checking</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_730\">https://doi.org/10.15479/AT:ISTA:TH_730</a>"},"author":[{"id":"49351290-F248-11E8-B48F-1D18A9856A87","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw","last_name":"Daca"}],"date_created":"2018-12-11T11:50:27Z","month":"01","status":"public","publist_id":"6203","degree_awarded":"PhD","file_date_updated":"2020-07-14T12:44:34Z","publisher":"Institute of Science and Technology Austria","pubrep_id":"730","acknowledgement":" First of all, I want to thank my advisor, prof. Thomas A. Henzinger, for his guidance during my PhD program. I am grateful for the freedom I was given to pursue my research interests, and his continuous support. Working with prof. Henzinger was a truly inspiring experience and taught me what it means to be a scientist. I want to express my gratitude to my collaborators: Nikola Beneš, Krishnendu Chatterjee, Martin Chmelík, Ashutosh Gupta, Willibald Krenn, Jan Kˇretínský, Dejan Nickovic, Andrey Kupriyanov, and Tatjana Petrov. I have learned a great deal from my collaborators, and without their help this thesis would not be possible. In addition, I want to thank the members of my thesis committee: Dirk Beyer, Dejan Nickovic, and Georg Weissenbacher for their advice and reviewing this dissertation. I would especially like to acknowledge the late Helmut Veith, who was a member of my committee. I will remember Helmut for his kindness, enthusiasm, and wit, as well as for being an inspiring scientist. Finally, I would like to thank my colleagues for making my stay at IST such a pleasant experience: Guy Avni, Sergiy Bogomolov, Ventsislav Chonev, Rasmus Ibsen-Jensen, Mirco Giacobbe, Bernhard Kragl, Hui Kong, Petr Novotný, Jan Otop, Andreas Pavlogiannis, Tantjana Petrov, Arjun Radhakrishna, Jakob Ruess, Thorsten Tarrach, as well as other members of groups Henzinger and Chatterjee. ","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:TH_730","department":[{"_id":"ToHe"}],"has_accepted_license":"1","date_updated":"2023-09-07T11:58:34Z","type":"dissertation","oa_version":"Published Version","day":"02","supervisor":[{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"]},"date_published":"2017-01-02T00:00:00Z","file":[{"file_size":1028586,"content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:11:26Z","relation":"main_file","access_level":"open_access","file_name":"IST-2017-730-v1+1_Statistical_and_Logical_Methods_for_Property_Checking.pdf","checksum":"1406a681cb737508234fde34766be2c2","file_id":"4880","date_updated":"2020-07-14T12:44:34Z"}],"page":"163"},{"status":"public","month":"01","date_created":"2018-12-11T11:50:28Z","isi":1,"publist_id":"6199","intvolume":"       173","publisher":"American Society of Plant Biologists","article_type":"original","file_date_updated":"2020-07-14T12:44:36Z","volume":173,"issue":"1","abstract":[{"lang":"eng","text":"Auxin steers numerous physiological processes in plants, making the tight control of its endogenous levels and spatiotemporal distribution a necessity. This regulation is achieved by different mechanisms, including auxin biosynthesis, metabolic conversions, degradation, and transport. Here, we introduce cis-cinnamic acid (c-CA) as a novel and unique addition to a small group of endogenous molecules affecting in planta auxin concentrations. c-CA is the photo-isomerization product of the phenylpropanoid pathway intermediate trans-CA (t-CA). When grown on c-CA-containing medium, an evolutionary diverse set of plant species were shown to exhibit phenotypes characteristic for high auxin levels, including inhibition of primary root growth, induction of root hairs, and promotion of adventitious and lateral rooting. By molecular docking and receptor binding assays, we showed that c-CA itself is neither an auxin nor an anti-auxin, and auxin profiling data revealed that c-CA does not significantly interfere with auxin biosynthesis. Single cell-based auxin accumulation assays showed that c-CA, and not t-CA, is a potent inhibitor of auxin efflux. Auxin signaling reporters detected changes in spatiotemporal distribution of the auxin response along the root of c-CA-treated plants, and long-distance auxin transport assays showed no inhibition of rootward auxin transport. Overall, these results suggest that the phenotypes of c-CA-treated plants are the consequence of a local change in auxin accumulation, induced by the inhibition of auxin efflux. This work reveals a novel mechanism how plants may regulate auxin levels and adds a novel, naturally occurring molecule to the chemical toolbox for the studies of auxin homeostasis."}],"publication_status":"published","project":[{"name":"Polarity and subcellular dynamics in plants","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"_id":"1159","oa":1,"ddc":["580"],"pmid":1,"title":"Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation","publication":"Plant Physiology","year":"2017","quality_controlled":"1","author":[{"full_name":"Steenackers, Ward","last_name":"Steenackers","first_name":"Ward"},{"first_name":"Petr","last_name":"Klíma","full_name":"Klíma, Petr"},{"last_name":"Quareshy","first_name":"Mussa","full_name":"Quareshy, Mussa"},{"full_name":"Cesarino, Igor","last_name":"Cesarino","first_name":"Igor"},{"full_name":"Kumpf, Robert","last_name":"Kumpf","first_name":"Robert"},{"last_name":"Corneillie","first_name":"Sander","full_name":"Corneillie, Sander"},{"last_name":"Araújo","first_name":"Pedro","full_name":"Araújo, Pedro"},{"last_name":"Viaene","first_name":"Tom","full_name":"Viaene, Tom"},{"full_name":"Goeminne, Geert","first_name":"Geert","last_name":"Goeminne"},{"full_name":"Nowack, Moritz","first_name":"Moritz","last_name":"Nowack"},{"last_name":"Ljung","first_name":"Karin","full_name":"Ljung, Karin"},{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml"},{"first_name":"Joshua","last_name":"Blakeslee","full_name":"Blakeslee, Joshua"},{"first_name":"Ondřej","last_name":"Novák","full_name":"Novák, Ondřej"},{"first_name":"Eva","last_name":"Zažímalová","full_name":"Zažímalová, Eva"},{"first_name":"Richard","last_name":"Napier","full_name":"Napier, Richard"},{"last_name":"Boerjan","first_name":"Wout","full_name":"Boerjan, Wout"},{"first_name":"Bartel","last_name":"Vanholme","full_name":"Vanholme, Bartel"}],"citation":{"mla":"Steenackers, Ward, et al. “Cis-Cinnamic Acid Is a Novel Natural Auxin Efflux Inhibitor That Promotes Lateral Root Formation.” <i>Plant Physiology</i>, vol. 173, no. 1, American Society of Plant Biologists, 2017, pp. 552–65, doi:<a href=\"https://doi.org/10.1104/pp.16.00943\">10.1104/pp.16.00943</a>.","apa":"Steenackers, W., Klíma, P., Quareshy, M., Cesarino, I., Kumpf, R., Corneillie, S., … Vanholme, B. (2017). Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation. <i>Plant Physiology</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1104/pp.16.00943\">https://doi.org/10.1104/pp.16.00943</a>","ama":"Steenackers W, Klíma P, Quareshy M, et al. Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation. <i>Plant Physiology</i>. 2017;173(1):552-565. doi:<a href=\"https://doi.org/10.1104/pp.16.00943\">10.1104/pp.16.00943</a>","ieee":"W. Steenackers <i>et al.</i>, “Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation,” <i>Plant Physiology</i>, vol. 173, no. 1. American Society of Plant Biologists, pp. 552–565, 2017.","ista":"Steenackers W, Klíma P, Quareshy M, Cesarino I, Kumpf R, Corneillie S, Araújo P, Viaene T, Goeminne G, Nowack M, Ljung K, Friml J, Blakeslee J, Novák O, Zažímalová E, Napier R, Boerjan W, Vanholme B. 2017. Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation. Plant Physiology. 173(1), 552–565.","chicago":"Steenackers, Ward, Petr Klíma, Mussa Quareshy, Igor Cesarino, Robert Kumpf, Sander Corneillie, Pedro Araújo, et al. “Cis-Cinnamic Acid Is a Novel Natural Auxin Efflux Inhibitor That Promotes Lateral Root Formation.” <i>Plant Physiology</i>. American Society of Plant Biologists, 2017. <a href=\"https://doi.org/10.1104/pp.16.00943\">https://doi.org/10.1104/pp.16.00943</a>.","short":"W. Steenackers, P. Klíma, M. Quareshy, I. Cesarino, R. Kumpf, S. Corneillie, P. Araújo, T. Viaene, G. Goeminne, M. Nowack, K. Ljung, J. Friml, J. Blakeslee, O. Novák, E. Zažímalová, R. Napier, W. Boerjan, B. Vanholme, Plant Physiology 173 (2017) 552–565."},"scopus_import":"1","publication_identifier":{"issn":["0032-0889"]},"page":"552 - 565","file":[{"date_updated":"2020-07-14T12:44:36Z","file_id":"7040","file_name":"2016_PlantPhysi_Steenackers.pdf","checksum":"fd4d1cfe7ed70e54bb12ae3881f3fb91","access_level":"open_access","relation":"main_file","date_created":"2019-11-18T16:12:25Z","content_type":"application/pdf","creator":"dernst","file_size":4109142}],"external_id":{"isi":["000394135800041"],"pmid":["27837086"]},"date_published":"2017-01-01T00:00:00Z","has_accepted_license":"1","department":[{"_id":"JiFr"}],"doi":"10.1104/pp.16.00943","language":[{"iso":"eng"}],"ec_funded":1,"day":"01","oa_version":"Submitted Version","date_updated":"2025-05-07T11:12:30Z","type":"journal_article","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No"},{"date_published":"2017-01-06T00:00:00Z","external_id":{"isi":["000391269700001"]},"file":[{"relation":"main_file","date_created":"2018-12-12T10:10:16Z","file_size":4546835,"content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:44:36Z","file_id":"4802","checksum":"694aa70399444570825099c1a7ec91f2","file_name":"IST-2017-743-v1+1_srep40012.pdf","access_level":"open_access"}],"publication_identifier":{"issn":["20452322"]},"scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","day":"06","type":"journal_article","date_updated":"2023-09-20T11:28:49Z","oa_version":"Published Version","doi":"10.1038/srep40012","language":[{"iso":"eng"}],"department":[{"_id":"BjHo"}],"has_accepted_license":"1","volume":7,"pubrep_id":"743","publisher":"Nature Publishing Group","file_date_updated":"2020-07-14T12:44:36Z","publist_id":"6198","isi":1,"intvolume":"         7","article_number":"40012","status":"public","date_created":"2018-12-11T11:50:28Z","month":"01","author":[{"orcid":"0000-0001-5964-0203","full_name":"Altmeyer, Sebastian","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87","last_name":"Altmeyer","first_name":"Sebastian"},{"last_name":"Do","first_name":"Younghae","full_name":"Do, Younghae"},{"full_name":"Lai, Ying","first_name":"Ying","last_name":"Lai"}],"quality_controlled":"1","citation":{"mla":"Altmeyer, Sebastian, et al. “Dynamics of Ferrofluidic Flow in the Taylor-Couette System with a Small Aspect Ratio.” <i>Scientific Reports</i>, vol. 7, 40012, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/srep40012\">10.1038/srep40012</a>.","apa":"Altmeyer, S., Do, Y., &#38; Lai, Y. (2017). Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/srep40012\">https://doi.org/10.1038/srep40012</a>","ista":"Altmeyer S, Do Y, Lai Y. 2017. Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio. Scientific Reports. 7, 40012.","short":"S. Altmeyer, Y. Do, Y. Lai, Scientific Reports 7 (2017).","chicago":"Altmeyer, Sebastian, Younghae Do, and Ying Lai. “Dynamics of Ferrofluidic Flow in the Taylor-Couette System with a Small Aspect Ratio.” <i>Scientific Reports</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/srep40012\">https://doi.org/10.1038/srep40012</a>.","ieee":"S. Altmeyer, Y. Do, and Y. Lai, “Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio,” <i>Scientific Reports</i>, vol. 7. Nature Publishing Group, 2017.","ama":"Altmeyer S, Do Y, Lai Y. Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio. <i>Scientific Reports</i>. 2017;7. doi:<a href=\"https://doi.org/10.1038/srep40012\">10.1038/srep40012</a>"},"year":"2017","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"},"oa":1,"ddc":["532"],"_id":"1160","title":"Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio","publication":"Scientific Reports","publication_status":"published","abstract":[{"text":"We investigate fundamental nonlinear dynamics of ferrofluidic Taylor-Couette flow - flow confined be-tween two concentric independently rotating cylinders - consider small aspect ratio by solving the ferro-hydrodynamical equations, carrying out systematic bifurcation analysis. Without magnetic field, we find steady flow patterns, previously observed with a simple fluid, such as those containing normal one- or two vortex cells, as well as anomalous one-cell and twin-cell flow states. However, when a symmetry-breaking transverse magnetic field is present, all flow states exhibit stimulated, finite two-fold mode. Various bifurcations between steady and unsteady states can occur, corresponding to the transitions between the two-cell and one-cell states. While unsteady, axially oscillating flow states can arise, we also detect the emergence of new unsteady flow states. In particular, we uncover two new states: one contains only the azimuthally oscillating solution in the configuration of the twin-cell flow state, and an-other a rotating flow state. Topologically, these flow states are a limit cycle and a quasiperiodic solution on a two-torus, respectively. Emergence of new flow states in addition to observed ones with classical fluid, indicates that richer but potentially more controllable dynamics in ferrofluidic flows, as such flow states depend on the external magnetic field.","lang":"eng"}]},{"intvolume":"        27","publist_id":"6197","isi":1,"date_created":"2018-12-11T11:50:29Z","month":"01","status":"public","issue":"1","volume":27,"publisher":"Cell Press","publication":"Current Biology","title":"Cell migration: Making the waves","_id":"1161","publication_status":"published","abstract":[{"text":"Coordinated changes of cell shape are often the result of the excitable, wave-like dynamics of the actin cytoskeleton. New work shows that, in migrating cells, protrusion waves arise from mechanochemical crosstalk between adhesion sites, membrane tension and the actin protrusive machinery.","lang":"eng"}],"citation":{"mla":"Müller, Jan, and Michael K. Sixt. “Cell Migration: Making the Waves.” <i>Current Biology</i>, vol. 27, no. 1, Cell Press, 2017, pp. R24–25, doi:<a href=\"https://doi.org/10.1016/j.cub.2016.11.035\">10.1016/j.cub.2016.11.035</a>.","apa":"Müller, J., &#38; Sixt, M. K. (2017). Cell migration: Making the waves. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2016.11.035\">https://doi.org/10.1016/j.cub.2016.11.035</a>","ama":"Müller J, Sixt MK. Cell migration: Making the waves. <i>Current Biology</i>. 2017;27(1):R24-R25. doi:<a href=\"https://doi.org/10.1016/j.cub.2016.11.035\">10.1016/j.cub.2016.11.035</a>","ieee":"J. Müller and M. K. Sixt, “Cell migration: Making the waves,” <i>Current Biology</i>, vol. 27, no. 1. Cell Press, pp. R24–R25, 2017.","short":"J. Müller, M.K. Sixt, Current Biology 27 (2017) R24–R25.","chicago":"Müller, Jan, and Michael K Sixt. “Cell Migration: Making the Waves.” <i>Current Biology</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.cub.2016.11.035\">https://doi.org/10.1016/j.cub.2016.11.035</a>.","ista":"Müller J, Sixt MK. 2017. Cell migration: Making the waves. Current Biology. 27(1), R24–R25."},"author":[{"first_name":"Jan","last_name":"Müller","full_name":"Müller, Jan","id":"AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D"},{"last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179"}],"quality_controlled":"1","year":"2017","publication_identifier":{"issn":["09609822"]},"scopus_import":"1","date_published":"2017-01-09T00:00:00Z","external_id":{"isi":["000391902500010"]},"page":"R24 - R25","language":[{"iso":"eng"}],"doi":"10.1016/j.cub.2016.11.035","department":[{"_id":"MiSi"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"journal_article","date_updated":"2023-09-20T11:28:19Z","oa_version":"None","day":"09"},{"ec_funded":1,"doi":"10.1103/PhysRevB.95.024506","language":[{"iso":"eng"}],"department":[{"_id":"MiLe"}],"date_updated":"2023-09-20T11:25:56Z","type":"journal_article","oa_version":"Submitted Version","day":"13","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"issn":["24699950"]},"scopus_import":"1","date_published":"2017-01-13T00:00:00Z","external_id":{"isi":["000391852800006"]},"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"publication_status":"published","abstract":[{"lang":"eng","text":"Selected universal experimental properties of high-temperature superconducting (HTS) cuprates have been singled out in the last decade. One of the pivotal challenges in this field is the designation of a consistent interpretation framework within which we can describe quantitatively the universal features of those systems. Here we analyze in a detailed manner the principal experimental data and compare them quantitatively with the approach based on a single-band model of strongly correlated electrons supplemented with strong antiferromagnetic (super)exchange interaction (the so-called t−J−U model). The model rationale is provided by estimating its microscopic parameters on the basis of the three-band approach for the Cu-O plane. We use our original full Gutzwiller wave-function solution by going beyond the renormalized mean-field theory (RMFT) in a systematic manner. Our approach reproduces very well the observed hole doping (δ) dependence of the kinetic-energy gain in the superconducting phase, one of the principal non-Bardeen-Cooper-Schrieffer features of the cuprates. The calculated Fermi velocity in the nodal direction is practically δ-independent and its universal value agrees very well with that determined experimentally. Also, a weak doping dependence of the Fermi wave vector leads to an almost constant value of the effective mass in a pure superconducting phase which is both observed in experiment and reproduced within our approach. An assessment of the currently used models (t−J, Hubbard) is carried out and the results of the canonical RMFT as a zeroth-order solution are provided for comparison to illustrate the necessity of the introduced higher-order contributions."}],"title":"Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment","publication":"Physical Review B - Condensed Matter and Materials Physics","oa":1,"_id":"1162","year":"2017","citation":{"mla":"Spałek, Jozef, et al. “Universal Properties of High Temperature Superconductors from Real Space Pairing T-J-U Model and Its Quantitative Comparison with Experiment.” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 95, no. 2, 024506, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevB.95.024506\">10.1103/PhysRevB.95.024506</a>.","apa":"Spałek, J., Zegrodnik, M., &#38; Kaczmarczyk, J. (2017). Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment. <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.95.024506\">https://doi.org/10.1103/PhysRevB.95.024506</a>","ista":"Spałek J, Zegrodnik M, Kaczmarczyk J. 2017. Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment. Physical Review B - Condensed Matter and Materials Physics. 95(2), 024506.","chicago":"Spałek, Jozef, Michał Zegrodnik, and Jan Kaczmarczyk. “Universal Properties of High Temperature Superconductors from Real Space Pairing T-J-U Model and Its Quantitative Comparison with Experiment.” <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevB.95.024506\">https://doi.org/10.1103/PhysRevB.95.024506</a>.","short":"J. Spałek, M. Zegrodnik, J. Kaczmarczyk, Physical Review B - Condensed Matter and Materials Physics 95 (2017).","ieee":"J. Spałek, M. Zegrodnik, and J. Kaczmarczyk, “Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment,” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 95, no. 2. American Physical Society, 2017.","ama":"Spałek J, Zegrodnik M, Kaczmarczyk J. Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment. <i>Physical Review B - Condensed Matter and Materials Physics</i>. 2017;95(2). doi:<a href=\"https://doi.org/10.1103/PhysRevB.95.024506\">10.1103/PhysRevB.95.024506</a>"},"main_file_link":[{"url":"https://arxiv.org/abs/1606.03247","open_access":"1"}],"quality_controlled":"1","author":[{"first_name":"Jozef","last_name":"Spałek","full_name":"Spałek, Jozef"},{"first_name":"Michał","last_name":"Zegrodnik","full_name":"Zegrodnik, Michał"},{"last_name":"Kaczmarczyk","first_name":"Jan","orcid":"0000-0002-1629-3675","full_name":"Kaczmarczyk, Jan","id":"46C405DE-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:50:29Z","month":"01","status":"public","article_number":"024506","intvolume":"        95","publist_id":"6195","isi":1,"publisher":"American Physical Society","volume":95,"issue":"2"},{"quality_controlled":"1","author":[{"first_name":"Marcin","last_name":"Wysokiński","full_name":"Wysokiński, Marcin"},{"last_name":"Kaczmarczyk","first_name":"Jan","id":"46C405DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1629-3675","full_name":"Kaczmarczyk, Jan"}],"citation":{"mla":"Wysokiński, Marcin, and Jan Kaczmarczyk. “Unconventional Superconductivity in Generalized Hubbard Model Role of Electron–Hole Symmetry Breaking Terms.” <i>Journal of Physics: Condensed Matter</i>, vol. 29, no. 8, 085604, IOP Publishing Ltd., 2017, doi:<a href=\"https://doi.org/10.1088/1361-648X/aa532f\">10.1088/1361-648X/aa532f</a>.","apa":"Wysokiński, M., &#38; Kaczmarczyk, J. (2017). Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms. <i>Journal of Physics: Condensed Matter</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/1361-648X/aa532f\">https://doi.org/10.1088/1361-648X/aa532f</a>","ama":"Wysokiński M, Kaczmarczyk J. Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms. <i>Journal of Physics: Condensed Matter</i>. 2017;29(8). doi:<a href=\"https://doi.org/10.1088/1361-648X/aa532f\">10.1088/1361-648X/aa532f</a>","ieee":"M. Wysokiński and J. Kaczmarczyk, “Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms,” <i>Journal of Physics: Condensed Matter</i>, vol. 29, no. 8. IOP Publishing Ltd., 2017.","chicago":"Wysokiński, Marcin, and Jan Kaczmarczyk. “Unconventional Superconductivity in Generalized Hubbard Model Role of Electron–Hole Symmetry Breaking Terms.” <i>Journal of Physics: Condensed Matter</i>. IOP Publishing Ltd., 2017. <a href=\"https://doi.org/10.1088/1361-648X/aa532f\">https://doi.org/10.1088/1361-648X/aa532f</a>.","short":"M. Wysokiński, J. Kaczmarczyk, Journal of Physics: Condensed Matter 29 (2017).","ista":"Wysokiński M, Kaczmarczyk J. 2017. Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms. Journal of Physics: Condensed Matter. 29(8), 085604."},"year":"2017","_id":"1163","publication":"Journal of Physics: Condensed Matter","title":"Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms","publication_status":"published","abstract":[{"text":"We investigate the effect of the electron-hole (e-h) symmetry breaking on d-wave superconductivity induced by non-local effects of correlations in the generalized Hubbard model. The symmetry breaking is introduced in a two-fold manner: by the next-to-nearest neighbor hopping of electrons and by the charge-bond interaction - the off-diagonal term of the Coulomb potential. Both terms lead to a pronounced asymmetry of the superconducting order parameter. The next-to-nearest neighbor hopping enhances superconductivity for h-doping, while diminishes it for e-doping. The charge-bond interaction alone leads to the opposite effect and, additionally, to the kinetic-energy gain upon condensation in the underdoped regime. With both terms included, with similar amplitudes, the height of the superconducting dome and the critical doping remain in favor of h-doping. The influence of the charge-bond interaction on deviations from symmetry of the shape of the gap at the Fermi surface in the momentum space is briefly discussed.","lang":"eng"}],"project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"volume":29,"issue":"8","publisher":"IOP Publishing Ltd.","publist_id":"6194","isi":1,"intvolume":"        29","status":"public","article_number":"085604","date_created":"2018-12-11T11:50:29Z","month":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","day":"16","type":"journal_article","date_updated":"2023-09-20T11:25:32Z","oa_version":"None","language":[{"iso":"eng"}],"doi":"10.1088/1361-648X/aa532f","department":[{"_id":"MiLe"}],"ec_funded":1,"date_published":"2017-01-16T00:00:00Z","external_id":{"isi":["000393955500001"]},"publication_identifier":{"issn":["09538984"]},"scopus_import":"1"},{"year":"2017","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"},"author":[{"id":"2A5F8724-F248-11E8-B48F-1D18A9856A87","full_name":"Perrone, Elisa","orcid":"0000-0003-0370-9835","last_name":"Perrone","first_name":"Elisa"},{"full_name":"Rappold, Andreas","last_name":"Rappold","first_name":"Andreas"},{"last_name":"Müller","first_name":"Werner","full_name":"Müller, Werner"}],"quality_controlled":"1","citation":{"mla":"Perrone, Elisa, et al. “D Inf s Optimality in Copula Models.” <i>Statistical Methods and Applications</i>, vol. 26, no. 3, Springer, 2017, pp. 403–18, doi:<a href=\"https://doi.org/10.1007/s10260-016-0375-6\">10.1007/s10260-016-0375-6</a>.","apa":"Perrone, E., Rappold, A., &#38; Müller, W. (2017). D inf s optimality in copula models. <i>Statistical Methods and Applications</i>. Springer. <a href=\"https://doi.org/10.1007/s10260-016-0375-6\">https://doi.org/10.1007/s10260-016-0375-6</a>","ieee":"E. Perrone, A. Rappold, and W. Müller, “D inf s optimality in copula models,” <i>Statistical Methods and Applications</i>, vol. 26, no. 3. Springer, pp. 403–418, 2017.","ama":"Perrone E, Rappold A, Müller W. D inf s optimality in copula models. <i>Statistical Methods and Applications</i>. 2017;26(3):403-418. doi:<a href=\"https://doi.org/10.1007/s10260-016-0375-6\">10.1007/s10260-016-0375-6</a>","ista":"Perrone E, Rappold A, Müller W. 2017. D inf s optimality in copula models. Statistical Methods and Applications. 26(3), 403–418.","chicago":"Perrone, Elisa, Andreas Rappold, and Werner Müller. “D Inf s Optimality in Copula Models.” <i>Statistical Methods and Applications</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s10260-016-0375-6\">https://doi.org/10.1007/s10260-016-0375-6</a>.","short":"E. Perrone, A. Rappold, W. Müller, Statistical Methods and Applications 26 (2017) 403–418."},"abstract":[{"lang":"eng","text":"Optimum experimental design theory has recently been extended for parameter estimation in copula models. The use of these models allows one to gain in flexibility by considering the model parameter set split into marginal and dependence parameters. However, this separation also leads to the natural issue of estimating only a subset of all model parameters. In this work, we treat this problem with the application of the (Formula presented.)-optimality to copula models. First, we provide an extension of the corresponding equivalence theory. Then, we analyze a wide range of flexible copula models to highlight the usefulness of (Formula presented.)-optimality in many possible scenarios. Finally, we discuss how the usage of the introduced design criterion also relates to the more general issue of copula selection and optimal design for model discrimination."}],"publication_status":"published","_id":"1168","oa":1,"ddc":["519"],"title":"D inf s optimality in copula models","publication":"Statistical Methods and Applications","publisher":"Springer","file_date_updated":"2020-07-14T12:44:37Z","pubrep_id":"739","volume":26,"issue":"3","status":"public","month":"08","date_created":"2018-12-11T11:50:31Z","isi":1,"publist_id":"6189","intvolume":"        26","day":"01","oa_version":"Submitted Version","date_updated":"2023-09-20T11:25:09Z","type":"journal_article","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","acknowledgement":"This work has been supported by the project ANR-2011-IS01-001-01 “DESIRE” and Austrian Science Fund (FWF) I833-N18. Open access funding is provided by the Austrian Science Fund (FWF). ","department":[{"_id":"CaUh"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.1007/s10260-016-0375-6","page":"403 - 418","file":[{"date_created":"2018-12-12T10:16:13Z","relation":"main_file","content_type":"application/pdf","creator":"system","file_size":56664,"file_id":"5199","date_updated":"2020-07-14T12:44:37Z","access_level":"open_access","checksum":"0b2d1b647ca96e9ef13a14b8b6775e0f","file_name":"IST-2017-739-v1+2_10260_2016_375_MOESM1_ESM.pdf"},{"creator":"system","content_type":"application/pdf","file_size":688953,"relation":"main_file","date_created":"2018-12-12T10:16:14Z","file_name":"IST-2017-739-v1+3_s10260-016-0375-6.pdf","checksum":"3321ef34e02e28acfc427f77cf32812a","access_level":"open_access","file_id":"5200","date_updated":"2020-07-14T12:44:37Z"}],"external_id":{"isi":["000407973200004"]},"date_published":"2017-08-01T00:00:00Z","scopus_import":"1"},{"publisher":"Genetics Society of America","file_date_updated":"2020-07-14T12:44:37Z","pubrep_id":"727","issue":"1","volume":205,"status":"public","month":"01","date_created":"2018-12-11T11:50:31Z","isi":1,"publist_id":"6188","intvolume":"       205","year":"2017","author":[{"first_name":"Sebastian","last_name":"Novak","orcid":"0000-0002-2519-824X","full_name":"Novak, Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Richard","last_name":"Kollár","full_name":"Kollár, Richard"}],"quality_controlled":"1","citation":{"ieee":"S. Novak and R. Kollár, “Spatial gene frequency waves under genotype dependent dispersal,” <i>Genetics</i>, vol. 205, no. 1. Genetics Society of America, pp. 367–374, 2017.","ama":"Novak S, Kollár R. Spatial gene frequency waves under genotype dependent dispersal. <i>Genetics</i>. 2017;205(1):367-374. doi:<a href=\"https://doi.org/10.1534/genetics.116.193946\">10.1534/genetics.116.193946</a>","ista":"Novak S, Kollár R. 2017. Spatial gene frequency waves under genotype dependent dispersal. Genetics. 205(1), 367–374.","short":"S. Novak, R. Kollár, Genetics 205 (2017) 367–374.","chicago":"Novak, Sebastian, and Richard Kollár. “Spatial Gene Frequency Waves under Genotype Dependent Dispersal.” <i>Genetics</i>. Genetics Society of America, 2017. <a href=\"https://doi.org/10.1534/genetics.116.193946\">https://doi.org/10.1534/genetics.116.193946</a>.","mla":"Novak, Sebastian, and Richard Kollár. “Spatial Gene Frequency Waves under Genotype Dependent Dispersal.” <i>Genetics</i>, vol. 205, no. 1, Genetics Society of America, 2017, pp. 367–74, doi:<a href=\"https://doi.org/10.1534/genetics.116.193946\">10.1534/genetics.116.193946</a>.","apa":"Novak, S., &#38; Kollár, R. (2017). Spatial gene frequency waves under genotype dependent dispersal. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.116.193946\">https://doi.org/10.1534/genetics.116.193946</a>"},"abstract":[{"text":"Dispersal is a crucial factor in natural evolution, since it determines the habitat experienced by any population and defines the spatial scale of interactions between individuals. There is compelling evidence for systematic differences in dispersal characteristics within the same population, i.e., genotype-dependent dispersal. The consequences of genotype-dependent dispersal on other evolutionary phenomena, however, are poorly understood. In this article we investigate the effect of genotype-dependent dispersal on spatial gene frequency patterns, using a generalization of the classical diffusion model of selection and dispersal. Dispersal is characterized by the variance of dispersal (diffusion coefficient) and the mean displacement (directional advection term). We demonstrate that genotype-dependent dispersal may change the qualitative behavior of Fisher waves, which change from being “pulled” to being “pushed” wave fronts as the discrepancy in dispersal between genotypes increases. The speed of any wave is partitioned into components due to selection, genotype-dependent variance of dispersal, and genotype-dependent mean displacement. We apply our findings to wave fronts maintained by selection against heterozygotes. Furthermore, we identify a benefit of increased variance of dispersal, quantify its effect on the speed of the wave, and discuss the implications for the evolution of dispersal strategies.","lang":"eng"}],"publication_status":"published","project":[{"name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","grant_number":"618091","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425"},{"_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152"}],"_id":"1169","ddc":["576"],"oa":1,"title":"Spatial gene frequency waves under genotype dependent dispersal","publication":"Genetics","page":"367 - 374","file":[{"access_level":"open_access","file_name":"IST-2016-727-v1+1_SFC_Genetics_final.pdf","checksum":"7c8ab79cda1f92760bbbbe0f53175bfc","file_id":"4833","date_updated":"2020-07-14T12:44:37Z","file_size":361500,"content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:10:43Z","relation":"main_file"}],"external_id":{"isi":["000393677300025"]},"date_published":"2017-01-01T00:00:00Z","scopus_import":"1","publication_identifier":{"issn":["00166731"]},"day":"01","oa_version":"Submitted Version","date_updated":"2025-05-28T11:42:46Z","type":"journal_article","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"NiBa"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.1534/genetics.116.193946","ec_funded":1},{"isi":1,"publist_id":"6182","intvolume":"        37","status":"public","month":"10","date_created":"2018-12-11T11:50:32Z","issue":"5","volume":37,"publisher":"Springer","_id":"1173","oa":1,"title":"The Voronoi functional is maximized by the Delaunay triangulation in the plane","publication":"Combinatorica","abstract":[{"lang":"eng","text":"We introduce the Voronoi functional of a triangulation of a finite set of points in the Euclidean plane and prove that among all geometric triangulations of the point set, the Delaunay triangulation maximizes the functional. This result neither extends to topological triangulations in the plane nor to geometric triangulations in three and higher dimensions."}],"publication_status":"published","project":[{"name":"Topological Complex Systems","grant_number":"318493","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Glazyrin, Alexey","first_name":"Alexey","last_name":"Glazyrin"},{"last_name":"Musin","first_name":"Oleg","full_name":"Musin, Oleg"},{"first_name":"Anton","last_name":"Nikitenko","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","full_name":"Nikitenko, Anton","orcid":"0000-0002-0659-3201"}],"main_file_link":[{"url":"https://arxiv.org/abs/1411.6337","open_access":"1"}],"citation":{"ama":"Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. The Voronoi functional is maximized by the Delaunay triangulation in the plane. <i>Combinatorica</i>. 2017;37(5):887-910. doi:<a href=\"https://doi.org/10.1007/s00493-016-3308-y\">10.1007/s00493-016-3308-y</a>","ieee":"H. Edelsbrunner, A. Glazyrin, O. Musin, and A. Nikitenko, “The Voronoi functional is maximized by the Delaunay triangulation in the plane,” <i>Combinatorica</i>, vol. 37, no. 5. Springer, pp. 887–910, 2017.","chicago":"Edelsbrunner, Herbert, Alexey Glazyrin, Oleg Musin, and Anton Nikitenko. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” <i>Combinatorica</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00493-016-3308-y\">https://doi.org/10.1007/s00493-016-3308-y</a>.","short":"H. Edelsbrunner, A. Glazyrin, O. Musin, A. Nikitenko, Combinatorica 37 (2017) 887–910.","ista":"Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. 2017. The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. 37(5), 887–910.","apa":"Edelsbrunner, H., Glazyrin, A., Musin, O., &#38; Nikitenko, A. (2017). The Voronoi functional is maximized by the Delaunay triangulation in the plane. <i>Combinatorica</i>. Springer. <a href=\"https://doi.org/10.1007/s00493-016-3308-y\">https://doi.org/10.1007/s00493-016-3308-y</a>","mla":"Edelsbrunner, Herbert, et al. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” <i>Combinatorica</i>, vol. 37, no. 5, Springer, 2017, pp. 887–910, doi:<a href=\"https://doi.org/10.1007/s00493-016-3308-y\">10.1007/s00493-016-3308-y</a>."},"year":"2017","scopus_import":"1","publication_identifier":{"issn":["02099683"]},"page":"887 - 910","external_id":{"isi":["000418056000005"]},"date_published":"2017-10-01T00:00:00Z","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00493-016-3308-y","ec_funded":1,"acknowledgement":"This research is partially supported by the Russian Government under the Mega Project 11.G34.31.0053, by the Toposys project FP7-ICT-318493-STREP, by ESF under the ACAT Research Network Programme, by RFBR grant 11-01-00735, and by NSF grants DMS-1101688, DMS-1400876.","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","day":"01","oa_version":"Submitted Version","type":"journal_article","date_updated":"2023-09-20T11:23:53Z"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","date_updated":"2023-09-20T11:23:15Z","type":"conference","oa_version":"Submitted Version","day":"01","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.STACS.2017.57","department":[{"_id":"KrPi"}],"date_published":"2017-03-01T00:00:00Z","external_id":{"isi":["000521077300057"]},"alternative_title":["LIPIcs"],"publication_identifier":{"issn":["18688969"]},"scopus_import":"1","citation":{"mla":"Skórski, Maciej. <i>Lower Bounds on Key Derivation for Square-Friendly Applications</i>. Vol. 66, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">10.4230/LIPIcs.STACS.2017.57</a>.","apa":"Skórski, M. (2017). Lower bounds on key derivation for square-friendly applications (Vol. 66). Presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">https://doi.org/10.4230/LIPIcs.STACS.2017.57</a>","ista":"Skórski M. 2017. Lower bounds on key derivation for square-friendly applications. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 66, 57.","chicago":"Skórski, Maciej. “Lower Bounds on Key Derivation for Square-Friendly Applications,” Vol. 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">https://doi.org/10.4230/LIPIcs.STACS.2017.57</a>.","short":"M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ieee":"M. Skórski, “Lower bounds on key derivation for square-friendly applications,” presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 2017, vol. 66.","ama":"Skórski M. Lower bounds on key derivation for square-friendly applications. In: Vol 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">10.4230/LIPIcs.STACS.2017.57</a>"},"main_file_link":[{"open_access":"1","url":"http://drops.dagstuhl.de/opus/volltexte/2017/6976"}],"quality_controlled":"1","author":[{"last_name":"Skórski","first_name":"Maciej","full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD"}],"year":"2017","title":"Lower bounds on key derivation for square-friendly applications","oa":1,"_id":"1174","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"publication_status":"published","abstract":[{"text":"Security of cryptographic applications is typically defined by security games. The adversary, within certain resources, cannot win with probability much better than 0 (for unpredictability applications, like one-way functions) or much better than 1/2 (indistinguishability applications for instance encryption schemes). In so called squared-friendly applications the winning probability of the adversary, for different values of the application secret randomness, is not only close to 0 or 1/2 on average, but also concentrated in the sense that its second central moment is small. The class of squared-friendly applications, which contains all unpredictability applications and many indistinguishability applications, is particularly important for key derivation. Barak et al. observed that for square-friendly applications one can beat the &quot;RT-bound&quot;, extracting secure keys with significantly smaller entropy loss. In turn Dodis and Yu showed that in squared-friendly applications one can directly use a &quot;weak&quot; key, which has only high entropy, as a secure key. In this paper we give sharp lower bounds on square security assuming security for &quot;weak&quot; keys. We show that any application which is either (a) secure with weak keys or (b) allows for entropy savings for keys derived by universal hashing, must be square-friendly. Quantitatively, our lower bounds match the positive results of Dodis and Yu and Barak et al. (TCC\\'13, CRYPTO\\'11) Hence, they can be understood as a general characterization of squared-friendly applications. While the positive results on squared-friendly applications where derived by one clever application of the Cauchy-Schwarz Inequality, for tight lower bounds we need more machinery. In our approach we use convex optimization techniques and some theory of circular matrices.","lang":"eng"}],"volume":66,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"        66","publist_id":"6180","isi":1,"date_created":"2018-12-11T11:50:32Z","month":"03","conference":{"name":"STACS: Symposium on Theoretical Aspects of Computer Science","end_date":"2017-03-11","location":"Hannover, Germany","start_date":"2017-03-08"},"article_number":"57","status":"public"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","date_updated":"2021-01-12T06:48:51Z","oa_version":"Published Version","day":"01","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.ITCS.2017.38","department":[{"_id":"KrPi"}],"has_accepted_license":"1","date_published":"2017-01-01T00:00:00Z","file":[{"file_name":"IST-2018-927-v1+1_LIPIcs-ITCS-2017-38.pdf","checksum":"dbc94810be07c2fb1945d5c2a6130e6c","access_level":"open_access","file_id":"5263","date_updated":"2020-07-14T12:44:37Z","content_type":"application/pdf","creator":"system","file_size":557769,"relation":"main_file","date_created":"2018-12-12T10:17:11Z"}],"page":"38:1-38-21","alternative_title":["LIPIcs"],"publication_identifier":{"issn":["18688969"]},"scopus_import":1,"citation":{"ieee":"J. F. Alwen, S. De Rezende, J. Nordstrom, and M. Vinyals, “Cumulative space in black-white pebbling and resolution,” presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States, 2017, vol. 67, p. 38:1-38-21.","ama":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. Cumulative space in black-white pebbling and resolution. In: Papadimitriou C, ed. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:38:1-38-21. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">10.4230/LIPIcs.ITCS.2017.38</a>","ista":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67, 38:1-38-21.","chicago":"Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.” edited by Christos Papadimitriou, 67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">https://doi.org/10.4230/LIPIcs.ITCS.2017.38</a>.","short":"J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.","apa":"Alwen, J. F., De Rezende, S., Nordstrom, J., &#38; Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">https://doi.org/10.4230/LIPIcs.ITCS.2017.38</a>","mla":"Alwen, Joel F., et al. <i>Cumulative Space in Black-White Pebbling and Resolution</i>. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">10.4230/LIPIcs.ITCS.2017.38</a>."},"author":[{"last_name":"Alwen","first_name":"Joel F","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"De Rezende, Susanna","last_name":"De Rezende","first_name":"Susanna"},{"full_name":"Nordstrom, Jakob","last_name":"Nordstrom","first_name":"Jakob"},{"first_name":"Marc","last_name":"Vinyals","full_name":"Vinyals, Marc"}],"quality_controlled":"1","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"},"year":"2017","title":"Cumulative space in black-white pebbling and resolution","oa":1,"ddc":["005","600"],"_id":"1175","publication_status":"published","abstract":[{"lang":"eng","text":"We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation.  Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko ’15] as a tool for obtaining results in cryptography. We consider instead the non- deterministic black-white pebble game and prove optimal cumulative space lower bounds and trade-offs, where in order to minimize pebbling time the space has to remain large during a significant fraction of the pebbling. We also initiate the study of cumulative space in proof complexity, an area where other space complexity measures have been extensively studied during the last 10–15 years. Using and extending the connection between proof complexity and pebble games in [Ben-Sasson and Nordström ’08, ’11] we obtain several strong cumulative space results for (even parallel versions of) the resolution proof system, and outline some possible future directions of study of this, in our opinion, natural and interesting space measure."}],"volume":67,"pubrep_id":"927","file_date_updated":"2020-07-14T12:44:37Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","editor":[{"first_name":"Christos","last_name":"Papadimitriou","full_name":"Papadimitriou, Christos"}],"intvolume":"        67","publist_id":"6179","date_created":"2018-12-11T11:50:33Z","conference":{"name":"ITCS: Innovations in Theoretical Computer Science","end_date":"2017-01-11","start_date":"2017-01-09","location":"Berkeley, CA, United States"},"month":"01","status":"public"},{"external_id":{"isi":["000424197300011"]},"date_published":"2017-07-03T00:00:00Z","scopus_import":"1","publication_identifier":{"isbn":["978-150905761-0"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","oa_version":"Submitted Version","type":"conference","date_updated":"2023-09-20T11:22:25Z","day":"03","department":[{"_id":"KrPi"}],"doi":"10.1109/EuroSP.2017.47","language":[{"iso":"eng"}],"publisher":"IEEE","isi":1,"publist_id":"6178","month":"07","conference":{"start_date":"2017-04-26","location":"Paris, France","end_date":"2017-04-28","name":"EuroS&P: European Symposium on Security and Privacy"},"date_created":"2018-12-11T11:50:33Z","article_number":"7961977","status":"public","citation":{"apa":"Alwen, J. F., &#38; Blocki, J. (2017). Towards practical attacks on Argon2i and balloon hashing. Presented at the EuroS&#38;P: European Symposium on Security and Privacy, Paris, France: IEEE. <a href=\"https://doi.org/10.1109/EuroSP.2017.47\">https://doi.org/10.1109/EuroSP.2017.47</a>","mla":"Alwen, Joel F., and Jeremiah Blocki. <i>Towards Practical Attacks on Argon2i and Balloon Hashing</i>. 7961977, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/EuroSP.2017.47\">10.1109/EuroSP.2017.47</a>.","ista":"Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon hashing. EuroS&#38;P: European Symposium on Security and Privacy, 7961977.","chicago":"Alwen, Joel F, and Jeremiah Blocki. “Towards Practical Attacks on Argon2i and Balloon Hashing.” IEEE, 2017. <a href=\"https://doi.org/10.1109/EuroSP.2017.47\">https://doi.org/10.1109/EuroSP.2017.47</a>.","short":"J.F. Alwen, J. Blocki, in:, IEEE, 2017.","ieee":"J. F. Alwen and J. Blocki, “Towards practical attacks on Argon2i and balloon hashing,” presented at the EuroS&#38;P: European Symposium on Security and Privacy, Paris, France, 2017.","ama":"Alwen JF, Blocki J. Towards practical attacks on Argon2i and balloon hashing. In: IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/EuroSP.2017.47\">10.1109/EuroSP.2017.47</a>"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/759"}],"author":[{"last_name":"Alwen","first_name":"Joel F","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jeremiah","last_name":"Blocki","full_name":"Blocki, Jeremiah"}],"quality_controlled":"1","year":"2017","title":"Towards practical attacks on Argon2i and balloon hashing","_id":"1176","oa":1,"abstract":[{"lang":"eng","text":"The algorithm Argon2i-B of Biryukov, Dinu and Khovratovich is currently being considered by the IRTF (Internet Research Task Force) as a new de-facto standard for password hashing. An older version (Argon2i-A) of the same algorithm was chosen as the winner of the recent Password Hashing Competition. An important competitor to Argon2i-B is the recently introduced Balloon Hashing (BH) algorithm of Corrigan-Gibs, Boneh and Schechter. A key security desiderata for any such algorithm is that evaluating it (even using a custom device) requires a large amount of memory amortized across multiple instances. Alwen and Blocki (CRYPTO 2016) introduced a class of theoretical attacks against Argon2i-A and BH. While these attacks yield large asymptotic reductions in the amount of memory, it was not, a priori, clear if (1) they can be extended to the newer Argon2i-B, (2) the attacks are effective on any algorithm for practical parameter ranges (e.g., 1GB of memory) and (3) if they can be effectively instantiated against any algorithm under realistic hardware constrains. In this work we answer all three of these questions in the affirmative for all three algorithms. This is also the first work to analyze the security of Argon2i-B. In more detail, we extend the theoretical attacks of Alwen and Blocki (CRYPTO 2016) to the recent Argon2i-B proposal demonstrating severe asymptotic deficiencies in its security. Next we introduce several novel heuristics for improving the attack's concrete memory efficiency even when on-chip memory bandwidth is bounded. We then simulate our attacks on randomly sampled Argon2i-A, Argon2i-B and BH instances and measure the resulting memory consumption for various practical parameter ranges and for a variety of upperbounds on the amount of parallelism available to the attacker. Finally we describe, implement, and test a new heuristic for applying the Alwen-Blocki attack to functions employing a technique developed by Corrigan-Gibs et al. for improving concrete security of memory-hard functions. We analyze the collected data and show the effects various parameters have on the memory consumption of the attack. In particular, we can draw several interesting conclusions about the level of security provided by these functions. · For the Alwen-Blocki attack to fail against practical memory parameters, Argon2i-B must be instantiated with more than 10 passes on memory - beyond the \"paranoid\" parameter setting in the current IRTF proposal. · The technique of Corrigan-Gibs for improving security can also be overcome by the Alwen-Blocki attack under realistic hardware constraints. · On a positive note, both the asymptotic and concrete security of Argon2i-B seem to improve on that of Argon2i-A."}],"publication_status":"published"},{"publication_identifier":{"issn":["00018708"]},"scopus_import":"1","page":"627 - 644","date_published":"2017-02-21T00:00:00Z","external_id":{"isi":["000409292900015"]},"doi":"10.1016/j.aim.2016.12.026","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"ec_funded":1,"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"21","date_updated":"2023-09-20T11:21:27Z","type":"journal_article","oa_version":"Submitted Version","publist_id":"6173","isi":1,"intvolume":"       308","status":"public","date_created":"2018-12-11T11:50:34Z","month":"02","volume":308,"publisher":"Academic Press","oa":1,"_id":"1180","publication":"Advances in Mathematics","title":"Algebraic vertices of non-convex polyhedra","publication_status":"published","abstract":[{"lang":"eng","text":"In this article we define an algebraic vertex of a generalized polyhedron and show that the set of algebraic vertices is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope P is a linear combination of indicator functions of simplices whose vertices are algebraic vertices of P. We also show that the indicator function of any generalized polyhedron is a linear combination, with integer coefficients, of indicator functions of cones with apices at algebraic vertices and line-cones. The concept of an algebraic vertex is closely related to the Fourier–Laplace transform. We show that a point v is an algebraic vertex of a generalized polyhedron P if and only if the tangent cone of P, at v, has non-zero Fourier–Laplace transform."}],"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"author":[{"first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"last_name":"Bárány","first_name":"Imre","full_name":"Bárány, Imre"},{"first_name":"Sinai","last_name":"Robins","full_name":"Robins, Sinai"}],"quality_controlled":"1","citation":{"mla":"Akopyan, Arseniy, et al. “Algebraic Vertices of Non-Convex Polyhedra.” <i>Advances in Mathematics</i>, vol. 308, Academic Press, 2017, pp. 627–44, doi:<a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">10.1016/j.aim.2016.12.026</a>.","apa":"Akopyan, A., Bárány, I., &#38; Robins, S. (2017). Algebraic vertices of non-convex polyhedra. <i>Advances in Mathematics</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">https://doi.org/10.1016/j.aim.2016.12.026</a>","ama":"Akopyan A, Bárány I, Robins S. Algebraic vertices of non-convex polyhedra. <i>Advances in Mathematics</i>. 2017;308:627-644. doi:<a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">10.1016/j.aim.2016.12.026</a>","ieee":"A. Akopyan, I. Bárány, and S. Robins, “Algebraic vertices of non-convex polyhedra,” <i>Advances in Mathematics</i>, vol. 308. Academic Press, pp. 627–644, 2017.","chicago":"Akopyan, Arseniy, Imre Bárány, and Sinai Robins. “Algebraic Vertices of Non-Convex Polyhedra.” <i>Advances in Mathematics</i>. Academic Press, 2017. <a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">https://doi.org/10.1016/j.aim.2016.12.026</a>.","short":"A. Akopyan, I. Bárány, S. Robins, Advances in Mathematics 308 (2017) 627–644.","ista":"Akopyan A, Bárány I, Robins S. 2017. Algebraic vertices of non-convex polyhedra. Advances in Mathematics. 308, 627–644."},"main_file_link":[{"url":"https://arxiv.org/abs/1508.07594","open_access":"1"}],"year":"2017"},{"month":"10","date_created":"2018-12-11T11:50:37Z","status":"public","intvolume":"        30","isi":1,"publist_id":"6166","file_date_updated":"2020-07-14T12:44:37Z","publisher":"Springer","article_type":"original","issue":"4","volume":30,"project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"abstract":[{"text":"We construct efficient authentication protocols and message authentication codes (MACs) whose security can be reduced to the learning parity with noise (LPN) problem. Despite a large body of work—starting with the (Formula presented.) protocol of Hopper and Blum in 2001—until now it was not even known how to construct an efficient authentication protocol from LPN which is secure against man-in-the-middle attacks. A MAC implies such a (two-round) protocol.","lang":"eng"}],"publication_status":"published","title":"Efficient authentication from hard learning problems","publication":"Journal of Cryptology","_id":"1187","oa":1,"ddc":["000"],"related_material":{"record":[{"id":"3238","status":"public","relation":"earlier_version"}]},"year":"2017","citation":{"ieee":"E. Kiltz, K. Z. Pietrzak, D. Venturi, D. Cash, and A. Jain, “Efficient authentication from hard learning problems,” <i>Journal of Cryptology</i>, vol. 30, no. 4. Springer, pp. 1238–1275, 2017.","ama":"Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. Efficient authentication from hard learning problems. <i>Journal of Cryptology</i>. 2017;30(4):1238-1275. doi:<a href=\"https://doi.org/10.1007/s00145-016-9247-3\">10.1007/s00145-016-9247-3</a>","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, Daniele Venturi, David Cash, and Abhishek Jain. “Efficient Authentication from Hard Learning Problems.” <i>Journal of Cryptology</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00145-016-9247-3\">https://doi.org/10.1007/s00145-016-9247-3</a>.","short":"E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.","ista":"Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. 2017. Efficient authentication from hard learning problems. Journal of Cryptology. 30(4), 1238–1275.","apa":"Kiltz, E., Pietrzak, K. Z., Venturi, D., Cash, D., &#38; Jain, A. (2017). Efficient authentication from hard learning problems. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-016-9247-3\">https://doi.org/10.1007/s00145-016-9247-3</a>","mla":"Kiltz, Eike, et al. “Efficient Authentication from Hard Learning Problems.” <i>Journal of Cryptology</i>, vol. 30, no. 4, Springer, 2017, pp. 1238–75, doi:<a href=\"https://doi.org/10.1007/s00145-016-9247-3\">10.1007/s00145-016-9247-3</a>."},"quality_controlled":"1","author":[{"last_name":"Kiltz","first_name":"Eike","full_name":"Kiltz, Eike"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniele","last_name":"Venturi","full_name":"Venturi, Daniele"},{"last_name":"Cash","first_name":"David","full_name":"Cash, David"},{"last_name":"Jain","first_name":"Abhishek","full_name":"Jain, Abhishek"}],"scopus_import":"1","external_id":{"isi":["000410788600007"]},"file":[{"file_id":"7843","date_updated":"2020-07-14T12:44:37Z","access_level":"open_access","checksum":"c647520d115b772a1682fc06fa273eb1","file_name":"2017_JournalCrypto_Kiltz.pdf","date_created":"2020-05-14T16:30:17Z","relation":"main_file","file_size":516959,"creator":"dernst","content_type":"application/pdf"}],"date_published":"2017-10-01T00:00:00Z","page":"1238 - 1275","ec_funded":1,"department":[{"_id":"KrPi"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.1007/s00145-016-9247-3","oa_version":"Submitted Version","date_updated":"2023-09-20T11:20:58Z","type":"journal_article","day":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No"},{"scopus_import":1,"page":"525-559","date_published":"2017-03-01T00:00:00Z","department":[{"_id":"NiBa"}],"language":[{"iso":"eng"}],"doi":"10.1007/s11538-016-0244-3","ec_funded":1,"acknowledgement":"We thank Nick Barton, Katarína Bod’ová, and Sr\r\n-\r\ndan Sarikas for constructive feed-\r\nback and support. Furthermore, we would like to express our deep gratitude to the anonymous referees (one\r\nof whom, Jimmy Garnier, agreed to reveal his identity) and the editor Max Souza, for very helpful and\r\ndetailed comments and suggestions that significantly helped us to improve the manuscript. This project has\r\nreceived funding from the European Union’s Seventh Framework Programme for research, technological\r\ndevelopment and demonstration under Grant Agreement 618091 Speed of Adaptation in Population Genet-\r\nics and Evolutionary Computation (SAGE) and the European Research Council (ERC) Grant No. 250152\r\n(SN), from the Scientific Grant Agency of the Slovak Republic under the Grant 1/0459/13 and by the Slovak\r\nResearch and Development Agency under the Contract No. APVV-14-0378 (RK). RK would also like to\r\nthank IST Austria for its hospitality during the work on this project.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Preprint","date_updated":"2025-05-28T11:42:46Z","type":"journal_article","publist_id":"6160","intvolume":"        79","status":"public","month":"03","date_created":"2018-12-11T11:50:38Z","volume":79,"issue":"3","publisher":"Springer","_id":"1191","oa":1,"publication":"Bulletin of Mathematical Biology","title":"Existence of traveling waves for the generalized F–KPP equation","abstract":[{"lang":"eng","text":"Variation in genotypes may be responsible for differences in dispersal rates, directional biases, and growth rates of individuals. These traits may favor certain genotypes and enhance their spatiotemporal spreading into areas occupied by the less advantageous genotypes. We study how these factors influence the speed of spreading in the case of two competing genotypes under the assumption that spatial variation of the total population is small compared to the spatial variation of the frequencies of the genotypes in the population. In that case, the dynamics of the frequency of one of the genotypes is approximately described by a generalized Fisher–Kolmogorov–Petrovskii–Piskunov (F–KPP) equation. This generalized F–KPP equation with (nonlinear) frequency-dependent diffusion and advection terms admits traveling wave solutions that characterize the invasion of the dominant genotype. Our existence results generalize the classical theory for traveling waves for the F–KPP with constant coefficients. Moreover, in the particular case of the quadratic (monostable) nonlinear growth–decay rate in the generalized F–KPP we study in detail the influence of the variance in diffusion and mean displacement rates of the two genotypes on the minimal wave propagation speed."}],"publication_status":"published","project":[{"name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","grant_number":"618091","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425"},{"grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","author":[{"full_name":"Kollár, Richard","first_name":"Richard","last_name":"Kollár"},{"last_name":"Novak","first_name":"Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87","full_name":"Novak, Sebastian","orcid":"0000-0002-2519-824X"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.00944"}],"citation":{"apa":"Kollár, R., &#38; Novak, S. (2017). Existence of traveling waves for the generalized F–KPP equation. <i>Bulletin of Mathematical Biology</i>. Springer. <a href=\"https://doi.org/10.1007/s11538-016-0244-3\">https://doi.org/10.1007/s11538-016-0244-3</a>","mla":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” <i>Bulletin of Mathematical Biology</i>, vol. 79, no. 3, Springer, 2017, pp. 525–59, doi:<a href=\"https://doi.org/10.1007/s11538-016-0244-3\">10.1007/s11538-016-0244-3</a>.","short":"R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.","chicago":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” <i>Bulletin of Mathematical Biology</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s11538-016-0244-3\">https://doi.org/10.1007/s11538-016-0244-3</a>.","ista":"Kollár R, Novak S. 2017. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 79(3), 525–559.","ama":"Kollár R, Novak S. Existence of traveling waves for the generalized F–KPP equation. <i>Bulletin of Mathematical Biology</i>. 2017;79(3):525-559. doi:<a href=\"https://doi.org/10.1007/s11538-016-0244-3\">10.1007/s11538-016-0244-3</a>","ieee":"R. Kollár and S. Novak, “Existence of traveling waves for the generalized F–KPP equation,” <i>Bulletin of Mathematical Biology</i>, vol. 79, no. 3. Springer, pp. 525–559, 2017."},"year":"2017"},{"publisher":"SIAM","month":"01","conference":{"start_date":"2017-01-16","location":"Barcelona, Spain","end_date":"2017-01019","name":"SODA: Symposium on Discrete Algorithms"},"date_created":"2018-12-11T11:50:38Z","status":"public","isi":1,"publist_id":"6159","year":"2017","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.03124"}],"citation":{"ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar Boolean CSPs. In: SIAM; 2017:307-326. doi:<a href=\"https://doi.org/10.1137/1.9781611974782.20\">10.1137/1.9781611974782.20</a>","ieee":"A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.","chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs,” 307–26. SIAM, 2017. <a href=\"https://doi.org/10.1137/1.9781611974782.20\">https://doi.org/10.1137/1.9781611974782.20</a>.","short":"A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.","ista":"Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms, 307–326.","apa":"Kazda, A., Kolmogorov, V., &#38; Rolinek, M. (2017). Even delta-matroids and the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain: SIAM. <a href=\"https://doi.org/10.1137/1.9781611974782.20\">https://doi.org/10.1137/1.9781611974782.20</a>","mla":"Kazda, Alexandr, et al. <i>Even Delta-Matroids and the Complexity of Planar Boolean CSPs</i>. SIAM, 2017, pp. 307–26, doi:<a href=\"https://doi.org/10.1137/1.9781611974782.20\">10.1137/1.9781611974782.20</a>."},"quality_controlled":"1","author":[{"last_name":"Kazda","first_name":"Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","full_name":"Kazda, Alexandr"},{"first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","last_name":"Rolinek"}],"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"abstract":[{"lang":"eng","text":"The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Knowing that edge CSP is tractable for even Δ-matroid constraints allows us to extend the tractability result to a larger class of Δ-matroids that includes many classes that were known to be tractable before, namely co-independent, compact, local and binary."}],"publication_status":"published","title":"Even delta-matroids and the complexity of planar Boolean CSPs","_id":"1192","oa":1,"related_material":{"record":[{"id":"6032","relation":"later_version","status":"public"}]},"external_id":{"isi":["000426965800020"]},"date_published":"2017-01-01T00:00:00Z","page":"307 - 326","publication_identifier":{"isbn":["978-161197478-2"]},"oa_version":"Submitted Version","type":"conference","date_updated":"2023-09-20T11:20:26Z","day":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","ec_funded":1,"department":[{"_id":"VlKo"}],"language":[{"iso":"eng"}],"doi":"10.1137/1.9781611974782.20"},{"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","type":"conference","date_updated":"2025-07-14T09:09:58Z","day":"01","ec_funded":1,"department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"doi":"10.1145/3009837.3009873","external_id":{"isi":["000408311200013"]},"date_published":"2017-01-01T00:00:00Z","page":"145 - 160","alternative_title":["ACM SIGPLAN Notices"],"scopus_import":"1","publication_identifier":{"issn":["07308566"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.01063"}],"citation":{"apa":"Chatterjee, K., Novotný, P., &#38; Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM. <a href=\"https://doi.org/10.1145/3009837.3009873\">https://doi.org/10.1145/3009837.3009873</a>","mla":"Chatterjee, Krishnendu, et al. <i>Stochastic Invariants for Probabilistic Termination</i>. Vol. 52, no. 1, ACM, 2017, pp. 145–60, doi:<a href=\"https://doi.org/10.1145/3009837.3009873\">10.1145/3009837.3009873</a>.","ista":"Chatterjee K, Novotný P, Zikelic D. 2017. Stochastic invariants for probabilistic termination. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 52, 145–160.","chicago":"Chatterjee, Krishnendu, Petr Novotný, and Djordje Zikelic. “Stochastic Invariants for Probabilistic Termination,” 52:145–60. ACM, 2017. <a href=\"https://doi.org/10.1145/3009837.3009873\">https://doi.org/10.1145/3009837.3009873</a>.","short":"K. Chatterjee, P. Novotný, D. Zikelic, in:, ACM, 2017, pp. 145–160.","ama":"Chatterjee K, Novotný P, Zikelic D. Stochastic invariants for probabilistic termination. In: Vol 52. ACM; 2017:145-160. doi:<a href=\"https://doi.org/10.1145/3009837.3009873\">10.1145/3009837.3009873</a>","ieee":"K. Chatterjee, P. Novotný, and D. Zikelic, “Stochastic invariants for probabilistic termination,” presented at the POPL: Principles of Programming Languages, Paris, France, 2017, vol. 52, no. 1, pp. 145–160."},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny","first_name":"Petr"},{"last_name":"Zikelic","first_name":"Djordje","full_name":"Zikelic, Djordje"}],"quality_controlled":"1","year":"2017","title":"Stochastic invariants for probabilistic termination","_id":"1194","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"14539"}]},"oa":1,"project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"abstract":[{"lang":"eng","text":"Termination is one of the basic liveness properties, and we study the termination problem for probabilistic programs with real-valued variables. Previous works focused on the qualitative problem that asks whether an input program terminates with probability~1 (almost-sure termination). A powerful approach for this qualitative problem is the notion of ranking supermartingales with respect to a given set of invariants. The quantitative problem (probabilistic termination) asks for bounds on the termination probability. A fundamental and conceptual drawback of the existing approaches to address probabilistic termination is that even though the supermartingales consider the probabilistic behavior of the programs, the invariants are obtained completely ignoring the probabilistic aspect. In this work we address the probabilistic termination problem for linear-arithmetic probabilistic programs with nondeterminism. We define the notion of {\\em stochastic invariants}, which are constraints along with a probability bound that the constraints hold. We introduce a concept of {\\em repulsing supermartingales}. First, we show that repulsing supermartingales can be used to obtain bounds on the probability of the stochastic invariants. Second, we show the effectiveness of repulsing supermartingales in the following three ways: (1)~With a combination of ranking and repulsing supermartingales we can compute lower bounds on the probability of termination; (2)~repulsing supermartingales provide witnesses for refutation of almost-sure termination; and (3)~with a combination of ranking and repulsing supermartingales we can establish persistence properties of probabilistic programs. We also present results on related computational problems and an experimental evaluation of our approach on academic examples. "}],"publication_status":"published","issue":"1","volume":52,"publisher":"ACM","intvolume":"        52","isi":1,"publist_id":"6157","conference":{"location":"Paris, France","start_date":"2017-01-15","end_date":"2017-01-21","name":"POPL: Principles of Programming Languages"},"month":"01","date_created":"2018-12-11T11:50:39Z","status":"public"},{"date_published":"2017-02-01T00:00:00Z","external_id":{"isi":["000390637000011"]},"page":"166 - 190","scopus_import":"1","date_updated":"2023-09-20T11:18:50Z","type":"journal_article","oa_version":"None","day":"01","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","acknowledgement":"This research was supported in part by the European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund1 (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.\r\nA Technical Report of this article is available via: https://repository.ist.ac.at/171/","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.nahs.2016.09.001","department":[{"_id":"ToHe"}],"publisher":"Elsevier","volume":23,"date_created":"2018-12-11T11:50:39Z","month":"02","status":"public","intvolume":"        23","publist_id":"6154","isi":1,"year":"2017","citation":{"short":"T.A. Henzinger, J. Otop, Nonlinear Analysis: Hybrid Systems 23 (2017) 166–190.","chicago":"Henzinger, Thomas A, and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">https://doi.org/10.1016/j.nahs.2016.09.001</a>.","ista":"Henzinger TA, Otop J. 2017. Model measuring for discrete and hybrid systems. Nonlinear Analysis: Hybrid Systems. 23, 166–190.","ama":"Henzinger TA, Otop J. Model measuring for discrete and hybrid systems. <i>Nonlinear Analysis: Hybrid Systems</i>. 2017;23:166-190. doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">10.1016/j.nahs.2016.09.001</a>","ieee":"T. A. Henzinger and J. Otop, “Model measuring for discrete and hybrid systems,” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23. Elsevier, pp. 166–190, 2017.","mla":"Henzinger, Thomas A., and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23, Elsevier, 2017, pp. 166–90, doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">10.1016/j.nahs.2016.09.001</a>.","apa":"Henzinger, T. A., &#38; Otop, J. (2017). Model measuring for discrete and hybrid systems. <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">https://doi.org/10.1016/j.nahs.2016.09.001</a>"},"quality_controlled":"1","author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Otop","first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","abstract":[{"text":"We define the . model-measuring problem: given a model . M and specification . ϕ, what is the maximal distance . ρ such that all models . M' within distance . ρ from . M satisfy (or violate) . ϕ. The model-measuring problem presupposes a distance function on models. We concentrate on . automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification; robustness problems that measure how much a model can be perturbed without violating the specification; and parameter synthesis for hybrid systems. We show that for automatic distance functions, and (a) . ω-regular linear-time, (b) . ω-regular branching-time, and (c) hybrid specifications, the model-measuring problem can be solved.We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for word, tree, and hybrid automata by the . optimal-value question for the weighted versions of these automata. For automata over words and trees, we consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. For hybrid automata, we consider monotonic (parametric) hybrid automata, a hybrid counterpart of (discrete) weighted automata.We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications. Further, we propose the modeling framework for model measuring to ease the specification and reduce the likelihood of errors in modeling.Finally, we present a variant of the model-measuring problem, called the . model-repair problem. The model-repair problem applies to models that do not satisfy the specification; it can be used to derive restrictions, under which the model satisfies the specification, i.e., to repair the model.","lang":"eng"}],"publication":"Nonlinear Analysis: Hybrid Systems","title":"Model measuring for discrete and hybrid systems","_id":"1196"},{"page":" 533 - 552","date_published":"2017-03-01T00:00:00Z","file":[{"file_size":587207,"content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:17:40Z","relation":"main_file","access_level":"open_access","file_name":"IST-2016-723-v1+1_s11005-016-0915-x.pdf","checksum":"c0c835def162c1bc52f978fad26e3c2f","file_id":"5296","date_updated":"2020-07-14T12:44:38Z"}],"external_id":{"isi":["000394280200007"]},"publication_identifier":{"issn":["03779017"]},"scopus_import":"1","article_processing_charge":"Yes (via OA deal)","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","date_updated":"2023-09-20T11:18:13Z","type":"journal_article","oa_version":"Published Version","doi":"10.1007/s11005-016-0915-x","language":[{"iso":"eng"}],"department":[{"_id":"RoSe"}],"has_accepted_license":"1","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). ","volume":107,"issue":"3","pubrep_id":"723","publisher":"Springer","file_date_updated":"2020-07-14T12:44:38Z","publist_id":"6152","isi":1,"intvolume":"       107","status":"public","date_created":"2018-12-11T11:50:40Z","month":"03","quality_controlled":"1","author":[{"first_name":"Thomas","last_name":"Moser","full_name":"Moser, Thomas","id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","last_name":"Seiringer"}],"citation":{"short":"T. Moser, R. Seiringer, Letters in Mathematical Physics 107 (2017) 533–552.","chicago":"Moser, Thomas, and Robert Seiringer. “Triviality of a Model of Particles with Point Interactions in the Thermodynamic Limit.” <i>Letters in Mathematical Physics</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s11005-016-0915-x\">https://doi.org/10.1007/s11005-016-0915-x</a>.","ista":"Moser T, Seiringer R. 2017. Triviality of a model of particles with point interactions in the thermodynamic limit. Letters in Mathematical Physics. 107(3), 533–552.","ieee":"T. Moser and R. Seiringer, “Triviality of a model of particles with point interactions in the thermodynamic limit,” <i>Letters in Mathematical Physics</i>, vol. 107, no. 3. Springer, pp. 533–552, 2017.","ama":"Moser T, Seiringer R. Triviality of a model of particles with point interactions in the thermodynamic limit. <i>Letters in Mathematical Physics</i>. 2017;107(3):533-552. doi:<a href=\"https://doi.org/10.1007/s11005-016-0915-x\">10.1007/s11005-016-0915-x</a>","apa":"Moser, T., &#38; Seiringer, R. (2017). Triviality of a model of particles with point interactions in the thermodynamic limit. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-016-0915-x\">https://doi.org/10.1007/s11005-016-0915-x</a>","mla":"Moser, Thomas, and Robert Seiringer. “Triviality of a Model of Particles with Point Interactions in the Thermodynamic Limit.” <i>Letters in Mathematical Physics</i>, vol. 107, no. 3, Springer, 2017, pp. 533–52, doi:<a href=\"https://doi.org/10.1007/s11005-016-0915-x\">10.1007/s11005-016-0915-x</a>."},"year":"2017","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"},"oa":1,"related_material":{"record":[{"id":"52","status":"public","relation":"dissertation_contains"}]},"ddc":["510","539"],"_id":"1198","title":"Triviality of a model of particles with point interactions in the thermodynamic limit","publication":"Letters in Mathematical Physics","publication_status":"published","abstract":[{"text":"We consider a model of fermions interacting via point interactions, defined via a certain weighted Dirichlet form. While for two particles the interaction corresponds to infinite scattering length, the presence of further particles effectively decreases the interaction strength. We show that the model becomes trivial in the thermodynamic limit, in the sense that the free energy density at any given particle density and temperature agrees with the corresponding expression for non-interacting particles.","lang":"eng"}],"project":[{"call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}]},{"doi":"10.1038/hdy.2016.109","language":[{"iso":"eng"}],"department":[{"_id":"NiBa"}],"ec_funded":1,"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","type":"journal_article","date_updated":"2025-05-28T11:42:47Z","oa_version":"Submitted Version","scopus_import":"1","page":"96 - 109","date_published":"2017-01-01T00:00:00Z","external_id":{"isi":["000392229100011"]},"oa":1,"related_material":{"record":[{"id":"9710","relation":"research_data","status":"public"}]},"_id":"1199","publication":"Heredity","title":"How does epistasis influence the response to selection?","publication_status":"published","abstract":[{"lang":"eng","text":"Much of quantitative genetics is based on the ‘infinitesimal model’, under which selection has a negligible effect on the genetic variance. This is typically justified by assuming a very large number of loci with additive effects. However, it applies even when genes interact, provided that the number of loci is large enough that selection on each of them is weak relative to random drift. In the long term, directional selection will change allele frequencies, but even then, the effects of epistasis on the ultimate change in trait mean due to selection may be modest. Stabilising selection can maintain many traits close to their optima, even when the underlying alleles are weakly selected. However, the number of traits that can be optimised is apparently limited to ~4Ne by the ‘drift load’, and this is hard to reconcile with the apparent complexity of many organisms. Just as for the mutation load, this limit can be evaded by a particular form of negative epistasis. A more robust limit is set by the variance in reproductive success. This suggests that selection accumulates information most efficiently in the infinitesimal regime, when selection on individual alleles is weak, and comparable with random drift. A review of evidence on selection strength suggests that although most variance in fitness may be because of alleles with large Nes, substantial amounts of adaptation may be because of alleles in the infinitesimal regime, in which epistasis has modest effects."}],"project":[{"call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation"}],"author":[{"last_name":"Barton","first_name":"Nicholas H","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","citation":{"apa":"Barton, N. H. (2017). How does epistasis influence the response to selection? <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.2016.109\">https://doi.org/10.1038/hdy.2016.109</a>","mla":"Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?” <i>Heredity</i>, vol. 118, Nature Publishing Group, 2017, pp. 96–109, doi:<a href=\"https://doi.org/10.1038/hdy.2016.109\">10.1038/hdy.2016.109</a>.","ama":"Barton NH. How does epistasis influence the response to selection? <i>Heredity</i>. 2017;118:96-109. doi:<a href=\"https://doi.org/10.1038/hdy.2016.109\">10.1038/hdy.2016.109</a>","ieee":"N. H. Barton, “How does epistasis influence the response to selection?,” <i>Heredity</i>, vol. 118. Nature Publishing Group, pp. 96–109, 2017.","short":"N.H. Barton, Heredity 118 (2017) 96–109.","chicago":"Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?” <i>Heredity</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/hdy.2016.109\">https://doi.org/10.1038/hdy.2016.109</a>.","ista":"Barton NH. 2017. How does epistasis influence the response to selection? Heredity. 118, 96–109."},"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5176114/","open_access":"1"}],"year":"2017","publist_id":"6151","isi":1,"intvolume":"       118","status":"public","date_created":"2018-12-11T11:50:40Z","month":"01","volume":118,"publisher":"Nature Publishing Group"}]