[{"language":[{"iso":"eng"}],"type":"conference","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"intvolume":"      7148","conference":{"location":"Philadelphia, PA, USA","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","start_date":"2012-01-22","end_date":"2012-01-24"},"date_updated":"2025-06-11T08:06:25Z","citation":{"chicago":"Chatterjee, Krishnendu, and Vishwanath Raman. “Synthesizing Protocols for Digital Contract Signing,” 7148:152–68. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_11\">https://doi.org/10.1007/978-3-642-27940-9_11</a>.","apa":"Chatterjee, K., &#38; Raman, V. (2012). Synthesizing protocols for digital contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_11\">https://doi.org/10.1007/978-3-642-27940-9_11</a>","short":"K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168.","mla":"Chatterjee, Krishnendu, and Vishwanath Raman. <i>Synthesizing Protocols for Digital Contract Signing</i>. Vol. 7148, Springer, 2012, pp. 152–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_11\">10.1007/978-3-642-27940-9_11</a>.","ama":"Chatterjee K, Raman V. Synthesizing protocols for digital contract signing. In: Vol 7148. Springer; 2012:152-168. doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_11\">10.1007/978-3-642-27940-9_11</a>","ieee":"K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.","ista":"Chatterjee K, Raman V. 2012. Synthesizing protocols for digital contract signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 152–168."},"date_published":"2012-01-20T00:00:00Z","quality_controlled":"1","publist_id":"3405","article_processing_charge":"No","status":"public","day":"20","date_created":"2018-12-11T12:02:16Z","department":[{"_id":"KrCh"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Raman","first_name":"Vishwanath","full_name":"Raman, Vishwanath"}],"external_id":{"arxiv":["1004.2697"]},"publisher":"Springer","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23 (Modern Graph Algorithmic Techniques in Formal Verification), FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.\r\nThe authors would like to thank Avik Chaudhuri for his invaluable help and feedback.","alternative_title":["LNCS"],"month":"01","abstract":[{"lang":"eng","text":"We study the automatic synthesis of fair non-repudiation protocols, a class of fair exchange protocols, used for digital contract signing. First, we show how to specify the objectives of the participating agents, the trusted third party (TTP) and the protocols as path formulas in Linear Temporal Logic (LTL) and prove that the satisfaction of the objectives of the agents and the TTP imply satisfaction of the protocol objectives. We then show that weak (co-operative) co-synthesis and classical (strictly competitive) co-synthesis fail in synthesizing these protocols, whereas assume-guarantee synthesis (AGS) succeeds. We demonstrate the success of assume-guarantee synthesis as follows: (a) any solution of assume-guarantee synthesis is attack-free; no subset of participants can violate the objectives of the other participants without violating their own objectives; (b) the Asokan-Shoup-Waidner (ASW) certified mail protocol that has known vulnerabilities is not a solution of AGS; and (c) the Kremer-Markowitch (KM) non-repudiation protocol is a solution of AGS. To our knowledge this is the first application of synthesis to fair non-repudiation protocols, and our results show how synthesis can generate correct protocols and automatically discover vulnerabilities. The solution to assume-guarantee synthesis can be computed efficiently as the secure equilibrium solution of three-player graph games. © 2012 Springer-Verlag."}],"arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1004.2697","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","doi":"10.1007/978-3-642-27940-9_11","_id":"3252","publication_status":"published","page":"152 - 168","ec_funded":1,"title":"Synthesizing protocols for digital contract signing","volume":7148,"year":"2012","oa_version":"Preprint","oa":1},{"month":"02","intvolume":"      7148","alternative_title":["LNCS"],"type":"conference","acknowledgement":"This work was partly supported by the French National Research Agency (ANR) project Veridyc (ANR-09-SEGI-016).","language":[{"iso":"eng"}],"_id":"3253","publist_id":"3404","quality_controlled":"1","publication_status":"published","page":"1 - 22","date_published":"2012-02-26T00:00:00Z","conference":{"start_date":"2012-01-22","end_date":"2012-01-24","location":"Philadelphia, PA, USA","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"date_updated":"2024-10-21T06:02:58Z","scopus_import":"1","doi":"10.1007/978-3-642-27940-9_1","citation":{"ieee":"A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Abstract domains for automated reasoning about list manipulating programs with infinite data,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 1–22.","ama":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. Abstract domains for automated reasoning about list manipulating programs with infinite data. In: Vol 7148. Springer; 2012:1-22. doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_1\">10.1007/978-3-642-27940-9_1</a>","ista":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Abstract domains for automated reasoning about list manipulating programs with infinite data. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 1–22.","chicago":"Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data,” 7148:1–22. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_1\">https://doi.org/10.1007/978-3-642-27940-9_1</a>.","apa":"Bouajjani, A., Dragoi, C., Enea, C., &#38; Sighireanu, M. (2012). Abstract domains for automated reasoning about list manipulating programs with infinite data (Vol. 7148, pp. 1–22). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_1\">https://doi.org/10.1007/978-3-642-27940-9_1</a>","mla":"Bouajjani, Ahmed, et al. <i>Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data</i>. Vol. 7148, Springer, 2012, pp. 1–22, doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_1\">10.1007/978-3-642-27940-9_1</a>.","short":"A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2012, pp. 1–22."},"abstract":[{"text":"We describe a framework for reasoning about programs with lists carrying integer numerical data. We use abstract domains to describe and manipulate complex constraints on configurations of these programs mixing constraints on the shape of the heap, sizes of the lists, on the multisets of data stored in these lists, and on the data at their different positions. Moreover, we provide powerful techniques for automatic validation of Hoare-triples and invariant checking, as well as for automatic synthesis of invariants and procedure summaries using modular inter-procedural analysis. The approach has been implemented in a tool called Celia and experimented successfully on a large benchmark of programs.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:02:17Z","title":"Abstract domains for automated reasoning about list manipulating programs with infinite data","department":[{"_id":"ToHe"}],"volume":7148,"day":"26","status":"public","publisher":"Springer","oa_version":"None","author":[{"full_name":"Bouajjani, Ahmed","last_name":"Bouajjani","first_name":"Ahmed"},{"full_name":"Dragoi, Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","last_name":"Dragoi","first_name":"Cezara"},{"last_name":"Enea","first_name":"Constantin","full_name":"Enea, Constantin"},{"last_name":"Sighireanu","first_name":"Mihaela","full_name":"Sighireanu, Mihaela"}],"year":"2012"},{"publication":"Information and Computation","ec_funded":1,"title":"The complexity of stochastic Müller games","volume":211,"year":"2012","oa_version":"None","isi":1,"acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","month":"02","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"url":"http://arise.or.at/pubpdf/The_complexity_of_stochastic_M___u_ller_games.pdf"}],"abstract":[{"text":"The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph games: the qualitative problem asks for the set of states from which a player can win with probability 1 (almost-sure winning); and the quantitative problem asks for the maximal probability of winning (optimal winning) from each state. We consider ω-regular winning conditions formalized as Müller winning conditions. We present optimal memory bounds for pure (deterministic) almost-sure winning and optimal winning strategies in stochastic graph games with Müller winning conditions. We also study the complexity of stochastic Müller games and show that both the qualitative and quantitative analysis problems are PSPACE-complete. Our results are relevant in synthesis of stochastic reactive processes.","lang":"eng"}],"doi":"10.1016/j.ic.2011.11.004","scopus_import":"1","publication_status":"published","page":"29 - 48","_id":"3254","status":"public","article_processing_charge":"No","day":"01","corr_author":"1","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T12:02:17Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"}],"publisher":"Elsevier","external_id":{"isi":["000300468000002"]},"language":[{"iso":"eng"}],"type":"journal_article","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"intvolume":"       211","citation":{"ista":"Chatterjee K. 2012. The complexity of stochastic Müller games. Information and Computation. 211, 29–48.","ieee":"K. Chatterjee, “The complexity of stochastic Müller games,” <i>Information and Computation</i>, vol. 211. Elsevier, pp. 29–48, 2012.","ama":"Chatterjee K. The complexity of stochastic Müller games. <i>Information and Computation</i>. 2012;211:29-48. doi:<a href=\"https://doi.org/10.1016/j.ic.2011.11.004\">10.1016/j.ic.2011.11.004</a>","apa":"Chatterjee, K. (2012). The complexity of stochastic Müller games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2011.11.004\">https://doi.org/10.1016/j.ic.2011.11.004</a>","chicago":"Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” <i>Information and Computation</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.ic.2011.11.004\">https://doi.org/10.1016/j.ic.2011.11.004</a>.","mla":"Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” <i>Information and Computation</i>, vol. 211, Elsevier, 2012, pp. 29–48, doi:<a href=\"https://doi.org/10.1016/j.ic.2011.11.004\">10.1016/j.ic.2011.11.004</a>.","short":"K. Chatterjee, Information and Computation 211 (2012) 29–48."},"date_updated":"2025-09-30T07:45:01Z","date_published":"2012-02-01T00:00:00Z","quality_controlled":"1","publist_id":"3403"},{"acknowledgement":"This work was partially supported by FWF NFN Grant S11407-N23 (RiSE) and a Microsoft faculty fellowship.","alternative_title":["LNCS"],"month":"01","scopus_import":1,"doi":"10.1007/978-3-642-25929-6_3","abstract":[{"text":"In this paper we survey results of two-player games on graphs and Markov decision processes with parity, mean-payoff and energy objectives, and the combination of mean-payoff and energy objectives with parity objectives. These problems have applications in verification and synthesis of reactive systems in resource-constrained environments.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3255","publication_status":"published","page":"37 - 46","title":"Games and Markov decision processes with mean payoff parity and energy parity objectives","volume":7119,"ddc":["000"],"year":"2012","has_accepted_license":"1","file":[{"access_level":"open_access","file_size":114060,"date_created":"2020-05-15T12:53:12Z","checksum":"eed2cc1e76b160418c977e76e8899a60","file_name":"2012_MEMICS_Chatterjee.pdf","date_updated":"2020-07-14T12:46:05Z","relation":"main_file","file_id":"7863","content_type":"application/pdf","creator":"dernst"}],"oa_version":"Submitted Version","oa":1,"type":"conference","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"intvolume":"      7119","conference":{"name":"MEMICS: Mathematical and Engineering Methods in Computer Science","location":"Lednice, Czech Republic","end_date":"2011-10-16","start_date":"2011-10-14"},"date_updated":"2021-01-12T07:42:10Z","citation":{"ieee":"K. Chatterjee and L. Doyen, “Games and Markov decision processes with mean payoff parity and energy parity objectives,” presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic, 2012, vol. 7119, pp. 37–46.","ama":"Chatterjee K, Doyen L. Games and Markov decision processes with mean payoff parity and energy parity objectives. In: Vol 7119. Springer; 2012:37-46. doi:<a href=\"https://doi.org/10.1007/978-3-642-25929-6_3\">10.1007/978-3-642-25929-6_3</a>","ista":"Chatterjee K, Doyen L. 2012. Games and Markov decision processes with mean payoff parity and energy parity objectives. MEMICS: Mathematical and Engineering Methods in Computer Science, LNCS, vol. 7119, 37–46.","short":"K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives</i>. Vol. 7119, Springer, 2012, pp. 37–46, doi:<a href=\"https://doi.org/10.1007/978-3-642-25929-6_3\">10.1007/978-3-642-25929-6_3</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2012). Games and Markov decision processes with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-25929-6_3\">https://doi.org/10.1007/978-3-642-25929-6_3</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives,” 7119:37–46. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-25929-6_3\">https://doi.org/10.1007/978-3-642-25929-6_3</a>."},"quality_controlled":"1","publist_id":"3400","file_date_updated":"2020-07-14T12:46:05Z","date_published":"2012-01-01T00:00:00Z","day":"01","status":"public","article_processing_charge":"No","date_created":"2018-12-11T12:02:17Z","department":[{"_id":"KrCh"}],"publisher":"Springer","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}]},{"scopus_import":"1","doi":"10.1007/s00454-011-9382-4","abstract":[{"text":"We use a distortion to define the dual complex of a cubical subdivision of ℝ n as an n-dimensional subcomplex of the nerve of the set of n-cubes. Motivated by the topological analysis of high-dimensional digital image data, we consider such subdivisions defined by generalizations of quad- and oct-trees to n dimensions. Assuming the subdivision is balanced, we show that mapping each vertex to the center of the corresponding n-cube gives a geometric realization of the dual complex in ℝ n.","lang":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","issue":"2","_id":"3256","publication_status":"published","page":"393 - 414","acknowledgement":"This research is partially supported by the Defense Advanced Research Projects Agency (DARPA) under grants HR0011-05-1-0057 and HR0011-09-0065 as well as the National Science Foundation (NSF) under grant DBI-0820624.","month":"03","ddc":["000"],"year":"2012","has_accepted_license":"1","file":[{"relation":"main_file","date_updated":"2020-07-14T12:46:05Z","content_type":"application/pdf","creator":"system","file_id":"4675","file_size":203636,"access_level":"open_access","checksum":"76486f3b2c9e7fd81342f3832ca387e7","file_name":"IST-2016-543-v1+1_2012-J-08-HierarchyCubeComplex.pdf","date_created":"2018-12-12T10:08:15Z"}],"isi":1,"oa_version":"Submitted Version","oa":1,"publication":"Discrete & Computational Geometry","volume":47,"title":"Dual complexes of cubical subdivisions of ℝn","date_updated":"2025-09-30T07:43:46Z","citation":{"short":"H. Edelsbrunner, M. Kerber, Discrete &#38; Computational Geometry 47 (2012) 393–414.","mla":"Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” <i>Discrete &#38; Computational Geometry</i>, vol. 47, no. 2, Springer, 2012, pp. 393–414, doi:<a href=\"https://doi.org/10.1007/s00454-011-9382-4\">10.1007/s00454-011-9382-4</a>.","apa":"Edelsbrunner, H., &#38; Kerber, M. (2012). Dual complexes of cubical subdivisions of ℝn. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-011-9382-4\">https://doi.org/10.1007/s00454-011-9382-4</a>","chicago":"Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00454-011-9382-4\">https://doi.org/10.1007/s00454-011-9382-4</a>.","ama":"Edelsbrunner H, Kerber M. Dual complexes of cubical subdivisions of ℝn. <i>Discrete &#38; Computational Geometry</i>. 2012;47(2):393-414. doi:<a href=\"https://doi.org/10.1007/s00454-011-9382-4\">10.1007/s00454-011-9382-4</a>","ieee":"H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of ℝn,” <i>Discrete &#38; Computational Geometry</i>, vol. 47, no. 2. Springer, pp. 393–414, 2012.","ista":"Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of ℝn. Discrete &#38; Computational Geometry. 47(2), 393–414."},"pubrep_id":"543","file_date_updated":"2020-07-14T12:46:05Z","quality_controlled":"1","publist_id":"3398","date_published":"2012-03-01T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"        47","external_id":{"isi":["000299057200010"]},"publisher":"Springer","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","last_name":"Kerber","first_name":"Michael"}],"day":"01","article_processing_charge":"No","status":"public","date_created":"2018-12-11T12:02:17Z","department":[{"_id":"HeEd"}],"corr_author":"1"},{"_id":"3257","issue":"4-5","publication_status":"published","page":"416 - 426","scopus_import":"1","doi":"10.1016/j.dam.2011.10.026","abstract":[{"text":"Consider a convex relaxation f̂ of a pseudo-Boolean function f. We say that the relaxation is totally half-integral if f̂(x) is a polyhedral function with half-integral extreme points x, and this property is preserved after adding an arbitrary combination of constraints of the form x i=x j, x i=1-x j, and x i=γ where γ∈{0,1,1/2} is a constant. A well-known example is the roof duality relaxation for quadratic pseudo-Boolean functions f. We argue that total half-integrality is a natural requirement for generalizations of roof duality to arbitrary pseudo-Boolean functions. Our contributions are as follows. First, we provide a complete characterization of totally half-integral relaxations f̂ by establishing a one-to-one correspondence with bisubmodular functions. Second, we give a new characterization of bisubmodular functions. Finally, we show some relationships between general totally half-integral relaxations and relaxations based on the roof duality. On the conceptual level, our results show that bisubmodular functions provide a natural generalization of the roof duality approach to higher-order terms. This can be viewed as a non-submodular analogue of the fact that submodular functions generalize the s-t minimum cut problem with non-negative weights to higher-order terms.","lang":"eng"}],"arxiv":1,"main_file_link":[{"url":"http://arxiv.org/abs/1005.2305","open_access":"1"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"03","isi":1,"oa":1,"oa_version":"Preprint","year":"2012","title":"Generalized roof duality and bisubmodular functions","volume":160,"publication":"Discrete Applied Mathematics","publist_id":"3397","quality_controlled":"1","date_published":"2012-03-01T00:00:00Z","date_updated":"2025-09-30T07:43:17Z","citation":{"ista":"Kolmogorov V. 2012. Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics. 160(4–5), 416–426.","ieee":"V. Kolmogorov, “Generalized roof duality and bisubmodular functions,” <i>Discrete Applied Mathematics</i>, vol. 160, no. 4–5. Elsevier, pp. 416–426, 2012.","ama":"Kolmogorov V. Generalized roof duality and bisubmodular functions. <i>Discrete Applied Mathematics</i>. 2012;160(4-5):416-426. doi:<a href=\"https://doi.org/10.1016/j.dam.2011.10.026\">10.1016/j.dam.2011.10.026</a>","mla":"Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” <i>Discrete Applied Mathematics</i>, vol. 160, no. 4–5, Elsevier, 2012, pp. 416–26, doi:<a href=\"https://doi.org/10.1016/j.dam.2011.10.026\">10.1016/j.dam.2011.10.026</a>.","short":"V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 416–426.","apa":"Kolmogorov, V. (2012). Generalized roof duality and bisubmodular functions. <i>Discrete Applied Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.dam.2011.10.026\">https://doi.org/10.1016/j.dam.2011.10.026</a>","chicago":"Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” <i>Discrete Applied Mathematics</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.dam.2011.10.026\">https://doi.org/10.1016/j.dam.2011.10.026</a>."},"intvolume":"       160","type":"journal_article","language":[{"iso":"eng"}],"external_id":{"arxiv":["1005.2305"],"isi":["000301211100006"]},"publisher":"Elsevier","author":[{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"}],"date_created":"2018-12-11T12:02:18Z","department":[{"_id":"VlKo"}],"corr_author":"1","day":"01","related_material":{"record":[{"id":"2934","status":"public","relation":"earlier_version"}]},"status":"public","article_processing_charge":"No"},{"quality_controlled":"1","publist_id":"3390","date_published":"2012-04-01T00:00:00Z","date_updated":"2026-06-18T18:41:54Z","citation":{"chicago":"Kim, Sooyun, José Guzmán, Hua Hu, and Peter M Jonas. “Active Dendrites Support Efficient Initiation of Dendritic Spikes in Hippocampal CA3 Pyramidal Neurons.” <i>Nature Neuroscience</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nn.3060\">https://doi.org/10.1038/nn.3060</a>.","apa":"Kim, S., Guzmán, J., Hu, H., &#38; Jonas, P. M. (2012). Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons. <i>Nature Neuroscience</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nn.3060\">https://doi.org/10.1038/nn.3060</a>","short":"S. Kim, J. Guzmán, H. Hu, P.M. Jonas, Nature Neuroscience 15 (2012) 600–606.","mla":"Kim, Sooyun, et al. “Active Dendrites Support Efficient Initiation of Dendritic Spikes in Hippocampal CA3 Pyramidal Neurons.” <i>Nature Neuroscience</i>, vol. 15, no. 4, Nature Publishing Group, 2012, pp. 600–06, doi:<a href=\"https://doi.org/10.1038/nn.3060\">10.1038/nn.3060</a>.","ieee":"S. Kim, J. Guzmán, H. Hu, and P. M. Jonas, “Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons,” <i>Nature Neuroscience</i>, vol. 15, no. 4. Nature Publishing Group, pp. 600–606, 2012.","ama":"Kim S, Guzmán J, Hu H, Jonas PM. Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons. <i>Nature Neuroscience</i>. 2012;15(4):600-606. doi:<a href=\"https://doi.org/10.1038/nn.3060\">10.1038/nn.3060</a>","ista":"Kim S, Guzmán J, Hu H, Jonas PM. 2012. Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons. Nature Neuroscience. 15(4), 600–606."},"intvolume":"        15","type":"journal_article","project":[{"name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"external_id":{"pmid":["22388958"],"isi":["000302114500020"]},"publisher":"Nature Publishing Group","article_type":"original","author":[{"last_name":"Kim","id":"394AB1C8-F248-11E8-B48F-1D18A9856A87","first_name":"Sooyun","full_name":"Kim, Sooyun"},{"first_name":"José","last_name":"Guzmán","id":"30CC5506-F248-11E8-B48F-1D18A9856A87","full_name":"Guzmán, José","orcid":"0000-0003-2209-5242"},{"last_name":"Hu","id":"4AC0145C-F248-11E8-B48F-1D18A9856A87","first_name":"Hua","full_name":"Hu, Hua"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804"}],"date_created":"2018-12-11T12:02:18Z","department":[{"_id":"PeJo"}],"corr_author":"1","day":"01","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"2964"}]},"publication_identifier":{"issn":["1546-1726"]},"article_processing_charge":"No","status":"public","issue":"4","_id":"3258","page":"600 - 606","pmid":1,"publication_status":"published","scopus_import":"1","doi":"10.1038/nn.3060","abstract":[{"text":"CA3 pyramidal neurons are important for memory formation and pattern completion in the hippocampal network. It is generally thought that proximal synapses from the mossy fibers activate these neurons most efficiently, whereas distal inputs from the perforant path have a weaker modulatory influence. We used confocally targeted patch-clamp recording from dendrites and axons to map the activation of rat CA3 pyramidal neurons at the subcellular level. Our results reveal two distinct dendritic domains. In the proximal domain, action potentials initiated in the axon backpropagate actively with large amplitude and fast time course. In the distal domain, Na+ channel–mediated dendritic spikes are efficiently initiated by waveforms mimicking synaptic events. CA3 pyramidal neuron dendrites showed a high Na+-to-K+ conductance density ratio, providing ideal conditions for active backpropagation and dendritic spike initiation. Dendritic spikes may enhance the computational power of CA3 pyramidal neurons in the hippocampal network.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3617474/","open_access":"1"}],"month":"04","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (TR 3/B10) and the European Union (European Research Council Advanced grant to P.J.).","isi":1,"oa_version":"Published Version","oa":1,"year":"2012","ddc":["570"],"title":"Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons","volume":15,"publication":"Nature Neuroscience"},{"language":[{"iso":"eng"}],"type":"conference","month":"01","abstract":[{"lang":"eng","text":"We propose a mid-level statistical model for image segmentation that composes multiple figure-ground hypotheses (FG) obtained by applying constraints at different locations and scales, into larger interpretations (tilings) of the entire image. Inference is cast as optimization over sets of maximal cliques sampled from a graph connecting all non-overlapping figure-ground segment hypotheses. Potential functions over cliques combine unary, Gestalt-based figure qualities, and pairwise compatibilities among spatially neighboring segments, constrained by T-junctions and the boundary interface statistics of real scenes. Learning the model parameters is based on maximum likelihood, alternating between sampling image tilings and optimizing their potential function parameters. State of the art results are reported on the Berkeley and Stanford segmentation datasets, as well as VOC2009, where a 28% improvement was achieved."}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2011-11-13","start_date":"2011-11-06","name":"ICCV: International Conference on Computer Vision","location":"Barcelona, Spain"},"date_updated":"2021-01-12T07:42:15Z","citation":{"ieee":"A. Ion, J. Carreira, and C. Sminchisescu, “Image segmentation by figure-ground composition into maximal cliques,” presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain, 2012.","ista":"Ion A, Carreira J, Sminchisescu C. 2012. Image segmentation by figure-ground composition into maximal cliques. ICCV: International Conference on Computer Vision, 6126486.","ama":"Ion A, Carreira J, Sminchisescu C. Image segmentation by figure-ground composition into maximal cliques. In: IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">10.1109/ICCV.2011.6126486</a>","chicago":"Ion, Adrian, Joao Carreira, and Cristian Sminchisescu. “Image Segmentation by Figure-Ground Composition into Maximal Cliques.” IEEE, 2012. <a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">https://doi.org/10.1109/ICCV.2011.6126486</a>.","apa":"Ion, A., Carreira, J., &#38; Sminchisescu, C. (2012). Image segmentation by figure-ground composition into maximal cliques. Presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">https://doi.org/10.1109/ICCV.2011.6126486</a>","mla":"Ion, Adrian, et al. <i>Image Segmentation by Figure-Ground Composition into Maximal Cliques</i>. 6126486, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">10.1109/ICCV.2011.6126486</a>.","short":"A. Ion, J. Carreira, C. Sminchisescu, in:, IEEE, 2012."},"doi":"10.1109/ICCV.2011.6126486","date_published":"2012-01-12T00:00:00Z","_id":"3265","publist_id":"3382","quality_controlled":"1","publication_status":"published","status":"public","day":"12","article_number":"6126486","date_created":"2018-12-11T12:02:21Z","department":[{"_id":"HeEd"}],"title":"Image segmentation by figure-ground composition into maximal cliques","year":"2012","author":[{"id":"29F89302-F248-11E8-B48F-1D18A9856A87","last_name":"Ion","first_name":"Adrian","full_name":"Ion, Adrian"},{"first_name":"Joao","last_name":"Carreira","full_name":"Carreira, Joao"},{"full_name":"Sminchisescu, Cristian","last_name":"Sminchisescu","first_name":"Cristian"}],"oa_version":"None","publisher":"IEEE"},{"intvolume":"        24","month":"01","language":[{"iso":"eng"}],"alternative_title":["Cellular Origin, Life in Extreme Habitats and Astrobiology"],"type":"book_chapter","date_published":"2012-01-01T00:00:00Z","quality_controlled":"1","_id":"3277","publist_id":"3369","page":"387 - 405","publication_status":"published","abstract":[{"lang":"eng","text":"The problem of the origin of metazoa is becoming more urgent in the context of astrobiology. By now it is clear that clues to the understanding of this crucial transition in the evolution of life can arise in a fourth pathway besides the three possibilities in the quest for simplicity outlined by Bonner in his classical book. In other words, solar system exploration seems to be one way in the long-term to elucidate the simplicity of evolutionary development. We place these ideas in the context of different inheritance systems, namely the genotypic and phenotypic replicators with limited or unlimited heredity, and ask which of these can support multicellular development, and to which degree of complexity. However, the quest for evidence on the evolution of biotas from planets around other stars does not seem to be feasible with present technology with direct visualization of living organisms on exoplanets. But this may be attempted on the Galilean moons of Jupiter where there is a possibility of detecting reliable biomarkers in the next decade with the Europa Jupiter System Mission, in view of recent progress by landing micropenetrators on planetary, or satellite surfaces. Mars is a second possibility in the inner Solar System, in spite of the multiple difficulties faced by the fleet of past, present and future missions. We discuss a series of preliminary ideas for elucidating the origin of metazoan analogues with available instrumentation in potential payloads of feasible space missions to the Galilean moons."}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T20:54:39Z","citation":{"ama":"de Vladar H, Chela Flores J. Can the evolution of multicellularity be anticipated in the exploration of the solar system? In: <i>Life on Earth and Other Planetary Bodies</i>. Vol 24. Springer; 2012:387-405. doi:<a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">10.1007/978-94-007-4966-5_22</a>","ista":"de Vladar H, Chela Flores J. 2012.Can the evolution of multicellularity be anticipated in the exploration of the solar system? In: Life on Earth and other planetary bodies. Cellular Origin, Life in Extreme Habitats and Astrobiology, vol. 24, 387–405.","ieee":"H. de Vladar and J. Chela Flores, “Can the evolution of multicellularity be anticipated in the exploration of the solar system?,” in <i>Life on Earth and other planetary bodies</i>, vol. 24, Springer, 2012, pp. 387–405.","chicago":"Vladar, Harold de, and Julian Chela Flores. “Can the Evolution of Multicellularity Be Anticipated in the Exploration of the Solar System?” In <i>Life on Earth and Other Planetary Bodies</i>, 24:387–405. Springer, 2012. <a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">https://doi.org/10.1007/978-94-007-4966-5_22</a>.","apa":"de Vladar, H., &#38; Chela Flores, J. (2012). Can the evolution of multicellularity be anticipated in the exploration of the solar system? In <i>Life on Earth and other planetary bodies</i> (Vol. 24, pp. 387–405). Springer. <a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">https://doi.org/10.1007/978-94-007-4966-5_22</a>","mla":"de Vladar, Harold, and Julian Chela Flores. “Can the Evolution of Multicellularity Be Anticipated in the Exploration of the Solar System?” <i>Life on Earth and Other Planetary Bodies</i>, vol. 24, Springer, 2012, pp. 387–405, doi:<a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">10.1007/978-94-007-4966-5_22</a>.","short":"H. de Vladar, J. Chela Flores, in:, Life on Earth and Other Planetary Bodies, Springer, 2012, pp. 387–405."},"doi":"10.1007/978-94-007-4966-5_22","corr_author":"1","date_created":"2018-12-11T12:02:25Z","volume":24,"department":[{"_id":"NiBa"}],"title":"Can the evolution of multicellularity be anticipated in the exploration of the solar system?","publication":"Life on Earth and other planetary bodies","status":"public","day":"01","oa_version":"None","author":[{"orcid":"0000-0002-5985-7653","full_name":"de Vladar, Harold","last_name":"de Vladar","id":"2A181218-F248-11E8-B48F-1D18A9856A87","first_name":"Harold"},{"first_name":"Julian","last_name":"Chela Flores","full_name":"Chela Flores, Julian"}],"publisher":"Springer","year":"2012"},{"abstract":[{"text":"We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the number of queries to the PRF. Our construction requires only O(logq) invocations to the underlying PRG with each query. In comparison, the number of invocations by the best previous hardness-preserving construction (GGM using Levin's trick) is logarithmic in the hardness of the PRG. For example, starting from an exponentially secure PRG {0,1} n → {0,1} 2n, we get a PRF which is exponentially secure if queried at most q = exp(√n)times and where each invocation of the PRF requires Θ(√n) queries to the underlying PRG. This is much less than the Θ(n) required by known constructions. \r\n","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"http://www.iacr.org/archive/tcc2012/tcc2012-index.html"}],"scopus_import":1,"doi":"10.1007/978-3-642-28914-9_21","_id":"3279","publication_status":"published","page":"369 - 382","alternative_title":["LNCS"],"acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)","month":"05","year":"2012","oa_version":"None","ec_funded":1,"volume":7194,"title":"Hardness preserving constructions of pseudorandom functions","conference":{"end_date":"2012-03-21","start_date":"2012-03-19","name":"TCC: Theory of Cryptography Conference","location":"Taormina, Sicily, Italy"},"date_updated":"2021-01-12T07:42:21Z","citation":{"ista":"Jain A, Pietrzak KZ, Tentes A. 2012. Hardness preserving constructions of pseudorandom functions. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 369–382.","ama":"Jain A, Pietrzak KZ, Tentes A. Hardness preserving constructions of pseudorandom functions. In: Vol 7194. Springer; 2012:369-382. doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">10.1007/978-3-642-28914-9_21</a>","ieee":"A. Jain, K. Z. Pietrzak, and A. Tentes, “Hardness preserving constructions of pseudorandom functions,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 369–382.","apa":"Jain, A., Pietrzak, K. Z., &#38; Tentes, A. (2012). Hardness preserving constructions of pseudorandom functions (Vol. 7194, pp. 369–382). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">https://doi.org/10.1007/978-3-642-28914-9_21</a>","chicago":"Jain, Abhishek, Krzysztof Z Pietrzak, and Aris Tentes. “Hardness Preserving Constructions of Pseudorandom Functions,” 7194:369–82. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">https://doi.org/10.1007/978-3-642-28914-9_21</a>.","mla":"Jain, Abhishek, et al. <i>Hardness Preserving Constructions of Pseudorandom Functions</i>. Vol. 7194, Springer, 2012, pp. 369–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">10.1007/978-3-642-28914-9_21</a>.","short":"A. Jain, K.Z. Pietrzak, A. Tentes, in:, Springer, 2012, pp. 369–382."},"date_published":"2012-05-04T00:00:00Z","publist_id":"3367","quality_controlled":"1","language":[{"iso":"eng"}],"project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"type":"conference","intvolume":"      7194","author":[{"first_name":"Abhishek","last_name":"Jain","full_name":"Jain, Abhishek"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Tentes, Aris","first_name":"Aris","last_name":"Tentes"}],"publisher":"Springer","status":"public","day":"04","date_created":"2018-12-11T12:02:25Z","department":[{"_id":"KrPi"}]},{"title":"Subspace LWE","volume":7194,"ec_funded":1,"oa_version":"Submitted Version","oa":1,"year":"2012","month":"05","acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC).","alternative_title":["LNCS"],"publication_status":"published","page":"548 - 563","_id":"3280","doi":"10.1007/978-3-642-28914-9_31","scopus_import":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"http://www.iacr.org/archive/tcc2012/71940166/71940166.pdf"}],"abstract":[{"lang":"eng","text":"The (decisional) learning with errors problem (LWE) asks to distinguish &quot;noisy&quot; inner products of a secret vector with random vectors from uniform. The learning parities with noise problem (LPN) is the special case where the elements of the vectors are bits. In recent years, the LWE and LPN problems have found many applications in cryptography. In this paper we introduce a (seemingly) much stronger adaptive assumption, called &quot;subspace LWE&quot; (SLWE), where the adversary can learn the inner product of the secret and random vectors after they were projected into an adaptively and adversarially chosen subspace. We prove that, surprisingly, the SLWE problem mapping into subspaces of dimension d is almost as hard as LWE using secrets of length d (the other direction is trivial.) This result immediately implies that several existing cryptosystems whose security is based on the hardness of the LWE/LPN problems are provably secure in a much stronger sense than anticipated. As an illustrative example we show that the standard way of using LPN for symmetric CPA secure encryption is even secure against a very powerful class of related key attacks. "}],"department":[{"_id":"KrPi"}],"date_created":"2018-12-11T12:02:26Z","corr_author":"1","day":"04","status":"public","publisher":"Springer","author":[{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"}],"intvolume":"      7194","type":"conference","project":[{"call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography"}],"language":[{"iso":"eng"}],"publist_id":"3366","quality_controlled":"1","date_published":"2012-05-04T00:00:00Z","citation":{"mla":"Pietrzak, Krzysztof Z. <i>Subspace LWE</i>. Vol. 7194, Springer, 2012, pp. 548–63, doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">10.1007/978-3-642-28914-9_31</a>.","short":"K.Z. Pietrzak, in:, Springer, 2012, pp. 548–563.","chicago":"Pietrzak, Krzysztof Z. “Subspace LWE,” 7194:548–63. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">https://doi.org/10.1007/978-3-642-28914-9_31</a>.","apa":"Pietrzak, K. Z. (2012). Subspace LWE (Vol. 7194, pp. 548–563). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">https://doi.org/10.1007/978-3-642-28914-9_31</a>","ieee":"K. Z. Pietrzak, “Subspace LWE,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 548–563.","ama":"Pietrzak KZ. Subspace LWE. In: Vol 7194. Springer; 2012:548-563. doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">10.1007/978-3-642-28914-9_31</a>","ista":"Pietrzak KZ. 2012. Subspace LWE. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 548–563."},"date_updated":"2024-10-21T06:02:59Z","conference":{"name":"TCC: Theory of Cryptography Conference","location":"Taormina, Sicily, Italy","end_date":"2012-03-21","start_date":"2012-03-19"}},{"intvolume":"      7194","month":"05","language":[{"iso":"eng"}],"acknowledgement":"We would like to thank Oded Goldreich and Omer Rein- gold for discussions at an early stage of this project, and Scott Aaronson for clarifications regarding the collision problem.\r\n","type":"conference","alternative_title":["LNCS"],"date_published":"2012-05-04T00:00:00Z","page":"458 - 475","publication_status":"published","quality_controlled":"1","_id":"3281","publist_id":"3365","main_file_link":[{"url":"http://www.iacr.org/archive/tcc2012/tcc2012-index.html"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We consider the problem of amplifying the &quot;lossiness&quot; of functions. We say that an oracle circuit C*: {0,1} m → {0,1}* amplifies relative lossiness from ℓ/n to L/m if for every function f:{0,1} n → {0,1} n it holds that 1 If f is injective then so is C f. 2 If f has image size of at most 2 n-ℓ, then C f has image size at most 2 m-L. The question is whether such C* exists for L/m ≫ ℓ/n. This problem arises naturally in the context of cryptographic &quot;lossy functions,&quot; where the relative lossiness is the key parameter. We show that for every circuit C* that makes at most t queries to f, the relative lossiness of C f is at most L/m ≤ ℓ/n + O(log t)/n. In particular, no black-box method making a polynomial t = poly(n) number of queries can amplify relative lossiness by more than an O(logn)/n additive term. We show that this is tight by giving a simple construction (cascading with some randomization) that achieves such amplification.","lang":"eng"}],"doi":"10.1007/978-3-642-28914-9_26","citation":{"ista":"Pietrzak KZ, Rosen A, Segev G. 2012. Lossy functions do not amplify well. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 458–475.","ieee":"K. Z. Pietrzak, A. Rosen, and G. Segev, “Lossy functions do not amplify well,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 458–475.","ama":"Pietrzak KZ, Rosen A, Segev G. Lossy functions do not amplify well. In: Vol 7194. Springer; 2012:458-475. doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">10.1007/978-3-642-28914-9_26</a>","mla":"Pietrzak, Krzysztof Z., et al. <i>Lossy Functions Do Not Amplify Well</i>. Vol. 7194, Springer, 2012, pp. 458–75, doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">10.1007/978-3-642-28914-9_26</a>.","short":"K.Z. Pietrzak, A. Rosen, G. Segev, in:, Springer, 2012, pp. 458–475.","chicago":"Pietrzak, Krzysztof Z, Alon Rosen, and Gil Segev. “Lossy Functions Do Not Amplify Well,” 7194:458–75. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">https://doi.org/10.1007/978-3-642-28914-9_26</a>.","apa":"Pietrzak, K. Z., Rosen, A., &#38; Segev, G. (2012). Lossy functions do not amplify well (Vol. 7194, pp. 458–475). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">https://doi.org/10.1007/978-3-642-28914-9_26</a>"},"conference":{"start_date":"2012-03-19","end_date":"2012-03-21","location":"Taormina, Sicily, Italy","name":"TCC: Theory of Cryptography Conference"},"date_updated":"2024-10-21T06:03:00Z","scopus_import":"1","department":[{"_id":"KrPi"}],"volume":7194,"title":"Lossy functions do not amplify well","date_created":"2018-12-11T12:02:26Z","status":"public","day":"04","oa_version":"None","author":[{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alon","last_name":"Rosen","full_name":"Rosen, Alon"},{"full_name":"Segev, Gil","last_name":"Segev","first_name":"Gil"}],"publisher":"Springer","year":"2012"},{"has_accepted_license":"1","ddc":["000","004"],"year":"2012","oa":1,"oa_version":"Submitted Version","file":[{"date_updated":"2020-07-14T12:46:06Z","relation":"main_file","file_id":"5074","creator":"system","content_type":"application/pdf","access_level":"open_access","file_size":372292,"date_created":"2018-12-12T10:14:23Z","file_name":"IST-2016-686-v1+1_059.pdf","checksum":"8557c17a8c2586d06ebfe62d934f5c5f"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ec_funded":1,"volume":7237,"title":"Message authentication, revisited","abstract":[{"lang":"eng","text":"Traditionally, symmetric-key message authentication codes (MACs) are easily built from pseudorandom functions (PRFs). In this work we propose a wide variety of other approaches to building efficient MACs, without going through a PRF first. In particular, unlike deterministic PRF-based MACs, where each message has a unique valid tag, we give a number of probabilistic MAC constructions from various other primitives/assumptions. Our main results are summarized as follows: We show several new probabilistic MAC constructions from a variety of general assumptions, including CCA-secure encryption, Hash Proof Systems and key-homomorphic weak PRFs. By instantiating these frameworks under concrete number theoretic assumptions, we get several schemes which are more efficient than just using a state-of-the-art PRF instantiation under the corresponding assumption. For probabilistic MACs, unlike deterministic ones, unforgeability against a chosen message attack (uf-cma ) alone does not imply security if the adversary can additionally make verification queries (uf-cmva ). We give an efficient generic transformation from any uf-cma secure MAC which is &quot;message-hiding&quot; into a uf-cmva secure MAC. This resolves the main open problem of Kiltz et al. from Eurocrypt'11; By using our transformation on their constructions, we get the first efficient MACs from the LPN assumption. While all our new MAC constructions immediately give efficient actively secure, two-round symmetric-key identification schemes, we also show a very simple, three-round actively secure identification protocol from any weak PRF. In particular, the resulting protocol is much more efficient than the trivial approach of building a regular PRF from a weak PRF. © 2012 International Association for Cryptologic Research."}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","doi":"10.1007/978-3-642-29011-4_22","_id":"3282","license":"https://creativecommons.org/licenses/by/4.0/","publication_status":"published","page":"355 - 374","acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)","alternative_title":["LNCS"],"month":"03","author":[{"last_name":"Dodis","first_name":"Yevgeniy","full_name":"Dodis, Yevgeniy"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"},{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"},{"full_name":"Wichs, Daniel","first_name":"Daniel","last_name":"Wichs"}],"publisher":"Springer","status":"public","day":"10","date_created":"2018-12-11T12:02:27Z","department":[{"_id":"KrPi"}],"pubrep_id":"686","date_updated":"2024-10-21T06:02:59Z","conference":{"end_date":"2012-04-19","start_date":"2012-04-15","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","location":"Cambridge, UK"},"citation":{"short":"Y. Dodis, K.Z. Pietrzak, E. Kiltz, D. Wichs, in:, Springer, 2012, pp. 355–374.","mla":"Dodis, Yevgeniy, et al. <i>Message Authentication, Revisited</i>. Vol. 7237, Springer, 2012, pp. 355–74, doi:<a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">10.1007/978-3-642-29011-4_22</a>.","chicago":"Dodis, Yevgeniy, Krzysztof Z Pietrzak, Eike Kiltz, and Daniel Wichs. “Message Authentication, Revisited,” 7237:355–74. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">https://doi.org/10.1007/978-3-642-29011-4_22</a>.","apa":"Dodis, Y., Pietrzak, K. Z., Kiltz, E., &#38; Wichs, D. (2012). Message authentication, revisited (Vol. 7237, pp. 355–374). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">https://doi.org/10.1007/978-3-642-29011-4_22</a>","ista":"Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. 2012. Message authentication, revisited. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 7237, 355–374.","ama":"Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. Message authentication, revisited. In: Vol 7237. Springer; 2012:355-374. doi:<a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">10.1007/978-3-642-29011-4_22</a>","ieee":"Y. Dodis, K. Z. Pietrzak, E. Kiltz, and D. Wichs, “Message authentication, revisited,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK, 2012, vol. 7237, pp. 355–374."},"date_published":"2012-03-10T00:00:00Z","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:06Z","publist_id":"3364","language":[{"iso":"eng"}],"type":"conference","project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"intvolume":"      7237"},{"abstract":[{"text":"We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a constraint language, a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimise the sum. Under the unique games conjecture, the approximability of finite-valued VCSPs is well-understood, see Raghavendra [FOCS’08]. However, there is no characterisation of finite-valued VCSPs, let alone general-valued VCSPs, that can be solved exactly in polynomial time, thus giving insights from a combinatorial optimisation perspective.\nWe consider the case of languages containing all possible unary cost functions. In the case of languages consisting of only {0, ∞}-valued cost functions (i.e. relations), such languages have been called conservative and studied by Bulatov [LICS’03] and recently by Barto [LICS’11]. Since we study valued languages, we call a language conservative if it contains all finite-valued unary cost functions. The computational complexity of conservative valued languages has been studied by Cohen et al. [AIJ’06] for languages over Boolean domains, by Deineko et al. [JACM’08] for {0,1}-valued languages (a.k.a Max-CSP), and by Takhanov [STACS’10] for {0,∞}-valued languages containing all finite- valued unary cost functions (a.k.a. Min-Cost-Hom).\nWe prove a Schaefer-like dichotomy theorem for conservative valued languages: if all cost functions in the language satisfy a certain condition (specified by a complementary combination of STP and MJN multimorphisms), then any instance can be solved in polynomial time (via a new algorithm developed in this paper), otherwise the language is NP-hard. This is the first complete complexity classification of general-valued constraint languages over non-Boolean domains. It is a common phenomenon that complexity classifications of problems over non-Boolean domains is significantly harder than the Boolean case. The polynomial-time algorithm we present for the tractable cases is a generalisation of the submodular minimisation problem and a result of Cohen et al. [TCS’08].\nOur results generalise previous results by Takhanov [STACS’10] and (a subset of results) by Cohen et al. [AIJ’06] and Deineko et al. [JACM’08]. Moreover, our results do not rely on any computer-assisted search as in Deineko et al. [JACM’08], and provide a powerful tool for proving hardness of finite-valued and general-valued languages.","lang":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1008.1555","open_access":"1"}],"conference":{"name":"SODA: Symposium on Discrete Algorithms"},"date_updated":"2021-01-12T07:42:23Z","citation":{"short":"V. Kolmogorov, S. Živný, in:, SIAM, 2012, pp. 750–759.","mla":"Kolmogorov, Vladimir, and Stanislav Živný. <i>The Complexity of Conservative Valued CSPs</i>. SIAM, 2012, pp. 750–59.","apa":"Kolmogorov, V., &#38; Živný, S. (2012). The complexity of conservative valued CSPs (pp. 750–759). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.","chicago":"Kolmogorov, Vladimir, and Stanislav Živný. “The Complexity of Conservative Valued CSPs,” 750–59. SIAM, 2012.","ama":"Kolmogorov V, Živný S. The complexity of conservative valued CSPs. In: SIAM; 2012:750-759.","ieee":"V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,” presented at the SODA: Symposium on Discrete Algorithms, 2012, pp. 750–759.","ista":"Kolmogorov V, Živný S. 2012. The complexity of conservative valued CSPs. SODA: Symposium on Discrete Algorithms, 750–759."},"date_published":"2012-01-01T00:00:00Z","_id":"3284","publist_id":"3362","quality_controlled":0,"page":"750 - 759","publication_status":"published","acknowledgement":"Vladimir Kolmogorov is supported by the Royal Academy of Eng ineering/EPSRC.","type":"conference","month":"01","year":"2012","author":[{"full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"last_name":"Živný","first_name":"Stanislav","full_name":"Živný, Stanislav"}],"oa":1,"publisher":"SIAM","status":"public","extern":1,"day":"01","date_created":"2018-12-11T12:02:27Z","title":"The complexity of conservative valued CSPs"},{"publisher":"ASM","external_id":{"isi":["000298347700017"],"pmid":["22031940"]},"author":[{"last_name":"Pereira","first_name":"Anna","full_name":"Pereira, Anna"},{"full_name":"Leite, Flávia","first_name":"Flávia","last_name":"Leite","id":"36705F98-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Brasil, Bruno","last_name":"Brasil","first_name":"Bruno"},{"first_name":"Jamaria","last_name":"Soares Martins","full_name":"Soares Martins, Jamaria"},{"last_name":"Torres","first_name":"Alice","full_name":"Torres, Alice"},{"full_name":"Pimenta, Paulo","first_name":"Paulo","last_name":"Pimenta"},{"first_name":"Thais","last_name":"Souto Padrón","full_name":"Souto Padrón, Thais"},{"first_name":"Paula","last_name":"Tranktman","full_name":"Tranktman, Paula"},{"first_name":"Paulo","last_name":"Ferreira","full_name":"Ferreira, Paulo"},{"full_name":"Kroon, Erna","last_name":"Kroon","first_name":"Erna"},{"first_name":"Cláudio","last_name":"Bonjardim","full_name":"Bonjardim, Cláudio"}],"department":[{"_id":"JoBo"}],"date_created":"2018-12-11T12:02:29Z","day":"01","article_processing_charge":"No","status":"public","publist_id":"3356","quality_controlled":"1","date_published":"2012-01-01T00:00:00Z","citation":{"mla":"Pereira, Anna, et al. “A Vaccinia Virus-Driven Interplay between the MKK4/7-JNK1/2 Pathway and Cytoskeleton Reorganization.” <i>Journal of Virology</i>, vol. 86, no. 1, ASM, 2012, pp. 172–84, doi:<a href=\"https://doi.org/10.1128/JVI.05638-11\">10.1128/JVI.05638-11</a>.","short":"A. Pereira, F. Leite, B. Brasil, J. Soares Martins, A. Torres, P. Pimenta, T. Souto Padrón, P. Tranktman, P. Ferreira, E. Kroon, C. Bonjardim, Journal of Virology 86 (2012) 172–184.","apa":"Pereira, A., Leite, F., Brasil, B., Soares Martins, J., Torres, A., Pimenta, P., … Bonjardim, C. (2012). A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. <i>Journal of Virology</i>. ASM. <a href=\"https://doi.org/10.1128/JVI.05638-11\">https://doi.org/10.1128/JVI.05638-11</a>","chicago":"Pereira, Anna, Flávia Leite, Bruno Brasil, Jamaria Soares Martins, Alice Torres, Paulo Pimenta, Thais Souto Padrón, et al. “A Vaccinia Virus-Driven Interplay between the MKK4/7-JNK1/2 Pathway and Cytoskeleton Reorganization.” <i>Journal of Virology</i>. ASM, 2012. <a href=\"https://doi.org/10.1128/JVI.05638-11\">https://doi.org/10.1128/JVI.05638-11</a>.","ieee":"A. Pereira <i>et al.</i>, “A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization,” <i>Journal of Virology</i>, vol. 86, no. 1. ASM, pp. 172–184, 2012.","ama":"Pereira A, Leite F, Brasil B, et al. A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. <i>Journal of Virology</i>. 2012;86(1):172-184. doi:<a href=\"https://doi.org/10.1128/JVI.05638-11\">10.1128/JVI.05638-11</a>","ista":"Pereira A, Leite F, Brasil B, Soares Martins J, Torres A, Pimenta P, Souto Padrón T, Tranktman P, Ferreira P, Kroon E, Bonjardim C. 2012. A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. Journal of Virology. 86(1), 172–184."},"date_updated":"2025-09-30T07:40:18Z","intvolume":"        86","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"oa":1,"oa_version":"Submitted Version","year":"2012","volume":86,"title":"A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization","publication":"Journal of Virology","publication_status":"published","page":"172 - 184","pmid":1,"_id":"3289","issue":"1","doi":"10.1128/JVI.05638-11","scopus_import":"1","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3255887/","open_access":"1"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"Viral manipulation of transduction pathways associated with key cellular functions such as survival, response to microbial infection, and cytoskeleton reorganization can provide the supportive milieu for a productive infection. Here, we demonstrate that vaccinia virus (VACV) infection leads to activation of the stress-activated protein kinase (SAPK)/extracellular signal-regulated kinase (ERK) 4/7 (MKK4/7)-c-Jun N-terminal protein kinase 1/2 (JNK1/2) pathway; further, the stimulation of this pathway requires postpenetration, prereplicative events in the viral replication cycle. Although the formation of intracellular mature virus (IMV) was not affected in MKK4/7- or JNK1/2-knockout (KO) cells, we did note an accentuated deregulation of microtubule and actin network organization in infected JNK1/2-KO cells. This was followed by deregulated viral trafficking to the periphery and enhanced enveloped particle release. Furthermore, VACV infection induced alterations in the cell contractility and morphology, and cell migration was reduced in the JNK-KO cells. In addition, phosphorylation of proteins implicated with early cell contractility and cell migration, such as microtubule-associated protein 1B and paxillin, respectively, was not detected in the VACV-infected KO cells. In sum, our findings uncover a regulatory role played by the MKK4/7-JNK1/2 pathway in cytoskeleton reorganization during VACV infection.\r\n","lang":"eng"}],"month":"01","acknowledgement":"This work was supported by grants from Fundação de Amparo a Pesquisa do Estado de Minas Gerais (FAPEMIG), the Brazilian Federal Agency for Support and Evaluation of Graduate Education (CAPES), and the National Council for Scientific and Technological Development (CNPq). A.C.T.C.P., B.S.A.F.B., F.G.G.L., and J.A.P.S.-M. were recipients of predoctoral fellowships from CNPq. C.A.B., E.G.K., T.S.-P., P.F.P.P., and P.C.P.F. are recipients of research fellowships from CNPq. \r\n\r\n\r\nWe are grateful to Angela S. Lopes, Ilda M. V. Gama, João R. dos Santos, and Andreza A. Carvalho for their secretarial/technical assistance and to Fernanda Gambogi for help with immunofluorescence microscopy. We also thank M. C. Sogayar (Department of Biochemistry, University of São Paulo, São Paulo, Brazil), who kindly provided us with the A31 cell line, and R. Davis (Howard Hughes Medical Institute, University of Massachusetts Medical School, Worcester, MA) for the WT and JNK1/2-, MKK4-, MKK7-, and MKK4/7-KO cells. VACV WR was from C. Jungwirth (Universität Würzburg, Würzburg, Germany). The recombinant VACV vF13L-GFP and the rabbit polyclonal antibodies against viral proteins, B5R, D8L, L1R, and A36R, were from B. Moss (NIAID, Bethesda, MD). The pcDNA3-Myc-JNK2-MKK7 WT plasmid was from Eugen Kerkhoff (Universität Würzburg, Würzburg, Germany). We also thank Flávio G. da Fonseca (UFMG, Belo Horizonte, MG, Brazil) and Kathleen A. Boyle (Medical College of Wisconsin, Milwaukee, WI) for critically reading the manuscript."},{"oa_version":"None","author":[{"full_name":"Shavel, Alexey","first_name":"Alexey","last_name":"Shavel"},{"last_name":"Cadavid","first_name":"Doris","full_name":"Cadavid, Doris"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"last_name":"Carrete","first_name":"Alex","full_name":"Carrete, Alex"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"article_type":"original","publisher":"ACS","year":"2012","title":"Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor","volume":134,"date_created":"2018-12-11T11:45:51Z","publication":"Journal of the American Chemical Society","status":"public","article_processing_charge":"No","extern":"1","day":"02","date_published":"2012-01-02T00:00:00Z","page":"1438 - 1441","publication_status":"published","quality_controlled":"1","_id":"330","issue":"3","publist_id":"7531","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"A procedure for the continuous production of Cu 2ZnSnS 4 (CZTS) nanoparticles with controlled composition is presented. CZTS nanoparticles were prepared through the reaction of the metals' amino complexes with elemental sulfur in a continuous-flow reactor at moderate temperatures (300-330 °C). High-resolution transmission electron microscopy and X-ray diffraction analysis showed the nanocrystals to have a crystallographic structure compatible with that of the kesterite. Chemical characterization of the materials showed the presence of the four elements in each individual nanocrystal. Composition control was achieved by adjusting the solution flow rate through the reactor and the proper choice of the nominal precursor concentration within the flowing solution. Single-particle analysis revealed a composition distribution within each sample, which was optimized at the highest synthesis temperatures used. ","lang":"eng"}],"citation":{"ieee":"A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, and A. Cabot, “Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor,” <i>Journal of the American Chemical Society</i>, vol. 134, no. 3. ACS, pp. 1438–1441, 2012.","ista":"Shavel A, Cadavid D, Ibáñez M, Carrete A, Cabot A. 2012. Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal of the American Chemical Society. 134(3), 1438–1441.","ama":"Shavel A, Cadavid D, Ibáñez M, Carrete A, Cabot A. Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. <i>Journal of the American Chemical Society</i>. 2012;134(3):1438-1441. doi:<a href=\"https://doi.org/10.1021/ja209688a\">10.1021/ja209688a</a>","chicago":"Shavel, Alexey, Doris Cadavid, Maria Ibáñez, Alex Carrete, and Andreu Cabot. “Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf Nanocrystals in a Flow Reactor.” <i>Journal of the American Chemical Society</i>. ACS, 2012. <a href=\"https://doi.org/10.1021/ja209688a\">https://doi.org/10.1021/ja209688a</a>.","apa":"Shavel, A., Cadavid, D., Ibáñez, M., Carrete, A., &#38; Cabot, A. (2012). Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. <i>Journal of the American Chemical Society</i>. ACS. <a href=\"https://doi.org/10.1021/ja209688a\">https://doi.org/10.1021/ja209688a</a>","short":"A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, A. Cabot, Journal of the American Chemical Society 134 (2012) 1438–1441.","mla":"Shavel, Alexey, et al. “Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf Nanocrystals in a Flow Reactor.” <i>Journal of the American Chemical Society</i>, vol. 134, no. 3, ACS, 2012, pp. 1438–41, doi:<a href=\"https://doi.org/10.1021/ja209688a\">10.1021/ja209688a</a>."},"doi":"10.1021/ja209688a","date_updated":"2021-01-12T07:42:29Z","intvolume":"       134","month":"01","language":[{"iso":"eng"}],"type":"journal_article"},{"citation":{"chicago":"Bendich, Paul, Sergio Cabello, and Herbert Edelsbrunner. “A Point Calculus for Interlevel Set Homology.” <i>Pattern Recognition Letters</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">https://doi.org/10.1016/j.patrec.2011.10.007</a>.","apa":"Bendich, P., Cabello, S., &#38; Edelsbrunner, H. (2012). A point calculus for interlevel set homology. <i>Pattern Recognition Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">https://doi.org/10.1016/j.patrec.2011.10.007</a>","mla":"Bendich, Paul, et al. “A Point Calculus for Interlevel Set Homology.” <i>Pattern Recognition Letters</i>, vol. 33, no. 11, Elsevier, 2012, pp. 1436–44, doi:<a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">10.1016/j.patrec.2011.10.007</a>.","short":"P. Bendich, S. Cabello, H. Edelsbrunner, Pattern Recognition Letters 33 (2012) 1436–1444.","ista":"Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444.","ieee":"P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel set homology,” <i>Pattern Recognition Letters</i>, vol. 33, no. 11. Elsevier, pp. 1436–1444, 2012.","ama":"Bendich P, Cabello S, Edelsbrunner H. A point calculus for interlevel set homology. <i>Pattern Recognition Letters</i>. 2012;33(11):1436-1444. doi:<a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">10.1016/j.patrec.2011.10.007</a>"},"date_updated":"2025-09-30T07:39:47Z","pubrep_id":"542","publist_id":"3330","file_date_updated":"2020-07-14T12:46:06Z","quality_controlled":"1","date_published":"2012-08-01T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"        33","publisher":"Elsevier","external_id":{"isi":["000307204300002"]},"author":[{"full_name":"Bendich, Paul","first_name":"Paul","last_name":"Bendich","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cabello, Sergio","first_name":"Sergio","last_name":"Cabello"},{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"}],"day":"01","status":"public","article_processing_charge":"No","department":[{"_id":"HeEd"}],"date_created":"2018-12-11T12:02:36Z","doi":"10.1016/j.patrec.2011.10.007","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"The theory of persistent homology opens up the possibility to reason about topological features of a space or a function quantitatively and in combinatorial terms. We refer to this new angle at a classical subject within algebraic topology as a point calculus, which we present for the family of interlevel sets of a real-valued function. Our account of the subject is expository, devoid of proofs, and written for non-experts in algebraic topology."}],"publication_status":"published","page":"1436 - 1444","issue":"11","_id":"3310","acknowledgement":"Research by the third author is partially supported by the National Science Foundation (NSF) under grant DBI-0820624.","month":"08","ddc":["000"],"year":"2012","has_accepted_license":"1","isi":1,"file":[{"relation":"main_file","date_updated":"2020-07-14T12:46:06Z","content_type":"application/pdf","creator":"system","file_id":"5116","file_size":280280,"access_level":"open_access","file_name":"IST-2016-542-v1+1_2012-J-01-Poinculus.pdf","checksum":"d65f79775b51258a604ca5ec741297cc","date_created":"2018-12-12T10:15:00Z"}],"oa_version":"Submitted Version","oa":1,"publication":"Pattern Recognition Letters","title":"A point calculus for interlevel set homology","volume":33},{"department":[{"_id":"KrCh"}],"date_created":"2018-12-11T12:02:37Z","day":"01","article_processing_charge":"No","status":"public","publisher":"World Scientific Publishing","external_id":{"isi":["000304003000004"]},"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"}],"intvolume":"        23","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"type":"journal_article","language":[{"iso":"eng"}],"publist_id":"3326","quality_controlled":"1","date_published":"2012-04-01T00:00:00Z","citation":{"mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” <i>International Journal of Foundations of Computer Science</i>, vol. 23, no. 3, World Scientific Publishing, 2012, pp. 609–25, doi:<a href=\"https://doi.org/10.1142/S0129054112400308\">10.1142/S0129054112400308</a>.","short":"K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer Science 23 (2012) 609–625.","chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing, 2012. <a href=\"https://doi.org/10.1142/S0129054112400308\">https://doi.org/10.1142/S0129054112400308</a>.","apa":"Chatterjee, K., &#38; Majumdar, R. (2012). Discounting and averaging in games across time scales. <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129054112400308\">https://doi.org/10.1142/S0129054112400308</a>","ama":"Chatterjee K, Majumdar R. Discounting and averaging in games across time scales. <i>International Journal of Foundations of Computer Science</i>. 2012;23(3):609-625. doi:<a href=\"https://doi.org/10.1142/S0129054112400308\">10.1142/S0129054112400308</a>","ieee":"K. Chatterjee and R. Majumdar, “Discounting and averaging in games across time scales,” <i>International Journal of Foundations of Computer Science</i>, vol. 23, no. 3. World Scientific Publishing, pp. 609–625, 2012.","ista":"Chatterjee K, Majumdar R. 2012. Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. 23(3), 609–625."},"date_updated":"2025-09-30T07:38:00Z","volume":23,"title":"Discounting and averaging in games across time scales","publication":"International Journal of Foundations of Computer Science","isi":1,"oa_version":"None","year":"2012","month":"04","acknowledgement":"This research was funded in part by the US National Science Foundation grants CCF-0546170, CNS-0702881, DARPA grant HR0011-09-1-0037, Austrian Science Fund (FWF) NFN Grant S11407-N23 (RiSE) and a Microsoft faculty fellowship.","publication_status":"published","page":"609 - 625","issue":"3","_id":"3314","doi":"10.1142/S0129054112400308","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"We introduce two-level discounted and mean-payoff games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted or mean-payoff game and the lower level game is a (undiscounted) reachability game. Two-level games model hierarchical and sequential decision making under uncertainty across different time scales. For both discounted and mean-payoff two-level games, we show the existence of pure memoryless optimal strategies for both players and an ordered field property. We show that if there is only one player (Markov decision processes), then the values can be computed in polynomial time. It follows that whether the value of a player is equal to a given rational constant in two-level discounted or mean-payoff games can be decided in NP ∩ coNP. We also give an alternate strategy improvement algorithm to compute the value. © 2012 World Scientific Publishing Company.","lang":"eng"}]},{"author":[{"id":"34DACA34-E9AE-11E9-849C-D35BD8ADC20C","last_name":"Eggermann","first_name":"Emmanuel","full_name":"Eggermann, Emmanuel"},{"full_name":"Bucurenciu, Iancu","first_name":"Iancu","last_name":"Bucurenciu","id":"4BD1D872-E9AE-11E9-9EE9-8BF4597A9E2A"},{"last_name":"Goswami","id":"3A578F32-F248-11E8-B48F-1D18A9856A87","first_name":"Sarit","full_name":"Goswami, Sarit"},{"last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M"}],"external_id":{"isi":["000298323200008"]},"publisher":"Nature Publishing Group","article_processing_charge":"No","status":"public","day":"01","corr_author":"1","date_created":"2018-12-11T12:02:38Z","department":[{"_id":"PeJo"}],"pubrep_id":"820","date_updated":"2025-09-30T07:34:43Z","citation":{"ama":"Eggermann E, Bucurenciu I, Goswami S, Jonas PM. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. <i>Nature Reviews Neuroscience</i>. 2012;13(1):7-21. doi:<a href=\"https://doi.org/10.1038/nrn3125\">10.1038/nrn3125</a>","ieee":"E. Eggermann, I. Bucurenciu, S. Goswami, and P. M. Jonas, “Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses,” <i>Nature Reviews Neuroscience</i>, vol. 13, no. 1. Nature Publishing Group, pp. 7–21, 2012.","ista":"Eggermann E, Bucurenciu I, Goswami S, Jonas PM. 2012. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature Reviews Neuroscience. 13(1), 7–21.","short":"E. Eggermann, I. Bucurenciu, S. Goswami, P.M. Jonas, Nature Reviews Neuroscience 13 (2012) 7–21.","mla":"Eggermann, Emmanuel, et al. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” <i>Nature Reviews Neuroscience</i>, vol. 13, no. 1, Nature Publishing Group, 2012, pp. 7–21, doi:<a href=\"https://doi.org/10.1038/nrn3125\">10.1038/nrn3125</a>.","apa":"Eggermann, E., Bucurenciu, I., Goswami, S., &#38; Jonas, P. M. (2012). Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. <i>Nature Reviews Neuroscience</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nrn3125\">https://doi.org/10.1038/nrn3125</a>","chicago":"Eggermann, Emmanuel, Iancu Bucurenciu, Sarit Goswami, and Peter M Jonas. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” <i>Nature Reviews Neuroscience</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nrn3125\">https://doi.org/10.1038/nrn3125</a>."},"date_published":"2012-01-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:07Z","quality_controlled":"1","publist_id":"3322","language":[{"iso":"eng"}],"type":"journal_article","project":[{"name":"Synaptic Mechanisms of Neuronal Network Function","_id":"25BC64A8-B435-11E9-9278-68D0E5697425","grant_number":"JO_780/A5"},{"name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}],"intvolume":"        13","has_accepted_license":"1","ddc":["570"],"year":"2012","oa_version":"Submitted Version","oa":1,"file":[{"date_updated":"2020-07-14T12:46:07Z","relation":"main_file","file_id":"4931","content_type":"application/pdf","creator":"system","access_level":"open_access","file_size":314246,"date_created":"2018-12-12T10:12:13Z","file_name":"IST-2017-820-v1+1_17463_3_art_file_109404_ltmxbw.pdf","checksum":"4c1c86b2f6e4e1562f5bb800b457ea9f"},{"checksum":"bceb2efdd49d115f4dde8486bc1be3f2","file_name":"IST-2017-820-v1+2_17463_3_figure_109402_ltmwlp.pdf","date_created":"2018-12-12T10:12:14Z","file_size":1840216,"access_level":"open_access","creator":"system","content_type":"application/pdf","file_id":"4932","relation":"main_file","date_updated":"2020-07-14T12:46:07Z"}],"isi":1,"publication":"Nature Reviews Neuroscience","title":"Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses","volume":13,"abstract":[{"text":"The physical distance between presynaptic Ca2+ channels and the Ca2+ sensors that trigger exocytosis of neurotransmitter-containing vesicles is a key determinant of the signalling properties of synapses in the nervous system. Recent functional analysis indicates that in some fast central synapses, transmitter release is triggered by a small number of Ca2+ channels that are coupled to Ca2+ sensors at the nanometre scale. Molecular analysis suggests that this tight coupling is generated by protein–protein interactions involving Ca2+ channels, Ca2+ sensors and various other synaptic proteins. Nanodomain coupling has several functional advantages, as it increases the efficacy, speed and energy efficiency of synaptic transmission.","lang":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","doi":"10.1038/nrn3125","_id":"3317","issue":"1","page":"7 - 21","publication_status":"published","acknowledgement":"Work of the authors was funded by grants of the Deutsche Forschungsgemeinschaft to P.J. (grants SFB 780/A5, TR 3/B10 and the Leibniz programme), a European Research Council Advanced grant to P.J. and a Swiss National Foundation fellowship to E.E.\r\nWe thank D. Tsien and E. Neher for their comments on this Review, J. Guzmán and A. Pernía-Andrade for reading earlier versions and E. Kramberger for perfect editorial support. We apologize that owing to space constraints, not all relevant papers could be cited.\r\n","month":"01"},{"alternative_title":["LNCS"],"month":"03","doi":"10.1007/978-3-642-28729-9_18","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2009"}],"abstract":[{"text":"We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine a probability distribution over the successor states. We also consider the important special case of turn-based stochastic games where players make moves in turns, rather than concurrently. We study concurrent games with \\omega-regular winning conditions specified as parity objectives. The value for player 1 for a parity objective is the maximal probability with which the player can guarantee the satisfaction of the objective against all strategies of the opponent. We study the problem of continuity and robustness of the value function in concurrent and turn-based stochastic parity gameswith respect to imprecision in the transition probabilities. We present quantitative bounds on the difference of the value function (in terms of the imprecision of the transition probabilities) and show the value continuity for structurally equivalent concurrent games (two games are structurally equivalent if the support of the transition function is same and the probabilities differ). We also show robustness of optimal strategies for structurally equivalent turn-based stochastic parity games. Finally we show that the value continuity property breaks without the structurally equivalent assumption (even for Markov chains) and show that our quantitative bound is asymptotically optimal. Hence our results are tight (the assumption is both necessary and sufficient) and optimal (our quantitative bound is asymptotically optimal).","lang":"eng"}],"arxiv":1,"publication_status":"published","page":"270 - 285","_id":"3341","title":"Robustness of structurally equivalent concurrent parity games","volume":7213,"ec_funded":1,"year":"2012","oa_version":"Preprint","oa":1,"project":[{"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"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"type":"conference","language":[{"iso":"eng"}],"intvolume":"      7213","citation":{"short":"K. Chatterjee, in:, Springer, 2012, pp. 270–285.","mla":"Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. Vol. 7213, Springer, 2012, pp. 270–85, doi:<a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">10.1007/978-3-642-28729-9_18</a>.","chicago":"Chatterjee, Krishnendu. “Robustness of Structurally Equivalent Concurrent Parity Games,” 7213:270–85. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">https://doi.org/10.1007/978-3-642-28729-9_18</a>.","apa":"Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">https://doi.org/10.1007/978-3-642-28729-9_18</a>","ista":"Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.","ieee":"K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.","ama":"Chatterjee K. Robustness of structurally equivalent concurrent parity games. In: Vol 7213. Springer; 2012:270-285. doi:<a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">10.1007/978-3-642-28729-9_18</a>"},"conference":{"name":"FoSSaCS: Foundations of Software Science and Computation Structures","location":"Tallinn, Estonia","end_date":"2012-04-01","start_date":"2012-03-24"},"date_updated":"2024-10-09T20:54:38Z","publist_id":"3284","quality_controlled":"1","date_published":"2012-03-22T00:00:00Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5382"}]},"day":"22","status":"public","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T12:02:46Z","corr_author":"1","publisher":"Springer","external_id":{"arxiv":["1107.2009"]},"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"}]}]