--- _id: '11851' abstract: - lang: eng text: The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weighted sum of the cut edges. In this paper, we engineer the fastest known exact algorithm for the problem. State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce the graph size such that at least one minimum cut is maintained in the contracted graph. Our algorithm achieves improvements in running time over these algorithms by a multitude of techniques. First, we use a recently developed fast and parallel inexact minimum cut algorithm to obtain a better bound for the problem. Afterwards, we use reductions that depend on this bound to reduce the size of the graph much faster than previously possible. We use improved data structures to further lower the running time of our algorithm. Additionally, we parallelize the contraction routines of Nagamochi et al. . Overall, we arrive at a system that significantly outperforms the fastest state-of-the-art solvers for the exact minimum cut problem. article_number: '8820968' article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Noe, Alexander last_name: Noe - first_name: Christian full_name: Schulz, Christian last_name: Schulz citation: ama: 'Henzinger MH, Noe A, Schulz C. Shared-memory exact minimum cuts. In: 33rd International Parallel and Distributed Processing Symposium. Institute of Electrical and Electronics Engineers; 2019. doi:10.1109/ipdps.2019.00013' apa: 'Henzinger, M. H., Noe, A., & Schulz, C. (2019). Shared-memory exact minimum cuts. In 33rd International Parallel and Distributed Processing Symposium. Rio de Janeiro, Brazil: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ipdps.2019.00013' chicago: Henzinger, Monika H, Alexander Noe, and Christian Schulz. “Shared-Memory Exact Minimum Cuts.” In 33rd International Parallel and Distributed Processing Symposium. Institute of Electrical and Electronics Engineers, 2019. https://doi.org/10.1109/ipdps.2019.00013. ieee: M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory exact minimum cuts,” in 33rd International Parallel and Distributed Processing Symposium, Rio de Janeiro, Brazil, 2019. ista: 'Henzinger MH, Noe A, Schulz C. 2019. Shared-memory exact minimum cuts. 33rd International Parallel and Distributed Processing Symposium. IPDPS: International Parallel and Distributed Processing Symposium, 8820968.' mla: Henzinger, Monika H., et al. “Shared-Memory Exact Minimum Cuts.” 33rd International Parallel and Distributed Processing Symposium, 8820968, Institute of Electrical and Electronics Engineers, 2019, doi:10.1109/ipdps.2019.00013. short: M.H. Henzinger, A. Noe, C. Schulz, in:, 33rd International Parallel and Distributed Processing Symposium, Institute of Electrical and Electronics Engineers, 2019. conference: end_date: 2019-05-24 location: Rio de Janeiro, Brazil name: 'IPDPS: International Parallel and Distributed Processing Symposium' start_date: 2019-05-20 date_created: 2022-08-16T07:25:23Z date_published: 2019-05-01T00:00:00Z date_updated: 2023-02-21T16:30:34Z day: '01' doi: 10.1109/ipdps.2019.00013 extern: '1' external_id: arxiv: - '1808.05458' language: - iso: eng main_file_link: - url: https://arxiv.org/abs/1808.05458 month: '05' oa_version: Preprint publication: 33rd International Parallel and Distributed Processing Symposium publication_identifier: eisbn: - 978-1-7281-1246-6 eissn: - 1530-2075 isbn: - 978-1-7281-1247-3 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' related_material: record: - id: '11851' relation: later_version status: public scopus_import: '1' status: public title: Shared-memory exact minimum cuts type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11865' abstract: - lang: eng text: We present the first sublinear-time algorithm that can compute the edge connectivity λ of a network exactly on distributed message-passing networks (the CONGEST model), as long as the network contains no multi-edge. We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity λ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes Õ(n1−1/353D1/353+n1−1/706) time to compute λ and a cut of cardinality λ with high probability, where n and D are the number of nodes and the diameter of the network, respectively, and Õ hides polylogarithmic factors. This running time is sublinear in n (i.e. Õ(n1−є)) whenever D is. Previous sublinear-time distributed algorithms can solve this problem either (i) exactly only when λ=O(n1/8−є) [Thurimella PODC’95; Pritchard, Thurimella, ACM Trans. Algorithms’11; Nanongkai, Su, DISC’14] or (ii) approximately [Ghaffari, Kuhn, DISC’13; Nanongkai, Su, DISC’14]. To achieve this we develop and combine several new techniques. First, we design the first distributed algorithm that can compute a k-edge connectivity certificate for any k=O(n1−є) in time Õ(√nk+D). The previous sublinear-time algorithm can do so only when k=o(√n) [Thurimella PODC’95]. In fact, our algorithm can be turned into the first parallel algorithm with polylogarithmic depth and near-linear work. Previous near-linear work algorithms are essentially sequential and previous polylogarithmic-depth algorithms require Ω(mk) work in the worst case (e.g. [Karger, Motwani, STOC’93]). Second, we show that by combining the recent distributed expander decomposition technique of [Chang, Pettie, Zhang, SODA’19] with techniques from the sequential deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC’15], we can decompose the network into a sublinear number of clusters with small average diameter and without any mincut separating a cluster (except the “trivial” ones). This leads to a simplification of the Kawarabayashi-Thorup framework (except that we are randomized while they are deterministic). This might make this framework more useful in other models of computation. Finally, by extending the tree packing technique from [Karger STOC’96], we can find the minimum cut in time proportional to the number of components. As a byproduct of this technique, we obtain an Õ(n)-time algorithm for computing exact minimum cut for weighted graphs. article_processing_charge: No author: - first_name: Mohit full_name: Daga, Mohit last_name: Daga - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai - first_name: Thatchaphol full_name: Saranurak, Thatchaphol last_name: Saranurak citation: ama: 'Daga M, Henzinger MH, Nanongkai D, Saranurak T. Distributed edge connectivity in sublinear time. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery; 2019:343–354. doi:10.1145/3313276.3316346' apa: 'Daga, M., Henzinger, M. H., Nanongkai, D., & Saranurak, T. (2019). Distributed edge connectivity in sublinear time. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp. 343–354). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3313276.3316346' chicago: Daga, Mohit, Monika H Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak. “Distributed Edge Connectivity in Sublinear Time.” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 343–354. Association for Computing Machinery, 2019. https://doi.org/10.1145/3313276.3316346. ieee: M. Daga, M. H. Henzinger, D. Nanongkai, and T. Saranurak, “Distributed edge connectivity in sublinear time,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 343–354. ista: 'Daga M, Henzinger MH, Nanongkai D, Saranurak T. 2019. Distributed edge connectivity in sublinear time. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 343–354.' mla: Daga, Mohit, et al. “Distributed Edge Connectivity in Sublinear Time.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354, doi:10.1145/3313276.3316346. short: M. Daga, M.H. Henzinger, D. Nanongkai, T. Saranurak, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354. conference: end_date: 2019-06-26 location: Phoenix, AZ, United States name: 'STOC: Symposium on Theory of Computing' start_date: 2019-06-23 date_created: 2022-08-16T09:11:17Z date_published: 2019-06-01T00:00:00Z date_updated: 2023-02-17T10:26:25Z day: '01' doi: 10.1145/3313276.3316346 extern: '1' external_id: arxiv: - '1904.04341' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1904.04341 month: '06' oa: 1 oa_version: Preprint page: 343–354 publication: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing publication_identifier: isbn: - 978-1-4503-6705-9 issn: - 0737-8017 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Distributed edge connectivity in sublinear time type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11871' abstract: - lang: eng text: "Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-case guarantee. But amortized data structures are not suitable for real-time systems, where each individual operation has to be executed quickly. For this reason, there exist many recent randomized results that aim to provide a guarantee stronger than amortized expected. The strongest possible guarantee for a randomized algorithm is that it is always correct (Las Vegas), and has high-probability worst-case update time, which gives a bound on the time for each individual operation that holds with high probability.\r\n\r\nIn this paper we present the first polylogarithmic high-probability worst-case time bounds for the dynamic spanner and the dynamic maximal matching problem.\r\n\r\n1.\t\r\nFor dynamic spanner, the only known o(n) worst-case bounds were O(n3/4) high-probability worst-case update time for maintaining a 3-spanner, and O(n5/9) for maintaining a 5-spanner. We give a O(1)k log3(n) high-probability worst-case time bound for maintaining a (2k – 1)-spanner, which yields the first worst-case polylog update time for all constant k. (All the results above maintain the optimal tradeoff of stretch 2k – 1 and Õ(n1+1/k) edges.)\r\n\r\n2.\t\r\nFor dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm with o(n) worst-case time bound was known and we present an algorithm with O(log5 (n)) high-probability worst-case time; similar worst-case bounds existed only for maintaining a matching that was (2 + ∊)-approximate, and hence not maximal.\r\n\r\nOur results are achieved using a new approach for converting amortized guarantees to worst-case ones for randomized data structures by going through a third type of guarantee, which is a middle ground between the two above: an algorithm is said to have worst-case expected update time α if for every update σ, the expected time to process σ is at most α. Although stronger than amortized expected, the worst-case expected guarantee does not resolve the fundamental problem of amortization: a worst-case expected update time of O(1) still allows for the possibility that every 1/f(n) updates requires Θ(f(n)) time to process, for arbitrarily high f(n). In this paper we present a black-box reduction that converts any data structure with worst-case expected update time into one with a high-probability worst-case update time: the query time remains the same, while the update time increases by a factor of O(log2(n)).\r\n\r\nThus we achieve our results in two steps: (1) First we show how to convert existing dynamic graph algorithms with amortized expected polylogarithmic running times into algorithms with worst-case expected polylogarithmic running times. (2) Then we use our black-box reduction to achieve the polylogarithmic high-probability worst-case time bound. All our algorithms are Las-Vegas-type algorithms." article_processing_charge: No author: - first_name: Aaron full_name: Bernstein, Aaron last_name: Bernstein - first_name: Sebastian full_name: Forster, Sebastian last_name: Forster - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 citation: ama: 'Bernstein A, Forster S, Henzinger MH. A deamortization approach for dynamic spanner and dynamic maximal matching. In: 30th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2019:1899-1918. doi:10.1137/1.9781611975482.115' apa: 'Bernstein, A., Forster, S., & Henzinger, M. H. (2019). A deamortization approach for dynamic spanner and dynamic maximal matching. In 30th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1899–1918). San Diego, CA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.115' chicago: Bernstein, Aaron, Sebastian Forster, and Monika H Henzinger. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” In 30th Annual ACM-SIAM Symposium on Discrete Algorithms, 1899–1918. Society for Industrial and Applied Mathematics, 2019. https://doi.org/10.1137/1.9781611975482.115. ieee: A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” in 30th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2019, pp. 1899–1918. ista: 'Bernstein A, Forster S, Henzinger MH. 2019. A deamortization approach for dynamic spanner and dynamic maximal matching. 30th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1899–1918.' mla: Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–918, doi:10.1137/1.9781611975482.115. short: A. Bernstein, S. Forster, M.H. Henzinger, in:, 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–1918. conference: end_date: 2019-01-09 location: San Diego, CA, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2019-01-06 date_created: 2022-08-16T09:50:33Z date_published: 2019-01-01T00:00:00Z date_updated: 2023-02-21T16:31:21Z day: '01' doi: 10.1137/1.9781611975482.115 extern: '1' external_id: arxiv: - '1810.10932' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1810.10932 month: '01' oa: 1 oa_version: Preprint page: 1899-1918 publication: 30th Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: eisbn: - 978-1-61197-548-2 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' related_material: record: - id: '11871' relation: earlier_version status: public scopus_import: '1' status: public title: A deamortization approach for dynamic spanner and dynamic maximal matching type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11898' abstract: - lang: eng text: "We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (FOCS'12), and Clifford et al. (FOCS'15) to present a general framework that gives amortized lower bounds on the update and query times of dynamic data structures. Using our framework, we present two concrete results.\r\n(1) For the dynamic polynomial evaluation problem, where the polynomial is defined over a finite field of size n1+Ω(1) and has degree n, any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω((lgn/lglgn)2).\r\n(2) For the dynamic online matrix vector multiplication problem, where we get an n×n matrix whose entires are drawn from a finite field of size nΘ(1), any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω(n⋅(lgn/lglgn)2).\r\nFor these two problems, the previous works by Larsen (FOCS'12) and Clifford et al. (FOCS'15) gave the same lower bounds, but only for worst case update and query times. Our bounds match the highest unconditional lower bounds known till date for any dynamic problem in the cell-probe model." article_processing_charge: No article_type: original author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Stefan full_name: Neumann, Stefan last_name: Neumann citation: ama: Bhattacharya S, Henzinger MH, Neumann S. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 2019;779:72-87. doi:10.1016/j.tcs.2019.01.043 apa: Bhattacharya, S., Henzinger, M. H., & Neumann, S. (2019). New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.01.043 chicago: Bhattacharya, Sayan, Monika H Henzinger, and Stefan Neumann. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science. Elsevier, 2019. https://doi.org/10.1016/j.tcs.2019.01.043. ieee: S. Bhattacharya, M. H. Henzinger, and S. Neumann, “New amortized cell-probe lower bounds for dynamic problems,” Theoretical Computer Science, vol. 779. Elsevier, pp. 72–87, 2019. ista: Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 779, 72–87. mla: Bhattacharya, Sayan, et al. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science, vol. 779, Elsevier, 2019, pp. 72–87, doi:10.1016/j.tcs.2019.01.043. short: S. Bhattacharya, M.H. Henzinger, S. Neumann, Theoretical Computer Science 779 (2019) 72–87. date_created: 2022-08-17T09:02:15Z date_published: 2019-08-02T00:00:00Z date_updated: 2022-09-09T11:29:04Z day: '02' doi: 10.1016/j.tcs.2019.01.043 extern: '1' external_id: arxiv: - '1902.02304' intvolume: ' 779' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1902.02304 month: '08' oa: 1 oa_version: Preprint page: 72-87 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: New amortized cell-probe lower bounds for dynamic problems type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 779 year: '2019' ... --- _id: '11957' abstract: - lang: eng text: Cross-coupling reactions mediated by dual nickel/photocatalysis are synthetically attractive but rely mainly on expensive, non-recyclable noble-metal complexes as photocatalysts. Heterogeneous semiconductors, which are commonly used for artificial photosynthesis and wastewater treatment, are a sustainable alternative. Graphitic carbon nitrides, a class of metal-free polymers that can be easily prepared from bulk chemicals, are heterogeneous semiconductors with high potential for photocatalytic organic transformations. Here, we demonstrate that graphitic carbon nitrides in combination with nickel catalysis can induce selective C−O cross-couplings of carboxylic acids with aryl halides, yielding the respective aryl esters in excellent yield and selectivity. The heterogeneous organic photocatalyst exhibits a broad substrate scope, is able to harvest green light, and can be recycled multiple times. In situ FTIR was used to track the reaction progress to study this transformation at different irradiation wavelengths and reaction scales. article_processing_charge: No article_type: letter_note author: - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: Jamal A. full_name: Malik, Jamal A. last_name: Malik - first_name: Cristian full_name: Cavedon, Cristian last_name: Cavedon - first_name: Sebastian full_name: Gisbertz, Sebastian last_name: Gisbertz - first_name: Aleksandr full_name: Savateev, Aleksandr last_name: Savateev - first_name: Daniel full_name: Cruz, Daniel last_name: Cruz - first_name: Tobias full_name: Heil, Tobias last_name: Heil - first_name: Guigang full_name: Zhang, Guigang last_name: Zhang - first_name: Peter H. full_name: Seeberger, Peter H. last_name: Seeberger citation: ama: 'Pieber B, Malik JA, Cavedon C, et al. Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie International Edition. 2019;58(28):9575-9580. doi:10.1002/anie.201902785' apa: 'Pieber, B., Malik, J. A., Cavedon, C., Gisbertz, S., Savateev, A., Cruz, D., … Seeberger, P. H. (2019). Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201902785' chicago: 'Pieber, Bartholomäus, Jamal A. Malik, Cristian Cavedon, Sebastian Gisbertz, Aleksandr Savateev, Daniel Cruz, Tobias Heil, Guigang Zhang, and Peter H. Seeberger. “Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.” Angewandte Chemie International Edition. Wiley, 2019. https://doi.org/10.1002/anie.201902785.' ieee: 'B. Pieber et al., “Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides,” Angewandte Chemie International Edition, vol. 58, no. 28. Wiley, pp. 9575–9580, 2019.' ista: 'Pieber B, Malik JA, Cavedon C, Gisbertz S, Savateev A, Cruz D, Heil T, Zhang G, Seeberger PH. 2019. Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie International Edition. 58(28), 9575–9580.' mla: 'Pieber, Bartholomäus, et al. “Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.” Angewandte Chemie International Edition, vol. 58, no. 28, Wiley, 2019, pp. 9575–80, doi:10.1002/anie.201902785.' short: B. Pieber, J.A. Malik, C. Cavedon, S. Gisbertz, A. Savateev, D. Cruz, T. Heil, G. Zhang, P.H. Seeberger, Angewandte Chemie International Edition 58 (2019) 9575–9580. date_created: 2022-08-24T10:50:19Z date_published: 2019-07-08T00:00:00Z date_updated: 2023-02-21T10:09:16Z day: '08' doi: 10.1002/anie.201902785 extern: '1' external_id: pmid: - '31050132' intvolume: ' 58' issue: '28' language: - iso: eng month: '07' oa_version: None page: 9575-9580 pmid: 1 publication: Angewandte Chemie International Edition publication_identifier: eissn: - 1521-3773 issn: - 1433-7851 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: 'Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 58 year: '2019' ... --- _id: '11984' abstract: - lang: eng text: Differentially protected galactosamine building blocks are key components for the synthesis of human and bacterial oligosaccharides. The azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal provides straightforward access to the corresponding 2-nitrogenated glycoside. Poor reproducibility and the use of azides that lead to the formation of potentially explosive and toxic species limit the scalability of this reaction and render it a bottleneck for carbohydrate synthesis. Here, we present a method for the safe, efficient, and reliable azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal at room temperature, using continuous flow chemistry. Careful analysis of the transformation resulted in reaction conditions that produce minimal side products while the reaction time was reduced drastically when compared to batch reactions. The flow setup is readily scalable to process 5 mmol of galactal in 3 h, producing 1.2 mmol/h of product. article_processing_charge: No article_type: letter_note author: - first_name: Mónica full_name: Guberman, Mónica last_name: Guberman - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: Peter H. full_name: Seeberger, Peter H. last_name: Seeberger citation: ama: Guberman M, Pieber B, Seeberger PH. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. 2019;23(12):2764-2770. doi:10.1021/acs.oprd.9b00456 apa: Guberman, M., Pieber, B., & Seeberger, P. H. (2019). Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. American Chemical Society. https://doi.org/10.1021/acs.oprd.9b00456 chicago: Guberman, Mónica, Bartholomäus Pieber, and Peter H. Seeberger. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” Organic Process Research and Development. American Chemical Society, 2019. https://doi.org/10.1021/acs.oprd.9b00456. ieee: M. Guberman, B. Pieber, and P. H. Seeberger, “Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks,” Organic Process Research and Development, vol. 23, no. 12. American Chemical Society, pp. 2764–2770, 2019. ista: Guberman M, Pieber B, Seeberger PH. 2019. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. 23(12), 2764–2770. mla: Guberman, Mónica, et al. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” Organic Process Research and Development, vol. 23, no. 12, American Chemical Society, 2019, pp. 2764–70, doi:10.1021/acs.oprd.9b00456. short: M. Guberman, B. Pieber, P.H. Seeberger, Organic Process Research and Development 23 (2019) 2764–2770. date_created: 2022-08-25T11:30:33Z date_published: 2019-12-20T00:00:00Z date_updated: 2023-02-21T10:10:23Z day: '20' doi: 10.1021/acs.oprd.9b00456 extern: '1' intvolume: ' 23' issue: '12' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1021/acs.oprd.9b00456 month: '12' oa: 1 oa_version: Published Version page: 2764-2770 publication: Organic Process Research and Development publication_identifier: eissn: - 1520-586X issn: - 1083-6160 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 23 year: '2019' ... --- _id: '11982' abstract: - lang: eng text: A carbon nitride material can be combined with homogeneous nickel catalysts for light-mediated cross-couplings of aryl bromides with alcohols under mild conditions. The metal-free heterogeneous semiconductor is fully recyclable and couples a broad range of electron-poor aryl bromides with primary and secondary alcohols as well as water. The application for intramolecular reactions and the synthesis of active pharmaceutical ingredients was demonstrated. The catalytic protocol is applicable for the coupling of aryl iodides with thiols as well. article_processing_charge: No article_type: letter_note author: - first_name: Cristian full_name: Cavedon, Cristian last_name: Cavedon - first_name: Amiera full_name: Madani, Amiera last_name: Madani - first_name: Peter H. full_name: Seeberger, Peter H. last_name: Seeberger - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X citation: ama: Cavedon C, Madani A, Seeberger PH, Pieber B. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. 2019;21(13):5331-5334. doi:10.1021/acs.orglett.9b01957 apa: Cavedon, C., Madani, A., Seeberger, P. H., & Pieber, B. (2019). Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. American Chemical Society. https://doi.org/10.1021/acs.orglett.9b01957 chicago: Cavedon, Cristian, Amiera Madani, Peter H. Seeberger, and Bartholomäus Pieber. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” Organic Letters. American Chemical Society, 2019. https://doi.org/10.1021/acs.orglett.9b01957. ieee: C. Cavedon, A. Madani, P. H. Seeberger, and B. Pieber, “Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides,” Organic Letters, vol. 21, no. 13. American Chemical Society, pp. 5331–5334, 2019. ista: Cavedon C, Madani A, Seeberger PH, Pieber B. 2019. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. 21(13), 5331–5334. mla: Cavedon, Cristian, et al. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” Organic Letters, vol. 21, no. 13, American Chemical Society, 2019, pp. 5331–34, doi:10.1021/acs.orglett.9b01957. short: C. Cavedon, A. Madani, P.H. Seeberger, B. Pieber, Organic Letters 21 (2019) 5331–5334. date_created: 2022-08-25T11:18:00Z date_published: 2019-07-05T00:00:00Z date_updated: 2023-02-21T10:10:19Z day: '05' doi: 10.1021/acs.orglett.9b01957 extern: '1' external_id: pmid: - '31247752' intvolume: ' 21' issue: '13' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1021/acs.orglett.9b01957 month: '07' oa: 1 oa_version: Published Version page: 5331-5334 pmid: 1 publication: Organic Letters publication_identifier: eissn: - 1523-7052 issn: - 1523-7060 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 21 year: '2019' ... --- _id: '170' abstract: - lang: eng text: Upper and lower bounds, of the expected order of magnitude, are obtained for the number of rational points of bounded height on any quartic del Pezzo surface over ℚ that contains a conic defined over ℚ . author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Efthymios full_name: Sofos, Efthymios last_name: Sofos citation: ama: Browning TD, Sofos E. Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. 2019;373(3-4):977-1016. doi:10.1007/s00208-018-1716-6 apa: Browning, T. D., & Sofos, E. (2019). Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. Springer Nature. https://doi.org/10.1007/s00208-018-1716-6 chicago: Browning, Timothy D, and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” Mathematische Annalen. Springer Nature, 2019. https://doi.org/10.1007/s00208-018-1716-6. ieee: T. D. Browning and E. Sofos, “Counting rational points on quartic del Pezzo surfaces with a rational conic,” Mathematische Annalen, vol. 373, no. 3–4. Springer Nature, pp. 977–1016, 2019. ista: Browning TD, Sofos E. 2019. Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. 373(3–4), 977–1016. mla: Browning, Timothy D., and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” Mathematische Annalen, vol. 373, no. 3–4, Springer Nature, 2019, pp. 977–1016, doi:10.1007/s00208-018-1716-6. short: T.D. Browning, E. Sofos, Mathematische Annalen 373 (2019) 977–1016. date_created: 2018-12-11T11:44:59Z date_published: 2019-04-01T00:00:00Z date_updated: 2021-01-12T06:52:37Z day: '01' ddc: - '510' doi: 10.1007/s00208-018-1716-6 extern: '1' external_id: arxiv: - '1609.09057' file: - access_level: open_access checksum: 4061dc2fe99bee25d9adf2d2018cf608 content_type: application/pdf creator: dernst date_created: 2019-05-23T07:53:27Z date_updated: 2020-07-14T12:45:12Z file_id: '6479' file_name: 2019_MathAnnalen_Browning.pdf file_size: 712847 relation: main_file file_date_updated: 2020-07-14T12:45:12Z has_accepted_license: '1' intvolume: ' 373' issue: 3-4 language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 977-1016 publication: Mathematische Annalen publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Counting rational points on quartic del Pezzo surfaces with a rational conic tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 373 year: '2019' ... --- _id: '441' article_processing_charge: No article_type: original author: - first_name: Nikita full_name: Kalinin, Nikita last_name: Kalinin - first_name: Mikhail full_name: Shkolnikov, Mikhail id: 35084A62-F248-11E8-B48F-1D18A9856A87 last_name: Shkolnikov orcid: 0000-0002-4310-178X citation: ama: Kalinin N, Shkolnikov M. Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. 2019;5(3):909–928. doi:10.1007/s40879-018-0218-0 apa: Kalinin, N., & Shkolnikov, M. (2019). Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-018-0218-0 chicago: Kalinin, Nikita, and Mikhail Shkolnikov. “Tropical Formulae for Summation over a Part of SL(2,Z).” European Journal of Mathematics. Springer Nature, 2019. https://doi.org/10.1007/s40879-018-0218-0. ieee: N. Kalinin and M. Shkolnikov, “Tropical formulae for summation over a part of SL(2,Z),” European Journal of Mathematics, vol. 5, no. 3. Springer Nature, pp. 909–928, 2019. ista: Kalinin N, Shkolnikov M. 2019. Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. 5(3), 909–928. mla: Kalinin, Nikita, and Mikhail Shkolnikov. “Tropical Formulae for Summation over a Part of SL(2,Z).” European Journal of Mathematics, vol. 5, no. 3, Springer Nature, 2019, pp. 909–928, doi:10.1007/s40879-018-0218-0. short: N. Kalinin, M. Shkolnikov, European Journal of Mathematics 5 (2019) 909–928. date_created: 2018-12-11T11:46:29Z date_published: 2019-09-15T00:00:00Z date_updated: 2021-01-12T07:56:46Z day: '15' department: - _id: TaHa doi: 10.1007/s40879-018-0218-0 ec_funded: 1 external_id: arxiv: - '1711.02089' intvolume: ' 5' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1711.02089 month: '09' oa: 1 oa_version: Preprint page: 909–928 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: European Journal of Mathematics publication_identifier: eissn: - 2199-6768 issn: - 2199-675X publication_status: published publisher: Springer Nature publist_id: '7382' quality_controlled: '1' scopus_import: 1 status: public title: Tropical formulae for summation over a part of SL(2,Z) type: journal_article user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 5 year: '2019' ... --- _id: '5793' abstract: - lang: eng text: The transcription coactivator, Yes-associated protein (YAP), which is a nuclear effector of the Hippo signaling pathway, has been shown to be a mechano-transducer. By using mutant fish and human 3D spheroids, we have recently demonstrated that YAP is also a mechano-effector. YAP functions in three-dimensional (3D) morphogenesis of organ and global body shape by controlling actomyosin-mediated tissue tension. In this chapter, we present a platform that links the findings in fish embryos with human cells. The protocols for analyzing tissue tension-mediated global body shape/organ morphogenesis in vivo and ex vivo using medaka fish embryos and in vitro using human cell spheroids represent useful tools for unraveling the molecular mechanisms by which YAP functions in regulating global body/organ morphogenesis. alternative_title: - MIMB author: - first_name: Yoichi full_name: Asaoka, Yoichi last_name: Asaoka - first_name: Hitoshi full_name: Morita, Hitoshi last_name: Morita - first_name: Hiroko full_name: Furumoto, Hiroko last_name: Furumoto - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 - first_name: Makoto full_name: Furutani-Seiki, Makoto last_name: Furutani-Seiki citation: ama: 'Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: Hergovich A, ed. The Hippo Pathway. Vol 1893. Methods in Molecular Biology. Springer; 2019:167-181. doi:10.1007/978-1-4939-8910-2_14' apa: Asaoka, Y., Morita, H., Furumoto, H., Heisenberg, C.-P. J., & Furutani-Seiki, M. (2019). Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In A. Hergovich (Ed.), The hippo pathway (Vol. 1893, pp. 167–181). Springer. https://doi.org/10.1007/978-1-4939-8910-2_14 chicago: Asaoka, Yoichi, Hitoshi Morita, Hiroko Furumoto, Carl-Philipp J Heisenberg, and Makoto Furutani-Seiki. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos and Human Spheroids.” In The Hippo Pathway, edited by Alexander Hergovich, 1893:167–81. Methods in Molecular Biology. Springer, 2019. https://doi.org/10.1007/978-1-4939-8910-2_14. ieee: Y. Asaoka, H. Morita, H. Furumoto, C.-P. J. Heisenberg, and M. Furutani-Seiki, “Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids,” in The hippo pathway, vol. 1893, A. Hergovich, Ed. Springer, 2019, pp. 167–181. ista: 'Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. 2019.Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: The hippo pathway. MIMB, vol. 1893, 167–181.' mla: Asaoka, Yoichi, et al. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos and Human Spheroids.” The Hippo Pathway, edited by Alexander Hergovich, vol. 1893, Springer, 2019, pp. 167–81, doi:10.1007/978-1-4939-8910-2_14. short: Y. Asaoka, H. Morita, H. Furumoto, C.-P.J. Heisenberg, M. Furutani-Seiki, in:, A. Hergovich (Ed.), The Hippo Pathway, Springer, 2019, pp. 167–181. date_created: 2019-01-06T22:59:11Z date_published: 2019-01-01T00:00:00Z date_updated: 2021-01-12T08:03:30Z day: '01' department: - _id: CaHe doi: 10.1007/978-1-4939-8910-2_14 editor: - first_name: Alexander full_name: Hergovich, Alexander last_name: Hergovich intvolume: ' 1893' language: - iso: eng month: '01' oa_version: None page: 167-181 publication: The hippo pathway publication_identifier: isbn: - 978-1-4939-8909-6 publication_status: published publisher: Springer quality_controlled: '1' scopus_import: 1 series_title: Methods in Molecular Biology status: public title: Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 1893 year: '2019' ... --- _id: '5887' abstract: - lang: eng text: 'Cryptographic security is usually defined as a guarantee that holds except when a bad event with negligible probability occurs, and nothing is guaranteed in that bad case. However, in settings where such failure can happen with substantial probability, one needs to provide guarantees even for the bad case. A typical example is where a (possibly weak) password is used instead of a secure cryptographic key to protect a session, the bad event being that the adversary correctly guesses the password. In a situation with multiple such sessions, a per-session guarantee is desired: any session for which the password has not been guessed remains secure, independently of whether other sessions have been compromised. A new formalism for stating such gracefully degrading security guarantees is introduced and applied to analyze the examples of password-based message authentication and password-based encryption. While a natural per-message guarantee is achieved for authentication, the situation of password-based encryption is more delicate: a per-session confidentiality guarantee only holds against attackers for which the distribution of password-guessing effort over the sessions is known in advance. In contrast, for more general attackers without such a restriction, a strong, composable notion of security cannot be achieved.' article_processing_charge: No article_type: original author: - first_name: Gregory full_name: Demay, Gregory last_name: Demay - first_name: Peter full_name: Gazi, Peter id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87 last_name: Gazi - first_name: Ueli full_name: Maurer, Ueli last_name: Maurer - first_name: Bjorn full_name: Tackmann, Bjorn last_name: Tackmann citation: ama: 'Demay G, Gazi P, Maurer U, Tackmann B. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 2019;27(1):75-111. doi:10.3233/JCS-181131' apa: 'Demay, G., Gazi, P., Maurer, U., & Tackmann, B. (2019). Per-session security: Password-based cryptography revisited. Journal of Computer Security. IOS Press. https://doi.org/10.3233/JCS-181131' chicago: 'Demay, Gregory, Peter Gazi, Ueli Maurer, and Bjorn Tackmann. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security. IOS Press, 2019. https://doi.org/10.3233/JCS-181131.' ieee: 'G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Per-session security: Password-based cryptography revisited,” Journal of Computer Security, vol. 27, no. 1. IOS Press, pp. 75–111, 2019.' ista: 'Demay G, Gazi P, Maurer U, Tackmann B. 2019. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 27(1), 75–111.' mla: 'Demay, Gregory, et al. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security, vol. 27, no. 1, IOS Press, 2019, pp. 75–111, doi:10.3233/JCS-181131.' short: G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27 (2019) 75–111. date_created: 2019-01-27T22:59:10Z date_published: 2019-01-01T00:00:00Z date_updated: 2021-01-12T08:05:08Z day: '1' department: - _id: KrPi doi: 10.3233/JCS-181131 ec_funded: 1 intvolume: ' 27' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2016/166 month: '01' oa: 1 oa_version: Preprint page: 75-111 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: Journal of Computer Security publication_identifier: issn: - 0926227X publication_status: published publisher: IOS Press quality_controlled: '1' scopus_import: '1' status: public title: 'Per-session security: Password-based cryptography revisited' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 27 year: '2019' ... --- _id: '6163' abstract: - lang: eng text: We propose a new non-orthogonal basis to express the 3D Euclidean space in terms of a regular grid. Every grid point, each represented by integer 3-coordinates, corresponds to rhombic dodecahedron centroid. Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. A characterization of a 3D digital sphere with relevant topological features is proposed as well with the help of a 48 symmetry that comes with the new coordinate system. alternative_title: - LNCS article_processing_charge: No author: - first_name: Ranita full_name: Biswas, Ranita id: 3C2B033E-F248-11E8-B48F-1D18A9856A87 last_name: Biswas orcid: 0000-0002-5372-7890 - first_name: Gaëlle full_name: Largeteau-Skapin, Gaëlle last_name: Largeteau-Skapin - first_name: Rita full_name: Zrour, Rita last_name: Zrour - first_name: Eric full_name: Andres, Eric last_name: Andres citation: ama: 'Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. In: 21st IAPR International Conference on Discrete Geometry for Computer Imagery. Vol 11414. Berlin, Heidelberg: Springer Berlin Heidelberg; 2019:27-37. doi:10.1007/978-3-030-14085-4_3' apa: 'Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2019). Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. In 21st IAPR International Conference on Discrete Geometry for Computer Imagery (Vol. 11414, pp. 27–37). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-030-14085-4_3' chicago: 'Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.” In 21st IAPR International Conference on Discrete Geometry for Computer Imagery, 11414:27–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019. https://doi.org/10.1007/978-3-030-14085-4_3.' ieee: R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Rhombic dodecahedron grid—coordinate system and 3D digital object definitions,” in 21st IAPR International Conference on Discrete Geometry for Computer Imagery, Marne-la-Vallée, France, 2019, vol. 11414, pp. 27–37. ista: 'Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2019. Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. 21st IAPR International Conference on Discrete Geometry for Computer Imagery. DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS, vol. 11414, 27–37.' mla: Biswas, Ranita, et al. “Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.” 21st IAPR International Conference on Discrete Geometry for Computer Imagery, vol. 11414, Springer Berlin Heidelberg, 2019, pp. 27–37, doi:10.1007/978-3-030-14085-4_3. short: R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, in:, 21st IAPR International Conference on Discrete Geometry for Computer Imagery, Springer Berlin Heidelberg, Berlin, Heidelberg, 2019, pp. 27–37. conference: end_date: 2019-03-28 location: Marne-la-Vallée, France name: 'DGCI: International Conference on Discrete Geometry for Computer Imagery' start_date: 2019-03-26 date_created: 2019-03-21T12:12:19Z date_published: 2019-02-23T00:00:00Z date_updated: 2022-01-27T14:25:17Z day: '23' doi: 10.1007/978-3-030-14085-4_3 extern: '1' intvolume: ' 11414' language: - iso: eng month: '02' oa_version: None page: 27-37 place: Berlin, Heidelberg publication: 21st IAPR International Conference on Discrete Geometry for Computer Imagery publication_identifier: isbn: - 978-3-6624-6446-5 - 978-3-6624-6447-2 issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg quality_controlled: '1' status: public title: Rhombic dodecahedron grid—coordinate system and 3D digital object definitions type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 11414 year: '2019' ... --- _id: '6515' abstract: - lang: eng text: We give non-degeneracy criteria for Riemannian simplices based on simplices in spaces of constant sectional curvature. It extends previous work on Riemannian simplices, where we developed Riemannian simplices with respect to Euclidean reference simplices. The criteria we give in this article are in terms of quality measures for spaces of constant curvature that we develop here. We see that simplices in spaces that have nearly constant curvature, are already non-degenerate under very weak quality demands. This is of importance because it allows for sampling of Riemannian manifolds based on anisotropy of the manifold and not (absolute) curvature. author: - first_name: Ramsay full_name: Dyer, Ramsay last_name: Dyer - first_name: Gert full_name: Vegter, Gert last_name: Vegter - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: Dyer R, Vegter G, Wintraecken M. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 2019;10(1):223–256. doi:10.20382/jocg.v10i1a9 apa: Dyer, R., Vegter, G., & Wintraecken, M. (2019). Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . Carleton University. https://doi.org/10.20382/jocg.v10i1a9 chicago: Dyer, Ramsay, Gert Vegter, and Mathijs Wintraecken. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry . Carleton University, 2019. https://doi.org/10.20382/jocg.v10i1a9. ieee: R. Dyer, G. Vegter, and M. Wintraecken, “Simplices modelled on spaces of constant curvature,” Journal of Computational Geometry , vol. 10, no. 1. Carleton University, pp. 223–256, 2019. ista: Dyer R, Vegter G, Wintraecken M. 2019. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 10(1), 223–256. mla: Dyer, Ramsay, et al. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry , vol. 10, no. 1, Carleton University, 2019, pp. 223–256, doi:10.20382/jocg.v10i1a9. short: R. Dyer, G. Vegter, M. Wintraecken, Journal of Computational Geometry 10 (2019) 223–256. date_created: 2019-06-03T09:35:33Z date_published: 2019-07-01T00:00:00Z date_updated: 2021-01-12T08:07:50Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.20382/jocg.v10i1a9 ec_funded: 1 file: - access_level: open_access checksum: 57b4df2f16a74eb499734ec8ee240178 content_type: application/pdf creator: mwintrae date_created: 2019-06-03T09:30:01Z date_updated: 2020-07-14T12:47:32Z file_id: '6516' file_name: mainJournalFinal.pdf file_size: 2170882 relation: main_file file_date_updated: 2020-07-14T12:47:32Z has_accepted_license: '1' intvolume: ' 10' issue: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 223–256 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 'Journal of Computational Geometry ' publication_identifier: issn: - 1920-180X publication_status: published publisher: Carleton University quality_controlled: '1' scopus_import: 1 status: public title: Simplices modelled on spaces of constant curvature tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2019' ... --- _id: '6528' abstract: - lang: eng text: We construct a verifiable delay function (VDF) by showing how the Rivest-Shamir-Wagner time-lock puzzle can be made publicly verifiable. Concretely, we give a statistically sound public-coin protocol to prove that a tuple (N,x,T,y) satisfies y=x2T (mod N) where the prover doesn’t know the factorization of N and its running time is dominated by solving the puzzle, that is, compute x2T, which is conjectured to require T sequential squarings. To get a VDF we make this protocol non-interactive using the Fiat-Shamir heuristic.The motivation for this work comes from the Chia blockchain design, which uses a VDF as akey ingredient. For typical parameters (T≤2 40, N= 2048), our proofs are of size around 10K B, verification cost around three RSA exponentiations and computing the proof is 8000 times faster than solving the puzzle even without any parallelism. alternative_title: - LIPIcs article_number: '60' article_processing_charge: No author: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Pietrzak KZ. Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ITCS.2019.60' apa: 'Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.60' chicago: Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” In 10th Innovations in Theoretical Computer Science Conference, Vol. 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ITCS.2019.60. ieee: K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124. ista: 'Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 60.' mla: Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60. short: K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-01-12 location: San Diego, CA, United States name: 'ITCS 2019: Innovations in Theoretical Computer Science' start_date: 2019-01-10 date_created: 2019-06-06T14:12:36Z date_published: 2019-01-10T00:00:00Z date_updated: 2021-01-12T08:07:53Z day: '10' ddc: - '000' department: - _id: KrPi doi: 10.4230/LIPICS.ITCS.2019.60 ec_funded: 1 file: - access_level: open_access checksum: f0ae1bb161431d9db3dea5ace082bfb5 content_type: application/pdf creator: dernst date_created: 2019-06-06T14:22:04Z date_updated: 2020-07-14T12:47:33Z file_id: '6529' file_name: 2019_LIPIcs_Pietrzak.pdf file_size: 558770 relation: main_file file_date_updated: 2020-07-14T12:47:33Z has_accepted_license: '1' intvolume: ' 124' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2018/627 month: '01' oa: 1 oa_version: Published Version project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: 10th Innovations in Theoretical Computer Science Conference publication_identifier: isbn: - 978-3-95977-095-8 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Simple verifiable delay functions tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 124 year: '2019' ... --- _id: '6565' abstract: - lang: eng text: In this paper, we address the problem of synthesizing periodic switching controllers for stabilizing a family of linear systems. Our broad approach consists of constructing a finite game graph based on the family of linear systems such that every winning strategy on the game graph corresponds to a stabilizing switching controller for the family of linear systems. The construction of a (finite) game graph, the synthesis of a winning strategy and the extraction of a stabilizing controller are all computationally feasible. We illustrate our method on an example. article_number: '8715598' article_processing_charge: No author: - first_name: Atreyee full_name: Kundu, Atreyee last_name: Kundu - first_name: Miriam full_name: Garcia Soto, Miriam id: 4B3207F6-F248-11E8-B48F-1D18A9856A87 last_name: Garcia Soto orcid: 0000−0003−2936−5719 - first_name: Pavithra full_name: Prabhakar, Pavithra last_name: Prabhakar citation: ama: 'Kundu A, Garcia Soto M, Prabhakar P. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In: 5th Indian Control Conference Proceedings. IEEE; 2019. doi:10.1109/INDIANCC.2019.8715598' apa: 'Kundu, A., Garcia Soto, M., & Prabhakar, P. (2019). Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In 5th Indian Control Conference Proceedings. Delhi, India: IEEE. https://doi.org/10.1109/INDIANCC.2019.8715598' chicago: Kundu, Atreyee, Miriam Garcia Soto, and Pavithra Prabhakar. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” In 5th Indian Control Conference Proceedings. IEEE, 2019. https://doi.org/10.1109/INDIANCC.2019.8715598. ieee: A. Kundu, M. Garcia Soto, and P. Prabhakar, “Formal synthesis of stabilizing controllers for periodically controlled linear switched systems,” in 5th Indian Control Conference Proceedings, Delhi, India, 2019. ista: Kundu A, Garcia Soto M, Prabhakar P. 2019. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. 5th Indian Control Conference Proceedings. ICC 2019 - Indian Control Conference, 8715598. mla: Kundu, Atreyee, et al. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” 5th Indian Control Conference Proceedings, 8715598, IEEE, 2019, doi:10.1109/INDIANCC.2019.8715598. short: A. Kundu, M. Garcia Soto, P. Prabhakar, in:, 5th Indian Control Conference Proceedings, IEEE, 2019. conference: end_date: 2019-01-11 location: Delhi, India name: ICC 2019 - Indian Control Conference start_date: 2019-01-09 date_created: 2019-06-17T06:57:33Z date_published: 2019-05-16T00:00:00Z date_updated: 2021-01-12T08:08:01Z day: '16' ddc: - '000' department: - _id: ToHe doi: 10.1109/INDIANCC.2019.8715598 file: - access_level: open_access checksum: d622a91af1e427f6b1e0ba8e18a2b767 content_type: application/pdf creator: dernst date_created: 2020-10-21T13:13:49Z date_updated: 2020-10-21T13:13:49Z file_id: '8687' file_name: 2019_ICC_Kundu.pdf file_size: 396031 relation: main_file success: 1 file_date_updated: 2020-10-21T13:13:49Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Submitted Version project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: 5th Indian Control Conference Proceedings publication_identifier: isbn: - 978-153866246-5 publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: Formal synthesis of stabilizing controllers for periodically controlled linear switched systems type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '6628' abstract: - lang: eng text: Fejes Tóth [5] and Schneider [9] studied approximations of smooth convex hypersurfaces in Euclidean space by piecewise flat triangular meshes with a given number of vertices on the hypersurface that are optimal with respect to Hausdorff distance. They proved that this Hausdorff distance decreases inversely proportional with m 2/(d−1), where m is the number of vertices and d is the dimension of Euclidean space. Moreover the pro-portionality constant can be expressed in terms of the Gaussian curvature, an intrinsic quantity. In this short note, we prove the extrinsic nature of this constant for manifolds of sufficiently high codimension. We do so by constructing an family of isometric embeddings of the flat torus in Euclidean space. author: - first_name: Gert full_name: Vegter, Gert last_name: Vegter - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: 'Vegter G, Wintraecken M. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In: The 31st Canadian Conference in Computational Geometry. ; 2019:275-279.' apa: Vegter, G., & Wintraecken, M. (2019). The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In The 31st Canadian Conference in Computational Geometry (pp. 275–279). Edmonton, Canada. chicago: Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” In The 31st Canadian Conference in Computational Geometry, 275–79, 2019. ieee: G. Vegter and M. Wintraecken, “The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds,” in The 31st Canadian Conference in Computational Geometry, Edmonton, Canada, 2019, pp. 275–279. ista: 'Vegter G, Wintraecken M. 2019. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. The 31st Canadian Conference in Computational Geometry. CCCG: Canadian Conference in Computational Geometry, 275–279.' mla: Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–79. short: G. Vegter, M. Wintraecken, in:, The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–279. conference: end_date: 2019-08-10 location: Edmonton, Canada name: 'CCCG: Canadian Conference in Computational Geometry' start_date: 2019-08-08 date_created: 2019-07-12T08:34:57Z date_published: 2019-08-01T00:00:00Z date_updated: 2021-01-12T08:08:16Z day: '01' ddc: - '004' department: - _id: HeEd ec_funded: 1 file: - access_level: open_access checksum: ceabd152cfa55170d57763f9c6c60a53 content_type: application/pdf creator: mwintrae date_created: 2019-07-12T08:32:46Z date_updated: 2020-07-14T12:47:34Z file_id: '6629' file_name: IntrinsicExtrinsicCCCG2019.pdf file_size: 321176 relation: main_file file_date_updated: 2020-07-14T12:47:34Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version page: 275-279 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: The 31st Canadian Conference in Computational Geometry publication_status: published quality_controlled: '1' scopus_import: 1 status: public title: The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '6648' abstract: - lang: eng text: "Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms. Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory\r\nneeded for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context." alternative_title: - LIPIcs author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Ziga full_name: Virk, Ziga last_name: Virk - first_name: Hubert full_name: Wagner, Hubert id: 379CA8B8-F248-11E8-B48F-1D18A9856A87 last_name: Wagner citation: ama: 'Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:31:1-31:14. doi:10.4230/LIPICS.SOCG.2019.31' apa: 'Edelsbrunner, H., Virk, Z., & Wagner, H. (2019). Topological data analysis in information space. In 35th International Symposium on Computational Geometry (Vol. 129, p. 31:1-31:14). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.31' chicago: Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” In 35th International Symposium on Computational Geometry, 129:31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.31. ieee: H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 31:1-31:14. ista: 'Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14.' mla: Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14, doi:10.4230/LIPICS.SOCG.2019.31. short: H. Edelsbrunner, Z. Virk, H. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14. conference: end_date: 2019-06-21 location: Portland, OR, United States name: 'SoCG 2019: Symposium on Computational Geometry' start_date: 2019-06-18 date_created: 2019-07-17T10:36:09Z date_published: 2019-06-01T00:00:00Z date_updated: 2021-01-12T08:08:23Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.4230/LIPICS.SOCG.2019.31 external_id: arxiv: - '1903.08510' file: - access_level: open_access checksum: 8ec8720730d4c789bf7b06540f1c29f4 content_type: application/pdf creator: dernst date_created: 2019-07-24T06:40:01Z date_updated: 2020-07-14T12:47:35Z file_id: '6666' file_name: 2019_LIPICS_Edelsbrunner.pdf file_size: 1355179 relation: main_file file_date_updated: 2020-07-14T12:47:35Z has_accepted_license: '1' intvolume: ' 129' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 31:1-31:14 project: - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: 35th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959771047' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Topological data analysis in information space tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 129 year: '2019' ... --- _id: '6659' abstract: - lang: eng text: Chemical labeling of proteins with synthetic molecular probes offers the possibility to probe the functions of proteins of interest in living cells. However, the methods for covalently labeling targeted proteins using complementary peptide tag-probe pairs are still limited, irrespective of the versatility of such pairs in biological research. Herein, we report the new CysHis tag-Ni(II) probe pair for the specific covalent labeling of proteins. A broad-range evaluation of the reactivity profiles of the probe and the CysHis peptide tag afforded a tag-probe pair with an optimized and high labeling selectivity and reactivity. In particular, the labeling specificity of this pair was notably improved compared to the previously reported one. This pair was successfully utilized for the fluorescence imaging of membrane proteins on the surfaces of living cells, demonstrating its potential utility in biological research. acknowledgement: his work was supported by the Grant-in-Aid for Scientific Research B (JSPS KAKENHI grant no. JP17H03090 to A. O.); the Scientific Research on Innovative Areas “Chemistry for Multimolecular Crowding Biosystems” (JSPS KAKENHI grant no. JP17H06349 to A. O.); and the European Union (European Research Council Advanced grant no. 694539 and Human Brain Project Ref. 720270 to R. S.). A. O. acknowledges the financial support of the Takeda Science Foundation. article_processing_charge: No article_type: original author: - first_name: Naoki full_name: Zenmyo, Naoki last_name: Zenmyo - first_name: Hiroki full_name: Tokumaru, Hiroki last_name: Tokumaru - first_name: Shohei full_name: Uchinomiya, Shohei last_name: Uchinomiya - first_name: Hirokazu full_name: Fuchida, Hirokazu last_name: Fuchida - first_name: Shigekazu full_name: Tabata, Shigekazu id: 4427179E-F248-11E8-B48F-1D18A9856A87 last_name: Tabata - first_name: Itaru full_name: Hamachi, Itaru last_name: Hamachi - first_name: Ryuichi full_name: Shigemoto, Ryuichi id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 - first_name: Akio full_name: Ojida, Akio last_name: Ojida citation: ama: Zenmyo N, Tokumaru H, Uchinomiya S, et al. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 2019;92(5):995-1000. doi:10.1246/bcsj.20190034 apa: Zenmyo, N., Tokumaru, H., Uchinomiya, S., Fuchida, H., Tabata, S., Hamachi, I., … Ojida, A. (2019). Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan. https://doi.org/10.1246/bcsj.20190034 chicago: Zenmyo, Naoki, Hiroki Tokumaru, Shohei Uchinomiya, Hirokazu Fuchida, Shigekazu Tabata, Itaru Hamachi, Ryuichi Shigemoto, and Akio Ojida. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan, 2019. https://doi.org/10.1246/bcsj.20190034. ieee: N. Zenmyo et al., “Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins,” Bulletin of the Chemical Society of Japan, vol. 92, no. 5. Bulletin of the Chemical Society of Japan, pp. 995–1000, 2019. ista: Zenmyo N, Tokumaru H, Uchinomiya S, Fuchida H, Tabata S, Hamachi I, Shigemoto R, Ojida A. 2019. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 92(5), 995–1000. mla: Zenmyo, Naoki, et al. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan, vol. 92, no. 5, Bulletin of the Chemical Society of Japan, 2019, pp. 995–1000, doi:10.1246/bcsj.20190034. short: N. Zenmyo, H. Tokumaru, S. Uchinomiya, H. Fuchida, S. Tabata, I. Hamachi, R. Shigemoto, A. Ojida, Bulletin of the Chemical Society of Japan 92 (2019) 995–1000. date_created: 2019-07-21T21:59:16Z date_published: 2019-05-15T00:00:00Z date_updated: 2021-01-12T08:08:26Z day: '15' ddc: - '570' department: - _id: RySh doi: 10.1246/bcsj.20190034 ec_funded: 1 file: - access_level: open_access checksum: 186de511d6e0ca93f5d981e2443eb8cd content_type: application/pdf creator: dernst date_created: 2020-10-02T08:49:58Z date_updated: 2020-10-02T08:49:58Z file_id: '8594' file_name: 2019_BCSJ_Zenmyo.pdf file_size: 2464903 relation: main_file success: 1 file_date_updated: 2020-10-02T08:49:58Z has_accepted_license: '1' intvolume: ' 92' issue: '5' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 995-1000 project: - _id: 25CA28EA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694539' name: 'In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour' publication: Bulletin of the Chemical Society of Japan publication_identifier: issn: - '00092673' publication_status: published publisher: Bulletin of the Chemical Society of Japan quality_controlled: '1' scopus_import: '1' status: public title: Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 92 year: '2019' ... --- _id: '6662' abstract: - lang: eng text: "In phase retrieval, we want to recover an unknown signal \U0001D465∈ℂ\U0001D451 from n quadratic measurements of the form \U0001D466\U0001D456=|⟨\U0001D44E\U0001D456,\U0001D465⟩|2+\U0001D464\U0001D456, where \U0001D44E\U0001D456∈ℂ\U0001D451 are known sensing vectors and \U0001D464\U0001D456 is measurement noise. We ask the following weak recovery question: What is the minimum number of measurements n needed to produce an estimator \U0001D465^(\U0001D466) that is positively correlated with the signal \U0001D465? We consider the case of Gaussian vectors \U0001D44E\U0001D44E\U0001D456. We prove that—in the high-dimensional limit—a sharp phase transition takes place, and we locate the threshold in the regime of vanishingly small noise. For \U0001D45B≤\U0001D451−\U0001D45C(\U0001D451), no estimator can do significantly better than random and achieve a strictly positive correlation. For \U0001D45B≥\U0001D451+\U0001D45C(\U0001D451), a simple spectral estimator achieves a positive correlation. Surprisingly, numerical simulations with the same spectral estimator demonstrate promising performance with realistic sensing matrices. Spectral methods are used to initialize non-convex optimization algorithms in phase retrieval, and our approach can boost the performance in this setting as well. Our impossibility result is based on classical information-theoretic arguments. The spectral algorithm computes the leading eigenvector of a weighted empirical covariance matrix. We obtain a sharp characterization of the spectral properties of this random matrix using tools from free probability and generalizing a recent result by Lu and Li. Both the upper bound and lower bound generalize beyond phase retrieval to measurements \U0001D466\U0001D456 produced according to a generalized linear model. As a by-product of our analysis, we compare the threshold of the proposed spectral method with that of a message passing algorithm." article_type: original author: - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Andrea full_name: Montanari, Andrea last_name: Montanari citation: ama: Mondelli M, Montanari A. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 2019;19(3):703-773. doi:10.1007/s10208-018-9395-y apa: Mondelli, M., & Montanari, A. (2019). Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-018-9395-y chicago: Mondelli, Marco, and Andrea Montanari. “Fundamental Limits of Weak Recovery with Applications to Phase Retrieval.” Foundations of Computational Mathematics. Springer, 2019. https://doi.org/10.1007/s10208-018-9395-y. ieee: M. Mondelli and A. Montanari, “Fundamental limits of weak recovery with applications to phase retrieval,” Foundations of Computational Mathematics, vol. 19, no. 3. Springer, pp. 703–773, 2019. ista: Mondelli M, Montanari A. 2019. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 19(3), 703–773. mla: Mondelli, Marco, and Andrea Montanari. “Fundamental Limits of Weak Recovery with Applications to Phase Retrieval.” Foundations of Computational Mathematics, vol. 19, no. 3, Springer, 2019, pp. 703–73, doi:10.1007/s10208-018-9395-y. short: M. Mondelli, A. Montanari, Foundations of Computational Mathematics 19 (2019) 703–773. date_created: 2019-07-22T13:23:48Z date_published: 2019-06-01T00:00:00Z date_updated: 2021-01-12T08:08:28Z day: '01' doi: 10.1007/s10208-018-9395-y extern: '1' external_id: arxiv: - '1708.05932' intvolume: ' 19' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1708.05932 month: '06' oa: 1 oa_version: Preprint page: 703-773 publication: Foundations of Computational Mathematics publication_identifier: eissn: - 1615-3383 publication_status: published publisher: Springer quality_controlled: '1' status: public title: Fundamental limits of weak recovery with applications to phase retrieval type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 19 year: '2019' ... --- _id: '6672' abstract: - lang: eng text: The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult problem in a practical way, we introduce the discrete Riemannian Voronoi diagram, a discrete structure that approximates the Riemannian Voronoi diagram. This structure has been implemented and was shown to lead to good triangulations in $\mathbb{R}^2$ and on surfaces embedded in $\mathbb{R}^3$ as detailed in our experimental companion paper. In this paper, we study theoretical aspects of our structure. Given a finite set of points $\mathcal{P}$ in a domain $\Omega$ equipped with a Riemannian metric, we compare the discrete Riemannian Voronoi diagram of $\mathcal{P}$ to its Riemannian Voronoi diagram. Both diagrams have dual structures called the discrete Riemannian Delaunay and the Riemannian Delaunay complex. We provide conditions that guarantee that these dual structures are identical. It then follows from previous results that the discrete Riemannian Delaunay complex can be embedded in $\Omega$ under sufficient conditions, leading to an anisotropic triangulation with curved simplices. Furthermore, we show that, under similar conditions, the simplices of this triangulation can be straightened. author: - first_name: Jean-Daniel full_name: Boissonnat, Jean-Daniel last_name: Boissonnat - first_name: Mael full_name: Rouxel-Labbé, Mael last_name: Rouxel-Labbé - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: Boissonnat J-D, Rouxel-Labbé M, Wintraecken M. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. 2019;48(3):1046-1097. doi:10.1137/17m1152292 apa: Boissonnat, J.-D., Rouxel-Labbé, M., & Wintraecken, M. (2019). Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM). https://doi.org/10.1137/17m1152292 chicago: Boissonnat, Jean-Daniel, Mael Rouxel-Labbé, and Mathijs Wintraecken. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM), 2019. https://doi.org/10.1137/17m1152292. ieee: J.-D. Boissonnat, M. Rouxel-Labbé, and M. Wintraecken, “Anisotropic triangulations via discrete Riemannian Voronoi diagrams,” SIAM Journal on Computing, vol. 48, no. 3. Society for Industrial & Applied Mathematics (SIAM), pp. 1046–1097, 2019. ista: Boissonnat J-D, Rouxel-Labbé M, Wintraecken M. 2019. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. 48(3), 1046–1097. mla: Boissonnat, Jean-Daniel, et al. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.” SIAM Journal on Computing, vol. 48, no. 3, Society for Industrial & Applied Mathematics (SIAM), 2019, pp. 1046–97, doi:10.1137/17m1152292. short: J.-D. Boissonnat, M. Rouxel-Labbé, M. Wintraecken, SIAM Journal on Computing 48 (2019) 1046–1097. date_created: 2019-07-24T08:42:12Z date_published: 2019-05-21T00:00:00Z date_updated: 2021-01-12T08:08:30Z day: '21' doi: 10.1137/17m1152292 extern: '1' external_id: arxiv: - '1703.06487' intvolume: ' 48' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1703.06487 month: '05' oa: 1 oa_version: Preprint page: 1046-1097 publication: SIAM Journal on Computing publication_identifier: eissn: - 1095-7111 issn: - 0097-5397 publication_status: published publisher: Society for Industrial & Applied Mathematics (SIAM) quality_controlled: '1' status: public title: Anisotropic triangulations via discrete Riemannian Voronoi diagrams type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 48 year: '2019' ... --- _id: '6725' abstract: - lang: eng text: "A Valued Constraint Satisfaction Problem (VCSP) provides a common framework that can express a wide range of discrete optimization problems. A VCSP instance is given by a finite set of variables, a finite domain of labels, and an objective function to be minimized. This function is represented as a sum of terms where each term depends on a subset of the variables. To obtain different classes of optimization problems, one can restrict all terms to come from a fixed set Γ of cost functions, called a language. \r\nRecent breakthrough results have established a complete complexity classification of such classes with respect to language Γ: if all cost functions in Γ satisfy a certain algebraic condition then all Γ-instances can be solved in polynomial time, otherwise the problem is NP-hard. Unfortunately, testing this condition for a given language Γ is known to be NP-hard. We thus study exponential algorithms for this meta-problem. We show that the tractability condition of a finite-valued language Γ can be tested in O(3‾√3|D|⋅poly(size(Γ))) time, where D is the domain of Γ and poly(⋅) is some fixed polynomial. We also obtain a matching lower bound under the Strong Exponential Time Hypothesis (SETH). More precisely, we prove that for any constant δ<1 there is no O(3‾√3δ|D|) algorithm, assuming that SETH holds." alternative_title: - LIPIcs author: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov citation: ama: 'Kolmogorov V. Testing the complexity of a valued CSP language. In: 46th International Colloquium on Automata, Languages and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:77:1-77:12. doi:10.4230/LIPICS.ICALP.2019.77' apa: 'Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In 46th International Colloquium on Automata, Languages and Programming (Vol. 132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.77' chicago: Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” In 46th International Colloquium on Automata, Languages and Programming, 132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.77. ieee: V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 77:1-77:12. ista: 'Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming. ICALP 2019: International Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.' mla: Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77. short: V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12. conference: end_date: 2019-07-12 location: Patras, Greece name: 'ICALP 2019: International Colloquim on Automata, Languages and Programming' start_date: 2019-07-08 date_created: 2019-07-29T12:23:29Z date_published: 2019-07-01T00:00:00Z date_updated: 2021-01-12T08:08:40Z day: '01' ddc: - '000' department: - _id: VlKo doi: 10.4230/LIPICS.ICALP.2019.77 ec_funded: 1 external_id: arxiv: - '1803.02289' file: - access_level: open_access checksum: f5ebee8eec6ae09e30365578ee63a492 content_type: application/pdf creator: dernst date_created: 2019-07-31T07:01:45Z date_updated: 2020-07-14T12:47:38Z file_id: '6738' file_name: 2019_LIPICS_Kolmogorov.pdf file_size: 575475 relation: main_file file_date_updated: 2020-07-14T12:47:38Z has_accepted_license: '1' intvolume: ' 132' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 77:1-77:12 project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication: 46th International Colloquium on Automata, Languages and Programming publication_identifier: isbn: - 978-3-95977-109-2 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Testing the complexity of a valued CSP language tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 132 year: '2019' ... --- _id: '6726' abstract: - lang: eng text: Randomness is an essential part of any secure cryptosystem, but many constructions rely on distributions that are not uniform. This is particularly true for lattice based cryptosystems, which more often than not make use of discrete Gaussian distributions over the integers. For practical purposes it is crucial to evaluate the impact that approximation errors have on the security of a scheme to provide the best possible trade-off between security and performance. Recent years have seen surprising results allowing to use relatively low precision while maintaining high levels of security. A key insight in these results is that sampling a distribution with low relative error can provide very strong security guarantees. Since floating point numbers provide guarantees on the relative approximation error, they seem a suitable tool in this setting, but it is not obvious which sampling algorithms can actually profit from them. While previous works have shown that inversion sampling can be adapted to provide a low relative error (Pöppelmann et al., CHES 2014; Prest, ASIACRYPT 2017), other works have called into question if this is possible for other sampling techniques (Zheng et al., Eprint report 2018/309). In this work, we consider all sampling algorithms that are popular in the cryptographic setting and analyze the relationship of floating point precision and the resulting relative error. We show that all of the algorithms either natively achieve a low relative error or can be adapted to do so. article_processing_charge: No author: - first_name: Michael full_name: Walter, Michael id: 488F98B0-F248-11E8-B48F-1D18A9856A87 last_name: Walter orcid: 0000-0003-3186-2482 citation: ama: 'Walter M. Sampling the integers with low relative error. In: Buchmann J, Nitaj A, Rachidi T, eds. Progress in Cryptology – AFRICACRYPT 2019. Vol 11627. LNCS. Cham: Springer Nature; 2019:157-180. doi:10.1007/978-3-030-23696-0_9' apa: 'Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann, A. Nitaj, & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019 (Vol. 11627, pp. 157–180). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-23696-0_9' chicago: 'Walter, Michael. “Sampling the Integers with Low Relative Error.” In Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann, A Nitaj, and T Rachidi, 11627:157–80. LNCS. Cham: Springer Nature, 2019. https://doi.org/10.1007/978-3-030-23696-0_9.' ieee: 'M. Walter, “Sampling the integers with low relative error,” in Progress in Cryptology – AFRICACRYPT 2019, vol. 11627, J. Buchmann, A. Nitaj, and T. Rachidi, Eds. Cham: Springer Nature, 2019, pp. 157–180.' ista: 'Walter M. 2019.Sampling the integers with low relative error. In: Progress in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.' mla: Walter, Michael. “Sampling the Integers with Low Relative Error.” Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann et al., vol. 11627, Springer Nature, 2019, pp. 157–80, doi:10.1007/978-3-030-23696-0_9. short: M. Walter, in:, J. Buchmann, A. Nitaj, T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019, Springer Nature, Cham, 2019, pp. 157–180. conference: end_date: 2019-07-11 location: Rabat, Morocco name: 'AFRICACRYPT: International Conference on Cryptology in Africa' start_date: 2019-07-09 date_created: 2019-07-29T12:25:31Z date_published: 2019-06-29T00:00:00Z date_updated: 2023-02-23T12:50:15Z day: '29' department: - _id: KrPi doi: 10.1007/978-3-030-23696-0_9 ec_funded: 1 editor: - first_name: J full_name: Buchmann, J last_name: Buchmann - first_name: A full_name: Nitaj, A last_name: Nitaj - first_name: T full_name: Rachidi, T last_name: Rachidi intvolume: ' 11627' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2019/068 month: '06' oa: 1 oa_version: Preprint page: 157-180 place: Cham project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: Progress in Cryptology – AFRICACRYPT 2019 publication_identifier: eisbn: - 978-3-0302-3696-0 isbn: - 978-3-0302-3695-3 issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' series_title: LNCS status: public title: Sampling the integers with low relative error type: book_chapter user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 11627 year: '2019' ... --- _id: '6663' abstract: - lang: eng text: Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, we know from two independent works by Schürch and by Bardet et al. that the synthetic channels are partially ordered with respect to degradation. Hence, it is natural to ask whether the partial order can be exploited to reduce the computational burden of the construction problem. We show that, if we take advantage of the partial order, we can construct a polar code by computing the reliability of roughly a fraction 1/ log 3/2 N of the synthetic channels. In particular, we prove that N/ log 3/2 N is a lower bound on the number of synthetic channels to be considered and such a bound is tight up to a multiplicative factor log log N. This set of roughly N/ log 3/2 N synthetic channels is universal, in the sense that it allows one to construct polar codes for any W, and it can be identified by solving a maximum matching problem on a bipartite graph. Our proof technique consists of reducing the construction problem to the problem of computing the maximum cardinality of an antichain for a suitable partially ordered set. As such, this method is general, and it can be used to further improve the complexity of the construction problem, in case a refined partial order on the synthetic channels of polar codes is discovered. author: - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Hamed full_name: Hassani, Hamed last_name: Hassani - first_name: Rudiger full_name: Urbanke, Rudiger last_name: Urbanke citation: ama: Mondelli M, Hassani H, Urbanke R. Construction of polar codes with sublinear complexity. IEEE. 2019;65(5):2782-2791. doi:10.1109/tit.2018.2889667 apa: Mondelli, M., Hassani, H., & Urbanke, R. (2019). Construction of polar codes with sublinear complexity. IEEE. IEEE. https://doi.org/10.1109/tit.2018.2889667 chicago: Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “Construction of Polar Codes with Sublinear Complexity.” IEEE. IEEE, 2019. https://doi.org/10.1109/tit.2018.2889667. ieee: M. Mondelli, H. Hassani, and R. Urbanke, “Construction of polar codes with sublinear complexity,” IEEE, vol. 65, no. 5. IEEE, pp. 2782–2791, 2019. ista: Mondelli M, Hassani H, Urbanke R. 2019. Construction of polar codes with sublinear complexity. IEEE. 65(5), 2782–2791. mla: Mondelli, Marco, et al. “Construction of Polar Codes with Sublinear Complexity.” IEEE, vol. 65, no. 5, IEEE, 2019, pp. 2782–91, doi:10.1109/tit.2018.2889667. short: M. Mondelli, H. Hassani, R. Urbanke, IEEE 65 (2019) 2782–2791. date_created: 2019-07-23T07:32:57Z date_published: 2019-05-01T00:00:00Z date_updated: 2023-02-23T12:50:20Z day: '01' doi: 10.1109/tit.2018.2889667 extern: '1' external_id: arxiv: - '1612.05295' intvolume: ' 65' issue: '5' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1612.05295 month: '05' oa: 1 oa_version: Preprint page: 2782-2791 publication: IEEE publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '6729' relation: earlier_version status: public status: public title: Construction of polar codes with sublinear complexity type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 65 year: '2019' ... --- _id: '6747' abstract: - lang: eng text: "We establish connections between the problem of learning a two-layer neural network and tensor decomposition. We consider a model with feature vectors x∈ℝd, r hidden units with weights {wi}1≤i≤r and output y∈ℝ, i.e., y=∑ri=1σ(w\U0001D5B3ix), with activation functions given by low-degree polynomials. In particular, if σ(x)=a0+a1x+a3x3, we prove that no polynomial-time learning algorithm can outperform the trivial predictor that assigns to each example the response variable \U0001D53C(y), when d3/2≪r≪d2. Our conclusion holds for a `natural data distribution', namely standard Gaussian feature vectors x, and output distributed according to a two-layer neural network with random isotropic weights, and under a certain complexity-theoretic assumption on tensor decomposition. Roughly speaking, we assume that no polynomial-time algorithm can substantially outperform current methods for tensor decomposition based on the sum-of-squares hierarchy. We also prove generalizations of this statement for higher degree polynomial activations, and non-random weight vectors. Remarkably, several existing algorithms for learning two-layer networks with rigorous guarantees are based on tensor decomposition. Our results support the idea that this is indeed the core computational difficulty in learning such networks, under the stated generative model for the data. As a side result, we show that under this model learning the network requires accurate learning of its weights, a property that does not hold in a more general setting. " article_processing_charge: No author: - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Andrea full_name: Montanari, Andrea last_name: Montanari citation: ama: 'Mondelli M, Montanari A. On the connection between learning two-layers neural networks and tensor  decomposition. In: Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics. Vol 89. Proceedings of Machine Learning Research; 2019:1051-1060.' apa: 'Mondelli, M., & Montanari, A. (2019). On the connection between learning two-layers neural networks and tensor  decomposition. In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics (Vol. 89, pp. 1051–1060). Naha, Okinawa, Japan: Proceedings of Machine Learning Research.' chicago: Mondelli, Marco, and Andrea Montanari. “On the Connection between Learning Two-Layers Neural Networks and Tensor  Decomposition.” In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 89:1051–60. Proceedings of Machine Learning Research, 2019. ieee: M. Mondelli and A. Montanari, “On the connection between learning two-layers neural networks and tensor  decomposition,” in Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, Naha, Okinawa, Japan, 2019, vol. 89, pp. 1051–1060. ista: 'Mondelli M, Montanari A. 2019. On the connection between learning two-layers neural networks and tensor  decomposition. Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics. AISTATS: Artificial Intelligence and Statistics vol. 89, 1051–1060.' mla: Mondelli, Marco, and Andrea Montanari. “On the Connection between Learning Two-Layers Neural Networks and Tensor  Decomposition.” Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, vol. 89, Proceedings of Machine Learning Research, 2019, pp. 1051–60. short: M. Mondelli, A. Montanari, in:, Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, 2019, pp. 1051–1060. conference: end_date: 2019-04-18 location: Naha, Okinawa, Japan name: 'AISTATS: Artificial Intelligence and Statistics' start_date: 2019-04-16 date_created: 2019-07-31T09:31:26Z date_published: 2019-04-01T00:00:00Z date_updated: 2021-01-12T08:08:49Z day: '01' extern: '1' external_id: arxiv: - '1802.07301' intvolume: ' 89' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1802.07301 month: '04' oa: 1 oa_version: Preprint page: 1051-1060 publication: Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics publication_status: published publisher: Proceedings of Machine Learning Research quality_controlled: '1' status: public title: On the connection between learning two-layers neural networks and tensor decomposition type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 89 year: '2019' ... --- _id: '6750' abstract: - lang: eng text: 'Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC list (SCL) and SC flip (SCF), provide a reasonable error performance for polar codes at the cost of low decoding speed. Fast SC-based decoders, such as Fast-SSC, Fast-SSCL, and Fast-SSCF, identify the special constituent codes in a polar code graph off-line, produce a list of operations, store the list in memory, and feed the list to the decoder to decode the constituent codes in order efficiently, thus increasing the decoding speed. However, the list of operations is dependent on the code rate and as the rate changes, a new list is produced, making fast SC-based decoders not rate-flexible. In this paper, we propose a completely rate-flexible fast SC-based decoder by creating the list of operations directly in hardware, with low implementation complexity. We further propose a hardware architecture implementing the proposed method and show that the area occupation of the rate-flexible fast SC-based decoder in this paper is only 38% of the total area of the memory-based base-line decoder when 5G code rates are supported. ' article_number: '8854897' article_processing_charge: No article_type: original author: - first_name: Seyyed Ali full_name: Hashemi, Seyyed Ali last_name: Hashemi - first_name: Carlo full_name: Condo, Carlo last_name: Condo - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Warren J full_name: Gross, Warren J last_name: Gross citation: ama: Hashemi SA, Condo C, Mondelli M, Gross WJ. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 2019;67(22). doi:10.1109/TSP.2019.2944738 apa: Hashemi, S. A., Condo, C., Mondelli, M., & Gross, W. J. (2019). Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. IEEE. https://doi.org/10.1109/TSP.2019.2944738 chicago: Hashemi, Seyyed Ali, Carlo Condo, Marco Mondelli, and Warren J Gross. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing. IEEE, 2019. https://doi.org/10.1109/TSP.2019.2944738. ieee: S. A. Hashemi, C. Condo, M. Mondelli, and W. J. Gross, “Rate-flexible fast polar decoders,” IEEE Transactions on Signal Processing, vol. 67, no. 22. IEEE, 2019. ista: Hashemi SA, Condo C, Mondelli M, Gross WJ. 2019. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 67(22), 8854897. mla: Hashemi, Seyyed Ali, et al. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing, vol. 67, no. 22, 8854897, IEEE, 2019, doi:10.1109/TSP.2019.2944738. short: S.A. Hashemi, C. Condo, M. Mondelli, W.J. Gross, IEEE Transactions on Signal Processing 67 (2019). date_created: 2019-07-31T09:51:14Z date_published: 2019-11-15T00:00:00Z date_updated: 2021-01-12T08:08:51Z day: '15' department: - _id: MaMo doi: 10.1109/TSP.2019.2944738 external_id: arxiv: - '1903.09203' intvolume: ' 67' issue: '22' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1903.09203 month: '11' oa: 1 oa_version: Preprint publication: IEEE Transactions on Signal Processing publication_identifier: issn: - 1053587X publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: 1 status: public title: Rate-flexible fast polar decoders type: journal_article user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 67 year: '2019' ... --- _id: '6759' abstract: - lang: eng text: "We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove that Grounded-L graphs admit an equivalent characterisation in terms of vertex ordering with forbidden patterns. \r\nWe also compare this class to related intersection classes, such as the grounded segment graphs, the monotone L-graphs (a.k.a. max point-tolerance graphs), or the outer-1-string graphs. We give constructions showing that these classes are all distinct and satisfy only trivial or previously known inclusions." article_number: P3.17 article_processing_charge: No article_type: original author: - first_name: Vít full_name: Jelínek, Vít last_name: Jelínek - first_name: Martin full_name: Töpfer, Martin id: 4B865388-F248-11E8-B48F-1D18A9856A87 last_name: Töpfer citation: ama: Jelínek V, Töpfer M. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 2019;26(3). doi:10.37236/8096 apa: Jelínek, V., & Töpfer, M. (2019). On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/8096 chicago: Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2019. https://doi.org/10.37236/8096. ieee: V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019. ista: Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17. mla: Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics, vol. 26, no. 3, P3.17, Electronic Journal of Combinatorics, 2019, doi:10.37236/8096. short: V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019). date_created: 2019-08-04T21:59:20Z date_published: 2019-07-19T00:00:00Z date_updated: 2022-03-18T12:32:02Z day: '19' ddc: - '510' department: - _id: DaAl doi: 10.37236/8096 ec_funded: 1 external_id: arxiv: - '1808.04148' file: - access_level: open_access checksum: 20fc366fc6683ef0b074a019b73a663a content_type: application/pdf creator: dernst date_created: 2019-08-05T06:46:55Z date_updated: 2020-07-14T12:47:39Z file_id: '6764' file_name: 2019_eJourCombinatorics_Jelinek.pdf file_size: 533697 relation: main_file file_date_updated: 2020-07-14T12:47:39Z has_accepted_license: '1' intvolume: ' 26' issue: '3' language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: Electronic Journal of Combinatorics publication_identifier: eissn: - '10778926' publication_status: published publisher: Electronic Journal of Combinatorics quality_controlled: '1' scopus_import: '1' status: public title: On grounded L-graphs and their relatives tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 26 year: '2019' ... --- _id: '6822' abstract: - lang: eng text: "In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher\r\nbidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called \r\n randomturn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and meanpayoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one." alternative_title: - LNCS author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - 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: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Petr full_name: Novotny, Petr last_name: Novotny citation: ama: 'Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision processes. In: Proceedings of the 13th International Conference of Reachability Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1' apa: 'Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding games on Markov decision processes. In Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer. https://doi.org/10.1007/978-3-030-30806-3_1' chicago: Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1. ieee: G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12. ista: 'Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.' mla: Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1. short: G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12. conference: end_date: 2019-09-13 location: Brussels, Belgium name: 'RP: Reachability Problems' start_date: 2019-09-11 date_created: 2019-08-19T07:58:10Z date_published: 2019-09-06T00:00:00Z date_updated: 2021-01-12T08:09:12Z day: '06' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-030-30806-3_1 file: - access_level: open_access checksum: 45ebbc709af2b247d28c7c293c01504b content_type: application/pdf creator: gavni date_created: 2019-08-19T07:56:40Z date_updated: 2020-07-14T12:47:41Z file_id: '6823' file_name: prob.pdf file_size: 436635 relation: main_file file_date_updated: 2020-07-14T12:47:41Z has_accepted_license: '1' intvolume: ' 11674' language: - iso: eng month: '09' oa: 1 oa_version: Submitted Version page: 1-12 project: - _id: 264B3912-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02369 name: Formal Methods meets Algorithmic Game Theory - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: ' Proceedings of the 13th International Conference of Reachability Problems' publication_identifier: isbn: - 978-303030805-6 issn: - 0302-9743 publication_status: published publisher: Springer quality_controlled: '1' scopus_import: 1 status: public title: Bidding games on Markov decision processes type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11674 year: '2019' ... --- _id: '6887' abstract: - lang: eng text: 'The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. ' alternative_title: - LIPIcs article_number: '7' 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: Wolfgang full_name: Dvorák, Wolfgang last_name: Dvorák - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Svozil, Alexander last_name: Svozil citation: ama: 'Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.7' apa: 'Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7' chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7. ieee: K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140. ista: 'Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7.' mla: Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” Leibniz International Proceedings in Informatics, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7. short: K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-08-30 location: Amsterdam, Netherlands name: 'CONCUR: International Conference on Concurrency Theory' start_date: 2019-08-27 date_created: 2019-09-18T08:07:58Z date_published: 2019-08-01T00:00:00Z date_updated: 2022-08-12T10:54:34Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPICS.CONCUR.2019.7 ec_funded: 1 file: - access_level: open_access checksum: e1f0e4061212454574f34a1368d018ec content_type: application/pdf creator: kschuh date_created: 2019-10-01T08:20:30Z date_updated: 2020-07-14T12:47:43Z file_id: '6922' file_name: 2019_LIPIcs_Chatterjee.pdf file_size: 730112 relation: main_file file_date_updated: 2020-07-14T12:47:43Z has_accepted_license: '1' intvolume: ' 140' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _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' publication: Leibniz International Proceedings in Informatics publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Near-linear time algorithms for Streett objectives in graphs and MDPs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf volume: 140 year: '2019' ... --- _id: '6888' abstract: - lang: eng text: In this paper, we design novel liquid time-constant recurrent neural networks for robotic control, inspired by the brain of the nematode, C. elegans. In the worm's nervous system, neurons communicate through nonlinear time-varying synaptic links established amongst them by their particular wiring structure. This property enables neurons to express liquid time-constants dynamics and therefore allows the network to originate complex behaviors with a small number of neurons. We identify neuron-pair communication motifs as design operators and use them to configure compact neuronal network structures to govern sequential robotic tasks. The networks are systematically designed to map the environmental observations to motor actions, by their hierarchical topology from sensory neurons, through recurrently-wired interneurons, to motor neurons. The networks are then parametrized in a supervised-learning scheme by a search-based algorithm. We demonstrate that obtained networks realize interpretable dynamics. We evaluate their performance in controlling mobile and arm robots, and compare their attributes to other artificial neural network-based control agents. Finally, we experimentally show their superior resilience to environmental noise, compared to the existing machine learning-based methods. alternative_title: - ICRA article_number: '8793840' article_processing_charge: No author: - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner - first_name: Ramin full_name: Hasani, Ramin last_name: Hasani - first_name: Manuel full_name: Zimmer, Manuel last_name: Zimmer - 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: Radu full_name: Grosu, Radu last_name: Grosu citation: ama: 'Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. Designing worm-inspired neural networks for interpretable robotic control. In: Proceedings - IEEE International Conference on Robotics and Automation. Vol 2019-May. IEEE; 2019. doi:10.1109/icra.2019.8793840' apa: 'Lechner, M., Hasani, R., Zimmer, M., Henzinger, T. A., & Grosu, R. (2019). Designing worm-inspired neural networks for interpretable robotic control. In Proceedings - IEEE International Conference on Robotics and Automation (Vol. 2019–May). Montreal, QC, Canada: IEEE. https://doi.org/10.1109/icra.2019.8793840' chicago: Lechner, Mathias, Ramin Hasani, Manuel Zimmer, Thomas A Henzinger, and Radu Grosu. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” In Proceedings - IEEE International Conference on Robotics and Automation, Vol. 2019–May. IEEE, 2019. https://doi.org/10.1109/icra.2019.8793840. ieee: M. Lechner, R. Hasani, M. Zimmer, T. A. Henzinger, and R. Grosu, “Designing worm-inspired neural networks for interpretable robotic control,” in Proceedings - IEEE International Conference on Robotics and Automation, Montreal, QC, Canada, 2019, vol. 2019–May. ista: 'Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. 2019. Designing worm-inspired neural networks for interpretable robotic control. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, vol. 2019–May, 8793840.' mla: Lechner, Mathias, et al. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” Proceedings - IEEE International Conference on Robotics and Automation, vol. 2019–May, 8793840, IEEE, 2019, doi:10.1109/icra.2019.8793840. short: M. Lechner, R. Hasani, M. Zimmer, T.A. Henzinger, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2019. conference: end_date: 2019-05-24 location: Montreal, QC, Canada name: 'ICRA: International Conference on Robotics and Automation' start_date: 2019-05-20 date_created: 2019-09-18T08:09:51Z date_published: 2019-05-01T00:00:00Z date_updated: 2021-01-12T08:09:28Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1109/icra.2019.8793840 file: - access_level: open_access checksum: f5545a6b60c3ffd01feb3613f81d03b6 content_type: application/pdf creator: dernst date_created: 2020-10-08T17:30:38Z date_updated: 2020-10-08T17:30:38Z file_id: '8636' file_name: 2019_ICRA_Lechner.pdf file_size: 3265107 relation: main_file success: 1 file_date_updated: 2020-10-08T17:30:38Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Submitted Version project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: Proceedings - IEEE International Conference on Robotics and Automation publication_identifier: isbn: - '9781538660270' publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: Designing worm-inspired neural networks for interpretable robotic control type: conference user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 2019-May year: '2019' ... --- _id: '6886' abstract: - lang: eng text: 'In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets. ' alternative_title: - LIPIcs article_number: '20' article_processing_charge: No author: - first_name: Milad full_name: Aghajohari, Milad last_name: Aghajohari - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 citation: ama: 'Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.20' apa: 'Aghajohari, M., Avni, G., & Henzinger, T. A. (2019). Determinacy in discrete-bidding infinite-duration games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.20' chicago: Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.20. ieee: 'M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.' ista: 'Aghajohari M, Avni G, Henzinger TA. 2019. Determinacy in discrete-bidding infinite-duration games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 20.' mla: Aghajohari, Milad, et al. Determinacy in Discrete-Bidding Infinite-Duration Games. Vol. 140, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.20. short: M. Aghajohari, G. Avni, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-08-30 location: Amsterdam, Netherlands name: 'CONCUR: International Conference on Concurrency Theory' start_date: 2019-08-27 date_created: 2019-09-18T08:06:58Z date_published: 2019-08-01T00:00:00Z date_updated: 2022-01-26T08:27:10Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.4230/LIPICS.CONCUR.2019.20 external_id: arxiv: - '1905.03588' file: - access_level: open_access checksum: 4df6d3575c506edb17215adada03cc8e content_type: application/pdf creator: kschuh date_created: 2019-09-27T12:21:38Z date_updated: 2020-07-14T12:47:43Z file_id: '6915' file_name: 2019_LIPIcs_Aghajohari.pdf file_size: 741425 relation: main_file file_date_updated: 2020-07-14T12:47:43Z has_accepted_license: '1' intvolume: ' 140' language: - iso: eng license: https://creativecommons.org/licenses/by/3.0/ month: '08' oa: 1 oa_version: Published Version project: - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 264B3912-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02369 name: Formal Methods meets Algorithmic Game Theory publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Determinacy in discrete-bidding infinite-duration games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode name: Creative Commons Attribution 3.0 Unported (CC BY 3.0) short: CC BY (3.0) type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 140 year: '2019' ... --- _id: '6885' abstract: - lang: eng text: 'A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. ' alternative_title: - LIPIcs article_number: '27' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - 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: Jan full_name: Otop, Jan last_name: Otop citation: ama: 'Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.27' apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27' chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27. ieee: 'K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.' ista: 'Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27.' mla: Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27. short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-08-30 location: Amsterdam, Netherlands name: 'CONCUR: International Conference on Concurrency Theory' start_date: 2019-08-27 date_created: 2019-09-18T08:06:14Z date_published: 2019-08-01T00:00:00Z date_updated: 2021-01-12T08:09:27Z day: '01' ddc: - '000' department: - _id: ToHe - _id: KrCh doi: 10.4230/LIPICS.CONCUR.2019.27 file: - access_level: open_access checksum: 4985e26e1572d1575d64d38acabd71d6 content_type: application/pdf creator: kschuh date_created: 2019-09-27T12:09:35Z date_updated: 2020-07-14T12:47:43Z file_id: '6914' file_name: 2019_LIPIcs_Chatterjee.pdf file_size: 538120 relation: main_file file_date_updated: 2020-07-14T12:47:43Z has_accepted_license: '1' intvolume: ' 140' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Long-run average behavior of vector addition systems with states tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 140 year: '2019' ... --- _id: '6889' abstract: - lang: eng text: 'We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. ' alternative_title: - LIPIcs article_number: '6' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Nir full_name: Piterman, Nir last_name: Piterman citation: ama: 'Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.6' apa: 'Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6' chicago: Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6. ieee: 'K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.' ista: 'Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.' mla: Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6. short: K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-08-30 location: Amsterdam, Netherlands name: 'CONCUR: International Conference on Concurrency Theory' start_date: 2019-08-27 date_created: 2019-09-18T08:11:43Z date_published: 2019-08-01T00:00:00Z date_updated: 2021-01-12T08:09:28Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPICS.CONCUR.2019.6 file: - access_level: open_access checksum: 7b2ecfd4d9d02360308c0ca986fc10a7 content_type: application/pdf creator: kschuh date_created: 2019-10-01T08:49:45Z date_updated: 2020-07-14T12:47:43Z file_id: '6923' file_name: 2019_LIPIcs_Chatterjee.pdf file_size: 509163 relation: main_file file_date_updated: 2020-07-14T12:47:43Z has_accepted_license: '1' intvolume: ' 140' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Combinations of Qualitative Winning for Stochastic Parity Games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 140 year: '2019' ... --- _id: '6931' abstract: - lang: eng text: "Consider a distributed system with n processors out of which f can be Byzantine faulty. In the\r\napproximate agreement task, each processor i receives an input value xi and has to decide on an\r\noutput value yi such that\r\n1. the output values are in the convex hull of the non-faulty processors’ input values,\r\n2. the output values are within distance d of each other.\r\n\r\n\r\nClassically, the values are assumed to be from an m-dimensional Euclidean space, where m ≥ 1.\r\nIn this work, we study the task in a discrete setting, where input values with some structure\r\nexpressible as a graph. Namely, the input values are vertices of a finite graph G and the goal is to\r\noutput vertices that are within distance d of each other in G, but still remain in the graph-induced\r\nconvex hull of the input values. For d = 0, the task reduces to consensus and cannot be solved with\r\na deterministic algorithm in an asynchronous system even with a single crash fault. For any d ≥ 1,\r\nwe show that the task is solvable in asynchronous systems when G is chordal and n > (ω + 1)f,\r\nwhere ω is the clique number of G. In addition, we give the first Byzantine-tolerant algorithm for a\r\nvariant of lattice agreement. For synchronous systems, we show tight resilience bounds for the exact\r\nvariants of these and related tasks over a large class of combinatorial structures." alternative_title: - LIPIcs article_processing_charge: No author: - first_name: Thomas full_name: Nowak, Thomas last_name: Nowak - first_name: Joel full_name: Rybicki, Joel id: 334EFD2E-F248-11E8-B48F-1D18A9856A87 last_name: Rybicki orcid: 0000-0002-6432-6646 citation: ama: 'Nowak T, Rybicki J. Byzantine approximate agreement on graphs. In: 33rd International Symposium on Distributed Computing. Vol 146. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:29:1--29:17. doi:10.4230/LIPICS.DISC.2019.29' apa: 'Nowak, T., & Rybicki, J. (2019). Byzantine approximate agreement on graphs. In 33rd International Symposium on Distributed Computing (Vol. 146, p. 29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.DISC.2019.29' chicago: Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” In 33rd International Symposium on Distributed Computing, 146:29:1--29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.DISC.2019.29. ieee: T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17. ista: 'Nowak T, Rybicki J. 2019. Byzantine approximate agreement on graphs. 33rd International Symposium on Distributed Computing. DISC: International Symposium on Distributed Computing, LIPIcs, vol. 146, 29:1--29:17.' mla: Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” 33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29. short: T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17. conference: end_date: 2019-10-18 location: Budapest, Hungary name: 'DISC: International Symposium on Distributed Computing' start_date: 2019-10-14 date_created: 2019-10-08T12:41:38Z date_published: 2019-01-01T00:00:00Z date_updated: 2021-01-12T08:09:38Z ddc: - '004' department: - _id: DaAl doi: 10.4230/LIPICS.DISC.2019.29 ec_funded: 1 external_id: arxiv: - '1908.02743' file: - access_level: open_access checksum: 2d2202f90c6ac991e50876451627c4b5 content_type: application/pdf creator: jrybicki date_created: 2019-10-08T12:47:19Z date_updated: 2020-07-14T12:47:44Z file_id: '6934' file_name: LIPIcs-DISC-2019-29.pdf file_size: 639378 relation: main_file file_date_updated: 2020-07-14T12:47:44Z has_accepted_license: '1' intvolume: ' 146' keyword: - consensus - approximate agreement - Byzantine faults - chordal graphs - lattice agreement language: - iso: eng oa: 1 oa_version: Published Version page: 29:1--29:17 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 33rd International Symposium on Distributed Computing publication_identifier: eisbn: - 978-3-95977-126-9 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Byzantine approximate agreement on graphs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 146 year: '2019' ... --- _id: '6985' abstract: - lang: eng text: In this paper, we introduce a novel method to interpret recurrent neural networks (RNNs), particularly long short-term memory networks (LSTMs) at the cellular level. We propose a systematic pipeline for interpreting individual hidden state dynamics within the network using response characterization methods. The ranked contribution of individual cells to the network's output is computed by analyzing a set of interpretable metrics of their decoupled step and sinusoidal responses. As a result, our method is able to uniquely identify neurons with insightful dynamics, quantify relationships between dynamical properties and test accuracy through ablation analysis, and interpret the impact of network capacity on a network's dynamical distribution. Finally, we demonstrate the generalizability and scalability of our method by evaluating a series of different benchmark sequential datasets. article_number: '8851954' author: - first_name: Ramin full_name: Hasani, Ramin last_name: Hasani - first_name: Alexander full_name: Amini, Alexander last_name: Amini - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner - first_name: Felix full_name: Naser, Felix last_name: Naser - first_name: Radu full_name: Grosu, Radu last_name: Grosu - first_name: Daniela full_name: Rus, Daniela last_name: Rus citation: ama: 'Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. Response characterization for auditing cell dynamics in long short-term memory networks. In: Proceedings of the International Joint Conference on Neural Networks. IEEE; 2019. doi:10.1109/ijcnn.2019.8851954' apa: 'Hasani, R., Amini, A., Lechner, M., Naser, F., Grosu, R., & Rus, D. (2019). Response characterization for auditing cell dynamics in long short-term memory networks. In Proceedings of the International Joint Conference on Neural Networks. Budapest, Hungary: IEEE. https://doi.org/10.1109/ijcnn.2019.8851954' chicago: Hasani, Ramin, Alexander Amini, Mathias Lechner, Felix Naser, Radu Grosu, and Daniela Rus. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” In Proceedings of the International Joint Conference on Neural Networks. IEEE, 2019. https://doi.org/10.1109/ijcnn.2019.8851954. ieee: R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, and D. Rus, “Response characterization for auditing cell dynamics in long short-term memory networks,” in Proceedings of the International Joint Conference on Neural Networks, Budapest, Hungary, 2019. ista: 'Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. 2019. Response characterization for auditing cell dynamics in long short-term memory networks. Proceedings of the International Joint Conference on Neural Networks. IJCNN: International Joint Conference on Neural Networks, 8851954.' mla: Hasani, Ramin, et al. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” Proceedings of the International Joint Conference on Neural Networks, 8851954, IEEE, 2019, doi:10.1109/ijcnn.2019.8851954. short: R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, D. Rus, in:, Proceedings of the International Joint Conference on Neural Networks, IEEE, 2019. conference: end_date: 2019-07-19 location: Budapest, Hungary name: 'IJCNN: International Joint Conference on Neural Networks' start_date: 2019-07-14 date_created: 2019-11-04T15:59:58Z date_published: 2019-09-30T00:00:00Z date_updated: 2021-01-12T08:11:19Z day: '30' department: - _id: ToHe doi: 10.1109/ijcnn.2019.8851954 external_id: arxiv: - '1809.03864' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1809.03864 month: '09' oa: 1 oa_version: Preprint publication: Proceedings of the International Joint Conference on Neural Networks publication_identifier: isbn: - '9781728119854' publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: 1 status: public title: Response characterization for auditing cell dynamics in long short-term memory networks type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '7007' abstract: - lang: eng text: 'We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding techniques have been introduced for this setting: decode-and-forward and compress-and-forward. In decode-and-forward, the relay completely decodes the message and sends some information to the destination; in compress-and-forward, the relay does not decode, and it sends a compressed version of the received signal to the destination using Wyner–Ziv coding. In this paper, we present a novel coding paradigm that provides an improved achievable rate for the primitive relay channel. The idea is to combine compress-and-forward and decode-and-forward via a chaining construction. We transmit over pairs of blocks: in the first block, we use compress-and-forward; and, in the second block, we use decode-and-forward. More specifically, in the first block, the relay does not decode, it compresses the received signal via Wyner–Ziv, and it sends only part of the compression to the destination. In the second block, the relay completely decodes the message, it sends some information to the destination, and it also sends the remaining part of the compression coming from the first block. By doing so, we are able to strictly outperform both compress-and-forward and decode-and-forward. Note that the proposed coding scheme can be implemented with polar codes. As such, it has the typical attractive properties of polar coding schemes, namely, quasi-linear encoding and decoding complexity, and error probability that decays at super-polynomial speed. As a running example, we take into account the special case of the erasure relay channel, and we provide a comparison between the rates achievable by our proposed scheme and the existing upper and lower bounds.' article_number: '218' article_type: original author: - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: S. Hamed full_name: Hassani, S. Hamed last_name: Hassani - first_name: Rüdiger full_name: Urbanke, Rüdiger last_name: Urbanke citation: ama: Mondelli M, Hassani SH, Urbanke R. A new coding paradigm for the primitive relay channel. Algorithms. 2019;12(10). doi:10.3390/a12100218 apa: Mondelli, M., Hassani, S. H., & Urbanke, R. (2019). A new coding paradigm for the primitive relay channel. Algorithms. MDPI. https://doi.org/10.3390/a12100218 chicago: Mondelli, Marco, S. Hamed Hassani, and Rüdiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms. MDPI, 2019. https://doi.org/10.3390/a12100218. ieee: M. Mondelli, S. H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” Algorithms, vol. 12, no. 10. MDPI, 2019. ista: Mondelli M, Hassani SH, Urbanke R. 2019. A new coding paradigm for the primitive relay channel. Algorithms. 12(10), 218. mla: Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms, vol. 12, no. 10, 218, MDPI, 2019, doi:10.3390/a12100218. short: M. Mondelli, S.H. Hassani, R. Urbanke, Algorithms 12 (2019). date_created: 2019-11-12T14:46:19Z date_published: 2019-10-18T00:00:00Z date_updated: 2023-02-23T12:49:28Z day: '18' ddc: - '510' department: - _id: MaMo doi: 10.3390/a12100218 external_id: arxiv: - '1801.03153' file: - access_level: open_access checksum: 267756d8f9db572f496cd1663c89d59a content_type: application/pdf creator: dernst date_created: 2019-11-12T14:48:45Z date_updated: 2020-07-14T12:47:47Z file_id: '7008' file_name: 2019_Algorithms_Mondelli.pdf file_size: 696791 relation: main_file file_date_updated: 2020-07-14T12:47:47Z has_accepted_license: '1' intvolume: ' 12' issue: '10' language: - iso: eng month: '10' oa: 1 oa_version: Published Version publication: Algorithms publication_identifier: issn: - 1999-4893 publication_status: published publisher: MDPI quality_controlled: '1' related_material: record: - id: '6675' relation: earlier_version status: public scopus_import: 1 status: public title: A new coding paradigm for the primitive relay channel tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12 year: '2019' ... --- _id: '7035' abstract: - lang: eng text: 'The aim of this short note is to expound one particular issue that was discussed during the talk [10] given at the symposium ”Researches on isometries as preserver problems and related topics” at Kyoto RIMS. That is, the role of Dirac masses by describing the isometry group of various metric spaces of probability measures. This article is of survey character, and it does not contain any essentially new results.From an isometric point of view, in some cases, metric spaces of measures are similar to C(K)-type function spaces. Similarity means here that their isometries are driven by some nice transformations of the underlying space. Of course, it depends on the particular choice of the metric how nice these transformations should be. Sometimes, as we will see, being a homeomorphism is enough to generate an isometry. But sometimes we need more: the transformation must preserve the underlying distance as well. Statements claiming that isometries in questions are necessarily induced by homeomorphisms are called Banach-Stone-type results, while results asserting that the underlying transformation is necessarily an isometry are termed as isometric rigidity results.As Dirac masses can be considered as building bricks of the set of all Borel measures, a natural question arises:Is it enough to understand how an isometry acts on the set of Dirac masses? Does this action extend uniquely to all measures?In what follows, we will thoroughly investigate this question.' article_processing_charge: No author: - first_name: Gyorgy Pal full_name: Geher, Gyorgy Pal last_name: Geher - first_name: Tamas full_name: Titkos, Tamas last_name: Titkos - first_name: Daniel full_name: Virosztek, Daniel id: 48DB45DA-F248-11E8-B48F-1D18A9856A87 last_name: Virosztek orcid: 0000-0003-1109-5511 citation: ama: 'Geher GP, Titkos T, Virosztek D. Dirac masses and isometric rigidity. In: Kyoto RIMS Kôkyûroku. Vol 2125. Research Institute for Mathematical Sciences, Kyoto University; 2019:34-41.' apa: 'Geher, G. P., Titkos, T., & Virosztek, D. (2019). Dirac masses and isometric rigidity. In Kyoto RIMS Kôkyûroku (Vol. 2125, pp. 34–41). Kyoto, Japan: Research Institute for Mathematical Sciences, Kyoto University.' chicago: Geher, Gyorgy Pal, Tamas Titkos, and Daniel Virosztek. “Dirac Masses and Isometric Rigidity.” In Kyoto RIMS Kôkyûroku, 2125:34–41. Research Institute for Mathematical Sciences, Kyoto University, 2019. ieee: G. P. Geher, T. Titkos, and D. Virosztek, “Dirac masses and isometric rigidity,” in Kyoto RIMS Kôkyûroku, Kyoto, Japan, 2019, vol. 2125, pp. 34–41. ista: Geher GP, Titkos T, Virosztek D. 2019. Dirac masses and isometric rigidity. Kyoto RIMS Kôkyûroku. Research on isometries as preserver problems and related topics vol. 2125, 34–41. mla: Geher, Gyorgy Pal, et al. “Dirac Masses and Isometric Rigidity.” Kyoto RIMS Kôkyûroku, vol. 2125, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41. short: G.P. Geher, T. Titkos, D. Virosztek, in:, Kyoto RIMS Kôkyûroku, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41. conference: end_date: 2019-01-30 location: Kyoto, Japan name: Research on isometries as preserver problems and related topics start_date: 2019-01-28 date_created: 2019-11-18T15:39:53Z date_published: 2019-01-30T00:00:00Z date_updated: 2021-01-12T08:11:33Z day: '30' department: - _id: LaEr intvolume: ' 2125' language: - iso: eng main_file_link: - open_access: '1' url: http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/2125.html month: '01' oa: 1 oa_version: Submitted Version page: 34-41 publication: Kyoto RIMS Kôkyûroku publication_status: published publisher: Research Institute for Mathematical Sciences, Kyoto University quality_controlled: '1' status: public title: Dirac masses and isometric rigidity type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2125 year: '2019' ... --- _id: '7055' abstract: - lang: eng text: A recent class of topological nodal-line semimetals with the general formula MSiX (M = Zr, Hf and X = S, Se, Te) has attracted much experimental and theoretical interest due to their properties, particularly their large magnetoresistances and high carrier mobilities. The plateletlike nature of the MSiX crystals and their extremely low residual resistivities make measurements of the resistivity along the [001] direction extremely challenging. To accomplish such measurements, microstructures of single crystals were prepared using focused ion beam techniques. Microstructures prepared in this manner have very well-defined geometries and maintain their high crystal quality, verified by the observations of quantum oscillations. We present magnetoresistance and quantum oscillation data for currents applied along both [001] and [100] in ZrSiS and ZrSiSe, which are consistent with the nontrivial topology of the Dirac line-node, as determined by a measured π Berry phase. Surprisingly, we find that, despite the three dimensional nature of both the Fermi surfaces of ZrSiS and ZrSiSe, both the resistivity anisotropy under applied magnetic fields and the in-plane angular dependent magnetoresistance differ considerably between the two compounds. Finally, we discuss the role microstructuring can play in the study of these materials and our ability to make these microstructures free-standing. article_number: '101116' article_processing_charge: No article_type: original author: - first_name: Kent R. full_name: Shirer, Kent R. last_name: Shirer - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: Tino full_name: Zimmerling, Tino last_name: Zimmerling - first_name: Maja D. full_name: Bachmann, Maja D. last_name: Bachmann - first_name: Markus full_name: König, Markus last_name: König - first_name: Philip J. W. full_name: Moll, Philip J. W. last_name: Moll - first_name: Leslie full_name: Schoop, Leslie last_name: Schoop - first_name: Andrew P. full_name: Mackenzie, Andrew P. last_name: Mackenzie citation: ama: Shirer KR, Modic KA, Zimmerling T, et al. Out-of-plane transport in ZrSiS and ZrSiSe microstructures. APL Materials. 2019;7(10). doi:10.1063/1.5124568 apa: Shirer, K. R., Modic, K. A., Zimmerling, T., Bachmann, M. D., König, M., Moll, P. J. W., … Mackenzie, A. P. (2019). Out-of-plane transport in ZrSiS and ZrSiSe microstructures. APL Materials. AIP. https://doi.org/10.1063/1.5124568 chicago: Shirer, Kent R., Kimberly A Modic, Tino Zimmerling, Maja D. Bachmann, Markus König, Philip J. W. Moll, Leslie Schoop, and Andrew P. Mackenzie. “Out-of-Plane Transport in ZrSiS and ZrSiSe Microstructures.” APL Materials. AIP, 2019. https://doi.org/10.1063/1.5124568. ieee: K. R. Shirer et al., “Out-of-plane transport in ZrSiS and ZrSiSe microstructures,” APL Materials, vol. 7, no. 10. AIP, 2019. ista: Shirer KR, Modic KA, Zimmerling T, Bachmann MD, König M, Moll PJW, Schoop L, Mackenzie AP. 2019. Out-of-plane transport in ZrSiS and ZrSiSe microstructures. APL Materials. 7(10), 101116. mla: Shirer, Kent R., et al. “Out-of-Plane Transport in ZrSiS and ZrSiSe Microstructures.” APL Materials, vol. 7, no. 10, 101116, AIP, 2019, doi:10.1063/1.5124568. short: K.R. Shirer, K.A. Modic, T. Zimmerling, M.D. Bachmann, M. König, P.J.W. Moll, L. Schoop, A.P. Mackenzie, APL Materials 7 (2019). date_created: 2019-11-19T12:52:43Z date_published: 2019-10-17T00:00:00Z date_updated: 2021-01-12T08:11:35Z day: '17' ddc: - '530' doi: 10.1063/1.5124568 extern: '1' file: - access_level: open_access checksum: 142fe7b3e37d8e916071743bb194360d content_type: application/pdf creator: dernst date_created: 2019-11-20T12:27:01Z date_updated: 2020-07-14T12:47:48Z file_id: '7087' file_name: 2019_APL_Shirer.pdf file_size: 2453220 relation: main_file file_date_updated: 2020-07-14T12:47:48Z has_accepted_license: '1' intvolume: ' 7' issue: '10' language: - iso: eng month: '10' oa: 1 oa_version: Published Version publication: APL Materials publication_identifier: issn: - 2166-532X publication_status: published publisher: AIP quality_controlled: '1' status: public title: Out-of-plane transport in ZrSiS and ZrSiSe microstructures tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2019' ... --- _id: '7057' abstract: - lang: eng text: We present a high magnetic field study of NbP—a member of the monopnictide Weyl semimetal (WSM) family. While the monoarsenides (NbAs and TaAs) have topologically distinct left and right-handed Weyl fermi surfaces, NbP is argued to be “topologically trivial” due to the fact that all pairs of Weyl nodes are encompassed by a single Fermi surface. We use torque magnetometry to measure the magnetic response of NbP up to 60 tesla and uncover a Berry paramagnetic response, characteristic of the topological Weyl nodes, across the entire field range. At the quantum limit B* (≈32 T), τ/B experiences a change in slope when the chemical potential enters the last Landau level. Our calculations confirm that this magnetic response arises from band topology of the Weyl pocket, even though the Fermi surface encompasses both Weyl nodes at zero magnetic field. We also find that the magnetic field pulls the chemical potential to the chiral n = 0 Landau level in the quantum limit, providing a disorder-free way of accessing chiral Weyl fermions in systems that are “not quite” WSMs in zero magnetic field. article_number: '2095' article_processing_charge: No article_type: original author: - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: Tobias full_name: Meng, Tobias last_name: Meng - first_name: Filip full_name: Ronning, Filip last_name: Ronning - first_name: Eric D. full_name: Bauer, Eric D. last_name: Bauer - first_name: Philip J. W. full_name: Moll, Philip J. W. last_name: Moll - first_name: B. J. full_name: Ramshaw, B. J. last_name: Ramshaw citation: ama: Modic KA, Meng T, Ronning F, Bauer ED, Moll PJW, Ramshaw BJ. Thermodynamic signatures of Weyl fermions in NbP. Scientific Reports. 2019;9(1). doi:10.1038/s41598-018-38161-7 apa: Modic, K. A., Meng, T., Ronning, F., Bauer, E. D., Moll, P. J. W., & Ramshaw, B. J. (2019). Thermodynamic signatures of Weyl fermions in NbP. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-018-38161-7 chicago: Modic, Kimberly A, Tobias Meng, Filip Ronning, Eric D. Bauer, Philip J. W. Moll, and B. J. Ramshaw. “Thermodynamic Signatures of Weyl Fermions in NbP.” Scientific Reports. Springer Nature, 2019. https://doi.org/10.1038/s41598-018-38161-7. ieee: K. A. Modic, T. Meng, F. Ronning, E. D. Bauer, P. J. W. Moll, and B. J. Ramshaw, “Thermodynamic signatures of Weyl fermions in NbP,” Scientific Reports, vol. 9, no. 1. Springer Nature, 2019. ista: Modic KA, Meng T, Ronning F, Bauer ED, Moll PJW, Ramshaw BJ. 2019. Thermodynamic signatures of Weyl fermions in NbP. Scientific Reports. 9(1), 2095. mla: Modic, Kimberly A., et al. “Thermodynamic Signatures of Weyl Fermions in NbP.” Scientific Reports, vol. 9, no. 1, 2095, Springer Nature, 2019, doi:10.1038/s41598-018-38161-7. short: K.A. Modic, T. Meng, F. Ronning, E.D. Bauer, P.J.W. Moll, B.J. Ramshaw, Scientific Reports 9 (2019). date_created: 2019-11-19T13:00:35Z date_published: 2019-02-14T00:00:00Z date_updated: 2021-01-12T08:11:36Z day: '14' ddc: - '530' doi: 10.1038/s41598-018-38161-7 extern: '1' file: - access_level: open_access checksum: 3b5a7b316e1ff22aa0f89e8d1f1ace91 content_type: application/pdf creator: dernst date_created: 2019-11-20T12:24:13Z date_updated: 2020-07-14T12:47:48Z file_id: '7086' file_name: 2019_ScientificReports_Modic.pdf file_size: 3256400 relation: main_file file_date_updated: 2020-07-14T12:47:48Z has_accepted_license: '1' intvolume: ' 9' issue: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version publication: Scientific Reports publication_identifier: issn: - 2045-2322 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Thermodynamic signatures of Weyl fermions in NbP tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2019' ... --- _id: '7056' abstract: - lang: eng text: "In the Ca1−x La x FeAs2 (1 1 2) family of pnictide superconductors, we have investigated a highly overdoped composition (x  =  0.56), prepared by a high-pressure, high-temperature synthesis. Magnetic measurements show an antiferromagnetic transition at T N  =  120 K, well above the one at lower doping (0.15  <  x  <  0.27).\r\n\r\nBelow the onset of long-range magnetic order at T N, the electrical resistivity is strongly reduced and is dominated by electron–electron interactions, as evident from its temperature dependence. The Seebeck coefficient shows a clear metallic behavior as in narrow band conductors. The temperature dependence of the Hall coefficient and the violation of Kohler's rule agree with the multiband character of the material. No superconductivity was observed down to 1.8 K. The success of the high-pressure synthesis encourages further investigations of the so far only partially explored phase diagram in this family of Iron-based high temperature superconductors.\r\n" article_number: '485705' article_processing_charge: No article_type: original author: - first_name: Edoardo full_name: Martino, Edoardo last_name: Martino - first_name: Maja D full_name: Bachmann, Maja D last_name: Bachmann - first_name: Lidia full_name: Rossi, Lidia last_name: Rossi - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: Ivica full_name: Zivkovic, Ivica last_name: Zivkovic - first_name: Henrik M full_name: Rønnow, Henrik M last_name: Rønnow - first_name: Philip J W full_name: Moll, Philip J W last_name: Moll - first_name: Ana full_name: Akrap, Ana last_name: Akrap - first_name: László full_name: Forró, László last_name: Forró - first_name: Sergiy full_name: Katrych, Sergiy last_name: Katrych citation: ama: 'Martino E, Bachmann MD, Rossi L, et al. Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2. Journal of Physics: Condensed Matter. 2019;31(48). doi:10.1088/1361-648x/ab3b43' apa: 'Martino, E., Bachmann, M. D., Rossi, L., Modic, K. A., Zivkovic, I., Rønnow, H. M., … Katrych, S. (2019). Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2. Journal of Physics: Condensed Matter. IOP Publishing. https://doi.org/10.1088/1361-648x/ab3b43' chicago: 'Martino, Edoardo, Maja D Bachmann, Lidia Rossi, Kimberly A Modic, Ivica Zivkovic, Henrik M Rønnow, Philip J W Moll, Ana Akrap, László Forró, and Sergiy Katrych. “Persistent Antiferromagnetic Order in Heavily Overdoped Ca1−x La x FeAs2.” Journal of Physics: Condensed Matter. IOP Publishing, 2019. https://doi.org/10.1088/1361-648x/ab3b43.' ieee: 'E. Martino et al., “Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2,” Journal of Physics: Condensed Matter, vol. 31, no. 48. IOP Publishing, 2019.' ista: 'Martino E, Bachmann MD, Rossi L, Modic KA, Zivkovic I, Rønnow HM, Moll PJW, Akrap A, Forró L, Katrych S. 2019. Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2. Journal of Physics: Condensed Matter. 31(48), 485705.' mla: 'Martino, Edoardo, et al. “Persistent Antiferromagnetic Order in Heavily Overdoped Ca1−x La x FeAs2.” Journal of Physics: Condensed Matter, vol. 31, no. 48, 485705, IOP Publishing, 2019, doi:10.1088/1361-648x/ab3b43.' short: 'E. Martino, M.D. Bachmann, L. Rossi, K.A. Modic, I. Zivkovic, H.M. Rønnow, P.J.W. Moll, A. Akrap, L. Forró, S. Katrych, Journal of Physics: Condensed Matter 31 (2019).' date_created: 2019-11-19T12:56:17Z date_published: 2019-09-03T00:00:00Z date_updated: 2021-01-12T08:11:35Z day: '03' doi: 10.1088/1361-648x/ab3b43 extern: '1' external_id: arxiv: - '1905.08640' intvolume: ' 31' issue: '48' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1905.08640 month: '09' oa: 1 oa_version: Preprint publication: 'Journal of Physics: Condensed Matter' publication_identifier: eissn: - 1361-648X issn: - 0953-8984 publication_status: published publisher: IOP Publishing quality_controlled: '1' status: public title: Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2 type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 31 year: '2019' ... --- _id: '7082' abstract: - lang: eng text: Although crystals of strongly correlated metals exhibit a diverse set of electronic ground states, few approaches exist for spatially modulating their properties. In this study, we demonstrate disorder-free control, on the micrometer scale, over the superconducting state in samples of the heavy-fermion superconductor CeIrIn5. We pattern crystals by focused ion beam milling to tailor the boundary conditions for the elastic deformation upon thermal contraction during cooling. The resulting nonuniform strain fields induce complex patterns of superconductivity, owing to the strong dependence of the transition temperature on the strength and direction of strain. These results showcase a generic approach to manipulating electronic order on micrometer length scales in strongly correlated matter without compromising the cleanliness, stoichiometry, or mean free path. article_processing_charge: No article_type: original author: - first_name: Maja D. full_name: Bachmann, Maja D. last_name: Bachmann - first_name: G. M. full_name: Ferguson, G. M. last_name: Ferguson - first_name: Florian full_name: Theuss, Florian last_name: Theuss - first_name: Tobias full_name: Meng, Tobias last_name: Meng - first_name: Carsten full_name: Putzke, Carsten last_name: Putzke - first_name: Toni full_name: Helm, Toni last_name: Helm - first_name: K. R. full_name: Shirer, K. R. last_name: Shirer - first_name: You-Sheng full_name: Li, You-Sheng last_name: Li - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: Michael full_name: Nicklas, Michael last_name: Nicklas - first_name: Markus full_name: König, Markus last_name: König - first_name: D. full_name: Low, D. last_name: Low - first_name: Sayak full_name: Ghosh, Sayak last_name: Ghosh - first_name: Andrew P. full_name: Mackenzie, Andrew P. last_name: Mackenzie - first_name: Frank full_name: Arnold, Frank last_name: Arnold - first_name: Elena full_name: Hassinger, Elena last_name: Hassinger - first_name: Ross D. full_name: McDonald, Ross D. last_name: McDonald - first_name: Laurel E. full_name: Winter, Laurel E. last_name: Winter - first_name: Eric D. full_name: Bauer, Eric D. last_name: Bauer - first_name: Filip full_name: Ronning, Filip last_name: Ronning - first_name: B. J. full_name: Ramshaw, B. J. last_name: Ramshaw - first_name: Katja C. full_name: Nowack, Katja C. last_name: Nowack - first_name: Philip J. W. full_name: Moll, Philip J. W. last_name: Moll citation: ama: Bachmann MD, Ferguson GM, Theuss F, et al. Spatial control of heavy-fermion superconductivity in CeIrIn5. Science. 2019;366(6462):221-226. doi:10.1126/science.aao6640 apa: Bachmann, M. D., Ferguson, G. M., Theuss, F., Meng, T., Putzke, C., Helm, T., … Moll, P. J. W. (2019). Spatial control of heavy-fermion superconductivity in CeIrIn5. Science. AAAS. https://doi.org/10.1126/science.aao6640 chicago: Bachmann, Maja D., G. M. Ferguson, Florian Theuss, Tobias Meng, Carsten Putzke, Toni Helm, K. R. Shirer, et al. “Spatial Control of Heavy-Fermion Superconductivity in CeIrIn5.” Science. AAAS, 2019. https://doi.org/10.1126/science.aao6640. ieee: M. D. Bachmann et al., “Spatial control of heavy-fermion superconductivity in CeIrIn5,” Science, vol. 366, no. 6462. AAAS, pp. 221–226, 2019. ista: Bachmann MD, Ferguson GM, Theuss F, Meng T, Putzke C, Helm T, Shirer KR, Li Y-S, Modic KA, Nicklas M, König M, Low D, Ghosh S, Mackenzie AP, Arnold F, Hassinger E, McDonald RD, Winter LE, Bauer ED, Ronning F, Ramshaw BJ, Nowack KC, Moll PJW. 2019. Spatial control of heavy-fermion superconductivity in CeIrIn5. Science. 366(6462), 221–226. mla: Bachmann, Maja D., et al. “Spatial Control of Heavy-Fermion Superconductivity in CeIrIn5.” Science, vol. 366, no. 6462, AAAS, 2019, pp. 221–26, doi:10.1126/science.aao6640. short: M.D. Bachmann, G.M. Ferguson, F. Theuss, T. Meng, C. Putzke, T. Helm, K.R. Shirer, Y.-S. Li, K.A. Modic, M. Nicklas, M. König, D. Low, S. Ghosh, A.P. Mackenzie, F. Arnold, E. Hassinger, R.D. McDonald, L.E. Winter, E.D. Bauer, F. Ronning, B.J. Ramshaw, K.C. Nowack, P.J.W. Moll, Science 366 (2019) 221–226. date_created: 2019-11-19T13:55:58Z date_published: 2019-10-11T00:00:00Z date_updated: 2021-01-12T08:11:46Z day: '11' doi: 10.1126/science.aao6640 extern: '1' intvolume: ' 366' issue: '6462' language: - iso: eng month: '10' oa_version: None page: 221-226 publication: Science publication_identifier: eissn: - 1095-9203 issn: - 0036-8075 publication_status: published publisher: AAAS quality_controlled: '1' status: public title: Spatial control of heavy-fermion superconductivity in CeIrIn5 type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 366 year: '2019' ... --- _id: '7128' abstract: - lang: eng text: Loss of functional cardiomyocytes is a major determinant of heart failure after myocardial infarction. Previous high throughput screening studies have identified a few microRNAs (miRNAs) that can induce cardiomyocyte proliferation and stimulate cardiac regeneration in mice. Here, we show that all of the most effective of these miRNAs activate nuclear localization of the master transcriptional cofactor Yes-associated protein (YAP) and induce expression of YAP-responsive genes. In particular, miR-199a-3p directly targets two mRNAs coding for proteins impinging on the Hippo pathway, the upstream YAP inhibitory kinase TAOK1, and the E3 ubiquitin ligase β-TrCP, which leads to YAP degradation. Several of the pro-proliferative miRNAs (including miR-199a-3p) also inhibit filamentous actin depolymerization by targeting Cofilin2, a process that by itself activates YAP nuclear translocation. Thus, activation of YAP and modulation of the actin cytoskeleton are major components of the pro-proliferative action of miR-199a-3p and other miRNAs that induce cardiomyocyte proliferation. article_processing_charge: Yes article_type: original author: - first_name: Consuelo full_name: Torrini, Consuelo last_name: Torrini - first_name: Ryan J full_name: Cubero, Ryan J id: 850B2E12-9CD4-11E9-837F-E719E6697425 last_name: Cubero orcid: 0000-0003-0002-1867 - first_name: Ellen full_name: Dirkx, Ellen last_name: Dirkx - first_name: Luca full_name: Braga, Luca last_name: Braga - first_name: Hashim full_name: Ali, Hashim last_name: Ali - first_name: Giulia full_name: Prosdocimo, Giulia last_name: Prosdocimo - first_name: Maria Ines full_name: Gutierrez, Maria Ines last_name: Gutierrez - first_name: Chiara full_name: Collesi, Chiara last_name: Collesi - first_name: Danilo full_name: Licastro, Danilo last_name: Licastro - first_name: Lorena full_name: Zentilin, Lorena last_name: Zentilin - first_name: Miguel full_name: Mano, Miguel last_name: Mano - first_name: Serena full_name: Zacchigna, Serena last_name: Zacchigna - first_name: Michele full_name: Vendruscolo, Michele last_name: Vendruscolo - first_name: Matteo full_name: Marsili, Matteo last_name: Marsili - first_name: Areejit full_name: Samal, Areejit last_name: Samal - first_name: Mauro full_name: Giacca, Mauro last_name: Giacca citation: ama: Torrini C, Cubero RJ, Dirkx E, et al. Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. Cell Reports. 2019;27(9):2759-2771.e5. doi:10.1016/j.celrep.2019.05.005 apa: Torrini, C., Cubero, R. J., Dirkx, E., Braga, L., Ali, H., Prosdocimo, G., … Giacca, M. (2019). Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. Cell Reports. Elsevier. https://doi.org/10.1016/j.celrep.2019.05.005 chicago: Torrini, Consuelo, Ryan J Cubero, Ellen Dirkx, Luca Braga, Hashim Ali, Giulia Prosdocimo, Maria Ines Gutierrez, et al. “Common Regulatory Pathways Mediate Activity of MicroRNAs Inducing Cardiomyocyte Proliferation.” Cell Reports. Elsevier, 2019. https://doi.org/10.1016/j.celrep.2019.05.005. ieee: C. Torrini et al., “Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation,” Cell Reports, vol. 27, no. 9. Elsevier, p. 2759–2771.e5, 2019. ista: Torrini C, Cubero RJ, Dirkx E, Braga L, Ali H, Prosdocimo G, Gutierrez MI, Collesi C, Licastro D, Zentilin L, Mano M, Zacchigna S, Vendruscolo M, Marsili M, Samal A, Giacca M. 2019. Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. Cell Reports. 27(9), 2759–2771.e5. mla: Torrini, Consuelo, et al. “Common Regulatory Pathways Mediate Activity of MicroRNAs Inducing Cardiomyocyte Proliferation.” Cell Reports, vol. 27, no. 9, Elsevier, 2019, p. 2759–2771.e5, doi:10.1016/j.celrep.2019.05.005. short: C. Torrini, R.J. Cubero, E. Dirkx, L. Braga, H. Ali, G. Prosdocimo, M.I. Gutierrez, C. Collesi, D. Licastro, L. Zentilin, M. Mano, S. Zacchigna, M. Vendruscolo, M. Marsili, A. Samal, M. Giacca, Cell Reports 27 (2019) 2759–2771.e5. date_created: 2019-11-26T22:30:07Z date_published: 2019-05-28T00:00:00Z date_updated: 2021-01-12T08:11:56Z day: '28' ddc: - '576' doi: 10.1016/j.celrep.2019.05.005 extern: '1' external_id: pmid: - '31141697' file: - access_level: open_access checksum: c5d855d07263bfec718673385d0ea2d7 content_type: application/pdf creator: rcubero date_created: 2019-11-26T22:30:43Z date_updated: 2020-07-14T12:47:50Z file_id: '7129' file_name: torrini_cellreports_2019.pdf file_size: 4650750 relation: main_file file_date_updated: 2020-07-14T12:47:50Z has_accepted_license: '1' intvolume: ' 27' issue: '9' keyword: - cardiomyocyte - cell cycle - Cofilin2 - cytoskeleton - Hippo - microRNA - regeneration - YAP language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/4.0/ month: '05' oa: 1 oa_version: Published Version page: 2759-2771.e5 pmid: 1 publication: Cell Reports publication_identifier: issn: - 2211-1247 publication_status: published publisher: Elsevier quality_controlled: '1' status: public title: Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 27 year: '2019' ... --- _id: '7130' abstract: - lang: eng text: "We show that statistical criticality, i.e. the occurrence of power law frequency distributions, arises in samples that are maximally informative about the underlying generating process. In order to reach this conclusion, we first identify the frequency with which different outcomes occur in a sample, as the variable carrying useful information on the generative process. The entropy of the frequency, that we call relevance, provides an upper bound to the number of informative bits. This differs from the entropy of the data, that we take as a measure of resolution. Samples that maximise relevance at a given resolution—that we call maximally informative samples—exhibit statistical criticality. In particular, Zipf's law arises at the optimal trade-off between resolution (i.e. compression) and relevance. As a byproduct, we derive a bound of the maximal number of parameters that can be estimated from a dataset, in the absence of prior knowledge on the generative model.\r\n\r\nFurthermore, we relate criticality to the statistical properties of the representation of the data generating process. We show that, as a consequence of the concentration property of the asymptotic equipartition property, representations that are maximally informative about the data generating process are characterised by an exponential distribution of energy levels. This arises from a principle of minimal entropy, that is conjugate of the maximum entropy principle in statistical mechanics. This explains why statistical criticality requires no parameter fine tuning in maximally informative samples." acknowledgement: We acknowledge interesting discussions with M Abbott, E Aurell, J Barbier, R Monasson, T Mora, I Nemenman, N Tishby and R Zecchina. This research was supported by the Kavli Foundation and the Centre of Excellence scheme of the Research Council of Norway (Centre for Neural Computation) (RJC and YR), by the Basic Science Research Program through the National Research Foundation of Korea (NRF), funded by the Ministry of Education (2016R1D1A1B03932264) (JJ), and, in part, by the ICTP through the OEA-AC-98 (JS). article_number: '063402' article_processing_charge: No article_type: original author: - first_name: Ryan J full_name: Cubero, Ryan J id: 850B2E12-9CD4-11E9-837F-E719E6697425 last_name: Cubero orcid: 0000-0003-0002-1867 - first_name: Junghyo full_name: Jo, Junghyo last_name: Jo - first_name: Matteo full_name: Marsili, Matteo last_name: Marsili - first_name: Yasser full_name: Roudi, Yasser last_name: Roudi - first_name: Juyong full_name: Song, Juyong last_name: Song citation: ama: 'Cubero RJ, Jo J, Marsili M, Roudi Y, Song J. Statistical criticality arises in most informative representations. Journal of Statistical Mechanics: Theory and Experiment. 2019;2019(6). doi:10.1088/1742-5468/ab16c8' apa: 'Cubero, R. J., Jo, J., Marsili, M., Roudi, Y., & Song, J. (2019). Statistical criticality arises in most informative representations. Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing. https://doi.org/10.1088/1742-5468/ab16c8' chicago: 'Cubero, Ryan J, Junghyo Jo, Matteo Marsili, Yasser Roudi, and Juyong Song. “Statistical Criticality Arises in Most Informative Representations.” Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing, 2019. https://doi.org/10.1088/1742-5468/ab16c8.' ieee: 'R. J. Cubero, J. Jo, M. Marsili, Y. Roudi, and J. Song, “Statistical criticality arises in most informative representations,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2019, no. 6. IOP Publishing, 2019.' ista: 'Cubero RJ, Jo J, Marsili M, Roudi Y, Song J. 2019. Statistical criticality arises in most informative representations. Journal of Statistical Mechanics: Theory and Experiment. 2019(6), 063402.' mla: 'Cubero, Ryan J., et al. “Statistical Criticality Arises in Most Informative Representations.” Journal of Statistical Mechanics: Theory and Experiment, vol. 2019, no. 6, 063402, IOP Publishing, 2019, doi:10.1088/1742-5468/ab16c8.' short: 'R.J. Cubero, J. Jo, M. Marsili, Y. Roudi, J. Song, Journal of Statistical Mechanics: Theory and Experiment 2019 (2019).' date_created: 2019-11-26T22:36:09Z date_published: 2019-06-17T00:00:00Z date_updated: 2021-01-12T08:11:57Z day: '17' doi: 10.1088/1742-5468/ab16c8 extern: '1' external_id: arxiv: - '1808.00249' intvolume: ' 2019' issue: '6' keyword: - optimization under uncertainty - source coding - large deviation language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1808.00249 month: '06' oa: 1 oa_version: Preprint publication: 'Journal of Statistical Mechanics: Theory and Experiment' publication_identifier: issn: - 1742-5468 publication_status: published publisher: IOP Publishing quality_controlled: '1' status: public title: Statistical criticality arises in most informative representations type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2019 year: '2019' ... --- _id: '7150' abstract: - lang: eng text: "In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an O(n1−2/ω) round matrix multiplication algorithm, where ω<2.3728639 is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include:\r\n\r\n1. triangle and 4-cycle counting in O(n0.158) rounds, improving upon the O(n1/3) algorithm of Dolev et al. [DISC 2012],\r\n2. a (1+o(1))-approximation of all-pairs shortest paths in O(n0.158) rounds, improving upon the O~(n1/2)-round (2+o(1))-approximation algorithm given by Nanongkai [STOC 2014], and\r\n 3. computing the girth in O(n0.158) rounds, which is the first non-trivial solution in this model.\r\n \r\nIn addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles." article_processing_charge: No article_type: original author: - first_name: Keren full_name: Censor-Hillel, Keren last_name: Censor-Hillel - first_name: Petteri full_name: Kaski, Petteri last_name: Kaski - first_name: Janne full_name: Korhonen, Janne id: C5402D42-15BC-11E9-A202-CA2BE6697425 last_name: Korhonen - first_name: Christoph full_name: Lenzen, Christoph last_name: Lenzen - first_name: Ami full_name: Paz, Ami last_name: Paz - first_name: Jukka full_name: Suomela, Jukka last_name: Suomela citation: ama: Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. Algebraic methods in the congested clique. Distributed Computing. 2019;32(6):461-478. doi:10.1007/s00446-016-0270-2 apa: Censor-Hillel, K., Kaski, P., Korhonen, J., Lenzen, C., Paz, A., & Suomela, J. (2019). Algebraic methods in the congested clique. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-016-0270-2 chicago: Censor-Hillel, Keren, Petteri Kaski, Janne Korhonen, Christoph Lenzen, Ami Paz, and Jukka Suomela. “Algebraic Methods in the Congested Clique.” Distributed Computing. Springer Nature, 2019. https://doi.org/10.1007/s00446-016-0270-2. ieee: K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, and J. Suomela, “Algebraic methods in the congested clique,” Distributed Computing, vol. 32, no. 6. Springer Nature, pp. 461–478, 2019. ista: Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. 2019. Algebraic methods in the congested clique. Distributed Computing. 32(6), 461–478. mla: Censor-Hillel, Keren, et al. “Algebraic Methods in the Congested Clique.” Distributed Computing, vol. 32, no. 6, Springer Nature, 2019, pp. 461–78, doi:10.1007/s00446-016-0270-2. short: K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, J. Suomela, Distributed Computing 32 (2019) 461–478. date_created: 2019-12-05T09:49:49Z date_published: 2019-12-01T00:00:00Z date_updated: 2021-01-12T08:12:05Z day: '01' doi: 10.1007/s00446-016-0270-2 extern: '1' external_id: arxiv: - '1503.04963' intvolume: ' 32' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1503.04963 month: '12' oa: 1 oa_version: Preprint page: 461-478 publication: Distributed Computing publication_identifier: issn: - 0178-2770 - 1432-0452 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Algebraic methods in the congested clique type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 year: '2019' ... --- _id: '7171' abstract: - lang: ger text: "Wissen Sie, was sich hinter künstlicher Intelligenz und maschinellem Lernen verbirgt? \r\nDieses Sachbuch erklärt Ihnen leicht verständlich und ohne komplizierte Formeln die grundlegenden Methoden und Vorgehensweisen des maschinellen Lernens. Mathematisches Vorwissen ist dafür nicht nötig. Kurzweilig und informativ illustriert Lisa, die Protagonistin des Buches, diese anhand von Alltagssituationen. \r\nEin Buch für alle, die in Diskussionen über Chancen und Risiken der aktuellen Entwicklung der künstlichen Intelligenz und des maschinellen Lernens mit Faktenwissen punkten möchten. Auch für Schülerinnen und Schüler geeignet!" article_processing_charge: No citation: ama: 'Kersting K, Lampert C, Rothkopf C, eds. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden: Springer Nature; 2019. doi:10.1007/978-3-658-26763-6' apa: 'Kersting, K., Lampert, C., & Rothkopf, C. (Eds.). (2019). Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt (1st ed.). Wiesbaden: Springer Nature. https://doi.org/10.1007/978-3-658-26763-6' chicago: 'Kersting, Kristian, Christoph Lampert, and Constantin Rothkopf, eds. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden: Springer Nature, 2019. https://doi.org/10.1007/978-3-658-26763-6.' ieee: 'K. Kersting, C. Lampert, and C. Rothkopf, Eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed. Wiesbaden: Springer Nature, 2019.' ista: 'Kersting K, Lampert C, Rothkopf C eds. 2019. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt 1st ed., Wiesbaden: Springer Nature, XIV, 245p.' mla: 'Kersting, Kristian, et al., editors. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed., Springer Nature, 2019, doi:10.1007/978-3-658-26763-6.' short: 'K. Kersting, C. Lampert, C. Rothkopf, eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed., Springer Nature, Wiesbaden, 2019.' date_created: 2019-12-11T14:15:56Z date_published: 2019-10-30T00:00:00Z date_updated: 2021-12-22T14:40:58Z day: '30' department: - _id: ChLa doi: 10.1007/978-3-658-26763-6 edition: '1' editor: - first_name: Kristian full_name: Kersting, Kristian last_name: Kersting - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Constantin full_name: Rothkopf, Constantin last_name: Rothkopf language: - iso: ger month: '10' oa_version: None page: XIV, 245 place: Wiesbaden publication_identifier: eisbn: - 978-3-658-26763-6 isbn: - 978-3-658-26762-9 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - description: News on IST Website relation: press_release url: https://ist.ac.at/en/news/book-release-how-machines-learn/ status: public title: 'Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt' type: book_editor user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2019' ... --- _id: '7275' abstract: - lang: eng text: Aprotic alkali metal–oxygen batteries require reversible formation of metal superoxide or peroxide on cycling. Severe parasitic reactions cause poor rechargeability, efficiency, and cycle life and have been shown to be caused by singlet oxygen (1O2) that forms at all stages of cycling. However, its formation mechanism remains unclear. We show that disproportionation of superoxide, the product or intermediate on discharge and charge, to peroxide and oxygen is responsible for 1O2 formation. While the overall reaction is driven by the stability of peroxide and thus favored by stronger Lewis acidic cations such as Li+, the 1O2 fraction is enhanced by weak Lewis acids such as organic cations. Concurrently, the metal peroxide yield drops with increasing 1O2. The results explain a major parasitic pathway during cell cycling and the growing severity in K–, Na–, and Li–O2 cells based on the growing propensity for disproportionation. High capacities and rates with peroxides are now realized to require solution processes, which form peroxide or release O2via disproportionation. The results therefore establish the central dilemma that disproportionation is required for high capacity but also responsible for irreversible reactions. Highly reversible cell operation requires hence finding reaction routes that avoid disproportionation. article_processing_charge: No article_type: original author: - first_name: Eléonore full_name: Mourad, Eléonore last_name: Mourad - first_name: Yann K. full_name: Petit, Yann K. last_name: Petit - first_name: Riccardo full_name: Spezia, Riccardo last_name: Spezia - first_name: Aleksej full_name: Samojlov, Aleksej last_name: Samojlov - first_name: Francesco F. full_name: Summa, Francesco F. last_name: Summa - first_name: Christian full_name: Prehal, Christian last_name: Prehal - first_name: Christian full_name: Leypold, Christian last_name: Leypold - first_name: Nika full_name: Mahne, Nika last_name: Mahne - first_name: Christian full_name: Slugovc, Christian last_name: Slugovc - first_name: Olivier full_name: Fontaine, Olivier last_name: Fontaine - first_name: Sergio full_name: Brutti, Sergio last_name: Brutti - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 citation: ama: Mourad E, Petit YK, Spezia R, et al. Singlet oxygen from cation driven superoxide disproportionation and consequences for aprotic metal–O2 batteries. Energy & Environmental Science. 2019;12(8):2559-2568. doi:10.1039/c9ee01453e apa: Mourad, E., Petit, Y. K., Spezia, R., Samojlov, A., Summa, F. F., Prehal, C., … Freunberger, S. A. (2019). Singlet oxygen from cation driven superoxide disproportionation and consequences for aprotic metal–O2 batteries. Energy & Environmental Science. RSC. https://doi.org/10.1039/c9ee01453e chicago: Mourad, Eléonore, Yann K. Petit, Riccardo Spezia, Aleksej Samojlov, Francesco F. Summa, Christian Prehal, Christian Leypold, et al. “Singlet Oxygen from Cation Driven Superoxide Disproportionation and Consequences for Aprotic Metal–O2 Batteries.” Energy & Environmental Science. RSC, 2019. https://doi.org/10.1039/c9ee01453e. ieee: E. Mourad et al., “Singlet oxygen from cation driven superoxide disproportionation and consequences for aprotic metal–O2 batteries,” Energy & Environmental Science, vol. 12, no. 8. RSC, pp. 2559–2568, 2019. ista: Mourad E, Petit YK, Spezia R, Samojlov A, Summa FF, Prehal C, Leypold C, Mahne N, Slugovc C, Fontaine O, Brutti S, Freunberger SA. 2019. Singlet oxygen from cation driven superoxide disproportionation and consequences for aprotic metal–O2 batteries. Energy & Environmental Science. 12(8), 2559–2568. mla: Mourad, Eléonore, et al. “Singlet Oxygen from Cation Driven Superoxide Disproportionation and Consequences for Aprotic Metal–O2 Batteries.” Energy & Environmental Science, vol. 12, no. 8, RSC, 2019, pp. 2559–68, doi:10.1039/c9ee01453e. short: E. Mourad, Y.K. Petit, R. Spezia, A. Samojlov, F.F. Summa, C. Prehal, C. Leypold, N. Mahne, C. Slugovc, O. Fontaine, S. Brutti, S.A. Freunberger, Energy & Environmental Science 12 (2019) 2559–2568. date_created: 2020-01-15T07:18:04Z date_published: 2019-08-01T00:00:00Z date_updated: 2021-01-12T08:12:41Z day: '01' ddc: - '530' - '541' - '540' doi: 10.1039/c9ee01453e extern: '1' file: - access_level: open_access checksum: 94d4cfb2ab0b4c90ef76a7f3cc811feb content_type: application/pdf creator: dernst date_created: 2020-01-30T16:11:05Z date_updated: 2020-07-14T12:47:55Z file_id: '7424' file_name: 2019_EnergyEnvironScienc_Mourad.pdf file_size: 2888027 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 12' issue: '8' language: - iso: eng license: https://creativecommons.org/licenses/by-nc/4.0/ month: '08' oa: 1 oa_version: Published Version page: 2559-2568 publication: Energy & Environmental Science publication_identifier: issn: - 1754-5692 - 1754-5706 publication_status: published publisher: RSC quality_controlled: '1' status: public title: Singlet oxygen from cation driven superoxide disproportionation and consequences for aprotic metal–O2 batteries tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12 year: '2019' ... --- _id: '7280' abstract: - lang: eng text: Non-aqueous lithium-oxygen batteries cycle by forming lithium peroxide during discharge and oxidizing it during recharge. The significant problem of oxidizing the solid insulating lithium peroxide can greatly be facilitated by incorporating redox mediators that shuttle electron-holes between the porous substrate and lithium peroxide. Redox mediator stability is thus key for energy efficiency, reversibility, and cycle life. However, the gradual deactivation of redox mediators during repeated cycling has not conclusively been explained. Here, we show that organic redox mediators are predominantly decomposed by singlet oxygen that forms during cycling. Their reaction with superoxide, previously assumed to mainly trigger their degradation, peroxide, and dioxygen, is orders of magnitude slower in comparison. The reduced form of the mediator is markedly more reactive towards singlet oxygen than the oxidized form, from which we derive reaction mechanisms supported by density functional theory calculations. Redox mediators must thus be designed for stability against singlet oxygen. article_number: '1380' article_processing_charge: No article_type: original author: - first_name: Won-Jin full_name: Kwak, Won-Jin last_name: Kwak - first_name: Hun full_name: Kim, Hun last_name: Kim - first_name: Yann K. full_name: Petit, Yann K. last_name: Petit - first_name: Christian full_name: Leypold, Christian last_name: Leypold - first_name: Trung Thien full_name: Nguyen, Trung Thien last_name: Nguyen - first_name: Nika full_name: Mahne, Nika last_name: Mahne - first_name: Paul full_name: Redfern, Paul last_name: Redfern - first_name: Larry A. full_name: Curtiss, Larry A. last_name: Curtiss - first_name: Hun-Gi full_name: Jung, Hun-Gi last_name: Jung - first_name: Sergey M. full_name: Borisov, Sergey M. last_name: Borisov - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 - first_name: Yang-Kook full_name: Sun, Yang-Kook last_name: Sun citation: ama: Kwak W-J, Kim H, Petit YK, et al. Deactivation of redox mediators in lithium-oxygen batteries by singlet oxygen. Nature Communications. 2019;10. doi:10.1038/s41467-019-09399-0 apa: Kwak, W.-J., Kim, H., Petit, Y. K., Leypold, C., Nguyen, T. T., Mahne, N., … Sun, Y.-K. (2019). Deactivation of redox mediators in lithium-oxygen batteries by singlet oxygen. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-019-09399-0 chicago: Kwak, Won-Jin, Hun Kim, Yann K. Petit, Christian Leypold, Trung Thien Nguyen, Nika Mahne, Paul Redfern, et al. “Deactivation of Redox Mediators in Lithium-Oxygen Batteries by Singlet Oxygen.” Nature Communications. Springer Nature, 2019. https://doi.org/10.1038/s41467-019-09399-0. ieee: W.-J. Kwak et al., “Deactivation of redox mediators in lithium-oxygen batteries by singlet oxygen,” Nature Communications, vol. 10. Springer Nature, 2019. ista: Kwak W-J, Kim H, Petit YK, Leypold C, Nguyen TT, Mahne N, Redfern P, Curtiss LA, Jung H-G, Borisov SM, Freunberger SA, Sun Y-K. 2019. Deactivation of redox mediators in lithium-oxygen batteries by singlet oxygen. Nature Communications. 10, 1380. mla: Kwak, Won-Jin, et al. “Deactivation of Redox Mediators in Lithium-Oxygen Batteries by Singlet Oxygen.” Nature Communications, vol. 10, 1380, Springer Nature, 2019, doi:10.1038/s41467-019-09399-0. short: W.-J. Kwak, H. Kim, Y.K. Petit, C. Leypold, T.T. Nguyen, N. Mahne, P. Redfern, L.A. Curtiss, H.-G. Jung, S.M. Borisov, S.A. Freunberger, Y.-K. Sun, Nature Communications 10 (2019). date_created: 2020-01-15T12:12:26Z date_published: 2019-03-26T00:00:00Z date_updated: 2021-01-12T08:12:44Z day: '26' ddc: - '540' doi: 10.1038/s41467-019-09399-0 extern: '1' file: - access_level: open_access checksum: 123dd33e7f26761c82c74e10811a1e4d content_type: application/pdf creator: dernst date_created: 2020-01-22T15:58:54Z date_updated: 2020-07-14T12:47:55Z file_id: '7355' file_name: 2019_NatureComm_Kwak.pdf file_size: 1003676 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 10' language: - iso: eng month: '03' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Deactivation of redox mediators in lithium-oxygen batteries by singlet oxygen tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2019' ... --- _id: '7276' abstract: - lang: eng text: Singlet oxygen (1O2) causes a major fraction of the parasitic chemistry during the cycling of non‐aqueous alkali metal‐O2 batteries and also contributes to interfacial reactivity of transition‐metal oxide intercalation compounds. We introduce DABCOnium, the mono alkylated form of 1,4‐diazabicyclo[2.2.2]octane (DABCO), as an efficient 1O2 quencher with an unusually high oxidative stability of ca. 4.2 V vs. Li/Li+. Previous quenchers are strongly Lewis basic amines with too low oxidative stability. DABCOnium is an ionic liquid, non‐volatile, highly soluble in the electrolyte, stable against superoxide and peroxide, and compatible with lithium metal. The electrochemical stability covers the required range for metal–O2 batteries and greatly reduces 1O2 related parasitic chemistry as demonstrated for the Li–O2 cell. article_processing_charge: No article_type: original author: - first_name: Yann K. full_name: Petit, Yann K. last_name: Petit - first_name: Christian full_name: Leypold, Christian last_name: Leypold - first_name: Nika full_name: Mahne, Nika last_name: Mahne - first_name: Eléonore full_name: Mourad, Eléonore last_name: Mourad - first_name: Lukas full_name: Schafzahl, Lukas last_name: Schafzahl - first_name: Christian full_name: Slugovc, Christian last_name: Slugovc - first_name: Sergey M. full_name: Borisov, Sergey M. last_name: Borisov - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 citation: ama: 'Petit YK, Leypold C, Mahne N, et al. DABCOnium: An efficient and high-voltage stable singlet oxygen quencher for metal-O2 cells. Angewandte Chemie International Edition. 2019;58(20):6535-6539. doi:10.1002/anie.201901869' apa: 'Petit, Y. K., Leypold, C., Mahne, N., Mourad, E., Schafzahl, L., Slugovc, C., … Freunberger, S. A. (2019). DABCOnium: An efficient and high-voltage stable singlet oxygen quencher for metal-O2 cells. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201901869' chicago: 'Petit, Yann K., Christian Leypold, Nika Mahne, Eléonore Mourad, Lukas Schafzahl, Christian Slugovc, Sergey M. Borisov, and Stefan Alexander Freunberger. “DABCOnium: An Efficient and High-Voltage Stable Singlet Oxygen Quencher for Metal-O2 Cells.” Angewandte Chemie International Edition. Wiley, 2019. https://doi.org/10.1002/anie.201901869.' ieee: 'Y. K. Petit et al., “DABCOnium: An efficient and high-voltage stable singlet oxygen quencher for metal-O2 cells,” Angewandte Chemie International Edition, vol. 58, no. 20. Wiley, pp. 6535–6539, 2019.' ista: 'Petit YK, Leypold C, Mahne N, Mourad E, Schafzahl L, Slugovc C, Borisov SM, Freunberger SA. 2019. DABCOnium: An efficient and high-voltage stable singlet oxygen quencher for metal-O2 cells. Angewandte Chemie International Edition. 58(20), 6535–6539.' mla: 'Petit, Yann K., et al. “DABCOnium: An Efficient and High-Voltage Stable Singlet Oxygen Quencher for Metal-O2 Cells.” Angewandte Chemie International Edition, vol. 58, no. 20, Wiley, 2019, pp. 6535–39, doi:10.1002/anie.201901869.' short: Y.K. Petit, C. Leypold, N. Mahne, E. Mourad, L. Schafzahl, C. Slugovc, S.M. Borisov, S.A. Freunberger, Angewandte Chemie International Edition 58 (2019) 6535–6539. date_created: 2020-01-15T07:19:27Z date_published: 2019-05-13T00:00:00Z date_updated: 2021-01-12T08:12:42Z day: '13' ddc: - '540' doi: 10.1002/anie.201901869 extern: '1' file: - access_level: open_access checksum: 9620b6a511a910d7abe1f26c42dc7f83 content_type: application/pdf creator: dernst date_created: 2020-01-22T16:16:54Z date_updated: 2020-07-14T12:47:55Z file_id: '7356' file_name: 2019_AngewChemie_Petit.pdf file_size: 952737 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 58' issue: '20' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 6535-6539 publication: Angewandte Chemie International Edition publication_identifier: issn: - 1433-7851 publication_status: published publisher: Wiley quality_controlled: '1' status: public title: 'DABCOnium: An efficient and high-voltage stable singlet oxygen quencher for metal-O2 cells' tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 58 year: '2019' ... --- _id: '7281' abstract: - lang: eng text: Li–O2 batteries are plagued by side reactions that cause poor rechargeability and efficiency. These reactions were recently revealed to be predominantly caused by singlet oxygen, which can be neutralized by chemical traps or physical quenchers. However, traps are irreversibly consumed and thus only active for a limited time, and so far identified quenchers lack oxidative stability to be suitable for typically required recharge potentials. Thus, reducing the charge potential within the stability limit of the quencher and/or finding more stable quenchers is required. Here, we show that dimethylphenazine as a redox mediator decreases the charge potential well within the stability limit of the quencher 1,4-diazabicyclo[2.2.2]octane. The quencher can thus mitigate the parasitic reactions without being oxidatively decomposed. At the same time the quencher protects the redox mediator from singlet oxygen attack. The mutual conservation of the redox mediator and the quencher is rational for stable and effective Li–O2 batteries. article_processing_charge: No article_type: original author: - first_name: Won-Jin full_name: Kwak, Won-Jin last_name: Kwak - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 - first_name: Hun full_name: Kim, Hun last_name: Kim - first_name: Jiwon full_name: Park, Jiwon last_name: Park - first_name: Trung Thien full_name: Nguyen, Trung Thien last_name: Nguyen - first_name: Hun-Gi full_name: Jung, Hun-Gi last_name: Jung - first_name: Hye Ryung full_name: Byon, Hye Ryung last_name: Byon - first_name: Yang-Kook full_name: Sun, Yang-Kook last_name: Sun citation: ama: Kwak W-J, Freunberger SA, Kim H, et al. Mutual conservation of redox mediator and singlet oxygen quencher in Lithium–Oxygen batteries. ACS Catalysis. 2019;9(11):9914-9922. doi:10.1021/acscatal.9b01337 apa: Kwak, W.-J., Freunberger, S. A., Kim, H., Park, J., Nguyen, T. T., Jung, H.-G., … Sun, Y.-K. (2019). Mutual conservation of redox mediator and singlet oxygen quencher in Lithium–Oxygen batteries. ACS Catalysis. ACS. https://doi.org/10.1021/acscatal.9b01337 chicago: Kwak, Won-Jin, Stefan Alexander Freunberger, Hun Kim, Jiwon Park, Trung Thien Nguyen, Hun-Gi Jung, Hye Ryung Byon, and Yang-Kook Sun. “Mutual Conservation of Redox Mediator and Singlet Oxygen Quencher in Lithium–Oxygen Batteries.” ACS Catalysis. ACS, 2019. https://doi.org/10.1021/acscatal.9b01337. ieee: W.-J. Kwak et al., “Mutual conservation of redox mediator and singlet oxygen quencher in Lithium–Oxygen batteries,” ACS Catalysis, vol. 9, no. 11. ACS, pp. 9914–9922, 2019. ista: Kwak W-J, Freunberger SA, Kim H, Park J, Nguyen TT, Jung H-G, Byon HR, Sun Y-K. 2019. Mutual conservation of redox mediator and singlet oxygen quencher in Lithium–Oxygen batteries. ACS Catalysis. 9(11), 9914–9922. mla: Kwak, Won-Jin, et al. “Mutual Conservation of Redox Mediator and Singlet Oxygen Quencher in Lithium–Oxygen Batteries.” ACS Catalysis, vol. 9, no. 11, ACS, 2019, pp. 9914–22, doi:10.1021/acscatal.9b01337. short: W.-J. Kwak, S.A. Freunberger, H. Kim, J. Park, T.T. Nguyen, H.-G. Jung, H.R. Byon, Y.-K. Sun, ACS Catalysis 9 (2019) 9914–9922. date_created: 2020-01-15T12:12:40Z date_published: 2019-11-01T00:00:00Z date_updated: 2021-01-12T08:12:44Z day: '01' ddc: - '540' doi: 10.1021/acscatal.9b01337 extern: '1' file: - access_level: open_access checksum: bbaebfe5ff0bcab6235821ba3460b7de content_type: application/pdf creator: sfreunbe date_created: 2020-06-29T15:19:30Z date_updated: 2020-07-14T12:47:55Z file_id: '8053' file_name: Revised Manuscript.pdf file_size: 1199086 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 9' issue: '11' language: - iso: eng month: '11' oa: 1 oa_version: Submitted Version page: 9914-9922 publication: ACS Catalysis publication_identifier: issn: - 2155-5435 publication_status: published publisher: ACS quality_controlled: '1' status: public title: Mutual conservation of redox mediator and singlet oxygen quencher in Lithium–Oxygen batteries type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2019' ... --- _id: '7282' abstract: - lang: eng text: Interphases that form on the anode surface of lithium-ion batteries are critical for performance and lifetime, but are poorly understood. Now, a decade-old misconception regarding a main component of the interphase has been revealed, which could potentially lead to improved devices. article_processing_charge: No article_type: letter_note author: - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 citation: ama: Freunberger SA. Interphase identity crisis. Nature Chemistry. 2019;11(9):761-763. doi:10.1038/s41557-019-0311-0 apa: Freunberger, S. A. (2019). Interphase identity crisis. Nature Chemistry. Springer Nature. https://doi.org/10.1038/s41557-019-0311-0 chicago: Freunberger, Stefan Alexander. “Interphase Identity Crisis.” Nature Chemistry. Springer Nature, 2019. https://doi.org/10.1038/s41557-019-0311-0. ieee: S. A. Freunberger, “Interphase identity crisis,” Nature Chemistry, vol. 11, no. 9. Springer Nature, pp. 761–763, 2019. ista: Freunberger SA. 2019. Interphase identity crisis. Nature Chemistry. 11(9), 761–763. mla: Freunberger, Stefan Alexander. “Interphase Identity Crisis.” Nature Chemistry, vol. 11, no. 9, Springer Nature, 2019, pp. 761–63, doi:10.1038/s41557-019-0311-0. short: S.A. Freunberger, Nature Chemistry 11 (2019) 761–763. date_created: 2020-01-15T12:12:53Z date_published: 2019-08-19T00:00:00Z date_updated: 2021-01-12T08:12:44Z day: '19' ddc: - '540' - '547' doi: 10.1038/s41557-019-0311-0 extern: '1' file: - access_level: open_access checksum: 76806cff3d5b62f846499a8617cee7ef content_type: application/pdf creator: sfreunbe date_created: 2020-06-29T15:38:21Z date_updated: 2020-07-14T12:47:55Z file_id: '8054' file_name: Freunberger on Eichhorn.pdf file_size: 286805 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 11' issue: '9' language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version page: 761-763 publication: Nature Chemistry publication_identifier: issn: - 1755-4330 - 1755-4349 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Interphase identity crisis type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2019' ... --- _id: '7283' abstract: - lang: eng text: Potassium–air batteries, which suffer from oxygen cathode and potassium metal anode degradation, can be cycled thousands of times when an organic anode replaces the metal. article_processing_charge: No article_type: letter_note author: - first_name: Yann K. full_name: Petit, Yann K. last_name: Petit - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 citation: ama: Petit YK, Freunberger SA. Thousands of cycles. Nature Materials. 2019;18(4):301-302. doi:10.1038/s41563-019-0313-8 apa: Petit, Y. K., & Freunberger, S. A. (2019). Thousands of cycles. Nature Materials. Springer Nature. https://doi.org/10.1038/s41563-019-0313-8 chicago: Petit, Yann K., and Stefan Alexander Freunberger. “Thousands of Cycles.” Nature Materials. Springer Nature, 2019. https://doi.org/10.1038/s41563-019-0313-8. ieee: Y. K. Petit and S. A. Freunberger, “Thousands of cycles,” Nature Materials, vol. 18, no. 4. Springer Nature, pp. 301–302, 2019. ista: Petit YK, Freunberger SA. 2019. Thousands of cycles. Nature Materials. 18(4), 301–302. mla: Petit, Yann K., and Stefan Alexander Freunberger. “Thousands of Cycles.” Nature Materials, vol. 18, no. 4, Springer Nature, 2019, pp. 301–02, doi:10.1038/s41563-019-0313-8. short: Y.K. Petit, S.A. Freunberger, Nature Materials 18 (2019) 301–302. date_created: 2020-01-15T12:13:05Z date_published: 2019-03-20T00:00:00Z date_updated: 2021-01-12T08:12:45Z day: '20' ddc: - '540' - '541' doi: 10.1038/s41563-019-0313-8 extern: '1' file: - access_level: open_access checksum: 4c9a0314327028a22dd902bc109b8798 content_type: application/pdf creator: sfreunbe date_created: 2020-06-29T16:26:54Z date_updated: 2020-07-14T12:47:55Z file_id: '8059' file_name: NaV_final.pdf file_size: 398123 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 18' issue: '4' language: - iso: eng month: '03' oa: 1 oa_version: Submitted Version page: 301-302 publication: Nature Materials publication_identifier: issn: - 1476-1122 - 1476-4660 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Thousands of cycles type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 18 year: '2019' ...