[{"abstract":[{"lang":"eng","text":"The rechargeable nonaqueous lithium-air (Li-O2) battery is receiving a great deal of interest because, theoretically, its specific energy far exceeds the best that can be achieved with lithium-ion cells. Operation of the rechargeable Li-O2 battery depends critically on repeated and highly reversible formation/decomposition of lithium peroxide (Li2O2) at the cathode upon cycling. Here, we show that this process is possible with the use of a dimethyl sulfoxide electrolyte and a porous gold electrode (95% capacity retention from cycles 1 to 100), whereas previously only partial Li2O2 formation/decomposition and limited cycling could occur. Furthermore, we present data indicating that the kinetics of Li2O2 oxidation on charge is approximately 10 times faster than on carbon electrodes."}],"issue":"6094","extern":"1","type":"journal_article","author":[{"full_name":"Peng, Z.","first_name":"Z.","last_name":"Peng"},{"first_name":"Stefan Alexander","last_name":"Freunberger","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","full_name":"Freunberger, Stefan Alexander"},{"last_name":"Chen","first_name":"Y.","full_name":"Chen, Y."},{"first_name":"P. G.","last_name":"Bruce","full_name":"Bruce, P. G."}],"date_updated":"2021-01-12T08:12:57Z","date_created":"2020-01-15T12:19:23Z","volume":337,"oa_version":"None","_id":"7310","year":"2012","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"A reversible and higher-rate Li-O2 battery","status":"public","intvolume":" 337","publisher":"AAAS","day":"03","month":"08","publication_identifier":{"issn":["0036-8075","1095-9203"]},"article_processing_charge":"No","doi":"10.1126/science.1223985","date_published":"2012-08-03T00:00:00Z","language":[{"iso":"eng"}],"publication":"Science","citation":{"chicago":"Peng, Z., Stefan Alexander Freunberger, Y. Chen, and P. G. Bruce. “A Reversible and Higher-Rate Li-O2 Battery.” Science. AAAS, 2012. https://doi.org/10.1126/science.1223985.","short":"Z. Peng, S.A. Freunberger, Y. Chen, P.G. Bruce, Science 337 (2012) 563–566.","mla":"Peng, Z., et al. “A Reversible and Higher-Rate Li-O2 Battery.” Science, vol. 337, no. 6094, AAAS, 2012, pp. 563–66, doi:10.1126/science.1223985.","ieee":"Z. Peng, S. A. Freunberger, Y. Chen, and P. G. Bruce, “A reversible and higher-rate Li-O2 battery,” Science, vol. 337, no. 6094. AAAS, pp. 563–566, 2012.","apa":"Peng, Z., Freunberger, S. A., Chen, Y., & Bruce, P. G. (2012). A reversible and higher-rate Li-O2 battery. Science. AAAS. https://doi.org/10.1126/science.1223985","ista":"Peng Z, Freunberger SA, Chen Y, Bruce PG. 2012. A reversible and higher-rate Li-O2 battery. Science. 337(6094), 563–566.","ama":"Peng Z, Freunberger SA, Chen Y, Bruce PG. A reversible and higher-rate Li-O2 battery. Science. 2012;337(6094):563-566. doi:10.1126/science.1223985"},"quality_controlled":"1","article_type":"original","page":"563-566"},{"day":"19","month":"04","publication_identifier":{"issn":["0002-7863","1520-5126"]},"article_processing_charge":"No","language":[{"iso":"eng"}],"doi":"10.1021/ja302178w","date_published":"2012-04-19T00:00:00Z","article_type":"original","quality_controlled":"1","page":"7952-7957","publication":"Journal of the American Chemical Society","citation":{"apa":"Chen, Y., Freunberger, S. A., Peng, Z., Bardé, F., & Bruce, P. G. (2012). Li–O2 battery with a dimethylformamide electrolyte. Journal of the American Chemical Society. ACS. https://doi.org/10.1021/ja302178w","ieee":"Y. Chen, S. A. Freunberger, Z. Peng, F. Bardé, and P. G. Bruce, “Li–O2 battery with a dimethylformamide electrolyte,” Journal of the American Chemical Society, vol. 134, no. 18. ACS, pp. 7952–7957, 2012.","ista":"Chen Y, Freunberger SA, Peng Z, Bardé F, Bruce PG. 2012. Li–O2 battery with a dimethylformamide electrolyte. Journal of the American Chemical Society. 134(18), 7952–7957.","ama":"Chen Y, Freunberger SA, Peng Z, Bardé F, Bruce PG. Li–O2 battery with a dimethylformamide electrolyte. Journal of the American Chemical Society. 2012;134(18):7952-7957. doi:10.1021/ja302178w","chicago":"Chen, Yuhui, Stefan Alexander Freunberger, Zhangquan Peng, Fanny Bardé, and Peter G. Bruce. “Li–O2 Battery with a Dimethylformamide Electrolyte.” Journal of the American Chemical Society. ACS, 2012. https://doi.org/10.1021/ja302178w.","short":"Y. Chen, S.A. Freunberger, Z. Peng, F. Bardé, P.G. Bruce, Journal of the American Chemical Society 134 (2012) 7952–7957.","mla":"Chen, Yuhui, et al. “Li–O2 Battery with a Dimethylformamide Electrolyte.” Journal of the American Chemical Society, vol. 134, no. 18, ACS, 2012, pp. 7952–57, doi:10.1021/ja302178w."},"extern":"1","abstract":[{"text":"Stability of the electrolyte toward reduced oxygen species generated at the cathode is a crucial challenge for the rechargeable nonaqueous Li–O2 battery. Here, we investigate dimethylformamide as the basis of an electrolyte. Although reactions at the O2 cathode on the first discharge–charge cycle are dominated by reversible Li2O2 formation/decomposition, there is also electrolyte decomposition, which increases on cycling. The products of decomposition at the cathode on discharge are Li2O2, Li2CO3, HCO2Li, CH3CO2Li, NO, H2O, and CO2. Li2CO3 accumulates in the electrode with cycling. The stability of dimethylformamide toward reduced oxygen species is insufficient for its use in the rechargeable nonaqueous Li–O2 battery.","lang":"eng"}],"issue":"18","type":"journal_article","date_updated":"2021-01-12T08:12:58Z","date_created":"2020-01-15T12:19:36Z","volume":134,"oa_version":"None","author":[{"first_name":"Yuhui","last_name":"Chen","full_name":"Chen, Yuhui"},{"full_name":"Freunberger, Stefan Alexander","first_name":"Stefan Alexander","last_name":"Freunberger","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319"},{"full_name":"Peng, Zhangquan","last_name":"Peng","first_name":"Zhangquan"},{"full_name":"Bardé, Fanny","last_name":"Bardé","first_name":"Fanny"},{"last_name":"Bruce","first_name":"Peter G.","full_name":"Bruce, Peter G."}],"status":"public","title":"Li–O2 battery with a dimethylformamide electrolyte","publication_status":"published","publisher":"ACS","intvolume":" 134","_id":"7311","year":"2012","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"page":"298 - 307","citation":{"mla":"Alistarh, Dan-Adrian, et al. On the Cost of Composing Shared-Memory Algorithms. ACM, 2012, pp. 298–307, doi:10.1145/2312005.2312057.","short":"D.-A. Alistarh, R. Guerraoui, P. Kuznetsov, G. Losa, in:, ACM, 2012, pp. 298–307.","chicago":"Alistarh, Dan-Adrian, Rachid Guerraoui, Petr Kuznetsov, and Giuliano Losa. “On the Cost of Composing Shared-Memory Algorithms,” 298–307. ACM, 2012. https://doi.org/10.1145/2312005.2312057.","ama":"Alistarh D-A, Guerraoui R, Kuznetsov P, Losa G. On the cost of composing shared-memory algorithms. In: ACM; 2012:298-307. doi:10.1145/2312005.2312057","ista":"Alistarh D-A, Guerraoui R, Kuznetsov P, Losa G. 2012. On the cost of composing shared-memory algorithms. SPAA: Symposium on Parallelism in Algorithms and Architectures, 298–307.","apa":"Alistarh, D.-A., Guerraoui, R., Kuznetsov, P., & Losa, G. (2012). On the cost of composing shared-memory algorithms (pp. 298–307). Presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, ACM. https://doi.org/10.1145/2312005.2312057","ieee":"D.-A. Alistarh, R. Guerraoui, P. Kuznetsov, and G. Losa, “On the cost of composing shared-memory algorithms,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2012, pp. 298–307."},"language":[{"iso":"eng"}],"date_published":"2012-01-01T00:00:00Z","doi":"10.1145/2312005.2312057","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"article_processing_charge":"No","month":"01","day":"01","publisher":"ACM","publication_status":"published","status":"public","title":"On the cost of composing shared-memory algorithms","_id":"762","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2012","oa_version":"None","date_created":"2018-12-11T11:48:22Z","date_updated":"2023-02-23T13:12:27Z","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Guerraoui, Rachid","first_name":"Rachid","last_name":"Guerraoui"},{"full_name":"Kuznetsov, Petr","last_name":"Kuznetsov","first_name":"Petr"},{"last_name":"Losa","first_name":"Giuliano","full_name":"Losa, Giuliano"}],"type":"conference","extern":"1","publist_id":"6892","abstract":[{"lang":"eng","text":"Decades of research in distributed computing have led to a variety of perspectives on what it means for a concurrent algorithm to be efficient, depending on model assumptions, progress guarantees, and complexity metrics. It is therefore natural to ask whether one could compose algorithms that perform efficiently under different conditions, so that the composition preserves the performance of the original components when their conditions are met. In this paper, we evaluate the cost of composing shared-memory algorithms. First, we formally define the notion of safely composable algorithms and we show that every sequential type has a safely composable implementation, as long as enough state is transferred between modules. Since such generic implementations are inherently expensive, we present a more general light-weight specification that allows the designer to transfer very little state between modules, by taking advantage of the semantics of the implemented object. Using this framework, we implement a composed longlived test-and-set object, with the property that each of its modules is asymptotically optimal with respect to the progress condition it ensures, while the entire implementation only uses objects with consensus number at most two. Thus, we show that the overhead of composition can be negligible in the case of some important shared-memory abstractions."}]},{"day":"01","month":"01","article_processing_charge":"No","page":"195 - 206","citation":{"ista":"Alistarh D-A, Attiya H, Guerraoui R, Travers C. 2012. Early deciding synchronous renaming in O(log f) rounds or less. SIROCCO: Structural Information and Communication Complexity, LNCS, vol. 7355 LNCS, 195–206.","apa":"Alistarh, D.-A., Attiya, H., Guerraoui, R., & Travers, C. (2012). Early deciding synchronous renaming in O(log f) rounds or less (Vol. 7355 LNCS, pp. 195–206). Presented at the SIROCCO: Structural Information and Communication Complexity, Springer. https://doi.org/10.1007/978-3-642-31104-8_17","ieee":"D.-A. Alistarh, H. Attiya, R. Guerraoui, and C. Travers, “Early deciding synchronous renaming in O(log f) rounds or less,” presented at the SIROCCO: Structural Information and Communication Complexity, 2012, vol. 7355 LNCS, pp. 195–206.","ama":"Alistarh D-A, Attiya H, Guerraoui R, Travers C. Early deciding synchronous renaming in O(log f) rounds or less. In: Vol 7355 LNCS. Springer; 2012:195-206. doi:10.1007/978-3-642-31104-8_17","chicago":"Alistarh, Dan-Adrian, Hagit Attiya, Rachid Guerraoui, and Corentin Travers. “Early Deciding Synchronous Renaming in O(Log f) Rounds or Less,” 7355 LNCS:195–206. Springer, 2012. https://doi.org/10.1007/978-3-642-31104-8_17.","mla":"Alistarh, Dan-Adrian, et al. Early Deciding Synchronous Renaming in O(Log f) Rounds or Less. Vol. 7355 LNCS, Springer, 2012, pp. 195–206, doi:10.1007/978-3-642-31104-8_17.","short":"D.-A. Alistarh, H. Attiya, R. Guerraoui, C. Travers, in:, Springer, 2012, pp. 195–206."},"language":[{"iso":"eng"}],"conference":{"name":"SIROCCO: Structural Information and Communication Complexity"},"date_published":"2012-01-01T00:00:00Z","doi":"10.1007/978-3-642-31104-8_17","alternative_title":["LNCS"],"type":"conference","extern":"1","abstract":[{"text":"Renaming is a fundamental problem in distributed computing, in which a set of n processes need to pick unique names from a namespace of limited size. In this paper, we present the first early-deciding upper bounds for synchronous renaming, in which the running time adapts to the actual number of failures f in the execution. We show that, surprisingly, renaming can be solved in constant time if the number of failures f is limited to O(√n), while for general f ≤ n - 1 renaming can always be solved in O(log f) communication rounds. In the wait-free case, i.e. for f = n - 1, our upper bounds match the Ω(log n) lower bound of Chaudhuri et al. [13].","lang":"eng"}],"publist_id":"6893","status":"public","publication_status":"published","title":"Early deciding synchronous renaming in O(log f) rounds or less","publisher":"Springer","acknowledgement":"Hagit Attiya - Supported in party by Israel Science Foundation (grant number 1227/10).\r\nCorentin Travers - Additional supports from the ANR projects ALADDIN and DISPLEXITY\r\n","_id":"763","year":"2012","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:48:22Z","date_updated":"2023-02-23T13:12:41Z","volume":"7355 LNCS","oa_version":"None","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"last_name":"Attiya","first_name":"Hagit","full_name":"Attiya, Hagit"},{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"full_name":"Travers, Corentin","first_name":"Corentin","last_name":"Travers"}]},{"article_processing_charge":"No","month":"02","day":"01","citation":{"ista":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2012. Of choices, failures and asynchrony: the many faces of set agreement. Algorithmica (New York). 62(1–2), 595–629.","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Of choices, failures and asynchrony: the many faces of set agreement,” Algorithmica (New York), vol. 62, no. 1–2. Springer, pp. 595–629, 2012.","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., & Travers, C. (2012). Of choices, failures and asynchrony: the many faces of set agreement. Algorithmica (New York). Springer. https://doi.org/10.1007/s00453-011-9581-7","ama":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Of choices, failures and asynchrony: the many faces of set agreement. Algorithmica (New York). 2012;62(1-2):595-629. doi:10.1007/s00453-011-9581-7","chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.” Algorithmica (New York). Springer, 2012. https://doi.org/10.1007/s00453-011-9581-7.","mla":"Alistarh, Dan-Adrian, et al. “Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.” Algorithmica (New York), vol. 62, no. 1–2, Springer, 2012, pp. 595–629, doi:10.1007/s00453-011-9581-7.","short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, Algorithmica (New York) 62 (2012) 595–629."},"publication":"Algorithmica (New York)","page":"595 - 629","doi":"10.1007/s00453-011-9581-7","date_published":"2012-02-01T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","issue":"1-2","publist_id":"6894","abstract":[{"text":"Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal results in distributed computing. In synchronous networks, too, the complexity of set agreement has been a significant research challenge that has now been resolved. Real systems, however, are neither purely synchronous nor purely asynchronous. Rather, they tend to alternate between periods of synchrony and periods of asynchrony. Nothing specific is known about the complexity of set agreement in such a "partially synchronous" setting. In this paper, we address this challenge, presenting the first (asymptotically) tight bound on the complexity of set agreement in such systems. We introduce a novel technique for simulating, in a fault-prone asynchronous shared memory, executions of an asynchronous and failure-prone message-passing system in which some fragments appear synchronous to some processes. We use this simulation technique to derive a lower bound on the round complexity of set agreement in a partially synchronous system by a reduction from asynchronous wait-free set agreement. Specifically, we show that every set agreement protocol requires at least $\\lfloor\\frac t k \\rfloor + 2$ synchronous rounds to decide. We present an (asymptotically) matching algorithm that relies on a distributed asynchrony detection mechanism to decide as soon as possible during periods of synchrony. From these two results, we derive the size of the minimal window of synchrony needed to solve set agreement. By relating synchronous, asynchronous and partially synchronous environments, our simulation technique is of independent interest. In particular, it allows us to obtain a new lower bound on the complexity of early deciding k-set agreement complementary to that of Gafni et al. (in SIAM J. Comput. 40(1):63-78, 2011), and to re-derive the combinatorial topology lower bound of Guerraoui et al. (in Theor. Comput. Sci. 410(6-7):570-580, 2009) in an algorithmic way.","lang":"eng"}],"extern":"1","acknowledgement":"We would like to thank Hagit Attiya, Keren Censor-Hillel, and the anonymous\r\nreviewers for their feedback on drafts of this paper.\r\nPart of the work was performed as C. Travers was a Post-Doctoral Fellow at the Technion, Haifa,\r\nsupported by the “Sam & Cecilia Neaman” Fellowship. Part of the work was performed as S. Gilbert was\r\na Post-Doctoral Fellow at the Swiss Federal Institute of Technology, Lausanne, Switzerland.","_id":"764","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2012","publisher":"Springer","intvolume":" 62","status":"public","publication_status":"published","title":"Of choices, failures and asynchrony: the many faces of set agreement","author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"Gilbert, Seth","last_name":"Gilbert","first_name":"Seth"},{"full_name":"Guerraoui, Rachid","last_name":"Guerraoui","first_name":"Rachid"},{"full_name":"Travers, Corentin","last_name":"Travers","first_name":"Corentin"}],"volume":62,"oa_version":"None","date_created":"2018-12-11T11:48:23Z","date_updated":"2023-02-23T13:13:02Z"},{"article_processing_charge":"No","month":"01","day":"01","date_published":"2012-01-01T00:00:00Z","doi":"10.1109/FOCS.2012.41","conference":{"name":"FOCS: Foundations of Computer Science"},"language":[{"iso":"eng"}],"citation":{"ama":"Alistarh D-A, Bender M, Gilbert S, Guerraoui R. How to allocate tasks asynchronously. In: IEEE; 2012:331-340. doi:10.1109/FOCS.2012.41","ieee":"D.-A. Alistarh, M. Bender, S. Gilbert, and R. Guerraoui, “How to allocate tasks asynchronously,” presented at the FOCS: Foundations of Computer Science, 2012, pp. 331–340.","apa":"Alistarh, D.-A., Bender, M., Gilbert, S., & Guerraoui, R. (2012). How to allocate tasks asynchronously (pp. 331–340). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/FOCS.2012.41","ista":"Alistarh D-A, Bender M, Gilbert S, Guerraoui R. 2012. How to allocate tasks asynchronously. FOCS: Foundations of Computer Science, 331–340.","short":"D.-A. Alistarh, M. Bender, S. Gilbert, R. Guerraoui, in:, IEEE, 2012, pp. 331–340.","mla":"Alistarh, Dan-Adrian, et al. How to Allocate Tasks Asynchronously. IEEE, 2012, pp. 331–40, doi:10.1109/FOCS.2012.41.","chicago":"Alistarh, Dan-Adrian, Michael Bender, Seth Gilbert, and Rachid Guerraoui. “How to Allocate Tasks Asynchronously,” 331–40. IEEE, 2012. https://doi.org/10.1109/FOCS.2012.41."},"page":"331 - 340","publist_id":"6890","abstract":[{"lang":"eng","text":"Asynchronous task allocation is a fundamental problem in distributed computing in which p asynchronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key building block for various distributed algorithms. In this paper, we break new ground on this classic problem: we introduce the To-Do Tree concurrent data structure, which improves on the best known randomized and deterministic upper bounds. In the presence of an adaptive adversary, the randomized To-Do Tree algorithm has O(m + p log p log2 m) work complexity. We then show that there exists a deterministic variant of the To-Do Tree algorithm with work complexity O(m + p log5 m log2 max(m, p)). For all values of m and p, our algorithms are within log factors of the Ω(m + p log p) lower bound for this problem. The key technical ingredient in our results is a new approach for analyzing concurrent executions against a strong adaptive scheduler. This technique allows us to handle the complex dependencies between the processes' coin flips and their scheduling, and to tightly bound the work needed to perform subsets of the tasks."}],"extern":"1","type":"conference","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Bender","first_name":"Michael","full_name":"Bender, Michael"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"first_name":"Rachid","last_name":"Guerraoui","full_name":"Guerraoui, Rachid"}],"oa_version":"None","date_created":"2018-12-11T11:48:23Z","date_updated":"2023-02-23T13:13:27Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"766","year":"2012","publisher":"IEEE","title":"How to allocate tasks asynchronously","status":"public","publication_status":"published"},{"publication":"Theory of Computing Systems","citation":{"ama":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Generating Fast Indulgent Algorithms. Theory of Computing Systems. 2012;51(4):404-424. doi:10.1007/s00224-012-9407-2","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Generating Fast Indulgent Algorithms,” Theory of Computing Systems, vol. 51, no. 4. Elsevier, pp. 404–424, 2012.","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., & Travers, C. (2012). Generating Fast Indulgent Algorithms. Theory of Computing Systems. Elsevier. https://doi.org/10.1007/s00224-012-9407-2","ista":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2012. Generating Fast Indulgent Algorithms. Theory of Computing Systems. 51(4), 404–424.","short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, Theory of Computing Systems 51 (2012) 404–424.","mla":"Alistarh, Dan-Adrian, et al. “Generating Fast Indulgent Algorithms.” Theory of Computing Systems, vol. 51, no. 4, Elsevier, 2012, pp. 404–24, doi:10.1007/s00224-012-9407-2.","chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Generating Fast Indulgent Algorithms.” Theory of Computing Systems. Elsevier, 2012. https://doi.org/10.1007/s00224-012-9407-2."},"page":"404 - 424","date_published":"2012-01-01T00:00:00Z","doi":"10.1007/s00224-012-9407-2","language":[{"iso":"eng"}],"month":"01","day":"01","article_processing_charge":"No","_id":"767","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2012","acknowledgement":"Dan Alistarh was supported by the NCCR MICS Project. Corentin Travers had additional support from INRIA team REGAL and ANR project SPREADS.\r\nThe authors would like to thank Hagit Attiya and Nikola Kneževi\r\n ́\r\nc for their feed-\r\nback on previous drafts of this paper, and the anonymous reviewers for their useful comments.","publication_status":"published","title":"Generating Fast Indulgent Algorithms","status":"public","intvolume":" 51","publisher":"Elsevier","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"first_name":"Rachid","last_name":"Guerraoui","full_name":"Guerraoui, Rachid"},{"full_name":"Travers, Corentin","first_name":"Corentin","last_name":"Travers"}],"date_updated":"2023-02-23T13:13:40Z","date_created":"2018-12-11T11:48:23Z","volume":51,"oa_version":"None","type":"journal_article","abstract":[{"lang":"eng","text":"Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficiently transform an algorithm that relies on synchronous timing into an algorithm that tolerates asynchronous executions. We introduce a transformation technique from synchronous algorithms to indulgent algorithms (Guerraoui, in PODC, pp. 289-297, 2000), which induces only a constant overhead in terms of time complexity in well-behaved executions. Our technique is based on a new abstraction we call an asynchrony detector, which the participating processes implement collectively. The resulting transformation works for the class of colorless distributed tasks, including consensus and set agreement. Interestingly, we also show that our technique is relevant for colored tasks, by applying it to the renaming problem, to obtain the first indulgent renaming algorithm."}],"publist_id":"6891","issue":"4","extern":"1"},{"day":"01","month":"03","publication_identifier":{"issn":["1461-023X"]},"article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2012-03-01T00:00:00Z","doi":"10.1111/j.1461-0248.2011.01735.x","quality_controlled":"1","article_type":"original","page":"260-266","publication":"Ecology Letters","citation":{"short":"M.R. Robinson, K.U. Mar, V. Lummaa, Ecology Letters 15 (2012) 260–266.","mla":"Robinson, Matthew Richard, et al. “Senescence and Age-Specific Trade-Offs between Reproduction and Survival in Female Asian Elephants.” Ecology Letters, vol. 15, no. 3, Wiley, 2012, pp. 260–66, doi:10.1111/j.1461-0248.2011.01735.x.","chicago":"Robinson, Matthew Richard, Khyne U Mar, and Virpi Lummaa. “Senescence and Age-Specific Trade-Offs between Reproduction and Survival in Female Asian Elephants.” Ecology Letters. Wiley, 2012. https://doi.org/10.1111/j.1461-0248.2011.01735.x.","ama":"Robinson MR, Mar KU, Lummaa V. Senescence and age-specific trade-offs between reproduction and survival in female Asian elephants. Ecology Letters. 2012;15(3):260-266. doi:10.1111/j.1461-0248.2011.01735.x","ieee":"M. R. Robinson, K. U. Mar, and V. Lummaa, “Senescence and age-specific trade-offs between reproduction and survival in female Asian elephants,” Ecology Letters, vol. 15, no. 3. Wiley, pp. 260–266, 2012.","apa":"Robinson, M. R., Mar, K. U., & Lummaa, V. (2012). Senescence and age-specific trade-offs between reproduction and survival in female Asian elephants. Ecology Letters. Wiley. https://doi.org/10.1111/j.1461-0248.2011.01735.x","ista":"Robinson MR, Mar KU, Lummaa V. 2012. Senescence and age-specific trade-offs between reproduction and survival in female Asian elephants. Ecology Letters. 15(3), 260–266."},"extern":"1","abstract":[{"lang":"eng","text":"Although studies on laboratory species and natural populations of vertebrates have shown reproduction to impair later performance, little is known of the age‐specific associations between reproduction and survival, and how such findings apply to the ageing of large, long‐lived species. Herein we develop a framework to examine population‐level patterns of reproduction and survival across lifespan in long‐lived organisms, and decompose those changes into individual‐level effects, and the effects of age‐specific trade‐offs between fitness components. We apply this to an extensive longitudinal dataset on female semi‐captive Asian timber elephants (Elephas maximus) and report the first evidence of age‐specific fitness declines that are driven by age‐specific associations between fitness components in a long‐lived mammal. Associations between reproduction and survival are positive in early life, but negative in later life with up to 71% of later‐life survival declines associated with investing in the production of offspring within this population of this critically endangered species."}],"issue":"3","type":"journal_article","date_updated":"2021-01-12T08:15:16Z","date_created":"2020-04-30T11:01:26Z","volume":15,"oa_version":"None","author":[{"full_name":"Robinson, Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","last_name":"Robinson"},{"first_name":"Khyne U","last_name":"Mar","full_name":"Mar, Khyne U"},{"full_name":"Lummaa, Virpi","last_name":"Lummaa","first_name":"Virpi"}],"title":"Senescence and age-specific trade-offs between reproduction and survival in female Asian elephants","status":"public","publication_status":"published","intvolume":" 15","publisher":"Wiley","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7749","year":"2012"},{"quality_controlled":"1","article_type":"original","page":"611-618","publication":"Ecology Letters","citation":{"ama":"Robinson MR, Sander van Doorn G, Gustafsson L, Qvarnström A. Environment-dependent selection on mate choice in a natural population of birds. Ecology Letters. 2012;15(6):611-618. doi:10.1111/j.1461-0248.2012.01780.x","apa":"Robinson, M. R., Sander van Doorn, G., Gustafsson, L., & Qvarnström, A. (2012). Environment-dependent selection on mate choice in a natural population of birds. Ecology Letters. Wiley. https://doi.org/10.1111/j.1461-0248.2012.01780.x","ieee":"M. R. Robinson, G. Sander van Doorn, L. Gustafsson, and A. Qvarnström, “Environment-dependent selection on mate choice in a natural population of birds,” Ecology Letters, vol. 15, no. 6. Wiley, pp. 611–618, 2012.","ista":"Robinson MR, Sander van Doorn G, Gustafsson L, Qvarnström A. 2012. Environment-dependent selection on mate choice in a natural population of birds. Ecology Letters. 15(6), 611–618.","short":"M.R. Robinson, G. Sander van Doorn, L. Gustafsson, A. Qvarnström, Ecology Letters 15 (2012) 611–618.","mla":"Robinson, Matthew Richard, et al. “Environment-Dependent Selection on Mate Choice in a Natural Population of Birds.” Ecology Letters, vol. 15, no. 6, Wiley, 2012, pp. 611–18, doi:10.1111/j.1461-0248.2012.01780.x.","chicago":"Robinson, Matthew Richard, G. Sander van Doorn, Lars Gustafsson, and Anna Qvarnström. “Environment-Dependent Selection on Mate Choice in a Natural Population of Birds.” Ecology Letters. Wiley, 2012. https://doi.org/10.1111/j.1461-0248.2012.01780.x."},"language":[{"iso":"eng"}],"date_published":"2012-06-01T00:00:00Z","doi":"10.1111/j.1461-0248.2012.01780.x","day":"01","month":"06","publication_identifier":{"issn":["1461-023X"]},"article_processing_charge":"No","publication_status":"published","title":"Environment-dependent selection on mate choice in a natural population of birds","status":"public","intvolume":" 15","publisher":"Wiley","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7748","year":"2012","date_created":"2020-04-30T11:01:07Z","date_updated":"2021-01-12T08:15:15Z","volume":15,"oa_version":"None","author":[{"last_name":"Robinson","first_name":"Matthew Richard","orcid":"0000-0001-8982-8813","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","full_name":"Robinson, Matthew Richard"},{"full_name":"Sander van Doorn, G.","first_name":"G.","last_name":"Sander van Doorn"},{"full_name":"Gustafsson, Lars","last_name":"Gustafsson","first_name":"Lars"},{"last_name":"Qvarnström","first_name":"Anna","full_name":"Qvarnström, Anna"}],"type":"journal_article","extern":"1","abstract":[{"lang":"eng","text":"Female mate choice acts as an important evolutionary force, yet the influence of the environment on both its expression and the selective pressures acting upon it remains unknown. We found consistent heritable differences between females in their choice of mate based on ornament size during a 25‐year study of a population of collared flycatchers. However, the fitness consequences of mate choice were dependent on environmental conditions experienced whilst breeding. Females breeding with highly ornamented males experienced high relative fitness during dry summer conditions, but low relative fitness during wetter years. Our results imply that sexual selection within a population can be highly variable and dependent upon the prevailing weather conditions experienced by individuals."}],"issue":"6"},{"month":"08","day":"27","publication_identifier":{"issn":["0031-9007","1079-7114"]},"article_processing_charge":"No","publication":"Physical Review Letters","citation":{"ama":"Goodrich CP, Liu AJ, Nagel SR. Finite-size scaling at the jamming transition. Physical Review Letters. 2012;109(9). doi:10.1103/physrevlett.109.095704","apa":"Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2012). Finite-size scaling at the jamming transition. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.109.095704","ieee":"C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Finite-size scaling at the jamming transition,” Physical Review Letters, vol. 109, no. 9. American Physical Society, 2012.","ista":"Goodrich CP, Liu AJ, Nagel SR. 2012. Finite-size scaling at the jamming transition. Physical Review Letters. 109(9), 095704.","short":"C.P. Goodrich, A.J. Liu, S.R. Nagel, Physical Review Letters 109 (2012).","mla":"Goodrich, Carl Peter, et al. “Finite-Size Scaling at the Jamming Transition.” Physical Review Letters, vol. 109, no. 9, 095704, American Physical Society, 2012, doi:10.1103/physrevlett.109.095704.","chicago":"Goodrich, Carl Peter, Andrea J. Liu, and Sidney R. Nagel. “Finite-Size Scaling at the Jamming Transition.” Physical Review Letters. American Physical Society, 2012. https://doi.org/10.1103/physrevlett.109.095704."},"article_type":"original","quality_controlled":"1","date_published":"2012-08-27T00:00:00Z","doi":"10.1103/physrevlett.109.095704","language":[{"iso":"eng"}],"article_number":"095704","type":"journal_article","abstract":[{"text":"We present an analysis of finite-size effects in jammed packings of N soft, frictionless spheres at zero temperature. There is a 1/N correction to the discrete jump in the contact number at the transition so that jammed packings exist only above isostaticity. As a result, the canonical power-law scalings of the contact number and elastic moduli break down at low pressure. These quantities exhibit scaling collapse with a nontrivial scaling function, demonstrating that the jamming transition can be considered a phase transition. Scaling is achieved as a function of N in both two and three dimensions, indicating an upper critical dimension of 2.","lang":"eng"}],"issue":"9","extern":"1","year":"2012","_id":"7776","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","title":"Finite-size scaling at the jamming transition","publisher":"American Physical Society","intvolume":" 109","author":[{"first_name":"Carl Peter","last_name":"Goodrich","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074","full_name":"Goodrich, Carl Peter"},{"last_name":"Liu","first_name":"Andrea J.","full_name":"Liu, Andrea J."},{"full_name":"Nagel, Sidney R.","last_name":"Nagel","first_name":"Sidney R."}],"date_created":"2020-04-30T11:44:12Z","date_updated":"2021-01-12T08:15:27Z","volume":109,"oa_version":"None"}]