[{"popular_science":"1","month":"01","date_created":"2018-12-11T11:49:46Z","publisher":"Verein Informationspraxis ","publication":"Informationspraxis","department":[{"_id":"E-Lib"}],"status":"public","intvolume":"         3","citation":{"chicago":"Villányi, Márton. “Ein Freies Bibliothekssystem Für Wissenschaftliche Bibliotheken – Werkstattbericht Der IST Austria Library.” <i>Informationspraxis</i>. Verein Informationspraxis , 2017. <a href=\"https://doi.org/10.11588/ip.2017.1.35227\">https://doi.org/10.11588/ip.2017.1.35227</a>.","ieee":"M. Villányi, “Ein freies Bibliothekssystem für wissenschaftliche Bibliotheken – Werkstattbericht der IST Austria Library,” <i>Informationspraxis</i>, vol. 3, no. 1. Verein Informationspraxis , 2017.","ista":"Villányi M. 2017. Ein freies Bibliothekssystem für wissenschaftliche Bibliotheken – Werkstattbericht der IST Austria Library. Informationspraxis. 3(1).","mla":"Villányi, Márton. “Ein Freies Bibliothekssystem Für Wissenschaftliche Bibliotheken – Werkstattbericht Der IST Austria Library.” <i>Informationspraxis</i>, vol. 3, no. 1, Verein Informationspraxis , 2017, doi:<a href=\"https://doi.org/10.11588/ip.2017.1.35227\">10.11588/ip.2017.1.35227</a>.","short":"M. Villányi, Informationspraxis 3 (2017).","ama":"Villányi M. Ein freies Bibliothekssystem für wissenschaftliche Bibliotheken – Werkstattbericht der IST Austria Library. <i>Informationspraxis</i>. 2017;3(1). doi:<a href=\"https://doi.org/10.11588/ip.2017.1.35227\">10.11588/ip.2017.1.35227</a>","apa":"Villányi, M. (2017). Ein freies Bibliothekssystem für wissenschaftliche Bibliotheken – Werkstattbericht der IST Austria Library. <i>Informationspraxis</i>. Verein Informationspraxis . <a href=\"https://doi.org/10.11588/ip.2017.1.35227\">https://doi.org/10.11588/ip.2017.1.35227</a>"},"title":"Ein freies Bibliothekssystem für wissenschaftliche Bibliotheken – Werkstattbericht der IST Austria Library","day":"01","author":[{"first_name":"Márton","full_name":"Villányi, Márton","last_name":"Villányi","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8126-0426"}],"type":"journal_article","language":[{"iso":"eng"}],"ddc":["020"],"doi":"10.11588/ip.2017.1.35227","article_processing_charge":"No","issue":"1","file":[{"content_type":"application/pdf","relation":"main_file","file_id":"4680","date_created":"2018-12-12T10:08:20Z","file_name":"IST-2017-799-v1+1_35227-112025-1-PB.pdf","file_size":201163,"creator":"system","date_updated":"2018-12-12T10:08:20Z","access_level":"open_access"}],"_id":"1030","abstract":[{"text":"Auf der Suche nach einem Bibliothekssystem entschied sich die Forschungseinrichtung IST Austria im Jahr 2014 für das Open-Source-Produkt Koha. In einem ersten Schritt wurden zunächst Grundfunktionen aktiviert um im Anschluss diverse zusätzliche Tools zum Einsatz zu bringen. Die große Flexibilität des Systems erlaubt maßgeschneiderte Lösungen für unterschiedlichste Institutionen. Trotz Herausforderungen kann die Bibliothek auf eine erfolgreiche Implementierung zurückblicken.","lang":"ger"},{"text":"IST Austria was looking for a new library system until 2014 when the research institute decided\r\nto implement Koha. The library first activated basic functions of the open-source product and\r\nthen brought additional tools into operation. The high flexibility of the system allows customized\r\nsolutions for different institutions. Although the library faced some challenges, it can now look\r\nback on a successful implementation.","lang":"eng"}],"date_published":"2017-01-01T00:00:00Z","publication_status":"published","oa":1,"file_date_updated":"2018-12-12T10:08:20Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"pubrep_id":"799","volume":3,"article_type":"original","publist_id":"6360","oa_version":"Published Version","has_accepted_license":"1","year":"2017","date_updated":"2023-10-18T07:49:29Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2297-3249"]}},{"article_processing_charge":"No","issue":"12","abstract":[{"lang":"eng","text":"Biological membranes have a central role in mediating the organization of membrane-curving proteins, a dynamic process that has proven to be challenging to probe experimentally. Using atomic force microscopy, we capture the hierarchically organized assemblies of Bin/amphiphysin/Rvs (BAR) proteins on supported lipid membranes. Their structure reveals distinct long linear aggregates of proteins, regularly spaced by up to 300 nm. Employing accurate free-energy calculations from large-scale coarse-grained computer simulations, we found that the membrane mediates the interaction among protein filaments as a combination of short- and long-ranged interactions. The long-ranged component acts at strikingly long distances, giving rise to a variety of micron-sized ordered patterns. This mechanism may contribute to the long-ranged spatiotemporal control of membrane remodeling by proteins in the cell."}],"_id":"10369","date_published":"2017-11-21T00:00:00Z","file":[{"success":1,"date_created":"2021-11-29T09:00:40Z","content_type":"application/pdf","relation":"main_file","file_id":"10371","date_updated":"2021-11-29T09:00:40Z","access_level":"open_access","checksum":"1cf3e5e5342f2d728f47560acc3ec560","file_name":"2017_ACSCentSci_Simunovic.pdf","file_size":2635263,"creator":"cchlebak"}],"main_file_link":[{"url":"https://pubs.acs.org/doi/10.1021/acscentsci.7b00392","open_access":"1"}],"oa":1,"publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"volume":3,"file_date_updated":"2021-11-29T09:00:40Z","oa_version":"Published Version","has_accepted_license":"1","year":"2017","article_type":"original","publication_identifier":{"eissn":["2374-7951"],"issn":["2374-7943"]},"external_id":{"pmid":["29296664"]},"scopus_import":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2021-11-29T09:28:06Z","page":"1246-1253","date_created":"2021-11-29T08:49:50Z","month":"11","extern":"1","publisher":"American Chemical Society","intvolume":"         3","status":"public","publication":"ACS Central Science","quality_controlled":"1","title":"Long-range organization of membrane-curving proteins","citation":{"ieee":"M. Simunovic, A. Šarić, J. M. Henderson, K. Y. C. Lee, and G. A. Voth, “Long-range organization of membrane-curving proteins,” <i>ACS Central Science</i>, vol. 3, no. 12. American Chemical Society, pp. 1246–1253, 2017.","ista":"Simunovic M, Šarić A, Henderson JM, Lee KYC, Voth GA. 2017. Long-range organization of membrane-curving proteins. ACS Central Science. 3(12), 1246–1253.","chicago":"Simunovic, Mijo, Anđela Šarić, J. Michael Henderson, Ka Yee C. Lee, and Gregory A. Voth. “Long-Range Organization of Membrane-Curving Proteins.” <i>ACS Central Science</i>. American Chemical Society, 2017. <a href=\"https://doi.org/10.1021/acscentsci.7b00392\">https://doi.org/10.1021/acscentsci.7b00392</a>.","mla":"Simunovic, Mijo, et al. “Long-Range Organization of Membrane-Curving Proteins.” <i>ACS Central Science</i>, vol. 3, no. 12, American Chemical Society, 2017, pp. 1246–53, doi:<a href=\"https://doi.org/10.1021/acscentsci.7b00392\">10.1021/acscentsci.7b00392</a>.","short":"M. Simunovic, A. Šarić, J.M. Henderson, K.Y.C. Lee, G.A. Voth, ACS Central Science 3 (2017) 1246–1253.","apa":"Simunovic, M., Šarić, A., Henderson, J. M., Lee, K. Y. C., &#38; Voth, G. A. (2017). Long-range organization of membrane-curving proteins. <i>ACS Central Science</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acscentsci.7b00392\">https://doi.org/10.1021/acscentsci.7b00392</a>","ama":"Simunovic M, Šarić A, Henderson JM, Lee KYC, Voth GA. Long-range organization of membrane-curving proteins. <i>ACS Central Science</i>. 2017;3(12):1246-1253. doi:<a href=\"https://doi.org/10.1021/acscentsci.7b00392\">10.1021/acscentsci.7b00392</a>"},"author":[{"last_name":"Simunovic","first_name":"Mijo","full_name":"Simunovic, Mijo"},{"id":"bf63d406-f056-11eb-b41d-f263a6566d8b","orcid":"0000-0002-7854-2139","full_name":"Šarić, Anđela","first_name":"Anđela","last_name":"Šarić"},{"last_name":"Henderson","first_name":"J. Michael","full_name":"Henderson, J. Michael"},{"full_name":"Lee, Ka Yee C.","first_name":"Ka Yee C.","last_name":"Lee"},{"full_name":"Voth, Gregory A.","first_name":"Gregory A.","last_name":"Voth"}],"type":"journal_article","day":"21","pmid":1,"acknowledgement":"M.S. and G.A.V. acknowledge their research reported in this publication as being supported by the National Institute of General Medical Sciences of the National Institutes of Health under Award Number R01-GM063796. Computational resources were provided to M.S. and G.A.V. by the National Science Foundation through XSEDE (Grant TG-MCA94P017, supercomputers Stampede and Gordon), and also by the Blue Waters computing project at the National Center for Supercomputing Applications (University of Illinois at Urbana–Champaign, NSF Awards OCI-0725070 and ACI-1238993). A.Š. acknowledges support from the Human Frontier Science Program and Royal Society. J.M.H. and K.Y.C.L. acknowledge the support from the National Science Foundation (Grant MCB-1413613) and the NSF-supported MRSEC program at the University of Chicago (Grant DMR-1420709). We are grateful to Carsten Mim and Vinzenz Unger of Northwestern University for generously providing us with the protein. We thank all the members of the Voth group for fruitful discussions, especially John M. A. Grime.","doi":"10.1021/acscentsci.7b00392","ddc":["540"],"keyword":["general chemical engineering","general chemistry"],"language":[{"iso":"eng"}]},{"has_accepted_license":"1","oa_version":"Published Version","year":"2017","article_type":"original","publication_identifier":{"issn":["2050-084X"]},"scopus_import":"1","external_id":{"pmid":["29119945"]},"date_updated":"2021-11-29T09:28:14Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","_id":"10370","abstract":[{"lang":"eng","text":"Eukaryotic cells are densely packed with macromolecular complexes and intertwining organelles, continually transported and reshaped. Intriguingly, organelles avoid clashing and entangling with each other in such limited space. Mitochondria form extensive networks constantly remodeled by fission and fusion. Here, we show that mitochondrial fission is triggered by mechanical forces. Mechano-stimulation of mitochondria – via encounter with motile intracellular pathogens, via external pressure applied by an atomic force microscope, or via cell migration across uneven microsurfaces – results in the recruitment of the mitochondrial fission machinery, and subsequent division. We propose that MFF, owing to affinity for narrow mitochondria, acts as a membrane-bound force sensor to recruit the fission machinery to mechanically strained sites. Thus, mitochondria adapt to the environment by sensing and responding to biomechanical cues. Our findings that mechanical triggers can be coupled to biochemical responses in membrane dynamics may explain how organelles orderly cohabit in the crowded cytoplasm."}],"date_published":"2017-11-09T00:00:00Z","file":[{"checksum":"c35f42dcfb007f6d6c761a27e24c26d3","access_level":"open_access","date_updated":"2021-11-29T09:07:41Z","creator":"cchlebak","file_size":6120157,"file_name":"2017_eLife_Helle.pdf","date_created":"2021-11-29T09:07:41Z","success":1,"relation":"main_file","file_id":"10372","content_type":"application/pdf"}],"article_number":"e30292","main_file_link":[{"open_access":"1","url":"https://elifesciences.org/articles/30292"}],"oa":1,"publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"volume":6,"file_date_updated":"2021-11-29T09:07:41Z","title":"Mechanical force induces mitochondrial fission","citation":{"mla":"Helle, Sebastian Carsten Johannes, et al. “Mechanical Force Induces Mitochondrial Fission.” <i>ELife</i>, vol. 6, e30292, eLife Sciences Publications, 2017, doi:<a href=\"https://doi.org/10.7554/elife.30292\">10.7554/elife.30292</a>.","ieee":"S. C. J. Helle <i>et al.</i>, “Mechanical force induces mitochondrial fission,” <i>eLife</i>, vol. 6. eLife Sciences Publications, 2017.","ista":"Helle SCJ, Feng Q, Aebersold MJ, Hirt L, Grüter RR, Vahid A, Sirianni A, Mostowy S, Snedeker JG, Šarić A, Idema T, Zambelli T, Kornmann B. 2017. Mechanical force induces mitochondrial fission. eLife. 6, e30292.","chicago":"Helle, Sebastian Carsten Johannes, Qian Feng, Mathias J Aebersold, Luca Hirt, Raphael R Grüter, Afshin Vahid, Andrea Sirianni, et al. “Mechanical Force Induces Mitochondrial Fission.” <i>ELife</i>. eLife Sciences Publications, 2017. <a href=\"https://doi.org/10.7554/elife.30292\">https://doi.org/10.7554/elife.30292</a>.","apa":"Helle, S. C. J., Feng, Q., Aebersold, M. J., Hirt, L., Grüter, R. R., Vahid, A., … Kornmann, B. (2017). Mechanical force induces mitochondrial fission. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.30292\">https://doi.org/10.7554/elife.30292</a>","ama":"Helle SCJ, Feng Q, Aebersold MJ, et al. Mechanical force induces mitochondrial fission. <i>eLife</i>. 2017;6. doi:<a href=\"https://doi.org/10.7554/elife.30292\">10.7554/elife.30292</a>","short":"S.C.J. Helle, Q. Feng, M.J. Aebersold, L. Hirt, R.R. Grüter, A. Vahid, A. Sirianni, S. Mostowy, J.G. Snedeker, A. Šarić, T. Idema, T. Zambelli, B. Kornmann, ELife 6 (2017)."},"type":"journal_article","author":[{"first_name":"Sebastian Carsten Johannes","full_name":"Helle, Sebastian Carsten Johannes","last_name":"Helle"},{"last_name":"Feng","full_name":"Feng, Qian","first_name":"Qian"},{"full_name":"Aebersold, Mathias J","first_name":"Mathias J","last_name":"Aebersold"},{"last_name":"Hirt","full_name":"Hirt, Luca","first_name":"Luca"},{"first_name":"Raphael R","full_name":"Grüter, Raphael R","last_name":"Grüter"},{"last_name":"Vahid","first_name":"Afshin","full_name":"Vahid, Afshin"},{"last_name":"Sirianni","first_name":"Andrea","full_name":"Sirianni, Andrea"},{"first_name":"Serge","full_name":"Mostowy, Serge","last_name":"Mostowy"},{"first_name":"Jess G","full_name":"Snedeker, Jess G","last_name":"Snedeker"},{"last_name":"Šarić","first_name":"Anđela","full_name":"Šarić, Anđela","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","orcid":"0000-0002-7854-2139"},{"last_name":"Idema","first_name":"Timon","full_name":"Idema, Timon"},{"full_name":"Zambelli, Tomaso","first_name":"Tomaso","last_name":"Zambelli"},{"first_name":"Benoît","full_name":"Kornmann, Benoît","last_name":"Kornmann"}],"day":"09","pmid":1,"doi":"10.7554/elife.30292","ddc":["572"],"keyword":["general immunology and microbiology","general biochemistry","genetics and molecular biology","general medicine","general neuroscience"],"language":[{"iso":"eng"}],"date_created":"2021-11-29T08:51:38Z","month":"11","extern":"1","publisher":"eLife Sciences Publications","intvolume":"         6","status":"public","publication":"eLife","quality_controlled":"1"},{"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2021-11-29T09:59:12Z","scopus_import":"1","external_id":{"pmid":["28439003"],"arxiv":["1610.06840"]},"year":"2017","oa_version":"Published Version","article_type":"original","volume":114,"main_file_link":[{"open_access":"1","url":"https://www.pnas.org/content/114/19/4911"}],"oa":1,"publication_status":"published","_id":"10373","date_published":"2017-04-24T00:00:00Z","abstract":[{"lang":"eng","text":"Electric charges are conserved. The same would be expected to hold for magnetic charges, yet magnetic monopoles have never been observed. It is therefore surprising that the laws of nonequilibrium thermodynamics, combined with Maxwell’s equations, suggest that colloidal particles heated or cooled in certain polar or paramagnetic solvents may behave as if they carry an electric/magnetic charge. Here, we present numerical simulations that show that the field distribution around a pair of such heated/cooled colloidal particles agrees quantitatively with the theoretical predictions for a pair of oppositely charged electric or magnetic monopoles. However, in other respects, the nonequilibrium colloidal particles do not behave as monopoles: They cannot be moved by a homogeneous applied field. The numerical evidence for the monopole-like fields around heated/cooled colloidal particles is crucial because the experimental and numerical determination of forces between such colloidal particles would be complicated by the presence of other effects, such as thermophoresis."}],"issue":"19","article_processing_charge":"No","arxiv":1,"doi":"10.1073/pnas.1621494114","language":[{"iso":"eng"}],"keyword":["multidisciplinary"],"acknowledgement":"P.W. acknowledges many invaluable discussions with Martin Neumann, Chao Zhang, Michiel Sprik, Aleks Reinhardt, Carl Pölking, and Tine Curk. We acknowledge financial support from the Austrian Academy of Sciences through a doctoral (DOC) fellowship (to P.W.), the Austrian Science Fund (FWF) within the Spezialforschungsbereich Vienna Computational Materials Laboratory (Project F41) (C.D.), and the European Union Early Training Network NANOTRANS (Grant 674979 to D. Frenkel). The results presented here have been achieved in part using the Vienna Scientific Cluster.","pmid":1,"type":"journal_article","author":[{"last_name":"Wirnsberger","first_name":"Peter","full_name":"Wirnsberger, Peter"},{"last_name":"Fijan","first_name":"Domagoj","full_name":"Fijan, Domagoj"},{"first_name":"Roger A.","full_name":"Lightwood, Roger A.","last_name":"Lightwood"},{"orcid":"0000-0002-7854-2139","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","full_name":"Šarić, Anđela","first_name":"Anđela","last_name":"Šarić"},{"full_name":"Dellago, Christoph","first_name":"Christoph","last_name":"Dellago"},{"full_name":"Frenkel, Daan","first_name":"Daan","last_name":"Frenkel"}],"day":"24","title":"Numerical evidence for thermally induced monopoles","citation":{"apa":"Wirnsberger, P., Fijan, D., Lightwood, R. A., Šarić, A., Dellago, C., &#38; Frenkel, D. (2017). Numerical evidence for thermally induced monopoles. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1621494114\">https://doi.org/10.1073/pnas.1621494114</a>","ama":"Wirnsberger P, Fijan D, Lightwood RA, Šarić A, Dellago C, Frenkel D. Numerical evidence for thermally induced monopoles. <i>Proceedings of the National Academy of Sciences</i>. 2017;114(19):4911-4914. doi:<a href=\"https://doi.org/10.1073/pnas.1621494114\">10.1073/pnas.1621494114</a>","short":"P. Wirnsberger, D. Fijan, R.A. Lightwood, A. Šarić, C. Dellago, D. Frenkel, Proceedings of the National Academy of Sciences 114 (2017) 4911–4914.","mla":"Wirnsberger, Peter, et al. “Numerical Evidence for Thermally Induced Monopoles.” <i>Proceedings of the National Academy of Sciences</i>, vol. 114, no. 19, National Academy of Sciences, 2017, pp. 4911–14, doi:<a href=\"https://doi.org/10.1073/pnas.1621494114\">10.1073/pnas.1621494114</a>.","ieee":"P. Wirnsberger, D. Fijan, R. A. Lightwood, A. Šarić, C. Dellago, and D. Frenkel, “Numerical evidence for thermally induced monopoles,” <i>Proceedings of the National Academy of Sciences</i>, vol. 114, no. 19. National Academy of Sciences, pp. 4911–4914, 2017.","ista":"Wirnsberger P, Fijan D, Lightwood RA, Šarić A, Dellago C, Frenkel D. 2017. Numerical evidence for thermally induced monopoles. Proceedings of the National Academy of Sciences. 114(19), 4911–4914.","chicago":"Wirnsberger, Peter, Domagoj Fijan, Roger A. Lightwood, Anđela Šarić, Christoph Dellago, and Daan Frenkel. “Numerical Evidence for Thermally Induced Monopoles.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2017. <a href=\"https://doi.org/10.1073/pnas.1621494114\">https://doi.org/10.1073/pnas.1621494114</a>."},"status":"public","intvolume":"       114","quality_controlled":"1","publication":"Proceedings of the National Academy of Sciences","publisher":"National Academy of Sciences","date_created":"2021-11-29T09:28:24Z","extern":"1","month":"04","page":"4911-4914"},{"article_type":"original","year":"2017","oa_version":"Published Version","date_updated":"2021-11-29T10:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"pmid":["29147538"]},"scopus_import":"1","publication_identifier":{"eissn":["2041-6539"],"issn":["2041-6520"]},"issue":"10","article_processing_charge":"No","_id":"10374","abstract":[{"text":"The formation of filaments from naturally occurring protein molecules is a process at the core of a range of functional and aberrant biological phenomena, such as the assembly of the cytoskeleton or the appearance of aggregates in Alzheimer's disease. The macroscopic behaviour associated with such processes is remarkably diverse, ranging from simple nucleated growth to highly cooperative processes with a well-defined lagtime. Thus, conventionally, different molecular mechanisms have been used to explain the self-assembly of different proteins. Here we show that this range of behaviour can be quantitatively captured by a single unifying Petri net that describes filamentous growth in terms of aggregate number and aggregate mass concentrations. By considering general features associated with a particular network connectivity, we are able to establish directly the rate-determining steps of the overall aggregation reaction from the system's scaling behaviour. We illustrate the power of this framework on a range of different experimental and simulated aggregating systems. The approach is general and will be applicable to any future extensions of the reaction network of filamentous self-assembly.","lang":"eng"}],"date_published":"2017-08-31T00:00:00Z","publication_status":"published","license":"https://creativecommons.org/licenses/by-nc/3.0/","main_file_link":[{"open_access":"1","url":"https://pubs.rsc.org/en/content/articlelanding/2017/SC/C7SC01965C"}],"oa":1,"volume":8,"tmp":{"image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/3.0/legalcode","short":"CC BY-NC (3.0)"},"citation":{"short":"G. Meisl, L. Rajah, S.A.I. Cohen, M. Pfammatter, A. Šarić, E. Hellstrand, A.K. Buell, A. Aguzzi, S. Linse, M. Vendruscolo, C.M. Dobson, T.P.J. Knowles, Chemical Science 8 (2017) 7087–7097.","ama":"Meisl G, Rajah L, Cohen SAI, et al. Scaling behaviour and rate-determining steps in filamentous self-assembly. <i>Chemical Science</i>. 2017;8(10):7087-7097. doi:<a href=\"https://doi.org/10.1039/c7sc01965c\">10.1039/c7sc01965c</a>","apa":"Meisl, G., Rajah, L., Cohen, S. A. I., Pfammatter, M., Šarić, A., Hellstrand, E., … Knowles, T. P. J. (2017). Scaling behaviour and rate-determining steps in filamentous self-assembly. <i>Chemical Science</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/c7sc01965c\">https://doi.org/10.1039/c7sc01965c</a>","chicago":"Meisl, Georg, Luke Rajah, Samuel A. I. Cohen, Manuela Pfammatter, Anđela Šarić, Erik Hellstrand, Alexander K. Buell, et al. “Scaling Behaviour and Rate-Determining Steps in Filamentous Self-Assembly.” <i>Chemical Science</i>. Royal Society of Chemistry, 2017. <a href=\"https://doi.org/10.1039/c7sc01965c\">https://doi.org/10.1039/c7sc01965c</a>.","ista":"Meisl G, Rajah L, Cohen SAI, Pfammatter M, Šarić A, Hellstrand E, Buell AK, Aguzzi A, Linse S, Vendruscolo M, Dobson CM, Knowles TPJ. 2017. Scaling behaviour and rate-determining steps in filamentous self-assembly. Chemical Science. 8(10), 7087–7097.","ieee":"G. Meisl <i>et al.</i>, “Scaling behaviour and rate-determining steps in filamentous self-assembly,” <i>Chemical Science</i>, vol. 8, no. 10. Royal Society of Chemistry, pp. 7087–7097, 2017.","mla":"Meisl, Georg, et al. “Scaling Behaviour and Rate-Determining Steps in Filamentous Self-Assembly.” <i>Chemical Science</i>, vol. 8, no. 10, Royal Society of Chemistry, 2017, pp. 7087–97, doi:<a href=\"https://doi.org/10.1039/c7sc01965c\">10.1039/c7sc01965c</a>."},"title":"Scaling behaviour and rate-determining steps in filamentous self-assembly","day":"31","type":"journal_article","author":[{"first_name":"Georg","full_name":"Meisl, Georg","last_name":"Meisl"},{"last_name":"Rajah","full_name":"Rajah, Luke","first_name":"Luke"},{"full_name":"Cohen, Samuel A. I.","first_name":"Samuel A. I.","last_name":"Cohen"},{"full_name":"Pfammatter, Manuela","first_name":"Manuela","last_name":"Pfammatter"},{"orcid":"0000-0002-7854-2139","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","full_name":"Šarić, Anđela","first_name":"Anđela","last_name":"Šarić"},{"last_name":"Hellstrand","full_name":"Hellstrand, Erik","first_name":"Erik"},{"full_name":"Buell, Alexander K.","first_name":"Alexander K.","last_name":"Buell"},{"last_name":"Aguzzi","first_name":"Adriano","full_name":"Aguzzi, Adriano"},{"last_name":"Linse","full_name":"Linse, Sara","first_name":"Sara"},{"last_name":"Vendruscolo","full_name":"Vendruscolo, Michele","first_name":"Michele"},{"last_name":"Dobson","full_name":"Dobson, Christopher M.","first_name":"Christopher M."},{"full_name":"Knowles, Tuomas P. J.","first_name":"Tuomas P. J.","last_name":"Knowles"}],"acknowledgement":"The research leading to these results has received funding from the European Research Council under the European Union's Seventh Framework Programme (FP7/2007-2013) through the ERC grant PhysProt (agreement no. 337969) (SL, TPJK), Sidney Sussex College Cambridge (GM), the Frances and Augusta Newman Foundation (TPJK), the Biotechnology and Biological Science Research Council (TPJK), the Swedish Research Council (SL), the Academy of Medical Sciences (AŠ), Wellcome Trust (AŠ), and the Cambridge Centre for Misfolding Diseases (CMD, TPJK, MV).","pmid":1,"language":[{"iso":"eng"}],"keyword":["general chemistry"],"doi":"10.1039/c7sc01965c","ddc":["540"],"page":"7087-7097","extern":"1","month":"08","date_created":"2021-11-29T09:29:31Z","publisher":"Royal Society of Chemistry","quality_controlled":"1","publication":"Chemical Science","intvolume":"         8","status":"public"},{"issue":"28","article_processing_charge":"No","arxiv":1,"abstract":[{"lang":"eng","text":"Cellular membranes exhibit a large variety of shapes, strongly coupled to their function. Many biological processes involve dynamic reshaping of membranes, usually mediated by proteins. This interaction works both ways: while proteins influence the membrane shape, the membrane shape affects the interactions between the proteins. To study these membrane-mediated interactions on closed and anisotropically curved membranes, we use colloids adhered to ellipsoidal membrane vesicles as a model system. We find that two particles on a closed system always attract each other, and tend to align with the direction of largest curvature. Multiple particles form arcs, or, at large enough numbers, a complete ring surrounding the vesicle in its equatorial plane. The resulting vesicle shape resembles a snowman. Our results indicate that these physical interactions on membranes with anisotropic shapes can be exploited by cells to drive macromolecules to preferred regions of cellular or intracellular membranes, and utilized to initiate dynamic processes such as cell division. The same principle could be used to find the midplane of an artificial vesicle, as a first step towards dividing it into two equal parts."}],"_id":"10375","date_published":"2017-06-15T00:00:00Z","main_file_link":[{"url":"https://pubs.rsc.org/en/content/articlelanding/2017/SM/C7SM00433H","open_access":"1"}],"oa":1,"publication_status":"published","license":"https://creativecommons.org/licenses/by/3.0/","volume":13,"tmp":{"short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","year":"2017","article_type":"original","publication_identifier":{"issn":["1744-683X"],"eissn":["1744-6848"]},"date_updated":"2021-11-29T10:33:36Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","scopus_import":"1","external_id":{"arxiv":["1703.00776"],"pmid":["28677712"]},"page":"4924-4930","date_created":"2021-11-29T10:00:39Z","extern":"1","month":"06","publisher":"Royal Society of Chemistry","intvolume":"        13","status":"public","quality_controlled":"1","publication":"Soft Matter","title":"Curvature variation controls particle aggregation on fluid vesicles","citation":{"short":"A. Vahid, A. Šarić, T. Idema, Soft Matter 13 (2017) 4924–4930.","apa":"Vahid, A., Šarić, A., &#38; Idema, T. (2017). Curvature variation controls particle aggregation on fluid vesicles. <i>Soft Matter</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/c7sm00433h\">https://doi.org/10.1039/c7sm00433h</a>","ama":"Vahid A, Šarić A, Idema T. Curvature variation controls particle aggregation on fluid vesicles. <i>Soft Matter</i>. 2017;13(28):4924-4930. doi:<a href=\"https://doi.org/10.1039/c7sm00433h\">10.1039/c7sm00433h</a>","ista":"Vahid A, Šarić A, Idema T. 2017. Curvature variation controls particle aggregation on fluid vesicles. Soft Matter. 13(28), 4924–4930.","ieee":"A. Vahid, A. Šarić, and T. Idema, “Curvature variation controls particle aggregation on fluid vesicles,” <i>Soft Matter</i>, vol. 13, no. 28. Royal Society of Chemistry, pp. 4924–4930, 2017.","chicago":"Vahid, Afshin, Anđela Šarić, and Timon Idema. “Curvature Variation Controls Particle Aggregation on Fluid Vesicles.” <i>Soft Matter</i>. Royal Society of Chemistry, 2017. <a href=\"https://doi.org/10.1039/c7sm00433h\">https://doi.org/10.1039/c7sm00433h</a>.","mla":"Vahid, Afshin, et al. “Curvature Variation Controls Particle Aggregation on Fluid Vesicles.” <i>Soft Matter</i>, vol. 13, no. 28, Royal Society of Chemistry, 2017, pp. 4924–30, doi:<a href=\"https://doi.org/10.1039/c7sm00433h\">10.1039/c7sm00433h</a>."},"author":[{"full_name":"Vahid, Afshin","first_name":"Afshin","last_name":"Vahid"},{"last_name":"Šarić","first_name":"Anđela","full_name":"Šarić, Anđela","orcid":"0000-0002-7854-2139","id":"bf63d406-f056-11eb-b41d-f263a6566d8b"},{"first_name":"Timon","full_name":"Idema, Timon","last_name":"Idema"}],"type":"journal_article","day":"15","acknowledgement":"This work was supported by the Netherlands Organisation for Scientific Research (NWO/OCW), as part of the Frontiers of Nanoscience program.","pmid":1,"doi":"10.1039/c7sm00433h","language":[{"iso":"eng"}],"keyword":["condensed matter physics","general chemistry"]},{"publisher":"Association for Computing Machinery","status":"public","intvolume":"         2","publication":"Proceedings of the ACM on Programming Languages","quality_controlled":"1","department":[{"_id":"KrCh"}],"date_created":"2021-12-05T23:01:48Z","month":"12","project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5455"}]},"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant (279307: Graph Games).\r\n","ddc":["000"],"doi":"10.1145/3158118","language":[{"iso":"eng"}],"title":"Optimal Dyck reachability for data-dependence and Alias analysis","conference":{"location":"Los Angeles, CA, United States","name":"POPL: Programming Languages","end_date":"2018-01-13","start_date":"2018-01-07"},"citation":{"mla":"Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL, 30, Association for Computing Machinery, 2017, doi:<a href=\"https://doi.org/10.1145/3158118\">10.1145/3158118</a>.","ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL. Association for Computing Machinery, 2017.","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2(POPL), 30.","chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2017. <a href=\"https://doi.org/10.1145/3158118\">https://doi.org/10.1145/3158118</a>.","apa":"Chatterjee, K., Choudhary, B., &#38; Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. <i>Proceedings of the ACM on Programming Languages</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3158118\">https://doi.org/10.1145/3158118</a>","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence and Alias analysis. <i>Proceedings of the ACM on Programming Languages</i>. 2017;2(POPL). doi:<a href=\"https://doi.org/10.1145/3158118\">10.1145/3158118</a>","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 2 (2017)."},"ec_funded":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Choudhary","first_name":"Bhavya","full_name":"Choudhary, Bhavya"},{"orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"}],"type":"journal_article","day":"27","oa":1,"publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"volume":2,"file_date_updated":"2021-12-07T08:06:28Z","article_processing_charge":"No","issue":"POPL","arxiv":1,"_id":"10416","abstract":[{"text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graph where the edges are labeled with different types of opening and closing parentheses, and the reachability information is computed via paths whose parentheses are properly matched. We present new results for Dyck reachability problems with applications to alias analysis and data-dependence analysis. Our main contributions, that include improved upper bounds as well as lower bounds that establish optimality guarantees, are as follows: First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph with n nodes and m edges, we present: (i) an algorithm with worst-case running time O(m + n · α(n)), where α(n) is the inverse Ackermann function, improving the previously known O(n2) time bound; (ii) a matching lower bound that shows that our algorithm is optimal wrt to worst-case complexity; and (iii) an optimal average-case upper bound of O(m) time, improving the previously known O(m · logn) bound. Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtain analysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is only linear, and only wrt the number of call sites. Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean Matrix Multiplication, which is a long-standing open problem. Thus we establish that the existing combinatorial algorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the same hardness holds for graphs of constant treewidth. Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependence analysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform all existing methods on the two problems, over real-world benchmarks.","lang":"eng"}],"date_published":"2017-12-27T00:00:00Z","file":[{"date_created":"2021-12-07T08:06:28Z","success":1,"content_type":"application/pdf","relation":"main_file","file_id":"10421","checksum":"faa3f7b3fe8aab84b50ed805c26a0ee5","date_updated":"2021-12-07T08:06:28Z","access_level":"open_access","file_name":"2017_ACMProgLang_Chatterjee.pdf","file_size":460188,"creator":"cchlebak"}],"article_number":"30","publication_identifier":{"eissn":["2475-1421"]},"external_id":{"arxiv":["1910.00241"]},"scopus_import":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2023-02-23T12:27:13Z","has_accepted_license":"1","oa_version":"Published Version","year":"2017","article_type":"original"},{"date_created":"2021-12-05T23:01:49Z","month":"12","status":"public","intvolume":"         2","department":[{"_id":"KrCh"}],"quality_controlled":"1","publication":"Proceedings of the ACM on Programming Languages","publisher":"Association for Computing Machinery","type":"journal_article","author":[{"first_name":"Marek","full_name":"Chalupa, Marek","last_name":"Chalupa"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas"},{"last_name":"Sinha","first_name":"Nishant","full_name":"Sinha, Nishant"},{"last_name":"Vaidya","first_name":"Kapil","full_name":"Vaidya, Kapil"}],"day":"27","conference":{"end_date":"2018-01-13","start_date":"2018-01-07","name":"POPL: Programming Languages","location":"Los Angeles, CA, United States"},"title":"Data-centric dynamic partial order reduction","ec_funded":1,"citation":{"ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic partial order reduction. <i>Proceedings of the ACM on Programming Languages</i>. 2017;2(POPL). doi:<a href=\"https://doi.org/10.1145/3158119\">10.1145/3158119</a>","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., &#38; Vaidya, K. (2017). Data-centric dynamic partial order reduction. <i>Proceedings of the ACM on Programming Languages</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3158119\">https://doi.org/10.1145/3158119</a>","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2017).","mla":"Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL, 31, Association for Computing Machinery, 2017, doi:<a href=\"https://doi.org/10.1145/3158119\">10.1145/3158119</a>.","chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2017. <a href=\"https://doi.org/10.1145/3158119\">https://doi.org/10.1145/3158119</a>.","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2(POPL), 31.","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL. Association for Computing Machinery, 2017."},"doi":"10.1145/3158119","language":[{"iso":"eng"}],"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF\r\nNFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Czech\r\nScience Foundation grant GBP202/12/G061.","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"related_material":{"record":[{"relation":"earlier_version","id":"5448","status":"public"},{"relation":"earlier_version","id":"5456","status":"public"}]},"_id":"10417","date_published":"2017-12-27T00:00:00Z","abstract":[{"lang":"eng","text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\n\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence."}],"article_number":"31","issue":"POPL","article_processing_charge":"No","arxiv":1,"volume":2,"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/3158119","open_access":"1"}],"oa":1,"publication_status":"published","oa_version":"Published Version","year":"2017","article_type":"original","publication_identifier":{"eissn":["2475-1421"]},"date_updated":"2023-02-23T12:27:16Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","scopus_import":"1","external_id":{"arxiv":["1610.01188"]}},{"main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/10.1145/3158121"}],"oa":1,"publication_status":"published","volume":2,"article_processing_charge":"No","issue":"POPL","arxiv":1,"_id":"10418","abstract":[{"text":"We present a new proof rule for proving almost-sure termination of probabilistic programs, including those that contain demonic non-determinism. An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates \"almost surely\". Proving that can be hard, and this paper presents a new method for doing so. It applies directly to the program's source code, even if the program contains demonic choice. Like others, we use variant functions (a.k.a. \"super-martingales\") that are real-valued and decrease randomly on each loop iteration; but our key innovation is that the amount as well as the probability of the decrease are parametric. We prove the soundness of the new rule, indicate where its applicability goes beyond existing rules, and explain its connection to classical results on denumerable (non-demonic) Markov chains.","lang":"eng"}],"date_published":"2017-12-07T00:00:00Z","article_number":"33","publication_identifier":{"eissn":["2475-1421"]},"scopus_import":"1","external_id":{"arxiv":["1711.03588"]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2021-12-07T08:04:14Z","year":"2017","oa_version":"Published Version","article_type":"original","publisher":"Association for Computing Machinery","intvolume":"         2","status":"public","publication":"Proceedings of the ACM on Programming Languages","quality_controlled":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2021-12-05T23:01:49Z","month":"12","acknowledgement":"McIver and Morgan are grateful to David Basin and the Information Security Group at ETH Zürich for hosting a six-month stay in Switzerland, during part of which this work began. And thanks particularly to Andreas Lochbihler, who shared with us the probabilistic termination problem that led to it. They acknowledge the support of ARC grant DP140101119. Part of this work was carried out during the Workshop on Probabilistic Programming Semantics\r\nat McGill University’s Bellairs Research Institute on Barbados organised by Alexandra Silva and\r\nPrakash Panangaden. Kaminski and Katoen are grateful to Sebastian Junges for spotting a flaw in §5.4.","doi":"10.1145/3158121","language":[{"iso":"eng"}],"title":"A new proof rule for almost-sure termination","conference":{"end_date":"2018-01-13","start_date":"2018-01-07","name":"POPL: Programming Languages","location":"Los Angeles, CA, United States"},"citation":{"ama":"Mciver A, Morgan C, Kaminski BL, Katoen JP. A new proof rule for almost-sure termination. <i>Proceedings of the ACM on Programming Languages</i>. 2017;2(POPL). doi:<a href=\"https://doi.org/10.1145/3158121\">10.1145/3158121</a>","apa":"Mciver, A., Morgan, C., Kaminski, B. L., &#38; Katoen, J. P. (2017). A new proof rule for almost-sure termination. <i>Proceedings of the ACM on Programming Languages</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3158121\">https://doi.org/10.1145/3158121</a>","short":"A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM on Programming Languages 2 (2017).","mla":"Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:<a href=\"https://doi.org/10.1145/3158121\">10.1145/3158121</a>.","chicago":"Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost P Katoen. “A New Proof Rule for Almost-Sure Termination.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2017. <a href=\"https://doi.org/10.1145/3158121\">https://doi.org/10.1145/3158121</a>.","ista":"Mciver A, Morgan C, Kaminski BL, Katoen JP. 2017. A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. 2(POPL), 33.","ieee":"A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule for almost-sure termination,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL. Association for Computing Machinery, 2017."},"author":[{"last_name":"Mciver","first_name":"Annabelle","full_name":"Mciver, Annabelle"},{"full_name":"Morgan, Carroll","first_name":"Carroll","last_name":"Morgan"},{"first_name":"Benjamin Lucien","full_name":"Kaminski, Benjamin Lucien","last_name":"Kaminski"},{"last_name":"Katoen","full_name":"Katoen, Joost P","first_name":"Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87"}],"type":"journal_article","day":"07"},{"publist_id":"6325","has_accepted_license":"1","year":"2017","oa_version":"Published Version","date_updated":"2023-09-20T12:09:21Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"pmid":["28231787"],"isi":["000397733000001"]},"scopus_import":"1","publication_identifier":{"issn":["14752859"]},"issue":"1","article_processing_charge":"No","article_number":"34","file":[{"date_created":"2018-12-12T10:16:50Z","content_type":"application/pdf","file_id":"5240","relation":"main_file","date_updated":"2018-12-12T10:16:50Z","access_level":"open_access","file_name":"IST-2017-792-v1+1_s12934-017-0645-5.pdf","file_size":1361313,"creator":"system"}],"_id":"1061","date_published":"2017-02-23T00:00:00Z","abstract":[{"text":"Background: Metabolic engineering and synthetic biology of cyanobacteria offer a promising sustainable alternative approach for fossil-based ethylene production, by using sunlight via oxygenic photosynthesis, to convert carbon dioxide directly into ethylene. Towards this, both well-studied cyanobacteria, i.e., Synechocystis sp PCC 6803 and Synechococcus elongatus PCC 7942, have been engineered to produce ethylene by introducing the ethylene-forming enzyme (Efe) from Pseudomonas syringae pv. phaseolicola PK2 (the Kudzu strain), which catalyzes the conversion of the ubiquitous tricarboxylic acid cycle intermediate 2-oxoglutarate into ethylene. Results: This study focuses on Synechocystis sp PCC 6803 and shows stable ethylene production through the integration of a codon-optimized version of the efe gene under control of the Ptrc promoter and the core Shine-Dalgarno sequence (5\\'-AGGAGG-3\\') as the ribosome-binding site (RBS), at the slr0168 neutral site. We have increased ethylene production twofold by RBS screening and further investigated improving ethylene production from a single gene copy of efe, using multiple tandem promoters and by putting our best construct on an RSF1010-based broad-host-self-replicating plasmid, which has a higher copy number than the genome. Moreover, to raise the intracellular amounts of the key Efe substrate, 2-oxoglutarate, from which ethylene is formed, we constructed a glycogen-synthesis knockout mutant (glgC) and introduced the ethylene biosynthetic pathway in it. Under nitrogen limiting conditions, the glycogen knockout strain has increased intracellular 2-oxoglutarate levels; however, surprisingly, ethylene production was lower in this strain than in the wild-type background. Conclusion: Making use of different RBS sequences, production of ethylene ranging over a 20-fold difference has been achieved. However, a further increase of production through multiple tandem promoters and a broad-host plasmid was not achieved speculating that the transcription strength and the gene copy number are not the limiting factors in our system.","lang":"eng"}],"publication_status":"published","oa":1,"file_date_updated":"2018-12-12T10:16:50Z","volume":16,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"pubrep_id":"792","citation":{"mla":"Veetil, Vinod, et al. “Ethylene Production with Engineered Synechocystis Sp PCC 6803 Strains.” <i>Microbial Cell Factories</i>, vol. 16, no. 1, 34, BioMed Central, 2017, doi:<a href=\"https://doi.org/10.1186/s12934-017-0645-5\">10.1186/s12934-017-0645-5</a>.","ieee":"V. Veetil, A. Angermayr, and K. Hellingwerf, “Ethylene production with engineered Synechocystis sp PCC 6803 strains,” <i>Microbial Cell Factories</i>, vol. 16, no. 1. BioMed Central, 2017.","ista":"Veetil V, Angermayr A, Hellingwerf K. 2017. Ethylene production with engineered Synechocystis sp PCC 6803 strains. Microbial Cell Factories. 16(1), 34.","chicago":"Veetil, Vinod, Andreas Angermayr, and Klaas Hellingwerf. “Ethylene Production with Engineered Synechocystis Sp PCC 6803 Strains.” <i>Microbial Cell Factories</i>. BioMed Central, 2017. <a href=\"https://doi.org/10.1186/s12934-017-0645-5\">https://doi.org/10.1186/s12934-017-0645-5</a>.","apa":"Veetil, V., Angermayr, A., &#38; Hellingwerf, K. (2017). Ethylene production with engineered Synechocystis sp PCC 6803 strains. <i>Microbial Cell Factories</i>. BioMed Central. <a href=\"https://doi.org/10.1186/s12934-017-0645-5\">https://doi.org/10.1186/s12934-017-0645-5</a>","ama":"Veetil V, Angermayr A, Hellingwerf K. Ethylene production with engineered Synechocystis sp PCC 6803 strains. <i>Microbial Cell Factories</i>. 2017;16(1). doi:<a href=\"https://doi.org/10.1186/s12934-017-0645-5\">10.1186/s12934-017-0645-5</a>","short":"V. Veetil, A. Angermayr, K. Hellingwerf, Microbial Cell Factories 16 (2017)."},"title":"Ethylene production with engineered Synechocystis sp PCC 6803 strains","day":"23","type":"journal_article","author":[{"last_name":"Veetil","full_name":"Veetil, Vinod","first_name":"Vinod"},{"last_name":"Angermayr","full_name":"Angermayr, Andreas","first_name":"Andreas","id":"4677C796-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8619-2223"},{"first_name":"Klaas","full_name":"Hellingwerf, Klaas","last_name":"Hellingwerf"}],"pmid":1,"language":[{"iso":"eng"}],"ddc":["579"],"doi":"10.1186/s12934-017-0645-5","extern":"1","month":"02","date_created":"2018-12-11T11:49:56Z","publisher":"BioMed Central","isi":1,"quality_controlled":"1","publication":"Microbial Cell Factories","status":"public","intvolume":"        16"},{"isi":1,"publisher":"Wiley-Blackwell","publication_status":"published","volume":595,"status":"public","intvolume":"       595","quality_controlled":"1","publication":"Journal of Physiology","issue":"8","article_processing_charge":"No","page":"2587 - 2609 ","_id":"1062","date_published":"2017-04-15T00:00:00Z","abstract":[{"text":"Mouse chromaffin cells (MCCs) generate action potential (AP) firing that regulates the Ca2+‐dependent release of catecholamines (CAs). Recent findings indicate that MCCs possess a variety of spontaneous firing modes that span from the common ‘tonic‐irregular’ to the less frequent ‘burst’ firing. This latter is evident in a small fraction of MCCs but occurs regularly when Nav1.3/1.7 channels are made less available or when the Slo1β2‐subunit responsible for BK channel inactivation is deleted. Burst firing causes large increases of Ca2+‐entry and potentiates CA release by ∼3.5‐fold and thus may be a key mechanism for regulating MCC function. With the aim to uncover a physiological role for burst‐firing we investigated the effects of acidosis on MCC activity. Lowering the extracellular pH (pHo) from 7.4 to 7.0 and 6.6 induces cell depolarizations of 10–15 mV that generate repeated bursts. Bursts at pHo 6.6 lasted ∼330 ms, occurred at 1–2 Hz and caused an ∼7‐fold increase of CA cumulative release. Burst firing originates from the inhibition of the pH‐sensitive TASK‐1/TASK‐3 channels and from a 40% BK channel conductance reduction at pHo 7.0. The same pHo had little or no effect on Nav, Cav, Kv and SK channels that support AP firing in MCCs. Burst firing of pHo 6.6 could be mimicked by mixtures of the TASK‐1 blocker A1899 (300 nm) and BK blocker paxilline (300 nm) and could be prevented by blocking L‐type channels by adding 3 μm nifedipine. Mixtures of the two blockers raised cumulative CA‐secretion even more than low pHo (∼12‐fold), showing that the action of protons on vesicle release is mainly a result of the ionic conductance changes that increase Ca2+‐entry during bursts. Our data provide direct evidence suggesting that MCCs respond to low pHo with sustained depolarization, burst firing and enhanced CA‐secretion, thus mimicking the physiological response of CCs to acute acidosis and hyperkalaemia generated during heavy exercise and muscle fatigue.","lang":"eng"}],"date_created":"2018-12-11T11:49:56Z","extern":"1","month":"04","doi":"10.1113/JP273735","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"date_updated":"2023-09-20T12:09:47Z","external_id":{"isi":["000399430300022"]},"title":"Low pH inf o boosts burst firing and catecholamine release by blocking TASK-1 and BK channels while preserving Cav1 channels in mouse chromaffin cells","citation":{"ama":"Guarina L, Vandael DH, Carabelli V, Carbone E. Low pH inf o boosts burst firing and catecholamine release by blocking TASK-1 and BK channels while preserving Cav1 channels in mouse chromaffin cells. <i>Journal of Physiology</i>. 2017;595(8):2587-2609. doi:<a href=\"https://doi.org/10.1113/JP273735\">10.1113/JP273735</a>","apa":"Guarina, L., Vandael, D. H., Carabelli, V., &#38; Carbone, E. (2017). Low pH inf o boosts burst firing and catecholamine release by blocking TASK-1 and BK channels while preserving Cav1 channels in mouse chromaffin cells. <i>Journal of Physiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1113/JP273735\">https://doi.org/10.1113/JP273735</a>","short":"L. Guarina, D.H. Vandael, V. Carabelli, E. Carbone, Journal of Physiology 595 (2017) 2587–2609.","mla":"Guarina, Laura, et al. “Low PH Inf o Boosts Burst Firing and Catecholamine Release by Blocking TASK-1 and BK Channels While Preserving Cav1 Channels in Mouse Chromaffin Cells.” <i>Journal of Physiology</i>, vol. 595, no. 8, Wiley-Blackwell, 2017, pp. 2587–609, doi:<a href=\"https://doi.org/10.1113/JP273735\">10.1113/JP273735</a>.","chicago":"Guarina, Laura, David H Vandael, Valentina Carabelli, and Emilio Carbone. “Low PH Inf o Boosts Burst Firing and Catecholamine Release by Blocking TASK-1 and BK Channels While Preserving Cav1 Channels in Mouse Chromaffin Cells.” <i>Journal of Physiology</i>. Wiley-Blackwell, 2017. <a href=\"https://doi.org/10.1113/JP273735\">https://doi.org/10.1113/JP273735</a>.","ieee":"L. Guarina, D. H. Vandael, V. Carabelli, and E. Carbone, “Low pH inf o boosts burst firing and catecholamine release by blocking TASK-1 and BK channels while preserving Cav1 channels in mouse chromaffin cells,” <i>Journal of Physiology</i>, vol. 595, no. 8. Wiley-Blackwell, pp. 2587–2609, 2017.","ista":"Guarina L, Vandael DH, Carabelli V, Carbone E. 2017. Low pH inf o boosts burst firing and catecholamine release by blocking TASK-1 and BK channels while preserving Cav1 channels in mouse chromaffin cells. Journal of Physiology. 595(8), 2587–2609."},"year":"2017","oa_version":"None","author":[{"last_name":"Guarina","first_name":"Laura","full_name":"Guarina, Laura"},{"orcid":"0000-0001-7577-1676","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87","last_name":"Vandael","first_name":"David H","full_name":"Vandael, David H"},{"full_name":"Carabelli, Valentina","first_name":"Valentina","last_name":"Carabelli"},{"last_name":"Carbone","first_name":"Emilio","full_name":"Carbone, Emilio"}],"type":"journal_article","day":"15","publist_id":"6326"},{"publication":"Evolution","quality_controlled":"1","department":[{"_id":"NiBa"}],"status":"public","intvolume":"        71","publisher":"Wiley-Blackwell","isi":1,"month":"04","date_created":"2018-12-11T11:49:57Z","page":"845 - 858","language":[{"iso":"eng"}],"doi":"10.1111/evo.13191","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152"}],"day":"01","type":"journal_article","author":[{"orcid":"0000-0001-9435-2813","id":"2DB8F68A-F248-11E8-B48F-1D18A9856A87","last_name":"Uecker","full_name":"Uecker, Hildegard","first_name":"Hildegard"}],"citation":{"mla":"Uecker, Hildegard. “Evolutionary Rescue in Randomly Mating, Selfing, and Clonal Populations.” <i>Evolution</i>, vol. 71, no. 4, Wiley-Blackwell, 2017, pp. 845–58, doi:<a href=\"https://doi.org/10.1111/evo.13191\">10.1111/evo.13191</a>.","ista":"Uecker H. 2017. Evolutionary rescue in randomly mating, selfing, and clonal populations. Evolution. 71(4), 845–858.","ieee":"H. Uecker, “Evolutionary rescue in randomly mating, selfing, and clonal populations,” <i>Evolution</i>, vol. 71, no. 4. Wiley-Blackwell, pp. 845–858, 2017.","chicago":"Uecker, Hildegard. “Evolutionary Rescue in Randomly Mating, Selfing, and Clonal Populations.” <i>Evolution</i>. Wiley-Blackwell, 2017. <a href=\"https://doi.org/10.1111/evo.13191\">https://doi.org/10.1111/evo.13191</a>.","apa":"Uecker, H. (2017). Evolutionary rescue in randomly mating, selfing, and clonal populations. <i>Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/evo.13191\">https://doi.org/10.1111/evo.13191</a>","ama":"Uecker H. Evolutionary rescue in randomly mating, selfing, and clonal populations. <i>Evolution</i>. 2017;71(4):845-858. doi:<a href=\"https://doi.org/10.1111/evo.13191\">10.1111/evo.13191</a>","short":"H. Uecker, Evolution 71 (2017) 845–858."},"ec_funded":1,"title":"Evolutionary rescue in randomly mating, selfing, and clonal populations","volume":71,"publication_status":"published","oa":1,"main_file_link":[{"url":"http://biorxiv.org/content/early/2016/10/14/081042","open_access":"1"}],"date_published":"2017-04-01T00:00:00Z","_id":"1063","abstract":[{"lang":"eng","text":"Severe environmental change can drive a population extinct unless the population adapts in time to the new conditions (“evolutionary rescue”). How does biparental sexual reproduction influence the chances of population persistence compared to clonal reproduction or selfing? In this article, we set up a one‐locus two‐allele model for adaptation in diploid species, where rescue is contingent on the establishment of the mutant homozygote. Reproduction can occur by random mating, selfing, or clonally. Random mating generates and destroys the rescue mutant; selfing is efficient at generating it but at the same time depletes the heterozygote, which can lead to a low mutant frequency in the standing genetic variation. Due to these (and other) antagonistic effects, we find a nontrivial dependence of population survival on the rate of sex/selfing, which is strongly influenced by the dominance coefficient of the mutation before and after the environmental change. Importantly, since mating with the wild‐type breaks the mutant homozygote up, a slow decay of the wild‐type population size can impede rescue in randomly mating populations."}],"article_processing_charge":"No","issue":"4","external_id":{"isi":["000398545200003"]},"scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2025-05-28T11:42:51Z","publication_identifier":{"issn":["00143820"]},"publist_id":"6327","year":"2017","oa_version":"Submitted Version"},{"doi":"10.1016/j.ipl.2017.02.003","ddc":["000"],"language":[{"iso":"eng"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0002-8882-5116","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","last_name":"Osang","full_name":"Osang, Georg F","first_name":"Georg F"}],"type":"journal_article","day":"01","title":"Pushdown reachability with constant treewidth","ec_funded":1,"citation":{"short":"K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29.","apa":"Chatterjee, K., &#38; Osang, G. F. (2017). Pushdown reachability with constant treewidth. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">https://doi.org/10.1016/j.ipl.2017.02.003</a>","ama":"Chatterjee K, Osang GF. Pushdown reachability with constant treewidth. <i>Information Processing Letters</i>. 2017;122:25-29. doi:<a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">10.1016/j.ipl.2017.02.003</a>","ista":"Chatterjee K, Osang GF. 2017. Pushdown reachability with constant treewidth. Information Processing Letters. 122, 25–29.","ieee":"K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,” <i>Information Processing Letters</i>, vol. 122. Elsevier, pp. 25–29, 2017.","chicago":"Chatterjee, Krishnendu, and Georg F Osang. “Pushdown Reachability with Constant Treewidth.” <i>Information Processing Letters</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">https://doi.org/10.1016/j.ipl.2017.02.003</a>.","mla":"Chatterjee, Krishnendu, and Georg F. Osang. “Pushdown Reachability with Constant Treewidth.” <i>Information Processing Letters</i>, vol. 122, Elsevier, 2017, pp. 25–29, doi:<a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">10.1016/j.ipl.2017.02.003</a>."},"intvolume":"       122","status":"public","department":[{"_id":"KrCh"},{"_id":"HeEd"}],"quality_controlled":"1","publication":"Information Processing Letters","isi":1,"publisher":"Elsevier","date_created":"2018-12-11T11:49:57Z","month":"06","page":"25 - 29","publication_identifier":{"issn":["00200190"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-20T12:08:18Z","external_id":{"isi":["000399506600005"]},"scopus_import":"1","oa_version":"Submitted Version","has_accepted_license":"1","year":"2017","publist_id":"6323","volume":122,"pubrep_id":"991","file_date_updated":"2019-10-15T07:44:51Z","oa":1,"publication_status":"published","date_published":"2017-06-01T00:00:00Z","_id":"1065","abstract":[{"lang":"eng","text":"We consider the problem of reachability in pushdown graphs. We study the problem for pushdown graphs with constant treewidth. Even for pushdown graphs with treewidth 1, for the reachability problem we establish the following: (i) the problem is PTIME-complete, and (ii) any subcubic algorithm for the problem would contradict the k-clique conjecture and imply faster combinatorial algorithms for cliques in graphs."}],"file":[{"content_type":"application/pdf","relation":"main_file","file_id":"4998","date_created":"2018-12-12T10:13:17Z","file_name":"IST-2018-991-v1+2_2018_Chatterjee_Pushdown_PREPRINT.pdf","creator":"system","file_size":247657,"date_updated":"2019-10-15T07:44:51Z","access_level":"open_access"}],"article_processing_charge":"No"},{"article_processing_charge":"No","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."}],"_id":"1180","date_published":"2017-02-21T00:00:00Z","publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/1508.07594","open_access":"1"}],"oa":1,"volume":308,"publist_id":"6173","year":"2017","oa_version":"Submitted Version","scopus_import":"1","external_id":{"isi":["000409292900015"]},"date_updated":"2023-09-20T11:21:27Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"issn":["00018708"]},"page":"627 - 644","month":"02","date_created":"2018-12-11T11:50:34Z","publisher":"Academic Press","isi":1,"publication":"Advances in Mathematics","department":[{"_id":"HeEd"}],"quality_controlled":"1","intvolume":"       308","status":"public","citation":{"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>.","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.","ista":"Akopyan A, Bárány I, Robins S. 2017. Algebraic vertices of non-convex polyhedra. Advances in Mathematics. 308, 627–644.","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>.","short":"A. Akopyan, I. Bárány, S. Robins, Advances in Mathematics 308 (2017) 627–644.","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>","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>"},"ec_funded":1,"title":"Algebraic vertices of non-convex polyhedra","day":"21","type":"journal_article","author":[{"last_name":"Akopyan","full_name":"Akopyan, Arseniy","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X"},{"last_name":"Bárány","first_name":"Imre","full_name":"Bárány, Imre"},{"last_name":"Robins","full_name":"Robins, Sinai","first_name":"Sinai"}],"project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.aim.2016.12.026"},{"volume":67,"oa":1,"main_file_link":[{"url":"https://doi.org/10.4230/LIPICS.ITCS.2017.26","open_access":"1"}],"publication_status":"published","_id":"11829","date_published":"2017-11-28T00:00:00Z","abstract":[{"text":"In recent years it has become popular to study dynamic problems in a sensitivity setting: Instead of allowing for an arbitrary sequence of updates, the sensitivity model only allows to apply batch updates of small size to the original input data. The sensitivity model is particularly appealing since recent strong conditional lower bounds ruled out fast algorithms for many dynamic problems, such as shortest paths, reachability, or subgraph connectivity.\r\n\r\nIn this paper we prove conditional lower bounds for these and additional problems in a sensitivity setting. For example, we show that under the Boolean Matrix Multiplication (BMM) conjecture combinatorial algorithms cannot compute the (4/3-\\varepsilon)-approximate diameter of an undirected unweighted dense graph with truly subcubic preprocessing time and truly subquadratic update/query time. This result is surprising since in the static setting it is not clear whether a reduction from BMM to diameter is possible. We further show under the BMM conjecture that many problems, such as reachability or approximate shortest paths, cannot be solved faster than by recomputation from scratch even after only one or two edge insertions. We extend our reduction from BMM to Diameter to give a reduction from All Pairs Shortest Paths to Diameter under one deletion in weighted graphs. This is intriguing, as in the static setting it is a big open problem whether Diameter is as hard as APSP. We further get a nearly tight lower bound for shortest paths after two edge deletions based on the APSP conjecture. We give more lower bounds under the Strong Exponential Time Hypothesis. Many of our lower bounds also hold for static oracle data structures where no sensitivity is required.\r\n\r\nFinally, we give the first algorithm for the (1+\\varepsilon)-approximate radius, diameter, and eccentricity problems in directed or undirected unweighted graphs in case of single edges failures. The algorithm has a truly subcubic running time for graphs with a truly subquadratic number of edges; it is tight w.r.t. the conditional lower bounds we obtain.","lang":"eng"}],"article_number":"26","article_processing_charge":"No","arxiv":1,"publication_identifier":{"isbn":["9783959770293"],"issn":["1868-8969"]},"date_updated":"2023-02-16T11:49:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1703.01638"]},"scopus_import":"1","year":"2017","oa_version":"Published Version","status":"public","intvolume":"        67","quality_controlled":"1","publication":"8th Innovations in Theoretical Computer Science Conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2022-08-12T08:55:33Z","extern":"1","month":"11","doi":"10.4230/LIPICS.ITCS.2017.26","language":[{"iso":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Andrea","full_name":"Lincoln, Andrea","last_name":"Lincoln"},{"first_name":"Stefan","full_name":"Neumann, Stefan","last_name":"Neumann"},{"last_name":"Vassilevska Williams","full_name":"Vassilevska Williams, Virginia","first_name":"Virginia"}],"day":"28","conference":{"location":"Berkley, CA, United States","start_date":"2017-01-09","end_date":"2017-01-11","name":"ITCS: Innovations in Theoretical Computer Science Conference"},"title":"Conditional hardness for sensitivity problems","citation":{"mla":"Henzinger, Monika H., et al. “Conditional Hardness for Sensitivity Problems.” <i>8th Innovations in Theoretical Computer Science Conference</i>, vol. 67, 26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPICS.ITCS.2017.26\">10.4230/LIPICS.ITCS.2017.26</a>.","chicago":"Henzinger, Monika H, Andrea Lincoln, Stefan Neumann, and Virginia Vassilevska Williams. “Conditional Hardness for Sensitivity Problems.” In <i>8th Innovations in Theoretical Computer Science Conference</i>, Vol. 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPICS.ITCS.2017.26\">https://doi.org/10.4230/LIPICS.ITCS.2017.26</a>.","ista":"Henzinger MH, Lincoln A, Neumann S, Vassilevska Williams V. 2017. Conditional hardness for sensitivity problems. 8th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science Conference, LIPIcs, vol. 67, 26.","ieee":"M. H. Henzinger, A. Lincoln, S. Neumann, and V. Vassilevska Williams, “Conditional hardness for sensitivity problems,” in <i>8th Innovations in Theoretical Computer Science Conference</i>, Berkley, CA, United States, 2017, vol. 67.","ama":"Henzinger MH, Lincoln A, Neumann S, Vassilevska Williams V. Conditional hardness for sensitivity problems. In: <i>8th Innovations in Theoretical Computer Science Conference</i>. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPICS.ITCS.2017.26\">10.4230/LIPICS.ITCS.2017.26</a>","apa":"Henzinger, M. H., Lincoln, A., Neumann, S., &#38; Vassilevska Williams, V. (2017). Conditional hardness for sensitivity problems. In <i>8th Innovations in Theoretical Computer Science Conference</i> (Vol. 67). Berkley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ITCS.2017.26\">https://doi.org/10.4230/LIPICS.ITCS.2017.26</a>","short":"M.H. Henzinger, A. Lincoln, S. Neumann, V. Vassilevska Williams, in:, 8th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017."}},{"related_material":{"record":[{"status":"public","id":"11894","relation":"later_version"}]},"language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.ESA.2017.44","citation":{"ama":"Goranci G, Henzinger MH, Peng P. Improved guarantees for vertex sparsification in planar graphs. In: <i>25th Annual European Symposium on Algorithms</i>. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.44\">10.4230/LIPICS.ESA.2017.44</a>","apa":"Goranci, G., Henzinger, M. H., &#38; Peng, P. (2017). Improved guarantees for vertex sparsification in planar graphs. In <i>25th Annual European Symposium on Algorithms</i> (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.44\">https://doi.org/10.4230/LIPICS.ESA.2017.44</a>","short":"G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Goranci, Gramoz, et al. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” <i>25th Annual European Symposium on Algorithms</i>, vol. 87, 44, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.44\">10.4230/LIPICS.ESA.2017.44</a>.","chicago":"Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” In <i>25th Annual European Symposium on Algorithms</i>, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.44\">https://doi.org/10.4230/LIPICS.ESA.2017.44</a>.","ista":"Goranci G, Henzinger MH, Peng P. 2017. Improved guarantees for vertex sparsification in planar graphs. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 44.","ieee":"G. Goranci, M. H. Henzinger, and P. Peng, “Improved guarantees for vertex sparsification in planar graphs,” in <i>25th Annual European Symposium on Algorithms</i>, Vienna, Austria, 2017, vol. 87."},"conference":{"location":"Vienna, Austria","start_date":"2017-09-04","end_date":"2017-09-06","name":"ESA: Annual European Symposium on Algorithms"},"title":"Improved guarantees for vertex sparsification in planar graphs","day":"01","alternative_title":["LIPIcs"],"type":"conference","author":[{"first_name":"Gramoz","full_name":"Goranci, Gramoz","last_name":"Goranci"},{"last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Pan","full_name":"Peng, Pan","last_name":"Peng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","publication":"25th Annual European Symposium on Algorithms","intvolume":"        87","status":"public","extern":"1","month":"09","date_created":"2022-08-12T09:27:11Z","date_updated":"2023-02-21T16:32:16Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1702.01136"]},"scopus_import":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-049-1"]},"oa_version":"Published Version","year":"2017","publication_status":"published","oa":1,"main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2017.44","open_access":"1"}],"volume":87,"arxiv":1,"article_processing_charge":"No","article_number":"44","date_published":"2017-09-01T00:00:00Z","_id":"11831","abstract":[{"lang":"eng","text":"Graph Sparsification aims at compressing large graphs into smaller ones while (approximately) preserving important characteristics of the input graph. In this work we study Vertex Sparsifiers, i.e., sparsifiers whose goal is to reduce the number of vertices. Given a weighted graph G=(V,E), and a terminal set K with |K|=k, a quality-q vertex cut sparsifier of G is a graph H with K contained in V_H that preserves the value of minimum cuts separating any bipartition of K, up to a factor of q. We show that planar graphs with all the k terminals lying on the same face admit quality-1 vertex cut sparsifier of size O(k^2) that are also planar. Our result extends to vertex flow and distance sparsifiers. It improves the previous best known bound of O(k^2 2^(2k)) for cut and flow sparsifiers by an exponential factor, and matches an Omega(k^2) lower-bound for this class of graphs.\r\n\r\nWe also study vertex reachability sparsifiers for directed graphs. Given a digraph G=(V,E) and a terminal set K, a vertex reachability sparsifier of G is a digraph H=(V_H,E_H), K contained in V_H that preserves all reachability information among terminal pairs. We introduce the notion of reachability-preserving minors, i.e., we require H to be a minor of G. Among others, for general planar digraphs, we construct reachability-preserving minors of size O(k^2 log^2 k). We complement our upper-bound by showing that there exists an infinite family of acyclic planar digraphs such that any reachability-preserving minor must have Omega(k^2) vertices."}]},{"scopus_import":"1","external_id":{"arxiv":["1707.02577"]},"date_updated":"2023-02-16T11:54:12Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-049-1"]},"oa_version":"Published Version","year":"2017","volume":87,"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPICS.ESA.2017.48"}],"oa":1,"article_number":"48","date_published":"2017-09-01T00:00:00Z","_id":"11832","abstract":[{"text":"In this paper, we study the problem of opening centers to cluster a set of clients in a metric space so as to minimize the sum of the costs of the centers and of the cluster radii, in a dynamic environment where clients arrive and depart, and the solution must be updated efficiently while remaining competitive with respect to the current optimal solution. We call this dynamic sum-of-radii clustering problem.\r\n\r\nWe present a data structure that maintains a solution whose cost is within a constant factor of the cost of an optimal solution in metric spaces with bounded doubling dimension and whose worst-case update time is logarithmic in the parameters of the problem.","lang":"eng"}],"arxiv":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.ESA.2017.48","day":"01","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"last_name":"Leniowski","full_name":"Leniowski, Dariusz","first_name":"Dariusz"},{"first_name":"Claire","full_name":"Mathieu, Claire","last_name":"Mathieu"}],"type":"conference","alternative_title":["LIPIcs"],"citation":{"ista":"Henzinger MH, Leniowski D, Mathieu C. 2017. Dynamic clustering to minimize the sum of radii. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 48.","ieee":"M. H. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” in <i>25th Annual European Symposium on Algorithms</i>, Vienna, Austria, 2017, vol. 87.","chicago":"Henzinger, Monika H, Dariusz Leniowski, and Claire Mathieu. “Dynamic Clustering to Minimize the Sum of Radii.” In <i>25th Annual European Symposium on Algorithms</i>, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.48\">https://doi.org/10.4230/LIPICS.ESA.2017.48</a>.","mla":"Henzinger, Monika H., et al. “Dynamic Clustering to Minimize the Sum of Radii.” <i>25th Annual European Symposium on Algorithms</i>, vol. 87, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.48\">10.4230/LIPICS.ESA.2017.48</a>.","short":"M.H. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","apa":"Henzinger, M. H., Leniowski, D., &#38; Mathieu, C. (2017). Dynamic clustering to minimize the sum of radii. In <i>25th Annual European Symposium on Algorithms</i> (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.48\">https://doi.org/10.4230/LIPICS.ESA.2017.48</a>","ama":"Henzinger MH, Leniowski D, Mathieu C. Dynamic clustering to minimize the sum of radii. In: <i>25th Annual European Symposium on Algorithms</i>. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.48\">10.4230/LIPICS.ESA.2017.48</a>"},"title":"Dynamic clustering to minimize the sum of radii","conference":{"location":"Vienna, Austria","name":"ESA: Annual European Symposium on Algorithms","start_date":"2017-09-04","end_date":"2017-09-06"},"publication":"25th Annual European Symposium on Algorithms","quality_controlled":"1","status":"public","intvolume":"        87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","month":"09","extern":"1","date_created":"2022-08-12T09:58:46Z"},{"arxiv":1,"article_processing_charge":"No","article_number":"45","abstract":[{"text":"We introduce a new algorithmic framework for designing dynamic graph algorithms in minor-free graphs, by exploiting the structure of such graphs and a tool called vertex sparsification, which is a way to compress large graphs into small ones that well preserve relevant properties among a subset of vertices and has previously mainly been used in the design of approximation algorithms.\r\n\r\nUsing this framework, we obtain a Monte Carlo randomized fully dynamic algorithm for (1 + epsilon)-approximating the energy of electrical flows in n-vertex planar graphs with tilde{O}(r epsilon^{-2}) worst-case update time and tilde{O}((r + n / sqrt{r}) epsilon^{-2}) worst-case query time, for any r larger than some constant. For r=n^{2/3}, this gives tilde{O}(n^{2/3} epsilon^{-2}) update time and tilde{O}(n^{2/3} epsilon^{-2}) query time. We also extend this algorithm to work for minor-free graphs with similar approximation and running time guarantees. Furthermore, we illustrate our framework on the all-pairs max flow and shortest path problems by giving corresponding dynamic algorithms in minor-free graphs with both sublinear update and query times. To the best of our knowledge, our results are the first to systematically establish such a connection between dynamic graph algorithms and vertex sparsification.\r\n\r\nWe also present both upper bound and lower bound for maintaining the energy of electrical flows in the incremental subgraph model, where updates consist of only vertex activations, which might be of independent interest.","lang":"eng"}],"_id":"11833","date_published":"2017-09-01T00:00:00Z","publication_status":"published","oa":1,"main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2017.45","open_access":"1"}],"volume":87,"oa_version":"Published Version","year":"2017","external_id":{"arxiv":["1712.06473"]},"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-16T11:56:37Z","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-049-1"]},"month":"09","extern":"1","date_created":"2022-08-12T10:46:26Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication":"25th Annual European Symposium on Algorithms","quality_controlled":"1","status":"public","intvolume":"        87","citation":{"short":"G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","apa":"Goranci, G., Henzinger, M. H., &#38; Peng, P. (2017). The power of vertex sparsifiers in dynamic graph algorithms. In <i>25th Annual European Symposium on Algorithms</i> (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.45\">https://doi.org/10.4230/LIPICS.ESA.2017.45</a>","ama":"Goranci G, Henzinger MH, Peng P. The power of vertex sparsifiers in dynamic graph algorithms. In: <i>25th Annual European Symposium on Algorithms</i>. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.45\">10.4230/LIPICS.ESA.2017.45</a>","ista":"Goranci G, Henzinger MH, Peng P. 2017. The power of vertex sparsifiers in dynamic graph algorithms. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 45.","ieee":"G. Goranci, M. H. Henzinger, and P. Peng, “The power of vertex sparsifiers in dynamic graph algorithms,” in <i>25th Annual European Symposium on Algorithms</i>, Vienna, Austria, 2017, vol. 87.","chicago":"Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.” In <i>25th Annual European Symposium on Algorithms</i>, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.45\">https://doi.org/10.4230/LIPICS.ESA.2017.45</a>.","mla":"Goranci, Gramoz, et al. “The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.” <i>25th Annual European Symposium on Algorithms</i>, vol. 87, 45, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.45\">10.4230/LIPICS.ESA.2017.45</a>."},"title":"The power of vertex sparsifiers in dynamic graph algorithms","conference":{"name":"ESA: Annual European Symposium on Algorithms","end_date":"2017-09-06","start_date":"2017-09-04","location":"Vienna, Austria"},"day":"01","author":[{"last_name":"Goranci","first_name":"Gramoz","full_name":"Goranci, Gramoz"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Peng","full_name":"Peng, Pan","first_name":"Pan"}],"type":"conference","alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.ESA.2017.45"},{"isi":1,"publisher":"Springer","intvolume":"        30","status":"public","publication":"Journal of Cryptology","quality_controlled":"1","department":[{"_id":"KrPi"}],"page":"1238 - 1275","date_created":"2018-12-11T11:50:37Z","month":"10","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815"},{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668"}],"related_material":{"record":[{"id":"3238","relation":"earlier_version","status":"public"}]},"ddc":["000"],"doi":"10.1007/s00145-016-9247-3","language":[{"iso":"eng"}],"title":"Efficient authentication from hard learning problems","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.","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.","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>.","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>.","short":"E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 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>","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>"},"ec_funded":1,"author":[{"last_name":"Kiltz","first_name":"Eike","full_name":"Kiltz, Eike"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"},{"last_name":"Venturi","full_name":"Venturi, Daniele","first_name":"Daniele"},{"full_name":"Cash, David","first_name":"David","last_name":"Cash"},{"last_name":"Jain","first_name":"Abhishek","full_name":"Jain, Abhishek"}],"type":"journal_article","day":"01","oa":1,"publication_status":"published","volume":30,"file_date_updated":"2020-07-14T12:44:37Z","article_processing_charge":"No","issue":"4","_id":"1187","date_published":"2017-10-01T00:00:00Z","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"}],"file":[{"creator":"dernst","file_size":516959,"file_name":"2017_JournalCrypto_Kiltz.pdf","access_level":"open_access","date_updated":"2020-07-14T12:44:37Z","checksum":"c647520d115b772a1682fc06fa273eb1","file_id":"7843","relation":"main_file","content_type":"application/pdf","date_created":"2020-05-14T16:30:17Z"}],"scopus_import":"1","external_id":{"isi":["000410788600007"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-20T11:20:58Z","oa_version":"Submitted Version","year":"2017","has_accepted_license":"1","article_type":"original","publist_id":"6166"},{"oa_version":"Preprint","year":"2017","scopus_import":"1","external_id":{"arxiv":["1704.01254"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T16:32:01Z","publication_identifier":{"eisbn":["978-161197478-2"]},"arxiv":1,"article_processing_charge":"No","abstract":[{"text":"We study the problem of computing a minimum cut in a simple, undirected graph and give a deterministic O(m log2 n log log2 n) time algorithm. This improves both on the best previously known deterministic running time of O(m log12 n) (Kawarabayashi and Thorup [12]) and the best previously known randomized running time of O(mlog3n) (Karger [11]) for this problem, though Karger's algorithm can be further applied to weighted graphs.\r\n\r\nOur approach is using the Kawarabayashi and Tho- rup graph compression technique, which repeatedly finds low-conductance cuts. To find these cuts they use a diffusion-based local algorithm. We use instead a flow- based local algorithm and suitably adjust their framework to work with our flow-based subroutine. Both flow and diffusion based methods have a long history of being applied to finding low conductance cuts. Diffusion algorithms have several variants that are naturally local while it is more complicated to make flow methods local. Some prior work has proven nice properties for local flow based algorithms with respect to improving or cleaning up low conductance cuts. Our flow subroutine, however, is the first that is both local and produces low conductance cuts. Thus, it may be of independent interest.","lang":"eng"}],"_id":"11873","date_published":"2017-01-01T00:00:00Z","publication_status":"published","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1704.01254","open_access":"1"}],"citation":{"ieee":"M. H. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster edge connectivity,” in <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Barcelona, Spain, 2017, pp. 1919–1938.","ista":"Henzinger MH, Rao S, Wang D. 2017. Local flow partitioning for faster edge connectivity. 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1919–1938.","chicago":"Henzinger, Monika H, Satish Rao, and Di Wang. “Local Flow Partitioning for Faster Edge Connectivity.” In <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1919–38. Society for Industrial and Applied Mathematics, 2017. <a href=\"https://doi.org/10.1137/1.9781611974782.125\">https://doi.org/10.1137/1.9781611974782.125</a>.","mla":"Henzinger, Monika H., et al. “Local Flow Partitioning for Faster Edge Connectivity.” <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2017, pp. 1919–38, doi:<a href=\"https://doi.org/10.1137/1.9781611974782.125\">10.1137/1.9781611974782.125</a>.","short":"M.H. Henzinger, S. Rao, D. Wang, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 1919–1938.","apa":"Henzinger, M. H., Rao, S., &#38; Wang, D. (2017). Local flow partitioning for faster edge connectivity. In <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1919–1938). Barcelona, Spain: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611974782.125\">https://doi.org/10.1137/1.9781611974782.125</a>","ama":"Henzinger MH, Rao S, Wang D. Local flow partitioning for faster edge connectivity. In: <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2017:1919-1938. doi:<a href=\"https://doi.org/10.1137/1.9781611974782.125\">10.1137/1.9781611974782.125</a>"},"title":"Local flow partitioning for faster edge connectivity","conference":{"location":"Barcelona, Spain","name":"SODA: Symposium on Discrete Algorithms","end_date":"2017-01-19","start_date":"2017-01-16"},"day":"01","type":"conference","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"last_name":"Rao","full_name":"Rao, Satish","first_name":"Satish"},{"full_name":"Wang, Di","first_name":"Di","last_name":"Wang"}],"related_material":{"record":[{"id":"11889","relation":"earlier_version","status":"public"}]},"language":[{"iso":"eng"}],"doi":"10.1137/1.9781611974782.125","page":"1919-1938","month":"01","extern":"1","date_created":"2022-08-16T12:20:59Z","publisher":"Society for Industrial and Applied Mathematics","publication":"28th Annual ACM-SIAM Symposium on Discrete Algorithms","quality_controlled":"1","status":"public"}]