[{"month":"05","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1205.6352"}],"oa_version":"Preprint","_id":"2928","date_created":"2018-12-11T12:00:23Z","language":[{"iso":"eng"}],"department":[{"_id":"VlKo"}],"author":[{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"},{"full_name":"Schoenemann, Thomas","last_name":"Schoenemann","first_name":"Thomas"}],"citation":{"apa":"Kolmogorov, V., &#38; Schoenemann, T. (n.d.). Generalized sequential tree-reweighted message passing. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1205.6352\">https://doi.org/10.48550/arXiv.1205.6352</a>","ama":"Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message passing. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1205.6352\">10.48550/arXiv.1205.6352</a>","ieee":"V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted message passing,” <i>arXiv</i>. .","ista":"Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message passing. arXiv, 1205.6352.","chicago":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1205.6352\">https://doi.org/10.48550/arXiv.1205.6352</a>.","mla":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” <i>ArXiv</i>, 1205.6352, doi:<a href=\"https://doi.org/10.48550/arXiv.1205.6352\">10.48550/arXiv.1205.6352</a>.","short":"V. Kolmogorov, T. Schoenemann, ArXiv (n.d.)."},"year":"2012","title":"Generalized sequential tree-reweighted message passing","publist_id":"3809","abstract":[{"lang":"eng","text":"     This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs of factors for which the marginalization constraint needs to be enforced. We develop a generalization of the TRW-S algorithm [9] for this problem, where we use a decomposition into junction chains, monotonic w.r.t. some ordering on the nodes. This generalizes the monotonic chains in [9] in a natural way. We also show how to deal with nested factors in an efficient way. Experiments show an improvement over min-sum diffusion, MPLP and subgradient ascent algorithms on a number of computer vision and natural language processing problems. "}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"29","arxiv":1,"type":"preprint","corr_author":"1","publication_status":"submitted","publication":"arXiv","external_id":{"arxiv":["1205.6352"]},"date_published":"2012-05-29T00:00:00Z","article_processing_charge":"No","status":"public","doi":"10.48550/arXiv.1205.6352","date_updated":"2025-07-08T07:19:42Z","article_number":"1205.6352","oa":1},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.7213"}],"month":"01","_id":"2929","citation":{"ama":"Kolmogorov V. <i>The Power of Linear Programming for Valued CSPs: A Constructive Characterization</i>. Unknown; 2012.","apa":"Kolmogorov, V. (2012). <i>The power of linear programming for valued CSPs: a constructive characterization</i>. Unknown.","mla":"Kolmogorov, Vladimir. <i>The Power of Linear Programming for Valued CSPs: A Constructive Characterization</i>. Unknown, 2012.","short":"V. Kolmogorov, The Power of Linear Programming for Valued CSPs: A Constructive Characterization, Unknown, 2012.","chicago":"Kolmogorov, Vladimir. <i>The Power of Linear Programming for Valued CSPs: A Constructive Characterization</i>. Unknown, 2012.","ieee":"V. Kolmogorov, <i>The power of linear programming for valued CSPs: a constructive characterization</i>. Unknown, 2012.","ista":"Kolmogorov V. 2012. The power of linear programming for valued CSPs: a constructive characterization, Unknown,p."},"author":[{"full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T12:00:24Z","year":"2012","extern":1,"title":"The power of linear programming for valued CSPs: a constructive characterization","publist_id":"3807","quality_controlled":0,"day":"01","type":"report","publication_status":"published","date_published":"2012-01-01T00:00:00Z","status":"public","oa":1,"publisher":"Unknown","date_updated":"2019-04-26T07:22:21Z"},{"alternative_title":["LNCS"],"year":"2012","author":[{"full_name":"Huber, Anna","last_name":"Huber","first_name":"Anna"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"date_created":"2018-12-11T12:00:24Z","language":[{"iso":"eng"}],"department":[{"_id":"VlKo"}],"page":"451 - 462","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.5469"}],"month":"04","volume":7422,"doi":"10.1007/978-3-642-32147-4_40","oa":1,"date_updated":"2025-06-11T08:08:15Z","article_processing_charge":"No","date_published":"2012-04-01T00:00:00Z","type":"conference","scopus_import":"1","arxiv":1,"intvolume":"      7422","abstract":[{"lang":"eng","text":"In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively.\r\n\r\nIn particular we generalize the known Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts that the minimum of the (bi)submodular function can be found by solving a maximization problem over a (bi)submodular polyhedron. We define a k-submodular polyhedron, prove a Min-Max-Theorem for k-submodular functions, and give a greedy algorithm to construct the vertices of the polyhedron.\r\n"}],"quality_controlled":"1","conference":{"end_date":"2012-04-21","name":"ISCO: International Symposium on Combinatorial Optimization","start_date":"2012-04-19","location":"Athens, Greece"},"title":"Towards minimizing k-submodular functions","citation":{"ama":"Huber A, Kolmogorov V. Towards minimizing k-submodular functions. In: Vol 7422. Springer; 2012:451-462. doi:<a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">10.1007/978-3-642-32147-4_40</a>","apa":"Huber, A., &#38; Kolmogorov, V. (2012). Towards minimizing k-submodular functions (Vol. 7422, pp. 451–462). Presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">https://doi.org/10.1007/978-3-642-32147-4_40</a>","short":"A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.","mla":"Huber, Anna, and Vladimir Kolmogorov. <i>Towards Minimizing K-Submodular Functions</i>. Vol. 7422, Springer, 2012, pp. 451–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">10.1007/978-3-642-32147-4_40</a>.","ista":"Huber A, Kolmogorov V. 2012. Towards minimizing k-submodular functions. ISCO: International Symposium on Combinatorial Optimization, LNCS, vol. 7422, 451–462.","ieee":"A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,” presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece, 2012, vol. 7422, pp. 451–462.","chicago":"Huber, Anna, and Vladimir Kolmogorov. “Towards Minimizing K-Submodular Functions,” 7422:451–62. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">https://doi.org/10.1007/978-3-642-32147-4_40</a>."},"_id":"2930","oa_version":"Preprint","status":"public","publisher":"Springer","external_id":{"arxiv":["1309.5469"]},"publication_status":"published","publist_id":"3806","acknowledgement":"We would like to thank Andrei Krokhin for encourag- ing our cooperation, for helpful discussions, and for his critical reading of the manuscript.\r\n","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01"},{"abstract":[{"text":"In this paper, we present a new approach for establishing correspondences between sparse image features related by an unknown nonrigid mapping and corrupted by clutter and occlusion, such as points extracted from images of different instances of the same object category. We formulate this matching task as an energy minimization problem by defining an elaborate objective function of the appearance and the spatial arrangement of the features. Optimization of this energy is an instance of graph matching, which is in general an NP-hard problem. We describe a novel graph matching optimization technique, which we refer to as dual decomposition (DD), and demonstrate on a variety of examples that this method outperforms existing graph matching algorithms. In the majority of our examples, DD is able to find the global minimum within a minute. The ability to globally optimize the objective allows us to accurately learn the parameters of our matching model from training examples. We show on several matching tasks that our learned model yields results superior to those of state-of-the-art methods.\r\n","lang":"eng"}],"quality_controlled":"1","type":"journal_article","scopus_import":"1","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","intvolume":"        35","article_processing_charge":"No","date_published":"2012-05-08T00:00:00Z","doi":"10.1109/TPAMI.2012.105","volume":35,"date_updated":"2025-09-30T08:15:06Z","month":"05","issue":"2","author":[{"first_name":"Lorenzo","full_name":"Torresani, Lorenzo","last_name":"Torresani"},{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:00:24Z","department":[{"_id":"VlKo"}],"page":"259 - 271","year":"2012","publist_id":"3805","acknowledgement":"This research was funded in part by Microsoft Research.","day":"08","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","external_id":{"isi":["000312560600002"]},"isi":1,"status":"public","publisher":"IEEE","project":[{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa_version":"None","_id":"2931","citation":{"ama":"Torresani L, Kolmogorov V, Rother C. A dual decomposition approach to feature correspondence. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2012;35(2):259-271. doi:<a href=\"https://doi.org/10.1109/TPAMI.2012.105\">10.1109/TPAMI.2012.105</a>","apa":"Torresani, L., Kolmogorov, V., &#38; Rother, C. (2012). A dual decomposition approach to feature correspondence. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2012.105\">https://doi.org/10.1109/TPAMI.2012.105</a>","mla":"Torresani, Lorenzo, et al. “A Dual Decomposition Approach to Feature Correspondence.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 35, no. 2, IEEE, 2012, pp. 259–71, doi:<a href=\"https://doi.org/10.1109/TPAMI.2012.105\">10.1109/TPAMI.2012.105</a>.","short":"L. Torresani, V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 35 (2012) 259–271.","chicago":"Torresani, Lorenzo, Vladimir Kolmogorov, and Carsten Rother. “A Dual Decomposition Approach to Feature Correspondence.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/TPAMI.2012.105\">https://doi.org/10.1109/TPAMI.2012.105</a>.","ieee":"L. Torresani, V. Kolmogorov, and C. Rother, “A dual decomposition approach to feature correspondence,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 35, no. 2. IEEE, pp. 259–271, 2012.","ista":"Torresani L, Kolmogorov V, Rother C. 2012. A dual decomposition approach to feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence. 35(2), 259–271."},"title":"A dual decomposition approach to feature correspondence"},{"_id":"2936","oa_version":"Preprint","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"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"}],"citation":{"apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2012). Finite automata with time delay blocks. In <i>roceedings of the tenth ACM international conference on Embedded software</i> (pp. 43–52). Tampere, Finland: ACM. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>","ama":"Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks. In: <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>. ACM; 2012:43-52. doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>, 43–52. ACM, 2012. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in <i>roceedings of the tenth ACM international conference on Embedded software</i>, Tampere, Finland, 2012, pp. 43–52.","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.","mla":"Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>, ACM, 2012, pp. 43–52, doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52."},"title":"Finite automata with time delay blocks","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","acknowledgement":"This work has been financially supported in part by the European Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract # 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008 (Modeling and control of Networked vehicle systems in persistent autonomous operations); by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant QUAREM; and FWF Grant No S11403-N23 (RiSE).","publist_id":"3799","publication_status":"published","external_id":{"arxiv":["1207.7019"]},"publisher":"ACM","status":"public","month":"10","main_file_link":[{"url":"http://arxiv.org/abs/1207.7019","open_access":"1"}],"page":"43 - 52","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:00:26Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Prabhu, Vinayak","last_name":"Prabhu","first_name":"Vinayak"}],"year":"2012","conference":{"name":"EMSOFT: Embedded Software ","end_date":"2012-10-12","location":"Tampere, Finland","start_date":"2012-10-07"},"quality_controlled":"1","abstract":[{"text":"The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsume the regular languages, and are incomparable in expressive power to the context-free languages. We show that ADBs are closed under union, concatenation and Kleene star, and under intersection with regular languages, but not closed under complementation and intersection with other ADB languages. We show that the emptiness and the membership problems are decidable in polynomial time for ADBs, whereas the universality problem is undecidable. Finally we consider the linear-time model checking problem, i.e., whether the language of an ADB is contained in a regular language, and show that the model checking problem is PSPACE-complete. Copyright 2012 ACM.","lang":"eng"}],"ec_funded":1,"publication":"roceedings of the tenth ACM international conference on Embedded software","arxiv":1,"type":"conference","scopus_import":"1","date_published":"2012-10-01T00:00:00Z","article_processing_charge":"No","date_updated":"2025-06-11T08:08:30Z","oa":1,"doi":"10.1145/2380356.2380370"},{"year":"2012","title":"Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2012/258"}],"month":"10","oa_version":"Submitted Version","_id":"2937","author":[{"first_name":"José","full_name":"Almeida, José","last_name":"Almeida"},{"full_name":"Barbosa, Manuel","last_name":"Barbosa","first_name":"Manuel"},{"full_name":"Bangerter, Endre","last_name":"Bangerter","first_name":"Endre"},{"full_name":"Barthe, Gilles","last_name":"Barthe","first_name":"Gilles"},{"last_name":"Krenn","orcid":"0000-0003-2835-9093","full_name":"Krenn, Stephan","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan"},{"first_name":"Santiago","full_name":"Béguelin, Santiago","last_name":"Béguelin"}],"citation":{"ama":"Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. In: <i>Proceedings of the 2012 ACM Conference on Computer and Communications Security</i>. ACM; 2012:488-500. doi:<a href=\"https://doi.org/10.1145/2382196.2382249\">10.1145/2382196.2382249</a>","apa":"Almeida, J., Barbosa, M., Bangerter, E., Barthe, G., Krenn, S., &#38; Béguelin, S. (2012). Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. In <i>Proceedings of the 2012 ACM conference on Computer and communications security</i> (pp. 488–500). Raleigh, NC, USA: ACM. <a href=\"https://doi.org/10.1145/2382196.2382249\">https://doi.org/10.1145/2382196.2382249</a>","short":"J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, S. Béguelin, in:, Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500.","mla":"Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” <i>Proceedings of the 2012 ACM Conference on Computer and Communications Security</i>, ACM, 2012, pp. 488–500, doi:<a href=\"https://doi.org/10.1145/2382196.2382249\">10.1145/2382196.2382249</a>.","ista":"Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. 2012. Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. Proceedings of the 2012 ACM conference on Computer and communications security. CCS: Conference on Computer and Communications Security, 488–500.","ieee":"J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, and S. Béguelin, “Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols,” in <i>Proceedings of the 2012 ACM conference on Computer and communications security</i>, Raleigh, NC, USA, 2012, pp. 488–500.","chicago":"Almeida, José, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephan Krenn, and Santiago Béguelin. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” In <i>Proceedings of the 2012 ACM Conference on Computer and Communications Security</i>, 488–500. ACM, 2012. <a href=\"https://doi.org/10.1145/2382196.2382249\">https://doi.org/10.1145/2382196.2382249</a>."},"date_created":"2018-12-11T12:00:26Z","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"page":"488 - 500","article_processing_charge":"No","date_published":"2012-10-01T00:00:00Z","doi":"10.1145/2382196.2382249","status":"public","publisher":"ACM","oa":1,"date_updated":"2025-07-10T11:52:23Z","publist_id":"3798","abstract":[{"lang":"eng","text":"Developers building cryptography into security-sensitive applications face a daunting task. Not only must they understand the security guarantees delivered by the constructions they choose, they must also implement and combine them correctly and efficiently. Cryptographic compilers free developers from this task by turning high-level specifications of security goals into efficient implementations. Yet, trusting such tools is hard as they rely on complex mathematical machinery and claim security properties that are subtle and difficult to verify. In this paper we present ZKCrypt, an optimizing cryptographic compiler achieving an unprecedented level of assurance without sacrificing practicality for a comprehensive class of cryptographic protocols, known as Zero-Knowledge Proofs of Knowledge. The pipeline of ZKCrypt integrates purpose-built verified compilers and verifying compilers producing formal proofs in the CertiCrypt framework. By combining the guarantees delivered by each stage, ZKCrypt provides assurance that the output implementation securely realizes the abstract proof goal given as input. We report on the main characteristics of ZKCrypt, highlight new definitions and concepts at its foundations, and illustrate its applicability through a representative example of an anonymous credential system."}],"quality_controlled":"1","acknowledgement":"This work was partially funded by National Funds through the FCT - Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) within project ENI-AC/2224/2009, by ENIAC Joint Undertaking under grant agreement number 120224, European Projects FP7-256980 NESSoS and FP7-229599 AMAROUT, Spanish National project TIN2009-14599 DESAFIOS 10, and Madrid Regional project S2009TIC-1465 PROMETIDOS.","day":"01","conference":{"start_date":"2012-10-16","location":"Raleigh, NC, USA","end_date":"2012-10-18","name":"CCS: Conference on Computer and Communications Security"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","scopus_import":"1","publication_status":"published","publication":"Proceedings of the 2012 ACM conference on Computer and communications security"},{"page":"1300 - 1312","language":[{"iso":"eng"}],"department":[{"_id":"SyCr"}],"date_created":"2018-12-11T12:00:27Z","author":[{"full_name":"Ugelvig, Line V","last_name":"Ugelvig","orcid":"0000-0003-1832-8883","first_name":"Line V","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","last_name":"Cremer","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"issue":"6","month":"01","year":"2012","corr_author":"1","intvolume":"        26","publication":"Functional Ecology","scopus_import":"1","type":"journal_article","quality_controlled":"1","abstract":[{"text":"Social insects have a very high potential to become invasive pest species. Here, we explore how their social lifestyle and their interaction with parasites may contribute to this invasive success. Similar to solitary species, parasite release followed by the evolution of increased competitive ability can promote establishment of introduced social insect hosts in their introduced range. Genetic bottlenecks during introduction of low numbers of founder individuals decrease the genetic diversity at three levels: the population, the colony and the individual, with the colony level being specific to social insects. Reduced genetic diversity can affect both the individual immune system and the collective colony-level disease defences (social immunity). Still, the dual immune system is likely to make social insects more robust to parasite attack. Changes in social structure from small, family-based, territorially aggressive societies in native populations towards huge networks of cooperating nests (unicoloniality) occur in some invasive social insects, for example, most invasive ants and some termites. Unicoloniality is likely to affect disease dynamics in multiple ways. The free exchange of individuals within the population leads to an increased genetic heterogeneity among individuals of a single nest, thereby decreasing disease transmission. However, the multitude of reproductively active queens per colony buffers the effect of individual diseased queens and their offspring, which may result in a higher level of vertical disease transmission in unicolonial societies. Lastly, unicoloniality provides a competitive advantage over native species, allowing them to quickly become the dominant species in the habitat, which in turn selects for parasite adaptation to this common host genotype and thus eventually a high parasite pressure. Overall, invasions by insect societies are characterized by general features applying to all introduced species, as well as idiosyncrasies that emerge from their social lifestyle. It is important to study these effects in concert to be able to develop efficient management and biocontrol strategies. © 2012 British Ecological Society.","lang":"eng"}],"date_updated":"2025-09-30T08:14:20Z","volume":26,"doi":"10.1111/1365-2435.12013","date_published":"2012-01-01T00:00:00Z","article_processing_charge":"No","citation":{"ieee":"L. V. Ugelvig and S. Cremer, “Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies,” <i>Functional Ecology</i>, vol. 26, no. 6. Wiley-Blackwell, pp. 1300–1312, 2012.","chicago":"Ugelvig, Line V, and Sylvia Cremer. “Effects of Social Immunity and Unicoloniality on Host Parasite Interactions in Invasive Insect Societies.” <i>Functional Ecology</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/1365-2435.12013\">https://doi.org/10.1111/1365-2435.12013</a>.","ista":"Ugelvig LV, Cremer S. 2012. Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. Functional Ecology. 26(6), 1300–1312.","short":"L.V. Ugelvig, S. Cremer, Functional Ecology 26 (2012) 1300–1312.","mla":"Ugelvig, Line V., and Sylvia Cremer. “Effects of Social Immunity and Unicoloniality on Host Parasite Interactions in Invasive Insect Societies.” <i>Functional Ecology</i>, vol. 26, no. 6, Wiley-Blackwell, 2012, pp. 1300–12, doi:<a href=\"https://doi.org/10.1111/1365-2435.12013\">10.1111/1365-2435.12013</a>.","apa":"Ugelvig, L. V., &#38; Cremer, S. (2012). Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. <i>Functional Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/1365-2435.12013\">https://doi.org/10.1111/1365-2435.12013</a>","ama":"Ugelvig LV, Cremer S. Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. <i>Functional Ecology</i>. 2012;26(6):1300-1312. doi:<a href=\"https://doi.org/10.1111/1365-2435.12013\">10.1111/1365-2435.12013</a>"},"oa_version":"None","_id":"2938","title":"Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","acknowledgement":"We thank Mark Brown, Christopher Pull, Meghan L. Vyleta, Miriam Stock, Barbara Casillas-Perez and three anonymous reviewers for valuable comments on the manuscript and Eva Sixt for ant drawings. Funding was obtained from the German Science Foundation (DFG, by an Individual Research Grant to S.C.) and the European Research Council (ERC, by an ERC-Starting Grant to SC and an Individual Marie Curie EIF fellowship to L.desU.). The authors declare no conflict of interests.","publist_id":"3797","publisher":"Wiley-Blackwell","status":"public","isi":1,"external_id":{"isi":["000311433600008"]}},{"quality_controlled":"1","ddc":["510"],"publication":"Russian Mathematical Surveys","intvolume":"        67","type":"journal_article","scopus_import":"1","article_processing_charge":"No","date_published":"2012-11-01T00:00:00Z","oa":1,"date_updated":"2025-09-30T08:13:48Z","volume":67,"doi":"10.1070/RM2012v067n04ABEH004807","issue":"4","month":"11","page":"781 - 783","file":[{"creator":"system","checksum":"389a5ae53d6347de36c3468034f2821d","date_created":"2018-12-12T10:16:49Z","file_size":253816,"content_type":"application/pdf","date_updated":"2020-07-14T12:45:55Z","access_level":"open_access","file_id":"5239","relation":"main_file","file_name":"IST-2013-132-v1+1_2012-J-04-Functional-E.pdf"}],"author":[{"first_name":"Nikolai","last_name":"Dolbilin","full_name":"Dolbilin, Nikolai"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Oleg","full_name":"Musin, Oleg","last_name":"Musin"}],"language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"date_created":"2018-12-11T12:00:28Z","year":"2012","pubrep_id":"132","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","publist_id":"3792","publication_status":"published","isi":1,"external_id":{"isi":["000310789000005"]},"publisher":"IOP Publishing","status":"public","has_accepted_license":"1","oa_version":"Submitted Version","_id":"2941","citation":{"apa":"Dolbilin, N., Edelsbrunner, H., &#38; Musin, O. (2012). On the optimality of functionals over triangulations of Delaunay sets. <i>Russian Mathematical Surveys</i>. IOP Publishing. <a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">https://doi.org/10.1070/RM2012v067n04ABEH004807</a>","ama":"Dolbilin N, Edelsbrunner H, Musin O. On the optimality of functionals over triangulations of Delaunay sets. <i>Russian Mathematical Surveys</i>. 2012;67(4):781-783. doi:<a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">10.1070/RM2012v067n04ABEH004807</a>","chicago":"Dolbilin, Nikolai, Herbert Edelsbrunner, and Oleg Musin. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” <i>Russian Mathematical Surveys</i>. IOP Publishing, 2012. <a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">https://doi.org/10.1070/RM2012v067n04ABEH004807</a>.","ieee":"N. Dolbilin, H. Edelsbrunner, and O. Musin, “On the optimality of functionals over triangulations of Delaunay sets,” <i>Russian Mathematical Surveys</i>, vol. 67, no. 4. IOP Publishing, pp. 781–783, 2012.","ista":"Dolbilin N, Edelsbrunner H, Musin O. 2012. On the optimality of functionals over triangulations of Delaunay sets. Russian Mathematical Surveys. 67(4), 781–783.","short":"N. Dolbilin, H. Edelsbrunner, O. Musin, Russian Mathematical Surveys 67 (2012) 781–783.","mla":"Dolbilin, Nikolai, et al. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” <i>Russian Mathematical Surveys</i>, vol. 67, no. 4, IOP Publishing, 2012, pp. 781–83, doi:<a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">10.1070/RM2012v067n04ABEH004807</a>."},"file_date_updated":"2020-07-14T12:45:55Z","title":"On the optimality of functionals over triangulations of Delaunay sets"},{"oa_version":"Submitted Version","_id":"2943","citation":{"chicago":"Hadizadeh Yazdi, Nastaran, Calin C Guet, Reid Johnson, and John Marko. “Variation of the Folding and Dynamics of the Escherichia Coli Chromosome with Growth Conditions.” <i>Molecular Microbiology</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/mmi.12071\">https://doi.org/10.1111/mmi.12071</a>.","ieee":"N. Hadizadeh Yazdi, C. C. Guet, R. Johnson, and J. Marko, “Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions,” <i>Molecular Microbiology</i>, vol. 86, no. 6. Wiley-Blackwell, pp. 1318–1333, 2012.","ista":"Hadizadeh Yazdi N, Guet CC, Johnson R, Marko J. 2012. Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions. Molecular Microbiology. 86(6), 1318–1333.","short":"N. Hadizadeh Yazdi, C.C. Guet, R. Johnson, J. Marko, Molecular Microbiology 86 (2012) 1318–1333.","mla":"Hadizadeh Yazdi, Nastaran, et al. “Variation of the Folding and Dynamics of the Escherichia Coli Chromosome with Growth Conditions.” <i>Molecular Microbiology</i>, vol. 86, no. 6, Wiley-Blackwell, 2012, pp. 1318–33, doi:<a href=\"https://doi.org/10.1111/mmi.12071\">10.1111/mmi.12071</a>.","apa":"Hadizadeh Yazdi, N., Guet, C. C., Johnson, R., &#38; Marko, J. (2012). Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions. <i>Molecular Microbiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/mmi.12071\">https://doi.org/10.1111/mmi.12071</a>","ama":"Hadizadeh Yazdi N, Guet CC, Johnson R, Marko J. Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions. <i>Molecular Microbiology</i>. 2012;86(6):1318-1333. doi:<a href=\"https://doi.org/10.1111/mmi.12071\">10.1111/mmi.12071</a>"},"title":"Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions","publist_id":"3790","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"09","acknowledgement":"We thank Professor Philippe Cluzel and Mr Lance Min for providing advice and materials. Jeannette Chau provided technical support. Work at NU was supported by NSF Grants DMR-0715099, MCB-1022117, DMR-1206868, DMR-0520513 and DMR-1121262 (NU-MRSEC), by NIH-NCI Grant U54CA143869-01 (NU-PS-OC) and by the Chicago Biomedical Consortium with support from the Searle Funds at the Chicago Community Trust. Work at UCLA was supported by NIH Grant GM038509.","publication_status":"published","external_id":{"isi":["000312557000005"]},"isi":1,"status":"public","publisher":"Wiley-Blackwell","month":"11","main_file_link":[{"url":"http://europepmc.org/articles/pmc3524407","open_access":"1"}],"issue":"6","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:00:28Z","department":[{"_id":"CaGu"}],"author":[{"last_name":"Hadizadeh Yazdi","full_name":"Hadizadeh Yazdi, Nastaran","first_name":"Nastaran"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","last_name":"Guet","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C"},{"first_name":"Reid","full_name":"Johnson, Reid","last_name":"Johnson"},{"full_name":"Marko, John","last_name":"Marko","first_name":"John"}],"page":"1318 - 1333","year":"2012","quality_controlled":"1","abstract":[{"text":"We examine whether the Escherichia coli chromosome is folded into a self-adherent nucleoprotein complex, or alternately is a confined but otherwise unconstrained self-avoiding polymer. We address this through in vivo visualization, using an inducible GFP fusion to the nucleoid-associated protein Fis to non-specifically decorate the entire chromosome. For a range of different growth conditions, the chromosome is a compact structure that does not fill the volume of the cell, and which moves from the new pole to the cell centre. During rapid growth, chromosome segregation occurs well before cell division, with daughter chromosomes coupled by a thin inter-daughter filament before complete segregation, whereas during slow growth chromosomes stay adjacent until cell division occurs. Image correlation analysis indicates that sub-nucleoid structure is stable on a 1min timescale, comparable to the timescale for redistribution time measured for GFP-Fis after photobleaching. Optical deconvolution and writhe calculation analysis indicate that the nucleoid has a large-scale coiled organization rather than being an amorphous mass. Our observations are consistent with the chromosome having a self-adherent filament organization.","lang":"eng"}],"scopus_import":"1","type":"journal_article","intvolume":"        86","publication":"Molecular Microbiology","date_published":"2012-11-09T00:00:00Z","article_processing_charge":"No","volume":86,"doi":"10.1111/mmi.12071","date_updated":"2025-09-30T08:13:13Z","oa":1},{"article_processing_charge":"No","date_published":"2012-11-01T00:00:00Z","date_updated":"2025-09-30T08:12:46Z","volume":12,"doi":"10.1038/nri3298","abstract":[{"text":"In search of foreign antigens, lymphocytes recirculate from the blood, through lymph nodes, into lymphatics and back to the blood. Dendritic cells also migrate to lymph nodes for optimal interaction with lymphocytes. This continuous trafficking of immune cells into and out of lymph nodes is essential for immune surveillance of foreign invaders. In this article, we review our current understanding of the functions of high endothelial venules (HEVs), stroma and lymphatics in the entry, positioning and exit of immune cells in lymph nodes during homeostasis, and we highlight the unexpected role of dendritic cells in the control of lymphocyte homing through HEVs.","lang":"eng"}],"quality_controlled":"1","publication":"Nature Reviews Immunology","intvolume":"        12","type":"journal_article","scopus_import":"1","year":"2012","issue":"11","month":"11","page":"762 - 773","author":[{"last_name":"Girard","full_name":"Girard, Jean","first_name":"Jean"},{"last_name":"Moussion","full_name":"Moussion, Christine","id":"3356F664-F248-11E8-B48F-1D18A9856A87","first_name":"Christine"},{"first_name":"Reinhold","full_name":"Förster, Reinhold","last_name":"Förster"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:00:29Z","department":[{"_id":"MiSi"}],"isi":1,"external_id":{"isi":["000310523400010"]},"publisher":"Nature Publishing Group","status":"public","acknowledgement":"We thank M. Sixt and A. Peixoto for helpful comments on the manuscript. Work in the laboratory of J.-P.G. is supported by grants from Fondation ARC pour la Recherche sur le Cancer, Agence Nationale de la Recherche (ANR), Institut National du Cancer (INCA), Fondation RITC and Région Midi-Pyrénées. Research by R.F. is supported by Deutsche Forschungsgemeinschaft (DFG) grants SFB621-A1, SFB738-B5, SFB587-B3, SFB900-B1 and KFO 250-FO 334/2-1. We regret that, owing to space limitations, we could not always quote the work of colleagues who have contributed to the field.","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"3787","publication_status":"published","title":"HEVs, lymphatics and homeostatic immune cell trafficking in lymph nodes","oa_version":"None","_id":"2945","citation":{"short":"J. Girard, C. Moussion, R. Förster, Nature Reviews Immunology 12 (2012) 762–773.","mla":"Girard, Jean, et al. “HEVs, Lymphatics and Homeostatic Immune Cell Trafficking in Lymph Nodes.” <i>Nature Reviews Immunology</i>, vol. 12, no. 11, Nature Publishing Group, 2012, pp. 762–73, doi:<a href=\"https://doi.org/10.1038/nri3298\">10.1038/nri3298</a>.","ieee":"J. Girard, C. Moussion, and R. Förster, “HEVs, lymphatics and homeostatic immune cell trafficking in lymph nodes,” <i>Nature Reviews Immunology</i>, vol. 12, no. 11. Nature Publishing Group, pp. 762–773, 2012.","chicago":"Girard, Jean, Christine Moussion, and Reinhold Förster. “HEVs, Lymphatics and Homeostatic Immune Cell Trafficking in Lymph Nodes.” <i>Nature Reviews Immunology</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nri3298\">https://doi.org/10.1038/nri3298</a>.","ista":"Girard J, Moussion C, Förster R. 2012. HEVs, lymphatics and homeostatic immune cell trafficking in lymph nodes. Nature Reviews Immunology. 12(11), 762–773.","ama":"Girard J, Moussion C, Förster R. HEVs, lymphatics and homeostatic immune cell trafficking in lymph nodes. <i>Nature Reviews Immunology</i>. 2012;12(11):762-773. doi:<a href=\"https://doi.org/10.1038/nri3298\">10.1038/nri3298</a>","apa":"Girard, J., Moussion, C., &#38; Förster, R. (2012). HEVs, lymphatics and homeostatic immune cell trafficking in lymph nodes. <i>Nature Reviews Immunology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nri3298\">https://doi.org/10.1038/nri3298</a>"}},{"month":"10","issue":"19","author":[{"first_name":"Anne","last_name":"Dueck","full_name":"Dueck, Anne"},{"first_name":"Christian","full_name":"Ziegler, Christian","last_name":"Ziegler"},{"id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander","last_name":"Eichner","full_name":"Eichner, Alexander"},{"first_name":"Eugène","last_name":"Berezikov","full_name":"Berezikov, Eugène"},{"last_name":"Meister","full_name":"Meister, Gunter","first_name":"Gunter"}],"language":[{"iso":"eng"}],"department":[{"_id":"MiSi"}],"date_created":"2018-12-11T12:00:29Z","page":"9850 - 9862","file":[{"relation":"main_file","file_name":"IST-2015-383-v1+1_Nucl._Acids_Res.-2012-Dueck-9850-62.pdf","date_updated":"2020-07-14T12:45:55Z","access_level":"open_access","file_id":"4993","content_type":"application/pdf","file_size":8126936,"creator":"system","checksum":"1bb8d1ff894014b481657a21083c941c","date_created":"2018-12-12T10:13:12Z"}],"pubrep_id":"383","year":"2012","abstract":[{"lang":"eng","text":"MicroRNAs (miRNAs) are small noncoding RNAs that function in literally all cellular processes. miRNAs interact with Argonaute (Ago) proteins and guide them to specific target sites located in the 3′-untranslated region (3′-UTR) of target mRNAs leading to translational repression and deadenylation-induced mRNA degradation. Most miRNAs are processed from hairpin-structured precursors by the consecutive action of the RNase III enzymes Drosha and Dicer. However, processing of miR-451 is Dicer independent and cleavage is mediated by the endonuclease Ago2. Here we have characterized miR-451 sequence and structure requirements for processing as well as sorting of miRNAs into different Ago proteins. Pre-miR-451 appears to be optimized for Ago2 cleavage and changes result in reduced processing. In addition, we show that the mature miR-451 only associates with Ago2 suggesting that mature miRNAs are not exchanged between different members of the Ago protein family. Based on cloning and deep sequencing of endogenous miRNAs associated with Ago1-3, we do not find evidence for miRNA sorting in human cells. However, Ago identity appears to influence the length of some miRNAs, while others remain unaffected."}],"quality_controlled":"1","type":"journal_article","scopus_import":"1","publication":"Nucleic Acids Research","ddc":["570"],"corr_author":"1","intvolume":"        40","article_processing_charge":"No","date_published":"2012-10-01T00:00:00Z","doi":"10.1093/nar/gks705","volume":40,"oa":1,"date_updated":"2025-09-30T08:12:07Z","oa_version":"Published Version","_id":"2946","citation":{"ieee":"A. Dueck, C. Ziegler, A. Eichner, E. Berezikov, and G. Meister, “MicroRNAs associated with the different human Argonaute proteins,” <i>Nucleic Acids Research</i>, vol. 40, no. 19. Oxford University Press, pp. 9850–9862, 2012.","ista":"Dueck A, Ziegler C, Eichner A, Berezikov E, Meister G. 2012. MicroRNAs associated with the different human Argonaute proteins. Nucleic Acids Research. 40(19), 9850–9862.","chicago":"Dueck, Anne, Christian Ziegler, Alexander Eichner, Eugène Berezikov, and Gunter Meister. “MicroRNAs Associated with the Different Human Argonaute Proteins.” <i>Nucleic Acids Research</i>. Oxford University Press, 2012. <a href=\"https://doi.org/10.1093/nar/gks705\">https://doi.org/10.1093/nar/gks705</a>.","mla":"Dueck, Anne, et al. “MicroRNAs Associated with the Different Human Argonaute Proteins.” <i>Nucleic Acids Research</i>, vol. 40, no. 19, Oxford University Press, 2012, pp. 9850–62, doi:<a href=\"https://doi.org/10.1093/nar/gks705\">10.1093/nar/gks705</a>.","short":"A. Dueck, C. Ziegler, A. Eichner, E. Berezikov, G. Meister, Nucleic Acids Research 40 (2012) 9850–9862.","apa":"Dueck, A., Ziegler, C., Eichner, A., Berezikov, E., &#38; Meister, G. (2012). MicroRNAs associated with the different human Argonaute proteins. <i>Nucleic Acids Research</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/nar/gks705\">https://doi.org/10.1093/nar/gks705</a>","ama":"Dueck A, Ziegler C, Eichner A, Berezikov E, Meister G. MicroRNAs associated with the different human Argonaute proteins. <i>Nucleic Acids Research</i>. 2012;40(19):9850-9862. doi:<a href=\"https://doi.org/10.1093/nar/gks705\">10.1093/nar/gks705</a>"},"title":"MicroRNAs associated with the different human Argonaute proteins","file_date_updated":"2020-07-14T12:45:55Z","publist_id":"3786","acknowledgement":"Deutsche Forschungsgemeinschaft (DFG) (SFB 960 and FOR855); European Research Council (ERC grant ‘sRNAs’); European Union (FP7 project ‘ONCOMIRs’); German Bundesministerium für Bildung und Forschung (BMBF, NGFN+, FKZ PIM-01GS0804-5); Bavarian Genome Research Network (BayGene to G.M.); The Netherlands Organization for Scientific Research (NWO, VIDI grant to E.B.). Funding for open access charge: DFG via the open access publishing program. \r\n\r\nWe thank Sigrun Ammon and Corinna Friederich for technical assistance and Sebastian Petri and Daniel Schraivogel for helpful discussions.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","publication_status":"published","external_id":{"isi":["000310377200046"]},"tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"isi":1,"has_accepted_license":"1","status":"public","publisher":"Oxford University Press"},{"article_processing_charge":"No","date_published":"2012-06-01T00:00:00Z","volume":7561,"doi":"10.1007/978-3-642-33386-6_30","oa":1,"date_updated":"2025-07-10T11:52:24Z","abstract":[{"lang":"eng","text":"We introduce games with probabilistic uncertainty, a model for controller synthesis in which the controller observes the state through imprecise sensors that provide correct information about the current state with a fixed probability. That is, in each step, the sensors return an observed state, and given the observed state, there is a probability distribution (due to the estimation error) over the actual current state. The controller must base its decision on the observed state (rather than the actual current state, which it does not know). On the other hand, we assume that the environment can perfectly observe the current state. We show that controller synthesis for qualitative ω-regular objectives in our model can be reduced in polynomial time to standard partial-observation stochastic games, and vice-versa. As a consequence we establish the precise decidability frontier for the new class of games, and establish optimal complexity results for all the decidable problems."}],"ec_funded":1,"quality_controlled":"1","conference":{"name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2012-10-06","location":"Thiruvananthapuram, India","start_date":"2012-10-03"},"type":"conference","scopus_import":"1","arxiv":1,"intvolume":"      7561","year":"2012","alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1202.4140"}],"month":"06","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:00:29Z","department":[{"_id":"KrCh"}],"page":"385 - 399","external_id":{"arxiv":["1202.4140"]},"status":"public","publisher":"Springer","publist_id":"3785","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23 on 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.","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"Equivalence of games with probabilistic uncertainty and partial observation games","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"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"_id":"2947","oa_version":"Preprint","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games</i>. Vol. 7561, Springer, 2012, pp. 385–99, doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_30\">10.1007/978-3-642-33386-6_30</a>.","short":"K. Chatterjee, M. Chmelik, R. Majumdar, in:, Springer, 2012, pp. 385–399.","ieee":"K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic uncertainty and partial observation games,” presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 385–399.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Ritankar Majumdar. “Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games,” 7561:385–99. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_30\">https://doi.org/10.1007/978-3-642-33386-6_30</a>.","ista":"Chatterjee K, Chmelik M, Majumdar R. 2012. Equivalence of games with probabilistic uncertainty and partial observation games. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561, 385–399.","ama":"Chatterjee K, Chmelik M, Majumdar R. Equivalence of games with probabilistic uncertainty and partial observation games. In: Vol 7561. Springer; 2012:385-399. doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_30\">10.1007/978-3-642-33386-6_30</a>","apa":"Chatterjee, K., Chmelik, M., &#38; Majumdar, R. (2012). Equivalence of games with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399). Presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_30\">https://doi.org/10.1007/978-3-642-33386-6_30</a>"}},{"title":"The medial entorhinal cortex keeps Up","oa_version":"None","_id":"2949","citation":{"ieee":"D. Dupret and J. L. Csicsvari, “The medial entorhinal cortex keeps Up,” <i>Nature Neuroscience</i>, vol. 15, no. 11. Nature Publishing Group, pp. 1471–1472, 2012.","chicago":"Dupret, David, and Jozsef L Csicsvari. “The Medial Entorhinal Cortex Keeps Up.” <i>Nature Neuroscience</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nn.3245\">https://doi.org/10.1038/nn.3245</a>.","ista":"Dupret D, Csicsvari JL. 2012. The medial entorhinal cortex keeps Up. Nature Neuroscience. 15(11), 1471–1472.","mla":"Dupret, David, and Jozsef L. Csicsvari. “The Medial Entorhinal Cortex Keeps Up.” <i>Nature Neuroscience</i>, vol. 15, no. 11, Nature Publishing Group, 2012, pp. 1471–72, doi:<a href=\"https://doi.org/10.1038/nn.3245\">10.1038/nn.3245</a>.","short":"D. Dupret, J.L. Csicsvari, Nature Neuroscience 15 (2012) 1471–1472.","apa":"Dupret, D., &#38; Csicsvari, J. L. (2012). The medial entorhinal cortex keeps Up. <i>Nature Neuroscience</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nn.3245\">https://doi.org/10.1038/nn.3245</a>","ama":"Dupret D, Csicsvari JL. The medial entorhinal cortex keeps Up. <i>Nature Neuroscience</i>. 2012;15(11):1471-1472. doi:<a href=\"https://doi.org/10.1038/nn.3245\">10.1038/nn.3245</a>"},"isi":1,"external_id":{"isi":["000310424900003"]},"publisher":"Nature Publishing Group","status":"public","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"3782","publication_status":"published","year":"2012","issue":"11","month":"11","main_file_link":[{"url":"http://www.mrcbndu.ox.ac.uk/publications/medial-entorhinal-cortex-keeps"}],"page":"1471 - 1472","department":[{"_id":"JoCs"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:00:30Z","author":[{"full_name":"Dupret, David","last_name":"Dupret","first_name":"David"},{"first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036","last_name":"Csicsvari"}],"date_published":"2012-11-01T00:00:00Z","article_processing_charge":"No","date_updated":"2025-09-30T08:11:33Z","volume":15,"doi":"10.1038/nn.3245","quality_controlled":"1","corr_author":"1","intvolume":"        15","publication":"Nature Neuroscience","type":"journal_article","scopus_import":"1"},{"citation":{"chicago":"Maître, Jean-Léon, Hélène Berthoumieux, Gabriel Krens, Guillaume Salbreux, Frank Julicher, Ewa Paluch, and Carl-Philipp J Heisenberg. “Adhesion Functions in Cell Sorting by Mechanically Coupling the Cortices of Adhering Cells.” <i>Science</i>. American Association for the Advancement of Science, 2012. <a href=\"https://doi.org/10.1126/science.1225399\">https://doi.org/10.1126/science.1225399</a>.","ieee":"J.-L. Maître <i>et al.</i>, “Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells,” <i>Science</i>, vol. 338, no. 6104. American Association for the Advancement of Science, pp. 253–256, 2012.","ista":"Maître J-L, Berthoumieux H, Krens G, Salbreux G, Julicher F, Paluch E, Heisenberg C-PJ. 2012. Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells. Science. 338(6104), 253–256.","mla":"Maître, Jean-Léon, et al. “Adhesion Functions in Cell Sorting by Mechanically Coupling the Cortices of Adhering Cells.” <i>Science</i>, vol. 338, no. 6104, American Association for the Advancement of Science, 2012, pp. 253–56, doi:<a href=\"https://doi.org/10.1126/science.1225399\">10.1126/science.1225399</a>.","short":"J.-L. Maître, H. Berthoumieux, G. Krens, G. Salbreux, F. Julicher, E. Paluch, C.-P.J. Heisenberg, Science 338 (2012) 253–256.","apa":"Maître, J.-L., Berthoumieux, H., Krens, G., Salbreux, G., Julicher, F., Paluch, E., &#38; Heisenberg, C.-P. J. (2012). Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1225399\">https://doi.org/10.1126/science.1225399</a>","ama":"Maître J-L, Berthoumieux H, Krens G, et al. Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells. <i>Science</i>. 2012;338(6104):253-256. doi:<a href=\"https://doi.org/10.1126/science.1225399\">10.1126/science.1225399</a>"},"oa_version":"None","_id":"2951","title":"Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells","acknowledged_ssus":[{"_id":"SSU"}],"publication_status":"published","publist_id":"3777","day":"12","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","publisher":"American Association for the Advancement of Science","external_id":{"isi":["000309712300045"]},"isi":1,"date_created":"2018-12-11T12:00:31Z","department":[{"_id":"CaHe"}],"language":[{"iso":"eng"}],"author":[{"id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87","first_name":"Jean-Léon","last_name":"Maître","orcid":"0000-0002-3688-1474","full_name":"Maître, Jean-Léon"},{"full_name":"Berthoumieux, Hélène","last_name":"Berthoumieux","first_name":"Hélène"},{"full_name":"Krens, Gabriel","orcid":"0000-0003-4761-5996","last_name":"Krens","first_name":"Gabriel","id":"2B819732-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Guillaume","full_name":"Salbreux, Guillaume","last_name":"Salbreux"},{"last_name":"Julicher","full_name":"Julicher, Frank","first_name":"Frank"},{"first_name":"Ewa","last_name":"Paluch","full_name":"Paluch, Ewa"},{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566"}],"page":"253 - 256","month":"10","issue":"6104","year":"2012","type":"journal_article","scopus_import":"1","corr_author":"1","intvolume":"       338","publication":"Science","quality_controlled":"1","abstract":[{"lang":"eng","text":"Differential cell adhesion and cortex tension are thought to drive cell sorting by controlling cell-cell contact formation. Here, we show that cell adhesion and cortex tension have different mechanical functions in controlling progenitor cell-cell contact formation and sorting during zebrafish gastrulation. Cortex tension controls cell-cell contact expansion by modulating interfacial tension at the contact. By contrast, adhesion has little direct function in contact expansion, but instead is needed to mechanically couple the cortices of adhering cells at their contacts, allowing cortex tension to control contact expansion. The coupling function of adhesion is mediated by E-cadherin and limited by the mechanical anchoring of E-cadherin to the cortex. Thus, cell adhesion provides the mechanical scaffold for cell cortex tension to drive cell sorting during gastrulation."}],"doi":"10.1126/science.1225399","volume":338,"date_updated":"2025-09-30T08:10:36Z","date_published":"2012-10-12T00:00:00Z","article_processing_charge":"No"},{"publication_status":"published","acknowledgement":"M.T. is supported by the UK Medical Research Council (MRC) and Royal Society and C.-P.H. by the Fonds zur Förderung der wissenschaftlichen Forschung (FWF), Deutsche Forschungsgemeinschaft (DFG) and Institute of Science and Technology Austria. ","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","publist_id":"3776","publisher":"Company of Biologists","status":"public","isi":1,"external_id":{"isi":["000309701300002"]},"citation":{"apa":"Tada, M., &#38; Heisenberg, C.-P. J. (2012). Convergent extension Using collective cell migration and cell intercalation to shape embryos. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.073007\">https://doi.org/10.1242/dev.073007</a>","ama":"Tada M, Heisenberg C-PJ. Convergent extension Using collective cell migration and cell intercalation to shape embryos. <i>Development</i>. 2012;139(21):3897-3904. doi:<a href=\"https://doi.org/10.1242/dev.073007\">10.1242/dev.073007</a>","chicago":"Tada, Masazumi, and Carl-Philipp J Heisenberg. “Convergent Extension Using Collective Cell Migration and Cell Intercalation to Shape Embryos.” <i>Development</i>. Company of Biologists, 2012. <a href=\"https://doi.org/10.1242/dev.073007\">https://doi.org/10.1242/dev.073007</a>.","ieee":"M. Tada and C.-P. J. Heisenberg, “Convergent extension Using collective cell migration and cell intercalation to shape embryos,” <i>Development</i>, vol. 139, no. 21. Company of Biologists, pp. 3897–3904, 2012.","ista":"Tada M, Heisenberg C-PJ. 2012. Convergent extension Using collective cell migration and cell intercalation to shape embryos. Development. 139(21), 3897–3904.","short":"M. Tada, C.-P.J. Heisenberg, Development 139 (2012) 3897–3904.","mla":"Tada, Masazumi, and Carl-Philipp J. Heisenberg. “Convergent Extension Using Collective Cell Migration and Cell Intercalation to Shape Embryos.” <i>Development</i>, vol. 139, no. 21, Company of Biologists, 2012, pp. 3897–904, doi:<a href=\"https://doi.org/10.1242/dev.073007\">10.1242/dev.073007</a>."},"_id":"2952","oa_version":"None","title":"Convergent extension Using collective cell migration and cell intercalation to shape embryos","publication":"Development","corr_author":"1","intvolume":"       139","type":"journal_article","scopus_import":"1","abstract":[{"text":"Body axis elongation represents a common and fundamental morphogenetic process in development. A key mechanism triggering body axis elongation without additional growth is convergent extension (CE), whereby a tissue undergoes simultaneous narrowing and extension. Both collective cell migration and cell intercalation are thought to drive CE and are used to different degrees in various species as they elongate their body axis. Here, we provide an overview of CE as a general strategy for body axis elongation and discuss conserved and divergent mechanisms underlying CE among different species.","lang":"eng"}],"quality_controlled":"1","date_updated":"2025-09-30T08:10:08Z","doi":"10.1242/dev.073007","volume":139,"article_processing_charge":"No","date_published":"2012-11-01T00:00:00Z","page":"3897 - 3904","author":[{"first_name":"Masazumi","full_name":"Tada, Masazumi","last_name":"Tada"},{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:00:31Z","department":[{"_id":"CaHe"}],"issue":"21","month":"11","year":"2012"},{"issue":"5","month":"10","page":"559 - 561","department":[{"_id":"CaHe"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:00:31Z","author":[{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","last_name":"Heisenberg"},{"first_name":"Reinhard","full_name":"Fässler, Reinhard","last_name":"Fässler"}],"year":"2012","quality_controlled":"1","corr_author":"1","intvolume":"        24","publication":"Current Opinion in Cell Biology","type":"journal_article","scopus_import":"1","date_published":"2012-10-01T00:00:00Z","article_processing_charge":"No","date_updated":"2025-09-30T08:09:10Z","volume":24,"doi":"10.1016/j.ceb.2012.09.002","oa_version":"None","_id":"2953","citation":{"mla":"Heisenberg, Carl-Philipp J., and Reinhard Fässler. “Cell-Cell Adhesion and Extracellular Matrix Diversity Counts.” <i>Current Opinion in Cell Biology</i>, vol. 24, no. 5, Elsevier, 2012, pp. 559–61, doi:<a href=\"https://doi.org/10.1016/j.ceb.2012.09.002\">10.1016/j.ceb.2012.09.002</a>.","short":"C.-P.J. Heisenberg, R. Fässler, Current Opinion in Cell Biology 24 (2012) 559–561.","ista":"Heisenberg C-PJ, Fässler R. 2012. Cell-cell adhesion and extracellular matrix diversity counts. Current Opinion in Cell Biology. 24(5), 559–561.","chicago":"Heisenberg, Carl-Philipp J, and Reinhard Fässler. “Cell-Cell Adhesion and Extracellular Matrix Diversity Counts.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.ceb.2012.09.002\">https://doi.org/10.1016/j.ceb.2012.09.002</a>.","ieee":"C.-P. J. Heisenberg and R. Fässler, “Cell-cell adhesion and extracellular matrix diversity counts,” <i>Current Opinion in Cell Biology</i>, vol. 24, no. 5. Elsevier, pp. 559–561, 2012.","ama":"Heisenberg C-PJ, Fässler R. Cell-cell adhesion and extracellular matrix diversity counts. <i>Current Opinion in Cell Biology</i>. 2012;24(5):559-561. doi:<a href=\"https://doi.org/10.1016/j.ceb.2012.09.002\">10.1016/j.ceb.2012.09.002</a>","apa":"Heisenberg, C.-P. J., &#38; Fässler, R. (2012). Cell-cell adhesion and extracellular matrix diversity counts. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2012.09.002\">https://doi.org/10.1016/j.ceb.2012.09.002</a>"},"title":"Cell-cell adhesion and extracellular matrix diversity counts","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","publist_id":"3773","publication_status":"published","isi":1,"external_id":{"isi":["000310943300001"]},"publisher":"Elsevier","status":"public"},{"OA_place":"repository","title":"Mean payoff pushdown games","citation":{"short":"K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","mla":"Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 6280438, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.30\">10.1109/LICS.2012.30</a>.","chicago":"Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.30\">https://doi.org/10.1109/LICS.2012.30</a>.","ista":"Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280438.","ieee":"K. Chatterjee and Y. Velner, “Mean payoff pushdown games,” in <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Dubrovnik, Croatia , 2012.","ama":"Chatterjee K, Velner Y. Mean payoff pushdown games. In: <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.30\">10.1109/LICS.2012.30</a>","apa":"Chatterjee, K., &#38; Velner, Y. (2012). Mean payoff pushdown games. In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Dubrovnik, Croatia : IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.30\">https://doi.org/10.1109/LICS.2012.30</a>"},"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5377"}]},"oa_version":"Preprint","_id":"2956","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","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","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publisher":"IEEE","article_number":"6280438","status":"public","isi":1,"external_id":{"arxiv":["1201.2829"],"isi":["000309059900025"]},"publication_status":"published","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), Microsoft faculty fellows award, the Israeli Centers of Research Excellence (ICORE) program, (Center No. 4/11), the RICH Model Toolkit (ICT COST Action IC0901), and was carried out in partial fulfillment of the requirements for the Ph.D. degree of the second author.\r\nA Technical Report of this paper is available via internal link.","day":"23","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"3770","year":"2012","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Yaron","last_name":"Velner","full_name":"Velner, Yaron"}],"department":[{"_id":"KrCh"}],"date_created":"2018-12-11T12:00:32Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1201.2829","open_access":"1"}],"month":"08","oa":1,"date_updated":"2025-09-30T08:08:13Z","doi":"10.1109/LICS.2012.30","article_processing_charge":"No","date_published":"2012-08-23T00:00:00Z","publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","arxiv":1,"OA_type":"green","type":"conference","scopus_import":"1","conference":{"name":"LICS: Logic in Computer Science","end_date":"2012-06-28","location":"Dubrovnik, Croatia ","start_date":"2012-06-25"},"abstract":[{"text":"Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion. While pushdown games have been studied before with qualitative objectives, such as reachability and parity objectives, in this work we study for the first time such games with the most well-studied quantitative objective, namely, mean payoff objectives. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation, but only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two-player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP-hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games; and memoryless modular strategies are sufficient in two-player pushdown games. Finally we also show that all the problems have the same computational complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded.","lang":"eng"}],"ec_funded":1,"quality_controlled":"1"},{"publist_id":"3769","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"23","publication_status":"published","external_id":{"arxiv":["1107.2091"],"isi":["000309059900024"]},"isi":1,"status":"public","publisher":"IEEE","article_number":"6280437","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"_id":"2957","oa_version":"Preprint","citation":{"ama":"Chatterjee K, Tracol M. Decidable problems for probabilistic automata on infinite words. In: <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.29\">10.1109/LICS.2012.29</a>","apa":"Chatterjee, K., &#38; Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Dubrovnik, Croatia : IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.29\">https://doi.org/10.1109/LICS.2012.29</a>","mla":"Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 6280437, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.29\">10.1109/LICS.2012.29</a>.","short":"K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","chicago":"Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.29\">https://doi.org/10.1109/LICS.2012.29</a>.","ista":"Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437.","ieee":"K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata on infinite words,” in <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Dubrovnik, Croatia , 2012."},"related_material":{"record":[{"id":"5384","status":"public","relation":"earlier_version"}]},"title":"Decidable problems for probabilistic automata on infinite words","abstract":[{"text":"We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with positive probability; (ii) the almost decision problem asks whether there is a word that is accepted with probability 1; and (iii) the limit decision problem asks whether words are accepted with probability arbitrarily close to 1. We unify and generalize several decidability results for probabilistic automata over infinite words, and identify a robust (closed under union and intersection) subclass of probabilistic automata for which all the qualitative decision problems are decidable for parity conditions. We also show that if the input words are restricted to lasso shape (regular) words, then the positive and almost problems are decidable for all probabilistic automata with parity conditions. For most decidable problems we show an optimal PSPACE-complete complexity bound.","lang":"eng"}],"ec_funded":1,"quality_controlled":"1","conference":{"location":"Dubrovnik, Croatia ","start_date":"2012-06-25","name":"LICS: Logic in Computer Science","end_date":"2012-06-28"},"arxiv":1,"type":"conference","scopus_import":"1","publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","corr_author":"1","article_processing_charge":"No","date_published":"2012-08-23T00:00:00Z","doi":"10.1109/LICS.2012.29","oa":1,"date_updated":"2025-09-30T08:07:39Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1107.2091"}],"month":"08","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Tracol, Mathieu","last_name":"Tracol","first_name":"Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T12:00:33Z","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"year":"2012"},{"author":[{"first_name":"Kevin","last_name":"Allen","full_name":"Allen, Kevin"},{"first_name":"J Nick","full_name":"Rawlins, J Nick","last_name":"Rawlins"},{"last_name":"Bannerman","full_name":"Bannerman, David","first_name":"David"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","orcid":"0000-0002-5193-4036","last_name":"Csicsvari","full_name":"Csicsvari, Jozsef L"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:00:33Z","department":[{"_id":"JoCs"}],"page":"14752 - 14766","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3531717/"}],"month":"10","issue":"42","year":"2012","scopus_import":"1","type":"journal_article","publication":"Journal of Neuroscience","intvolume":"        32","abstract":[{"text":"The activity of hippocampal pyramidal cells reflects both the current position of the animal and information related to its current behavior. Here we investigated whether single hippocampal neurons can encode several independent features defining trials during a memory task. We also tested whether task-related information is represented by partial remapping of the place cell population or, instead, via firing rate modulation of spatially stable place cells. To address these two questions, the activity of hippocampal neurons was recorded in rats performing a conditional discrimination task on a modified T-maze in which the identity of a food reward guided behavior. When the rat was on the central arm of the maze, the firing rate of pyramidal cells changed depending on two independent factors: (1) the identity of the food reward given to the animal and (2) the previous location of the animal on the maze. Importantly, some pyramidal cells encoded information relative to both factors. This trial-type specific and retrospective coding did not interfere with the spatial representation of the maze: hippocampal cells had stable place fields and their theta-phase precession profiles were unaltered during the task, indicating that trial-related information was encoded via rate remapping. During error trials, encoding of both trial-related information and spatial location was impaired. Finally, we found that pyramidal cells also encode trial-related information via rate remapping during the continuous version of the rewarded alternation task without delays. These results suggest that hippocampal neurons can encode several task-related cognitive aspects via rate remapping.","lang":"eng"}],"ec_funded":1,"quality_controlled":"1","volume":32,"doi":"10.1523/JNEUROSCI.6175-11.2012","oa":1,"date_updated":"2025-09-30T08:07:06Z","article_processing_charge":"No","date_published":"2012-10-17T00:00:00Z","citation":{"apa":"Allen, K., Rawlins, J. N., Bannerman, D., &#38; Csicsvari, J. L. (2012). Hippocampal place cells can encode multiple trial-dependent features through rate remapping. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">https://doi.org/10.1523/JNEUROSCI.6175-11.2012</a>","ama":"Allen K, Rawlins JN, Bannerman D, Csicsvari JL. Hippocampal place cells can encode multiple trial-dependent features through rate remapping. <i>Journal of Neuroscience</i>. 2012;32(42):14752-14766. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">10.1523/JNEUROSCI.6175-11.2012</a>","ieee":"K. Allen, J. N. Rawlins, D. Bannerman, and J. L. Csicsvari, “Hippocampal place cells can encode multiple trial-dependent features through rate remapping,” <i>Journal of Neuroscience</i>, vol. 32, no. 42. Society for Neuroscience, pp. 14752–14766, 2012.","chicago":"Allen, Kevin, J Nick Rawlins, David Bannerman, and Jozsef L Csicsvari. “Hippocampal Place Cells Can Encode Multiple Trial-Dependent Features through Rate Remapping.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2012. <a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">https://doi.org/10.1523/JNEUROSCI.6175-11.2012</a>.","ista":"Allen K, Rawlins JN, Bannerman D, Csicsvari JL. 2012. Hippocampal place cells can encode multiple trial-dependent features through rate remapping. Journal of Neuroscience. 32(42), 14752–14766.","short":"K. Allen, J.N. Rawlins, D. Bannerman, J.L. Csicsvari, Journal of Neuroscience 32 (2012) 14752–14766.","mla":"Allen, Kevin, et al. “Hippocampal Place Cells Can Encode Multiple Trial-Dependent Features through Rate Remapping.” <i>Journal of Neuroscience</i>, vol. 32, no. 42, Society for Neuroscience, 2012, pp. 14752–66, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">10.1523/JNEUROSCI.6175-11.2012</a>."},"pmid":1,"project":[{"name":"Memory-related information processing in neuronal circuits of the hippocampus and entorhinal cortex","_id":"257A4776-B435-11E9-9278-68D0E5697425","grant_number":"281511","call_identifier":"FP7"}],"_id":"2958","oa_version":"Submitted Version","title":"Hippocampal place cells can encode multiple trial-dependent features through rate remapping","publication_status":"published","publist_id":"3768","acknowledgement":"J.C. was supported by a MRC Intramural Programme Grant (U138197111) and a European Research Council Starter Grant (281511). K.A. held a Wellcome Trust PhD studentship and a Humboldt Research Fellowship for Postdoctoral Researchers. D.M.B. was supported by Wellcome Trust Senior Fellowships (074385 and 087736).","day":"17","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","publisher":"Society for Neuroscience","external_id":{"isi":["000310054000028"],"pmid":["23077060"]},"isi":1},{"publication":"Annals of Statistics","intvolume":"        40","corr_author":"1","arxiv":1,"type":"journal_article","scopus_import":"1","abstract":[{"lang":"eng","text":"We study maximum likelihood estimation in Gaussian graphical models from a geometric point of view. An algebraic elimination criterion allows us to find exact lower bounds on the number of observations needed to ensure that the maximum likelihood estimator (MLE) exists with probability one. This is applied to bipartite graphs, grids and colored graphs. We also study the ML degree, and we present the first instance of a graph for which the MLE exists with probability one, even when the number of observations equals the treewidth."}],"quality_controlled":"1","oa":1,"date_updated":"2025-09-30T08:06:35Z","doi":"10.1214/11-AOS957","volume":40,"article_processing_charge":"No","date_published":"2012-02-01T00:00:00Z","page":"238 - 261","author":[{"first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Uhler, Caroline","orcid":"0000-0002-7008-0216","last_name":"Uhler"}],"department":[{"_id":"CaUh"}],"date_created":"2018-12-11T12:00:33Z","language":[{"iso":"eng"}],"issue":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1012.2643"}],"month":"02","year":"2012","publication_status":"published","acknowledgement":"I wish to thank Bernd Sturmfels for many helpful discus- sions and Steffen Lauritzen for introducing me to the problem of the existence of the MLE in Gaussian graphical models. I would also like to thank two referees who provided helpful comments on the original version of this paper.\r\n","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","publist_id":"3767","publisher":"Institute of Mathematical Statistics","status":"public","isi":1,"external_id":{"arxiv":["1012.2643"],"isi":["000304684900010"]},"citation":{"apa":"Uhler, C. (2012). Geometry of maximum likelihood estimation in Gaussian graphical models. <i>Annals of Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/11-AOS957\">https://doi.org/10.1214/11-AOS957</a>","ama":"Uhler C. Geometry of maximum likelihood estimation in Gaussian graphical models. <i>Annals of Statistics</i>. 2012;40(1):238-261. doi:<a href=\"https://doi.org/10.1214/11-AOS957\">10.1214/11-AOS957</a>","ieee":"C. Uhler, “Geometry of maximum likelihood estimation in Gaussian graphical models,” <i>Annals of Statistics</i>, vol. 40, no. 1. Institute of Mathematical Statistics, pp. 238–261, 2012.","ista":"Uhler C. 2012. Geometry of maximum likelihood estimation in Gaussian graphical models. Annals of Statistics. 40(1), 238–261.","chicago":"Uhler, Caroline. “Geometry of Maximum Likelihood Estimation in Gaussian Graphical Models.” <i>Annals of Statistics</i>. Institute of Mathematical Statistics, 2012. <a href=\"https://doi.org/10.1214/11-AOS957\">https://doi.org/10.1214/11-AOS957</a>.","mla":"Uhler, Caroline. “Geometry of Maximum Likelihood Estimation in Gaussian Graphical Models.” <i>Annals of Statistics</i>, vol. 40, no. 1, Institute of Mathematical Statistics, 2012, pp. 238–61, doi:<a href=\"https://doi.org/10.1214/11-AOS957\">10.1214/11-AOS957</a>.","short":"C. Uhler, Annals of Statistics 40 (2012) 238–261."},"_id":"2959","oa_version":"Preprint","title":"Geometry of maximum likelihood estimation in Gaussian graphical models"}]