--- _id: '1832' abstract: - lang: eng text: 'Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates. In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof. ' article_number: '20' article_processing_charge: No article_type: original author: - first_name: Soham full_name: Chakraborty, Soham last_name: Chakraborty - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Ali full_name: Sezgin, Ali last_name: Sezgin - first_name: Viktor full_name: Vafeiadis, Viktor last_name: Vafeiadis citation: ama: Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 2015;11(1). doi:10.2168/LMCS-11(1:20)2015 apa: Chakraborty, S., Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2015). Aspect-oriented linearizability proofs. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-11(1:20)2015 chicago: Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” Logical Methods in Computer Science. International Federation of Computational Logic, 2015. https://doi.org/10.2168/LMCS-11(1:20)2015. ieee: S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” Logical Methods in Computer Science, vol. 11, no. 1. International Federation of Computational Logic, 2015. ista: Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 11(1), 20. mla: Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.” Logical Methods in Computer Science, vol. 11, no. 1, 20, International Federation of Computational Logic, 2015, doi:10.2168/LMCS-11(1:20)2015. short: S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods in Computer Science 11 (2015). date_created: 2018-12-11T11:54:15Z date_published: 2015-04-01T00:00:00Z date_updated: 2023-02-23T10:38:13Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.2168/LMCS-11(1:20)2015 ec_funded: 1 file: - access_level: open_access checksum: 7370e164d0a731f442424a92669efc34 content_type: application/pdf creator: system date_created: 2018-12-12T10:11:27Z date_updated: 2020-07-14T12:45:17Z file_id: '4881' file_name: IST-2015-390-v1+1_1502.07639.pdf file_size: 380203 relation: main_file file_date_updated: 2020-07-14T12:45:17Z has_accepted_license: '1' intvolume: ' 11' issue: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nd/4.0/ month: '04' oa: 1 oa_version: Published Version project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication: Logical Methods in Computer Science publication_status: published publisher: International Federation of Computational Logic publist_id: '5271' pubrep_id: '390' quality_controlled: '1' related_material: record: - id: '2328' relation: earlier_version status: public scopus_import: 1 status: public title: Aspect-oriented linearizability proofs tmp: image: /image/cc_by_nd.png legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0) short: CC BY-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2015' ... --- _id: '2271' abstract: - lang: eng text: "A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. Finite-valued constraint languages contain functions that take on rational costs and general-valued constraint languages contain functions that take on rational or infinite costs. An instance of the problem is specified by a sum of functions from the language with the goal to minimise the sum. This framework includes and generalises well-studied constraint satisfaction problems (CSPs) and maximum constraint satisfaction problems (Max-CSPs).\r\nOur main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation (BLP). For a general-valued constraint language Γ, BLP is a decision procedure for Γ if and only if Γ admits a symmetric fractional polymorphism of every arity. For a finite-valued constraint language Γ, BLP is a decision procedure if and only if Γ admits a symmetric fractional polymorphism of some arity, or equivalently, if Γ admits a symmetric fractional polymorphism of arity 2.\r\nUsing these results, we obtain tractability of several novel and previously widely-open classes of VCSPs, including problems over valued constraint languages that are: (1) submodular on arbitrary lattices; (2) bisubmodular (also known as k-submodular) on arbitrary finite domains; (3) weakly (and hence strongly) tree-submodular on arbitrary trees. " author: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Johan full_name: Thapper, Johan last_name: Thapper - first_name: Stanislav full_name: Živný, Stanislav last_name: Živný citation: ama: Kolmogorov V, Thapper J, Živný S. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 2015;44(1):1-36. doi:10.1137/130945648 apa: Kolmogorov, V., Thapper, J., & Živný, S. (2015). The power of linear programming for general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/130945648 chicago: Kolmogorov, Vladimir, Johan Thapper, and Stanislav Živný. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2015. https://doi.org/10.1137/130945648. ieee: V. Kolmogorov, J. Thapper, and S. Živný, “The power of linear programming for general-valued CSPs,” SIAM Journal on Computing, vol. 44, no. 1. SIAM, pp. 1–36, 2015. ista: Kolmogorov V, Thapper J, Živný S. 2015. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 44(1), 1–36. mla: Kolmogorov, Vladimir, et al. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing, vol. 44, no. 1, SIAM, 2015, pp. 1–36, doi:10.1137/130945648. short: V. Kolmogorov, J. Thapper, S. Živný, SIAM Journal on Computing 44 (2015) 1–36. date_created: 2018-12-11T11:56:41Z date_published: 2015-02-01T00:00:00Z date_updated: 2023-02-23T10:46:30Z day: '01' department: - _id: VlKo doi: 10.1137/130945648 external_id: arxiv: - '1311.4219' intvolume: ' 44' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1311.4219 month: '02' oa: 1 oa_version: Preprint page: 1 - 36 publication: SIAM Journal on Computing publication_status: published publisher: SIAM publist_id: '4673' quality_controlled: '1' related_material: record: - id: '2518' relation: earlier_version status: public scopus_import: 1 status: public title: The power of linear programming for general-valued CSPs type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 44 year: '2015' ... --- _id: '257' abstract: - lang: eng text: For suitable pairs of diagonal quadratic forms in eight variables we use the circle method to investigate the density of simultaneous integer solutions and relate this to the problem of estimating linear correlations among sums of two squares. acknowledgement: While working on this paper the first author was supported by ERC grant 306457 and the second author was supported by SwarnaJayanti Fellowship 2011–12, DST, Government of India. author: - first_name: Timothy D full_name: Timothy Browning id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Ritabrata full_name: Munshi, Ritabrata last_name: Munshi citation: ama: Browning TD, Munshi R. Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. 2015;27(4):2025-2050. doi:10.1515/forum-2013-6024 apa: Browning, T. D., & Munshi, R. (2015). Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. Walter de Gruyter GmbH. https://doi.org/10.1515/forum-2013-6024 chicago: Browning, Timothy D, and Ritabrata Munshi. “Pairs of Diagonal Quadratic Forms and Linear Correlations among Sums of Two Squares.” Forum Mathematicum. Walter de Gruyter GmbH, 2015. https://doi.org/10.1515/forum-2013-6024. ieee: T. D. Browning and R. Munshi, “Pairs of diagonal quadratic forms and linear correlations among sums of two squares,” Forum Mathematicum, vol. 27, no. 4. Walter de Gruyter GmbH, pp. 2025–2050, 2015. ista: Browning TD, Munshi R. 2015. Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. 27(4), 2025–2050. mla: Browning, Timothy D., and Ritabrata Munshi. “Pairs of Diagonal Quadratic Forms and Linear Correlations among Sums of Two Squares.” Forum Mathematicum, vol. 27, no. 4, Walter de Gruyter GmbH, 2015, pp. 2025–50, doi:10.1515/forum-2013-6024. short: T.D. Browning, R. Munshi, Forum Mathematicum 27 (2015) 2025–2050. date_created: 2018-12-11T11:45:28Z date_published: 2015-07-10T00:00:00Z date_updated: 2021-01-12T06:58:18Z day: '10' doi: 10.1515/forum-2013-6024 extern: 1 intvolume: ' 27' issue: '4' main_file_link: - open_access: '1' url: https://arxiv.org/abs/1302.2434 month: '07' oa: 1 page: 2025 - 2050 publication: Forum Mathematicum publication_status: published publisher: Walter de Gruyter GmbH publist_id: '7645' quality_controlled: 0 status: public title: Pairs of diagonal quadratic forms and linear correlations among sums of two squares type: journal_article volume: 27 year: '2015' ... --- _id: '258' abstract: - lang: eng text: Given a number field k and a projective algebraic variety X defined over k, the question of whether X contains a k-rational point is both very natural and very difficult. In the event that the set X(k) of k-rational points is not empty, one can also ask how the points of X(k) are distributed. Are they dense in X under the Zariski topology? Are they dense in the set. author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 citation: ama: 'Browning TD. A survey of applications of the circle method to rational points. In: Arithmetic and Geometry. Cambridge University Press; 2015:89-113. doi:10.1017/CBO9781316106877.009' apa: Browning, T. D. (2015). A survey of applications of the circle method to rational points. In Arithmetic and Geometry (pp. 89–113). Cambridge University Press. https://doi.org/10.1017/CBO9781316106877.009 chicago: Browning, Timothy D. “A Survey of Applications of the Circle Method to Rational Points.” In Arithmetic and Geometry, 89–113. Cambridge University Press, 2015. https://doi.org/10.1017/CBO9781316106877.009. ieee: T. D. Browning, “A survey of applications of the circle method to rational points,” in Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113. ista: 'Browning TD. 2015.A survey of applications of the circle method to rational points. In: Arithmetic and Geometry. , 89–113.' mla: Browning, Timothy D. “A Survey of Applications of the Circle Method to Rational Points.” Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113, doi:10.1017/CBO9781316106877.009. short: T.D. Browning, in:, Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113. date_created: 2018-12-11T11:45:28Z date_published: 2015-08-01T00:00:00Z date_updated: 2021-01-12T06:58:22Z day: '01' doi: 10.1017/CBO9781316106877.009 extern: '1' language: - iso: eng month: '08' oa_version: None page: 89 - 113 publication: Arithmetic and Geometry publication_status: published publisher: Cambridge University Press publist_id: '7644' quality_controlled: '1' status: public title: A survey of applications of the circle method to rational points type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2015' ... --- _id: '259' abstract: - lang: eng text: 'The Hasse principle and weak approximation is established for non-singular cubic hypersurfaces X over the function field ' acknowledgement: "EP/J018260/1\tEngineering and Physical Sciences Research Council EPSRC" author: - first_name: Timothy D full_name: Timothy Browning id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Pankaj full_name: Vishe, Pankaj last_name: Vishe citation: ama: Browning TD, Vishe P. Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. 2015;25(3):671-732. doi:10.1007/s00039-015-0328-5 apa: Browning, T. D., & Vishe, P. (2015). Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. Birkhäuser. https://doi.org/10.1007/s00039-015-0328-5 chicago: Browning, Timothy D, and Pankaj Vishe. “Rational Points on Cubic Hypersurfaces over F_q(T) .” Geometric and Functional Analysis. Birkhäuser, 2015. https://doi.org/10.1007/s00039-015-0328-5. ieee: T. D. Browning and P. Vishe, “Rational points on cubic hypersurfaces over F_q(t) ,” Geometric and Functional Analysis, vol. 25, no. 3. Birkhäuser, pp. 671–732, 2015. ista: Browning TD, Vishe P. 2015. Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. 25(3), 671–732. mla: Browning, Timothy D., and Pankaj Vishe. “Rational Points on Cubic Hypersurfaces over F_q(T) .” Geometric and Functional Analysis, vol. 25, no. 3, Birkhäuser, 2015, pp. 671–732, doi:10.1007/s00039-015-0328-5. short: T.D. Browning, P. Vishe, Geometric and Functional Analysis 25 (2015) 671–732. date_created: 2018-12-11T11:45:29Z date_published: 2015-06-11T00:00:00Z date_updated: 2021-01-12T06:58:25Z day: '11' doi: 10.1007/s00039-015-0328-5 extern: 1 intvolume: ' 25' issue: '3' month: '06' page: 671 - 732 publication: Geometric and Functional Analysis publication_status: published publisher: Birkhäuser publist_id: '7643' quality_controlled: 0 status: public title: 'Rational points on cubic hypersurfaces over F_q(t) ' type: journal_article volume: 25 year: '2015' ... --- _id: '1598' abstract: - lang: eng text: 'We consider Markov decision processes (MDPs) with specifications given as Büchi (liveness) objectives, and examine the problem of computing the set of almost-sure winning vertices such that the objective can be ensured with probability 1 from these vertices. We study for the first time the average-case complexity of the classical algorithm for computing the set of almost-sure winning vertices for MDPs with Büchi objectives. Our contributions are as follows: First, we show that for MDPs with constant out-degree the expected number of iterations is at most logarithmic and the average-case running time is linear (as compared to the worst-case linear number of iterations and quadratic time complexity). Second, for the average-case analysis over all MDPs we show that the expected number of iterations is constant and the average-case running time is linear (again as compared to the worst-case linear number of iterations and quadratic time complexity). Finally we also show that when all MDPs are equally likely, the probability that the classical algorithm requires more than a constant number of iterations is exponentially small.' acknowledgement: "The research was supported by FWF Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start Grant (279307: Graph Games), and the Microsoft Faculty Fellows Award. Nisarg Shah is also supported by NSF Grant CCF-1215883.\r\n" article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Manas full_name: Joglekar, Manas last_name: Joglekar - first_name: Nisarg full_name: Shah, Nisarg last_name: Shah citation: ama: Chatterjee K, Joglekar M, Shah N. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 2015;573(3):71-89. doi:10.1016/j.tcs.2015.01.050 apa: Chatterjee, K., Joglekar, M., & Shah, N. (2015). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.01.050 chicago: Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.01.050. ieee: K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” Theoretical Computer Science, vol. 573, no. 3. Elsevier, pp. 71–89, 2015. ista: Chatterjee K, Joglekar M, Shah N. 2015. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 573(3), 71–89. mla: Chatterjee, Krishnendu, et al. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” Theoretical Computer Science, vol. 573, no. 3, Elsevier, 2015, pp. 71–89, doi:10.1016/j.tcs.2015.01.050. short: K. Chatterjee, M. Joglekar, N. Shah, Theoretical Computer Science 573 (2015) 71–89. date_created: 2018-12-11T11:52:56Z date_published: 2015-03-30T00:00:00Z date_updated: 2023-02-23T10:55:03Z day: '30' department: - _id: KrCh doi: 10.1016/j.tcs.2015.01.050 ec_funded: 1 external_id: arxiv: - '1202.4175' intvolume: ' 573' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1202.4175 month: '03' oa: 1 oa_version: Preprint page: 71 - 89 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Theoretical Computer Science publication_status: published publisher: Elsevier publist_id: '5571' quality_controlled: '1' related_material: record: - id: '2715' relation: earlier_version status: public scopus_import: 1 status: public title: Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 573 year: '2015' ... --- _id: '1805' abstract: - lang: eng text: 'We consider the problem of deciding whether the persistent homology group of a simplicial pair (K,L) can be realized as the homology H∗(X) of some complex X with L ⊂ X ⊂ K. We show that this problem is NP-complete even if K is embedded in double-struck R3. As a consequence, we show that it is NP-hard to simplify level and sublevel sets of scalar functions on double-struck S3 within a given tolerance constraint. This problem has relevance to the visualization of medical images by isosurfaces. We also show an implication to the theory of well groups of scalar functions: not every well group can be realized by some level set, and deciding whether a well group can be realized is NP-hard.' author: - first_name: Dominique full_name: Attali, Dominique last_name: Attali - first_name: Ulrich full_name: Bauer, Ulrich id: 2ADD483A-F248-11E8-B48F-1D18A9856A87 last_name: Bauer orcid: 0000-0002-9683-0724 - first_name: Olivier full_name: Devillers, Olivier last_name: Devillers - first_name: Marc full_name: Glisse, Marc last_name: Glisse - first_name: André full_name: Lieutier, André last_name: Lieutier citation: ama: 'Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. 2015;48(8):606-621. doi:10.1016/j.comgeo.2014.08.010' apa: 'Attali, D., Bauer, U., Devillers, O., Glisse, M., & Lieutier, A. (2015). Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2014.08.010' chicago: 'Attali, Dominique, Ulrich Bauer, Olivier Devillers, Marc Glisse, and André Lieutier. “Homological Reconstruction and Simplification in R3.” Computational Geometry: Theory and Applications. Elsevier, 2015. https://doi.org/10.1016/j.comgeo.2014.08.010.' ieee: 'D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier, “Homological reconstruction and simplification in R3,” Computational Geometry: Theory and Applications, vol. 48, no. 8. Elsevier, pp. 606–621, 2015.' ista: 'Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. 2015. Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. 48(8), 606–621.' mla: 'Attali, Dominique, et al. “Homological Reconstruction and Simplification in R3.” Computational Geometry: Theory and Applications, vol. 48, no. 8, Elsevier, 2015, pp. 606–21, doi:10.1016/j.comgeo.2014.08.010.' short: 'D. Attali, U. Bauer, O. Devillers, M. Glisse, A. Lieutier, Computational Geometry: Theory and Applications 48 (2015) 606–621.' date_created: 2018-12-11T11:54:06Z date_published: 2015-06-03T00:00:00Z date_updated: 2023-02-23T10:59:19Z day: '03' department: - _id: HeEd doi: 10.1016/j.comgeo.2014.08.010 ec_funded: 1 intvolume: ' 48' issue: '8' language: - iso: eng month: '06' oa_version: None page: 606 - 621 project: - _id: 255D761E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '318493' name: Topological Complex Systems publication: 'Computational Geometry: Theory and Applications' publication_status: published publisher: Elsevier publist_id: '5305' quality_controlled: '1' related_material: record: - id: '2812' relation: earlier_version status: public scopus_import: 1 status: public title: Homological reconstruction and simplification in R3 type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 48 year: '2015' ... --- _id: '333' abstract: - lang: eng text: 'We present a hybrid intercalation battery based on a sodium/magnesium (Na/Mg) dual salt electrolyte, metallic magnesium anode, and a cathode based on FeS2 nanocrystals (NCs). Compared to lithium or sodium, metallic magnesium anode is safer due to dendrite-free electroplating and offers extremely high volumetric (3833 mAh cm-3) and gravimetric capacities (2205 mAh g-1). Na-ion cathodes, FeS2 NCs in the present study, may serve as attractive alternatives to Mg-ion cathodes due to the higher voltage of operation and fast, highly reversible insertion of Na-ions. In this proof-of-concept study, electrochemical cycling of the Na/Mg hybrid battery was characterized by high rate capability, high Coulombic efficiency of 99.8%, and high energy density. In particular, with an average discharge voltage of ∼1.1 V and a cathodic capacity of 189 mAh g-1 at a current of 200 mA g-1, the presented Mg/FeS2 hybrid battery delivers energy densities of up to 210 Wh kg-1, comparable to commercial Li-ion batteries and approximately twice as high as state-of-the-art Mg-ion batteries based on Mo6S8 cathodes. Further significant gains in the energy density are expected from the development of Na/Mg electrolytes with a broader electrochemical stability window. Fully based on Earth-abundant elements, hybrid Na-Mg batteries are highly promising for large-scale stationary energy storage. ' article_processing_charge: No article_type: original author: - first_name: Marc full_name: Walter, Marc last_name: Walter - first_name: Kostiantyn full_name: Kravchyk, Kostiantyn last_name: Kravchyk - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Maksym full_name: Kovalenko, Maksym last_name: Kovalenko citation: ama: Walter M, Kravchyk K, Ibáñez M, Kovalenko M. Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. 2015;27(21):7452-7458. doi:10.1021/acs.chemmater.5b03531 apa: Walter, M., Kravchyk, K., Ibáñez, M., & Kovalenko, M. (2015). Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. ACS. https://doi.org/10.1021/acs.chemmater.5b03531 chicago: Walter, Marc, Kostiantyn Kravchyk, Maria Ibáñez, and Maksym Kovalenko. “Efficient and Inexpensive Sodium Magnesium Hybrid Battery.” Chemistry of Materials. ACS, 2015. https://doi.org/10.1021/acs.chemmater.5b03531. ieee: M. Walter, K. Kravchyk, M. Ibáñez, and M. Kovalenko, “Efficient and inexpensive sodium magnesium hybrid battery,” Chemistry of Materials, vol. 27, no. 21. ACS, pp. 7452–7458, 2015. ista: Walter M, Kravchyk K, Ibáñez M, Kovalenko M. 2015. Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. 27(21), 7452–7458. mla: Walter, Marc, et al. “Efficient and Inexpensive Sodium Magnesium Hybrid Battery.” Chemistry of Materials, vol. 27, no. 21, ACS, 2015, pp. 7452–58, doi:10.1021/acs.chemmater.5b03531. short: M. Walter, K. Kravchyk, M. Ibáñez, M. Kovalenko, Chemistry of Materials 27 (2015) 7452–7458. date_created: 2018-12-11T11:45:52Z date_published: 2015-10-16T00:00:00Z date_updated: 2021-01-12T07:42:42Z day: '16' doi: 10.1021/acs.chemmater.5b03531 extern: '1' intvolume: ' 27' issue: '21' language: - iso: eng month: '10' oa_version: None page: 7452 - 7458 publication: Chemistry of Materials publication_status: published publisher: ACS publist_id: '7507' quality_controlled: '1' status: public title: Efficient and inexpensive sodium magnesium hybrid battery type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 27 year: '2015' ... --- _id: '354' abstract: - lang: eng text: 'A simple and effective method to introduce precise amounts of doping in nanomaterials produced from the bottom-up assembly of colloidal nanoparticles (NPs) is described. The procedure takes advantage of a ligand displacement step to incorporate controlled concentrations of halide ions while removing carboxylic acids from the NP surface. Upon consolidation of the NPs into dense pellets, halide ions diffuse within the crystal structure, doping the anion sublattice and achieving n-type electrical doping. Through the characterization of the thermoelectric properties of nanocrystalline PbS, we demonstrate this strategy to be effective to control charge transport properties on thermoelectric nanomaterials assembled from NP building blocks. This approach is subsequently extended to PbTexSe1-x@PbS core-shell NPs, where a significant enhancement of the thermoelectric figure of merit is achieved. ' acknowledgement: At IREC, work was supported by European Regional Development Funds and the Framework 7 program under project UNION (FP7-NMP 310250). M.I. and S.O. thank AGAUR for their Beatriu i Pinós postdoctoral grant and the PhD grant, respectively. At Northwestern, work was supported by the Revolutionary Materials for Solid State Energy Conversion, an Energy Frontier Research Center funded by the U.S. Department of Energy, Office of Science, and Office of Basic Energy Sciences under Award Number DE-SC0001054. article_processing_charge: No article_type: original author: - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Rachel full_name: Korkosz, Rachel last_name: Korkosz - first_name: Zhishan full_name: Luo, Zhishan last_name: Luo - first_name: Pau full_name: Riba, Pau last_name: Riba - first_name: Doris full_name: Cadavid, Doris last_name: Cadavid - first_name: Silvia full_name: Ortega, Silvia last_name: Ortega - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot - first_name: Mercouri full_name: Kanatzidis, Mercouri last_name: Kanatzidis citation: ama: Ibáñez M, Korkosz R, Luo Z, et al. Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement. Journal of the American Chemical Society. 2015;137(12):4046-4049. doi:10.1021/jacs.5b00091 apa: Ibáñez, M., Korkosz, R., Luo, Z., Riba, P., Cadavid, D., Ortega, S., … Kanatzidis, M. (2015). Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement. Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/jacs.5b00091 chicago: Ibáñez, Maria, Rachel Korkosz, Zhishan Luo, Pau Riba, Doris Cadavid, Silvia Ortega, Andreu Cabot, and Mercouri Kanatzidis. “Electron Doping in Bottom up Engineered Thermoelectric Nanomaterials through HCl Mediated Ligand Displacement.” Journal of the American Chemical Society. American Chemical Society, 2015. https://doi.org/10.1021/jacs.5b00091. ieee: M. Ibáñez et al., “Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement,” Journal of the American Chemical Society, vol. 137, no. 12. American Chemical Society, pp. 4046–4049, 2015. ista: Ibáñez M, Korkosz R, Luo Z, Riba P, Cadavid D, Ortega S, Cabot A, Kanatzidis M. 2015. Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement. Journal of the American Chemical Society. 137(12), 4046–4049. mla: Ibáñez, Maria, et al. “Electron Doping in Bottom up Engineered Thermoelectric Nanomaterials through HCl Mediated Ligand Displacement.” Journal of the American Chemical Society, vol. 137, no. 12, American Chemical Society, 2015, pp. 4046–49, doi:10.1021/jacs.5b00091. short: M. Ibáñez, R. Korkosz, Z. Luo, P. Riba, D. Cadavid, S. Ortega, A. Cabot, M. Kanatzidis, Journal of the American Chemical Society 137 (2015) 4046–4049. date_created: 2018-12-11T11:45:59Z date_published: 2015-03-11T00:00:00Z date_updated: 2021-01-12T07:44:10Z day: '11' doi: 10.1021/jacs.5b00091 extern: '1' intvolume: ' 137' issue: '12' language: - iso: eng month: '03' oa_version: None page: 4046 - 4049 publication: Journal of the American Chemical Society publication_status: published publisher: American Chemical Society publist_id: '7470' quality_controlled: '1' status: public title: Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 137 year: '2015' ... --- _id: '360' abstract: - lang: eng text: 'A cation exchange-based route was used to produce Cu2ZnSnS4 (CZTS)-Ag2S nanoparticles with controlled composition. We report a detailed study of the formation of such CZTS-Ag2S nanoheterostructures and of their photocatalytic properties. When compared to pure CZTS, the use of nanoscale p-n heterostructures as light absorbers for photocatalytic water splitting provides superior photocurrents. We associate this experimental fact to a higher separation efficiency of the photogenerated electron-hole pairs. We believe this and other type-II nanoheterostructures will open the door to the use of CZTS, with excellent light absorption properties and made of abundant and environmental friendly elements, to the field of photocatalysis. ' article_processing_charge: No author: - first_name: Xuelian full_name: Yu, Xuelian last_name: Yu - first_name: Jingjing full_name: Liu, Jingjing last_name: Liu - first_name: Aziz full_name: Genç, Aziz last_name: Genç - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Zhishan full_name: Luo, Zhishan last_name: Luo - first_name: Alexey full_name: Shavel, Alexey last_name: Shavel - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol - first_name: Guangjin full_name: Zhang, Guangjin last_name: Zhang - first_name: Yihe full_name: Zhang, Yihe last_name: Zhang - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot citation: ama: Yu X, Liu J, Genç A, et al. Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. 2015;31(38):10555-10561. doi:10.1021/acs.langmuir.5b02490 apa: Yu, X., Liu, J., Genç, A., Ibáñez, M., Luo, Z., Shavel, A., … Cabot, A. (2015). Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. American Chemical Society. https://doi.org/10.1021/acs.langmuir.5b02490 chicago: Yu, Xuelian, Jingjing Liu, Aziz Genç, Maria Ibáñez, Zhishan Luo, Alexey Shavel, Jordi Arbiol, Guangjin Zhang, Yihe Zhang, and Andreu Cabot. “Cu2ZnSnS4-Ag2S Nanoscale p-n Heterostructures as Sensitizers for Photoelectrochemical Water Splitting.” Langmuir. American Chemical Society, 2015. https://doi.org/10.1021/acs.langmuir.5b02490. ieee: X. Yu et al., “Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting,” Langmuir, vol. 31, no. 38. American Chemical Society, pp. 10555–10561, 2015. ista: Yu X, Liu J, Genç A, Ibáñez M, Luo Z, Shavel A, Arbiol J, Zhang G, Zhang Y, Cabot A. 2015. Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. 31(38), 10555–10561. mla: Yu, Xuelian, et al. “Cu2ZnSnS4-Ag2S Nanoscale p-n Heterostructures as Sensitizers for Photoelectrochemical Water Splitting.” Langmuir, vol. 31, no. 38, American Chemical Society, 2015, pp. 10555–61, doi:10.1021/acs.langmuir.5b02490. short: X. Yu, J. Liu, A. Genç, M. Ibáñez, Z. Luo, A. Shavel, J. Arbiol, G. Zhang, Y. Zhang, A. Cabot, Langmuir 31 (2015) 10555–10561. date_created: 2018-12-11T11:46:01Z date_published: 2015-09-29T00:00:00Z date_updated: 2021-01-12T07:44:34Z day: '29' doi: 10.1021/acs.langmuir.5b02490 extern: '1' intvolume: ' 31' issue: '38' language: - iso: eng month: '09' oa_version: None page: 10555 - 10561 publication: Langmuir publication_status: published publisher: American Chemical Society publist_id: '7467' status: public title: Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 31 year: '2015' ...