[{"title":"Le problème des diviseurs pour des formes binaires de degré 4","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Walter de Gruyter","author":[{"last_name":"De La Bretèche","first_name":"Régis","full_name":"De La Bretèche, Régis"},{"full_name":"Browning, Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177"}],"extern":"1","day":"17","quality_controlled":"1","external_id":{"arxiv":["0808.2340"]},"article_processing_charge":"No","article_type":"original","publist_id":"7672","language":[{"iso":"eng"}],"type":"journal_article","publication":"Journal fur die Reine und Angewandte Mathematik","date_created":"2018-12-11T11:45:20Z","page":"1 - 44","month":"09","oa":1,"status":"public","_id":"232","year":"2010","abstract":[{"lang":"eng","text":"We study the average order of the divisor function, as it ranges over the values of binary quartic forms that are reducible over ℚ."}],"issue":"646","arxiv":1,"date_updated":"2021-01-12T06:56:45Z","citation":{"ama":"De La Bretèche R, Browning TD. Le problème des diviseurs pour des formes binaires de degré 4. <i>Journal fur die Reine und Angewandte Mathematik</i>. 2010;(646):1-44. doi:<a href=\"https://doi.org/10.1515/CRELLE.2010.064\">10.1515/CRELLE.2010.064</a>","ieee":"R. De La Bretèche and T. D. Browning, “Le problème des diviseurs pour des formes binaires de degré 4,” <i>Journal fur die Reine und Angewandte Mathematik</i>, no. 646. Walter de Gruyter, pp. 1–44, 2010.","short":"R. De La Bretèche, T.D. Browning, Journal Fur Die Reine Und Angewandte Mathematik (2010) 1–44.","apa":"De La Bretèche, R., &#38; Browning, T. D. (2010). Le problème des diviseurs pour des formes binaires de degré 4. <i>Journal Fur Die Reine Und Angewandte Mathematik</i>. Walter de Gruyter. <a href=\"https://doi.org/10.1515/CRELLE.2010.064\">https://doi.org/10.1515/CRELLE.2010.064</a>","mla":"De La Bretèche, Régis, and Timothy D. Browning. “Le Problème Des Diviseurs Pour Des Formes Binaires de Degré 4.” <i>Journal Fur Die Reine Und Angewandte Mathematik</i>, no. 646, Walter de Gruyter, 2010, pp. 1–44, doi:<a href=\"https://doi.org/10.1515/CRELLE.2010.064\">10.1515/CRELLE.2010.064</a>.","ista":"De La Bretèche R, Browning TD. 2010. Le problème des diviseurs pour des formes binaires de degré 4. Journal fur die Reine und Angewandte Mathematik. (646), 1–44.","chicago":"De La Bretèche, Régis, and Timothy D Browning. “Le Problème Des Diviseurs Pour Des Formes Binaires de Degré 4.” <i>Journal Fur Die Reine Und Angewandte Mathematik</i>. Walter de Gruyter, 2010. <a href=\"https://doi.org/10.1515/CRELLE.2010.064\">https://doi.org/10.1515/CRELLE.2010.064</a>."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/0808.2340"}],"date_published":"2010-09-17T00:00:00Z","oa_version":"Preprint","doi":"10.1515/CRELLE.2010.064","publication_status":"published"},{"author":[{"first_name":"Rupert","last_name":"Frank","full_name":"Frank, Rupert L"},{"full_name":"Lieb, Élliott H","last_name":"Lieb","first_name":"Élliott"},{"full_name":"Robert Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert"}],"_id":"2322","date_updated":"2021-01-12T06:56:46Z","year":"2010","extern":1,"day":"31","month":"03","status":"public","publisher":"World Scientific Publishing","oa":1,"title":" Equivalence of Sobolev inequalities and Lieb-Thirring inequalities","type":"conference","date_published":"2010-03-31T00:00:00Z","doi":"10.1142/9789814304634_0045 ","conference":{"name":"ICMP: International Congress on Mathematical Physics"},"publication_status":"published","date_created":"2018-12-11T11:56:59Z","page":"523 - 535","quality_controlled":0,"citation":{"ama":"Frank R, Lieb É, Seiringer R.  Equivalence of Sobolev inequalities and Lieb-Thirring inequalities. In: World Scientific Publishing; 2010:523-535. doi:<a href=\"https://doi.org/10.1142/9789814304634_0045 \">10.1142/9789814304634_0045 </a>","ieee":"R. Frank, É. Lieb, and R. Seiringer, “ Equivalence of Sobolev inequalities and Lieb-Thirring inequalities,” presented at the ICMP: International Congress on Mathematical Physics, 2010, pp. 523–535.","short":"R. Frank, É. Lieb, R. Seiringer, in:, World Scientific Publishing, 2010, pp. 523–535.","chicago":"Frank, Rupert, Élliott Lieb, and Robert Seiringer. “ Equivalence of Sobolev Inequalities and Lieb-Thirring Inequalities,” 523–35. World Scientific Publishing, 2010. <a href=\"https://doi.org/10.1142/9789814304634_0045 \">https://doi.org/10.1142/9789814304634_0045 </a>.","apa":"Frank, R., Lieb, É., &#38; Seiringer, R. (2010).  Equivalence of Sobolev inequalities and Lieb-Thirring inequalities (pp. 523–535). Presented at the ICMP: International Congress on Mathematical Physics, World Scientific Publishing. <a href=\"https://doi.org/10.1142/9789814304634_0045 \">https://doi.org/10.1142/9789814304634_0045 </a>","mla":"Frank, Rupert, et al. <i> Equivalence of Sobolev Inequalities and Lieb-Thirring Inequalities</i>. World Scientific Publishing, 2010, pp. 523–35, doi:<a href=\"https://doi.org/10.1142/9789814304634_0045 \">10.1142/9789814304634_0045 </a>.","ista":"Frank R, Lieb É, Seiringer R. 2010.  Equivalence of Sobolev inequalities and Lieb-Thirring inequalities. ICMP: International Congress on Mathematical Physics, 523–535."},"publist_id":"4605","main_file_link":[{"url":"http://arxiv.org/abs/0909.5449","open_access":"1"}]},{"_id":"2323","author":[{"last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521","full_name":"Robert Seiringer"}],"day":"31","extern":1,"year":"2010","date_updated":"2021-01-12T06:56:46Z","abstract":[{"text":"Since the first experimental realization of Bose-Einstein condensation in cold atomic gases in 1995 there has been a surge of activity in this field. Ingenious experiments have allowed us to probe matter close to zero temperature and reveal some of the fascinating effects quantum mechanics has bestowed on nature. It is a challenge for mathematical physicists to understand these various phenomena from first principles, that is, starting from the underlying many-body Schrödinger equation. Recent progress in this direction concerns mainly equilibrium properties of dilute, cold quantum gases. We shall explain some of the results in this article, and describe the mathematics involved in understanding these phenomena. Topics include the ground state energy and the free energy at positive temperature, the effect of interparticle interaction on the critical temperature for Bose-Einstein condensation, as well as the occurrence of superfluidity and quantized vortices in rapidly rotating gases.","lang":"eng"}],"month":"03","title":"Hot topics on cold gases","oa":1,"publisher":"World Scientific Publishing","status":"public","date_published":"2010-03-31T00:00:00Z","type":"conference","date_created":"2018-12-11T11:56:59Z","page":"231 - 245","conference":{"name":"ICMP: International Congress on Mathematical Physics"},"publication_status":"published","doi":"10.1142/9789814304634_0013","quality_controlled":0,"citation":{"ista":"Seiringer R. 2010. Hot topics on cold gases. ICMP: International Congress on Mathematical Physics, 231–245.","mla":"Seiringer, Robert. <i>Hot Topics on Cold Gases</i>. World Scientific Publishing, 2010, pp. 231–45, doi:<a href=\"https://doi.org/10.1142/9789814304634_0013\">10.1142/9789814304634_0013</a>.","apa":"Seiringer, R. (2010). Hot topics on cold gases (pp. 231–245). Presented at the ICMP: International Congress on Mathematical Physics, World Scientific Publishing. <a href=\"https://doi.org/10.1142/9789814304634_0013\">https://doi.org/10.1142/9789814304634_0013</a>","chicago":"Seiringer, Robert. “Hot Topics on Cold Gases,” 231–45. World Scientific Publishing, 2010. <a href=\"https://doi.org/10.1142/9789814304634_0013\">https://doi.org/10.1142/9789814304634_0013</a>.","ama":"Seiringer R. Hot topics on cold gases. In: World Scientific Publishing; 2010:231-245. doi:<a href=\"https://doi.org/10.1142/9789814304634_0013\">10.1142/9789814304634_0013</a>","ieee":"R. Seiringer, “Hot topics on cold gases,” presented at the ICMP: International Congress on Mathematical Physics, 2010, pp. 231–245.","short":"R. Seiringer, in:, World Scientific Publishing, 2010, pp. 231–245."},"publist_id":"4604","main_file_link":[{"url":"http://arxiv.org/abs/0908.3686","open_access":"1"}]},{"type":"book_chapter","date_published":"2010-01-01T00:00:00Z","doi":"10.1007/978-1-4419-1341-8_6","publication_status":"published","publication":"Around the Research of Vladimir Maz'ya I","page":"161 - 167","date_created":"2018-12-11T11:56:59Z","intvolume":"        11","citation":{"apa":"Frank, R., &#38; Seiringer, R. (2010). Sharp fractional Hardy inequalities in half-spaces. In <i>Around the Research of Vladimir Maz’ya I</i> (Vol. 11, pp. 161–167). Springer. <a href=\"https://doi.org/10.1007/978-1-4419-1341-8_6\">https://doi.org/10.1007/978-1-4419-1341-8_6</a>","ista":"Frank R, Seiringer R. 2010.Sharp fractional Hardy inequalities in half-spaces. In: Around the Research of Vladimir Maz’ya I. International Mathematical Series, vol. 11, 161–167.","mla":"Frank, Rupert, and Robert Seiringer. “Sharp Fractional Hardy Inequalities in Half-Spaces.” <i>Around the Research of Vladimir Maz’ya I</i>, vol. 11, Springer, 2010, pp. 161–67, doi:<a href=\"https://doi.org/10.1007/978-1-4419-1341-8_6\">10.1007/978-1-4419-1341-8_6</a>.","chicago":"Frank, Rupert, and Robert Seiringer. “Sharp Fractional Hardy Inequalities in Half-Spaces.” In <i>Around the Research of Vladimir Maz’ya I</i>, 11:161–67. Springer, 2010. <a href=\"https://doi.org/10.1007/978-1-4419-1341-8_6\">https://doi.org/10.1007/978-1-4419-1341-8_6</a>.","ieee":"R. Frank and R. Seiringer, “Sharp fractional Hardy inequalities in half-spaces,” in <i>Around the Research of Vladimir Maz’ya I</i>, vol. 11, Springer, 2010, pp. 161–167.","ama":"Frank R, Seiringer R. Sharp fractional Hardy inequalities in half-spaces. In: <i>Around the Research of Vladimir Maz’ya I</i>. Vol 11. Springer; 2010:161-167. doi:<a href=\"https://doi.org/10.1007/978-1-4419-1341-8_6\">10.1007/978-1-4419-1341-8_6</a>","short":"R. Frank, R. Seiringer, in:, Around the Research of Vladimir Maz’ya I, Springer, 2010, pp. 161–167."},"quality_controlled":0,"volume":11,"publist_id":"4603","main_file_link":[{"url":"http://arxiv.org/abs/0906.1561","open_access":"1"}],"author":[{"full_name":"Frank, Rupert L","first_name":"Rupert","last_name":"Frank"},{"first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","full_name":"Robert Seiringer"}],"_id":"2324","abstract":[{"text":"We determine the sharp constant in the Hardy inequality for fractional Sobolev spaces on half-spaces. Our proof relies on a nonlinear and nonlocal version of the ground state representation.","lang":"eng"}],"date_updated":"2021-01-12T06:56:46Z","year":"2010","extern":1,"day":"01","alternative_title":["International Mathematical Series"],"month":"01","status":"public","publisher":"Springer","oa":1,"title":"Sharp fractional Hardy inequalities in half-spaces"},{"main_file_link":[{"url":"http://arxiv.org/abs/0808.3737","open_access":"1"}],"publist_id":"4537","intvolume":"       283","citation":{"ama":"Hainzl C, Seiringer R. Asymptotic behavior of eigenvalues of Schrödinger type operators with degenerate kinetic energy. <i>Mathematische Nachrichten</i>. 2010;283(3):489-499. doi:<a href=\"https://doi.org/10.1002/mana.200810195\">10.1002/mana.200810195</a>","ieee":"C. Hainzl and R. Seiringer, “Asymptotic behavior of eigenvalues of Schrödinger type operators with degenerate kinetic energy,” <i>Mathematische Nachrichten</i>, vol. 283, no. 3. Wiley-Blackwell, pp. 489–499, 2010.","short":"C. Hainzl, R. Seiringer, Mathematische Nachrichten 283 (2010) 489–499.","apa":"Hainzl, C., &#38; Seiringer, R. (2010). Asymptotic behavior of eigenvalues of Schrödinger type operators with degenerate kinetic energy. <i>Mathematische Nachrichten</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/mana.200810195\">https://doi.org/10.1002/mana.200810195</a>","mla":"Hainzl, Christian, and Robert Seiringer. “Asymptotic Behavior of Eigenvalues of Schrödinger Type Operators with Degenerate Kinetic Energy.” <i>Mathematische Nachrichten</i>, vol. 283, no. 3, Wiley-Blackwell, 2010, pp. 489–99, doi:<a href=\"https://doi.org/10.1002/mana.200810195\">10.1002/mana.200810195</a>.","ista":"Hainzl C, Seiringer R. 2010. Asymptotic behavior of eigenvalues of Schrödinger type operators with degenerate kinetic energy. Mathematische Nachrichten. 283(3), 489–499.","chicago":"Hainzl, Christian, and Robert Seiringer. “Asymptotic Behavior of Eigenvalues of Schrödinger Type Operators with Degenerate Kinetic Energy.” <i>Mathematische Nachrichten</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1002/mana.200810195\">https://doi.org/10.1002/mana.200810195</a>."},"quality_controlled":0,"volume":283,"publication":"Mathematische Nachrichten","page":"489 - 499","date_created":"2018-12-11T11:57:23Z","doi":"10.1002/mana.200810195","publication_status":"published","date_published":"2010-03-01T00:00:00Z","type":"journal_article","oa":1,"title":"Asymptotic behavior of eigenvalues of Schrödinger type operators with degenerate kinetic energy","status":"public","publisher":"Wiley-Blackwell","month":"03","year":"2010","extern":1,"day":"01","issue":"3","abstract":[{"text":"We study the eigenvalues of Schrödinger type operators T + λV and their asymptotic behavior in the small coupling limit λ → 0, in the case where the symbol of the kinetic energy, T (p), strongly degenerates on a non-trivial manifold of codimension one.","lang":"eng"}],"date_updated":"2021-01-12T06:57:11Z","_id":"2389","author":[{"first_name":"Christian","last_name":"Hainzl","full_name":"Hainzl, Christian"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","full_name":"Robert Seiringer"}]},{"citation":{"chicago":"Frank, Rupert, Élliott Lieb, Robert Seiringer, and Lawrence Thomas. “Bipolaron and N-Polaron Binding Energies.” <i>Physical Review Letters</i>. American Physical Society, 2010. <a href=\"https://doi.org/10.1103/PhysRevLett.104.210402\">https://doi.org/10.1103/PhysRevLett.104.210402</a>.","mla":"Frank, Rupert, et al. “Bipolaron and N-Polaron Binding Energies.” <i>Physical Review Letters</i>, vol. 104, no. 21, American Physical Society, 2010, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.104.210402\">10.1103/PhysRevLett.104.210402</a>.","apa":"Frank, R., Lieb, É., Seiringer, R., &#38; Thomas, L. (2010). Bipolaron and N-polaron binding energies. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.104.210402\">https://doi.org/10.1103/PhysRevLett.104.210402</a>","ista":"Frank R, Lieb É, Seiringer R, Thomas L. 2010. Bipolaron and N-polaron binding energies. Physical Review Letters. 104(21).","ieee":"R. Frank, É. Lieb, R. Seiringer, and L. Thomas, “Bipolaron and N-polaron binding energies,” <i>Physical Review Letters</i>, vol. 104, no. 21. American Physical Society, 2010.","ama":"Frank R, Lieb É, Seiringer R, Thomas L. Bipolaron and N-polaron binding energies. <i>Physical Review Letters</i>. 2010;104(21). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.104.210402\">10.1103/PhysRevLett.104.210402</a>","short":"R. Frank, É. Lieb, R. Seiringer, L. Thomas, Physical Review Letters 104 (2010)."},"quality_controlled":0,"volume":104,"intvolume":"       104","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1004.1196"}],"publist_id":"4536","date_published":"2010-01-01T00:00:00Z","type":"journal_article","date_created":"2018-12-11T11:57:24Z","publication":"Physical Review Letters","publication_status":"published","doi":"10.1103/PhysRevLett.104.210402","month":"01","title":"Bipolaron and N-polaron binding energies","oa":1,"status":"public","publisher":"American Physical Society","_id":"2392","author":[{"last_name":"Frank","first_name":"Rupert","full_name":"Frank, Rupert L"},{"first_name":"Élliott","last_name":"Lieb","full_name":"Lieb, Élliott H"},{"full_name":"Robert Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Thomas, Lawrence E","first_name":"Lawrence","last_name":"Thomas"}],"day":"01","extern":1,"year":"2010","date_updated":"2021-01-12T06:57:12Z","issue":"21","abstract":[{"lang":"eng","text":"The binding of polarons, or its absence, is an old and subtle topic. Here we prove two things rigorously. First, the transition from many-body collapse to the existence of a thermodynamic limit for N polarons occurs precisely at U=2α, where U is the electronic Coulomb repulsion and α is the polaron coupling constant. Second, if U is large enough, there is no multipolaron binding of any kind. Considering the known fact that there is binding for some U&gt;2α, these conclusions are not obvious and their proof has been an open problem for some time."}]},{"intvolume":"         5","citation":{"short":"A. Kupczok, H. Schmidt, A. Von Haeseler, Algorithms for Molecular Biology 5 (2010).","ieee":"A. Kupczok, H. Schmidt, and A. Von Haeseler, “Accuracy of phylogeny reconstruction methods combining overlapping gene data sets ,” <i>Algorithms for Molecular Biology</i>, vol. 5, no. 1. BioMed Central, 2010.","ama":"Kupczok A, Schmidt H, Von Haeseler A. Accuracy of phylogeny reconstruction methods combining overlapping gene data sets . <i>Algorithms for Molecular Biology</i>. 2010;5(1). doi:<a href=\"https://doi.org/10.1186/1748-7188-5-37\">10.1186/1748-7188-5-37</a>","apa":"Kupczok, A., Schmidt, H., &#38; Von Haeseler, A. (2010). Accuracy of phylogeny reconstruction methods combining overlapping gene data sets . <i>Algorithms for Molecular Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1748-7188-5-37\">https://doi.org/10.1186/1748-7188-5-37</a>","mla":"Kupczok, Anne, et al. “Accuracy of Phylogeny Reconstruction Methods Combining Overlapping Gene Data Sets .” <i>Algorithms for Molecular Biology</i>, vol. 5, no. 1, 37, BioMed Central, 2010, doi:<a href=\"https://doi.org/10.1186/1748-7188-5-37\">10.1186/1748-7188-5-37</a>.","ista":"Kupczok A, Schmidt H, Von Haeseler A. 2010. Accuracy of phylogeny reconstruction methods combining overlapping gene data sets . Algorithms for Molecular Biology. 5(1), 37.","chicago":"Kupczok, Anne, Heiko Schmidt, and Arndt Von Haeseler. “Accuracy of Phylogeny Reconstruction Methods Combining Overlapping Gene Data Sets .” <i>Algorithms for Molecular Biology</i>. BioMed Central, 2010. <a href=\"https://doi.org/10.1186/1748-7188-5-37\">https://doi.org/10.1186/1748-7188-5-37</a>."},"scopus_import":1,"file_date_updated":"2020-07-14T12:45:40Z","ddc":["576"],"oa_version":"Published Version","date_published":"2010-12-06T00:00:00Z","doi":"10.1186/1748-7188-5-37","publication_status":"published","month":"12","status":"public","oa":1,"article_number":"37","_id":"2409","abstract":[{"text":"Background: The availability of many gene alignments with overlapping taxon sets raises the question of which strategy is the best to infer species phylogenies from multiple gene information. Methods and programs abound that use the gene alignment in different ways to reconstruct the species tree. In particular, different methods combine the original data at different points along the way from the underlying sequences to the final tree. Accordingly, they are classified into superalignment, supertree and medium-level approaches. Here, we present a simulation study to compare different methods from each of these three approaches.\r\n\r\nResults: We observe that superalignment methods usually outperform the other approaches over a wide range of parameters including sparse data and gene-specific evolutionary parameters. In the presence of high incongruency among gene trees, however, other combination methods show better performance than the superalignment approach. Surprisingly, some supertree and medium-level methods exhibit, on average, worse results than a single gene phylogeny with complete taxon information.\r\n\r\nConclusions: For some methods, using the reconstructed gene tree as an estimation of the species tree is superior to the combination of incomplete information. Superalignment usually performs best since it is less susceptible to stochastic error. Supertree methods can outperform superalignment in the presence of gene-tree conflict.","lang":"eng"}],"issue":"1","date_updated":"2021-01-12T06:57:18Z","year":"2010","volume":5,"quality_controlled":"1","pubrep_id":"939","publist_id":"4517","type":"journal_article","department":[{"_id":"JoBo"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publication":"Algorithms for Molecular Biology","date_created":"2018-12-11T11:57:30Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"BioMed Central","title":"Accuracy of phylogeny reconstruction methods combining overlapping gene data sets ","author":[{"full_name":"Kupczok, Anne","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Kupczok","first_name":"Anne"},{"full_name":"Schmidt, Heiko","last_name":"Schmidt","first_name":"Heiko"},{"full_name":"Von Haeseler, Arndt","last_name":"Von Haeseler","first_name":"Arndt"}],"file":[{"file_size":723929,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"system","file_id":"4739","checksum":"e2497285388bc4da629bafb46662eb43","date_created":"2018-12-12T10:09:16Z","file_name":"IST-2018-939-v1+1_2010_Kupczok_Accuracy_of.pdf","date_updated":"2020-07-14T12:45:40Z"}],"acknowledgement":"Financial support from the Wiener Wissenschafts-, Forschungs- and Technologiefonds (WWTF) is greatly appreciated. A.v.H. acknowledges support from the German Research Foundation (DFG, SPP-1174).","day":"06","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"publication":"Israel Journal of Mathematics","date_created":"2018-12-11T11:57:38Z","page":"381 - 402","doi":"10.1007/s11856-009-0119-5","publication_status":"published","date_published":"2010-11-01T00:00:00Z","type":"journal_article","publist_id":"4472","quality_controlled":0,"citation":{"short":"E. Nevo, U. Wagner, Israel Journal of Mathematics 174 (2010) 381–402.","ieee":"E. Nevo and U. Wagner, “On the embeddability of skeleta of spheres,” <i>Israel Journal of Mathematics</i>, vol. 174, no. 1. Springer, pp. 381–402, 2010.","ama":"Nevo E, Wagner U. On the embeddability of skeleta of spheres. <i>Israel Journal of Mathematics</i>. 2010;174(1):381-402. doi:<a href=\"https://doi.org/10.1007/s11856-009-0119-5\">10.1007/s11856-009-0119-5</a>","apa":"Nevo, E., &#38; Wagner, U. (2010). On the embeddability of skeleta of spheres. <i>Israel Journal of Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s11856-009-0119-5\">https://doi.org/10.1007/s11856-009-0119-5</a>","ista":"Nevo E, Wagner U. 2010. On the embeddability of skeleta of spheres. Israel Journal of Mathematics. 174(1), 381–402.","mla":"Nevo, Eran, and Uli Wagner. “On the Embeddability of Skeleta of Spheres.” <i>Israel Journal of Mathematics</i>, vol. 174, no. 1, Springer, 2010, pp. 381–402, doi:<a href=\"https://doi.org/10.1007/s11856-009-0119-5\">10.1007/s11856-009-0119-5</a>.","chicago":"Nevo, Eran, and Uli Wagner. “On the Embeddability of Skeleta of Spheres.” <i>Israel Journal of Mathematics</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s11856-009-0119-5\">https://doi.org/10.1007/s11856-009-0119-5</a>."},"volume":174,"intvolume":"       174","year":"2010","extern":1,"day":"01","issue":"1","abstract":[{"text":"We consider a generalization of the van Kampen-Flores Theorem and relate it to the long-standing g-conjecture for simplicial spheres.\n","lang":"eng"}],"date_updated":"2021-01-12T06:57:28Z","_id":"2435","author":[{"first_name":"Eran","last_name":"Nevo","full_name":"Nevo, Eran"},{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","orcid":"0000-0002-1494-0568","full_name":"Uli Wagner"}],"title":"On the embeddability of skeleta of spheres","publisher":"Springer","status":"public","month":"11"},{"day":"18","extern":"1","author":[{"first_name":"E. K. H.","last_name":"Salje","full_name":"Salje, E. K. H."},{"full_name":"Safarik, D. J.","first_name":"D. J.","last_name":"Safarik"},{"full_name":"Modic, Kimberly A","last_name":"Modic","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147","first_name":"Kimberly A"},{"last_name":"Gubernatis","first_name":"J. E.","full_name":"Gubernatis, J. E."},{"full_name":"Cooley, J. C.","last_name":"Cooley","first_name":"J. C."},{"full_name":"Taylor, R. D.","first_name":"R. D.","last_name":"Taylor"},{"full_name":"Mihaila, B.","last_name":"Mihaila","first_name":"B."},{"full_name":"Saxena, A.","last_name":"Saxena","first_name":"A."},{"full_name":"Lookman, T.","last_name":"Lookman","first_name":"T."},{"last_name":"Smith","first_name":"J. L.","full_name":"Smith, J. L."},{"last_name":"Fisher","first_name":"R. A.","full_name":"Fisher, R. A."},{"first_name":"M.","last_name":"Pasternak","full_name":"Pasternak, M."},{"last_name":"Opeil","first_name":"C. P.","full_name":"Opeil, C. P."},{"full_name":"Siegrist, T.","first_name":"T.","last_name":"Siegrist"},{"first_name":"P. B.","last_name":"Littlewood","full_name":"Littlewood, P. B."},{"full_name":"Lashley, J. C.","last_name":"Lashley","first_name":"J. C."}],"title":"Tin telluride: A weakly co-elastic metal","publisher":"APS","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2019-11-19T13:46:28Z","publication":"Physical Review B","language":[{"iso":"eng"}],"type":"journal_article","article_type":"original","article_processing_charge":"No","external_id":{"arxiv":["1011.1445"]},"quality_controlled":"1","volume":82,"year":"2010","date_updated":"2021-01-12T08:11:44Z","issue":"18","arxiv":1,"abstract":[{"lang":"eng","text":"We report resonant ultrasound spectroscopy (RUS), dilatometry/magnetostriction, magnetotransport, magnetization, specific-heat, and 119Sn Mössbauer spectroscopy measurements on SnTe and Sn0.995Cr0.005Te. Hall measurements at T=77 K indicate that our Bridgman-grown single crystals have a p-type carrier concentration of 3.4×1019 cm−3 and that our Cr-doped crystals have an n-type concentration of 5.8×1022 cm−3. Although our SnTe crystals are diamagnetic over the temperature range 2≤T≤1100 K, the Cr-doped crystals are room-temperature ferromagnets with a Curie temperature of 294 K. For each sample type, three-terminal capacitive dilatometry measurements detect a subtle 0.5 μm distortion at Tc≈85 K. Whereas our RUS measurements on SnTe show elastic hardening near the structural transition, pointing to co-elastic behavior, similar measurements on Sn0.995Cr0.005Te show a pronounced softening, pointing to ferroelastic behavior. Effective Debye temperature, θD, values of SnTe obtained from 119Sn Mössbauer studies show a hardening of phonons in the range 60–115 K (θD=162 K) as compared with the 100–300 K range (θD=150 K). In addition, a precursor softening extending over approximately 100 K anticipates this collapse at the critical temperature and quantitative analysis over three decades of its reduced modulus finds ΔC44/C44=A|(T−T0)/T0|−κ with κ=0.50±0.02, a value indicating a three-dimensional softening of phonon branches at a temperature T0∼75 K, considerably below Tc. We suggest that the differences in these two types of elastic behaviors lie in the absence of elastic domain-wall motion in the one case and their nucleation in the other."}],"_id":"7078","article_number":"184112","oa":1,"publication_identifier":{"issn":["1098-0121","1550-235X"]},"status":"public","month":"11","publication_status":"published","doi":"10.1103/physrevb.82.184112","date_published":"2010-11-18T00:00:00Z","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1011.1445"}],"citation":{"ieee":"E. K. H. Salje <i>et al.</i>, “Tin telluride: A weakly co-elastic metal,” <i>Physical Review B</i>, vol. 82, no. 18. APS, 2010.","ama":"Salje EKH, Safarik DJ, Modic KA, et al. Tin telluride: A weakly co-elastic metal. <i>Physical Review B</i>. 2010;82(18). doi:<a href=\"https://doi.org/10.1103/physrevb.82.184112\">10.1103/physrevb.82.184112</a>","short":"E.K.H. Salje, D.J. Safarik, K.A. Modic, J.E. Gubernatis, J.C. Cooley, R.D. Taylor, B. Mihaila, A. Saxena, T. Lookman, J.L. Smith, R.A. Fisher, M. Pasternak, C.P. Opeil, T. Siegrist, P.B. Littlewood, J.C. Lashley, Physical Review B 82 (2010).","apa":"Salje, E. K. H., Safarik, D. J., Modic, K. A., Gubernatis, J. E., Cooley, J. C., Taylor, R. D., … Lashley, J. C. (2010). Tin telluride: A weakly co-elastic metal. <i>Physical Review B</i>. APS. <a href=\"https://doi.org/10.1103/physrevb.82.184112\">https://doi.org/10.1103/physrevb.82.184112</a>","mla":"Salje, E. K. H., et al. “Tin Telluride: A Weakly Co-Elastic Metal.” <i>Physical Review B</i>, vol. 82, no. 18, 184112, APS, 2010, doi:<a href=\"https://doi.org/10.1103/physrevb.82.184112\">10.1103/physrevb.82.184112</a>.","ista":"Salje EKH, Safarik DJ, Modic KA, Gubernatis JE, Cooley JC, Taylor RD, Mihaila B, Saxena A, Lookman T, Smith JL, Fisher RA, Pasternak M, Opeil CP, Siegrist T, Littlewood PB, Lashley JC. 2010. Tin telluride: A weakly co-elastic metal. Physical Review B. 82(18), 184112.","chicago":"Salje, E. K. H., D. J. Safarik, Kimberly A Modic, J. E. Gubernatis, J. C. Cooley, R. D. Taylor, B. Mihaila, et al. “Tin Telluride: A Weakly Co-Elastic Metal.” <i>Physical Review B</i>. APS, 2010. <a href=\"https://doi.org/10.1103/physrevb.82.184112\">https://doi.org/10.1103/physrevb.82.184112</a>."},"intvolume":"        82"},{"month":"02","title":"Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures","publication_identifier":{"issn":["0021-8979","1089-7550"]},"status":"public","publisher":"AIP","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7079","article_number":"033519","author":[{"first_name":"Fivos R.","last_name":"Drymiotis","full_name":"Drymiotis, Fivos R."},{"last_name":"Drye","first_name":"Tyler B.","full_name":"Drye, Tyler B."},{"last_name":"Wang","first_name":"Yisha","full_name":"Wang, Yisha"},{"first_name":"Jian","last_name":"He","full_name":"He, Jian"},{"first_name":"Daniel","last_name":"Rhodes","full_name":"Rhodes, Daniel"},{"full_name":"Modic, Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","last_name":"Modic","orcid":"0000-0001-9760-3147","first_name":"Kimberly A"},{"last_name":"Cawthorne","first_name":"Samantha","full_name":"Cawthorne, Samantha"},{"full_name":"Zhang, Qiu Run","last_name":"Zhang","first_name":"Qiu Run"}],"day":"09","extern":"1","year":"2010","date_updated":"2021-01-12T08:11:44Z","issue":"3","abstract":[{"lang":"eng","text":"We have observed that reacting Pb:Te:Ag:Se in a 1:1:1.9:1 molar ratio gives rise to what appears to be a predominantly single-phase alloy, which crystallizes in the PbSe cF8 fcc structure. However, further investigation of the structure using energy dispersive x-ray analysis reveals the presence of two phases, PbSe and β-Ag2Te, with identical lattice parameters. The total thermal conductivity of the formed alloy is remarkably low for a crystalline material, κT<0.6W∕mK at 675K, it is reproducible, and in addition, the compound has good mechanical properties."}],"volume":107,"intvolume":"       107","quality_controlled":"1","citation":{"short":"F.R. Drymiotis, T.B. Drye, Y. Wang, J. He, D. Rhodes, K.A. Modic, S. Cawthorne, Q.R. Zhang, Journal of Applied Physics 107 (2010).","ama":"Drymiotis FR, Drye TB, Wang Y, et al. Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures. <i>Journal of Applied Physics</i>. 2010;107(3). doi:<a href=\"https://doi.org/10.1063/1.3284946\">10.1063/1.3284946</a>","ieee":"F. R. Drymiotis <i>et al.</i>, “Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures,” <i>Journal of Applied Physics</i>, vol. 107, no. 3. AIP, 2010.","chicago":"Drymiotis, Fivos R., Tyler B. Drye, Yisha Wang, Jian He, Daniel Rhodes, Kimberly A Modic, Samantha Cawthorne, and Qiu Run Zhang. “Structure Formation and Very Low Thermal Conductivity in Pb:Te:Ag:Se Mixtures.” <i>Journal of Applied Physics</i>. AIP, 2010. <a href=\"https://doi.org/10.1063/1.3284946\">https://doi.org/10.1063/1.3284946</a>.","apa":"Drymiotis, F. R., Drye, T. B., Wang, Y., He, J., Rhodes, D., Modic, K. A., … Zhang, Q. R. (2010). Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures. <i>Journal of Applied Physics</i>. AIP. <a href=\"https://doi.org/10.1063/1.3284946\">https://doi.org/10.1063/1.3284946</a>","mla":"Drymiotis, Fivos R., et al. “Structure Formation and Very Low Thermal Conductivity in Pb:Te:Ag:Se Mixtures.” <i>Journal of Applied Physics</i>, vol. 107, no. 3, 033519, AIP, 2010, doi:<a href=\"https://doi.org/10.1063/1.3284946\">10.1063/1.3284946</a>.","ista":"Drymiotis FR, Drye TB, Wang Y, He J, Rhodes D, Modic KA, Cawthorne S, Zhang QR. 2010. Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures. Journal of Applied Physics. 107(3), 033519."},"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"date_published":"2010-02-09T00:00:00Z","type":"journal_article","oa_version":"None","date_created":"2019-11-19T13:47:24Z","publication":"Journal of Applied Physics","publication_status":"published","doi":"10.1063/1.3284946"},{"status":"public","publisher":"The Electrochemical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells","publication_identifier":{"issn":["1099-0062"]},"month":"10","date_updated":"2021-01-12T08:13:01Z","issue":"12","abstract":[{"lang":"eng","text":"The decomposition reaction of H2O2 aqueous solutions (H2O2 - H2O + 1/2O2) catalyzed by transition metal oxide powders has been compared with the charging voltage of nonaqueous Li-O2 cells containing the same catalyst. An inverse linear relationship between Ln k (rate constant for the H2O2 decomposition) and the charging voltage has been found, despite differences in media and possible mechanistic differences. The results suggest that the decomposition may be a reliable, useful, and fast screening tool for materials that promote the charging process of the Li-O2 battery and may ultimately give insight into the charging mechanism."}],"day":"04","extern":"1","year":"2010","article_number":"A180","author":[{"full_name":"Giordani, V.","last_name":"Giordani","first_name":"V."},{"full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","first_name":"Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger"},{"full_name":"Bruce, P. G.","first_name":"P. G.","last_name":"Bruce"},{"full_name":"Tarascon, J.-M.","first_name":"J.-M.","last_name":"Tarascon"},{"full_name":"Larcher, D.","last_name":"Larcher","first_name":"D."}],"_id":"7318","article_processing_charge":"No","article_type":"letter_note","volume":13,"intvolume":"        13","quality_controlled":"1","citation":{"chicago":"Giordani, V., Stefan Alexander Freunberger, P. G. Bruce, J.-M. Tarascon, and D. Larcher. “H2O2 Decomposition Reaction as Selecting Tool for Catalysts in Li–O2 Cells.” <i>Electrochemical and Solid-State Letters</i>. The Electrochemical Society, 2010. <a href=\"https://doi.org/10.1149/1.3494045\">https://doi.org/10.1149/1.3494045</a>.","apa":"Giordani, V., Freunberger, S. A., Bruce, P. G., Tarascon, J.-M., &#38; Larcher, D. (2010). H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells. <i>Electrochemical and Solid-State Letters</i>. The Electrochemical Society. <a href=\"https://doi.org/10.1149/1.3494045\">https://doi.org/10.1149/1.3494045</a>","mla":"Giordani, V., et al. “H2O2 Decomposition Reaction as Selecting Tool for Catalysts in Li–O2 Cells.” <i>Electrochemical and Solid-State Letters</i>, vol. 13, no. 12, A180, The Electrochemical Society, 2010, doi:<a href=\"https://doi.org/10.1149/1.3494045\">10.1149/1.3494045</a>.","ista":"Giordani V, Freunberger SA, Bruce PG, Tarascon J-M, Larcher D. 2010. H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells. Electrochemical and Solid-State Letters. 13(12), A180.","ama":"Giordani V, Freunberger SA, Bruce PG, Tarascon J-M, Larcher D. H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells. <i>Electrochemical and Solid-State Letters</i>. 2010;13(12). doi:<a href=\"https://doi.org/10.1149/1.3494045\">10.1149/1.3494045</a>","ieee":"V. Giordani, S. A. Freunberger, P. G. Bruce, J.-M. Tarascon, and D. Larcher, “H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells,” <i>Electrochemical and Solid-State Letters</i>, vol. 13, no. 12. The Electrochemical Society, 2010.","short":"V. Giordani, S.A. Freunberger, P.G. Bruce, J.-M. Tarascon, D. Larcher, Electrochemical and Solid-State Letters 13 (2010)."},"publication_status":"published","doi":"10.1149/1.3494045","date_created":"2020-01-15T12:21:06Z","publication":"Electrochemical and Solid-State Letters","type":"journal_article","oa_version":"None","language":[{"iso":"eng"}],"date_published":"2010-10-04T00:00:00Z"},{"alternative_title":["LNCS"],"month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","status":"public","title":"Fast randomized test-and-set and renaming","author":[{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Attiya","first_name":"Hagit","full_name":"Attiya, Hagit"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"full_name":"Giurgiu, Andrei","last_name":"Giurgiu","first_name":"Andrei"},{"full_name":"Guerraoui, Rachid","first_name":"Rachid","last_name":"Guerraoui"}],"_id":"754","acknowledgement":"The work of Dan Alistarh is supported by the Swiss NCCR MICS project. The work of Hagit Attiya is supported in part by the Israel Science Foundation (grant number 953/06).","abstract":[{"lang":"eng","text":"Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when trying to implement such a scheme and shed new light on the read-write complexity of randomized renaming in an asynchronous environment. At the heart of our new perspective stands an adaptive implementation of a randomized test-and-set object, that has poly-logarithmic step complexity per operation, with high probability. Interestingly, our implementation is anonymous, as it does not require process identifiers. Based on this implementation, we present two new randomized renaming algorithms. The first ensures a tight namespace of n names using O( n log4 n) total steps, with high probability. This significantly improves on the complexity of the best previously known namespace-optimal algorithms. The second algorithm achieves a namespace of size k (1 + ε) using O( k log4 k / log2 (1 + ε) ) total steps, both with high probability, where k is the total contention in the execution. It is the first adaptive randomized renaming algorithm, and it improves on existing deterministic solutions by providing a smaller namespace, and by lowering step complexity."}],"date_updated":"2023-02-23T13:10:21Z","extern":"1","year":"2010","day":"01","volume":"6343 LNCS","citation":{"chicago":"Alistarh, Dan-Adrian, Hagit Attiya, Seth Gilbert, Andrei Giurgiu, and Rachid Guerraoui. “Fast Randomized Test-and-Set and Renaming,” 6343 LNCS:94–108. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_9\">https://doi.org/10.1007/978-3-642-15763-9_9</a>.","mla":"Alistarh, Dan-Adrian, et al. <i>Fast Randomized Test-and-Set and Renaming</i>. Vol. 6343 LNCS, Springer, 2010, pp. 94–108, doi:<a href=\"https://doi.org/10.1007/978-3-642-15763-9_9\">10.1007/978-3-642-15763-9_9</a>.","apa":"Alistarh, D.-A., Attiya, H., Gilbert, S., Giurgiu, A., &#38; Guerraoui, R. (2010). Fast randomized test-and-set and renaming (Vol. 6343 LNCS, pp. 94–108). Presented at the DISC: Distributed Computing, Springer. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_9\">https://doi.org/10.1007/978-3-642-15763-9_9</a>","ista":"Alistarh D-A, Attiya H, Gilbert S, Giurgiu A, Guerraoui R. 2010. Fast randomized test-and-set and renaming. DISC: Distributed Computing, LNCS, vol. 6343 LNCS, 94–108.","short":"D.-A. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, R. Guerraoui, in:, Springer, 2010, pp. 94–108.","ieee":"D.-A. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, and R. Guerraoui, “Fast randomized test-and-set and renaming,” presented at the DISC: Distributed Computing, 2010, vol. 6343 LNCS, pp. 94–108.","ama":"Alistarh D-A, Attiya H, Gilbert S, Giurgiu A, Guerraoui R. Fast randomized test-and-set and renaming. In: Vol 6343 LNCS. Springer; 2010:94-108. doi:<a href=\"https://doi.org/10.1007/978-3-642-15763-9_9\">10.1007/978-3-642-15763-9_9</a>"},"article_processing_charge":"No","publist_id":"6900","oa_version":"None","type":"conference","date_published":"2010-01-01T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-15763-9_9","conference":{"name":"DISC: Distributed Computing"},"publication_status":"published","page":"94 - 108","date_created":"2018-12-11T11:48:19Z"},{"article_processing_charge":"No","publist_id":"6901","volume":"6199 LNCS","citation":{"ista":"Alistarh D-A, Gilbert S, Guerraoui R, Zadimoghaddam M. 2010. How efficient can gossip be? (On the cost of resilient information exchange). ICALP: International Colloquium on Automota, Languages and Programming, LNCS, vol. 6199 LNCS, 115–126.","mla":"Alistarh, Dan-Adrian, et al. <i>How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)</i>. Vol. 6199 LNCS, no. PART 2, Springer, 2010, pp. 115–26, doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1_10\">10.1007/978-3-642-14162-1_10</a>.","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., &#38; Zadimoghaddam, M. (2010). How efficient can gossip be? (On the cost of resilient information exchange) (Vol. 6199 LNCS, pp. 115–126). Presented at the ICALP: International Colloquium on Automota, Languages and Programming, Springer. <a href=\"https://doi.org/10.1007/978-3-642-14162-1_10\">https://doi.org/10.1007/978-3-642-14162-1_10</a>","chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Morteza Zadimoghaddam. “How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange),” 6199 LNCS:115–26. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14162-1_10\">https://doi.org/10.1007/978-3-642-14162-1_10</a>.","short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, M. Zadimoghaddam, in:, Springer, 2010, pp. 115–126.","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, and M. Zadimoghaddam, “How efficient can gossip be? (On the cost of resilient information exchange),” presented at the ICALP: International Colloquium on Automota, Languages and Programming, 2010, vol. 6199 LNCS, no. PART 2, pp. 115–126.","ama":"Alistarh D-A, Gilbert S, Guerraoui R, Zadimoghaddam M. How efficient can gossip be? (On the cost of resilient information exchange). In: Vol 6199 LNCS. Springer; 2010:115-126. doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1_10\">10.1007/978-3-642-14162-1_10</a>"},"page":"115 - 126","date_created":"2018-12-11T11:48:20Z","doi":"10.1007/978-3-642-14162-1_10","publication_status":"published","conference":{"name":"ICALP: International Colloquium on Automota, Languages and Programming"},"date_published":"2010-01-01T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"None","type":"conference","title":"How efficient can gossip be? (On the cost of resilient information exchange)","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","status":"public","alternative_title":["LNCS"],"month":"01","extern":"1","year":"2010","day":"01","abstract":[{"lang":"eng","text":"Gossip, also known as epidemic dissemination, is becoming an increasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural extension of the random phone-call model (introduced by Karp et al. [1]), and we analyze two different notions of robustness: the ability to tolerate adaptive failures, and the ability to tolerate oblivious failures. For adaptive failures, we present a new gossip protocol, TrickleGossip, which achieves near-optimal O(n log 3 n) message complexity. To the best of our knowledge, this is the first epidemic-style protocol that can tolerate adaptive failures. We also show a direct relation between resilience and message complexity, demonstrating that gossip protocols which tolerate a large number of adaptive failures need to use a super-linear number of messages with high probability. For oblivious failures, we present a new gossip protocol, CoordinatedGossip, that achieves optimal O(n) message complexity. This protocol makes novel use of the universe reduction technique to limit the message complexity."}],"issue":"PART 2","acknowledgement":"We would like to thank Prof. Hagit Attiya and the anonymous reviewers for their useful comments on earlier drafts of this paper.","date_updated":"2023-02-23T13:10:40Z","_id":"755","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"first_name":"Morteza","last_name":"Zadimoghaddam","full_name":"Zadimoghaddam, Morteza"}]},{"day":"01","year":"2010","extern":"1","date_updated":"2023-02-23T13:10:56Z","acknowledgement":"The authors would like to thank Prof. Guevara Noubir for his useful comments on earlier\r\ndrafts of this paper.","abstract":[{"text":"This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, NeighborWatchRB, makes use of a novel strategy in which honest devices monitor their neighbors for malicious behavior. Second, we present a more robust variant, MultiPathRB, that tolerates the maximum possible density of malicious devices per region, using an elaborate voting strategy. We also introduce a new proof technique to show that both protocols ensure asymptotically optimal running time. We demonstrate the fault tolerance of our protocols through extensive simulation. Simulations show the practical superiority of the NeighborWatchRB protocol (an advantage hidden in the constants of the asymptotic complexity). The NeighborWatchRB protocol even performs relatively well when compared to the simple, fast epidemic protocols commonly used in the radio setting, protocols that tolerate no malicious faults. We therefore believe that the overhead for ensuring authenticated broadcast is reasonable, especially in applications that use authenticated broadcast only when necessary, such as distributing an authenticated digest.","lang":"eng"}],"_id":"756","author":[{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Gilbert, Seth","first_name":"Seth","last_name":"Gilbert"},{"first_name":"Rachid","last_name":"Guerraoui","full_name":"Guerraoui, Rachid"},{"last_name":"Milošević","first_name":"Žarko","full_name":"Milošević, Žarko"},{"full_name":"Newport, Calvin","last_name":"Newport","first_name":"Calvin"}],"title":"Securing every bit: Authenticated broadcast in radio networks","publisher":"ACM","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","date_created":"2018-12-11T11:48:20Z","page":"50 - 59","publication_status":"published","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"doi":"10.1145/1810479.1810489","language":[{"iso":"eng"}],"date_published":"2010-01-01T00:00:00Z","oa_version":"None","type":"conference","publist_id":"6902","article_processing_charge":"No","citation":{"mla":"Alistarh, Dan-Adrian, et al. <i>Securing Every Bit: Authenticated Broadcast in Radio Networks</i>. ACM, 2010, pp. 50–59, doi:<a href=\"https://doi.org/10.1145/1810479.1810489\">10.1145/1810479.1810489</a>.","ista":"Alistarh D-A, Gilbert S, Guerraoui R, Milošević Ž, Newport C. 2010. Securing every bit: Authenticated broadcast in radio networks. SPAA: Symposium on Parallelism in Algorithms and Architectures, 50–59.","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., Milošević, Ž., &#38; Newport, C. (2010). Securing every bit: Authenticated broadcast in radio networks (pp. 50–59). Presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, ACM. <a href=\"https://doi.org/10.1145/1810479.1810489\">https://doi.org/10.1145/1810479.1810489</a>","chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, Žarko Milošević, and Calvin Newport. “Securing Every Bit: Authenticated Broadcast in Radio Networks,” 50–59. ACM, 2010. <a href=\"https://doi.org/10.1145/1810479.1810489\">https://doi.org/10.1145/1810479.1810489</a>.","short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, Ž. Milošević, C. Newport, in:, ACM, 2010, pp. 50–59.","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, Ž. Milošević, and C. Newport, “Securing every bit: Authenticated broadcast in radio networks,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2010, pp. 50–59.","ama":"Alistarh D-A, Gilbert S, Guerraoui R, Milošević Ž, Newport C. Securing every bit: Authenticated broadcast in radio networks. In: ACM; 2010:50-59. doi:<a href=\"https://doi.org/10.1145/1810479.1810489\">10.1145/1810479.1810489</a>"}},{"title":"Brief announcement: New bounds for partially synchronous set agreement","publisher":"Springer","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","alternative_title":["LNCS"],"day":"01","year":"2010","extern":"1","date_updated":"2023-02-23T13:11:26Z","abstract":[{"text":"Set agreement [4] is a fundamental problem in distributed computing, in which processes collectively choose a small subset of values from a larger set of proposals. Set agreement has been extensively studied in both synchronous and asynchronous systems [10,11,3,5,8,9]. Real world distributed systems, however, are neither purely synchronous nor purely asynchronous. To describe such a system, Dwork et al. [6] introduced the idea of partial synchrony. They assume for every execution some (unknown) time GST (global stabilization time), after which the system is synchronous. In a recent paper [1,2], we study the complexity of set agreement in the context of partially synchronous systems, determining the minimum-sized window of synchrony in which set agreement can be solved. We show that at least ⌊t/k⌋ + 2 synchronous rounds are required for k-set agreement, where t &lt; n is the number of crashes, and k is the agreement parameter of the set agreement task. We then introduce an algorithm that terminates in any window of synchrony of size at least ⌊t/k⌋ + 4 rounds. Together, these results tightly bound the inherent price of tolerating some asynchrony.","lang":"eng"}],"_id":"758","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Gilbert","first_name":"Seth","full_name":"Gilbert, Seth"},{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"first_name":"Corentin","last_name":"Travers","full_name":"Travers, Corentin"}],"publist_id":"6899","article_processing_charge":"No","volume":"6343 LNCS","citation":{"chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Brief Announcement: New Bounds for Partially Synchronous Set Agreement,” 6343 LNCS:404–5. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_40\">https://doi.org/10.1007/978-3-642-15763-9_40</a>.","mla":"Alistarh, Dan-Adrian, et al. <i>Brief Announcement: New Bounds for Partially Synchronous Set Agreement</i>. Vol. 6343 LNCS, Springer, 2010, pp. 404–05, doi:<a href=\"https://doi.org/10.1007/978-3-642-15763-9_40\">10.1007/978-3-642-15763-9_40</a>.","ista":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2010. Brief announcement: New bounds for partially synchronous set agreement. DISC: Distributed Computing, LNCS, vol. 6343 LNCS, 404–405.","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., &#38; Travers, C. (2010). Brief announcement: New bounds for partially synchronous set agreement (Vol. 6343 LNCS, pp. 404–405). Presented at the DISC: Distributed Computing, Springer. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_40\">https://doi.org/10.1007/978-3-642-15763-9_40</a>","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Brief announcement: New bounds for partially synchronous set agreement,” presented at the DISC: Distributed Computing, 2010, vol. 6343 LNCS, pp. 404–405.","ama":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Brief announcement: New bounds for partially synchronous set agreement. In: Vol 6343 LNCS. Springer; 2010:404-405. doi:<a href=\"https://doi.org/10.1007/978-3-642-15763-9_40\">10.1007/978-3-642-15763-9_40</a>","short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, in:, Springer, 2010, pp. 404–405."},"date_created":"2018-12-11T11:48:21Z","page":"404 - 405","conference":{"name":"DISC: Distributed Computing"},"publication_status":"published","doi":"10.1007/978-3-642-15763-9_40","language":[{"iso":"eng"}],"date_published":"2010-01-01T00:00:00Z","type":"conference","oa_version":"None"},{"citation":{"ama":"Sweeney LB, Luo L. ‘Fore brain: A hint of the ancestral cortex. <i>Cell</i>. 2010;142(5):679-681. doi:<a href=\"https://doi.org/10.1016/j.cell.2010.08.024\">10.1016/j.cell.2010.08.024</a>","ieee":"L. B. Sweeney and L. Luo, “‘Fore brain: A hint of the ancestral cortex,” <i>Cell</i>, vol. 142, no. 5. Elsevier, pp. 679–681, 2010.","short":"L.B. Sweeney, L. Luo, Cell 142 (2010) 679–681.","ista":"Sweeney LB, Luo L. 2010. ‘Fore brain: A hint of the ancestral cortex. Cell. 142(5), 679–681.","apa":"Sweeney, L. B., &#38; Luo, L. (2010). ‘Fore brain: A hint of the ancestral cortex. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2010.08.024\">https://doi.org/10.1016/j.cell.2010.08.024</a>","mla":"Sweeney, Lora B., and Liqun Luo. “‘Fore Brain: A Hint of the Ancestral Cortex.” <i>Cell</i>, vol. 142, no. 5, Elsevier, 2010, pp. 679–81, doi:<a href=\"https://doi.org/10.1016/j.cell.2010.08.024\">10.1016/j.cell.2010.08.024</a>.","chicago":"Sweeney, Lora B., and Liqun Luo. “‘Fore Brain: A Hint of the Ancestral Cortex.” <i>Cell</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.cell.2010.08.024\">https://doi.org/10.1016/j.cell.2010.08.024</a>."},"quality_controlled":"1","intvolume":"       142","volume":142,"article_processing_charge":"No","article_type":"original","oa_version":"None","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2010-09-03T00:00:00Z","publication_status":"published","doi":"10.1016/j.cell.2010.08.024","date_created":"2020-04-30T10:36:52Z","page":"679-681","publication":"Cell","month":"09","status":"public","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"‘Fore brain: A hint of the ancestral cortex","publication_identifier":{"issn":["0092-8674"]},"author":[{"orcid":"0000-0001-9242-5601","first_name":"Lora Beatrice Jaeger","last_name":"Sweeney","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","full_name":"Sweeney, Lora Beatrice Jaeger"},{"full_name":"Luo, Liqun","first_name":"Liqun","last_name":"Luo"}],"_id":"7703","date_updated":"2024-01-31T10:14:59Z","issue":"5","abstract":[{"lang":"eng","text":"By combining gene expression profiling with image registration, Tomer et al. (2010) find that the mushroom body of the segmented worm Platynereis dumerilii shares many features with the mammalian cerebral cortex. The authors propose that the mushroom body and cortex evolved from the same structure in the common ancestor of vertebrates and invertebrates."}],"day":"03","extern":"1","year":"2010"},{"doi":"10.1111/j.1558-5646.2010.01019.x","publication_status":"published","publication":"Evolution","page":"2701 - 2715","date_created":"2018-12-11T11:46:40Z","oa_version":"None","type":"journal_article","date_published":"2010-09-01T00:00:00Z","department":[{"_id":"NiBa"}],"language":[{"iso":"eng"}],"publist_id":"2780","scopus_import":1,"quality_controlled":"1","citation":{"short":"N.H. Barton, J. Kelleher, A. Etheridge, Evolution 64 (2010) 2701–2715.","ieee":"N. H. Barton, J. Kelleher, and A. Etheridge, “A new model for extinction and recolonization in two dimensions: Quantifying phylogeography,” <i>Evolution</i>, vol. 64, no. 9. Wiley-Blackwell, pp. 2701–2715, 2010.","ama":"Barton NH, Kelleher J, Etheridge A. A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. <i>Evolution</i>. 2010;64(9):2701-2715. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">10.1111/j.1558-5646.2010.01019.x</a>","chicago":"Barton, Nicholas H, Jerome Kelleher, and Alison Etheridge. “A New Model for Extinction and Recolonization in Two Dimensions: Quantifying Phylogeography.” <i>Evolution</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">https://doi.org/10.1111/j.1558-5646.2010.01019.x</a>.","apa":"Barton, N. H., Kelleher, J., &#38; Etheridge, A. (2010). A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. <i>Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">https://doi.org/10.1111/j.1558-5646.2010.01019.x</a>","mla":"Barton, Nicholas H., et al. “A New Model for Extinction and Recolonization in Two Dimensions: Quantifying Phylogeography.” <i>Evolution</i>, vol. 64, no. 9, Wiley-Blackwell, 2010, pp. 2701–15, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">10.1111/j.1558-5646.2010.01019.x</a>.","ista":"Barton NH, Kelleher J, Etheridge A. 2010. A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. Evolution. 64(9), 2701–2715."},"intvolume":"        64","volume":64,"acknowledgement":"This work has made use of the resources provided by the Edinburgh Compute and Data Facility (ECDF). The ECDF is partially supported by the eDIKT initiative. NHB is supported in part by EPSRC Grant EP/E066070/1; JK is supported by EPSRC Grant EP/E066070/1; and AME is supported in part by EPSRC Grant EP/E065945/1.","abstract":[{"lang":"eng","text":"Classical models of gene flow fail in three ways: they cannot explain large-scale patterns; they predict much more genetic diversity than is observed; and they assume that loosely linked genetic loci evolve independently. We propose a new model that deals with these problems. Extinction events kill some fraction of individuals in a region. These are replaced by offspring from a small number of parents, drawn from the preexisting population. This model of evolution forwards in time corresponds to a backwards model, in which ancestral lineages jump to a new location if they are hit by an event, and may coalesce with other lineages that are hit by the same event. We derive an expression for the identity in allelic state, and show that, over scales much larger than the largest event, this converges to the classical value derived by Wright and Malécot. However, rare events that cover large areas cause low genetic diversity, large-scale patterns, and correlations in ancestry between unlinked loci."}],"issue":"9","date_updated":"2021-01-12T08:00:52Z","year":"2010","day":"01","author":[{"first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"},{"first_name":"Jerome","last_name":"Kelleher","full_name":"Kelleher, Jerome"},{"full_name":"Etheridge, Alison","last_name":"Etheridge","first_name":"Alison"}],"_id":"474","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"Wiley-Blackwell","title":"A new model for extinction and recolonization in two dimensions: Quantifying phylogeography","month":"09"},{"author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","full_name":"Cerny, Pavol"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":492344,"date_updated":"2020-07-14T12:46:35Z","file_name":"IST-2018-948-v1+1_2011_Cerny_Expressiveness_of.pdf","date_created":"2018-12-12T10:08:29Z","checksum":"5845be5aa19791830f7407d8853f2df0","file_id":"4690","creator":"system","access_level":"open_access"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"day":"01","alternative_title":["LIPIcs"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","title":"Expressiveness of streaming string transducers","type":"conference","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","page":"1 - 12","date_created":"2018-12-11T11:46:45Z","quality_controlled":"1","volume":8,"pubrep_id":"948","publist_id":"7331","_id":"488","abstract":[{"text":"Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and uses a finite set of variables that range over strings from the output alphabet. At every step, the transducer processes an input symbol, and updates all the variables in parallel using assignments whose right-hand-sides are concatenations of output symbols and variables with the restriction that a variable can be used at most once in a right-hand-side expression. It has been shown that streaming string transducers operating on strings over infinite data domains are of interest in algorithmic verification of list-processing programs, as they lead to PSPACE decision procedures for checking pre/post conditions and for checking semantic equivalence, for a well-defined class of heap-manipulating programs. In order to understand the theoretical expressiveness of streaming transducers, we focus on streaming transducers processing strings over finite alphabets, given the existence of a robust and well-studied class of &quot;regular&quot; transductions for this case. Such regular transductions can be defined either by two-way deterministic finite-state transducers, or using a logical MSO-based characterization. Our main result is that the expressiveness of streaming string transducers coincides exactly with this class of regular transductions. ","lang":"eng"}],"date_updated":"2021-01-12T08:01:00Z","year":"2010","month":"01","status":"public","oa":1,"oa_version":"Published Version","date_published":"2010-01-01T00:00:00Z","doi":"10.4230/LIPIcs.FSTTCS.2010.1","conference":{"location":"Chennai, India","end_date":"2010-12-18","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2010-12-15"},"publication_status":"published","intvolume":"         8","citation":{"ista":"Alur R, Cerny P. 2010. Expressiveness of streaming string transducers. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 1–12.","apa":"Alur, R., &#38; Cerny, P. (2010). Expressiveness of streaming string transducers (Vol. 8, pp. 1–12). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>","mla":"Alur, Rajeev, and Pavol Cerny. <i>Expressiveness of Streaming String Transducers</i>. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>.","chicago":"Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,” 8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>.","short":"R. Alur, P. Cerny, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12.","ama":"Alur R, Cerny P. Expressiveness of streaming string transducers. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:1-12. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>","ieee":"R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 1–12."},"scopus_import":1,"file_date_updated":"2020-07-14T12:46:35Z","ddc":["005"]},{"publist_id":"7332","volume":25,"quality_controlled":"1","publication":"Proceedings of GandALF 2010","page":"30 - 39","date_created":"2018-12-11T11:46:45Z","type":"conference","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Open Publishing Association","title":"How do we remember the past in randomised strategies? ","alternative_title":["EPTCS"],"day":"09","author":[{"first_name":"Julien","last_name":"Cristau","full_name":"Cristau, Julien"},{"last_name":"David","first_name":"Claire","full_name":"David, Claire"},{"full_name":"Horn, Florian","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","last_name":"Horn","first_name":"Florian"}],"scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1006.1404v1","open_access":"1"}],"citation":{"chicago":"Cristau, Julien, Claire David, and Florian Horn. “How Do We Remember the Past in Randomised Strategies? .” In <i>Proceedings of GandALF 2010</i>, 25:30–39. Open Publishing Association, 2010. <a href=\"https://doi.org/10.4204/EPTCS.25.7\">https://doi.org/10.4204/EPTCS.25.7</a>.","apa":"Cristau, J., David, C., &#38; Horn, F. (2010). How do we remember the past in randomised strategies? . In <i>Proceedings of GandALF 2010</i> (Vol. 25, pp. 30–39). Minori, Amalfi Coast, Italy: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.25.7\">https://doi.org/10.4204/EPTCS.25.7</a>","mla":"Cristau, Julien, et al. “How Do We Remember the Past in Randomised Strategies? .” <i>Proceedings of GandALF 2010</i>, vol. 25, Open Publishing Association, 2010, pp. 30–39, doi:<a href=\"https://doi.org/10.4204/EPTCS.25.7\">10.4204/EPTCS.25.7</a>.","ista":"Cristau J, David C, Horn F. 2010. How do we remember the past in randomised strategies? . Proceedings of GandALF 2010. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 30–39.","short":"J. Cristau, C. David, F. Horn, in:, Proceedings of GandALF 2010, Open Publishing Association, 2010, pp. 30–39.","ama":"Cristau J, David C, Horn F. How do we remember the past in randomised strategies? . In: <i>Proceedings of GandALF 2010</i>. Vol 25. Open Publishing Association; 2010:30-39. doi:<a href=\"https://doi.org/10.4204/EPTCS.25.7\">10.4204/EPTCS.25.7</a>","ieee":"J. Cristau, C. David, and F. Horn, “How do we remember the past in randomised strategies? ,” in <i>Proceedings of GandALF 2010</i>, Minori, Amalfi Coast, Italy, 2010, vol. 25, pp. 30–39."},"intvolume":"        25","doi":"10.4204/EPTCS.25.7","publication_status":"published","conference":{"name":"GandALF: Games, Automata, Logic, and Formal Verification","start_date":"2010-06-17","location":"Minori, Amalfi Coast, Italy","end_date":"2010-06-18"},"oa_version":"Published Version","date_published":"2010-06-09T00:00:00Z","status":"public","oa":1,"month":"06","abstract":[{"lang":"eng","text":"Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system depends on the decisions of both players, supplemented by chance. In this work, we focus on the notion of randomised strategy. More specifically, we show that three natural definitions may lead to very different results: in the most general cases, an almost-surely winning situation may become almost-surely losing if the player is only allowed to use a weaker notion of strategy. In more reasonable settings, translations exist, but they require infinite memory, even in simple cases. Finally, some traditional problems becomes undecidable for the strongest type of strategies."}],"date_updated":"2021-01-12T08:01:01Z","year":"2010","_id":"489"},{"doi":"10.1007/s10703-010-0102-0","publication_status":"published","publication":"Formal Methods in System Design","date_created":"2018-12-11T11:47:01Z","page":"171 - 199","type":"journal_article","oa_version":"None","department":[{"_id":"ToHe"}],"date_published":"2010-12-01T00:00:00Z","language":[{"iso":"eng"}],"publist_id":"7284","scopus_import":1,"quality_controlled":"1","citation":{"short":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in System Design 37 (2010) 171–199.","ieee":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program points,” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3. Springer, pp. 171–199, 2010.","ama":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. Doomed program points. <i>Formal Methods in System Design</i>. 2010;37(2-3):171-199. doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>","mla":"Hoenicke, Jochen, et al. “Doomed Program Points.” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>.","apa":"Hoenicke, J., Leino, K., Podelski, A., Schäf, M., &#38; Wies, T. (2010). Doomed program points. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>","ista":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. 2010. Doomed program points. Formal Methods in System Design. 37(2–3), 171–199.","chicago":"Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.” <i>Formal Methods in System Design</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>."},"intvolume":"        37","volume":37,"issue":"2-3","abstract":[{"text":"Any programming error that can be revealed before compiling a program saves precious time for the programmer. While integrated development environments already do a good job by detecting, e.g., data-flow abnormalities, current static analysis tools suffer from false positives (&quot;noise&quot;) or require strong user interaction. We propose to avoid this deficiency by defining a new class of errors. A program fragment is doomed if its execution will inevitably fail, regardless of which state it is started in. We use a formal verification method to identify such errors fully automatically and, most significantly, without producing noise. We report on experiments with a prototype tool.","lang":"eng"}],"date_updated":"2021-01-12T08:01:28Z","year":"2010","day":"01","author":[{"last_name":"Hoenicke","first_name":"Jochen","full_name":"Hoenicke, Jochen"},{"full_name":"Leino, Kari","last_name":"Leino","first_name":"Kari"},{"full_name":"Podelski, Andreas","first_name":"Andreas","last_name":"Podelski"},{"full_name":"Schäf, Martin","first_name":"Martin","last_name":"Schäf"},{"full_name":"Wies, Thomas","first_name":"Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"}],"_id":"533","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"Springer","title":"Doomed program points","month":"12"}]