[{"oa_version":"Preprint","quality_controlled":"1","doi":"10.1007/978-3-662-53641-4_8","volume":9985,"month":"10","acknowledgement":"K. Pietrzak—Supported by the European Research Council consolidator grant (682815-TOCNeT).\r\nM. Skórski—Supported by the National Science Center, Poland (2015/17/N/ST6/03564).","ec_funded":1,"year":"2016","intvolume":" 9985","publist_id":"6175","_id":"1179","isi":1,"day":"22","date_updated":"2025-09-22T09:48:49Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"apa":"Pietrzak, K. Z., & Maciej, S. (2016). Pseudoentropy: Lower-bounds for chain rules and transformations (Vol. 9985, pp. 183–203). Presented at the TCC: Theory of Cryptography Conference, Beijing, China: Springer. https://doi.org/10.1007/978-3-662-53641-4_8","mla":"Pietrzak, Krzysztof Z., and Skorski Maciej. Pseudoentropy: Lower-Bounds for Chain Rules and Transformations. Vol. 9985, Springer, 2016, pp. 183–203, doi:10.1007/978-3-662-53641-4_8.","ieee":"K. Z. Pietrzak and S. Maciej, “Pseudoentropy: Lower-bounds for chain rules and transformations,” presented at the TCC: Theory of Cryptography Conference, Beijing, China, 2016, vol. 9985, pp. 183–203.","chicago":"Pietrzak, Krzysztof Z, and Skorski Maciej. “Pseudoentropy: Lower-Bounds for Chain Rules and Transformations,” 9985:183–203. Springer, 2016. https://doi.org/10.1007/978-3-662-53641-4_8.","ista":"Pietrzak KZ, Maciej S. 2016. Pseudoentropy: Lower-bounds for chain rules and transformations. TCC: Theory of Cryptography Conference, LNCS, vol. 9985, 183–203.","ama":"Pietrzak KZ, Maciej S. Pseudoentropy: Lower-bounds for chain rules and transformations. In: Vol 9985. Springer; 2016:183-203. doi:10.1007/978-3-662-53641-4_8","short":"K.Z. Pietrzak, S. Maciej, in:, Springer, 2016, pp. 183–203."},"title":"Pseudoentropy: Lower-bounds for chain rules and transformations","alternative_title":["LNCS"],"page":"183 - 203","article_processing_charge":"No","date_created":"2018-12-11T11:50:34Z","status":"public","language":[{"iso":"eng"}],"conference":{"location":"Beijing, China","end_date":"2016-11-03","start_date":"2016-10-31","name":"TCC: Theory of Cryptography Conference"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/159"}],"external_id":{"isi":["000390176000008"]},"project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"department":[{"_id":"KrPi"}],"publication_status":"published","oa":1,"author":[{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"},{"first_name":"Skorski","last_name":"Maciej","full_name":"Maciej, Skorski"}],"abstract":[{"text":"Computational notions of entropy have recently found many applications, including leakage-resilient cryptography, deterministic encryption or memory delegation. The two main types of results which make computational notions so useful are (1) Chain rules, which quantify by how much the computational entropy of a variable decreases if conditioned on some other variable (2) Transformations, which quantify to which extend one type of entropy implies another.\r\n\r\nSuch chain rules and transformations typically lose a significant amount in quality of the entropy, and are the reason why applying these results one gets rather weak quantitative security bounds. In this paper we for the first time prove lower bounds in this context, showing that existing results for transformations are, unfortunately, basically optimal for non-adaptive black-box reductions (and it’s hard to imagine how non black-box reductions or adaptivity could be useful here.)\r\n\r\nA variable X has k bits of HILL entropy of quality (ϵ,s)\r\nif there exists a variable Y with k bits min-entropy which cannot be distinguished from X with advantage ϵ\r\n\r\nby distinguishing circuits of size s. A weaker notion is Metric entropy, where we switch quantifiers, and only require that for every distinguisher of size s, such a Y exists.\r\n\r\nWe first describe our result concerning transformations. By definition, HILL implies Metric without any loss in quality. Metric entropy often comes up in applications, but must be transformed to HILL for meaningful security guarantees. The best known result states that if a variable X has k bits of Metric entropy of quality (ϵ,s)\r\n, then it has k bits of HILL with quality (2ϵ,s⋅ϵ2). We show that this loss of a factor Ω(ϵ−2)\r\n\r\nin circuit size is necessary. In fact, we show the stronger result that this loss is already necessary when transforming so called deterministic real valued Metric entropy to randomised boolean Metric (both these variants of Metric entropy are implied by HILL without loss in quality).\r\n\r\nThe chain rule for HILL entropy states that if X has k bits of HILL entropy of quality (ϵ,s)\r\n, then for any variable Z of length m, X conditioned on Z has k−m bits of HILL entropy with quality (ϵ,s⋅ϵ2/2m). We show that a loss of Ω(2m/ϵ) in circuit size necessary here. Note that this still leaves a gap of ϵ between the known bound and our lower bound.","lang":"eng"}],"date_published":"2016-10-22T00:00:00Z","type":"conference","publisher":"Springer","scopus_import":"1"},{"external_id":{"isi":["000391054300003"]},"project":[{"_id":"25D7962E-B435-11E9-9278-68D0E5697425","name":"Quantitative Structure-Function Analysis of Cerebral Cortex Assembly at Clonal Level","grant_number":"RGP0053/2014"}],"author":[{"last_name":"Dwyer","full_name":"Dwyer, Noelle","first_name":"Noelle"},{"first_name":"Bin","full_name":"Chen, Bin","last_name":"Chen"},{"first_name":"Shen","last_name":"Chou","full_name":"Chou, Shen"},{"first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer"},{"full_name":"Nguyen, Laurent","last_name":"Nguyen","first_name":"Laurent"},{"last_name":"Ghashghaei","full_name":"Ghashghaei, Troy","first_name":"Troy"}],"department":[{"_id":"SiHi"}],"publication_status":"published","publisher":"Society for Neuroscience","scopus_import":"1","date_published":"2016-11-09T00:00:00Z","type":"journal_article","abstract":[{"text":"This review accompanies a 2016 SFN mini-symposium presenting examples of current studies that address a central question: How do neural stem cells (NSCs) divide in different ways to produce heterogeneous daughter types at the right time and in proper numbers to build a cerebral cortex with the appropriate size and structure? We will focus on four aspects of corticogenesis: cytokinesis events that follow apical mitoses of NSCs; coordinating abscission with delamination from the apical membrane; timing of neurogenesis and its indirect regulation through emergence of intermediate progenitors; and capacity of single NSCs to generate the correct number and laminar fate of cortical neurons. Defects in these mechanisms can cause microcephaly and other brain malformations, and understanding them is critical to designing diagnostic tools and preventive and corrective therapies.","lang":"eng"}],"title":"Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity","publication":"Journal of Neuroscience","status":"public","article_processing_charge":"No","date_created":"2018-12-11T11:50:35Z","page":"11394 - 11401","language":[{"iso":"eng"}],"year":"2016","_id":"1181","publist_id":"6172","intvolume":" 36","date_updated":"2025-09-22T09:48:17Z","day":"09","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"chicago":"Dwyer, Noelle, Bin Chen, Shen Chou, Simon Hippenmeyer, Laurent Nguyen, and Troy Ghashghaei. “Neural Stem Cells to Cerebral Cortex: Emerging Mechanisms Regulating Progenitor Behavior and Productivity.” Journal of Neuroscience. Society for Neuroscience, 2016. https://doi.org/10.1523/JNEUROSCI.2359-16.2016.","ista":"Dwyer N, Chen B, Chou S, Hippenmeyer S, Nguyen L, Ghashghaei T. 2016. Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity. Journal of Neuroscience. 36(45), 11394–11401.","ama":"Dwyer N, Chen B, Chou S, Hippenmeyer S, Nguyen L, Ghashghaei T. Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity. Journal of Neuroscience. 2016;36(45):11394-11401. doi:10.1523/JNEUROSCI.2359-16.2016","ieee":"N. Dwyer, B. Chen, S. Chou, S. Hippenmeyer, L. Nguyen, and T. Ghashghaei, “Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity,” Journal of Neuroscience, vol. 36, no. 45. Society for Neuroscience, pp. 11394–11401, 2016.","short":"N. Dwyer, B. Chen, S. Chou, S. Hippenmeyer, L. Nguyen, T. Ghashghaei, Journal of Neuroscience 36 (2016) 11394–11401.","apa":"Dwyer, N., Chen, B., Chou, S., Hippenmeyer, S., Nguyen, L., & Ghashghaei, T. (2016). Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.2359-16.2016","mla":"Dwyer, Noelle, et al. “Neural Stem Cells to Cerebral Cortex: Emerging Mechanisms Regulating Progenitor Behavior and Productivity.” Journal of Neuroscience, vol. 36, no. 45, Society for Neuroscience, 2016, pp. 11394–401, doi:10.1523/JNEUROSCI.2359-16.2016."},"doi":"10.1523/JNEUROSCI.2359-16.2016","quality_controlled":"1","oa_version":"None","issue":"45","month":"11","volume":36,"acknowledgement":"This work was supported by National Institutes of Health Grants R01NS089795 and R01NS098370 to H.T.G., R01NS076640 to N.D.D., and R01MH094589 and R01NS089777 to B.C., Academia Sinica AS-104-TPB09-2 to S.-J.C, European Union FP7-CIG618444 and Human Frontiers Science Program RGP0053 to S.H., and Fonds Léon Fredericq, from the Fondation Médicale Reine Elisabeth, and from the Fonation Simone et Pierre Clerdent to L.N. The authors apologize to colleagues whose work could not be cited due to space limitations."},{"_id":"1182","publist_id":"6171","year":"2016","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. Robust Draws in Balanced Knockout Tournaments. Vol. 2016–January, AAAI Press, 2016, pp. 172–79.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.","short":"K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.","ama":"Chatterjee K, Ibsen-Jensen R, Tkadlec J. Robust draws in balanced knockout tournaments. In: Vol 2016-January. AAAI Press; 2016:172-179.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and J. Tkadlec, “Robust draws in balanced knockout tournaments,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA, 2016, vol. 2016–January, pp. 172–179.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.","ista":"Chatterjee K, Ibsen-Jensen R, Tkadlec J. 2016. Robust draws in balanced knockout tournaments. IJCAI: International Joint Conference on Artificial Intelligence vol. 2016–January, 172–179."},"day":"01","date_updated":"2025-04-22T13:42:22Z","quality_controlled":"1","oa_version":"Preprint","month":"01","volume":"2016-January","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["1604.05090"]},"main_file_link":[{"url":"https://arxiv.org/abs/1604.05090","open_access":"1"}],"publisher":"AAAI Press","scopus_import":"1","abstract":[{"text":"Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decisionmaking and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning probability for a distinguished player, has received a lot of attention. Previous works consider the problem where the pairwise winning probabilities are known precisely, while we study how robust is the winning probability with respect to small errors in the pairwise winning probabilities. First, we present several illuminating examples to establish: (a) there exist deterministic tournaments (where the pairwise winning probabilities are 0 or 1) where one optimal draw is much more robust than the other; and (b) in general, there exist tournaments with slightly suboptimal draws that are more robust than all the optimal draws. The above examples motivate the study of the computational problem of robust draws that guarantee a specified winning probability. Second, we present a polynomial-time algorithm for approximating the robustness of a draw for sufficiently small errors in pairwise winning probabilities, and obtain that the stated computational problem is NP-complete. We also show that two natural cases of deterministic tournaments where the optimal draw could be computed in polynomial time also admit polynomial-time algorithms to compute robust optimal draws.","lang":"eng"}],"date_published":"2016-01-01T00:00:00Z","type":"conference","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef"}],"related_material":{"link":[{"relation":"table_of_contents","url":"https://www.ijcai.org/proceedings/2016"}]},"oa":1,"publication_status":"published","department":[{"_id":"KrCh"}],"status":"public","date_created":"2018-12-11T11:50:35Z","article_processing_charge":"No","page":"172 - 179","title":"Robust draws in balanced knockout tournaments","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2016-07-15","start_date":"2016-07-09","location":"New York, NY, USA"},"arxiv":1,"corr_author":"1","language":[{"iso":"eng"}]},{"volume":57,"month":"08","quality_controlled":"1","oa_version":"Published Version","doi":"10.4230/LIPICS.ESA.2016.46","citation":{"mla":"Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized Update Time.” 24th Annual European Symposium on Algorithms, vol. 57, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ESA.2016.46.","apa":"Goranci, G., Henzinger, M., & Thorup, M. (2016). Incremental exact min-cut in poly-logarithmic amortized update time. In 24th Annual European Symposium on Algorithms (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2016.46","short":"G. Goranci, M. Henzinger, M. Thorup, in:, 24th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ista":"Goranci G, Henzinger M, Thorup M. 2016. Incremental exact min-cut in poly-logarithmic amortized update time. 24th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 57, 46.","ama":"Goranci G, Henzinger M, Thorup M. Incremental exact min-cut in poly-logarithmic amortized update time. In: 24th Annual European Symposium on Algorithms. Vol 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPICS.ESA.2016.46","chicago":"Goranci, Gramoz, Monika Henzinger, and Mikkel Thorup. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized Update Time.” In 24th Annual European Symposium on Algorithms, Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPICS.ESA.2016.46.","ieee":"G. Goranci, M. Henzinger, and M. Thorup, “Incremental exact min-cut in poly-logarithmic amortized update time,” in 24th Annual European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"18","date_updated":"2024-11-06T11:58:55Z","intvolume":" 57","_id":"11834","year":"2016","language":[{"iso":"eng"}],"conference":{"location":"Aarhus, Denmark","name":"ESA: Annual European Symposium on Algorithms","end_date":"2016-08-24","start_date":"2016-08-22"},"arxiv":1,"status":"public","article_processing_charge":"No","date_created":"2022-08-12T10:58:32Z","publication":"24th Annual European Symposium on Algorithms","alternative_title":["LIPIcs"],"title":"Incremental exact min-cut in poly-logarithmic amortized update time","scopus_import":"1","extern":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","abstract":[{"text":"We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with ~O(1) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup [Combinatorica 2007]. It also stays in sharp contrast to a polynomial conditional lower-bound for the fully-dynamic weighted minimum cut problem. Our algorithm is obtained by combining a recent sparsification technique of Kawarabayashi and Thorup [STOC 2015] and an exact incremental algorithm of Henzinger [J. of Algorithm 1997].\r\n\r\nWe also study space-efficient incremental algorithms for the minimum cut problem. Concretely, we show that there exists an O(n log n/epsilon^2) space Monte-Carlo algorithm that can process a stream of edge insertions starting from an empty graph, and with high probability, the algorithm maintains a (1+epsilon)-approximation to the minimum cut. The algorithm has ~O(1) amortized update-time and constant query-time.","lang":"eng"}],"type":"conference","date_published":"2016-08-18T00:00:00Z","oa":1,"publication_status":"published","publication_identifier":{"isbn":["978-3-95977-015-6"],"issn":["1868-8969"]},"author":[{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Thorup, Mikkel","last_name":"Thorup","first_name":"Mikkel"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2016.46"}],"article_number":"46","external_id":{"arxiv":["1611.06500"]}},{"volume":57,"month":"08","oa_version":"Published Version","quality_controlled":"1","doi":"10.4230/LIPICS.ESA.2016.48","day":"18","date_updated":"2024-11-06T11:59:06Z","citation":{"apa":"Henzinger, M., & Neumann, S. (2016). Incremental and fully dynamic subgraph connectivity for emergency planning. In 24th Annual European Symposium on Algorithms (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2016.48","mla":"Henzinger, Monika, and Stefan Neumann. “Incremental and Fully Dynamic Subgraph Connectivity for Emergency Planning.” 24th Annual European Symposium on Algorithms, vol. 57, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ESA.2016.48.","chicago":"Henzinger, Monika, and Stefan Neumann. “Incremental and Fully Dynamic Subgraph Connectivity for Emergency Planning.” In 24th Annual European Symposium on Algorithms, Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPICS.ESA.2016.48.","ista":"Henzinger M, Neumann S. 2016. Incremental and fully dynamic subgraph connectivity for emergency planning. 24th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 57, 48.","ieee":"M. Henzinger and S. Neumann, “Incremental and fully dynamic subgraph connectivity for emergency planning,” in 24th Annual European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.","ama":"Henzinger M, Neumann S. Incremental and fully dynamic subgraph connectivity for emergency planning. In: 24th Annual European Symposium on Algorithms. Vol 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPICS.ESA.2016.48","short":"M. Henzinger, S. Neumann, in:, 24th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2016","intvolume":" 57","_id":"11835","language":[{"iso":"eng"}],"conference":{"location":"Aarhus, Denmark","name":"ESA: Annual European Symposium on Algorithms","end_date":"2016-08-24","start_date":"2016-08-22"},"arxiv":1,"publication":"24th Annual European Symposium on Algorithms","title":"Incremental and fully dynamic subgraph connectivity for emergency planning","alternative_title":["LIPIcs"],"date_created":"2022-08-12T11:05:41Z","article_processing_charge":"No","status":"public","publication_status":"published","publication_identifier":{"isbn":["978-3-95977-015-6"],"issn":["1868-8969"]},"oa":1,"author":[{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Neumann","full_name":"Neumann, Stefan","first_name":"Stefan"}],"date_published":"2016-08-18T00:00:00Z","abstract":[{"text":"During the last 10 years it has become popular to study dynamic graph problems in a emergency planning or sensitivity setting: Instead of considering the general fully dynamic problem, we only have to process a single batch update of size d; after the update we have to answer queries.\r\n\r\nIn this paper, we consider the dynamic subgraph connectivity problem with sensitivity d: We are given a graph of which some vertices are activated and some are deactivated. After that we get a single update in which the states of up to $d$ vertices are changed. Then we get a sequence of connectivity queries in the subgraph of activated vertices.\r\n\r\nWe present the first fully dynamic algorithm for this problem which has an update and query time only slightly worse than the best decremental algorithm. In addition, we present the first incremental algorithm which is tight with respect to the best known conditional lower bound; moreover, the algorithm is simple and we believe it is implementable and efficient in practice.","lang":"eng"}],"type":"conference","extern":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2016.48"}],"article_number":"48","external_id":{"arxiv":["1611.05248"]}},{"arxiv":1,"conference":{"start_date":"2016-07-12","end_date":"2016-07-15","name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Rome, Italy"},"language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","date_created":"2022-08-12T11:16:01Z","alternative_title":["LIPIcs"],"title":"Graph minors for preserving terminal distances approximately - lower and upper bounds","publication":"43rd International Colloquium on Automata, Languages, and Programming","scopus_import":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","extern":"1","type":"conference","abstract":[{"lang":"eng","text":"Given a graph where vertices are partitioned into k terminals and non-terminals, the goal is to compress the graph (i.e., reduce the number of non-terminals) using minor operations while preserving terminal distances approximately. The distortion of a compressed graph is the maximum multiplicative blow-up of distances between all pairs of terminals. We study the trade-off between the number of non-terminals and the distortion. This problem generalizes the Steiner Point Removal (SPR) problem, in which all non-terminals must be removed.\r\n\r\nWe introduce a novel black-box reduction to convert any lower bound on distortion for the SPR problem into a super-linear lower bound on the number of non-terminals, with the same distortion, for our problem. This allows us to show that there exist graphs such that every minor with distortion less than 2 / 2.5 / 3 must have Omega(k^2) / Omega(k^{5/4}) / Omega(k^{6/5}) non-terminals, plus more trade-offs in between. The black-box reduction has an interesting consequence: if the tight lower bound on distortion for the SPR problem is super-constant, then allowing any O(k) non-terminals will not help improving the lower bound to a constant.\r\n\r\nWe also build on the existing results on spanners, distance oracles and connected 0-extensions to show a number of upper bounds for general graphs, planar graphs, graphs that exclude a fixed minor and bounded treewidth graphs. Among others, we show that any graph admits a minor with O(log k) distortion and O(k^2) non-terminals, and any planar graph admits a minor with\r\n1 + epsilon distortion and ~O((k/epsilon)^2) non-terminals."}],"date_published":"2016-08-23T00:00:00Z","author":[{"full_name":"Cheung, Yun Kuen","last_name":"Cheung","first_name":"Yun Kuen"},{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"}],"oa":1,"publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-013-2"]},"article_number":"131","external_id":{"arxiv":["1604.08342"]},"main_file_link":[{"url":"https://doi.org/10.4230/LIPICS.ICALP.2016.131","open_access":"1"}],"month":"08","volume":55,"doi":"10.4230/LIPICS.ICALP.2016.131","quality_controlled":"1","oa_version":"Published Version","citation":{"mla":"Cheung, Yun Kuen, et al. “Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.” 43rd International Colloquium on Automata, Languages, and Programming, vol. 55, 131, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ICALP.2016.131.","apa":"Cheung, Y. K., Goranci, G., & Henzinger, M. (2016). Graph minors for preserving terminal distances approximately - lower and upper bounds. In 43rd International Colloquium on Automata, Languages, and Programming (Vol. 55). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2016.131","short":"Y.K. Cheung, G. Goranci, M. Henzinger, in:, 43rd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ista":"Cheung YK, Goranci G, Henzinger M. 2016. Graph minors for preserving terminal distances approximately - lower and upper bounds. 43rd International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 55, 131.","chicago":"Cheung, Yun Kuen, Gramoz Goranci, and Monika Henzinger. “Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.” In 43rd International Colloquium on Automata, Languages, and Programming, Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPICS.ICALP.2016.131.","ama":"Cheung YK, Goranci G, Henzinger M. Graph minors for preserving terminal distances approximately - lower and upper bounds. In: 43rd International Colloquium on Automata, Languages, and Programming. Vol 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPICS.ICALP.2016.131","ieee":"Y. K. Cheung, G. Goranci, and M. Henzinger, “Graph minors for preserving terminal distances approximately - lower and upper bounds,” in 43rd International Colloquium on Automata, Languages, and Programming, Rome, Italy, 2016, vol. 55."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"23","date_updated":"2024-11-06T11:58:15Z","_id":"11836","intvolume":" 55","year":"2016"},{"citation":{"apa":"Metzler, S., Heinze, J., & Schrempf, A. (2016). Mating and longevity in ant males. Ecology and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.2474","mla":"Metzler, Sina, et al. “Mating and Longevity in Ant Males.” Ecology and Evolution, vol. 6, no. 24, Wiley-Blackwell, 2016, pp. 8903–06, doi:10.1002/ece3.2474.","ieee":"S. Metzler, J. Heinze, and A. Schrempf, “Mating and longevity in ant males,” Ecology and Evolution, vol. 6, no. 24. Wiley-Blackwell, pp. 8903–8906, 2016.","ama":"Metzler S, Heinze J, Schrempf A. Mating and longevity in ant males. Ecology and Evolution. 2016;6(24):8903-8906. doi:10.1002/ece3.2474","chicago":"Metzler, Sina, Jürgen Heinze, and Alexandra Schrempf. “Mating and Longevity in Ant Males.” Ecology and Evolution. Wiley-Blackwell, 2016. https://doi.org/10.1002/ece3.2474.","ista":"Metzler S, Heinze J, Schrempf A. 2016. Mating and longevity in ant males. Ecology and Evolution. 6(24), 8903–8906.","short":"S. Metzler, J. Heinze, A. Schrempf, Ecology and Evolution 6 (2016) 8903–8906."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"date_updated":"2025-09-22T09:47:16Z","day":"01","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"_id":"1184","intvolume":" 6","publist_id":"6169","year":"2016","pubrep_id":"736","acknowledgement":"German Science Foundation. Grant Number: SCHR 1135/2-1. We thank M. Adam for handling part of the setups and J. Zoellner for behavioral observations.","month":"12","volume":6,"has_accepted_license":"1","issue":"24","doi":"10.1002/ece3.2474","oa_version":"Published Version","quality_controlled":"1","ddc":["576","592"],"type":"journal_article","date_published":"2016-12-01T00:00:00Z","abstract":[{"text":"Across multicellular organisms, the costs of reproduction and self-maintenance result in a life history trade-off between fecundity and longevity. Queens of perennial social Hymenoptera are both highly fertile and long-lived, and thus, this fundamental trade-off is lacking. Whether social insect males similarly evade the fecundity/longevity trade-off remains largely unstudied. Wingless males of the ant genus Cardiocondyla stay in their natal colonies throughout their relatively long lives and mate with multiple female sexuals. Here, we show that Cardiocondyla obscurior males that were allowed to mate with large numbers of female sexuals had a shortened life span compared to males that mated at a low frequency or virgin males. Although frequent mating negatively affects longevity, males clearly benefit from a “live fast, die young strategy” by inseminating as many female sexuals as possible at a cost to their own survival.","lang":"eng"}],"scopus_import":"1","publisher":"Wiley-Blackwell","author":[{"id":"48204546-F248-11E8-B48F-1D18A9856A87","first_name":"Sina","orcid":"0000-0002-9547-2494","last_name":"Metzler","full_name":"Metzler, Sina"},{"first_name":"Jürgen","full_name":"Heinze, Jürgen","last_name":"Heinze"},{"last_name":"Schrempf","full_name":"Schrempf, Alexandra","first_name":"Alexandra"}],"department":[{"_id":"SyCr"}],"publication_status":"published","oa":1,"file_date_updated":"2020-07-14T12:44:37Z","external_id":{"isi":["000392063300022"]},"file":[{"file_name":"IST-2017-736-v1+1_Metzler_et_al-2016-Ecology_and_Evolution.pdf","file_id":"5062","access_level":"open_access","file_size":328414,"relation":"main_file","date_created":"2018-12-12T10:14:12Z","creator":"system","date_updated":"2020-07-14T12:44:37Z","checksum":"789026eb9e1be2a0da08376f29f569cf","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:50:36Z","article_processing_charge":"No","status":"public","page":"8903 - 8906","title":"Mating and longevity in ant males","publication":"Ecology and Evolution"},{"page":"4419 - 4424","status":"public","date_created":"2018-12-11T11:50:36Z","article_processing_charge":"No","publication":"Development","title":"Cytokinin response factors integrate auxin and cytokinin pathways for female reproductive organ development","language":[{"iso":"eng"}],"external_id":{"isi":["000393454100012"]},"publisher":"Company of Biologists","scopus_import":"1","abstract":[{"text":"The developmental programme of the pistil is under the control of both auxin and cytokinin. Crosstalk between these factors converges on regulation of the auxin carrier PIN-FORMED 1 (PIN1). Here, we show that in the triple transcription factor mutant cytokinin response factor 2 (crf2) crf3 crf6 both pistil length and ovule number were reduced. PIN1 expression was also lower in the triple mutant and the phenotypes could not be rescued by exogenous cytokinin application. pin1 complementation studies using genomic PIN1 constructs showed that the pistil phenotypes were only rescued when the PCRE1 domain, to which CRFs bind, was present. Without this domain, pin mutants resemble the crf2 crf3 crf6 triple mutant, indicating the pivotal role of CRFs in auxin-cytokinin crosstalk.","lang":"eng"}],"date_published":"2016-12-01T00:00:00Z","type":"journal_article","publication_status":"published","department":[{"_id":"EvBe"}],"author":[{"first_name":"Mara","last_name":"Cucinotta","full_name":"Cucinotta, Mara"},{"full_name":"Manrique, Silvia","last_name":"Manrique","first_name":"Silvia"},{"last_name":"Guazzotti","full_name":"Guazzotti, Andrea","first_name":"Andrea"},{"first_name":"Nadia","full_name":"Quadrelli, Nadia","last_name":"Quadrelli"},{"full_name":"Mendes, Marta","last_name":"Mendes","first_name":"Marta"},{"orcid":"0000-0002-8510-9739","last_name":"Benková","full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva"},{"first_name":"Lucia","last_name":"Colombo","full_name":"Colombo, Lucia"}],"issue":"23","quality_controlled":"1","oa_version":"None","doi":"10.1242/dev.143545","acknowledgement":"M.C. was funded by a PhD fellowship from the Università degli Studi di Milano-Bicocca and from Ministero dell'Istruzione, dell'Università e della Ricerca (MIUR) [MIUR-PRIN 2012]. L.C. is also supported by MIUR [MIUR-PRIN 2012]. We would like to thank Andrew MacCabe and Edward Kiegle for editing the paper.","volume":143,"month":"12","publist_id":"6168","intvolume":" 143","_id":"1185","year":"2016","citation":{"apa":"Cucinotta, M., Manrique, S., Guazzotti, A., Quadrelli, N., Mendes, M., Benková, E., & Colombo, L. (2016). Cytokinin response factors integrate auxin and cytokinin pathways for female reproductive organ development. Development. Company of Biologists. https://doi.org/10.1242/dev.143545","mla":"Cucinotta, Mara, et al. “Cytokinin Response Factors Integrate Auxin and Cytokinin Pathways for Female Reproductive Organ Development.” Development, vol. 143, no. 23, Company of Biologists, 2016, pp. 4419–24, doi:10.1242/dev.143545.","ista":"Cucinotta M, Manrique S, Guazzotti A, Quadrelli N, Mendes M, Benková E, Colombo L. 2016. Cytokinin response factors integrate auxin and cytokinin pathways for female reproductive organ development. Development. 143(23), 4419–4424.","ama":"Cucinotta M, Manrique S, Guazzotti A, et al. Cytokinin response factors integrate auxin and cytokinin pathways for female reproductive organ development. Development. 2016;143(23):4419-4424. doi:10.1242/dev.143545","chicago":"Cucinotta, Mara, Silvia Manrique, Andrea Guazzotti, Nadia Quadrelli, Marta Mendes, Eva Benková, and Lucia Colombo. “Cytokinin Response Factors Integrate Auxin and Cytokinin Pathways for Female Reproductive Organ Development.” Development. Company of Biologists, 2016. https://doi.org/10.1242/dev.143545.","ieee":"M. Cucinotta et al., “Cytokinin response factors integrate auxin and cytokinin pathways for female reproductive organ development,” Development, vol. 143, no. 23. Company of Biologists, pp. 4419–4424, 2016.","short":"M. Cucinotta, S. Manrique, A. Guazzotti, N. Quadrelli, M. Mendes, E. Benková, L. Colombo, Development 143 (2016) 4419–4424."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","date_updated":"2025-09-22T09:46:43Z","isi":1},{"ddc":["576","610"],"publisher":"Nature Publishing Group","scopus_import":"1","date_published":"2016-12-05T00:00:00Z","abstract":[{"text":"The human pathogen Streptococcus pneumoniae is decorated with a special class of surface-proteins known as choline-binding proteins (CBPs) attached to phosphorylcholine (PCho) moieties from cell-wall teichoic acids. By a combination of X-ray crystallography, NMR, molecular dynamics techniques and in vivo virulence and phagocytosis studies, we provide structural information of choline-binding protein L (CbpL) and demonstrate its impact on pneumococcal pathogenesis and immune evasion. CbpL is a very elongated three-module protein composed of (i) an Excalibur Ca 2+ -binding domain -reported in this work for the very first time-, (ii) an unprecedented anchorage module showing alternate disposition of canonical and non-canonical choline-binding sites that allows vine-like binding of fully-PCho-substituted teichoic acids (with two choline moieties per unit), and (iii) a Ltp-Lipoprotein domain. Our structural and infection assays indicate an important role of the whole multimodular protein allowing both to locate CbpL at specific places on the cell wall and to interact with host components in order to facilitate pneumococcal lung infection and transmigration from nasopharynx to the lungs and blood. CbpL implication in both resistance against killing by phagocytes and pneumococcal pathogenesis further postulate this surface-protein as relevant among the pathogenic arsenal of the pneumococcus.","lang":"eng"}],"type":"journal_article","author":[{"first_name":"Javier","id":"3D9511BA-F248-11E8-B48F-1D18A9856A87","last_name":"Gutierrez-Fernandez","full_name":"Gutierrez-Fernandez, Javier"},{"full_name":"Saleh, Malek","last_name":"Saleh","first_name":"Malek"},{"last_name":"Alcorlo","full_name":"Alcorlo, Martín","first_name":"Martín"},{"last_name":"Gómez Mejóa","full_name":"Gómez Mejóa, Alejandro","first_name":"Alejandro"},{"full_name":"Pantoja Uceda, David","last_name":"Pantoja Uceda","first_name":"David"},{"first_name":"Miguel","last_name":"Treviño","full_name":"Treviño, Miguel"},{"first_name":"Franziska","full_name":"Vob, Franziska","last_name":"Vob"},{"last_name":"Abdullah","full_name":"Abdullah, Mohammed","first_name":"Mohammed"},{"full_name":"Galán Bartual, Sergio","last_name":"Galán Bartual","first_name":"Sergio"},{"first_name":"Jolien","last_name":"Seinen","full_name":"Seinen, Jolien"},{"first_name":"Pedro","full_name":"Sánchez Murcia, Pedro","last_name":"Sánchez Murcia"},{"first_name":"Federico","last_name":"Gago","full_name":"Gago, Federico"},{"first_name":"Marta","full_name":"Bruix, Marta","last_name":"Bruix"},{"first_name":"Sven","last_name":"Hammerschmidt","full_name":"Hammerschmidt, Sven"},{"first_name":"Juan","last_name":"Hermoso","full_name":"Hermoso, Juan"}],"file_date_updated":"2020-07-14T12:44:37Z","oa":1,"department":[{"_id":"LeSa"}],"publication_status":"published","article_number":"38094","external_id":{"isi":["000389129100001"]},"file":[{"checksum":"e007d78b483bc59bf5ab98e9d42a6ec1","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:44:37Z","relation":"main_file","date_created":"2018-12-12T10:10:18Z","access_level":"open_access","file_size":2716045,"file_name":"IST-2017-735-v1+1_srep38094.pdf","file_id":"4804"}],"language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","date_created":"2018-12-11T11:50:36Z","title":"Modular architecture and unique teichoic acid recognition features of choline-binding protein L CbpL contributing to pneumococcal pathogenesis","publication":"Scientific Reports","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"short":"J. Gutierrez-Fernandez, M. Saleh, M. Alcorlo, A. Gómez Mejóa, D. Pantoja Uceda, M. Treviño, F. Vob, M. Abdullah, S. Galán Bartual, J. Seinen, P. Sánchez Murcia, F. Gago, M. Bruix, S. Hammerschmidt, J. Hermoso, Scientific Reports 6 (2016).","ieee":"J. Gutierrez-Fernandez et al., “Modular architecture and unique teichoic acid recognition features of choline-binding protein L CbpL contributing to pneumococcal pathogenesis,” Scientific Reports, vol. 6. Nature Publishing Group, 2016.","ama":"Gutierrez-Fernandez J, Saleh M, Alcorlo M, et al. Modular architecture and unique teichoic acid recognition features of choline-binding protein L CbpL contributing to pneumococcal pathogenesis. Scientific Reports. 2016;6. doi:10.1038/srep38094","chicago":"Gutierrez-Fernandez, Javier, Malek Saleh, Martín Alcorlo, Alejandro Gómez Mejóa, David Pantoja Uceda, Miguel Treviño, Franziska Vob, et al. “Modular Architecture and Unique Teichoic Acid Recognition Features of Choline-Binding Protein L CbpL Contributing to Pneumococcal Pathogenesis.” Scientific Reports. Nature Publishing Group, 2016. https://doi.org/10.1038/srep38094.","ista":"Gutierrez-Fernandez J, Saleh M, Alcorlo M, Gómez Mejóa A, Pantoja Uceda D, Treviño M, Vob F, Abdullah M, Galán Bartual S, Seinen J, Sánchez Murcia P, Gago F, Bruix M, Hammerschmidt S, Hermoso J. 2016. Modular architecture and unique teichoic acid recognition features of choline-binding protein L CbpL contributing to pneumococcal pathogenesis. Scientific Reports. 6, 38094.","mla":"Gutierrez-Fernandez, Javier, et al. “Modular Architecture and Unique Teichoic Acid Recognition Features of Choline-Binding Protein L CbpL Contributing to Pneumococcal Pathogenesis.” Scientific Reports, vol. 6, 38094, Nature Publishing Group, 2016, doi:10.1038/srep38094.","apa":"Gutierrez-Fernandez, J., Saleh, M., Alcorlo, M., Gómez Mejóa, A., Pantoja Uceda, D., Treviño, M., … Hermoso, J. (2016). Modular architecture and unique teichoic acid recognition features of choline-binding protein L CbpL contributing to pneumococcal pathogenesis. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/srep38094"},"day":"05","date_updated":"2025-09-22T09:46:12Z","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"_id":"1186","publist_id":"6167","intvolume":" 6","year":"2016","acknowledgement":"We gratefully acknowledge Karsta Barnekow and Kristine Sievert-Giermann, for technical assistance and Lothar Petruschka for in silico analysis (all Dept. of Genetics, University of Greifswald). We are further grateful to the staff from SLS synchrotron beamline for help in data collection. This work was supported by grants from the Deutsche Forschungsgemeinschaft DFG GRK 1870 (to SH) and the Spanish Ministry of Economy and Competitiveness (BFU2014-59389-P to JAH, CTQ2014-52633-P to MB and SAF2012-39760-C02-02 to FG) and S2010/BMD-2457 (Community of Madrid to JAH and FG).","pubrep_id":"735","month":"12","volume":6,"has_accepted_license":"1","doi":"10.1038/srep38094","quality_controlled":"1","oa_version":"Published Version"},{"publication_status":"published","publication_identifier":{"issn":["0737-8017"],"isbn":["978-145034132-5"]},"oa":1,"author":[{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Krinninger","full_name":"Krinninger, Sebastian","first_name":"Sebastian"},{"first_name":"Danupon","full_name":"Nanongkai, Danupon","last_name":"Nanongkai"}],"date_published":"2016-06-01T00:00:00Z","abstract":[{"lang":"eng","text":"We present a deterministic (1+o(1))-approximation O(n1/2+o(1)+D1+o(1))-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the CONGEST model); here n is the number of nodes in the network and D is its (hop) diameter. This is the first non-trivial deterministic algorithm for this problem. It also improves (i) the running time of the randomized (1+o(1))-approximation Õ(n1/2D1/4+D)-time algorithm of Nanongkai [STOC 2014] by a factor of as large as n1/8, and (ii) the O(є−1logє−1)-approximation factor of Lenzen and Patt-Shamir’s Õ(n1/2+є+D)-time algorithm [STOC 2013] within the same running time. Our running time matches the known time lower bound of Ω(n1/2/logn + D) [Das Sarma et al. STOC 2011] modulo some lower-order terms, thus essentially settling the status of this problem which was raised at least a decade ago [Elkin SIGACT News 2004]. It also implies a (2+o(1))-approximation O(n1/2+o(1)+D1+o(1))-time algorithm for approximating a network’s weighted diameter which almost matches the lower bound by Holzer et al. [PODC 2012].\r\n\r\nIn achieving this result, we develop two techniques which might be of independent interest and useful in other settings: (i) a deterministic process that replaces the “hitting set argument” commonly used for shortest paths computation in various settings, and (ii) a simple, deterministic, construction of an (no(1), o(1))-hop set of size O(n1+o(1)). We combine these techniques with many distributed algorithmic techniques, some of which from problems that are not directly related to shortest paths, e.g. ruling sets [Goldberg et al. STOC 1987], source detection [Lenzen, Peleg PODC 2013], and partial distance estimation [Lenzen, Patt-Shamir PODC 2015]. Our hop set construction also leads to single-source shortest paths algorithms in two other settings: (i) a (1+o(1))-approximation O(no(1))-time algorithm on congested cliques, and (ii) a (1+o(1))-approximation O(no(1)logW)-pass O(n1+o(1)logW)-space streaming algorithm, when edge weights are in {1, 2, …, W}. The first result answers an open problem in [Nanongkai, STOC 2014]. The second result partially answers an open problem raised by McGregor in 2006 [
sublinear.info
, Problem 14]."}],"type":"conference","publisher":"Association for Computing Machinery","scopus_import":"1","extern":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.07056"}],"external_id":{"arxiv":["1504.07056"]},"language":[{"iso":"eng"}],"conference":{"start_date":"2016-06-19","end_date":"2016-06-21","name":"STOC: Symposium on Theory of Computing","location":"Cambridge, MA, United States"},"arxiv":1,"publication":"48th Annual ACM SIGACT Symposium on Theory of Computing","title":"A deterministic almost-tight distributed algorithm for approximating single-source shortest paths","page":"489 - 498","article_processing_charge":"No","date_created":"2022-08-16T09:19:31Z","status":"public","day":"01","date_updated":"2024-11-06T12:19:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Henzinger, M., Krinninger, S., & Nanongkai, D. (2016). A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. In 48th Annual ACM SIGACT Symposium on Theory of Computing (pp. 489–498). Cambridge, MA, United States: Association for Computing Machinery. https://doi.org/10.1145/2897518.2897638","mla":"Henzinger, Monika, et al. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.” 48th Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2016, pp. 489–98, doi:10.1145/2897518.2897638.","chicago":"Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.” In 48th Annual ACM SIGACT Symposium on Theory of Computing, 489–98. Association for Computing Machinery, 2016. https://doi.org/10.1145/2897518.2897638.","ieee":"M. Henzinger, S. Krinninger, and D. Nanongkai, “A deterministic almost-tight distributed algorithm for approximating single-source shortest paths,” in 48th Annual ACM SIGACT Symposium on Theory of Computing, Cambridge, MA, United States, 2016, pp. 489–498.","ista":"Henzinger M, Krinninger S, Nanongkai D. 2016. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. 48th Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 489–498.","ama":"Henzinger M, Krinninger S, Nanongkai D. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. In: 48th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery; 2016:489-498. doi:10.1145/2897518.2897638","short":"M. Henzinger, S. Krinninger, D. Nanongkai, in:, 48th Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2016, pp. 489–498."},"year":"2016","_id":"11866","month":"06","oa_version":"Preprint","quality_controlled":"1","doi":"10.1145/2897518.2897638"},{"month":"06","doi":"10.1145/2897518.2897568","quality_controlled":"1","oa_version":"Preprint","day":"01","date_updated":"2024-11-06T12:19:37Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Bhattacharya, S., Henzinger, M., & Nanongkai, D. (2016). New deterministic approximation algorithms for fully dynamic matching. In 48th Annual ACM SIGACT Symposium on Theory of Computing (pp. 398–411). Cambridge, MA, United States: Association for Computing Machinery. https://doi.org/10.1145/2897518.2897568","mla":"Bhattacharya, Sayan, et al. “New Deterministic Approximation Algorithms for Fully Dynamic Matching.” 48th Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2016, pp. 398–411, doi:10.1145/2897518.2897568.","ista":"Bhattacharya S, Henzinger M, Nanongkai D. 2016. New deterministic approximation algorithms for fully dynamic matching. 48th Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 398–411.","ama":"Bhattacharya S, Henzinger M, Nanongkai D. New deterministic approximation algorithms for fully dynamic matching. In: 48th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery; 2016:398-411. doi:10.1145/2897518.2897568","chicago":"Bhattacharya, Sayan, Monika Henzinger, and Danupon Nanongkai. “New Deterministic Approximation Algorithms for Fully Dynamic Matching.” In 48th Annual ACM SIGACT Symposium on Theory of Computing, 398–411. Association for Computing Machinery, 2016. https://doi.org/10.1145/2897518.2897568.","ieee":"S. Bhattacharya, M. Henzinger, and D. Nanongkai, “New deterministic approximation algorithms for fully dynamic matching,” in 48th Annual ACM SIGACT Symposium on Theory of Computing, Cambridge, MA, United States, 2016, pp. 398–411.","short":"S. Bhattacharya, M. Henzinger, D. Nanongkai, in:, 48th Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2016, pp. 398–411."},"year":"2016","_id":"11867","conference":{"location":"Cambridge, MA, United States","name":"STOC: Symposium on Theory of Computing","end_date":"2016-06-21","start_date":"2016-06-19"},"arxiv":1,"language":[{"iso":"eng"}],"title":"New deterministic approximation algorithms for fully dynamic matching","publication":"48th Annual ACM SIGACT Symposium on Theory of Computing","status":"public","article_processing_charge":"No","date_created":"2022-08-16T09:27:35Z","page":"398 - 411","author":[{"first_name":"Sayan","full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"last_name":"Nanongkai","full_name":"Nanongkai, Danupon","first_name":"Danupon"}],"oa":1,"publication_identifier":{"issn":["0737-8017"],"isbn":["978-145034132-5"]},"publication_status":"published","scopus_import":"1","extern":"1","publisher":"Association for Computing Machinery","abstract":[{"text":"We present two deterministic dynamic algorithms for the maximum matching problem. (1) An algorithm that maintains a (2+є)-approximate maximum matching in general graphs with O(poly(logn, 1/є)) update time. (2) An algorithm that maintains an αK approximation of the value of the maximum matching with O(n2/K) update time in bipartite graphs, for every sufficiently large constant positive integer K. Here, 1≤ αK < 2 is a constant determined by the value of K. Result (1) is the first deterministic algorithm that can maintain an o(logn)-approximate maximum matching with polylogarithmic update time, improving the seminal result of Onak et al. [STOC 2010]. Its approximation guarantee almost matches the guarantee of the best randomized polylogarithmic update time algorithm [Baswana et al. FOCS 2011]. Result (2) achieves a better-than-two approximation with arbitrarily small polynomial update time on bipartite graphs. Previously the best update time for this problem was O(m1/4) [Bernstein et al. ICALP 2015], where m is the current number of edges in the graph.","lang":"eng"}],"type":"conference","date_published":"2016-06-01T00:00:00Z","external_id":{"arxiv":["1604.05765"]},"main_file_link":[{"url":"https://arxiv.org/abs/1604.05765","open_access":"1"}]},{"issue":"12","quality_controlled":"1","oa_version":"Preprint","doi":"10.1088/1742-5468/aa4e8f","acknowledgement":"D De Martino is supported by the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007–2013) under REA grant agreement no. [291734]. D Masoero is supported by the FCT scholarship, number SFRH/BPD/75908/2011. D De Martino thanks the Grupo de Física Matemática of the Universidade de Lisboa for the kind hospitality. We also wish to thank Matteo Osella, Vincenzo Vitagliano and Vera Luz Masoero for useful discussions, also late at night.","volume":2016,"month":"12","publist_id":"6165","intvolume":" 2016","_id":"1188","year":"2016","ec_funded":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"short":"D. De Martino, D. Masoero, Journal of Statistical Mechanics: Theory and Experiment 2016 (2016).","ieee":"D. De Martino and D. Masoero, “Asymptotic analysis of noisy fitness maximization, applied to metabolism &amp; growth,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2016, no. 12. IOP Publishing, 2016.","chicago":"De Martino, Daniele, and Davide Masoero. “Asymptotic Analysis of Noisy Fitness Maximization, Applied to Metabolism &amp; Growth.” Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing, 2016. https://doi.org/10.1088/1742-5468/aa4e8f.","ama":"De Martino D, Masoero D. Asymptotic analysis of noisy fitness maximization, applied to metabolism &amp; growth. Journal of Statistical Mechanics: Theory and Experiment. 2016;2016(12). doi:10.1088/1742-5468/aa4e8f","ista":"De Martino D, Masoero D. 2016. Asymptotic analysis of noisy fitness maximization, applied to metabolism &amp; growth. Journal of Statistical Mechanics: Theory and Experiment. 2016(12), 123502.","mla":"De Martino, Daniele, and Davide Masoero. “Asymptotic Analysis of Noisy Fitness Maximization, Applied to Metabolism &amp; Growth.” Journal of Statistical Mechanics: Theory and Experiment, vol. 2016, no. 12, 123502, IOP Publishing, 2016, doi:10.1088/1742-5468/aa4e8f.","apa":"De Martino, D., & Masoero, D. (2016). Asymptotic analysis of noisy fitness maximization, applied to metabolism &amp; growth. Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing. https://doi.org/10.1088/1742-5468/aa4e8f"},"date_updated":"2025-09-22T09:45:38Z","day":"30","isi":1,"status":"public","article_processing_charge":"No","date_created":"2018-12-11T11:50:37Z","publication":" Journal of Statistical Mechanics: Theory and Experiment","title":"Asymptotic analysis of noisy fitness maximization, applied to metabolism & growth","language":[{"iso":"eng"}],"arxiv":1,"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.09048"}],"article_number":"123502","external_id":{"arxiv":["1606.09048"],"isi":["000391973900001"]},"publisher":"IOP Publishing","scopus_import":"1","date_published":"2016-12-30T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"We consider a population dynamics model coupling cell growth to a diffusion in the space of metabolic phenotypes as it can be obtained from realistic constraints-based modelling. \r\nIn the asymptotic regime of slow\r\ndiffusion, that coincides with the relevant experimental range, the resulting\r\nnon-linear Fokker–Planck equation is solved for the steady state in the WKB\r\napproximation that maps it into the ground state of a quantum particle in an\r\nAiry potential plus a centrifugal term. We retrieve scaling laws for growth rate\r\nfluctuations and time response with respect to the distance from the maximum\r\ngrowth rate suggesting that suboptimal populations can have a faster response\r\nto perturbations."}],"oa":1,"department":[{"_id":"GaTk"}],"publication_status":"published","author":[{"id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","first_name":"Daniele","last_name":"De Martino","orcid":"0000-0002-5214-4706","full_name":"De Martino, Daniele"},{"first_name":"Davide","full_name":"Masoero, Davide","last_name":"Masoero"}]},{"abstract":[{"lang":"eng","text":"Within the scope of this thesis, we show that a driven-dissipative system with\r\nfew ultracold atoms can exhibit dissipatively bound states, even if the atom-atom\r\ninteraction is purely repulsive. This bond arises due to the dipole-dipole inter-\r\naction, which is restricted to one of the lower electronic energy states, resulting\r\nin the distance-dependent coherent population trapping. The quality of this al-\r\nready established method of dissipative binding is improved and the application\r\nis extended to higher dimensions and a larger number of atoms. Here, we simu-\r\nlate two- and three-atom systems using an adapted approach to the Monte Carlo\r\nwave-function method and analyse the results. Finally, we examine the possi-\r\nbility of finding a setting allowing trimer states but prohibiting dimer states.\r\nIn the context of open quantum systems, such a three-body bound states corre-\r\nsponds to the driven-dissipative analogue of a Borromean state. These states can\r\nbe detected in modern experiments with dipolar and Rydberg-dressed ultracold\r\natomic gases.\r\n"}],"type":"dissertation","date_published":"2016-11-28T00:00:00Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Jochum, Clemens. “Dissipative Few-Body Quantum Systems.” Technical University Vienna, 2016.","ista":"Jochum C. 2016. Dissipative Few-Body Quantum Systems. Technical University Vienna.","ama":"Jochum C. Dissipative Few-Body Quantum Systems. 2016.","ieee":"C. Jochum, “Dissipative Few-Body Quantum Systems,” Technical University Vienna, 2016.","short":"C. Jochum, Dissipative Few-Body Quantum Systems, Technical University Vienna, 2016.","apa":"Jochum, C. (2016). Dissipative Few-Body Quantum Systems. Technical University Vienna.","mla":"Jochum, Clemens. Dissipative Few-Body Quantum Systems. Technical University Vienna, 2016."},"publisher":"Technical University Vienna","author":[{"last_name":"Jochum","full_name":"Jochum, Clemens","first_name":"Clemens"}],"date_updated":"2021-01-12T06:48:57Z","day":"28","publication_status":"published","oa":1,"_id":"1189","publist_id":"6164","main_file_link":[{"open_access":"1","url":"http://repositum.tuwien.ac.at/obvutwhs/content/titleinfo/1517088"}],"year":"2016","language":[{"iso":"eng"}],"month":"11","article_processing_charge":"No","date_created":"2018-12-11T11:50:37Z","status":"public","page":"94","supervisor":[{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail"},{"full_name":"Rabl, Peter","last_name":"Rabl","first_name":"Peter"}],"title":"Dissipative Few-Body Quantum Systems","oa_version":"Published Version"},{"arxiv":1,"language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","date_created":"2022-08-17T08:37:00Z","page":"947-1006","title":"Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization","publication":"SIAM Journal on Computing","scopus_import":"1","publisher":"Society for Industrial & Applied Mathematics","extern":"1","abstract":[{"lang":"eng","text":"We study dynamic (1+𝜖)-approximation algorithms for the all-pairs shortest paths problem in unweighted undirected 𝑛-node 𝑚-edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update time of 𝑂̃ (𝑚𝑛/𝜖) and constant query time by Roditty and Zwick [SIAM J. Comput., 41 (2012), pp. 670--683]. The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach [J. ACM, 28 (1981), pp. 1--4]; it has a total update time of 𝑂(𝑚𝑛2) and constant query time. We improve these results as follows: (1) We present an algorithm with a total update time of 𝑂̃ (𝑛5/2/𝜖) and constant query time that has an additive error of 2 in addition to the 1+𝜖 multiplicative error. This beats the previous 𝑂̃ (𝑚𝑛/𝜖) time when 𝑚=Ω(𝑛3/2). Note that the additive error is unavoidable since, even in the static case, an 𝑂(𝑛3−𝛿)-time (a so-called truly subcubic) combinatorial algorithm with 1+𝜖 multiplicative error cannot have an additive error less than 2−𝜖, unless we make a major breakthrough for Boolean matrix multiplication [D. Dor, S. Halrepin, and U. Zwick, SIAM J. Comput., 29 (2000), pp. 1740--1759] and many other long-standing problems [V. Vassilevska Williams and R. Williams, Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 2010, pp. 645--654]. The algorithm can also be turned into a (2+𝜖)-approximation algorithm (without an additive error) with the same time guarantees, improving the recent (3+𝜖)-approximation algorithm with 𝑂̃ (𝑛5/2+𝑂(log(1/𝜖)/log𝑛√)) running time of Bernstein and Roditty [Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011, pp. 1355--1365] in terms of both approximation and time guarantees. (2) We present a deterministic algorithm with a total update time of 𝑂̃ (𝑚𝑛/𝜖) and a query time of 𝑂(loglog𝑛). The algorithm has a multiplicative error of 1+𝜖 and gives the first improved deterministic algorithm since 1981. It also answers an open question raised by Bernstein in [Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, 2013, pp. 725--734]. The deterministic algorithm can be turned into a deterministic fully dynamic (1+𝜖)-approximation with an amortized update time of 𝑂̃ (𝑚𝑛/(𝜖𝑡)) and a query time of 𝑂̃ (𝑡) for every 𝑡≤𝑛√. In order to achieve our results, we introduce two new techniques: (i) A monotone Even--Shiloach tree algorithm which maintains a bounded-distance shortest-paths tree on a certain type of emulator called a locally persevering emulator. (ii) A derandomization technique based on moving Even--Shiloach trees as a way to derandomize the standard random set argument. These techniques might be of independent interest."}],"type":"journal_article","date_published":"2016-05-01T00:00:00Z","author":[{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"last_name":"Krinninger","full_name":"Krinninger, Sebastian","first_name":"Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"oa":1,"publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"publication_status":"published","external_id":{"arxiv":["1308.0776"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1308.0776"}],"month":"05","volume":45,"issue":"3","doi":"10.1137/140957299","quality_controlled":"1","oa_version":"Preprint","citation":{"ama":"Henzinger M, Krinninger S, Nanongkai D. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. SIAM Journal on Computing. 2016;45(3):947-1006. doi:10.1137/140957299","ista":"Henzinger M, Krinninger S, Nanongkai D. 2016. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. SIAM Journal on Computing. 45(3), 947–1006.","ieee":"M. Henzinger, S. Krinninger, and D. Nanongkai, “Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization,” SIAM Journal on Computing, vol. 45, no. 3. Society for Industrial & Applied Mathematics, pp. 947–1006, 2016.","chicago":"Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics, 2016. https://doi.org/10.1137/140957299.","short":"M. Henzinger, S. Krinninger, D. Nanongkai, SIAM Journal on Computing 45 (2016) 947–1006.","apa":"Henzinger, M., Krinninger, S., & Nanongkai, D. (2016). Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/140957299","mla":"Henzinger, Monika, et al. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” SIAM Journal on Computing, vol. 45, no. 3, Society for Industrial & Applied Mathematics, 2016, pp. 947–1006, doi:10.1137/140957299."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-11-06T12:23:06Z","day":"01","_id":"11891","intvolume":" 45","article_type":"original","year":"2016"},{"oa_version":"Preprint","quality_controlled":"1","doi":"10.1109/FOCS.2016.88","acknowledgement":"European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160","volume":"2016-December","month":"12","publist_id":"6158","_id":"1193","ec_funded":1,"year":"2016","citation":{"mla":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” Proceedings - Annual IEEE Symposium on Foundations of Computer Science, vol. 2016–December, 7782993, IEEE, 2016, doi:10.1109/FOCS.2016.88.","apa":"Kolmogorov, V. (2016). Commutativity in the algorithmic Lovasz local lemma. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science (Vol. 2016–December). New Brunswick, NJ, USA : IEEE. https://doi.org/10.1109/FOCS.2016.88","short":"V. Kolmogorov, in:, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2016.","chicago":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, Vol. 2016–December. IEEE, 2016. https://doi.org/10.1109/FOCS.2016.88.","ieee":"V. Kolmogorov, “Commutativity in the algorithmic Lovasz local lemma,” in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, New Brunswick, NJ, USA , 2016, vol. 2016–December.","ista":"Kolmogorov V. 2016. Commutativity in the algorithmic Lovasz local lemma. Proceedings - Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science vol. 2016–December, 7782993.","ama":"Kolmogorov V. Commutativity in the algorithmic Lovasz local lemma. In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science. Vol 2016-December. IEEE; 2016. doi:10.1109/FOCS.2016.88"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"date_updated":"2025-09-22T09:44:20Z","day":"15","article_processing_charge":"No","date_created":"2018-12-11T11:50:38Z","status":"public","publication":"Proceedings - Annual IEEE Symposium on Foundations of Computer Science","title":"Commutativity in the algorithmic Lovasz local lemma","language":[{"iso":"eng"}],"arxiv":1,"conference":{"location":"New Brunswick, NJ, USA ","name":"FOCS: Foundations of Computer Science","end_date":"2016-09-11","start_date":"2016-09-09"},"project":[{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"main_file_link":[{"url":"https://arxiv.org/abs/1506.08547v7","open_access":"1"}],"article_number":"7782993","external_id":{"isi":["000391198500082"],"arxiv":["1506.08547"]},"type":"conference","date_published":"2016-12-15T00:00:00Z","abstract":[{"text":"We consider the recent formulation of the Algorithmic Lovász Local Lemma [1], [2] for finding objects that avoid "bad features", or "flaws". It extends the Moser-Tardos resampling algorithm [3] to more general discrete spaces. At each step the method picks a flaw present in the current state and "resamples" it using a "resampling oracle" provided by the user. However, it is less flexible than the Moser-Tardos method since [1], [2] require a specific flaw selection rule, whereas [3] allows an arbitrary rule (and thus can potentially be implemented more efficiently). We formulate a new "commutativity" condition, and prove that it is sufficient for an arbitrary rule to work. It also enables an efficient parallelization under an additional assumption. We then show that existing resampling oracles for perfect matchings and permutations do satisfy this condition. Finally, we generalize the precondition in [2] (in the case of symmetric potential causality graphs). This unifies special cases that previously were treated separately.","lang":"eng"}],"scopus_import":"1","publisher":"IEEE","publication_status":"published","department":[{"_id":"VlKo"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"5975"}]},"oa":1,"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}]},{"date_created":"2018-12-11T11:50:39Z","article_processing_charge":"No","status":"public","page":"174 - 184","title":"Reconstruction of haplotype-blocks selected during experimental evolution.","publication":"Molecular Biology and Evolution","language":[{"iso":"eng"}],"project":[{"call_identifier":"FP7","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation"}],"external_id":{"isi":["000396772000009"]},"file":[{"file_size":295274,"access_level":"open_access","file_id":"5223","file_name":"IST-2017-770-v1+1_FranssenEtAl_nofigs-1.pdf","relation":"main_file","date_created":"2018-12-12T10:16:35Z","creator":"system","date_updated":"2020-07-14T12:44:38Z","checksum":"1e78d3aaffcb40dc8b02b7b4666019e0","content_type":"application/pdf"},{"creator":"system","date_updated":"2020-07-14T12:44:38Z","checksum":"e13171843283774404c936c581b4543e","content_type":"application/pdf","file_id":"5224","file_name":"IST-2017-770-v1+2_Fig1.pdf","access_level":"open_access","file_size":10902625,"relation":"main_file","date_created":"2018-12-12T10:16:36Z"},{"relation":"main_file","date_created":"2018-12-12T10:16:37Z","file_size":21437,"access_level":"open_access","file_id":"5225","file_name":"IST-2017-770-v1+3_Fig2.pdf","checksum":"63bc6e6e61f347594d8c00c37f874a0b","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:44:38Z"},{"content_type":"application/pdf","checksum":"da87cc7c78808837f22a3dae1c8397f9","date_updated":"2020-07-14T12:44:38Z","creator":"system","date_created":"2018-12-12T10:16:38Z","relation":"main_file","file_id":"5226","file_name":"IST-2017-770-v1+4_Fig3.pdf","file_size":1172194,"access_level":"open_access"},{"relation":"main_file","date_created":"2018-12-12T10:16:38Z","file_name":"IST-2017-770-v1+5_Fig4.pdf","file_id":"5227","file_size":50045,"access_level":"open_access","checksum":"e47b2a0c32142f423b3100150c0294f8","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:44:38Z"},{"file_name":"IST-2017-770-v1+6_Fig5.pdf","file_id":"5228","file_size":50705,"access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:16:39Z","creator":"system","date_updated":"2020-07-14T12:44:38Z","checksum":"a5a7d6b32e7e17d35d337d7ec2a9f6c9","content_type":"application/pdf"}],"ddc":["576"],"abstract":[{"lang":"eng","text":"The genetic analysis of experimentally evolving populations typically relies on short reads from pooled individuals (Pool-Seq). While this method provides reliable allele frequency estimates, the underlying haplotype structure remains poorly characterized. With small population sizes and adaptive variants that start from low frequencies, the interpretation of selection signatures in most Evolve and Resequencing studies remains challenging. To facilitate the characterization of selection targets, we propose a new approach that reconstructs selected haplotypes from replicated time series, using Pool-Seq data. We identify selected haplotypes through the correlated frequencies of alleles carried by them. Computer simulations indicate that selected haplotype-blocks of several Mb can be reconstructed with high confidence and low error rates, even when allele frequencies change only by 20% across three replicates. Applying this method to real data from D. melanogaster populations adapting to a hot environment, we identify a selected haplotype-block of 6.93 Mb. We confirm the presence of this haplotype-block in evolved populations by experimental haplotyping, demonstrating the power and accuracy of our haplotype reconstruction from Pool-Seq data. We propose that the combination of allele frequency estimates with haplotype information will provide the key to understanding the dynamics of adaptive alleles. "}],"date_published":"2016-10-03T00:00:00Z","type":"journal_article","publisher":"Oxford University Press","scopus_import":"1","author":[{"last_name":"Franssen","full_name":"Franssen, Susan","first_name":"Susan"},{"first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240"},{"last_name":"Schlötterer","full_name":"Schlötterer, Christian","first_name":"Christian"}],"department":[{"_id":"NiBa"}],"publication_status":"published","oa":1,"file_date_updated":"2020-07-14T12:44:38Z","has_accepted_license":"1","issue":"1","doi":"10.1093/molbev/msw210","oa_version":"Submitted Version","quality_controlled":"1","acknowledgement":"The authors thank all members of the Institute of Population\r\nGenetics for discussion and support on the project and par-\r\nticularly N. Barghi for helpful comments on earlier versions of\r\nthe manuscript. This work was supported by the European\r\nResearch Council (ERC) grants “ArchAdapt” and “250152”.","pubrep_id":"770","month":"10","volume":34,"_id":"1195","intvolume":" 34","publist_id":"6155","ec_funded":1,"year":"2016","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"mla":"Franssen, Susan, et al. “Reconstruction of Haplotype-Blocks Selected during Experimental Evolution.” Molecular Biology and Evolution, vol. 34, no. 1, Oxford University Press, 2016, pp. 174–84, doi:10.1093/molbev/msw210.","apa":"Franssen, S., Barton, N. H., & Schlötterer, C. (2016). Reconstruction of haplotype-blocks selected during experimental evolution. Molecular Biology and Evolution. Oxford University Press. https://doi.org/10.1093/molbev/msw210","short":"S. Franssen, N.H. Barton, C. Schlötterer, Molecular Biology and Evolution 34 (2016) 174–184.","ieee":"S. Franssen, N. H. Barton, and C. Schlötterer, “Reconstruction of haplotype-blocks selected during experimental evolution.,” Molecular Biology and Evolution, vol. 34, no. 1. Oxford University Press, pp. 174–184, 2016.","ama":"Franssen S, Barton NH, Schlötterer C. Reconstruction of haplotype-blocks selected during experimental evolution. Molecular Biology and Evolution. 2016;34(1):174-184. doi:10.1093/molbev/msw210","ista":"Franssen S, Barton NH, Schlötterer C. 2016. Reconstruction of haplotype-blocks selected during experimental evolution. Molecular Biology and Evolution. 34(1), 174–184.","chicago":"Franssen, Susan, Nicholas H Barton, and Christian Schlötterer. “Reconstruction of Haplotype-Blocks Selected during Experimental Evolution.” Molecular Biology and Evolution. Oxford University Press, 2016. https://doi.org/10.1093/molbev/msw210."},"isi":1,"date_updated":"2025-09-22T09:43:41Z","day":"03"},{"language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","date_created":"2018-12-11T11:50:40Z","publication":"PLoS Computational Biology","title":"Error-robust modes of the retinal population code","scopus_import":"1","publisher":"Public Library of Science","date_published":"2016-11-17T00:00:00Z","type":"journal_article","abstract":[{"text":"Across the nervous system, certain population spiking patterns are observed far more frequently than others. A hypothesis about this structure is that these collective activity patterns function as population codewords–collective modes–carrying information distinct from that of any single cell. We investigate this phenomenon in recordings of ∼150 retinal ganglion cells, the retina’s output. We develop a novel statistical model that decomposes the population response into modes; it predicts the distribution of spiking activity in the ganglion cell population with high accuracy. We found that the modes represent localized features of the visual stimulus that are distinct from the features represented by single neurons. Modes form clusters of activity states that are readily discriminated from one another. When we repeated the same visual stimulus, we found that the same mode was robustly elicited. These results suggest that retinal ganglion cells’ collective signaling is endowed with a form of error-correcting code–a principle that may hold in brain areas beyond retina.","lang":"eng"}],"ddc":["570"],"file_date_updated":"2020-07-14T12:44:38Z","related_material":{"record":[{"id":"9709","status":"public","relation":"research_data"}]},"oa":1,"department":[{"_id":"GaTk"}],"publication_status":"published","author":[{"first_name":"Jason","last_name":"Prentice","full_name":"Prentice, Jason"},{"first_name":"Olivier","full_name":"Marre, Olivier","last_name":"Marre"},{"first_name":"Mark","full_name":"Ioffe, Mark","last_name":"Ioffe"},{"full_name":"Loback, Adrianna","last_name":"Loback","first_name":"Adrianna"},{"last_name":"Tkacik","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper"},{"first_name":"Michael","last_name":"Berry","full_name":"Berry, Michael"}],"project":[{"grant_number":"P 25651-N26","_id":"254D1A94-B435-11E9-9278-68D0E5697425","name":"Sensitivity to higher-order statistics in natural scenes","call_identifier":"FWF"}],"file":[{"access_level":"open_access","file_size":4492021,"file_id":"5884","file_name":"2016_PLOS_Prentice.pdf","relation":"main_file","date_created":"2019-01-25T10:35:00Z","creator":"kschuh","date_updated":"2020-07-14T12:44:38Z","checksum":"47b08cbd4dbf32b25ba161f5f4b262cc","content_type":"application/pdf"}],"external_id":{"isi":["000391230900008"]},"article_number":"e1005855","acknowledgement":"JSP was supported by a C.V. Starr Fellowship from the Starr Foundation (http://www.starrfoundation.org/). GT was supported by Austrian Research Foundation (https://www.fwf.ac.at/en/) grant FWF P25651. MJB received support from National Eye Institute (https://nei.nih.gov/) grant EY 14196 and from the National Science Foundation grant 1504977. The authors thank Cristina Savin and Vicent Botella-Soler for helpful comments on the manuscript.","volume":12,"month":"11","issue":"11","has_accepted_license":"1","quality_controlled":"1","oa_version":"Published Version","doi":"10.1371/journal.pcbi.1005148","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"mla":"Prentice, Jason, et al. “Error-Robust Modes of the Retinal Population Code.” PLoS Computational Biology, vol. 12, no. 11, e1005855, Public Library of Science, 2016, doi:10.1371/journal.pcbi.1005148.","apa":"Prentice, J., Marre, O., Ioffe, M., Loback, A., Tkačik, G., & Berry, M. (2016). Error-robust modes of the retinal population code. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005148","short":"J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, M. Berry, PLoS Computational Biology 12 (2016).","ama":"Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. Error-robust modes of the retinal population code. PLoS Computational Biology. 2016;12(11). doi:10.1371/journal.pcbi.1005148","ieee":"J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, and M. Berry, “Error-robust modes of the retinal population code,” PLoS Computational Biology, vol. 12, no. 11. Public Library of Science, 2016.","chicago":"Prentice, Jason, Olivier Marre, Mark Ioffe, Adrianna Loback, Gašper Tkačik, and Michael Berry. “Error-Robust Modes of the Retinal Population Code.” PLoS Computational Biology. Public Library of Science, 2016. https://doi.org/10.1371/journal.pcbi.1005148.","ista":"Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. 2016. Error-robust modes of the retinal population code. PLoS Computational Biology. 12(11), e1005855."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"17","date_updated":"2025-09-22T09:43:12Z","isi":1,"publist_id":"6153","intvolume":" 12","_id":"1197","year":"2016"},{"citation":{"short":"B. Pieber, C.O. Kappe, Organic Letters 18 (2016) 1076–1079.","ieee":"B. Pieber and C. O. Kappe, “Generation and synthetic application of trifluoromethyl diazomethane utilizing continuous flow technologies,” Organic Letters, vol. 18, no. 5. American Chemical Society, pp. 1076–1079, 2016.","ista":"Pieber B, Kappe CO. 2016. Generation and synthetic application of trifluoromethyl diazomethane utilizing continuous flow technologies. Organic Letters. 18(5), 1076–1079.","chicago":"Pieber, Bartholomäus, and C. Oliver Kappe. “Generation and Synthetic Application of Trifluoromethyl Diazomethane Utilizing Continuous Flow Technologies.” Organic Letters. American Chemical Society, 2016. https://doi.org/10.1021/acs.orglett.6b00194.","ama":"Pieber B, Kappe CO. Generation and synthetic application of trifluoromethyl diazomethane utilizing continuous flow technologies. Organic Letters. 2016;18(5):1076-1079. doi:10.1021/acs.orglett.6b00194","mla":"Pieber, Bartholomäus, and C. Oliver Kappe. “Generation and Synthetic Application of Trifluoromethyl Diazomethane Utilizing Continuous Flow Technologies.” Organic Letters, vol. 18, no. 5, American Chemical Society, 2016, pp. 1076–79, doi:10.1021/acs.orglett.6b00194.","apa":"Pieber, B., & Kappe, C. O. (2016). Generation and synthetic application of trifluoromethyl diazomethane utilizing continuous flow technologies. Organic Letters. American Chemical Society. https://doi.org/10.1021/acs.orglett.6b00194"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-14T12:07:21Z","day":"04","intvolume":" 18","_id":"11983","year":"2016","article_type":"letter_note","volume":18,"month":"03","issue":"5","oa_version":"None","quality_controlled":"1","doi":"10.1021/acs.orglett.6b00194","type":"journal_article","date_published":"2016-03-04T00:00:00Z","abstract":[{"text":"A continuous process for the synthesis and inline separation of anhydrous trifluoromethyl diazomethane in a single continuous flow process is presented. The diazo building block is generated from the corresponding amine and NaNO2 under acidic, aqueous conditions and subsequently diffuses through a gas-permeable membrane into an organic stream. To avoid storage and transportation of the hazardous compound, a representative downstream process in a packed-bed reactor yielding highly functionalized building blocks was developed.","lang":"eng"}],"scopus_import":"1","publisher":"American Chemical Society","extern":"1","publication_status":"published","publication_identifier":{"eissn":["1523-7052"],"issn":["1523-7060"]},"author":[{"orcid":"0000-0001-8689-388X","last_name":"Pieber","full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus"},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"}],"external_id":{"pmid":["26902154"]},"language":[{"iso":"eng"}],"page":"1076-1079","article_processing_charge":"No","date_created":"2022-08-25T11:22:20Z","pmid":1,"status":"public","publication":"Organic Letters","title":"Generation and synthetic application of trifluoromethyl diazomethane utilizing continuous flow technologies"},{"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Pieber, B., Cox, D. P., & Kappe, C. O. (2016). Selective olefin reduction in thebaine using hydrazine hydrate and O₂ under intensified continuous flow conditions. Organic Process Research and Development. American Chemical Society. https://doi.org/10.1021/acs.oprd.5b00370","mla":"Pieber, Bartholomäus, et al. “Selective Olefin Reduction in Thebaine Using Hydrazine Hydrate and O₂ under Intensified Continuous Flow Conditions.” Organic Process Research and Development, vol. 20, no. 2, American Chemical Society, 2016, pp. 376–85, doi:10.1021/acs.oprd.5b00370.","chicago":"Pieber, Bartholomäus, D. Phillip Cox, and C. Oliver Kappe. “Selective Olefin Reduction in Thebaine Using Hydrazine Hydrate and O₂ under Intensified Continuous Flow Conditions.” Organic Process Research and Development. American Chemical Society, 2016. https://doi.org/10.1021/acs.oprd.5b00370.","ista":"Pieber B, Cox DP, Kappe CO. 2016. Selective olefin reduction in thebaine using hydrazine hydrate and O₂ under intensified continuous flow conditions. Organic Process Research and Development. 20(2), 376–385.","ieee":"B. Pieber, D. P. Cox, and C. O. Kappe, “Selective olefin reduction in thebaine using hydrazine hydrate and O₂ under intensified continuous flow conditions,” Organic Process Research and Development, vol. 20, no. 2. American Chemical Society, pp. 376–385, 2016.","ama":"Pieber B, Cox DP, Kappe CO. Selective olefin reduction in thebaine using hydrazine hydrate and O₂ under intensified continuous flow conditions. Organic Process Research and Development. 2016;20(2):376-385. doi:10.1021/acs.oprd.5b00370","short":"B. Pieber, D.P. Cox, C.O. Kappe, Organic Process Research and Development 20 (2016) 376–385."},"extern":"1","publisher":"American Chemical Society","date_published":"2016-02-19T00:00:00Z","type":"journal_article","abstract":[{"text":"Hydrocodone, a high value active pharmaceutical ingredient (API), is usually produced in a semisynthetic pathway from morphine, codeine or thebaine. The latter alkaloid is an attractive precursor as it is not used as a remedy itself. The key step in this production route is a selective olefin reduction forming 8,14-dihydrothebaine which can be subsequently hydrolyzed to yield hydrocodone. Unfortunately, standard hydrogenation procedures cannot be applied due to severe selectivity problems. A transfer hydrogenation using in situ generated diimide is the only known alternative to achieve a selective transformation. The most (atom) economic generation of this highly unstable reducing agent is by oxidizing hydrazine hydrate (N2H4·H2O) with O2. In the past, this route was “forbidden” on an industrial scale due to its enormous explosion potential in batch. A continuous high-temperature/high-pressure methodology allows an efficient, safe, and scalable processing of the hazardous reaction mixture. The industrially relevant reduction was achieved by using four consecutive liquid feeds (of N2H4·H2O) and residence time units, resulting in a highly selective reduction within less than 1 h.","lang":"eng"}],"publication_identifier":{"issn":["1083-6160"],"eissn":["1520-586X"]},"publication_status":"published","day":"19","date_updated":"2023-02-21T10:10:26Z","author":[{"full_name":"Pieber, Bartholomäus","last_name":"Pieber","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726"},{"full_name":"Cox, D. Phillip","last_name":"Cox","first_name":"D. Phillip"},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"}],"intvolume":" 20","_id":"11985","year":"2016","article_type":"original","language":[{"iso":"eng"}],"volume":20,"month":"02","issue":"2","page":"376-385","status":"public","date_created":"2022-08-25T11:34:28Z","article_processing_charge":"No","quality_controlled":"1","publication":"Organic Process Research and Development","oa_version":"None","title":"Selective olefin reduction in thebaine using hydrazine hydrate and O₂ under intensified continuous flow conditions","doi":"10.1021/acs.oprd.5b00370"},{"issue":"01","page":"83-87","status":"public","article_processing_charge":"No","date_created":"2022-08-25T11:52:22Z","publication":"Synlett","quality_controlled":"1","oa_version":"None","title":"Continuous synthesis of hydantoins: Intensifying the Bucherer–Bergs reaction","doi":"10.1055/s-0035-1560317","language":[{"iso":"eng"}],"volume":27,"month":"01","intvolume":" 27","_id":"11988","article_type":"letter_note","year":"2016","publisher":"Georg Thieme Verlag","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"apa":"Kappe, C., Monteiro, J., Pieber, B., & Corrêa, A. (2016). Continuous synthesis of hydantoins: Intensifying the Bucherer–Bergs reaction. Synlett. Georg Thieme Verlag. https://doi.org/10.1055/s-0035-1560317","mla":"Kappe, C., et al. “Continuous Synthesis of Hydantoins: Intensifying the Bucherer–Bergs Reaction.” Synlett, vol. 27, no. 01, Georg Thieme Verlag, 2016, pp. 83–87, doi:10.1055/s-0035-1560317.","ama":"Kappe C, Monteiro J, Pieber B, Corrêa A. Continuous synthesis of hydantoins: Intensifying the Bucherer–Bergs reaction. Synlett. 2016;27(01):83-87. doi:10.1055/s-0035-1560317","chicago":"Kappe, C., Julia Monteiro, Bartholomäus Pieber, and Arlene Corrêa. “Continuous Synthesis of Hydantoins: Intensifying the Bucherer–Bergs Reaction.” Synlett. Georg Thieme Verlag, 2016. https://doi.org/10.1055/s-0035-1560317.","ieee":"C. Kappe, J. Monteiro, B. Pieber, and A. Corrêa, “Continuous synthesis of hydantoins: Intensifying the Bucherer–Bergs reaction,” Synlett, vol. 27, no. 01. Georg Thieme Verlag, pp. 83–87, 2016.","ista":"Kappe C, Monteiro J, Pieber B, Corrêa A. 2016. Continuous synthesis of hydantoins: Intensifying the Bucherer–Bergs reaction. Synlett. 27(01), 83–87.","short":"C. Kappe, J. Monteiro, B. Pieber, A. Corrêa, Synlett 27 (2016) 83–87."},"scopus_import":"1","date_published":"2016-01-04T00:00:00Z","abstract":[{"text":"A continuous Bucherer–Bergs hydantoin synthesis utilizing intensified conditions is reported. The methodology is characterized by a two-feed flow approach to independently feed the organic substrate and the aqueous reagent solution. The increased interfacial area of the biphasic reaction mixture and the lack of headspace enabled almost quantitative conversions within ca. 30 minutes at 120 °C and 20 bar even for unpolar starting materials. In addition, a selective N(3)-monoalkylation of the resulting heterocycles under batch microwave conditions is reported yielding potential acetylcholinesterase inhibitors.","lang":"eng"}],"type":"journal_article","publication_identifier":{"eissn":["1437-2096"],"issn":["0936-5214"]},"publication_status":"published","date_updated":"2023-02-21T10:10:33Z","day":"04","author":[{"full_name":"Kappe, C.","last_name":"Kappe","first_name":"C."},{"full_name":"Monteiro, Julia","last_name":"Monteiro","first_name":"Julia"},{"orcid":"0000-0001-8689-388X","last_name":"Pieber","full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus"},{"first_name":"Arlene","full_name":"Corrêa, Arlene","last_name":"Corrêa"}]}]