[{"year":"2012","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2012-0001","date_created":"2018-12-12T11:38:59Z","alternative_title":["IST Austria Technical Report"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"type":"technical_report","title":"Faster algorithms for alternating refinement relations","publication_status":"published","day":"04","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Siddhesh","full_name":"Chaubal, Siddhesh","last_name":"Chaubal"},{"last_name":"Kamath","full_name":"Kamath, Pritish","first_name":"Pritish"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n3 · m) time as compared to the previous known O(n6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n · m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm."}],"date_published":"2012-07-04T00:00:00Z","file":[{"date_updated":"2020-07-14T12:46:39Z","creator":"system","file_size":394256,"date_created":"2018-12-12T11:53:28Z","content_type":"application/pdf","checksum":"ec8d1857cc7095d3de5107a0162ced37","relation":"main_file","access_level":"open_access","file_id":"5489","file_name":"IST-2012-0001_IST-2012-0001.pdf"}],"date_updated":"2025-04-15T08:12:24Z","related_material":{"record":[{"id":"497","status":"public","relation":"later_version"}]},"oa":1,"ddc":["000","005"],"file_date_updated":"2020-07-14T12:46:39Z","department":[{"_id":"KrCh"}],"corr_author":"1","_id":"5378","status":"public","article_processing_charge":"No","page":"21","has_accepted_license":"1","citation":{"apa":"Chatterjee, K., Chaubal, S., &#38; Kamath, P. (2012). <i>Faster algorithms for alternating refinement relations</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">https://doi.org/10.15479/AT:IST-2012-0001</a>","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">10.15479/AT:IST-2012-0001</a>.","short":"K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.","ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">https://doi.org/10.15479/AT:IST-2012-0001</a>.","ama":"Chatterjee K, Chaubal S, Kamath P. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">10.15479/AT:IST-2012-0001</a>","ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, <i>Faster algorithms for alternating refinement relations</i>. IST Austria, 2012."},"pubrep_id":"14","publisher":"IST Austria","month":"07"},{"pubrep_id":"180","volume":7561,"quality_controlled":"1","citation":{"ieee":"A. Gupta, “Improved single pass algorithms for resolution proof reduction,” in <i>10th International Symposium on Automated Technology for Verification and Analysis</i>, Thiruvananthapuram, Kerala, India, 2012, vol. 7561, pp. 107–121.","chicago":"Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” In <i>10th International Symposium on Automated Technology for Verification and Analysis</i>, 7561:107–21. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">https://doi.org/10.1007/978-3-642-33386-6_10</a>.","ama":"Gupta A. Improved single pass algorithms for resolution proof reduction. In: <i>10th International Symposium on Automated Technology for Verification and Analysis</i>. Vol 7561. Springer Nature; 2012:107-121. doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">10.1007/978-3-642-33386-6_10</a>","ista":"Gupta A. 2012. Improved single pass algorithms for resolution proof reduction. 10th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561, 107–121.","short":"A. Gupta, in:, 10th International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2012, pp. 107–121.","mla":"Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” <i>10th International Symposium on Automated Technology for Verification and Analysis</i>, vol. 7561, Springer Nature, 2012, pp. 107–21, doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">10.1007/978-3-642-33386-6_10</a>.","apa":"Gupta, A. (2012). Improved single pass algorithms for resolution proof reduction. In <i>10th International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 7561, pp. 107–121). Thiruvananthapuram, Kerala, India: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">https://doi.org/10.1007/978-3-642-33386-6_10</a>"},"has_accepted_license":"1","page":"107-121","ec_funded":1,"article_processing_charge":"No","month":"09","OA_place":"repository","intvolume":"      7561","publisher":"Springer Nature","oa":1,"date_updated":"2025-04-15T07:56:27Z","status":"public","corr_author":"1","_id":"5745","scopus_import":"1","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:10Z","ddc":["005"],"oa_version":"Submitted Version","author":[{"full_name":"Gupta, Ashutosh","last_name":"Gupta","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"}],"day":"28","publication":"10th International Symposium on Automated Technology for Verification and Analysis","file":[{"checksum":"68415837a315de3cc4d120f6019d752c","file_id":"5746","file_name":"2012_ATVA_Gupta.pdf","access_level":"open_access","relation":"main_file","creator":"dernst","date_updated":"2020-07-14T12:47:10Z","date_created":"2018-12-18T13:07:35Z","content_type":"application/pdf","file_size":465502}],"date_published":"2012-09-28T00:00:00Z","abstract":[{"text":"Unsatisfiability proofs find many applications in verification. Today, many SAT solvers are capable of producing resolution proofs of unsatisfiability. For efficiency smaller proofs are preferred over bigger ones. The solvers apply proof reduction methods to remove redundant parts of the proofs while and after generating the proofs. One method of reducing resolution proofs is redundant resolution reduction, i.e., removing repeated pivots in the paths of resolution proofs (aka Pivot recycle). The known single pass algorithm only tries to remove redundancies in the parts of the proof that are trees. In this paper, we present three modifications to improve the algorithm such that the redundancies can be found in the parts of the proofs that are DAGs. The first modified algorithm covers greater number of redundancies as compared to the known algorithm without incurring any additional cost. The second modified algorithm covers even greater number of the redundancies but it may have longer run times. Our third modified algorithm is parametrized and can trade off between run times and the coverage of the redundancies. We have implemented our algorithms in OpenSMT and applied them on unsatisfiability proofs of 198 examples from plain MUS track of SAT11 competition. The first and second algorithm additionally remove 0.89% and 10.57% of clauses respectively as compared to the original algorithm. For certain value of the parameter, the third algorithm removes almost as many clauses as the second algorithm but is significantly faster.","lang":"eng"}],"conference":{"name":"ATVA: Automated Technology for Verification and Analysis","start_date":"2012-10-03","location":"Thiruvananthapuram, Kerala, India","end_date":"2012-10-06"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"date_created":"2018-12-18T13:01:46Z","acknowledgement":"This work was supported by the ERC Advanced Investigator grant on Quantitative\r\nReactive Modeling (QUAREM).","doi":"10.1007/978-3-642-33386-6_10","year":"2012","publication_identifier":{"eisbn":["9783642333866"],"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783642333859"]},"publication_status":"published","type":"conference","title":"Improved single pass algorithms for resolution proof reduction","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"language":[{"iso":"eng"}]},{"page":"2886 - 2897","author":[{"first_name":"Stefano","full_name":"Bencivenga, Stefano","last_name":"Bencivenga"},{"first_name":"Sara","last_name":"Simonini","full_name":"Simonini, Sara"},{"orcid":"0000-0002-8510-9739","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Eva Benková","last_name":"Benková"},{"first_name":"Lucia","last_name":"Colombo","full_name":"Colombo, Lucia"}],"day":"01","volume":24,"quality_controlled":0,"citation":{"ista":"Bencivenga S, Simonini S, Benková E, Colombo L. 2012. The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis. Plant Cell. 24(7), 2886–2897.","short":"S. Bencivenga, S. Simonini, E. Benková, L. Colombo, Plant Cell 24 (2012) 2886–2897.","mla":"Bencivenga, Stefano, et al. “The Transcription Factors BEL1 and SPL Are Required for Cytokinin and Auxin Signaling during Ovule Development in Arabidopsis.” <i>Plant Cell</i>, vol. 24, no. 7, American Society of Plant Biologists, 2012, pp. 2886–97, doi:<a href=\"https://doi.org/10.1105/tpc.112.100164\">10.1105/tpc.112.100164</a>.","apa":"Bencivenga, S., Simonini, S., Benková, E., &#38; Colombo, L. (2012). The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.112.100164\">https://doi.org/10.1105/tpc.112.100164</a>","ieee":"S. Bencivenga, S. Simonini, E. Benková, and L. Colombo, “The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis,” <i>Plant Cell</i>, vol. 24, no. 7. American Society of Plant Biologists, pp. 2886–2897, 2012.","chicago":"Bencivenga, Stefano, Sara Simonini, Eva Benková, and Lucia Colombo. “The Transcription Factors BEL1 and SPL Are Required for Cytokinin and Auxin Signaling during Ovule Development in Arabidopsis.” <i>Plant Cell</i>. American Society of Plant Biologists, 2012. <a href=\"https://doi.org/10.1105/tpc.112.100164\">https://doi.org/10.1105/tpc.112.100164</a>.","ama":"Bencivenga S, Simonini S, Benková E, Colombo L. The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis. <i>Plant Cell</i>. 2012;24(7):2886-2897. doi:<a href=\"https://doi.org/10.1105/tpc.112.100164\">10.1105/tpc.112.100164</a>"},"issue":"7","intvolume":"        24","publisher":"American Society of Plant Biologists","abstract":[{"lang":"eng","text":"Hormones, such as auxin and cytokinin, are involved in the complex molecular network that regulates the coordinated development of plant organs. Genes controlling ovule patterning have been identified and studied in detail; however, the roles of auxin and cytokinin in ovule development are largely unknown. Here we show that key cytokinin pathway genes, such as isopentenyltransferase and cytokinin receptors, are expressed during ovule development. Also, in a cre1-12 ahk2-2 ahk3-3 triple mutant with severely reduced cytokinin perception, expression of the auxin efflux facilitator PIN-FORMED 1 (PIN1) was severely reduced. In sporocyteless/nozzle (spl/nzz) mutants, which show a similar phenotype to the cre1-12 ahk2-2 ahk3-3 triple mutant, PIN1 expression is also reduced. Treatment with the exogenous cytokinin N6-benzylaminopurine also altered both auxin distribution and patterning of the ovule; this process required the homeodomain transcription factor BELL1 (BEL1). Thus, this article shows that cytokinin regulates ovule development through the regulation of PIN1. Furthermore, the transcription factors BEL1 and SPL/NZZ, previously described as key regulators of ovule development, are needed for the auxin and cytokinin signaling pathways for the correct patterning of the ovule."}],"publication":"Plant Cell","month":"07","extern":1,"date_published":"2012-07-01T00:00:00Z","doi":"10.1105/tpc.112.100164","date_updated":"2021-01-12T07:00:26Z","year":"2012","publist_id":"3885","date_created":"2018-12-11T12:00:06Z","type":"journal_article","title":"The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis","publication_status":"published","status":"public","_id":"2879"},{"date_created":"2018-12-11T12:00:09Z","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"MODELS: Model-driven Engineering Languages and Systems","start_date":"2012-09-30","location":"Innsbruck, Austria","end_date":"2012-10-05"},"year":"2012","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642336669"]},"doi":"10.1007/978-3-642-33666-9_1","publication_status":"published","language":[{"iso":"eng"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"type":"conference","title":"Quantitative reactive models","oa_version":"None","day":"01","author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2012-09-01T00:00:00Z","publication":"15th International Conference on Model Driven Engineering Languages and Systems","abstract":[{"text":"Formal verification aims to improve the quality of hardware and software by detecting errors before they do harm. At the basis of formal verification lies the logical notion of correctness, which purports to capture whether or not a circuit or program behaves as desired. We suggest that the boolean partition into correct and incorrect systems falls short of the practical need to assess the behavior of hardware and software in a more nuanced fashion against multiple criteria.","lang":"eng"}],"publist_id":"3870","date_updated":"2025-05-20T07:30:56Z","_id":"2888","corr_author":"1","status":"public","department":[{"_id":"ToHe"}],"scopus_import":"1","citation":{"ieee":"T. A. Henzinger, “Quantitative reactive models,” in <i>15th International Conference on Model Driven Engineering Languages and Systems</i>, Innsbruck, Austria, 2012, vol. 7590, pp. 1–2.","chicago":"Henzinger, Thomas A. “Quantitative Reactive Models.” In <i>15th International Conference on Model Driven Engineering Languages and Systems</i>, 7590:1–2. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">https://doi.org/10.1007/978-3-642-33666-9_1</a>.","ama":"Henzinger TA. Quantitative reactive models. In: <i>15th International Conference on Model Driven Engineering Languages and Systems</i>. Vol 7590. Springer; 2012:1-2. doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">10.1007/978-3-642-33666-9_1</a>","ista":"Henzinger TA. 2012. Quantitative reactive models. 15th International Conference on Model Driven Engineering Languages and Systems. MODELS: Model-driven Engineering Languages and Systems, LNCS, vol. 7590, 1–2.","short":"T.A. Henzinger, in:, 15th International Conference on Model Driven Engineering Languages and Systems, Springer, 2012, pp. 1–2.","mla":"Henzinger, Thomas A. “Quantitative Reactive Models.” <i>15th International Conference on Model Driven Engineering Languages and Systems</i>, vol. 7590, Springer, 2012, pp. 1–2, doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">10.1007/978-3-642-33666-9_1</a>.","apa":"Henzinger, T. A. (2012). Quantitative reactive models. In <i>15th International Conference on Model Driven Engineering Languages and Systems</i> (Vol. 7590, pp. 1–2). Innsbruck, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">https://doi.org/10.1007/978-3-642-33666-9_1</a>"},"OA_type":"closed access","volume":7590,"quality_controlled":"1","article_processing_charge":"No","ec_funded":1,"page":"1 - 2","month":"09","publisher":"Springer","intvolume":"      7590"},{"date_published":"2012-04-01T00:00:00Z","external_id":{"arxiv":["1309.5469"]},"abstract":[{"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","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.5469"}],"author":[{"first_name":"Anna","last_name":"Huber","full_name":"Huber, Anna"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"day":"01","publication_status":"published","title":"Towards minimizing k-submodular functions","type":"conference","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Athens, Greece","name":"ISCO: International Symposium on Combinatorial Optimization","start_date":"2012-04-19","end_date":"2012-04-21"},"date_created":"2018-12-11T12:00:24Z","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-32147-4_40","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","year":"2012","month":"04","intvolume":"      7422","publisher":"Springer","volume":7422,"quality_controlled":"1","citation":{"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>.","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>","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.","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>","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>.","short":"A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.","ista":"Huber A, Kolmogorov V. 2012. Towards minimizing k-submodular functions. ISCO: International Symposium on Combinatorial Optimization, LNCS, vol. 7422, 451–462."},"page":"451 - 462","article_processing_charge":"No","status":"public","_id":"2930","arxiv":1,"scopus_import":"1","department":[{"_id":"VlKo"}],"publist_id":"3806","oa":1,"date_updated":"2025-06-11T08:08:15Z"},{"date_published":"2012-09-16T00:00:00Z","publication":" Conference proceedings Monterey Workshop 2012","abstract":[{"text":"Interface theories provide a formal framework for component-based development of software and hardware which supports the incremental design of systems and the independent implementability of components. These capabilities are ensured through mathematical properties of the parallel composition operator and the refinement relation for components. More recently, a conjunction operation was added to interface theories in order to provide support for handling multiple viewpoints, requirements engineering, and component reuse. Unfortunately, the conjunction operator does not allow independent implementability in general. In this paper, we study conditions that need to be imposed on interface models in order to enforce independent implementability with respect to conjunction. We focus on multiple viewpoint specifications and propose a new compatibility criterion between two interfaces, which we call orthogonality. We show that orthogonal interfaces can be refined separately, while preserving both orthogonality and composability with other interfaces. We illustrate the independent implementability of different viewpoints with a FIFO buffer example.","lang":"eng"}],"oa_version":"None","day":"16","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"}],"publication_status":"published","language":[{"iso":"eng"}],"title":"Independent implementability of viewpoints","type":"conference","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"alternative_title":["LNCS"],"date_created":"2018-12-11T12:00:28Z","conference":{"location":"Oxford, UK","start_date":"2012-03-19","name":"Monterey Workshop 2012","end_date":"2012-03-21"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2012","doi":"10.1007/978-3-642-34059-8_20","acknowledgement":"ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), FWF National Research Network RISE (Rigorous Systems Engineering)","month":"09","publisher":"Springer","intvolume":"      7539","citation":{"ieee":"T. A. Henzinger and D. Nickovic, “Independent implementability of viewpoints,” in <i> Conference proceedings Monterey Workshop 2012</i>, Oxford, UK, 2012, vol. 7539, pp. 380–395.","ama":"Henzinger TA, Nickovic D. Independent implementability of viewpoints. In: <i> Conference Proceedings Monterey Workshop 2012</i>. Vol 7539. Springer; 2012:380-395. doi:<a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">10.1007/978-3-642-34059-8_20</a>","chicago":"Henzinger, Thomas A, and Dejan Nickovic. “Independent Implementability of Viewpoints.” In <i> Conference Proceedings Monterey Workshop 2012</i>, 7539:380–95. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">https://doi.org/10.1007/978-3-642-34059-8_20</a>.","short":"T.A. Henzinger, D. Nickovic, in:,  Conference Proceedings Monterey Workshop 2012, Springer, 2012, pp. 380–395.","ista":"Henzinger TA, Nickovic D. 2012. Independent implementability of viewpoints.  Conference proceedings Monterey Workshop 2012. Monterey Workshop 2012, LNCS, vol. 7539, 380–395.","mla":"Henzinger, Thomas A., and Dejan Nickovic. “Independent Implementability of Viewpoints.” <i> Conference Proceedings Monterey Workshop 2012</i>, vol. 7539, Springer, 2012, pp. 380–95, doi:<a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">10.1007/978-3-642-34059-8_20</a>.","apa":"Henzinger, T. A., &#38; Nickovic, D. (2012). Independent implementability of viewpoints. In <i> Conference proceedings Monterey Workshop 2012</i> (Vol. 7539, pp. 380–395). Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">https://doi.org/10.1007/978-3-642-34059-8_20</a>"},"quality_controlled":"1","volume":7539,"ec_funded":1,"page":"380 - 395","_id":"2942","status":"public","department":[{"_id":"ToHe"}],"scopus_import":1,"publist_id":"3791","date_updated":"2021-01-12T07:39:56Z"},{"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.","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>","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>.","short":"A. Dueck, C. Ziegler, A. Eichner, E. Berezikov, G. Meister, Nucleic Acids Research 40 (2012) 9850–9862.","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.","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>","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>."},"has_accepted_license":"1","quality_controlled":"1","pubrep_id":"383","volume":40,"tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"article_processing_charge":"No","page":"9850 - 9862","month":"10","publisher":"Oxford University Press","intvolume":"        40","oa":1,"publist_id":"3786","date_updated":"2025-09-30T08:12:07Z","_id":"2946","corr_author":"1","status":"public","department":[{"_id":"MiSi"}],"file_date_updated":"2020-07-14T12:45:55Z","ddc":["570"],"scopus_import":"1","issue":"19","oa_version":"Published Version","day":"01","author":[{"first_name":"Anne","last_name":"Dueck","full_name":"Dueck, Anne"},{"full_name":"Ziegler, Christian","last_name":"Ziegler","first_name":"Christian"},{"full_name":"Eichner, Alexander","last_name":"Eichner","first_name":"Alexander","id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Berezikov, Eugène","last_name":"Berezikov","first_name":"Eugène"},{"last_name":"Meister","full_name":"Meister, Gunter","first_name":"Gunter"}],"date_published":"2012-10-01T00:00:00Z","external_id":{"isi":["000310377200046"]},"file":[{"date_updated":"2020-07-14T12:45:55Z","creator":"system","file_size":8126936,"content_type":"application/pdf","date_created":"2018-12-12T10:13:12Z","checksum":"1bb8d1ff894014b481657a21083c941c","access_level":"open_access","relation":"main_file","file_name":"IST-2015-383-v1+1_Nucl._Acids_Res.-2012-Dueck-9850-62.pdf","file_id":"4993"}],"publication":"Nucleic Acids Research","abstract":[{"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.","lang":"eng"}],"date_created":"2018-12-11T12:00:29Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2012","doi":"10.1093/nar/gks705","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.","publication_status":"published","language":[{"iso":"eng"}],"isi":1,"title":"MicroRNAs associated with the different human Argonaute proteins","type":"journal_article"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Thiruvananthapuram, India","name":"ATVA: Automated Technology for Verification and Analysis","start_date":"2012-10-03","end_date":"2012-10-06"},"date_created":"2018-12-11T12:00:29Z","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-33386-6_30","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.","year":"2012","publication_status":"published","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"title":"Equivalence of games with probabilistic uncertainty and partial observation games","type":"conference","language":[{"iso":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"http://arxiv.org/abs/1202.4140","open_access":"1"}],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik","full_name":"Chmelik, Martin"},{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"}],"day":"01","date_published":"2012-06-01T00:00:00Z","external_id":{"arxiv":["1202.4140"]},"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."}],"publist_id":"3785","oa":1,"date_updated":"2025-07-10T11:52:24Z","status":"public","_id":"2947","arxiv":1,"scopus_import":"1","department":[{"_id":"KrCh"}],"quality_controlled":"1","volume":7561,"citation":{"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.","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>","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.","short":"K. Chatterjee, M. Chmelik, R. Majumdar, in:, Springer, 2012, pp. 385–399.","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>.","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>"},"page":"385 - 399","article_processing_charge":"No","ec_funded":1,"month":"06","intvolume":"      7561","publisher":"Springer"},{"publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","external_id":{"arxiv":["1107.2141"],"isi":["000309059900023"]},"date_published":"2012-08-23T00:00:00Z","abstract":[{"text":"We consider two-player stochastic games played on finite graphs with reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1), or positively (i.e., with positive probability), no matter the strategy of the second player. We classify such games according to the information and the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two-sided with (c) both players having partial observation. On the basis of randomization, the players (a) may not be allowed to use randomization (pure strategies), or (b) may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) may use full randomization. Our main results for pure strategies are as follows. (1) For one-sided games with player 1 having partial observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strategies are not sufficient, and we present an exponential upper bound on memory both for almostsure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete. (2) For one-sided games with player 2 having partial observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and positive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence result exhibits serious flaws in previous results of the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2141"}],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"day":"23","publication_status":"published","type":"conference","title":"Partial-observation stochastic games: How to win when belief fails","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"isi":1,"language":[{"iso":"eng"}],"conference":{"name":"LICS: Logic in Computer Science","start_date":"2012-06-25","location":"Dubrovnik, Croatia","end_date":"2012-06-28"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T12:00:32Z","doi":"10.1109/LICS.2012.28","acknowledgement":"This work was partially supported by FWF Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","year":"2012","article_number":"6280436","month":"08","publisher":"IEEE","quality_controlled":"1","citation":{"ieee":"K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” in <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Dubrovnik, Croatia, 2012.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” 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.28\">https://doi.org/10.1109/LICS.2012.28</a>.","ama":"Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when belief fails. 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.28\">10.1109/LICS.2012.28</a>","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","ista":"Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 6280436, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.28\">10.1109/LICS.2012.28</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2012). Partial-observation stochastic games: How to win when belief fails. 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.28\">https://doi.org/10.1109/LICS.2012.28</a>"},"article_processing_charge":"No","ec_funded":1,"status":"public","_id":"2955","scopus_import":"1","arxiv":1,"department":[{"_id":"KrCh"}],"publist_id":"3771","oa":1,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5381"},{"relation":"later_version","status":"public","id":"2211"}]},"date_updated":"2025-09-30T08:08:45Z"},{"type":"conference","title":"Mean payoff pushdown games","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"language":[{"iso":"eng"}],"isi":1,"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.","doi":"10.1109/LICS.2012.30","article_number":"6280438","year":"2012","conference":{"name":"LICS: Logic in Computer Science","start_date":"2012-06-25","location":"Dubrovnik, Croatia ","end_date":"2012-06-28"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T12:00:32Z","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"}],"publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","external_id":{"arxiv":["1201.2829"],"isi":["000309059900025"]},"date_published":"2012-08-23T00:00:00Z","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Velner","full_name":"Velner, Yaron","first_name":"Yaron"}],"day":"23","oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1201.2829","open_access":"1"}],"scopus_import":"1","arxiv":1,"department":[{"_id":"KrCh"}],"status":"public","_id":"2956","date_updated":"2025-09-30T08:08:13Z","publist_id":"3770","oa":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5377"}]},"publisher":"IEEE","month":"08","OA_place":"repository","article_processing_charge":"No","ec_funded":1,"OA_type":"green","quality_controlled":"1","citation":{"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>","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.","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>.","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>"}},{"department":[{"_id":"NiBa"}],"scopus_import":"1","corr_author":"1","_id":"2962","status":"public","date_updated":"2025-09-30T08:06:06Z","oa":1,"publist_id":"3763","publisher":"Genetics Society of America","intvolume":"       192","month":"11","acknowledged_ssus":[{"_id":"ScienComp"}],"article_processing_charge":"No","page":"1027 - 1047","citation":{"ama":"Aeschbacher S, Beaumont M, Futschik A. A novel approach for choosing summary statistics in approximate Bayesian computation. <i>Genetics</i>. 2012;192(3):1027-1047. doi:<a href=\"https://doi.org/10.1534/genetics.112.143164\">10.1534/genetics.112.143164</a>","chicago":"Aeschbacher, Simon, Mark Beaumont, and Andreas Futschik. “A Novel Approach for Choosing Summary Statistics in Approximate Bayesian Computation.” <i>Genetics</i>. Genetics Society of America, 2012. <a href=\"https://doi.org/10.1534/genetics.112.143164\">https://doi.org/10.1534/genetics.112.143164</a>.","ieee":"S. Aeschbacher, M. Beaumont, and A. Futschik, “A novel approach for choosing summary statistics in approximate Bayesian computation,” <i>Genetics</i>, vol. 192, no. 3. Genetics Society of America, pp. 1027–1047, 2012.","mla":"Aeschbacher, Simon, et al. “A Novel Approach for Choosing Summary Statistics in Approximate Bayesian Computation.” <i>Genetics</i>, vol. 192, no. 3, Genetics Society of America, 2012, pp. 1027–47, doi:<a href=\"https://doi.org/10.1534/genetics.112.143164\">10.1534/genetics.112.143164</a>.","apa":"Aeschbacher, S., Beaumont, M., &#38; Futschik, A. (2012). A novel approach for choosing summary statistics in approximate Bayesian computation. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.112.143164\">https://doi.org/10.1534/genetics.112.143164</a>","ista":"Aeschbacher S, Beaumont M, Futschik A. 2012. A novel approach for choosing summary statistics in approximate Bayesian computation. Genetics. 192(3), 1027–1047.","short":"S. Aeschbacher, M. Beaumont, A. Futschik, Genetics 192 (2012) 1027–1047."},"quality_controlled":"1","volume":192,"isi":1,"language":[{"iso":"eng"}],"title":"A novel approach for choosing summary statistics in approximate Bayesian computation","type":"journal_article","publication_status":"published","year":"2012","doi":"10.1534/genetics.112.143164","date_created":"2018-12-11T12:00:34Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"The choice of summary statistics is a crucial step in approximate Bayesian computation (ABC). Since statistics are often not sufficient, this choice involves a trade-off between loss of information and reduction of dimensionality. The latter may increase the efficiency of ABC. Here, we propose an approach for choosing summary statistics based on boosting, a technique from the machine learning literature. We consider different types of boosting and compare them to partial least squares regression as an alternative. To mitigate the lack of sufficiency, we also propose an approach for choosing summary statistics locally, in the putative neighborhood of the true parameter value. We study a demographic model motivated by the re-introduction of Alpine ibex (Capra ibex) into the Swiss Alps. The parameters of interest are the mean and standard deviation across microsatellites of the scaled ancestral mutation rate (θanc = 4 Ne u), and the proportion of males obtaining access to matings per breeding season (ω). By simulation, we assess the properties of the posterior distribution obtained with the various methods. According to our criteria, ABC with summary statistics chosen locally via boosting with the L2-loss performs best. Applying that method to the ibex data, we estimate θanc ≈ 1.288, and find that most of the variation across loci of the ancestral mutation rate u is between 7.7×10−4 and 3.5×10−3 per locus per generation. The proportion of males with access to matings is estimated to ω ≈ 0.21, which is in good agreement with recent independent estimates.","lang":"eng"}],"date_published":"2012-11-01T00:00:00Z","external_id":{"pmid":["22960215"],"isi":["000310793900018"]},"publication":"Genetics","day":"01","author":[{"first_name":"Simon","id":"2D35326E-F248-11E8-B48F-1D18A9856A87","full_name":"Aeschbacher, Simon","last_name":"Aeschbacher"},{"first_name":"Mark","last_name":"Beaumont","full_name":"Beaumont, Mark"},{"first_name":"Andreas","last_name":"Futschik","full_name":"Futschik, Andreas"}],"issue":"3","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3522150/","open_access":"1"}],"oa_version":"Submitted Version","pmid":1},{"citation":{"ieee":"G. Zankl, Y. Haxhimusa, and A. Ion, “Interactive labeling of image segmentation hierarchies,” in <i>34th DAGM and 36th OAGM Symposium</i>, Graz, Austria, 2012, vol. 7476, pp. 11–20.","chicago":"Zankl, Georg, Yll Haxhimusa, and Adrian Ion. “Interactive Labeling of Image Segmentation Hierarchies.” In <i>34th DAGM and 36th OAGM Symposium</i>, 7476:11–20. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">https://doi.org/10.1007/978-3-642-32717-9_2</a>.","ama":"Zankl G, Haxhimusa Y, Ion A. Interactive labeling of image segmentation hierarchies. In: <i>34th DAGM and 36th OAGM Symposium</i>. Vol 7476. Springer; 2012:11-20. doi:<a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">10.1007/978-3-642-32717-9_2</a>","ista":"Zankl G, Haxhimusa Y, Ion A. 2012. Interactive labeling of image segmentation hierarchies. 34th DAGM and 36th OAGM Symposium. Pattern Recognition, LNCS, vol. 7476, 11–20.","short":"G. Zankl, Y. Haxhimusa, A. Ion, in:, 34th DAGM and 36th OAGM Symposium, Springer, 2012, pp. 11–20.","mla":"Zankl, Georg, et al. “Interactive Labeling of Image Segmentation Hierarchies.” <i>34th DAGM and 36th OAGM Symposium</i>, vol. 7476, Springer, 2012, pp. 11–20, doi:<a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">10.1007/978-3-642-32717-9_2</a>.","apa":"Zankl, G., Haxhimusa, Y., &#38; Ion, A. (2012). Interactive labeling of image segmentation hierarchies. In <i>34th DAGM and 36th OAGM Symposium</i> (Vol. 7476, pp. 11–20). Graz, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">https://doi.org/10.1007/978-3-642-32717-9_2</a>"},"volume":7476,"OA_type":"closed access","quality_controlled":"1","article_processing_charge":"No","page":"11 - 20","month":"08","publisher":"Springer","intvolume":"      7476","publist_id":"3737","date_updated":"2025-05-20T07:21:42Z","_id":"2971","status":"public","department":[{"_id":"HeEd"}],"scopus_import":"1","oa_version":"None","day":"01","author":[{"first_name":"Georg","full_name":"Zankl, Georg","last_name":"Zankl"},{"first_name":"Yll","last_name":"Haxhimusa","full_name":"Haxhimusa, Yll"},{"last_name":"Ion","full_name":"Ion, Adrian","id":"29F89302-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian"}],"date_published":"2012-08-01T00:00:00Z","publication":"34th DAGM and 36th OAGM Symposium","abstract":[{"lang":"eng","text":"We study the task of interactive semantic labeling of a segmentation hierarchy. To this end we propose a framework interleaving two components: an automatic labeling step, based on a Conditional Random Field whose dependencies are defined by the inclusion tree of the segmentation hierarchy, and an interaction step that integrates incremental input from a human user. Evaluated on two distinct datasets, the proposed interactive approach efficiently integrates human interventions and illustrates the advantages of structured prediction in an interactive framework. "}],"alternative_title":["LNCS"],"date_created":"2018-12-11T12:00:37Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Graz, Austria","start_date":"2012-08-28","name":"Pattern Recognition","end_date":"2012-08-31"},"year":"2012","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642327179"]},"doi":"10.1007/978-3-642-32717-9_2","publication_status":"published","language":[{"iso":"eng"}],"title":"Interactive labeling of image segmentation hierarchies","type":"conference"},{"author":[{"full_name":"Jain, Abhishek","last_name":"Jain","first_name":"Abhishek"},{"full_name":"Krenn, Stephan","last_name":"Krenn","first_name":"Stephan","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2835-9093"},{"last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"},{"last_name":"Tentes","full_name":"Tentes, Aris","first_name":"Aris"}],"day":"01","oa_version":"Submitted Version","abstract":[{"text":"We construct a perfectly binding string commitment scheme whose security is based on the learning parity with noise (LPN) assumption, or equivalently, the hardness of decoding random linear codes. Our scheme not only allows for a simple and efficient zero-knowledge proof of knowledge for committed values (essentially a Σ-protocol), but also for such proofs showing any kind of relation amongst committed values, i.e. proving that messages m_0,...,m_u, are such that m_0=C(m_1,...,m_u) for any circuit C.\r\n\r\nTo get soundness which is exponentially small in a security parameter t, and when the zero-knowledge property relies on the LPN problem with secrets of length l, our 3 round protocol has communication complexity O(t|C|l log(l)) and computational complexity of O(t|C|l) bit operations. The hidden constants are small, and the computation consists mostly of computing inner products of bit-vectors.","lang":"eng"}],"date_published":"2012-12-01T00:00:00Z","file":[{"checksum":"ab879537385efc4cb4203e7ef0fea17b","relation":"main_file","access_level":"open_access","file_name":"IST-2016-721-v1+1_513.pdf","file_id":"5048","date_updated":"2020-07-14T12:45:58Z","creator":"system","file_size":482570,"date_created":"2018-12-12T10:14:00Z","content_type":"application/pdf"}],"doi":"10.1007/978-3-642-34961-4_40","acknowledgement":"We are grateful to Petros Mol for helpful discussions on the reduction for the hardness of the xLPN problem.\r\n","year":"2012","editor":[{"first_name":"Xiaoyun","last_name":"Wang","full_name":"Wang, Xiaoyun"},{"last_name":"Sako","full_name":"Sako, Kazue","first_name":"Kazue"}],"conference":{"end_date":"2012-12-06","location":"Beijing, China","name":"ASIACRYPT: Theory and Application of Cryptology and Information Security","start_date":"2012-12-02"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"date_created":"2018-12-11T12:00:38Z","license":"https://creativecommons.org/licenses/by/4.0/","type":"conference","title":"Commitments and efficient zero knowledge proofs from learning parity with noise","project":[{"call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"publication_status":"published","page":"663 - 680","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"ec_funded":1,"pubrep_id":"721","volume":7658,"citation":{"mla":"Jain, Abhishek, et al. <i>Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise</i>. Edited by Xiaoyun Wang and Kazue Sako, vol. 7658, Springer, 2012, pp. 663–80, doi:<a href=\"https://doi.org/10.1007/978-3-642-34961-4_40\">10.1007/978-3-642-34961-4_40</a>.","apa":"Jain, A., Krenn, S., Pietrzak, K. Z., &#38; Tentes, A. (2012). Commitments and efficient zero knowledge proofs from learning parity with noise. In X. Wang &#38; K. Sako (Eds.) (Vol. 7658, pp. 663–680). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-642-34961-4_40\">https://doi.org/10.1007/978-3-642-34961-4_40</a>","short":"A. Jain, S. Krenn, K.Z. Pietrzak, A. Tentes, in:, X. Wang, K. Sako (Eds.), Springer, 2012, pp. 663–680.","ista":"Jain A, Krenn S, Pietrzak KZ, Tentes A. 2012. Commitments and efficient zero knowledge proofs from learning parity with noise. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 7658, 663–680.","ama":"Jain A, Krenn S, Pietrzak KZ, Tentes A. Commitments and efficient zero knowledge proofs from learning parity with noise. In: Wang X, Sako K, eds. Vol 7658. Springer; 2012:663-680. doi:<a href=\"https://doi.org/10.1007/978-3-642-34961-4_40\">10.1007/978-3-642-34961-4_40</a>","chicago":"Jain, Abhishek, Stephan Krenn, Krzysztof Z Pietrzak, and Aris Tentes. “Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise.” edited by Xiaoyun Wang and Kazue Sako, 7658:663–80. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34961-4_40\">https://doi.org/10.1007/978-3-642-34961-4_40</a>.","ieee":"A. Jain, S. Krenn, K. Z. Pietrzak, and A. Tentes, “Commitments and efficient zero knowledge proofs from learning parity with noise,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Beijing, China, 2012, vol. 7658, pp. 663–680."},"has_accepted_license":"1","intvolume":"      7658","publisher":"Springer","month":"12","date_updated":"2021-01-12T07:40:11Z","publist_id":"3730","oa":1,"scopus_import":1,"file_date_updated":"2020-07-14T12:45:58Z","department":[{"_id":"KrPi"}],"ddc":["004","005"],"status":"public","_id":"2974"},{"day":"03","author":[{"first_name":"Elke","last_name":"Barbez","full_name":"Barbez, Elke"},{"last_name":"Kubeš","full_name":"Kubeš, Martin","first_name":"Martin"},{"first_name":"Jakub","full_name":"Rolčík, Jakub","last_name":"Rolčík"},{"full_name":"Béziat, Chloe","last_name":"Béziat","first_name":"Chloe"},{"last_name":"Pěnčík","full_name":"Pěnčík, Aleš","first_name":"Aleš"},{"full_name":"Wang, Bangjun","last_name":"Wang","first_name":"Bangjun"},{"last_name":"Rosquete","full_name":"Rosquete, Michel Ruiz","first_name":"Michel"},{"full_name":"Zhu, Jinsheng","last_name":"Zhu","first_name":"Jinsheng"},{"first_name":"Petre","last_name":"Dobrev","full_name":"Dobrev, Petre I"},{"full_name":"Lee, Yuree","last_name":"Lee","first_name":"Yuree"},{"first_name":"Eva","last_name":"Zašímalová","full_name":"Zašímalová, Eva"},{"full_name":"Petrášek, Jan","last_name":"Petrášek","first_name":"Jan"},{"first_name":"Markus","last_name":"Geisler","full_name":"Geisler, Markus"},{"full_name":"Jirí Friml","last_name":"Friml","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"},{"first_name":"Jürgen","full_name":"Kleine-Vehn, Jürgen","last_name":"Kleine Vehn"}],"page":"119 - 122","issue":"7396","citation":{"ieee":"E. Barbez <i>et al.</i>, “A novel putative auxin carrier family regulates intracellular auxin homeostasis in plants,” <i>Nature</i>, vol. 485, no. 7396. Nature Publishing Group, pp. 119–122, 2012.","chicago":"Barbez, Elke, Martin Kubeš, Jakub Rolčík, Chloe Béziat, Aleš Pěnčík, Bangjun Wang, Michel Rosquete, et al. “A Novel Putative Auxin Carrier Family Regulates Intracellular Auxin Homeostasis in Plants.” <i>Nature</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nature11001\">https://doi.org/10.1038/nature11001</a>.","ama":"Barbez E, Kubeš M, Rolčík J, et al. A novel putative auxin carrier family regulates intracellular auxin homeostasis in plants. <i>Nature</i>. 2012;485(7396):119-122. doi:<a href=\"https://doi.org/10.1038/nature11001\">10.1038/nature11001</a>","short":"E. Barbez, M. Kubeš, J. Rolčík, C. Béziat, A. Pěnčík, B. Wang, M. Rosquete, J. Zhu, P. Dobrev, Y. Lee, E. Zašímalová, J. Petrášek, M. Geisler, J. Friml, J. Kleine Vehn, Nature 485 (2012) 119–122.","ista":"Barbez E, Kubeš M, Rolčík J, Béziat C, Pěnčík A, Wang B, Rosquete M, Zhu J, Dobrev P, Lee Y, Zašímalová E, Petrášek J, Geisler M, Friml J, Kleine Vehn J. 2012. A novel putative auxin carrier family regulates intracellular auxin homeostasis in plants. Nature. 485(7396), 119–122.","mla":"Barbez, Elke, et al. “A Novel Putative Auxin Carrier Family Regulates Intracellular Auxin Homeostasis in Plants.” <i>Nature</i>, vol. 485, no. 7396, Nature Publishing Group, 2012, pp. 119–22, doi:<a href=\"https://doi.org/10.1038/nature11001\">10.1038/nature11001</a>.","apa":"Barbez, E., Kubeš, M., Rolčík, J., Béziat, C., Pěnčík, A., Wang, B., … Kleine Vehn, J. (2012). A novel putative auxin carrier family regulates intracellular auxin homeostasis in plants. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature11001\">https://doi.org/10.1038/nature11001</a>"},"quality_controlled":0,"volume":485,"abstract":[{"lang":"eng","text":"The phytohormone auxin acts as a prominent signal, providing, by its local accumulation or depletion in selected cells, a spatial and temporal reference for changes in the developmental program. The distribution of auxin depends on both auxin metabolism (biosynthesis, conjugation and degradation) and cellular auxin transport. We identified in silico a novel putative auxin transport facilitator family, called PIN-LIKES (PILS). Here we illustrate that PILS proteins are required for auxin-dependent regulation of plant growth by determining the cellular sensitivity to auxin. PILS proteins regulate intracellular auxin accumulation at the endoplasmic reticulum and thus auxin availability for nuclear auxin signalling. PILS activity affects the level of endogenous auxin indole-3-acetic acid (IAA), presumably via intracellular accumulation and metabolism. Our findings reveal that the transport machinery to compartmentalize auxin within the cell is of an unexpected molecular complexity and demonstrate this compartmentalization to be functionally important for a number of developmental processes."}],"publisher":"Nature Publishing Group","intvolume":"       485","date_published":"2012-05-03T00:00:00Z","extern":1,"publication":"Nature","month":"05","year":"2012","date_updated":"2021-01-12T07:41:07Z","doi":"10.1038/nature11001","date_created":"2018-12-11T12:01:26Z","publist_id":"3591","type":"journal_article","title":"A novel putative auxin carrier family regulates intracellular auxin homeostasis in plants","_id":"3108","status":"public","publication_status":"published"},{"intvolume":"        24","abstract":[{"text":"The directional transport of the phytohormone auxin depends on the phosphorylation status and polar localization of PIN-FORMED (PIN) auxin efflux proteins. While PINIOD (PID) kinase is directly involved in the phosphorylation of PIN proteins, the phosphatase holoenzyme complexes that dephosphorylate PIN proteins remain elusive. Here, we demonstrate that mutations simultaneously disrupting the function of Arabidopsis thaliana FyPP1 (for Phytochrome-associated serine/threonine protein phosphatase1) and FyPP3, two homologous genes encoding the catalytic subunits of protein phosphatase6 (PP6), cause elevated accumulation of phosphorylated PIN proteins, correlating with a basal-to-apical shift in subcellular PIN localization. The changes in PIN polarity result in increased root basipetal auxin transport and severe defects, including shorter roots, fewer lateral roots, defective columella cells, root meristem collapse, abnormal cotyledons (small, cup-shaped, or fused cotyledons), and altered leaf venation. Our molecular, biochemical, and genetic data support the notion that FyPP1/3, SAL (for SAPS DOMAIN-LIKE), and PP2AA proteins (RCN1 [for ROOTS CURL IN NAPHTHYLPHTHALAMIC ACID1] or PP2AA1, PP2AA2, and PP2AA3) physically interact to form a novel PP6-type heterotrimeric holoenzyme complex. We also show that FyPP1/3, SAL, and PP2AA interact with a subset of PIN proteins and that for SAL the strength of the interaction depends on the PIN phosphorylation status. Thus, an Arabidopsis PP6-type phosphatase holoenzyme acts antagonistically with PID to direct auxin transport polarity and plant development by directly regulating PIN phosphorylation. ","lang":"eng"}],"publisher":"American Society of Plant Biologists","month":"06","publication":"Plant Cell","date_published":"2012-06-01T00:00:00Z","extern":1,"author":[{"last_name":"Dai","full_name":"Dai, Mingqiu","first_name":"Mingqiu"},{"last_name":"Zhang","full_name":"Zhang, Chen","first_name":"Chen"},{"last_name":"Kania","full_name":"Urszula Kania","id":"4AE5C486-F248-11E8-B48F-1D18A9856A87","first_name":"Urszula"},{"first_name":"Fang","last_name":"Chen","full_name":"Chen, Fang"},{"first_name":"Qin","last_name":"Xue","full_name":"Xue, Qin"},{"first_name":"Tyra","full_name":"McCray, Tyra","last_name":"Mccray"},{"first_name":"Gang","last_name":"Li","full_name":"Li, Gang"},{"last_name":"Qin","full_name":"Qin, Genji","first_name":"Genji"},{"last_name":"Wakeley","full_name":"Wakeley, Michelle","first_name":"Michelle"},{"first_name":"William","full_name":"Terzaghi, William","last_name":"Terzaghi"},{"full_name":"Wan, Jianmin","last_name":"Wan","first_name":"Jianmin"},{"first_name":"Yunde","last_name":"Zhao","full_name":"Zhao, Yunde"},{"full_name":"Xu, Jian","last_name":"Xu","first_name":"Jian"},{"full_name":"Jirí Friml","last_name":"Friml","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"},{"first_name":"Xing","last_name":"Deng","full_name":"Deng, Xing W"},{"full_name":"Wang, Haiyang","last_name":"Wang","first_name":"Haiyang"}],"page":"2497 - 2514","day":"01","volume":24,"quality_controlled":0,"issue":"6","citation":{"ieee":"M. Dai <i>et al.</i>, “A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis,” <i>Plant Cell</i>, vol. 24, no. 6. American Society of Plant Biologists, pp. 2497–2514, 2012.","chicago":"Dai, Mingqiu, Chen Zhang, Urszula Kania, Fang Chen, Qin Xue, Tyra Mccray, Gang Li, et al. “A PP6 Type Phosphatase Holoenzyme Directly Regulates PIN Phosphorylation and Auxin Efflux in Arabidopsis.” <i>Plant Cell</i>. American Society of Plant Biologists, 2012. <a href=\"https://doi.org/10.1105/tpc.112.098905\">https://doi.org/10.1105/tpc.112.098905</a>.","ama":"Dai M, Zhang C, Kania U, et al. A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis. <i>Plant Cell</i>. 2012;24(6):2497-2514. doi:<a href=\"https://doi.org/10.1105/tpc.112.098905\">10.1105/tpc.112.098905</a>","ista":"Dai M, Zhang C, Kania U, Chen F, Xue Q, Mccray T, Li G, Qin G, Wakeley M, Terzaghi W, Wan J, Zhao Y, Xu J, Friml J, Deng X, Wang H. 2012. A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis. Plant Cell. 24(6), 2497–2514.","short":"M. Dai, C. Zhang, U. Kania, F. Chen, Q. Xue, T. Mccray, G. Li, G. Qin, M. Wakeley, W. Terzaghi, J. Wan, Y. Zhao, J. Xu, J. Friml, X. Deng, H. Wang, Plant Cell 24 (2012) 2497–2514.","apa":"Dai, M., Zhang, C., Kania, U., Chen, F., Xue, Q., Mccray, T., … Wang, H. (2012). A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.112.098905\">https://doi.org/10.1105/tpc.112.098905</a>","mla":"Dai, Mingqiu, et al. “A PP6 Type Phosphatase Holoenzyme Directly Regulates PIN Phosphorylation and Auxin Efflux in Arabidopsis.” <i>Plant Cell</i>, vol. 24, no. 6, American Society of Plant Biologists, 2012, pp. 2497–514, doi:<a href=\"https://doi.org/10.1105/tpc.112.098905\">10.1105/tpc.112.098905</a>."},"type":"journal_article","title":"A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis","status":"public","publication_status":"published","_id":"3110","date_updated":"2021-01-12T07:41:08Z","doi":"10.1105/tpc.112.098905","year":"2012","publist_id":"3589","date_created":"2018-12-11T12:01:27Z"},{"intvolume":"        22","publisher":"Cell Press","abstract":[{"text":"PIN-FORMED (PIN) protein-mediated auxin polar transport is critically important for development, pattern formation, and morphogenesis in plants. Auxin has been implicated in the regulation of polar auxin transport by inhibiting PIN endocytosis [1, 2], but how auxin regulates this process is poorly understood. Our genetic screen identified the Arabidopsis SPIKE1 (SPK1) gene whose loss-of-function mutations increased lateral root density and retarded gravitropic responses, as do pin2 knockout mutations [3]. SPK1 belongs to the conserved DHR2-Dock family of Rho guanine nucleotide exchange factors [4-6]. The spk1 mutations induced PIN2 internalization that was not suppressed by auxin, as did the loss-of-function mutations for Rho-like GTPase from Plants 6 (ROP6)-GTPase or its effector RIC1. Furthermore, SPK1 was required for auxin induction of ROP6 activation. Our results have established a Rho GTPase-based auxin signaling pathway that maintains PIN2 polar distribution to the plasma membrane via inhibition of its internalization in Arabidopsis roots. Our findings provide new insights into signaling mechanisms that underlie the regulation of the dynamic trafficking of PINs required for long-distance auxin transport and that link auxin signaling to PIN-mediated pattern formation and morphogenesis.","lang":"eng"}],"month":"07","publication":"Current Biology","extern":1,"date_published":"2012-07-24T00:00:00Z","page":"1319 - 1325","author":[{"first_name":"Deshu","full_name":"Lin, Deshu","last_name":"Lin"},{"first_name":"Shingo","full_name":"Nagawa, Shingo","last_name":"Nagawa"},{"full_name":"Chen, Jisheng","last_name":"Chen","first_name":"Jisheng"},{"full_name":"Cao, Lingyan","last_name":"Cao","first_name":"Lingyan"},{"first_name":"Xu","id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87","full_name":"Xu Chen","last_name":"Chen"},{"first_name":"Tongda","last_name":"Xu","full_name":"Xu, Tongda"},{"id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongjiang","last_name":"Li","full_name":"Hongjiang Li","orcid":"0000-0001-5039-9660"},{"last_name":"Dhonukshe","full_name":"Dhonukshe, Pankaj","first_name":"Pankaj"},{"last_name":"Yamamuro","full_name":"Yamamuro, Chizuko","first_name":"Chizuko"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Jirí Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"},{"last_name":"Scheres","full_name":"Scheres, Ben","first_name":"Ben"},{"first_name":"Ying","full_name":"Fu, Ying","last_name":"Fu"},{"first_name":"Zhenbiao","last_name":"Yang","full_name":"Yang, Zhenbiao"}],"day":"24","volume":22,"quality_controlled":0,"citation":{"chicago":"Lin, Deshu, Shingo Nagawa, Jisheng Chen, Lingyan Cao, Xu Chen, Tongda Xu, Hongjiang Li, et al. “A ROP GTPase Dependent Auxin Signaling Pathway Regulates the Subcellular Distribution of PIN2 in Arabidopsis Roots.” <i>Current Biology</i>. Cell Press, 2012. <a href=\"https://doi.org/10.1016/j.cub.2012.05.019\">https://doi.org/10.1016/j.cub.2012.05.019</a>.","ama":"Lin D, Nagawa S, Chen J, et al. A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots. <i>Current Biology</i>. 2012;22(14):1319-1325. doi:<a href=\"https://doi.org/10.1016/j.cub.2012.05.019\">10.1016/j.cub.2012.05.019</a>","ieee":"D. Lin <i>et al.</i>, “A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots,” <i>Current Biology</i>, vol. 22, no. 14. Cell Press, pp. 1319–1325, 2012.","mla":"Lin, Deshu, et al. “A ROP GTPase Dependent Auxin Signaling Pathway Regulates the Subcellular Distribution of PIN2 in Arabidopsis Roots.” <i>Current Biology</i>, vol. 22, no. 14, Cell Press, 2012, pp. 1319–25, doi:<a href=\"https://doi.org/10.1016/j.cub.2012.05.019\">10.1016/j.cub.2012.05.019</a>.","apa":"Lin, D., Nagawa, S., Chen, J., Cao, L., Chen, X., Xu, T., … Yang, Z. (2012). A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2012.05.019\">https://doi.org/10.1016/j.cub.2012.05.019</a>","ista":"Lin D, Nagawa S, Chen J, Cao L, Chen X, Xu T, Li H, Dhonukshe P, Yamamuro C, Friml J, Scheres B, Fu Y, Yang Z. 2012. A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots. Current Biology. 22(14), 1319–1325.","short":"D. Lin, S. Nagawa, J. Chen, L. Cao, X. Chen, T. Xu, H. Li, P. Dhonukshe, C. Yamamuro, J. Friml, B. Scheres, Y. Fu, Z. Yang, Current Biology 22 (2012) 1319–1325."},"issue":"14","title":"A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots","type":"journal_article","publication_status":"published","status":"public","_id":"3111","doi":"10.1016/j.cub.2012.05.019","date_updated":"2021-01-12T07:41:08Z","year":"2012","publist_id":"3588","date_created":"2018-12-11T12:01:27Z"},{"status":"public","publication_status":"published","_id":"3112","title":"ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots","type":"journal_article","publist_id":"3587","date_created":"2018-12-11T12:01:27Z","date_updated":"2021-01-12T07:41:08Z","doi":"10.1016/j.cub.2012.05.020","year":"2012","publication":"Current Biology","month":"07","date_published":"2012-07-24T00:00:00Z","extern":1,"intvolume":"        22","abstract":[{"text":"The dynamic spatial and temporal distribution of the crucial plant signaling molecule auxin is achieved by feedback coordination of auxin signaling and intercellular auxin transport pathways [1, 2]. Developmental roles of auxin have been attributed predominantly to its effect on transcription; however, an alternative pathway involving AUXIN BINDING PROTEIN1 (ABP1) has been proposed to regulate clathrin-mediated endocytosis in roots and Rho-like GTPase (ROP)-dependent pavement cell interdigitation in leaves [3, 4]. In this study, we show that ROP6 and its downstream effector RIC1 regulate clathrin association with the plasma membrane for clathrin-mediated endocytosis, as well as for its feedback regulation by auxin. Genetic analysis revealed that ROP6/RIC1 acts downstream of ABP1 to regulate endocytosis. This signaling circuit is also involved in the feedback regulation of PIN-FORMED 1 (PIN1) and PIN2 auxin transporters activity (via its constitutive endocytosis) and corresponding auxin transport-mediated processes, including root gravitropism and leave vascular tissue patterning. Our findings suggest that the signaling module auxin-ABP1-ROP6/RIC1-clathrin-PIN1/PIN2 is a shared component of the feedback regulation of auxin transport during both root and aerial development.","lang":"eng"}],"publisher":"Cell Press","quality_controlled":0,"volume":22,"issue":"14","citation":{"short":"X. Chen, S. Naramoto, S. Robert, R. Tejos, C. Löfke, D. Lin, Z. Yang, J. Friml, Current Biology 22 (2012) 1326–1332.","ista":"Chen X, Naramoto S, Robert S, Tejos R, Löfke C, Lin D, Yang Z, Friml J. 2012. ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots. Current Biology. 22(14), 1326–1332.","apa":"Chen, X., Naramoto, S., Robert, S., Tejos, R., Löfke, C., Lin, D., … Friml, J. (2012). ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2012.05.020\">https://doi.org/10.1016/j.cub.2012.05.020</a>","mla":"Chen, Xu, et al. “ABP1 and ROP6 GTPase Signaling Regulate Clathrin Mediated Endocytosis in Arabidopsis Roots.” <i>Current Biology</i>, vol. 22, no. 14, Cell Press, 2012, pp. 1326–32, doi:<a href=\"https://doi.org/10.1016/j.cub.2012.05.020\">10.1016/j.cub.2012.05.020</a>.","ieee":"X. Chen <i>et al.</i>, “ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots,” <i>Current Biology</i>, vol. 22, no. 14. Cell Press, pp. 1326–1332, 2012.","chicago":"Chen, Xu, Satoshi Naramoto, Stéphanie Robert, Ricardo Tejos, Christian Löfke, Deshu Lin, Zhenbiao Yang, and Jiří Friml. “ABP1 and ROP6 GTPase Signaling Regulate Clathrin Mediated Endocytosis in Arabidopsis Roots.” <i>Current Biology</i>. Cell Press, 2012. <a href=\"https://doi.org/10.1016/j.cub.2012.05.020\">https://doi.org/10.1016/j.cub.2012.05.020</a>.","ama":"Chen X, Naramoto S, Robert S, et al. ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots. <i>Current Biology</i>. 2012;22(14):1326-1332. doi:<a href=\"https://doi.org/10.1016/j.cub.2012.05.020\">10.1016/j.cub.2012.05.020</a>"},"author":[{"first_name":"Xu","id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87","full_name":"Xu Chen","last_name":"Chen"},{"first_name":"Satoshi","last_name":"Naramoto","full_name":"Naramoto, Satoshi"},{"first_name":"Stéphanie","full_name":"Robert, Stéphanie","last_name":"Robert"},{"last_name":"Tejos","full_name":"Tejos, Ricardo","first_name":"Ricardo"},{"full_name":"Löfke, Christian","last_name":"Löfke","first_name":"Christian"},{"first_name":"Deshu","full_name":"Lin, Deshu","last_name":"Lin"},{"first_name":"Zhenbiao","last_name":"Yang","full_name":"Yang, Zhenbiao"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml","full_name":"Jirí Friml","orcid":"0000-0002-8302-7596"}],"page":"1326 - 1332","day":"24"},{"date_updated":"2025-09-30T07:59:55Z","oa":1,"publist_id":"3579","department":[{"_id":"HeEd"}],"scopus_import":"1","arxiv":1,"_id":"3120","status":"public","article_processing_charge":"No","page":"1171 - 1194","citation":{"ista":"Brown G, Kerber M, Reid M. 2012. Fano 3 folds in codimension 4 Tom and Jerry Part I. Compositio Mathematica. 148(4), 1171–1194.","short":"G. Brown, M. Kerber, M. Reid, Compositio Mathematica 148 (2012) 1171–1194.","mla":"Brown, Gavin, et al. “Fano 3 Folds in Codimension 4 Tom and Jerry Part I.” <i>Compositio Mathematica</i>, vol. 148, no. 4, Cambridge University Press, 2012, pp. 1171–94, doi:<a href=\"https://doi.org/10.1112/S0010437X11007226\">10.1112/S0010437X11007226</a>.","apa":"Brown, G., Kerber, M., &#38; Reid, M. (2012). Fano 3 folds in codimension 4 Tom and Jerry Part I. <i>Compositio Mathematica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/S0010437X11007226\">https://doi.org/10.1112/S0010437X11007226</a>","ieee":"G. Brown, M. Kerber, and M. Reid, “Fano 3 folds in codimension 4 Tom and Jerry Part I,” <i>Compositio Mathematica</i>, vol. 148, no. 4. Cambridge University Press, pp. 1171–1194, 2012.","ama":"Brown G, Kerber M, Reid M. Fano 3 folds in codimension 4 Tom and Jerry Part I. <i>Compositio Mathematica</i>. 2012;148(4):1171-1194. doi:<a href=\"https://doi.org/10.1112/S0010437X11007226\">10.1112/S0010437X11007226</a>","chicago":"Brown, Gavin, Michael Kerber, and Miles Reid. “Fano 3 Folds in Codimension 4 Tom and Jerry Part I.” <i>Compositio Mathematica</i>. Cambridge University Press, 2012. <a href=\"https://doi.org/10.1112/S0010437X11007226\">https://doi.org/10.1112/S0010437X11007226</a>."},"volume":148,"quality_controlled":"1","publisher":"Cambridge University Press","intvolume":"       148","month":"07","year":"2012","acknowledgement":"This research is supported by the Korean Government WCU Grant R33-2008-000-10101-0.","doi":"10.1112/S0010437X11007226","date_created":"2018-12-11T12:01:30Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"isi":1,"type":"journal_article","title":"Fano 3 folds in codimension 4 Tom and Jerry Part I","publication_status":"published","day":"01","author":[{"full_name":"Brown, Gavin","last_name":"Brown","first_name":"Gavin"},{"orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","last_name":"Kerber","full_name":"Kerber, Michael"},{"first_name":"Miles","last_name":"Reid","full_name":"Reid, Miles"}],"issue":"4","main_file_link":[{"url":"http://arxiv.org/abs/1009.4313","open_access":"1"}],"oa_version":"Preprint","abstract":[{"text":"We introduce a strategy based on Kustin-Miller unprojection that allows us to construct many hundreds of Gorenstein codimension 4 ideals with 9 × 16 resolutions (that is, nine equations and sixteen first syzygies). Our two basic games are called Tom and Jerry; the main application is the biregular construction of most of the anticanonically polarised Mori Fano 3-folds of Altinok's thesis. There are 115 cases whose numerical data (in effect, the Hilbert series) allow a Type I projection. In every case, at least one Tom and one Jerry construction works, providing at least two deformation families of quasismooth Fano 3-folds having the same numerics but different topology. © 2012 Copyright Foundation Compositio Mathematica.","lang":"eng"}],"date_published":"2012-07-01T00:00:00Z","external_id":{"arxiv":["1009.4313"],"isi":["000307176400007"]},"publication":"Compositio Mathematica"},{"publist_id":"3574","oa":1,"date_updated":"2023-02-23T11:13:25Z","status":"public","_id":"3125","scopus_import":1,"department":[{"_id":"ChLa"}],"file_date_updated":"2020-07-14T12:46:00Z","ddc":["000"],"volume":7576,"quality_controlled":"1","citation":{"ieee":"V. Sharmanska, N. Quadrianto, and C. Lampert, “Augmented attribute representations,” presented at the ECCV: European Conference on Computer Vision, Florence, Italy, 2012, vol. 7576, no. PART 5, pp. 242–255.","ama":"Sharmanska V, Quadrianto N, Lampert C. Augmented attribute representations. In: Vol 7576. Springer; 2012:242-255. doi:<a href=\"https://doi.org/10.1007/978-3-642-33715-4_18\">10.1007/978-3-642-33715-4_18</a>","chicago":"Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Augmented Attribute Representations,” 7576:242–55. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33715-4_18\">https://doi.org/10.1007/978-3-642-33715-4_18</a>.","short":"V. Sharmanska, N. Quadrianto, C. Lampert, in:, Springer, 2012, pp. 242–255.","ista":"Sharmanska V, Quadrianto N, Lampert C. 2012. Augmented attribute representations. ECCV: European Conference on Computer Vision, LNCS, vol. 7576, 242–255.","apa":"Sharmanska, V., Quadrianto, N., &#38; Lampert, C. (2012). Augmented attribute representations (Vol. 7576, pp. 242–255). Presented at the ECCV: European Conference on Computer Vision, Florence, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33715-4_18\">https://doi.org/10.1007/978-3-642-33715-4_18</a>","mla":"Sharmanska, Viktoriia, et al. <i>Augmented Attribute Representations</i>. Vol. 7576, no. PART 5, Springer, 2012, pp. 242–55, doi:<a href=\"https://doi.org/10.1007/978-3-642-33715-4_18\">10.1007/978-3-642-33715-4_18</a>."},"has_accepted_license":"1","page":"242 - 255","article_processing_charge":"No","month":"10","intvolume":"      7576","publisher":"Springer","conference":{"name":"ECCV: European Conference on Computer Vision","start_date":"2012-10-07","location":"Florence, Italy","end_date":"2012-10-13"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"date_created":"2018-12-11T12:01:32Z","doi":"10.1007/978-3-642-33715-4_18","year":"2012","publication_status":"published","title":"Augmented attribute representations","type":"conference","language":[{"iso":"eng"}],"oa_version":"Submitted Version","issue":"PART 5","author":[{"orcid":"0000-0003-0192-9308","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","first_name":"Viktoriia","last_name":"Sharmanska","full_name":"Sharmanska, Viktoriia"},{"last_name":"Quadrianto","full_name":"Quadrianto, Novi","first_name":"Novi"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"}],"day":"01","date_published":"2012-10-01T00:00:00Z","file":[{"relation":"main_file","access_level":"open_access","file_name":"2012_ECCV_Sharmanska.pdf","file_id":"7861","checksum":"bccdbe0663780d25a1e0524002b2d896","file_size":6073897,"date_created":"2020-05-15T12:29:04Z","content_type":"application/pdf","date_updated":"2020-07-14T12:46:00Z","creator":"dernst"}],"abstract":[{"lang":"eng","text":"We propose a new learning method to infer a mid-level feature representation that combines the advantage of semantic attribute representations with the higher expressive power of non-semantic features. The idea lies in augmenting an existing attribute-based representation with additional dimensions for which an autoencoder model is coupled with a large-margin principle. This construction allows a smooth transition between the zero-shot regime with no training example, the unsupervised regime with training examples but without class labels, and the supervised regime with training examples and with class labels. The resulting optimization problem can be solved efficiently, because several of the necessity steps have closed-form solutions. Through extensive experiments we show that the augmented representation achieves better results in terms of object categorization accuracy than the semantic representation alone."}]},{"author":[{"full_name":"Müller, Andreas","last_name":"Müller","first_name":"Andreas"},{"last_name":"Nowozin","full_name":"Nowozin, Sebastian","first_name":"Sebastian"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"}],"page":"205 - 215","day":"14","quality_controlled":"1","volume":7476,"oa_version":"None","citation":{"short":"A. Müller, S. Nowozin, C. Lampert, in:, Springer, 2012, pp. 205–215.","ista":"Müller A, Nowozin S, Lampert C. 2012. Information theoretic clustering using minimal spanning trees. DAGM: German Association For Pattern Recognition, LNCS, vol. 7476, 205–215.","apa":"Müller, A., Nowozin, S., &#38; Lampert, C. (2012). Information theoretic clustering using minimal spanning trees (Vol. 7476, pp. 205–215). Presented at the DAGM: German Association For Pattern Recognition, Graz, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32717-9_21\">https://doi.org/10.1007/978-3-642-32717-9_21</a>","mla":"Müller, Andreas, et al. <i>Information Theoretic Clustering Using Minimal Spanning Trees</i>. Vol. 7476, Springer, 2012, pp. 205–15, doi:<a href=\"https://doi.org/10.1007/978-3-642-32717-9_21\">10.1007/978-3-642-32717-9_21</a>.","ieee":"A. Müller, S. Nowozin, and C. Lampert, “Information theoretic clustering using minimal spanning trees,” presented at the DAGM: German Association For Pattern Recognition, Graz, Austria, 2012, vol. 7476, pp. 205–215.","chicago":"Müller, Andreas, Sebastian Nowozin, and Christoph Lampert. “Information Theoretic Clustering Using Minimal Spanning Trees,” 7476:205–15. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32717-9_21\">https://doi.org/10.1007/978-3-642-32717-9_21</a>.","ama":"Müller A, Nowozin S, Lampert C. Information theoretic clustering using minimal spanning trees. In: Vol 7476. Springer; 2012:205-215. doi:<a href=\"https://doi.org/10.1007/978-3-642-32717-9_21\">10.1007/978-3-642-32717-9_21</a>"},"intvolume":"      7476","abstract":[{"lang":"eng","text":"In this work we propose a new information-theoretic clustering algorithm that infers cluster memberships by direct optimization of a non-parametric mutual information estimate between data distribution and cluster assignment. Although the optimization objective has a solid theoretical foundation it is hard to optimize. We propose an approximate optimization formulation that leads to an efficient algorithm with low runtime complexity. The algorithm has a single free parameter, the number of clusters to find. We demonstrate superior performance on several synthetic and real datasets.\r\n"}],"publisher":"Springer","month":"08","date_published":"2012-08-14T00:00:00Z","date_updated":"2021-01-12T07:41:14Z","doi":"10.1007/978-3-642-32717-9_21","year":"2012","publist_id":"3573","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Graz, Austria","name":"DAGM: German Association For Pattern Recognition","start_date":"2012-08-28","end_date":"2012-08-31"},"date_created":"2018-12-11T12:01:32Z","alternative_title":["LNCS"],"title":"Information theoretic clustering using minimal spanning trees","type":"conference","scopus_import":1,"language":[{"iso":"eng"}],"department":[{"_id":"ChLa"}],"status":"public","publication_status":"published","_id":"3126"}]