[{"publication":"Journal of the London Mathematical Society","publication_status":"published","doi":"10.1112/jlms/jdw025","volume":94,"citation":{"mla":"Browning, Timothy D., and Ilya Vinogradov. “Effective Ratner Theorem for SL (2, R) ⋉R2 and Gaps in √n modulo 1.” <i>Journal of the London Mathematical Society</i>, vol. 94, no. 1, John Wiley and Sons Ltd, 2016, pp. 61–84, doi:<a href=\"https://doi.org/10.1112/jlms/jdw025\">10.1112/jlms/jdw025</a>.","apa":"Browning, T. D., &#38; Vinogradov, I. (2016). Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1. <i>Journal of the London Mathematical Society</i>. John Wiley and Sons Ltd. <a href=\"https://doi.org/10.1112/jlms/jdw025\">https://doi.org/10.1112/jlms/jdw025</a>","chicago":"Browning, Timothy D, and Ilya Vinogradov. “Effective Ratner Theorem for SL (2, R) ⋉R2 and Gaps in √n modulo 1.” <i>Journal of the London Mathematical Society</i>. John Wiley and Sons Ltd, 2016. <a href=\"https://doi.org/10.1112/jlms/jdw025\">https://doi.org/10.1112/jlms/jdw025</a>.","ama":"Browning TD, Vinogradov I. Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1. <i>Journal of the London Mathematical Society</i>. 2016;94(1):61-84. doi:<a href=\"https://doi.org/10.1112/jlms/jdw025\">10.1112/jlms/jdw025</a>","short":"T.D. Browning, I. Vinogradov, Journal of the London Mathematical Society 94 (2016) 61–84.","ieee":"T. D. Browning and I. Vinogradov, “Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1,” <i>Journal of the London Mathematical Society</i>, vol. 94, no. 1. John Wiley and Sons Ltd, pp. 61–84, 2016.","ista":"Browning TD, Vinogradov I. 2016. Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1. Journal of the London Mathematical Society. 94(1), 61–84."},"extern":1,"abstract":[{"lang":"eng","text":"Let G = SL(2, R) ⋉R2 and Γ = SL(2, Z) ⋉Z2. Building on recent work of Strömbergsson, we prove a rate of equidistribution for the orbits of a certain one-dimensional unipotent flow of Γ\\G, which projects to a closed horocycle in the unit tangent bundle to the modular surface. We use this to answer a question of Elkies and McMullen by making effective the convergence of the gap distribution of √n mod 1."}],"type":"journal_article","_id":"261","date_created":"2018-12-11T11:45:29Z","day":"24","quality_controlled":0,"status":"public","page":"61 - 84","publist_id":"7641","year":"2016","date_published":"2016-05-24T00:00:00Z","intvolume":"        94","month":"05","acknowledgement":"The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007–2013)/ERC Grant Agreements 291147 and 306457.","publisher":"John Wiley and Sons Ltd","date_updated":"2021-01-12T06:58:33Z","title":"Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1","author":[{"orcid":"0000-0002-8314-0177","last_name":"Browning","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Timothy Browning"},{"last_name":"Vinogradov","first_name":"Ilya","full_name":"Vinogradov, Ilya"}],"issue":"1"},{"page":"337 - 347","publist_id":"7640","year":"2016","intvolume":"        62","month":"01","date_published":"2016-01-22T00:00:00Z","publisher":"Cambridge University Press","acknowledgement":"While working on this paper the first author was supported by ERC grant 306457.","date_updated":"2021-01-12T06:58:37Z","issue":"2","oa":1,"author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","orcid":"0000-0002-8314-0177","last_name":"Browning","full_name":"Timothy Browning"},{"last_name":"Newton","first_name":"Rachel","full_name":"Newton, Rachel"}],"title":"The proportion of failures of the Hasse norm principle","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1411.7775"}],"publication_status":"published","doi":"10.1112/S0025579315000261","publication":"Mathematika","extern":1,"citation":{"chicago":"Browning, Timothy D, and Rachel Newton. “The Proportion of Failures of the Hasse Norm Principle.” <i>Mathematika</i>. Cambridge University Press, 2016. <a href=\"https://doi.org/10.1112/S0025579315000261\">https://doi.org/10.1112/S0025579315000261</a>.","ieee":"T. D. Browning and R. Newton, “The proportion of failures of the Hasse norm principle,” <i>Mathematika</i>, vol. 62, no. 2. Cambridge University Press, pp. 337–347, 2016.","short":"T.D. Browning, R. Newton, Mathematika 62 (2016) 337–347.","ista":"Browning TD, Newton R. 2016. The proportion of failures of the Hasse norm principle. Mathematika. 62(2), 337–347.","ama":"Browning TD, Newton R. The proportion of failures of the Hasse norm principle. <i>Mathematika</i>. 2016;62(2):337-347. doi:<a href=\"https://doi.org/10.1112/S0025579315000261\">10.1112/S0025579315000261</a>","mla":"Browning, Timothy D., and Rachel Newton. “The Proportion of Failures of the Hasse Norm Principle.” <i>Mathematika</i>, vol. 62, no. 2, Cambridge University Press, 2016, pp. 337–47, doi:<a href=\"https://doi.org/10.1112/S0025579315000261\">10.1112/S0025579315000261</a>.","apa":"Browning, T. D., &#38; Newton, R. (2016). The proportion of failures of the Hasse norm principle. <i>Mathematika</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/S0025579315000261\">https://doi.org/10.1112/S0025579315000261</a>"},"volume":62,"type":"journal_article","abstract":[{"text":"For any number field we calculate the exact proportion of rational numbers which are everywhere locally a norm but not globally a norm from the number field.","lang":"eng"}],"date_created":"2018-12-11T11:45:29Z","_id":"262","quality_controlled":0,"day":"22","status":"public"},{"page":"55 - 72","publist_id":"7639","year":"2016","date_published":"2016-03-01T00:00:00Z","month":"03","intvolume":"         2","acknowledgement":"While working on this paper the first author was supported by an IUF Junior and the second author was supported by ERC grant 306457. ","publisher":"Springer Nature","date_updated":"2021-01-12T06:58:41Z","oa":1,"author":[{"first_name":"Régis","last_name":"De La Bretèche","full_name":"de la Bretèche, Régis"},{"orcid":"0000-0002-8314-0177","last_name":"Browning","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Timothy Browning"},{"full_name":"Salberger, Per","first_name":"Per","last_name":"Salberger"}],"title":"Counting rational points on the Cayley ruled cubic","issue":"1","publication":"European Journal of Mathematics","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1410.3855"}],"doi":"10.1007/s40879-015-0049-1","volume":2,"extern":1,"citation":{"apa":"De La Bretèche, R., Browning, T. D., &#38; Salberger, P. (2016). Counting rational points on the Cayley ruled cubic. <i>European Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40879-015-0049-1\">https://doi.org/10.1007/s40879-015-0049-1</a>","mla":"De La Bretèche, Régis, et al. “Counting Rational Points on the Cayley Ruled Cubic.” <i>European Journal of Mathematics</i>, vol. 2, no. 1, Springer Nature, 2016, pp. 55–72, doi:<a href=\"https://doi.org/10.1007/s40879-015-0049-1\">10.1007/s40879-015-0049-1</a>.","ieee":"R. De La Bretèche, T. D. Browning, and P. Salberger, “Counting rational points on the Cayley ruled cubic,” <i>European Journal of Mathematics</i>, vol. 2, no. 1. Springer Nature, pp. 55–72, 2016.","short":"R. De La Bretèche, T.D. Browning, P. Salberger, European Journal of Mathematics 2 (2016) 55–72.","ista":"De La Bretèche R, Browning TD, Salberger P. 2016. Counting rational points on the Cayley ruled cubic. European Journal of Mathematics. 2(1), 55–72.","ama":"De La Bretèche R, Browning TD, Salberger P. Counting rational points on the Cayley ruled cubic. <i>European Journal of Mathematics</i>. 2016;2(1):55-72. doi:<a href=\"https://doi.org/10.1007/s40879-015-0049-1\">10.1007/s40879-015-0049-1</a>","chicago":"De La Bretèche, Régis, Timothy D Browning, and Per Salberger. “Counting Rational Points on the Cayley Ruled Cubic.” <i>European Journal of Mathematics</i>. Springer Nature, 2016. <a href=\"https://doi.org/10.1007/s40879-015-0049-1\">https://doi.org/10.1007/s40879-015-0049-1</a>."},"abstract":[{"text":"We count rational points of bounded height on the Cayley ruled cubic surface and interpret the result in the context of general conjectures due to Batyrev and Tschinkel.","lang":"eng"}],"type":"journal_article","date_created":"2018-12-11T11:45:30Z","_id":"263","quality_controlled":0,"day":"01","status":"public"},{"publist_id":"7638","page":"1435 - 1475","year":"2016","acknowledgement":"While working on this paper the second author was supported by ERC grant 306457.","publisher":"Cambridge University Press","date_published":"2016-07-01T00:00:00Z","month":"07","intvolume":"       152","title":"Failures of weak approximation in families","oa":1,"author":[{"first_name":"Maritn","last_name":"Bright","full_name":"Bright, Maritn J"},{"orcid":"0000-0002-8314-0177","last_name":"Browning","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Timothy Browning"},{"first_name":"Daniel","last_name":"Loughran","full_name":"Loughran, Daniel"}],"issue":"7","date_updated":"2021-01-12T06:58:45Z","publication":"Compositio Mathematica","main_file_link":[{"url":"https://arxiv.org/abs/1506.01817","open_access":"1"}],"doi":"10.1112/S0010437X16007405","publication_status":"published","abstract":[{"lang":"eng","text":"Given a family of varieties over a number field, we determine conditions under which there is a Brauer-Manin obstruction to weak approximation for 100% of the fibres which are everywhere locally soluble."}],"type":"journal_article","volume":152,"citation":{"ama":"Bright M, Browning TD, Loughran D. Failures of weak approximation in families. <i>Compositio Mathematica</i>. 2016;152(7):1435-1475. doi:<a href=\"https://doi.org/10.1112/S0010437X16007405\">10.1112/S0010437X16007405</a>","ista":"Bright M, Browning TD, Loughran D. 2016. Failures of weak approximation in families. Compositio Mathematica. 152(7), 1435–1475.","short":"M. Bright, T.D. Browning, D. Loughran, Compositio Mathematica 152 (2016) 1435–1475.","ieee":"M. Bright, T. D. Browning, and D. Loughran, “Failures of weak approximation in families,” <i>Compositio Mathematica</i>, vol. 152, no. 7. Cambridge University Press, pp. 1435–1475, 2016.","chicago":"Bright, Maritn, Timothy D Browning, and Daniel Loughran. “Failures of Weak Approximation in Families.” <i>Compositio Mathematica</i>. Cambridge University Press, 2016. <a href=\"https://doi.org/10.1112/S0010437X16007405\">https://doi.org/10.1112/S0010437X16007405</a>.","apa":"Bright, M., Browning, T. D., &#38; Loughran, D. (2016). Failures of weak approximation in families. <i>Compositio Mathematica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/S0010437X16007405\">https://doi.org/10.1112/S0010437X16007405</a>","mla":"Bright, Maritn, et al. “Failures of Weak Approximation in Families.” <i>Compositio Mathematica</i>, vol. 152, no. 7, Cambridge University Press, 2016, pp. 1435–75, doi:<a href=\"https://doi.org/10.1112/S0010437X16007405\">10.1112/S0010437X16007405</a>."},"extern":1,"quality_controlled":0,"status":"public","day":"01","_id":"264","date_created":"2018-12-11T11:45:30Z"},{"doi":"10.4230/LIPIcs.MFCS.2016.25","ec_funded":1,"oa_version":"Published Version","volume":58,"day":"01","status":"public","date_created":"2018-12-11T11:49:58Z","tmp":{"short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","image":"/images/cc_by.png"},"ddc":["000","004","006"],"conference":{"location":"Krakow, Poland","name":"MFCS: Mathematical Foundations of Computer Science (SG)","start_date":"2016-08-22","end_date":"2016-08-26"},"year":"2016","article_number":"25","acknowledgement":"K. C., M. H., and W. D. are partially supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Start grant (279307","date_published":"2016-08-01T00:00:00Z","alternative_title":["LIPIcs"],"intvolume":"        58","month":"08","oa":1,"date_updated":"2025-06-02T08:53:50Z","publication_status":"published","project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","abstract":[{"lang":"eng","text":"Games on graphs provide the appropriate framework to study several central problems in computer science, such as verification and synthesis of reactive systems. One of the most basic objectives for games on graphs is the liveness (or Büchi) objective that given a target set of vertices requires that some vertex in the target set is visited infinitely often. We study generalized Büchi objectives (i.e., conjunction of liveness objectives), and implications between two generalized Büchi objectives (known as GR(1) objectives), that arise in numerous applications in computer-aided verification. We present improved algorithms and conditional super-linear lower bounds based on widely believed assumptions about the complexity of (A1) combinatorial Boolean matrix multiplication and (A2) CNF-SAT. We consider graph games with n vertices, m edges, and generalized Büchi objectives with k conjunctions. First, we present an algorithm with running time O(k*n^2), improving the previously known O(k*n*m) and O(k^2*n^2) worst-case bounds. Our algorithm is optimal for dense graphs under (A1). Second, we show that the basic algorithm for the problem is optimal for sparse graphs when the target sets have constant size under (A2). Finally, we consider GR(1) objectives, with k_1 conjunctions in the antecedent and k_2 conjunctions in the consequent, and present an O(k_1 k_2 n^{2.5})-time algorithm, improving the previously known O(k_1*k_2*n*m)-time algorithm for m &gt; n^{1.5}. "}],"file_date_updated":"2018-12-12T10:16:02Z","type":"conference","citation":{"chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.25\">https://doi.org/10.4230/LIPIcs.MFCS.2016.25</a>.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Conditionally optimal algorithms for generalized Büchi Games. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.25\">10.4230/LIPIcs.MFCS.2016.25</a>","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Conditionally optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland, 2016, vol. 58.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2016. Conditionally optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 25.","mla":"Chatterjee, Krishnendu, et al. <i>Conditionally Optimal Algorithms for Generalized Büchi Games</i>. Vol. 58, 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.25\">10.4230/LIPIcs.MFCS.2016.25</a>.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., &#38; Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.25\">https://doi.org/10.4230/LIPIcs.MFCS.2016.25</a>"},"quality_controlled":"1","_id":"1068","department":[{"_id":"KrCh"}],"publist_id":"6317","article_processing_charge":"No","pubrep_id":"779","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Conditionally optimal algorithms for generalized Büchi Games","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Dvorák, Wolfgang","first_name":"Wolfgang","last_name":"Dvorák"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"}],"file":[{"file_name":"IST-2017-779-v1+1_LIPIcs-MFCS-2016-25.pdf","date_updated":"2018-12-12T10:16:02Z","date_created":"2018-12-12T10:16:02Z","creator":"system","file_size":632786,"file_id":"5187","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}]},{"publication_status":"published","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"}],"quality_controlled":"1","_id":"1069","abstract":[{"text":"The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differen-\r\ntial equation has a zero in a given interval of real numbers. This is a fundamental reachability\r\nproblem for continuous linear dynamical systems, such as linear hybrid automata and continuous-\r\ntime Markov chains. Decidability of the problem is currently open – indeed decidability is open\r\neven for the sub-problem in which a zero is sought in a bounded interval. In this paper we show\r\ndecidability of the bounded problem subject to Schanuel’s Conjecture, a unifying conjecture in\r\ntranscendental number theory. We furthermore analyse the unbounded problem in terms of the\r\nfrequencies of the differential equation, that is, the imaginary parts of the characteristic roots.\r\nWe show that the unbounded problem can be reduced to the bounded problem if there is at most\r\none rationally linearly independent frequency, or if there are two rationally linearly independent\r\nfrequencies and all characteristic roots are simple. We complete the picture by showing that de-\r\ncidability of the unbounded problem in the case of two (or more) rationally linearly independent\r\nfrequencies would entail a major new effectiveness result in Diophantine approximation, namely\r\ncomputability of the Diophantine-approximation types of all real algebraic numbers.","lang":"eng"}],"scopus_import":1,"type":"conference","file_date_updated":"2018-12-12T10:16:26Z","citation":{"mla":"Chonev, Ventsislav K., et al. <i>On the Skolem Problem for Continuous Linear Dynamical Systems</i>. Vol. 55, 100, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">10.4230/LIPIcs.ICALP.2016.100</a>.","apa":"Chonev, V. K., Ouaknine, J., &#38; Worrell, J. (2016). On the skolem problem for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">https://doi.org/10.4230/LIPIcs.ICALP.2016.100</a>","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem Problem for Continuous Linear Dynamical Systems,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">https://doi.org/10.4230/LIPIcs.ICALP.2016.100</a>.","short":"V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On the skolem problem for continuous linear dynamical systems. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 100.","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On the skolem problem for continuous linear dynamical systems,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.","ama":"Chonev VK, Ouaknine J, Worrell J. On the skolem problem for continuous linear dynamical systems. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">10.4230/LIPIcs.ICALP.2016.100</a>"},"pubrep_id":"778","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"publist_id":"6314","title":"On the skolem problem for continuous linear dynamical systems","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Ventsislav K","id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","last_name":"Chonev","full_name":"Chonev, Ventsislav K"},{"full_name":"Ouaknine, Joël","first_name":"Joël","last_name":"Ouaknine"},{"first_name":"James","last_name":"Worrell","full_name":"Worrell, James"}],"file":[{"date_created":"2018-12-12T10:16:26Z","date_updated":"2018-12-12T10:16:26Z","file_name":"IST-2017-778-v1+1_LIPIcs-ICALP-2016-100.pdf","relation":"main_file","access_level":"open_access","file_id":"5213","content_type":"application/pdf","file_size":521415,"creator":"system"}],"publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","has_accepted_license":"1","oa_version":"Published Version","ec_funded":1,"doi":"10.4230/LIPIcs.ICALP.2016.100","day":"01","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2018-12-11T11:49:59Z","ddc":["004","006"],"volume":55,"year":"2016","conference":{"start_date":"2016-07-12","end_date":"2016-07-15","name":"ICALP: Automata, Languages and Programming","location":"Rome, Italy"},"oa":1,"date_updated":"2021-01-12T06:48:03Z","acknowledgement":"Ventsislav Chonev is supported by Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307:  Graph Games), and ERC Advanced Grant (267989: QUAREM).","article_number":"100","alternative_title":["LIPIcs"],"date_published":"2016-08-01T00:00:00Z","intvolume":"        55","month":"08"},{"title":"Computation tree logic for synchronization properties","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"IST-2017-812-v1+1_LIPIcs-ICALP-2016-98.pdf","date_created":"2018-12-12T10:08:52Z","date_updated":"2018-12-12T10:08:52Z","creator":"system","file_size":546133,"file_id":"4714","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"has_accepted_license":"1","publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","language":[{"iso":"eng"}],"pubrep_id":"812","publist_id":"6313","department":[{"_id":"KrCh"}],"_id":"1070","quality_controlled":"1","citation":{"short":"K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","ista":"Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.","ieee":"K. Chatterjee and L. Doyen, “Computation tree logic for synchronization properties,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.","ama":"Chatterjee K, Doyen L. Computation tree logic for synchronization properties. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.98\">10.4230/LIPIcs.ICALP.2016.98</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for Synchronization Properties,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.98\">https://doi.org/10.4230/LIPIcs.ICALP.2016.98</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.98\">https://doi.org/10.4230/LIPIcs.ICALP.2016.98</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Computation Tree Logic for Synchronization Properties</i>. Vol. 55, 98, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.98\">10.4230/LIPIcs.ICALP.2016.98</a>."},"scopus_import":1,"abstract":[{"text":"We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length. The new logic is obtained by using the same path quantifiers and temporal operators as in CTL, but allowing a different order of the quantifiers. This small syntactic variation induces a logic that can express non-regular properties for which known extensions of MSO with equality of path length are undecidable. We show that our variant of CTL is decidable and that the model-checking problem is in Delta_3^P = P^{NP^NP}, and is DP-hard. We analogously consider quantifier exchange in extensions of CTL, and we present operators defined using basic operators of CTL* that express the occurrence of infinitely many synchronization points. We show that the model-checking problem remains in Delta_3^P. The distinguishing power of CTL and of our new logic coincide if the Next operator is allowed in the logics, thus the classical bisimulation quotient can be used for state-space reduction before model checking. ","lang":"eng"}],"file_date_updated":"2018-12-12T10:08:52Z","type":"conference","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"publication_status":"published","date_updated":"2021-01-12T06:48:03Z","oa":1,"alternative_title":["LIPIcs"],"date_published":"2016-01-01T00:00:00Z","intvolume":"        55","month":"01","acknowledgement":"This research was partially supported by Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003, and European project Cassting (FP7-601148).\r\n\r\nWe thank Stefan Göller and anonymous reviewers for their insightful\r\ncomments and suggestions.\r\n","article_number":"98","year":"2016","conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"2016-07-12","end_date":"2016-07-15","location":"Rome, Italy"},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["005"],"date_created":"2018-12-11T11:49:59Z","status":"public","day":"01","volume":55,"oa_version":"Published Version","ec_funded":1,"doi":"10.4230/LIPIcs.ICALP.2016.98"},{"year":"2016","conference":{"name":"ESA: European Symposium on Algorithms","start_date":"2016-08-22","end_date":"2016-08-24","location":"Aarhus, Denmark"},"date_updated":"2023-09-07T12:01:58Z","oa":1,"alternative_title":["LIPIcs"],"date_published":"2016-08-01T00:00:00Z","intvolume":"        57","month":"08","article_number":"28","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE) and ERC Start grant (279307: Graph Games).","related_material":{"record":[{"id":"821","status":"public","relation":"dissertation_contains"}]},"ec_funded":1,"oa_version":"Published Version","doi":"10.4230/LIPIcs.ESA.2016.28","date_created":"2018-12-11T11:49:59Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["004","006"],"status":"public","day":"01","volume":57,"language":[{"iso":"eng"}],"pubrep_id":"777","publist_id":"6312","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"}],"title":"Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"IST-2017-777-v1+1_LIPIcs-ESA-2016-28.pdf","date_created":"2018-12-12T10:14:31Z","date_updated":"2018-12-12T10:14:31Z","creator":"system","file_size":579225,"file_id":"5084","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"has_accepted_license":"1","publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"}],"publication_status":"published","_id":"1071","quality_controlled":"1","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs</i>. Vol. 57, 28, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2016.28\">10.4230/LIPIcs.ESA.2016.28</a>.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2016). Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs (Vol. 57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2016.28\">https://doi.org/10.4230/LIPIcs.ESA.2016.28</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2016.28\">https://doi.org/10.4230/LIPIcs.ESA.2016.28</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. ESA: European Symposium on Algorithms, LIPIcs, vol. 57, 28.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. In: Vol 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2016.28\">10.4230/LIPIcs.ESA.2016.28</a>"},"scopus_import":1,"abstract":[{"lang":"eng","text":"We consider data-structures for answering reachability and distance queries on constant-treewidth graphs with n nodes, on the standard RAM computational model with wordsize W=Theta(log n). Our first contribution is a data-structure that after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time; and (2) single-source reachability queries in O(n/log n) time. This is (asymptotically) optimal and is faster than DFS/BFS when answering more than a constant number of single-source queries. The data-structure uses at all times O(n) space. Our second contribution is a space-time tradeoff data-structure for distance queries. For any epsilon in [1/2,1], we provide a data-structure with polynomial preprocessing time that allows pair queries in O(n^{1-\\epsilon} alpha(n)) time, where alpha is the inverse of the Ackermann function, and at all times uses O(n^epsilon) space. The input graph G is not considered in the space complexity. "}],"type":"conference","file_date_updated":"2018-12-12T10:14:31Z"},{"language":[{"iso":"eng"}],"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","first_name":"Hryhoriy","orcid":"0000-0001-8223-8896","last_name":"Polshyn","full_name":"Polshyn, Hryhoriy"},{"full_name":"Naibert, Tyler","first_name":"Tyler","last_name":"Naibert"},{"full_name":"Chua, Victor","last_name":"Chua","first_name":"Victor"},{"first_name":"Raffi","last_name":"Budakian","full_name":"Budakian, Raffi"}],"title":"Study of vortex states and dynamics in mesoscopic superconducting samples with MFM","publisher":"American Physical Society","publication_status":"published","quality_controlled":"1","_id":"10746","type":"conference","abstract":[{"lang":"eng","text":"Vortex states in superconducting (SC) structures, their dynamics and ways to manipulate them are topics of great interest. We report a new method of magnetic force microscopy (MFM) that allows the study of vortex states in mesoscopic SC samples. For the case of a SC ring, which is biased to a half-integer flux quantum, the flux modulation through the ring caused by the motion of the magnetic tip drives the ring between two consecutive fluxoid states. The corresponding current switching in the ring produces strong position-dependent forces on the cantilever. In the regime where the frequency of the thermally activated jumps between fluxoid states is close to the frequency of the cantilever, large changes in the cantilever frequency and dissipation are observed. This effect may be understood as a stochastic resonance (SR) process. These changes in the cantilever’s mechanical properties are used to “image” the barrier energies between fluxoid states. Additionally, SR imaging of the barrier energies are used to study the effect of the locally applied magnetic field from the MFM tip on the barrier heights. We report the results of measurements for Al rings. Further, the same imaging technique can be applied to more sophisticated SC structures such as arrays of Josephson junctions."}],"publication_identifier":{"issn":["0003-0503"]},"citation":{"short":"H. Polshyn, T. Naibert, V. Chua, R. Budakian, in:, APS March Meeting 2016, American Physical Society, 2016.","ista":"Polshyn H, Naibert T, Chua V, Budakian R. 2016. Study of vortex states and dynamics in mesoscopic superconducting samples with MFM. APS March Meeting 2016. APS: American Physical Society, Bulletin of the American Physical Society, vol. 61, E25.00007.","ieee":"H. Polshyn, T. Naibert, V. Chua, and R. Budakian, “Study of vortex states and dynamics in mesoscopic superconducting samples with MFM,” in <i>APS March Meeting 2016</i>, Baltimore, MD, United States, 2016, vol. 61, no. 2.","ama":"Polshyn H, Naibert T, Chua V, Budakian R. Study of vortex states and dynamics in mesoscopic superconducting samples with MFM. In: <i>APS March Meeting 2016</i>. Vol 61. American Physical Society; 2016.","chicago":"Polshyn, Hryhoriy, Tyler Naibert, Victor Chua, and Raffi Budakian. “Study of Vortex States and Dynamics in Mesoscopic Superconducting Samples with MFM.” In <i>APS March Meeting 2016</i>, Vol. 61. American Physical Society, 2016.","apa":"Polshyn, H., Naibert, T., Chua, V., &#38; Budakian, R. (2016). Study of vortex states and dynamics in mesoscopic superconducting samples with MFM. In <i>APS March Meeting 2016</i> (Vol. 61). Baltimore, MD, United States: American Physical Society.","mla":"Polshyn, Hryhoriy, et al. “Study of Vortex States and Dynamics in Mesoscopic Superconducting Samples with MFM.” <i>APS March Meeting 2016</i>, vol. 61, no. 2, E25.00007, American Physical Society, 2016."},"extern":"1","year":"2016","conference":{"location":"Baltimore, MD, United States","end_date":"2016-03-18","start_date":"2016-03-14","name":"APS: American Physical Society"},"issue":"2","oa":1,"date_updated":"2022-02-08T10:44:06Z","article_number":"E25.00007","intvolume":"        61","month":"03","date_published":"2016-03-01T00:00:00Z","alternative_title":["Bulletin of the American Physical Society"],"oa_version":"Published Version","main_file_link":[{"url":"https://meetings.aps.org/Meeting/MAR16/Session/E25.7","open_access":"1"}],"publication":"APS March Meeting 2016","day":"01","status":"public","date_created":"2022-02-08T09:55:09Z","volume":61},{"volume":61,"day":"01","status":"public","date_created":"2022-02-08T10:10:39Z","main_file_link":[{"open_access":"1","url":"https://meetings.aps.org/Meeting/MAR16/Session/H25.6"}],"publication":"APS March Meeting 2016","oa_version":"Published Version","article_number":"H25.00006","intvolume":"        61","month":"03","date_published":"2016-03-01T00:00:00Z","alternative_title":["Bulletin of the American Physical Society"],"issue":"2","oa":1,"date_updated":"2022-02-08T10:43:33Z","conference":{"location":"Baltimore, MD, United States","start_date":"2016-03-14","end_date":"2016-03-18","name":"APS: American Physical Society"},"year":"2016","type":"conference","abstract":[{"text":"Vortex interactions are key to explaining the behavior of many two dimensional superconducting systems. We report on the development of a technique to locally probe vortex interactions in a 2D array of Josephson junctions. Scanning a magnetic tip attached to an ultra-soft cantilever over the array produces changes in the frequency of the cantilever along certain lines, forming geometric patterns in the scans. Different tip-surface separations and external magnetic fields produce a number of different patterns. These patterns correspond to tip locations in which two configurations of vortices in the lattice have degenerate energies. By imaging the locations of these degeneracies, information on the local vortex interactions may be obtained.","lang":"eng"}],"extern":"1","publication_identifier":{"issn":["0003-0503"]},"citation":{"ama":"Naibert T, Polshyn H, Wolin B, et al. Stochastic resonance magnetic force microscopy imaging of Josephson arrays. In: <i>APS March Meeting 2016</i>. Vol 61. American Physical Society; 2016.","ista":"Naibert T, Polshyn H, Wolin B, Durkin M, Garrido Menacho R, Shem IM, Chua V, Hughes T, Mason N, Budakian R. 2016. Stochastic resonance magnetic force microscopy imaging of Josephson arrays. APS March Meeting 2016. APS: American Physical Society, Bulletin of the American Physical Society, vol. 61, H25.00006.","short":"T. Naibert, H. Polshyn, B. Wolin, M. Durkin, R. Garrido Menacho, I.M. Shem, V. Chua, T. Hughes, N. Mason, R. Budakian, in:, APS March Meeting 2016, American Physical Society, 2016.","ieee":"T. Naibert <i>et al.</i>, “Stochastic resonance magnetic force microscopy imaging of Josephson arrays,” in <i>APS March Meeting 2016</i>, Baltimore, MD, United States, 2016, vol. 61, no. 2.","chicago":"Naibert, Tyler, Hryhoriy Polshyn, Brian Wolin, Malcolm Durkin, Rita Garrido Menacho, Ian Mondragon Shem, Victor Chua, Taylor Hughes, Nadya Mason, and Raffi Budakian. “Stochastic Resonance Magnetic Force Microscopy Imaging of Josephson Arrays.” In <i>APS March Meeting 2016</i>, Vol. 61. American Physical Society, 2016.","apa":"Naibert, T., Polshyn, H., Wolin, B., Durkin, M., Garrido Menacho, R., Shem, I. M., … Budakian, R. (2016). Stochastic resonance magnetic force microscopy imaging of Josephson arrays. In <i>APS March Meeting 2016</i> (Vol. 61). Baltimore, MD, United States: American Physical Society.","mla":"Naibert, Tyler, et al. “Stochastic Resonance Magnetic Force Microscopy Imaging of Josephson Arrays.” <i>APS March Meeting 2016</i>, vol. 61, no. 2, H25.00006, American Physical Society, 2016."},"quality_controlled":"1","_id":"10747","publication_status":"published","publisher":"American Physical Society","title":"Stochastic resonance magnetic force microscopy imaging of Josephson arrays","author":[{"first_name":"Tyler","last_name":"Naibert","full_name":"Naibert, Tyler"},{"id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","first_name":"Hryhoriy","last_name":"Polshyn","orcid":"0000-0001-8223-8896","full_name":"Polshyn, Hryhoriy"},{"first_name":"Brian","last_name":"Wolin","full_name":"Wolin, Brian"},{"full_name":"Durkin, Malcolm","first_name":"Malcolm","last_name":"Durkin"},{"first_name":"Rita","last_name":"Garrido Menacho","full_name":"Garrido Menacho, Rita"},{"full_name":"Shem, Ian Mondragon","first_name":"Ian Mondragon","last_name":"Shem"},{"full_name":"Chua, Victor","first_name":"Victor","last_name":"Chua"},{"full_name":"Hughes, Taylor","last_name":"Hughes","first_name":"Taylor"},{"full_name":"Mason, Nadya","first_name":"Nadya","last_name":"Mason"},{"last_name":"Budakian","first_name":"Raffi","full_name":"Budakian, Raffi"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","language":[{"iso":"eng"}]},{"file":[{"file_name":"IST-2017-757-v1+1_celldisc201618.pdf","date_updated":"2018-12-12T10:13:33Z","date_created":"2018-12-12T10:13:33Z","content_type":"application/pdf","file_id":"5017","file_size":5261671,"creator":"system","access_level":"open_access","relation":"main_file"}],"author":[{"last_name":"Łangowski","first_name":"Łukasz","full_name":"Łangowski, Łukasz"},{"full_name":"Wabnik, Krzysztof T","last_name":"Wabnik","orcid":"0000-0001-7263-0560","id":"4DE369A4-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof T"},{"orcid":"0000-0001-5039-9660","last_name":"Li","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongjiang","full_name":"Li, Hongjiang"},{"full_name":"Vanneste, Steffen","last_name":"Vanneste","first_name":"Steffen"},{"full_name":"Naramoto, Satoshi","last_name":"Naramoto","first_name":"Satoshi"},{"last_name":"Tanaka","first_name":"Hirokazu","full_name":"Tanaka, Hirokazu"},{"full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells","has_accepted_license":"1","publisher":"Nature Publishing Group","language":[{"iso":"eng"}],"pubrep_id":"757","publist_id":"6299","department":[{"_id":"EvBe"},{"_id":"JiFr"}],"_id":"1081","quality_controlled":"1","citation":{"apa":"Łangowski, Ł., Wabnik, K. T., Li, H., Vanneste, S., Naramoto, S., Tanaka, H., &#38; Friml, J. (2016). Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. <i>Cell Discovery</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/celldisc.2016.18\">https://doi.org/10.1038/celldisc.2016.18</a>","mla":"Łangowski, Łukasz, et al. “Cellular Mechanisms for Cargo Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.” <i>Cell Discovery</i>, vol. 2, 16018, Nature Publishing Group, 2016, doi:<a href=\"https://doi.org/10.1038/celldisc.2016.18\">10.1038/celldisc.2016.18</a>.","ama":"Łangowski Ł, Wabnik KT, Li H, et al. Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. <i>Cell Discovery</i>. 2016;2. doi:<a href=\"https://doi.org/10.1038/celldisc.2016.18\">10.1038/celldisc.2016.18</a>","ieee":"Ł. Łangowski <i>et al.</i>, “Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells,” <i>Cell Discovery</i>, vol. 2. Nature Publishing Group, 2016.","short":"Ł. Łangowski, K.T. Wabnik, H. Li, S. Vanneste, S. Naramoto, H. Tanaka, J. Friml, Cell Discovery 2 (2016).","ista":"Łangowski Ł, Wabnik KT, Li H, Vanneste S, Naramoto S, Tanaka H, Friml J. 2016. Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. Cell Discovery. 2, 16018.","chicago":"Łangowski, Łukasz, Krzysztof T Wabnik, Hongjiang Li, Steffen Vanneste, Satoshi Naramoto, Hirokazu Tanaka, and Jiří Friml. “Cellular Mechanisms for Cargo Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.” <i>Cell Discovery</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/celldisc.2016.18\">https://doi.org/10.1038/celldisc.2016.18</a>."},"file_date_updated":"2018-12-12T10:13:33Z","type":"journal_article","scopus_import":1,"abstract":[{"text":"The asymmetric localization of proteins in the plasma membrane domains of eukaryotic cells is a fundamental manifestation of cell polarity that is central to multicellular organization and developmental patterning. In plants, the mechanisms underlying the polar localization of cargo proteins are still largely unknown and appear to be fundamentally distinct from those operating in mammals. Here, we present a systematic, quantitative comparative analysis of the polar delivery and subcellular localization of proteins that characterize distinct polar plasma membrane domains in plant cells. The combination of microscopic analyses and computational modeling revealed a mechanistic framework common to diverse polar cargos and underlying the establishment and maintenance of apical, basal, and lateral polar domains in plant cells. This mechanism depends on the polar secretion, constitutive endocytic recycling, and restricted lateral diffusion of cargos within the plasma membrane. Moreover, our observations suggest that polar cargo distribution involves the individual protein potential to form clusters within the plasma membrane and interact with the extracellular matrix. Our observations provide insights into the shared cellular mechanisms of polar cargo delivery and polarity maintenance in plant cells.","lang":"eng"}],"project":[{"name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","call_identifier":"FP7"}],"publication_status":"published","date_updated":"2021-01-12T06:48:08Z","oa":1,"intvolume":"         2","month":"07","date_published":"2016-07-19T00:00:00Z","acknowledgement":"We thank Bonnie Bartel, Jenny Russinova and Niko Geldner\r\nfor sharing published material, Martine de Cock and Annick\r\nBleys for help in preparing the manuscript. This work was\r\nsupported by the European Research Council (project\r\nERC-2011-StG-20101109-PSDP); Czech Science Foundation\r\nGAČR (GA13-40637S); project CEITEC—Central European\r\nInstitute of Technology (CZ.1.05/1.1.00/02.0068). SV is a\r\npostdoctoral fellow of the Research Foundation-Flanders.\r\nSN is a Project Assistant Professor supported by the Japanese\r\nSociety for the Promotion of Science (JSPS; 30612022 to SN),\r\nthe NC-CARP project of the Ministry of Education, Culture,\r\nSports, Science and Technology in Japan to SN.","article_number":"16018","year":"2016","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["580"],"date_created":"2018-12-11T11:50:02Z","day":"19","status":"public","volume":2,"oa_version":"Published Version","ec_funded":1,"doi":"10.1038/celldisc.2016.18","publication":"Cell Discovery"},{"date_created":"2022-03-03T10:43:10Z","status":"public","day":"01","volume":43,"oa_version":"Published Version","publication":"2016 Computing in Cardiology Conference","doi":"10.22489/cinc.2016.090-500","main_file_link":[{"url":"https://doi.org/10.22489/cinc.2016.090-500","open_access":"1"}],"date_updated":"2022-03-04T07:34:45Z","oa":1,"date_published":"2016-03-01T00:00:00Z","intvolume":"        43","month":"03","acknowledgement":"The authors are thankful to Drs. Roger Abaecherli, Nikus Kjell, Paul Kligfield, Jay Mason, Patrice Nony, Vito Starc, Anders Thurin and the late Galen Wagner for their in depth review and constructive comments.","year":"2016","page":"309-312","conference":{"start_date":"2016-09-11","end_date":"2016-09-14","name":"CinC: Computing in Cardiology","location":"Vancouver, Canada"},"_id":"10810","quality_controlled":"1","citation":{"mla":"Rubel, Paul, et al. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol for Computer-Assisted Electrocardiography.” <i>2016 Computing in Cardiology Conference</i>, vol. 43, Computing in Cardiology, 2016, pp. 309–12, doi:<a href=\"https://doi.org/10.22489/cinc.2016.090-500\">10.22489/cinc.2016.090-500</a>.","apa":"Rubel, P., Pani, D., Schlögl, A., Fayn, J., Badilini, F., Macfarlane, P., &#38; Varri, A. (2016). SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. In <i>2016 Computing in Cardiology Conference</i> (Vol. 43, pp. 309–312). Vancouver, Canada: Computing in Cardiology. <a href=\"https://doi.org/10.22489/cinc.2016.090-500\">https://doi.org/10.22489/cinc.2016.090-500</a>","chicago":"Rubel, Paul, Danilo Pani, Alois Schlögl, Jocelyne Fayn, Fabio Badilini, Peter Macfarlane, and Alpo Varri. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol for Computer-Assisted Electrocardiography.” In <i>2016 Computing in Cardiology Conference</i>, 43:309–12. Computing in Cardiology, 2016. <a href=\"https://doi.org/10.22489/cinc.2016.090-500\">https://doi.org/10.22489/cinc.2016.090-500</a>.","ista":"Rubel P, Pani D, Schlögl A, Fayn J, Badilini F, Macfarlane P, Varri A. 2016. SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. 2016 Computing in Cardiology Conference. CinC: Computing in Cardiology vol. 43, 309–312.","short":"P. Rubel, D. Pani, A. Schlögl, J. Fayn, F. Badilini, P. Macfarlane, A. Varri, in:, 2016 Computing in Cardiology Conference, Computing in Cardiology, 2016, pp. 309–312.","ieee":"P. Rubel <i>et al.</i>, “SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography,” in <i>2016 Computing in Cardiology Conference</i>, Vancouver, Canada, 2016, vol. 43, pp. 309–312.","ama":"Rubel P, Pani D, Schlögl A, et al. SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. In: <i>2016 Computing in Cardiology Conference</i>. Vol 43. Computing in Cardiology; 2016:309-312. doi:<a href=\"https://doi.org/10.22489/cinc.2016.090-500\">10.22489/cinc.2016.090-500</a>"},"publication_identifier":{"issn":["2325-887X"]},"scopus_import":"1","abstract":[{"text":"The main goal of the SCP-ECG standard is to address ECG data and related metadata structuring, semantics and syntax, with the objective of facilitating interoperability and thus supporting and promoting the exchange of the relevant information for unary and serial ECG diagnosis. Starting with version V3.0, the standard now also provides support for the storage of continuous, long-term ECG recordings and affords a repository for selected ECG sequences and the related metadata to accommodate stress tests, drug trials and protocol-based ECG recordings. The global and per-lead measurements sections have been extended and three new sections have been introduced for storing beat-by-beat and/or spike-by-spike measurements\r\nand annotations. The used terminology and the provided measurements and annotations have been harmonized with the ISO/IEEE 11073-10102 Annotated ECG standard. Emphasis has also been put on harmonizing the Universal Statement Codes with the CDISC and the categorized AHA statement codes and similarly the drug and implanted devices codes with the ATC and NASPE/BPEG codes. ","lang":"eng"}],"type":"conference","publication_status":"published","title":"SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography","author":[{"first_name":"Paul","last_name":"Rubel","full_name":"Rubel, Paul"},{"full_name":"Pani, Danilo","first_name":"Danilo","last_name":"Pani"},{"first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","last_name":"Schlögl","full_name":"Schlögl, Alois"},{"full_name":"Fayn, Jocelyne","first_name":"Jocelyne","last_name":"Fayn"},{"first_name":"Fabio","last_name":"Badilini","full_name":"Badilini, Fabio"},{"full_name":"Macfarlane, Peter","last_name":"Macfarlane","first_name":"Peter"},{"full_name":"Varri, Alpo","first_name":"Alpo","last_name":"Varri"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Computing in Cardiology","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"CampIT"}]},{"oa_version":"Preprint","related_material":{"link":[{"relation":"other","url":"https://papers.nips.cc/paper/6101-relevant-sparse-codes-with-variational-information-bottleneck"}]},"main_file_link":[{"url":"https://arxiv.org/abs/1605.07332","open_access":"1"}],"publication_status":"published","day":"01","status":"public","quality_controlled":"1","date_created":"2018-12-11T11:50:03Z","_id":"1082","type":"conference","scopus_import":1,"abstract":[{"lang":"eng","text":"In many applications, it is desirable to extract only the relevant aspects of data. A principled way to do this is the information bottleneck (IB) method, where one seeks a code that maximises information about a relevance variable, Y, while constraining the information encoded about the original data, X. Unfortunately however, the IB method is computationally demanding when data are high-dimensional and/or non-gaussian. Here we propose an approximate variational scheme for maximising a lower bound on the IB objective, analogous to variational EM. Using this method, we derive an IB algorithm to recover features that are both relevant and sparse. Finally, we demonstrate how kernelised versions of the algorithm can be used to address a broad range of problems with non-linear relation between X and Y."}],"citation":{"chicago":"Chalk, Matthew J, Olivier Marre, and Gašper Tkačik. “Relevant Sparse Codes with Variational Information Bottleneck,” 29:1965–73. Neural Information Processing Systems, 2016.","ama":"Chalk MJ, Marre O, Tkačik G. Relevant sparse codes with variational information bottleneck. In: Vol 29. Neural Information Processing Systems; 2016:1965-1973.","short":"M.J. Chalk, O. Marre, G. Tkačik, in:, Neural Information Processing Systems, 2016, pp. 1965–1973.","ieee":"M. J. Chalk, O. Marre, and G. Tkačik, “Relevant sparse codes with variational information bottleneck,” presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain, 2016, vol. 29, pp. 1965–1973.","ista":"Chalk MJ, Marre O, Tkačik G. 2016. Relevant sparse codes with variational information bottleneck. NIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 29, 1965–1973.","mla":"Chalk, Matthew J., et al. <i>Relevant Sparse Codes with Variational Information Bottleneck</i>. Vol. 29, Neural Information Processing Systems, 2016, pp. 1965–73.","apa":"Chalk, M. J., Marre, O., &#38; Tkačik, G. (2016). Relevant sparse codes with variational information bottleneck (Vol. 29, pp. 1965–1973). Presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain: Neural Information Processing Systems."},"volume":29,"year":"2016","language":[{"iso":"eng"}],"publist_id":"6298","conference":{"location":"Barcelona, Spain","start_date":"2016-12-05","end_date":"2016-12-10","name":"NIPS: Neural Information Processing Systems"},"department":[{"_id":"GaTk"}],"page":"1965-1973","title":"Relevant sparse codes with variational information bottleneck","oa":1,"author":[{"orcid":"0000-0001-7782-4436","last_name":"Chalk","id":"2BAAC544-F248-11E8-B48F-1D18A9856A87","first_name":"Matthew J","full_name":"Chalk, Matthew J"},{"last_name":"Marre","first_name":"Olivier","full_name":"Marre, Olivier"},{"first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","last_name":"Tkacik","full_name":"Tkacik, Gasper"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:48:09Z","publisher":"Neural Information Processing Systems","month":"12","intvolume":"        29","date_published":"2016-12-01T00:00:00Z","alternative_title":["Advances in Neural Information Processing Systems"]},{"type":"journal_article","abstract":[{"text":" Cholecystokinin-expressing interneurons (CCK-INs) mediate behavior state-dependent inhibition in cortical circuits and themselves receive strong GABAergic input. However, it remains unclear to what extent GABABreceptors (GABABRs) contribute to their inhibitory control. Using immunoelectron microscopy, we found that CCK-INs in the rat hippocampus possessed high levels of dendritic GABABRs and KCTD12 auxiliary proteins, whereas postsynaptic effector Kir3 channels were present at lower levels. Consistently, whole-cell recordings revealed slow GABABR-mediated inhibitory postsynaptic currents (IPSCs) in most CCK-INs. In spite of the higher surface density of GABABRs in CCK-INs than in CA1 principal cells, the amplitudes of IPSCs were comparable, suggesting that the expression of Kir3 channels is the limiting factor for the GABABR currents in these INs. Morphological analysis showed that CCK-INs were diverse, comprising perisomatic-targeting basket cells (BCs), as well as dendrite-targeting (DT) interneurons, including a previously undescribed DT type. GABABR-mediated IPSCs in CCK-INs were large in BCs, but small in DT subtypes. In response to prolonged activation, GABABR-mediated currents displayed strong desensitization, which was absent in KCTD12-deficient mice. This study highlights that GABABRs differentially control CCK-IN subtypes, and the kinetics and desensitization of GABABR-mediated currents are modulated by KCTD12 proteins. ","lang":"eng"}],"citation":{"mla":"Booker, Sam, et al. “KCTD12 Auxiliary Proteins Modulate Kinetics of GABAB Receptor-Mediated Inhibition in Cholecystokinin-Containing Interneurons.” <i>Cerebral Cortex</i>, vol. 27, no. 3, Oxford University Press, 2016, pp. 2318–34, doi:<a href=\"https://doi.org/10.1093/cercor/bhw090\">10.1093/cercor/bhw090</a>.","apa":"Booker, S., Althof, D., Gross, A., Loreth, D., Müller, J., Unger, A., … Kulik, Á. (2016). KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons. <i>Cerebral Cortex</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/cercor/bhw090\">https://doi.org/10.1093/cercor/bhw090</a>","chicago":"Booker, Sam, Daniel Althof, Anna Gross, Desiree Loreth, Johanna Müller, Andreas Unger, Bernd Fakler, et al. “KCTD12 Auxiliary Proteins Modulate Kinetics of GABAB Receptor-Mediated Inhibition in Cholecystokinin-Containing Interneurons.” <i>Cerebral Cortex</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1093/cercor/bhw090\">https://doi.org/10.1093/cercor/bhw090</a>.","ama":"Booker S, Althof D, Gross A, et al. KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons. <i>Cerebral Cortex</i>. 2016;27(3):2318-2334. doi:<a href=\"https://doi.org/10.1093/cercor/bhw090\">10.1093/cercor/bhw090</a>","short":"S. Booker, D. Althof, A. Gross, D. Loreth, J. Müller, A. Unger, B. Fakler, A. Varro, M. Watanabe, M. Gassmann, B. Bettler, R. Shigemoto, I. Vida, Á. Kulik, Cerebral Cortex 27 (2016) 2318–2334.","ieee":"S. Booker <i>et al.</i>, “KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons,” <i>Cerebral Cortex</i>, vol. 27, no. 3. Oxford University Press, pp. 2318–2334, 2016.","ista":"Booker S, Althof D, Gross A, Loreth D, Müller J, Unger A, Fakler B, Varro A, Watanabe M, Gassmann M, Bettler B, Shigemoto R, Vida I, Kulik Á. 2016. KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons. Cerebral Cortex. 27(3), 2318–2334."},"volume":27,"day":"12","status":"public","quality_controlled":"1","_id":"1083","date_created":"2018-12-11T11:50:03Z","doi":"10.1093/cercor/bhw090","publication_status":"published","publication":"Cerebral Cortex","oa_version":"None","publisher":"Oxford University Press","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (DFG SFB 780 A2, A.K.; SFB TR3 I.V. and EXC 257, I.V.; FOR 2143, A.K. and I.V.), Spemann Graduate School (D.A.), BIOSS-2 (A6, A.K.), the Swiss National Science Foundation (3100A0-117816, B.B.), The McNaught Bequest (S.A.B. and I.V.), and Tenovus Scotland (I.V.).\r\n\r\n\r\nWe thank Cheryl Hutton and Chinmaya Sadangi for their contributions to neuronal reconstruction as well as Natalie Wernet, Sigrun Nestel, Anikó Schneider, Ina Wolter, and Ulrich Noeller for their excellent technical support. VGAT-Venus transgenic rats were generated by Drs Y. Yanagawa, M. Hirabayashi, and Y. Kawaguchi in National Institute for Physiological Sciences, Okazaki, Japan, using pCS2-Venus provided by Dr A. Miyawaki. The monoclonal mouse CCK antibody was generously provided by Dr G.V. Ohning, CURE Center, UCLA, CA. ","month":"04","intvolume":"        27","date_published":"2016-04-12T00:00:00Z","issue":"3","author":[{"full_name":"Booker, Sam","first_name":"Sam","last_name":"Booker"},{"last_name":"Althof","first_name":"Daniel","full_name":"Althof, Daniel"},{"first_name":"Anna","last_name":"Gross","full_name":"Gross, Anna"},{"first_name":"Desiree","last_name":"Loreth","full_name":"Loreth, Desiree"},{"first_name":"Johanna","last_name":"Müller","full_name":"Müller, Johanna"},{"full_name":"Unger, Andreas","first_name":"Andreas","last_name":"Unger"},{"full_name":"Fakler, Bernd","first_name":"Bernd","last_name":"Fakler"},{"last_name":"Varro","first_name":"Andrea","full_name":"Varro, Andrea"},{"full_name":"Watanabe, Masahiko","first_name":"Masahiko","last_name":"Watanabe"},{"first_name":"Martin","last_name":"Gassmann","full_name":"Gassmann, Martin"},{"first_name":"Bernhard","last_name":"Bettler","full_name":"Bettler, Bernhard"},{"full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"full_name":"Vida, Imre","last_name":"Vida","first_name":"Imre"},{"full_name":"Kulik, Ákos","last_name":"Kulik","first_name":"Ákos"}],"title":"KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:48:09Z","publist_id":"6297","department":[{"_id":"RySh"}],"page":"2318 - 2334","year":"2016","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"year":"2016","page":"76 - 84","publist_id":"6289","date_updated":"2021-01-12T06:48:11Z","author":[{"full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","orcid":"0000-0002-7008-0216","last_name":"Uhler"},{"first_name":"G V","last_name":"Shivashankar","full_name":"Shivashankar, G V"}],"title":"Geometric control and modeling of genome reprogramming","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","issue":"4","date_published":"2016-07-27T00:00:00Z","month":"07","intvolume":"         6","publisher":"Taylor & Francis","oa_version":"None","publication":"BioArchitecture","publication_status":"published","doi":"10.1080/19490992.2016.1201620","date_created":"2018-12-11T11:50:05Z","_id":"1088","quality_controlled":"1","day":"27","status":"public","volume":6,"extern":"1","citation":{"chicago":"Uhler, Caroline, and G V Shivashankar. “Geometric Control and Modeling of Genome Reprogramming.” <i>BioArchitecture</i>. Taylor &#38; Francis, 2016. <a href=\"https://doi.org/10.1080/19490992.2016.1201620\">https://doi.org/10.1080/19490992.2016.1201620</a>.","ama":"Uhler C, Shivashankar GV. Geometric control and modeling of genome reprogramming. <i>BioArchitecture</i>. 2016;6(4):76-84. doi:<a href=\"https://doi.org/10.1080/19490992.2016.1201620\">10.1080/19490992.2016.1201620</a>","short":"C. Uhler, G.V. Shivashankar, BioArchitecture 6 (2016) 76–84.","ieee":"C. Uhler and G. V. Shivashankar, “Geometric control and modeling of genome reprogramming,” <i>BioArchitecture</i>, vol. 6, no. 4. Taylor &#38; Francis, pp. 76–84, 2016.","ista":"Uhler C, Shivashankar GV. 2016. Geometric control and modeling of genome reprogramming. BioArchitecture. 6(4), 76–84.","mla":"Uhler, Caroline, and G. V. Shivashankar. “Geometric Control and Modeling of Genome Reprogramming.” <i>BioArchitecture</i>, vol. 6, no. 4, Taylor &#38; Francis, 2016, pp. 76–84, doi:<a href=\"https://doi.org/10.1080/19490992.2016.1201620\">10.1080/19490992.2016.1201620</a>.","apa":"Uhler, C., &#38; Shivashankar, G. V. (2016). Geometric control and modeling of genome reprogramming. <i>BioArchitecture</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/19490992.2016.1201620\">https://doi.org/10.1080/19490992.2016.1201620</a>"},"abstract":[{"lang":"eng","text":"Cell geometry is tightly coupled to gene expression patterns within the tissue microenvironment. This perspective synthesizes evidence that the 3D organization of chromosomes is a critical intermediate for geometric control of genomic programs. Using a combination of experiments and modeling we outline approaches to decipher the mechano-genomic code that governs cellular homeostasis and reprogramming."}],"type":"journal_article"},{"oa":1,"date_updated":"2021-01-12T06:48:12Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23\r\n(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna\r\nScience and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre\r\n(NCN), Poland under grant 2014/15/D/ST6/04543.","article_number":"24","intvolume":"        58","month":"08","date_published":"2016-08-01T00:00:00Z","alternative_title":["LIPIcs"],"year":"2016","conference":{"location":"Krakow; Poland","name":"MFCS: Mathematical Foundations of Computer Science (SG)","start_date":"2016-08-22","end_date":"2016-08-26"},"status":"public","day":"01","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2018-12-11T11:50:05Z","ddc":["004"],"volume":58,"oa_version":"Published Version","ec_funded":1,"doi":"10.4230/LIPIcs.MFCS.2016.24","file":[{"file_size":564560,"creator":"system","content_type":"application/pdf","file_id":"5286","access_level":"open_access","relation":"main_file","file_name":"IST-2017-795-v1+1_LIPIcs-MFCS-2016-24.pdf","date_updated":"2018-12-12T10:17:31Z","date_created":"2018-12-12T10:17:31Z"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","full_name":"Otop, Jan"}],"title":"Nested weighted limit-average automata of bounded width","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","pubrep_id":"795","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"6286","quality_controlled":"1","_id":"1090","type":"conference","file_date_updated":"2018-12-12T10:17:31Z","abstract":[{"text":" While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata. Nested weighted automata extend weighted automata and consist of a master automaton and a set of slave automata that are invoked by the master automaton. Nested weighted automata are strictly more expressive than weighted automata (e.g., average response time can be expressed with nested weighted automata), but the basic decision questions have higher complexity (e.g., for deterministic automata, the emptiness question for nested weighted automata is PSPACE-hard, whereas the corresponding complexity for weighted automata is PTIME). We consider a natural subclass of nested weighted automata where at any point at most a bounded number k of slave automata can be active. We focus on automata whose master value function is the limit average. We show that these nested weighted automata with bounded width are strictly more expressive than weighted automata (e.g., average response time with no overlapping requests can be expressed with bound k=1, but not with non-nested weighted automata). We show that the complexity of the basic decision problems (i.e., emptiness and universality) for the subclass with k constant matches the complexity for weighted automata. Moreover, when k is part of the input given in unary we establish PSPACE-completeness.","lang":"eng"}],"scopus_import":1,"citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Limit-Average Automata of Bounded Width,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">https://doi.org/10.4230/LIPIcs.MFCS.2016.24</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average automata of bounded width,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland, 2016, vol. 58.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ista":"Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata of bounded width. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 24.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted limit-average automata of bounded width. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">10.4230/LIPIcs.MFCS.2016.24</a>","mla":"Chatterjee, Krishnendu, et al. <i>Nested Weighted Limit-Average Automata of Bounded Width</i>. Vol. 58, 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">10.4230/LIPIcs.MFCS.2016.24</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">https://doi.org/10.4230/LIPIcs.MFCS.2016.24</a>"},"publication_status":"published","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}]},{"language":[{"iso":"eng"}],"pubrep_id":"794","publist_id":"6283","department":[{"_id":"ToHe"},{"_id":"KrCh"},{"_id":"CaGu"}],"file":[{"file_name":"IST-2017-794-v1+1_LIPIcs-CONCUR-2016-20.pdf","date_created":"2018-12-12T10:11:39Z","date_updated":"2018-12-12T10:11:39Z","file_size":501827,"creator":"system","content_type":"application/pdf","file_id":"4895","relation":"main_file","access_level":"open_access"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Daca","first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","full_name":"Daca, Przemyslaw"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"},{"full_name":"Petrov, Tatjana","last_name":"Petrov","orcid":"0000-0002-9041-0905","first_name":"Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87"}],"title":"Linear distances between Markov chains","has_accepted_license":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","project":[{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","_id":"1093","quality_controlled":"1","citation":{"mla":"Daca, Przemyslaw, et al. <i>Linear Distances between Markov Chains</i>. Vol. 59, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">10.4230/LIPIcs.CONCUR.2016.20</a>.","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., &#38; Petrov, T. (2016). Linear distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.20</a>","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Linear Distances between Markov Chains,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.20</a>.","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Linear distances between Markov chains. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 20.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City; Canada, 2016, vol. 59.","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Linear distances between Markov chains. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">10.4230/LIPIcs.CONCUR.2016.20</a>"},"type":"conference","file_date_updated":"2018-12-12T10:11:39Z","abstract":[{"lang":"eng","text":"We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by temporal logics or automata. We investigate which of the distances can be approximated by observing the systems, i.e. by black-box testing or simulation, and we provide both negative and positive results. "}],"scopus_import":1,"year":"2016","conference":{"end_date":"2016-08-26","start_date":"2016-08-23","name":"CONCUR: Concurrency Theory","location":"Quebec City; Canada"},"date_updated":"2023-09-07T11:58:33Z","oa":1,"intvolume":"        59","month":"08","date_published":"2016-08-01T00:00:00Z","alternative_title":["LIPIcs"],"acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989\r\n(QUAREM), the Austrian Science Fund (FWF) under grants project S11402-N23 (RiSE and SHiNE)\r\nand Z211-N23 (Wittgenstein Award), by the Czech Science Foundation Grant No. P202/12/G061, and\r\nby the SNSF Advanced Postdoc. Mobility Fellowship – grant number P300P2_161067.","article_number":"20","related_material":{"record":[{"id":"1155","status":"public","relation":"dissertation_contains"}]},"oa_version":"Published Version","ec_funded":1,"doi":"10.4230/LIPIcs.CONCUR.2016.20","date_created":"2018-12-11T11:50:06Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["004"],"day":"01","status":"public","volume":59},{"language":[{"iso":"eng"}],"department":[{"_id":"RySh"}],"publist_id":"6281","article_processing_charge":"No","title":"Immunogold protein localization on grid-glued freeze-fracture replicas","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Harada, Harumi","first_name":"Harumi","id":"2E55CDF2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7429-7896","last_name":"Harada"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi"}],"publisher":"Springer","publication_status":"published","project":[{"grant_number":"604102","call_identifier":"FP7","name":"Localization of ion channels and receptors by two and three-dimensional immunoelectron microscopic approaches","_id":"25CD3DD2-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","_id":"1094","abstract":[{"text":"Immunogold labeling of freeze-fracture replicas has recently been used for high-resolution visualization of protein localization in electron microscopy. This method has higher labeling efficiency than conventional immunogold methods for membrane molecules allowing precise quantitative measurements. However, one of the limitations of freeze-fracture replica immunolabeling is difficulty in keeping structural orientation and identifying labeled profiles in complex tissues like brain. The difficulty is partly due to fragmentation of freeze-fracture replica preparations during labeling procedures and limited morphological clues on the replica surface. To overcome these issues, we introduce here a grid-glued replica method combined with SEM observation. This method allows histological staining before dissolving the tissue and easy handling of replicas during immunogold labeling, and keeps the whole replica surface intact without fragmentation. The procedure described here is also useful for matched double-replica analysis allowing further identification of labeled profiles in corresponding P-face and E-face.","lang":"eng"}],"type":"book_chapter","citation":{"mla":"Harada, Harumi, and Ryuichi Shigemoto. “Immunogold Protein Localization on Grid-Glued Freeze-Fracture Replicas.” <i>High-Resolution Imaging of Cellular Proteins</i>, vol. 1474, Springer, 2016, pp. 203–16, doi:<a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">10.1007/978-1-4939-6352-2_12</a>.","apa":"Harada, H., &#38; Shigemoto, R. (2016). Immunogold protein localization on grid-glued freeze-fracture replicas. In <i>High-Resolution Imaging of Cellular Proteins</i> (Vol. 1474, pp. 203–216). Springer. <a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">https://doi.org/10.1007/978-1-4939-6352-2_12</a>","chicago":"Harada, Harumi, and Ryuichi Shigemoto. “Immunogold Protein Localization on Grid-Glued Freeze-Fracture Replicas.” In <i>High-Resolution Imaging of Cellular Proteins</i>, 1474:203–16. Springer, 2016. <a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">https://doi.org/10.1007/978-1-4939-6352-2_12</a>.","short":"H. Harada, R. Shigemoto, in:, High-Resolution Imaging of Cellular Proteins, Springer, 2016, pp. 203–216.","ieee":"H. Harada and R. Shigemoto, “Immunogold protein localization on grid-glued freeze-fracture replicas,” in <i>High-Resolution Imaging of Cellular Proteins</i>, vol. 1474, Springer, 2016, pp. 203–216.","ista":"Harada H, Shigemoto R. 2016.Immunogold protein localization on grid-glued freeze-fracture replicas. In: High-Resolution Imaging of Cellular Proteins. Methods in Molecular Biology, vol. 1474, 203–216.","ama":"Harada H, Shigemoto R. Immunogold protein localization on grid-glued freeze-fracture replicas. In: <i>High-Resolution Imaging of Cellular Proteins</i>. Vol 1474. Springer; 2016:203-216. doi:<a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">10.1007/978-1-4939-6352-2_12</a>"},"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"]},"year":"2016","page":"203 - 216","acknowledged_ssus":[{"_id":"EM-Fac"}],"date_updated":"2023-09-05T14:09:01Z","acknowledgement":"We thank Prof. Elek Molnár for providing us a pan-AMPAR anti-body used in Fig.2 and Dr. Ludek Lovicar for technical assistance in scanning electron microscope imaging. This work was supported by the European Union (HBP—Project Ref. 604102). ","alternative_title":["Methods in Molecular Biology"],"date_published":"2016-08-12T00:00:00Z","intvolume":"      1474","month":"08","ec_funded":1,"oa_version":"None","publication":"High-Resolution Imaging of Cellular Proteins","doi":"10.1007/978-1-4939-6352-2_12","day":"12","status":"public","date_created":"2018-12-11T11:50:06Z","volume":1474},{"acknowledgement":"This work has been supported by the National Research Network RiSE on Rigorous Systems Engineering\r\n(Austrian Science Fund (FWF): S11402-N23, S11403-N23, S11404-N23, S11411-N23), a Google\r\nPhD Fellowship, an Erwin Schrödinger Fellowship (Austrian Science Fund (FWF): J3696-N26), EPSRC\r\ngrants EP/H005633/1 and EP/K008528/1, the Vienna Science and Technology Fund (WWTF) trough\r\ngrant PROSEED, the European Research Council (ERC) under grant 267989 (QUAREM) and by the\r\nAustrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","article_number":"6","intvolume":"        59","month":"08","date_published":"2016-08-01T00:00:00Z","alternative_title":["LIPIcs"],"oa":1,"date_updated":"2021-01-12T06:48:14Z","conference":{"name":"CONCUR: Concurrency Theory","end_date":"2016-08-26","start_date":"2016-08-23","location":"Quebec City; Canada"},"year":"2016","volume":59,"status":"public","day":"01","date_created":"2018-12-11T11:50:07Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["004"],"doi":"10.4230/LIPIcs.CONCUR.2016.6","publication":"Leibniz International Proceedings in Informatics","oa_version":"Published Version","ec_funded":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","file":[{"creator":"system","file_size":589747,"file_id":"4795","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"IST-2017-793-v1+1_LIPIcs-CONCUR-2016-6.pdf","date_created":"2018-12-12T10:10:10Z","date_updated":"2018-12-12T10:10:10Z"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Local linearizability for concurrent container-type data structures","author":[{"first_name":"Andreas","last_name":"Haas","full_name":"Haas, Andreas"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Holzer, Andreas","last_name":"Holzer","first_name":"Andreas"},{"full_name":"Kirsch, Christoph","last_name":"Kirsch","first_name":"Christoph"},{"last_name":"Lippautz","first_name":"Michael","full_name":"Lippautz, Michael"},{"full_name":"Payer, Hannes","last_name":"Payer","first_name":"Hannes"},{"last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali","full_name":"Sezgin, Ali"},{"last_name":"Sokolova","first_name":"Ana","full_name":"Sokolova, Ana"},{"full_name":"Veith, Helmut","last_name":"Veith","first_name":"Helmut"}],"department":[{"_id":"ToHe"}],"publist_id":"6280","pubrep_id":"793","language":[{"iso":"eng"}],"type":"conference","file_date_updated":"2018-12-12T10:10:10Z","scopus_import":1,"abstract":[{"text":" The semantics of concurrent data structures is usually given by a sequential specification and a consistency condition. Linearizability is the most popular consistency condition due to its simplicity and general applicability. Nevertheless, for applications that do not require all guarantees offered by linearizability, recent research has focused on improving performance and scalability of concurrent data structures by relaxing their semantics. In this paper, we present local linearizability, a relaxed consistency condition that is applicable to container-type concurrent data structures like pools, queues, and stacks. While linearizability requires that the effect of each operation is observed by all threads at the same time, local linearizability only requires that for each thread T, the effects of its local insertion operations and the effects of those removal operations that remove values inserted by T are observed by all threads at the same time. We investigate theoretical and practical properties of local linearizability and its relationship to many existing consistency conditions. We present a generic implementation method for locally linearizable data structures that uses existing linearizable data structures as building blocks. Our implementations show performance and scalability improvements over the original building blocks and outperform the fastest existing container-type implementations. ","lang":"eng"}],"citation":{"apa":"Haas, A., Henzinger, T. A., Holzer, A., Kirsch, C., Lippautz, M., Payer, H., … Veith, H. (2016). Local linearizability for concurrent container-type data structures. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 59). Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.6\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.6</a>","mla":"Haas, Andreas, et al. “Local Linearizability for Concurrent Container-Type Data Structures.” <i>Leibniz International Proceedings in Informatics</i>, vol. 59, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.6\">10.4230/LIPIcs.CONCUR.2016.6</a>.","ista":"Haas A, Henzinger TA, Holzer A, Kirsch C, Lippautz M, Payer H, Sezgin A, Sokolova A, Veith H. 2016. Local linearizability for concurrent container-type data structures. Leibniz International Proceedings in Informatics. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 6.","ieee":"A. Haas <i>et al.</i>, “Local linearizability for concurrent container-type data structures,” in <i>Leibniz International Proceedings in Informatics</i>, Quebec City; Canada, 2016, vol. 59.","short":"A. Haas, T.A. Henzinger, A. Holzer, C. Kirsch, M. Lippautz, H. Payer, A. Sezgin, A. Sokolova, H. Veith, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ama":"Haas A, Henzinger TA, Holzer A, et al. Local linearizability for concurrent container-type data structures. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.6\">10.4230/LIPIcs.CONCUR.2016.6</a>","chicago":"Haas, Andreas, Thomas A Henzinger, Andreas Holzer, Christoph Kirsch, Michael Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, and Helmut Veith. “Local Linearizability for Concurrent Container-Type Data Structures.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.6\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.6</a>."},"quality_controlled":"1","_id":"1095","publication_status":"published","project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}]},{"oa_version":"None","related_material":{"record":[{"id":"7186","relation":"part_of_dissertation","status":"public"}]},"publication":"Developmental Cell","publication_status":"published","doi":"10.1016/j.devcel.2016.05.024","status":"public","day":"20","quality_controlled":"1","date_created":"2018-12-11T11:50:07Z","_id":"1096","scopus_import":1,"type":"journal_article","volume":37,"citation":{"mla":"Schwayer, Cornelia, et al. “Actin Rings of Power.” <i>Developmental Cell</i>, vol. 37, no. 6, Cell Press, 2016, pp. 493–506, doi:<a href=\"https://doi.org/10.1016/j.devcel.2016.05.024\">10.1016/j.devcel.2016.05.024</a>.","apa":"Schwayer, C., Sikora, M. K., Slovakova, J., Kardos, R., &#38; Heisenberg, C.-P. J. (2016). Actin rings of power. <i>Developmental Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.devcel.2016.05.024\">https://doi.org/10.1016/j.devcel.2016.05.024</a>","chicago":"Schwayer, Cornelia, Mateusz K Sikora, Jana Slovakova, Roland Kardos, and Carl-Philipp J Heisenberg. “Actin Rings of Power.” <i>Developmental Cell</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.devcel.2016.05.024\">https://doi.org/10.1016/j.devcel.2016.05.024</a>.","short":"C. Schwayer, M.K. Sikora, J. Slovakova, R. Kardos, C.-P.J. Heisenberg, Developmental Cell 37 (2016) 493–506.","ieee":"C. Schwayer, M. K. Sikora, J. Slovakova, R. Kardos, and C.-P. J. Heisenberg, “Actin rings of power,” <i>Developmental Cell</i>, vol. 37, no. 6. Cell Press, pp. 493–506, 2016.","ista":"Schwayer C, Sikora MK, Slovakova J, Kardos R, Heisenberg C-PJ. 2016. Actin rings of power. Developmental Cell. 37(6), 493–506.","ama":"Schwayer C, Sikora MK, Slovakova J, Kardos R, Heisenberg C-PJ. Actin rings of power. <i>Developmental Cell</i>. 2016;37(6):493-506. doi:<a href=\"https://doi.org/10.1016/j.devcel.2016.05.024\">10.1016/j.devcel.2016.05.024</a>"},"year":"2016","language":[{"iso":"eng"}],"department":[{"_id":"CaHe"}],"publist_id":"6279","page":"493 - 506","author":[{"last_name":"Schwayer","orcid":"0000-0001-5130-2226","first_name":"Cornelia","id":"3436488C-F248-11E8-B48F-1D18A9856A87","full_name":"Schwayer, Cornelia"},{"id":"2F74BCDE-F248-11E8-B48F-1D18A9856A87","first_name":"Mateusz K","last_name":"Sikora","full_name":"Sikora, Mateusz K"},{"full_name":"Slovakova, Jana","first_name":"Jana","id":"30F3F2F0-F248-11E8-B48F-1D18A9856A87","last_name":"Slovakova"},{"id":"4039350E-F248-11E8-B48F-1D18A9856A87","first_name":"Roland","last_name":"Kardos","full_name":"Kardos, Roland"},{"full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"title":"Actin rings of power","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","issue":"6","date_updated":"2023-09-07T12:56:41Z","publisher":"Cell Press","date_published":"2016-06-20T00:00:00Z","intvolume":"        37","month":"06"}]