[{"status":"public","month":"10","date_created":"2018-12-12T12:31:35Z","file":[{"date_created":"2018-12-12T13:02:29Z","relation":"main_file","content_type":"application/octet-stream","creator":"system","file_size":799,"date_updated":"2020-07-14T12:47:04Z","file_id":"5596","access_level":"open_access","checksum":"cb7a2fa622460eca6231d659ce590e32","file_name":"IST-2017-75-v1+1_FMI.m"}],"keyword":["Cell migration","tracking","forward migration index","FMI"],"date_published":"2017-10-04T00:00:00Z","publisher":"Institute of Science and Technology Austria","datarep_id":"75","file_date_updated":"2020-07-14T12:47:04Z","_id":"5570","department":[{"_id":"Bio"}],"has_accepted_license":"1","license":"https://creativecommons.org/publicdomain/zero/1.0/","doi":"10.15479/AT:ISTA:75","ddc":["570"],"oa":1,"title":"Forward migration indexes","abstract":[{"lang":"eng","text":"Matlab script to calculate the forward migration indexes (/) from TrackMate spot-statistics files."}],"article_processing_charge":"No","author":[{"last_name":"Hauschild","first_name":"Robert","full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Hauschild, R. (2017). Forward migration indexes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:75","mla":"Hauschild, Robert. Forward Migration Indexes. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:75.","short":"R. Hauschild, (2017).","chicago":"Hauschild, Robert. “Forward Migration Indexes.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:75.","ista":"Hauschild R. 2017. Forward migration indexes, Institute of Science and Technology Austria, 10.15479/AT:ISTA:75.","ieee":"R. Hauschild, “Forward migration indexes.” Institute of Science and Technology Austria, 2017.","ama":"Hauschild R. Forward migration indexes. 2017. doi:10.15479/AT:ISTA:75"},"year":"2017","day":"04","oa_version":"Published Version","tmp":{"short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"type":"research_data","date_updated":"2024-02-21T13:47:14Z"},{"month":"11","date_created":"2018-12-12T12:31:36Z","status":"public","file":[{"file_id":"5618","date_updated":"2020-07-14T12:47:04Z","file_name":"IST-2017-78-v1+1_Data.zip","checksum":"4520eb2b8379417ee916995719158f16","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T13:03:00Z","content_type":"application/zip","creator":"system","file_size":143697895}],"date_published":"2017-11-06T00:00:00Z","datarep_id":"78","file_date_updated":"2020-07-14T12:47:04Z","publisher":"Institute of Science and Technology Austria","title":"Data for \"The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology\"","_id":"5571","department":[{"_id":"BeVi"}],"has_accepted_license":"1","ddc":["576"],"oa":1,"related_material":{"record":[{"status":"public","relation":"research_paper","id":"542"}]},"doi":"10.15479/AT:ISTA:78","abstract":[{"text":"This folder contains all the data used in each of the main figures of \"The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology\" (Kelemen, R., Vicoso, B.), as well as in the supplementary figures. \r\n","lang":"eng"}],"citation":{"ieee":"B. Vicoso, “Data for ‘The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.’” Institute of Science and Technology Austria, 2017.","ama":"Vicoso B. Data for “The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.” 2017. doi:10.15479/AT:ISTA:78","chicago":"Vicoso, Beatriz. “Data for ‘The Genomic Characterization of the t-Haplotype, a Mouse Meiotic Driver, Highlights Its Complex History and Specialized Biology.’” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:78.","short":"B. Vicoso, (2017).","ista":"Vicoso B. 2017. Data for ‘The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:78.","apa":"Vicoso, B. (2017). Data for “The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:78","mla":"Vicoso, Beatriz. Data for “The Genomic Characterization of the t-Haplotype, a Mouse Meiotic Driver, Highlights Its Complex History and Specialized Biology.” Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:78."},"author":[{"full_name":"Vicoso, Beatriz","orcid":"0000-0002-4579-8306","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso","first_name":"Beatriz"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Submitted Version","date_updated":"2024-02-21T13:48:16Z","tmp":{"short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"type":"research_data","year":"2017","day":"06","contributor":[{"contributor_type":"contact_person","last_name":"Vicoso","first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87"}]},{"publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:05Z","datarep_id":"79","date_published":"2017-11-06T00:00:00Z","file":[{"file_id":"5643","date_updated":"2020-07-14T12:47:05Z","access_level":"open_access","file_name":"IST-2017-79-v1+1_Code.zip","checksum":"3e70a7bcd6ff0c38b79e4c8a7d137034","date_created":"2018-12-12T13:05:15Z","relation":"main_file","creator":"system","content_type":"application/zip","file_size":49823}],"status":"public","date_created":"2018-12-12T12:31:36Z","month":"11","day":"06","year":"2017","date_updated":"2024-02-21T13:48:28Z","tmp":{"short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"type":"research_data","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Beatriz","last_name":"Vicoso","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","full_name":"Vicoso, Beatriz","orcid":"0000-0002-4579-8306"}],"article_processing_charge":"No","citation":{"ama":"Vicoso B. Code for “The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.” 2017. doi:10.15479/AT:ISTA:79 ","ieee":"B. Vicoso, “Code for ‘The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.’” Institute of Science and Technology Austria, 2017.","short":"B. Vicoso, (2017).","chicago":"Vicoso, Beatriz. “Code for ‘The Genomic Characterization of the t-Haplotype, a Mouse Meiotic Driver, Highlights Its Complex History and Specialized Biology.’” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:79 .","ista":"Vicoso B. 2017. Code for ‘The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:79 .","mla":"Vicoso, Beatriz. Code for “The Genomic Characterization of the t-Haplotype, a Mouse Meiotic Driver, Highlights Its Complex History and Specialized Biology.” Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:79 .","apa":"Vicoso, B. (2017). Code for “The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:79 "},"abstract":[{"text":"Code described in the Supplementary Methods of \"The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology\" (Kelemen, R., Vicoso, B.)","lang":"eng"}],"related_material":{"record":[{"id":"542","status":"public","relation":"research_paper"}]},"doi":"10.15479/AT:ISTA:79 ","oa":1,"ddc":["576"],"department":[{"_id":"BeVi"}],"_id":"5572","has_accepted_license":"1","title":"Code for \"The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology\""},{"external_id":{"pmid":["29237813"]},"date_published":"2017-12-01T00:00:00Z","scopus_import":"1","publication_identifier":{"issn":["1744-9561"]},"day":"01","oa_version":"None","type":"journal_article","date_updated":"2023-10-18T06:42:25Z","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"SyCr"}],"doi":"10.1098/rsbl.2017.0632","language":[{"iso":"eng"}],"publisher":"The Royal Society","article_type":"original","issue":"12","volume":13,"article_number":"0632","status":"public","month":"12","date_created":"2018-12-11T11:47:10Z","publist_id":"7255","intvolume":" 13","year":"2017","quality_controlled":"1","author":[{"full_name":"Futo, Momir","first_name":"Momir","last_name":"Futo"},{"full_name":"Sell, Marie","last_name":"Sell","first_name":"Marie"},{"orcid":"0000-0002-8696-6978","full_name":"Kutzer, Megan","id":"29D0B332-F248-11E8-B48F-1D18A9856A87","first_name":"Megan","last_name":"Kutzer"},{"first_name":"Joachim","last_name":"Kurtz","full_name":"Kurtz, Joachim"}],"citation":{"mla":"Futo, Momir, et al. “Specificity of Oral Immune Priming in the Red Flour Beetle Tribolium Castaneum.” Biology Letters, vol. 13, no. 12, 0632, The Royal Society, 2017, doi:10.1098/rsbl.2017.0632.","apa":"Futo, M., Sell, M., Kutzer, M., & Kurtz, J. (2017). Specificity of oral immune priming in the red flour beetle Tribolium castaneum. Biology Letters. The Royal Society. https://doi.org/10.1098/rsbl.2017.0632","ista":"Futo M, Sell M, Kutzer M, Kurtz J. 2017. Specificity of oral immune priming in the red flour beetle Tribolium castaneum. Biology Letters. 13(12), 0632.","short":"M. Futo, M. Sell, M. Kutzer, J. Kurtz, Biology Letters 13 (2017).","chicago":"Futo, Momir, Marie Sell, Megan Kutzer, and Joachim Kurtz. “Specificity of Oral Immune Priming in the Red Flour Beetle Tribolium Castaneum.” Biology Letters. The Royal Society, 2017. https://doi.org/10.1098/rsbl.2017.0632.","ieee":"M. Futo, M. Sell, M. Kutzer, and J. Kurtz, “Specificity of oral immune priming in the red flour beetle Tribolium castaneum,” Biology Letters, vol. 13, no. 12. The Royal Society, 2017.","ama":"Futo M, Sell M, Kutzer M, Kurtz J. Specificity of oral immune priming in the red flour beetle Tribolium castaneum. Biology Letters. 2017;13(12). doi:10.1098/rsbl.2017.0632"},"abstract":[{"lang":"eng","text":"Immune specificity is the degree to which a host’s immune system discriminates among various pathogens or antigenic variants. Vertebrate immune memory is highly specific due to antibody responses. On the other hand, some invertebrates show immune priming, i.e. improved survival after secondary exposure to a previously encountered pathogen. Until now, specificity of priming has only been demonstrated via the septic infection route or when live pathogens were used for priming. Therefore, we tested for specificity in the oral priming route in the red flour beetle, Tribolium castaneum. For priming, we used pathogen-free supernatants derived from three different strains of the entomopathogen, Bacillus thuringiensis, which express different Cry toxin variants known for their toxicity against this beetle. Subsequent exposure to the infective spores showed that oral priming was specific for two naturally occurring strains, while a third engineered strain did not induce any priming effect. Our data demonstrate that oral immune priming with a non-infectious bacterial agent can be specific, but the priming effect is not universal across all bacterial strains."}],"publication_status":"published","_id":"558","pmid":1,"title":"Specificity of oral immune priming in the red flour beetle Tribolium castaneum","publication":"Biology Letters"},{"type":"conference","date_updated":"2023-09-07T12:30:22Z","oa_version":"Submitted Version","day":"18","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-70697-9_13","department":[{"_id":"KrPi"}],"date_published":"2017-11-18T00:00:00Z","page":"357 - 379","alternative_title":["LNCS"],"publication_identifier":{"isbn":["978-331970696-2"]},"scopus_import":1,"year":"2017","citation":{"short":"H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.","chicago":"Abusalah, Hamza M, Joel F Alwen, Bram Cohen, Danylo Khilko, Krzysztof Z Pietrzak, and Leonid Reyzin. “Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space,” 10625:357–79. Springer, 2017. https://doi.org/10.1007/978-3-319-70697-9_13.","ista":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625, 357–379.","ama":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. In: Vol 10625. Springer; 2017:357-379. doi:10.1007/978-3-319-70697-9_13","ieee":"H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L. Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379.","apa":"Abusalah, H. M., Alwen, J. F., Cohen, B., Khilko, D., Pietrzak, K. Z., & Reyzin, L. (2017). Beyond Hellman’s time-memory trade-offs with applications to proofs of space (Vol. 10625, pp. 357–379). Presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China: Springer. https://doi.org/10.1007/978-3-319-70697-9_13","mla":"Abusalah, Hamza M., et al. Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space. Vol. 10625, Springer, 2017, pp. 357–79, doi:10.1007/978-3-319-70697-9_13."},"main_file_link":[{"url":"https://eprint.iacr.org/2017/893.pdf","open_access":"1"}],"quality_controlled":"1","author":[{"id":"40297222-F248-11E8-B48F-1D18A9856A87","full_name":"Abusalah, Hamza M","last_name":"Abusalah","first_name":"Hamza M"},{"full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F"},{"full_name":"Cohen, Bram","last_name":"Cohen","first_name":"Bram"},{"first_name":"Danylo","last_name":"Khilko","full_name":"Khilko, Danylo"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654"},{"full_name":"Reyzin, Leonid","last_name":"Reyzin","first_name":"Leonid"}],"project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"publication_status":"published","abstract":[{"text":"Proofs of space (PoS) were suggested as more ecological and economical alternative to proofs of work, which are currently used in blockchain designs like Bitcoin. The existing PoS are based on rather sophisticated graph pebbling lower bounds. Much simpler and in several aspects more efficient schemes based on inverting random functions have been suggested, but they don’t give meaningful security guarantees due to existing time-memory trade-offs. In particular, Hellman showed that any permutation over a domain of size N can be inverted in time T by an algorithm that is given S bits of auxiliary information whenever (Formula presented). For functions Hellman gives a weaker attack with S2· T≈ N2 (e.g., S= T≈ N2/3). To prove lower bounds, one considers an adversary who has access to an oracle f: [ N] → [N] and can make T oracle queries. The best known lower bound is S· T∈ Ω(N) and holds for random functions and permutations. We construct functions that provably require more time and/or space to invert. Specifically, for any constant k we construct a function [N] → [N] that cannot be inverted unless Sk· T∈ Ω(Nk) (in particular, S= T≈ (Formula presented). Our construction does not contradict Hellman’s time-memory trade-off, because it cannot be efficiently evaluated in forward direction. However, its entire function table can be computed in time quasilinear in N, which is sufficient for the PoS application. Our simplest construction is built from a random function oracle g: [N] × [N] → [ N] and a random permutation oracle f: [N] → N] and is defined as h(x) = g(x, x′) where f(x) = π(f(x′)) with π being any involution without a fixed point, e.g. flipping all the bits. For this function we prove that any adversary who gets S bits of auxiliary information, makes at most T oracle queries, and inverts h on an ϵ fraction of outputs must satisfy S2· T∈ Ω(ϵ2N2).","lang":"eng"}],"title":"Beyond Hellman’s time-memory trade-offs with applications to proofs of space","related_material":{"record":[{"id":"83","relation":"dissertation_contains","status":"public"}]},"oa":1,"_id":"559","publisher":"Springer","volume":10625,"date_created":"2018-12-11T11:47:10Z","conference":{"name":"ASIACRYPT: Theory and Applications of Cryptology and Information Security","end_date":"2017-12-07","location":"Hong Kong, China","start_date":"2017-12-03"},"month":"11","status":"public","intvolume":" 10625","publist_id":"7257"},{"day":"01","oa_version":"Submitted Version","type":"journal_article","date_updated":"2021-01-12T08:03:04Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JaMa"}],"language":[{"iso":"eng"}],"doi":"10.1098/rspa.2017.0104","ec_funded":1,"date_published":"2017-11-01T00:00:00Z","scopus_import":1,"publication_identifier":{"issn":["13645021"]},"year":"2017","author":[{"first_name":"Mate","last_name":"Gerencser","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","full_name":"Gerencser, Mate"},{"full_name":"Jentzen, Arnulf","last_name":"Jentzen","first_name":"Arnulf"},{"first_name":"Diyora","last_name":"Salimova","full_name":"Salimova, Diyora"}],"quality_controlled":"1","citation":{"chicago":"Gerencser, Mate, Arnulf Jentzen, and Diyora Salimova. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2017. https://doi.org/10.1098/rspa.2017.0104.","short":"M. Gerencser, A. Jentzen, D. Salimova, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 473 (2017).","ista":"Gerencser M, Jentzen A, Salimova D. 2017. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 473(2207), 0104.","ieee":"M. Gerencser, A. Jentzen, and D. Salimova, “On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 473, no. 2207. Royal Society of London, 2017.","ama":"Gerencser M, Jentzen A, Salimova D. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2017;473(2207). doi:10.1098/rspa.2017.0104","apa":"Gerencser, M., Jentzen, A., & Salimova, D. (2017). On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London. https://doi.org/10.1098/rspa.2017.0104","mla":"Gerencser, Mate, et al. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 473, no. 2207, 0104, Royal Society of London, 2017, doi:10.1098/rspa.2017.0104."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1702.03229"}],"abstract":[{"text":"In a recent article (Jentzen et al. 2016 Commun. Math. Sci. 14, 1477–1500 (doi:10.4310/CMS.2016.v14. n6.a1)), it has been established that, for every arbitrarily slow convergence speed and every natural number d ? {4, 5, . . .}, there exist d-dimensional stochastic differential equations with infinitely often differentiable and globally bounded coefficients such that no approximation method based on finitely many observations of the driving Brownian motion can converge in absolute mean to the solution faster than the given speed of convergence. In this paper, we strengthen the above result by proving that this slow convergence phenomenon also arises in two (d = 2) and three (d = 3) space dimensions.","lang":"eng"}],"publication_status":"published","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"_id":"560","oa":1,"title":"On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions","publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","publisher":"Royal Society of London","volume":473,"issue":"2207","article_number":"0104","status":"public","month":"11","date_created":"2018-12-11T11:47:11Z","publist_id":"7256","intvolume":" 473"},{"project":[{"name":"Multi-Level Conflicts in Evolutionary Dynamics of Restriction-Modification Systems (HFSP Young investigators' grant)","grant_number":"RGY0079/2011","_id":"251BCBEC-B435-11E9-9278-68D0E5697425"},{"grant_number":"24210","name":"Effects of Stochasticity on the Function of Restriction-Modi cation Systems at the Single-Cell Level (DOC Fellowship)","_id":"251D65D8-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"Restriction–modification systems are widespread genetic elements that protect bacteria from bacteriophage infections by recognizing and cleaving heterologous DNA at short, well-defined sequences called restriction sites. Bioinformatic evidence shows that restriction sites are significantly underrepresented in bacteriophage genomes, presumably because bacteriophages with fewer restriction sites are more likely to escape cleavage by restriction–modification systems. However, how mutations in restriction sites affect the likelihood of bacteriophage escape is unknown. Using the bacteriophage l and the restriction–modification system EcoRI, we show that while mutation effects at different restriction sites are unequal, they are independent. As a result, the probability of bacteriophage escape increases with each mutated restriction site. Our results experimentally support the role of restriction site avoidance as a response to selection imposed by restriction–modification systems and offer an insight into the events underlying the process of bacteriophage escape.","lang":"eng"}],"publication_status":"published","pmid":1,"publication":"Biology Letters","title":"Effects of mutations in phage restriction sites during escape from restriction–modification","_id":"561","oa":1,"related_material":{"record":[{"status":"public","relation":"research_data","id":"9847"},{"id":"202","relation":"dissertation_contains","status":"public"}]},"year":"2017","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1098/rsbl.2017.0646"}],"citation":{"apa":"Pleska, M., & Guet, C. C. (2017). Effects of mutations in phage restriction sites during escape from restriction–modification. Biology Letters. The Royal Society. https://doi.org/10.1098/rsbl.2017.0646","mla":"Pleska, Maros, and Calin C. Guet. “Effects of Mutations in Phage Restriction Sites during Escape from Restriction–Modification.” Biology Letters, vol. 13, no. 12, 20170646, The Royal Society, 2017, doi:10.1098/rsbl.2017.0646.","ieee":"M. Pleska and C. C. Guet, “Effects of mutations in phage restriction sites during escape from restriction–modification,” Biology Letters, vol. 13, no. 12. The Royal Society, 2017.","ama":"Pleska M, Guet CC. Effects of mutations in phage restriction sites during escape from restriction–modification. Biology Letters. 2017;13(12). doi:10.1098/rsbl.2017.0646","ista":"Pleska M, Guet CC. 2017. Effects of mutations in phage restriction sites during escape from restriction–modification. Biology Letters. 13(12), 20170646.","chicago":"Pleska, Maros, and Calin C Guet. “Effects of Mutations in Phage Restriction Sites during Escape from Restriction–Modification.” Biology Letters. The Royal Society, 2017. https://doi.org/10.1098/rsbl.2017.0646.","short":"M. Pleska, C.C. Guet, Biology Letters 13 (2017)."},"quality_controlled":"1","author":[{"first_name":"Maros","last_name":"Pleska","orcid":"0000-0001-7460-7479","full_name":"Pleska, Maros","id":"4569785E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Guet","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052"}],"month":"12","date_created":"2018-12-11T11:47:11Z","status":"public","article_number":"20170646","intvolume":" 13","publist_id":"7253","article_type":"original","publisher":"The Royal Society","issue":"12","volume":13,"acknowledgement":"This work was funded by an HFSP Young Investigators' grant RGY0079/2011 (C.C.G.). M.P. is a recipient of a DOC Fellowship of the Austrian Academy of Science at the Institute of Science and Technology Austria.","department":[{"_id":"CaGu"}],"doi":"10.1098/rsbl.2017.0646","language":[{"iso":"eng"}],"oa_version":"Published Version","type":"journal_article","date_updated":"2023-09-07T11:59:32Z","day":"01","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","publication_identifier":{"issn":["1744-9561"]},"external_id":{"pmid":["29237814"]},"date_published":"2017-12-01T00:00:00Z"},{"abstract":[{"text":"This book is a concise and self-contained introduction of recent techniques to prove local spectral universality for large random matrices. Random matrix theory is a fast expanding research area, and this book mainly focuses on the methods that the authors participated in developing over the past few years. Many other interesting topics are not included, and neither are several new developments within the framework of these methods. The authors have chosen instead to present key concepts that they believe are the core of these methods and should be relevant for future applications. They keep technicalities to a minimum to make the book accessible to graduate students. With this in mind, they include in this book the basic notions and tools for high-dimensional analysis, such as large deviation, entropy, Dirichlet form, and the logarithmic Sobolev inequality.\r\n","lang":"eng"}],"publication_status":"published","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"}],"_id":"567","title":"A Dynamical Approach to Random Matrix Theory","year":"2017","author":[{"orcid":"0000-0001-5366-9603","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös"},{"last_name":"Yau","first_name":"Horng","full_name":"Yau, Horng"}],"quality_controlled":"1","citation":{"apa":"Erdös, L., & Yau, H. (2017). A Dynamical Approach to Random Matrix Theory (Vol. 28). American Mathematical Society. https://doi.org/10.1090/cln/028","mla":"Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix Theory. Vol. 28, American Mathematical Society, 2017, doi:10.1090/cln/028.","ieee":"L. Erdös and H. Yau, A Dynamical Approach to Random Matrix Theory, vol. 28. American Mathematical Society, 2017.","ama":"Erdös L, Yau H. A Dynamical Approach to Random Matrix Theory. Vol 28. American Mathematical Society; 2017. doi:10.1090/cln/028","ista":"Erdös L, Yau H. 2017. A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 226p.","chicago":"Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix Theory. Vol. 28. Courant Lecture Notes. American Mathematical Society, 2017. https://doi.org/10.1090/cln/028.","short":"L. Erdös, H. Yau, A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 2017."},"status":"public","month":"01","date_created":"2018-12-11T11:47:13Z","publist_id":"7247","intvolume":" 28","publisher":"American Mathematical Society","volume":28,"department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"doi":"10.1090/cln/028","ec_funded":1,"day":"01","oa_version":"None","date_updated":"2022-05-24T06:57:28Z","type":"book","series_title":"Courant Lecture Notes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","publication_identifier":{"eisbn":["978-1-4704-4194-4"],"isbn":["9-781-4704-3648-3"]},"alternative_title":["Courant Lecture Notes"],"page":"226","date_published":"2017-01-01T00:00:00Z"},{"publist_id":"7246","intvolume":" 19","status":"public","month":"01","date_created":"2018-12-11T11:47:14Z","issue":"2","volume":19,"publisher":"International Press","_id":"568","oa":1,"publication":"Homology, Homotopy and Applications","title":"Persistence of zero sets","abstract":[{"lang":"eng","text":"We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the family Z< r(f) := (g-1(0): ||g - f|| < r) of all zero sets of all continuous maps g closer to f than r in the max-norm. All of these sets are outside A := (x: |f(x)| ≥ r) and we claim that Z< r(f) is fully determined by A and an element of a certain cohomotopy group which (by a recent result) is computable whenever the dimension of X is at most 2n - 3. By considering all r > 0 simultaneously, the pointed cohomotopy groups form a persistence module-a structure leading to persistence diagrams as in the case of persistent homology or well groups. Eventually, we get a descriptor of persistent robust properties of zero sets that has better descriptive power (Theorem A) and better computability status (Theorem B) than the established well diagrams. Moreover, if we endow every point of each zero set with gradients of the perturbation, the robust description of the zero sets by elements of cohomotopy groups is in some sense the best possible (Theorem C)."}],"publication_status":"published","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"grant_number":"701309","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"author":[{"id":"473294AE-F248-11E8-B48F-1D18A9856A87","full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter"},{"full_name":"Krcál, Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","last_name":"Krcál"}],"quality_controlled":"1","citation":{"mla":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy and Applications, vol. 19, no. 2, International Press, 2017, pp. 313–42, doi:10.4310/HHA.2017.v19.n2.a16.","apa":"Franek, P., & Krcál, M. (2017). Persistence of zero sets. Homology, Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2017.v19.n2.a16","ista":"Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 313–342.","chicago":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy and Applications. International Press, 2017. https://doi.org/10.4310/HHA.2017.v19.n2.a16.","short":"P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.","ieee":"P. Franek and M. Krcál, “Persistence of zero sets,” Homology, Homotopy and Applications, vol. 19, no. 2. International Press, pp. 313–342, 2017.","ama":"Franek P, Krcál M. Persistence of zero sets. Homology, Homotopy and Applications. 2017;19(2):313-342. doi:10.4310/HHA.2017.v19.n2.a16"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1507.04310"}],"year":"2017","scopus_import":1,"publication_identifier":{"issn":["15320073"]},"page":"313 - 342","date_published":"2017-01-01T00:00:00Z","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"doi":"10.4310/HHA.2017.v19.n2.a16","language":[{"iso":"eng"}],"ec_funded":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Submitted Version","date_updated":"2021-01-12T08:03:12Z","type":"journal_article"},{"date_created":"2018-12-11T11:47:14Z","month":"11","article_number":"e30867","status":"public","intvolume":" 6","publist_id":"7245","file_date_updated":"2020-07-14T12:47:10Z","publisher":"eLife Sciences Publications","volume":6,"pubrep_id":"919","publication_status":"published","abstract":[{"text":"The actomyosin ring generates force to ingress the cytokinetic cleavage furrow in animal cells, yet its filament organization and the mechanism of contractility is not well understood. We quantified actin filament order in human cells using fluorescence polarization microscopy and found that cleavage furrow ingression initiates by contraction of an equatorial actin network with randomly oriented filaments. The network subsequently gradually reoriented actin filaments along the cell equator. This strictly depended on myosin II activity, suggesting local network reorganization by mechanical forces. Cortical laser microsurgery revealed that during cytokinesis progression, mechanical tension increased substantially along the direction of the cell equator, while the network contracted laterally along the pole-to-pole axis without a detectable increase in tension. Our data suggest that an asymmetric increase in cortical tension promotes filament reorientation along the cytokinetic cleavage furrow, which might have implications for diverse other biological processes involving actomyosin rings.","lang":"eng"}],"title":"Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments","publication":"eLife","ddc":["570"],"oa":1,"_id":"569","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","citation":{"ama":"Spira F, Cuylen Haering S, Mehta S, et al. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 2017;6. doi:10.7554/eLife.30867","ieee":"F. Spira et al., “Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments,” eLife, vol. 6. eLife Sciences Publications, 2017.","ista":"Spira F, Cuylen Haering S, Mehta S, Samwer M, Reversat A, Verma A, Oldenbourg R, Sixt MK, Gerlich D. 2017. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 6, e30867.","short":"F. Spira, S. Cuylen Haering, S. Mehta, M. Samwer, A. Reversat, A. Verma, R. Oldenbourg, M.K. Sixt, D. Gerlich, ELife 6 (2017).","chicago":"Spira, Felix, Sara Cuylen Haering, Shalin Mehta, Matthias Samwer, Anne Reversat, Amitabh Verma, Rudolf Oldenbourg, Michael K Sixt, and Daniel Gerlich. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.30867.","apa":"Spira, F., Cuylen Haering, S., Mehta, S., Samwer, M., Reversat, A., Verma, A., … Gerlich, D. (2017). Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.30867","mla":"Spira, Felix, et al. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” ELife, vol. 6, e30867, eLife Sciences Publications, 2017, doi:10.7554/eLife.30867."},"author":[{"full_name":"Spira, Felix","first_name":"Felix","last_name":"Spira"},{"full_name":"Cuylen Haering, Sara","first_name":"Sara","last_name":"Cuylen Haering"},{"full_name":"Mehta, Shalin","last_name":"Mehta","first_name":"Shalin"},{"last_name":"Samwer","first_name":"Matthias","full_name":"Samwer, Matthias"},{"last_name":"Reversat","first_name":"Anne","full_name":"Reversat, Anne","orcid":"0000-0003-0666-8928","id":"35B76592-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Verma, Amitabh","last_name":"Verma","first_name":"Amitabh"},{"first_name":"Rudolf","last_name":"Oldenbourg","full_name":"Oldenbourg, Rudolf"},{"last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"},{"first_name":"Daniel","last_name":"Gerlich","full_name":"Gerlich, Daniel"}],"quality_controlled":"1","publication_identifier":{"issn":["2050084X"]},"scopus_import":1,"date_published":"2017-11-06T00:00:00Z","file":[{"date_created":"2018-12-12T10:10:40Z","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":9666973,"date_updated":"2020-07-14T12:47:10Z","file_id":"4829","access_level":"open_access","checksum":"ba09c1451153d39e4f4b7cee013e314c","file_name":"IST-2017-919-v1+1_elife-30867-figures-v1.pdf"},{"file_size":5951246,"content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:10:41Z","relation":"main_file","access_level":"open_access","file_name":"IST-2017-919-v1+2_elife-30867-v1.pdf","checksum":"01eb51f1d6ad679947415a51c988e137","date_updated":"2020-07-14T12:47:10Z","file_id":"4830"}],"license":"https://creativecommons.org/licenses/by/4.0/","doi":"10.7554/eLife.30867","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"MiSi"}],"date_updated":"2023-02-23T12:30:29Z","type":"journal_article","oa_version":"Published Version","day":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publisher":"eLife Sciences Publications","file_date_updated":"2020-07-14T12:47:10Z","volume":6,"pubrep_id":"918","article_number":"e28921","status":"public","date_created":"2018-12-11T11:47:14Z","month":"11","publist_id":"7244","intvolume":" 6","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":[{"full_name":"Lagator, Mato","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","first_name":"Mato","last_name":"Lagator"},{"full_name":"Sarikas, Srdjan","id":"35F0286E-F248-11E8-B48F-1D18A9856A87","first_name":"Srdjan","last_name":"Sarikas"},{"id":"2DDF136A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1986-9753","full_name":"Acar, Hande","first_name":"Hande","last_name":"Acar"},{"orcid":"0000-0002-4624-4612","full_name":"Bollback, Jonathan P","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P","last_name":"Bollback"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","first_name":"Calin C","last_name":"Guet"}],"quality_controlled":"1","citation":{"ieee":"M. Lagator, S. Sarikas, H. Acar, J. P. Bollback, and C. C. Guet, “Regulatory network structure determines patterns of intermolecular epistasis,” eLife, vol. 6. eLife Sciences Publications, 2017.","ama":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 2017;6. doi:10.7554/eLife.28921","ista":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. 2017. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 6, e28921.","chicago":"Lagator, Mato, Srdjan Sarikas, Hande Acar, Jonathan P Bollback, and Calin C Guet. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.28921.","short":"M. Lagator, S. Sarikas, H. Acar, J.P. Bollback, C.C. Guet, ELife 6 (2017).","apa":"Lagator, M., Sarikas, S., Acar, H., Bollback, J. P., & Guet, C. C. (2017). Regulatory network structure determines patterns of intermolecular epistasis. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.28921","mla":"Lagator, Mato, et al. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife, vol. 6, e28921, eLife Sciences Publications, 2017, doi:10.7554/eLife.28921."},"publication_status":"published","abstract":[{"lang":"eng","text":"Most phenotypes are determined by molecular systems composed of specifically interacting molecules. However, unlike for individual components, little is known about the distributions of mutational effects of molecular systems as a whole. We ask how the distribution of mutational effects of a transcriptional regulatory system differs from the distributions of its components, by first independently, and then simultaneously, mutating a transcription factor and the associated promoter it represses. We find that the system distribution exhibits increased phenotypic variation compared to individual component distributions - an effect arising from intermolecular epistasis between the transcription factor and its DNA-binding site. In large part, this epistasis can be qualitatively attributed to the structure of the transcriptional regulatory system and could therefore be a common feature in prokaryotes. Counter-intuitively, intermolecular epistasis can alleviate the constraints of individual components, thereby increasing phenotypic variation that selection could act on and facilitating adaptive evolution. "}],"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"648440","name":"Selective Barriers to Horizontal Gene Transfer","call_identifier":"H2020","_id":"2578D616-B435-11E9-9278-68D0E5697425"}],"ddc":["576"],"oa":1,"_id":"570","publication":"eLife","title":"Regulatory network structure determines patterns of intermolecular epistasis","date_published":"2017-11-13T00:00:00Z","file":[{"date_updated":"2020-07-14T12:47:10Z","file_id":"5096","checksum":"273ab17f33305e4eaafd911ff88e7c5b","file_name":"IST-2017-918-v1+1_elife-28921-figures-v3.pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:14:42Z","file_size":8453470,"creator":"system","content_type":"application/pdf"},{"date_created":"2018-12-12T10:14:43Z","relation":"main_file","file_size":1953221,"creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:47:10Z","file_id":"5097","access_level":"open_access","file_name":"IST-2017-918-v1+2_elife-28921-v3.pdf","checksum":"b433f90576c7be597cd43367946f8e7f"}],"publication_identifier":{"issn":["2050084X"]},"scopus_import":1,"day":"13","date_updated":"2021-01-12T08:03:15Z","type":"journal_article","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.7554/eLife.28921","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"CaGu"},{"_id":"JoBo"},{"_id":"NiBa"}],"ec_funded":1},{"type":"journal_article","date_updated":"2021-01-12T08:03:15Z","oa_version":"None","day":"30","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"doi":"10.1016/j.cell.2017.11.001","language":[{"iso":"eng"}],"department":[{"_id":"MiSi"}],"date_published":"2017-11-30T00:00:00Z","page":"1368 - 1382","publication_identifier":{"issn":["00928674"]},"scopus_import":1,"year":"2017","citation":{"apa":"Gärtner, F. R., Ahmad, Z., Rosenberger, G., Fan, S., Nicolai, L., Busch, B., … Massberg, S. (2017). Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. Cell Press. https://doi.org/10.1016/j.cell.2017.11.001","mla":"Gärtner, Florian R., et al. “Migrating Platelets Are Mechano Scavengers That Collect and Bundle Bacteria.” Cell Press, vol. 171, no. 6, Cell Press, 2017, pp. 1368–82, doi:10.1016/j.cell.2017.11.001.","ieee":"F. R. Gärtner et al., “Migrating platelets are mechano scavengers that collect and bundle bacteria,” Cell Press, vol. 171, no. 6. Cell Press, pp. 1368–1382, 2017.","ama":"Gärtner FR, Ahmad Z, Rosenberger G, et al. Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. 2017;171(6):1368-1382. doi:10.1016/j.cell.2017.11.001","ista":"Gärtner FR, Ahmad Z, Rosenberger G, Fan S, Nicolai L, Busch B, Yavuz G, Luckner M, Ishikawa Ankerhold H, Hennel R, Benechet A, Lorenz M, Chandraratne S, Schubert I, Helmer S, Striednig B, Stark K, Janko M, Böttcher R, Verschoor A, Leon C, Gachet C, Gudermann T, Mederos Y Schnitzler M, Pincus Z, Iannacone M, Haas R, Wanner G, Lauber K, Sixt MK, Massberg S. 2017. Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. 171(6), 1368–1382.","chicago":"Gärtner, Florian R, Zerkah Ahmad, Gerhild Rosenberger, Shuxia Fan, Leo Nicolai, Benjamin Busch, Gökce Yavuz, et al. “Migrating Platelets Are Mechano Scavengers That Collect and Bundle Bacteria.” Cell Press. Cell Press, 2017. https://doi.org/10.1016/j.cell.2017.11.001.","short":"F.R. Gärtner, Z. Ahmad, G. Rosenberger, S. Fan, L. Nicolai, B. Busch, G. Yavuz, M. Luckner, H. Ishikawa Ankerhold, R. Hennel, A. Benechet, M. Lorenz, S. Chandraratne, I. Schubert, S. Helmer, B. Striednig, K. Stark, M. Janko, R. Böttcher, A. Verschoor, C. Leon, C. Gachet, T. Gudermann, M. Mederos Y Schnitzler, Z. Pincus, M. Iannacone, R. Haas, G. Wanner, K. Lauber, M.K. Sixt, S. Massberg, Cell Press 171 (2017) 1368–1382."},"quality_controlled":"1","author":[{"last_name":"Gärtner","first_name":"Florian R","orcid":"0000-0001-6120-3723","full_name":"Gärtner, Florian R","id":"397A88EE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Zerkah","last_name":"Ahmad","full_name":"Ahmad, Zerkah"},{"first_name":"Gerhild","last_name":"Rosenberger","full_name":"Rosenberger, Gerhild"},{"full_name":"Fan, Shuxia","last_name":"Fan","first_name":"Shuxia"},{"first_name":"Leo","last_name":"Nicolai","full_name":"Nicolai, Leo"},{"last_name":"Busch","first_name":"Benjamin","full_name":"Busch, Benjamin"},{"full_name":"Yavuz, Gökce","last_name":"Yavuz","first_name":"Gökce"},{"full_name":"Luckner, Manja","first_name":"Manja","last_name":"Luckner"},{"full_name":"Ishikawa Ankerhold, Hellen","first_name":"Hellen","last_name":"Ishikawa Ankerhold"},{"full_name":"Hennel, Roman","last_name":"Hennel","first_name":"Roman"},{"full_name":"Benechet, Alexandre","last_name":"Benechet","first_name":"Alexandre"},{"full_name":"Lorenz, Michael","last_name":"Lorenz","first_name":"Michael"},{"full_name":"Chandraratne, Sue","first_name":"Sue","last_name":"Chandraratne"},{"full_name":"Schubert, Irene","last_name":"Schubert","first_name":"Irene"},{"full_name":"Helmer, Sebastian","last_name":"Helmer","first_name":"Sebastian"},{"last_name":"Striednig","first_name":"Bianca","full_name":"Striednig, Bianca"},{"first_name":"Konstantin","last_name":"Stark","full_name":"Stark, Konstantin"},{"full_name":"Janko, Marek","last_name":"Janko","first_name":"Marek"},{"full_name":"Böttcher, Ralph","last_name":"Böttcher","first_name":"Ralph"},{"last_name":"Verschoor","first_name":"Admar","full_name":"Verschoor, Admar"},{"last_name":"Leon","first_name":"Catherine","full_name":"Leon, Catherine"},{"first_name":"Christian","last_name":"Gachet","full_name":"Gachet, Christian"},{"last_name":"Gudermann","first_name":"Thomas","full_name":"Gudermann, Thomas"},{"full_name":"Mederos Y Schnitzler, Michael","last_name":"Mederos Y Schnitzler","first_name":"Michael"},{"first_name":"Zachary","last_name":"Pincus","full_name":"Pincus, Zachary"},{"full_name":"Iannacone, Matteo","first_name":"Matteo","last_name":"Iannacone"},{"full_name":"Haas, Rainer","last_name":"Haas","first_name":"Rainer"},{"last_name":"Wanner","first_name":"Gerhard","full_name":"Wanner, Gerhard"},{"last_name":"Lauber","first_name":"Kirsten","full_name":"Lauber, Kirsten"},{"first_name":"Michael K","last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Massberg, Steffen","last_name":"Massberg","first_name":"Steffen"}],"project":[{"call_identifier":"H2020","_id":"260AA4E2-B435-11E9-9278-68D0E5697425","name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells","grant_number":"747687"}],"publication_status":"published","abstract":[{"lang":"eng","text":"Blood platelets are critical for hemostasis and thrombosis and play diverse roles during immune responses. Despite these versatile tasks in mammalian biology, their skills on a cellular level are deemed limited, mainly consisting in rolling, adhesion, and aggregate formation. Here, we identify an unappreciated asset of platelets and show that adherent platelets use adhesion receptors to mechanically probe the adhesive substrate in their local microenvironment. When actomyosin-dependent traction forces overcome substrate resistance, platelets migrate and pile up the adhesive substrate together with any bound particulate material. They use this ability to act as cellular scavengers, scanning the vascular surface for potential invaders and collecting deposited bacteria. Microbe collection by migrating platelets boosts the activity of professional phagocytes, exacerbating inflammatory tissue injury in sepsis. This assigns platelets a central role in innate immune responses and identifies them as potential targets to dampen inflammatory tissue damage in clinical scenarios of severe systemic infection. In addition to their role in thrombosis and hemostasis, platelets can also migrate to sites of infection to help trap bacteria and clear the vascular surface."}],"title":"Migrating platelets are mechano scavengers that collect and bundle bacteria","publication":"Cell Press","_id":"571","publisher":"Cell Press","issue":"6","volume":171,"date_created":"2018-12-11T11:47:15Z","month":"11","status":"public","intvolume":" 171","publist_id":"7243"},{"scopus_import":"1","file":[{"creator":"system","content_type":"application/pdf","file_size":920962,"relation":"main_file","date_created":"2018-12-12T10:08:55Z","checksum":"82d51f11e493f7eec02976d9a9a9805e","file_name":"IST-2017-917-v1+1_ijms-18-02587.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:10Z","file_id":"4718"}],"date_published":"2017-12-01T00:00:00Z","department":[{"_id":"JiFr"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.3390/ijms18122587","article_processing_charge":"No","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Published Version","date_updated":"2021-01-12T08:03:16Z","type":"journal_article","publist_id":"7242","intvolume":" 18","status":"public","article_number":"2587","month":"12","date_created":"2018-12-11T11:47:15Z","pubrep_id":"917","volume":18,"issue":"12","publisher":"MDPI","file_date_updated":"2020-07-14T12:47:10Z","_id":"572","oa":1,"ddc":["580"],"title":"Control of endogenous auxin levels in plant root development","publication":"International Journal of Molecular Sciences","abstract":[{"lang":"eng","text":"In this review, we summarize the different biosynthesis-related pathways that contribute to the regulation of endogenous auxin in plants. We demonstrate that all known genes involved in auxin biosynthesis also have a role in root formation, from the initiation of a root meristem during embryogenesis to the generation of a functional root system with a primary root, secondary lateral root branches and adventitious roots. Furthermore, the versatile adaptation of root development in response to environmental challenges is mediated by both local and distant control of auxin biosynthesis. In conclusion, auxin homeostasis mediated by spatial and temporal regulation of auxin biosynthesis plays a central role in determining root architecture."}],"publication_status":"published","quality_controlled":"1","author":[{"full_name":"Olatunji, Damilola","first_name":"Damilola","last_name":"Olatunji"},{"last_name":"Geelen","first_name":"Danny","full_name":"Geelen, Danny"},{"orcid":"0000-0001-7241-2328","full_name":"Verstraeten, Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","last_name":"Verstraeten","first_name":"Inge"}],"citation":{"ieee":"D. Olatunji, D. Geelen, and I. Verstraeten, “Control of endogenous auxin levels in plant root development,” International Journal of Molecular Sciences, vol. 18, no. 12. MDPI, 2017.","ama":"Olatunji D, Geelen D, Verstraeten I. Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. 2017;18(12). doi:10.3390/ijms18122587","chicago":"Olatunji, Damilola, Danny Geelen, and Inge Verstraeten. “Control of Endogenous Auxin Levels in Plant Root Development.” International Journal of Molecular Sciences. MDPI, 2017. https://doi.org/10.3390/ijms18122587.","short":"D. Olatunji, D. Geelen, I. Verstraeten, International Journal of Molecular Sciences 18 (2017).","ista":"Olatunji D, Geelen D, Verstraeten I. 2017. Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. 18(12), 2587.","mla":"Olatunji, Damilola, et al. “Control of Endogenous Auxin Levels in Plant Root Development.” International Journal of Molecular Sciences, vol. 18, no. 12, 2587, MDPI, 2017, doi:10.3390/ijms18122587.","apa":"Olatunji, D., Geelen, D., & Verstraeten, I. (2017). Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms18122587"},"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"}},{"citation":{"apa":"Biswas, R., & Bhowmick, P. (2017). Construction of persistent Voronoi diagram on 3D digital plane. In Combinatorial image analysis (Vol. 10256, pp. 93–104). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-59108-7_8","mla":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” Combinatorial Image Analysis, vol. 10256, Springer Nature, 2017, pp. 93–104, doi:10.1007/978-3-319-59108-7_8.","ista":"Biswas R, Bhowmick P. 2017.Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial image analysis. LNCS, vol. 10256, 93–104.","short":"R. Biswas, P. Bhowmick, in:, Combinatorial Image Analysis, Springer Nature, Cham, 2017, pp. 93–104.","chicago":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” In Combinatorial Image Analysis, 10256:93–104. Cham: Springer Nature, 2017. https://doi.org/10.1007/978-3-319-59108-7_8.","ieee":"R. Biswas and P. Bhowmick, “Construction of persistent Voronoi diagram on 3D digital plane,” in Combinatorial image analysis, vol. 10256, Cham: Springer Nature, 2017, pp. 93–104.","ama":"Biswas R, Bhowmick P. Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial Image Analysis. Vol 10256. Cham: Springer Nature; 2017:93-104. doi:10.1007/978-3-319-59108-7_8"},"quality_controlled":"1","author":[{"id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita","first_name":"Ranita","last_name":"Biswas"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"}],"extern":"1","year":"2017","title":"Construction of persistent Voronoi diagram on 3D digital plane","publication":"Combinatorial image analysis","_id":"5803","abstract":[{"lang":"eng","text":"Different distance metrics produce Voronoi diagrams with different properties. It is a well-known that on the (real) 2D plane or even on any 3D plane, a Voronoi diagram (VD) based on the Euclidean distance metric produces convex Voronoi regions. In this paper, we first show that this metric produces a persistent VD on the 2D digital plane, as it comprises digitally convex Voronoi regions and hence correctly approximates the corresponding VD on the 2D real plane. Next, we show that on a 3D digital plane D, the Euclidean metric spanning over its voxel set does not guarantee a digital VD which is persistent with the real-space VD. As a solution, we introduce a novel concept of functional-plane-convexity, which is ensured by the Euclidean metric spanning over the pedal set of D. Necessary proofs and some visual result have been provided to adjudge the merit and usefulness of the proposed concept."}],"publication_status":"published","volume":10256,"publisher":"Springer Nature","intvolume":" 10256","place":"Cham","month":"05","conference":{"end_date":"2017-06-21","name":"IWCIA: International Workshop on Combinatorial Image Analysis","start_date":"2017-06-19","location":"Plovdiv, Bulgaria"},"date_created":"2019-01-08T20:42:56Z","status":"public","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","oa_version":"None","type":"book_chapter","date_updated":"2022-01-28T07:48:24Z","day":"17","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-59108-7_8","date_published":"2017-05-17T00:00:00Z","page":"93-104","alternative_title":["LNCS"],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["978-3-319-59107-0","978-3-319-59108-7"]}},{"publisher":"American Physical Society","volume":119,"issue":"2","article_number":"023201","status":"public","month":"07","date_created":"2019-02-14T15:24:13Z","intvolume":" 119","year":"2017","author":[{"last_name":"Camus","first_name":"Nicolas","full_name":"Camus, Nicolas"},{"full_name":"Yakaboylu, Enderalp","orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","last_name":"Yakaboylu","first_name":"Enderalp"},{"full_name":"Fechner, Lutz","first_name":"Lutz","last_name":"Fechner"},{"first_name":"Michael","last_name":"Klaiber","full_name":"Klaiber, Michael"},{"last_name":"Laux","first_name":"Martin","full_name":"Laux, Martin"},{"last_name":"Mi","first_name":"Yonghao","full_name":"Mi, Yonghao"},{"last_name":"Hatsagortsyan","first_name":"Karen Z.","full_name":"Hatsagortsyan, Karen Z."},{"full_name":"Pfeifer, Thomas","first_name":"Thomas","last_name":"Pfeifer"},{"full_name":"Keitel, Christoph H.","first_name":"Christoph H.","last_name":"Keitel"},{"full_name":"Moshammer, Robert","first_name":"Robert","last_name":"Moshammer"}],"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1611.03701","open_access":"1"}],"citation":{"short":"N. Camus, E. Yakaboylu, L. Fechner, M. Klaiber, M. Laux, Y. Mi, K.Z. Hatsagortsyan, T. Pfeifer, C.H. Keitel, R. Moshammer, Physical Review Letters 119 (2017).","chicago":"Camus, Nicolas, Enderalp Yakaboylu, Lutz Fechner, Michael Klaiber, Martin Laux, Yonghao Mi, Karen Z. Hatsagortsyan, Thomas Pfeifer, Christoph H. Keitel, and Robert Moshammer. “Experimental Evidence for Quantum Tunneling Time.” Physical Review Letters. American Physical Society, 2017. https://doi.org/10.1103/PhysRevLett.119.023201.","ista":"Camus N, Yakaboylu E, Fechner L, Klaiber M, Laux M, Mi Y, Hatsagortsyan KZ, Pfeifer T, Keitel CH, Moshammer R. 2017. Experimental evidence for quantum tunneling time. Physical Review Letters. 119(2), 023201.","ama":"Camus N, Yakaboylu E, Fechner L, et al. Experimental evidence for quantum tunneling time. Physical Review Letters. 2017;119(2). doi:10.1103/PhysRevLett.119.023201","ieee":"N. Camus et al., “Experimental evidence for quantum tunneling time,” Physical Review Letters, vol. 119, no. 2. American Physical Society, 2017.","mla":"Camus, Nicolas, et al. “Experimental Evidence for Quantum Tunneling Time.” Physical Review Letters, vol. 119, no. 2, 023201, American Physical Society, 2017, doi:10.1103/PhysRevLett.119.023201.","apa":"Camus, N., Yakaboylu, E., Fechner, L., Klaiber, M., Laux, M., Mi, Y., … Moshammer, R. (2017). Experimental evidence for quantum tunneling time. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.119.023201"},"abstract":[{"text":"The first hundred attoseconds of the electron dynamics during strong field tunneling ionization are investigated. We quantify theoretically how the electron’s classical trajectories in the continuum emerge from the tunneling process and test the results with those achieved in parallel from attoclock measurements. An especially high sensitivity on the tunneling barrier is accomplished here by comparing the momentum distributions of two atomic species of slightly deviating atomic potentials (argon and krypton) being ionized under absolutely identical conditions with near-infrared laser pulses (1300 nm). The agreement between experiment and theory provides clear evidence for a nonzero tunneling time delay and a nonvanishing longitudinal momentum of the electron at the “tunnel exit.”","lang":"eng"}],"publication_status":"published","_id":"6013","oa":1,"related_material":{"record":[{"id":"313","status":"public","relation":"earlier_version"}]},"publication":"Physical Review Letters","title":"Experimental evidence for quantum tunneling time","external_id":{"arxiv":["1611.03701"]},"date_published":"2017-07-14T00:00:00Z","arxiv":1,"scopus_import":1,"publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"day":"14","oa_version":"Preprint","date_updated":"2023-02-23T11:13:36Z","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MiLe"}],"doi":"10.1103/PhysRevLett.119.023201","language":[{"iso":"eng"}]},{"date_updated":"2021-01-12T08:05:50Z","series_title":"Theoretical and Computational Chemistry Series","type":"book_chapter","oa_version":"Submitted Version","day":"14","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"doi":"10.1039/9781782626800-00444","department":[{"_id":"MiLe"}],"date_published":"2017-12-14T00:00:00Z","page":"444 - 495","alternative_title":["Theoretical and Computational Chemistry Series"],"publication_identifier":{"issn":["20413181"]},"scopus_import":1,"year":"2017","main_file_link":[{"url":"https://arxiv.org/abs/1703.06753","open_access":"1"}],"citation":{"ista":"Lemeshko M, Schmidt R. 2017.Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero . Theoretical and Computational Chemistry Series, vol. 11, 444–495.","chicago":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” In Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , edited by Oliver Dulieu and Andreas Osterwalder, 11:444–95. Theoretical and Computational Chemistry Series. The Royal Society of Chemistry, 2017. https://doi.org/10.1039/9781782626800-00444.","short":"M. Lemeshko, R. Schmidt, in:, O. Dulieu, A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , The Royal Society of Chemistry, 2017, pp. 444–495.","ieee":"M. Lemeshko and R. Schmidt, “Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets,” in Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , vol. 11, O. Dulieu and A. Osterwalder, Eds. The Royal Society of Chemistry, 2017, pp. 444–495.","ama":"Lemeshko M, Schmidt R. Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Dulieu O, Osterwalder A, eds. Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero . Vol 11. Theoretical and Computational Chemistry Series. The Royal Society of Chemistry; 2017:444-495. doi:10.1039/9781782626800-00444","mla":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , edited by Oliver Dulieu and Andreas Osterwalder, vol. 11, The Royal Society of Chemistry, 2017, pp. 444–95, doi:10.1039/9781782626800-00444.","apa":"Lemeshko, M., & Schmidt, R. (2017). Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In O. Dulieu & A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero (Vol. 11, pp. 444–495). The Royal Society of Chemistry. https://doi.org/10.1039/9781782626800-00444"},"author":[{"last_name":"Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Richard","last_name":"Schmidt","full_name":"Schmidt, Richard"}],"quality_controlled":"1","publication_status":"published","abstract":[{"lang":"eng","text":"In several settings of physics and chemistry one has to deal with molecules interacting with some kind of an external environment, be it a gas, a solution, or a crystal surface. Understanding molecular processes in the presence of such a many-particle bath is inherently challenging, and usually requires large-scale numerical computations. Here, we present an alternative approach to the problem, based on the notion of the angulon quasiparticle. We show that molecules rotating inside superfluid helium nanodroplets and Bose–Einstein condensates form angulons, and therefore can be described by straightforward solutions of a simple microscopic Hamiltonian. Casting the problem in the language of angulons allows us not only to greatly simplify it, but also to gain insights into the origins of the observed phenomena and to make predictions for future experimental studies."}],"publication":"Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero ","title":"Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets","oa":1,"_id":"604","publisher":"The Royal Society of Chemistry","editor":[{"first_name":"Oliver","last_name":"Dulieu","full_name":"Dulieu, Oliver"},{"last_name":"Osterwalder","first_name":"Andreas","full_name":"Osterwalder, Andreas"}],"volume":11,"date_created":"2018-12-11T11:47:27Z","month":"12","status":"public","intvolume":" 11","publist_id":"7201"},{"doi":"10.1007/978-3-319-70500-2_3","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"ec_funded":1,"day":"05","date_updated":"2021-01-12T08:05:53Z","type":"conference","oa_version":"Submitted Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["978-331970499-9"]},"scopus_import":1,"alternative_title":["LNCS"],"page":"56 - 81","date_published":"2017-11-05T00:00:00Z","publication_status":"published","abstract":[{"text":"Position based cryptography (PBC), proposed in the seminal work of Chandran, Goyal, Moriarty, and Ostrovsky (SIAM J. Computing, 2014), aims at constructing cryptographic schemes in which the identity of the user is his geographic position. Chandran et al. construct PBC schemes for secure positioning and position-based key agreement in the bounded-storage model (Maurer, J. Cryptology, 1992). Apart from bounded memory, their security proofs need a strong additional restriction on the power of the adversary: he cannot compute joint functions of his inputs. Removing this assumption is left as an open problem. We show that an answer to this question would resolve a long standing open problem in multiparty communication complexity: finding a function that is hard to compute with low communication complexity in the simultaneous message model, but easy to compute in the fully adaptive model. On a more positive side: we also show some implications in the other direction, i.e.: we prove that lower bounds on the communication complexity of certain multiparty problems imply existence of PBC primitives. Using this result we then show two attractive ways to “bypass” our hardness result: the first uses the random oracle model, the second weakens the locality requirement in the bounded-storage model to online computability. The random oracle construction is arguably one of the simplest proposed so far in this area. Our results indicate that constructing improved provably secure protocols for PBC requires a better understanding of multiparty communication complexity. This is yet another example where negative results in one area (in our case: lower bounds in multiparty communication complexity) can be used to construct secure cryptographic schemes.","lang":"eng"}],"project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"oa":1,"_id":"605","title":"Position based cryptography and multiparty communication complexity","year":"2017","quality_controlled":"1","author":[{"full_name":"Brody, Joshua","first_name":"Joshua","last_name":"Brody"},{"last_name":"Dziembowski","first_name":"Stefan","full_name":"Dziembowski, Stefan"},{"first_name":"Sebastian","last_name":"Faust","full_name":"Faust, Sebastian"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z"}],"citation":{"ista":"Brody J, Dziembowski S, Faust S, Pietrzak KZ. 2017. Position based cryptography and multiparty communication complexity. TCC: Theory of Cryptography Conference, LNCS, vol. 10677, 56–81.","short":"J. Brody, S. Dziembowski, S. Faust, K.Z. Pietrzak, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 56–81.","chicago":"Brody, Joshua, Stefan Dziembowski, Sebastian Faust, and Krzysztof Z Pietrzak. “Position Based Cryptography and Multiparty Communication Complexity.” edited by Yael Kalai and Leonid Reyzin, 10677:56–81. Springer, 2017. https://doi.org/10.1007/978-3-319-70500-2_3.","ama":"Brody J, Dziembowski S, Faust S, Pietrzak KZ. Position based cryptography and multiparty communication complexity. In: Kalai Y, Reyzin L, eds. Vol 10677. Springer; 2017:56-81. doi:10.1007/978-3-319-70500-2_3","ieee":"J. Brody, S. Dziembowski, S. Faust, and K. Z. Pietrzak, “Position based cryptography and multiparty communication complexity,” presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States, 2017, vol. 10677, pp. 56–81.","apa":"Brody, J., Dziembowski, S., Faust, S., & Pietrzak, K. Z. (2017). Position based cryptography and multiparty communication complexity. In Y. Kalai & L. Reyzin (Eds.) (Vol. 10677, pp. 56–81). Presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States: Springer. https://doi.org/10.1007/978-3-319-70500-2_3","mla":"Brody, Joshua, et al. Position Based Cryptography and Multiparty Communication Complexity. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 56–81, doi:10.1007/978-3-319-70500-2_3."},"main_file_link":[{"url":"https://eprint.iacr.org/2016/536","open_access":"1"}],"status":"public","date_created":"2018-12-11T11:47:27Z","month":"11","conference":{"start_date":"2017-11-12","location":"Baltimore, MD, United States","name":"TCC: Theory of Cryptography Conference","end_date":"2017-11-15"},"publist_id":"7200","intvolume":" 10677","publisher":"Springer","editor":[{"full_name":"Kalai, Yael","last_name":"Kalai","first_name":"Yael"},{"first_name":"Leonid","last_name":"Reyzin","full_name":"Reyzin, Leonid"}],"volume":10677},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"conference","date_updated":"2021-01-12T08:06:04Z","oa_version":"Submitted Version","day":"05","doi":"10.1007/978-3-319-70500-2_17","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"date_published":"2017-11-05T00:00:00Z","page":"493 - 526","alternative_title":["LNCS"],"publication_identifier":{"isbn":["978-331970499-9"]},"scopus_import":1,"citation":{"mla":"Alwen, Joel F., and Björn Tackmann. Moderately Hard Functions: Definition, Instantiations, and Applications. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 493–526, doi:10.1007/978-3-319-70500-2_17.","apa":"Alwen, J. F., & Tackmann, B. (2017). Moderately hard functions: Definition, instantiations, and applications. In Y. Kalai & L. Reyzin (Eds.) (Vol. 10677, pp. 493–526). Presented at the TCC: Theory of Cryptography, Baltimore, MD, United States: Springer. https://doi.org/10.1007/978-3-319-70500-2_17","ista":"Alwen JF, Tackmann B. 2017. Moderately hard functions: Definition, instantiations, and applications. TCC: Theory of Cryptography, LNCS, vol. 10677, 493–526.","chicago":"Alwen, Joel F, and Björn Tackmann. “Moderately Hard Functions: Definition, Instantiations, and Applications.” edited by Yael Kalai and Leonid Reyzin, 10677:493–526. Springer, 2017. https://doi.org/10.1007/978-3-319-70500-2_17.","short":"J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.","ama":"Alwen JF, Tackmann B. Moderately hard functions: Definition, instantiations, and applications. In: Kalai Y, Reyzin L, eds. Vol 10677. Springer; 2017:493-526. doi:10.1007/978-3-319-70500-2_17","ieee":"J. F. Alwen and B. Tackmann, “Moderately hard functions: Definition, instantiations, and applications,” presented at the TCC: Theory of Cryptography, Baltimore, MD, United States, 2017, vol. 10677, pp. 493–526."},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/945"}],"author":[{"full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","last_name":"Alwen"},{"last_name":"Tackmann","first_name":"Björn","full_name":"Tackmann, Björn"}],"quality_controlled":"1","year":"2017","title":"Moderately hard functions: Definition, instantiations, and applications","oa":1,"_id":"609","publication_status":"published","abstract":[{"lang":"eng","text":"Several cryptographic schemes and applications are based on functions that are both reasonably efficient to compute and moderately hard to invert, including client puzzles for Denial-of-Service protection, password protection via salted hashes, or recent proof-of-work blockchain systems. Despite their wide use, a definition of this concept has not yet been distilled and formalized explicitly. Instead, either the applications are proven directly based on the assumptions underlying the function, or some property of the function is proven, but the security of the application is argued only informally. The goal of this work is to provide a (universal) definition that decouples the efforts of designing new moderately hard functions and of building protocols based on them, serving as an interface between the two. On a technical level, beyond the mentioned definitions, we instantiate the model for four different notions of hardness. We extend the work of Alwen and Serbinenko (STOC 2015) by providing a general tool for proving security for the first notion of memory-hard functions that allows for provably secure applications. The tool allows us to recover all of the graph-theoretic techniques developed for proving security under the older, non-composable, notion of security used by Alwen and Serbinenko. As an application of our definition of moderately hard functions, we prove the security of two different schemes for proofs of effort (PoE). We also formalize and instantiate the concept of a non-interactive proof of effort (niPoE), in which the proof is not bound to a particular communication context but rather any bit-string chosen by the prover."}],"volume":10677,"publisher":"Springer","editor":[{"first_name":"Yael","last_name":"Kalai","full_name":"Kalai, Yael"},{"full_name":"Reyzin, Leonid","first_name":"Leonid","last_name":"Reyzin"}],"intvolume":" 10677","publist_id":"7196","date_created":"2018-12-11T11:47:28Z","month":"11","conference":{"start_date":"2017-11-12","location":"Baltimore, MD, United States","end_date":"2017-11-15","name":"TCC: Theory of Cryptography"},"status":"public"},{"issue":"2","volume":222,"publisher":"Springer","intvolume":" 222","publist_id":"7194","date_created":"2018-12-11T11:47:29Z","month":"10","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1610.09063"}],"citation":{"mla":"Goaoc, Xavier, et al. “On Generalized Heawood Inequalities for Manifolds: A van Kampen–Flores Type Nonembeddability Result.” Israel Journal of Mathematics, vol. 222, no. 2, Springer, 2017, pp. 841–66, doi:10.1007/s11856-017-1607-7.","apa":"Goaoc, X., Mabillard, I., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2017). On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-017-1607-7","short":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, Israel Journal of Mathematics 222 (2017) 841–866.","chicago":"Goaoc, Xavier, Isaac Mabillard, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “On Generalized Heawood Inequalities for Manifolds: A van Kampen–Flores Type Nonembeddability Result.” Israel Journal of Mathematics. Springer, 2017. https://doi.org/10.1007/s11856-017-1607-7.","ista":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. 2017. On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. 222(2), 841–866.","ama":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. 2017;222(2):841-866. doi:10.1007/s11856-017-1607-7","ieee":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result,” Israel Journal of Mathematics, vol. 222, no. 2. Springer, pp. 841–866, 2017."},"quality_controlled":"1","author":[{"first_name":"Xavier","last_name":"Goaoc","full_name":"Goaoc, Xavier"},{"full_name":"Mabillard, Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","first_name":"Isaac","last_name":"Mabillard"},{"last_name":"Paták","first_name":"Pavel","full_name":"Paták, Pavel"},{"last_name":"Patakova","first_name":"Zuzana","orcid":"0000-0002-3975-1683","full_name":"Patakova, Zuzana","id":"48B57058-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tancer","first_name":"Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714"},{"first_name":"Uli","last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"year":"2017","publication":"Israel Journal of Mathematics","title":"On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1511"}]},"oa":1,"_id":"610","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"publication_status":"published","abstract":[{"lang":"eng","text":"The fact that the complete graph K5 does not embed in the plane has been generalized in two independent directions. On the one hand, the solution of the classical Heawood problem for graphs on surfaces established that the complete graph Kn embeds in a closed surface M (other than the Klein bottle) if and only if (n−3)(n−4) ≤ 6b1(M), where b1(M) is the first Z2-Betti number of M. On the other hand, van Kampen and Flores proved that the k-skeleton of the n-dimensional simplex (the higher-dimensional analogue of Kn+1) embeds in R2k if and only if n ≤ 2k + 1. Two decades ago, Kühnel conjectured that the k-skeleton of the n-simplex embeds in a compact, (k − 1)-connected 2k-manifold with kth Z2-Betti number bk only if the following generalized Heawood inequality holds: (k+1 n−k−1) ≤ (k+1 2k+1)bk. This is a common generalization of the case of graphs on surfaces as well as the van Kampen–Flores theorem. In the spirit of Kühnel’s conjecture, we prove that if the k-skeleton of the n-simplex embeds in a compact 2k-manifold with kth Z2-Betti number bk, then n ≤ 2bk(k 2k+2)+2k+4. This bound is weaker than the generalized Heawood inequality, but does not require the assumption that M is (k−1)-connected. Our results generalize to maps without q-covered points, in the spirit of Tverberg’s theorem, for q a prime power. Our proof uses a result of Volovikov about maps that satisfy a certain homological triviality condition."}],"date_published":"2017-10-01T00:00:00Z","page":"841 - 866","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T10:02:13Z","type":"journal_article","oa_version":"Preprint","day":"01","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.1007/s11856-017-1607-7","department":[{"_id":"UlWa"}],"acknowledgement":"The work by Z. P. was partially supported by the Israel Science Foundation grant ISF-768/12. The work by Z. P. and M. T. was partially supported by the project CE-ITI (GACR P202/12/G061) of the Czech Science Foundation and by the ERC Advanced Grant No. 267165. Part of the research work of M.T. was conducted at IST Austria, supported by an IST Fellowship. The research of P. P. was supported by the ERC Advanced grant no. 320924. The work by I. M. and U. W. was supported by the Swiss National Science Foundation (grants SNSF-200020-138230 and SNSF-PP00P2-138948). The collaboration between U. W. and X. G. was partially supported by the LabEx Bézout (ANR-10-LABX-58)."},{"publisher":"American Association for the Advancement of Science","date_published":"2017-11-17T00:00:00Z","volume":358,"issue":"6365","page":"925 - 928","date_created":"2018-12-11T11:47:29Z","month":"11","status":"public","intvolume":" 358","publist_id":"7193","publication_identifier":{"issn":["00368075"]},"scopus_import":1,"type":"journal_article","date_updated":"2021-01-12T08:06:10Z","oa_version":"None","day":"17","year":"2017","citation":{"short":"D. Bradley, P. Xu, I. Mohorianu, A. Whibley, D. Field, H. Tavares, M. Couchman, L. Copsey, R. Carpenter, M. Li, Q. Li, Y. Xue, T. Dalmay, E. Coen, Science 358 (2017) 925–928.","chicago":"Bradley, Desmond, Ping Xu, Irina Mohorianu, Annabel Whibley, David Field, Hugo Tavares, Matthew Couchman, et al. “Evolution of Flower Color Pattern through Selection on Regulatory Small RNAs.” Science. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/science.aao3526.","ista":"Bradley D, Xu P, Mohorianu I, Whibley A, Field D, Tavares H, Couchman M, Copsey L, Carpenter R, Li M, Li Q, Xue Y, Dalmay T, Coen E. 2017. Evolution of flower color pattern through selection on regulatory small RNAs. Science. 358(6365), 925–928.","ama":"Bradley D, Xu P, Mohorianu I, et al. Evolution of flower color pattern through selection on regulatory small RNAs. Science. 2017;358(6365):925-928. doi:10.1126/science.aao3526","ieee":"D. Bradley et al., “Evolution of flower color pattern through selection on regulatory small RNAs,” Science, vol. 358, no. 6365. American Association for the Advancement of Science, pp. 925–928, 2017.","apa":"Bradley, D., Xu, P., Mohorianu, I., Whibley, A., Field, D., Tavares, H., … Coen, E. (2017). Evolution of flower color pattern through selection on regulatory small RNAs. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aao3526","mla":"Bradley, Desmond, et al. “Evolution of Flower Color Pattern through Selection on Regulatory Small RNAs.” Science, vol. 358, no. 6365, American Association for the Advancement of Science, 2017, pp. 925–28, doi:10.1126/science.aao3526."},"quality_controlled":"1","author":[{"first_name":"Desmond","last_name":"Bradley","full_name":"Bradley, Desmond"},{"last_name":"Xu","first_name":"Ping","full_name":"Xu, Ping"},{"last_name":"Mohorianu","first_name":"Irina","full_name":"Mohorianu, Irina"},{"last_name":"Whibley","first_name":"Annabel","full_name":"Whibley, Annabel"},{"first_name":"David","last_name":"Field","full_name":"Field, David","orcid":"0000-0002-4014-8478","id":"419049E2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tavares","first_name":"Hugo","full_name":"Tavares, Hugo"},{"full_name":"Couchman, Matthew","last_name":"Couchman","first_name":"Matthew"},{"last_name":"Copsey","first_name":"Lucy","full_name":"Copsey, Lucy"},{"full_name":"Carpenter, Rosemary","first_name":"Rosemary","last_name":"Carpenter"},{"full_name":"Li, Miaomiao","first_name":"Miaomiao","last_name":"Li"},{"first_name":"Qun","last_name":"Li","full_name":"Li, Qun"},{"full_name":"Xue, Yongbiao","first_name":"Yongbiao","last_name":"Xue"},{"full_name":"Dalmay, Tamas","last_name":"Dalmay","first_name":"Tamas"},{"first_name":"Enrico","last_name":"Coen","full_name":"Coen, Enrico"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"text":"Small RNAs (sRNAs) regulate genes in plants and animals. Here, we show that population-wide differences in color patterns in snapdragon flowers are caused by an inverted duplication that generates sRNAs. The complexity and size of the transcripts indicate that the duplication represents an intermediate on the pathway to microRNA evolution. The sRNAs repress a pigment biosynthesis gene, creating a yellow highlight at the site of pollinator entry. The inverted duplication exhibits steep clines in allele frequency in a natural hybrid zone, showing that the allele is under selection. Thus, regulatory interactions of evolutionarily recent sRNAs can be acted upon by selection and contribute to the evolution of phenotypic diversity.","lang":"eng"}],"publication":"Science","title":"Evolution of flower color pattern through selection on regulatory small RNAs","language":[{"iso":"eng"}],"doi":"10.1126/science.aao3526","_id":"611","department":[{"_id":"NiBa"}]}]