[{"year":"2019","publication_identifier":{"isbn":["978-1-4503-6705-9"],"issn":["0737-8017"]},"oa":1,"title":"Distributed edge connectivity in sublinear time","article_processing_charge":"No","conference":{"end_date":"2019-06-26","start_date":"2019-06-23","location":"Phoenix, AZ, United States","name":"STOC: Symposium on Theory of Computing"},"_id":"11865","date_updated":"2023-02-17T10:26:25Z","external_id":{"arxiv":["1904.04341"]},"date_published":"2019-06-01T00:00:00Z","day":"01","extern":"1","status":"public","author":[{"last_name":"Daga","full_name":"Daga, Mohit","first_name":"Mohit"},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"},{"last_name":"Saranurak","first_name":"Thatchaphol","full_name":"Saranurak, Thatchaphol"}],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2022-08-16T09:11:17Z","doi":"10.1145/3313276.3316346","month":"06","page":"343–354","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.04341"}],"type":"conference","language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"publication":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","scopus_import":"1","publisher":"Association for Computing Machinery","citation":{"ama":"Daga M, Henzinger MH, Nanongkai D, Saranurak T. Distributed edge connectivity in sublinear time. In: <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i>. Association for Computing Machinery; 2019:343–354. doi:<a href=\"https://doi.org/10.1145/3313276.3316346\">10.1145/3313276.3316346</a>","apa":"Daga, M., Henzinger, M. H., Nanongkai, D., &#38; Saranurak, T. (2019). Distributed edge connectivity in sublinear time. In <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i> (pp. 343–354). Phoenix, AZ, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3313276.3316346\">https://doi.org/10.1145/3313276.3316346</a>","chicago":"Daga, Mohit, Monika H Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak. “Distributed Edge Connectivity in Sublinear Time.” In <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i>, 343–354. Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3313276.3316346\">https://doi.org/10.1145/3313276.3316346</a>.","ieee":"M. Daga, M. H. Henzinger, D. Nanongkai, and T. Saranurak, “Distributed edge connectivity in sublinear time,” in <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i>, 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.","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.","mla":"Daga, Mohit, et al. “Distributed Edge Connectivity in Sublinear Time.” <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i>, Association for Computing Machinery, 2019, pp. 343–354, doi:<a href=\"https://doi.org/10.1145/3313276.3316346\">10.1145/3313276.3316346</a>."},"quality_controlled":"1","publication_status":"published"},{"abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"publisher":"Society for Industrial and Applied Mathematics","publication":"30th Annual ACM-SIAM Symposium on Discrete Algorithms","scopus_import":"1","quality_controlled":"1","citation":{"mla":"Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2019, pp. 1899–918, doi:<a href=\"https://doi.org/10.1137/1.9781611975482.115\">10.1137/1.9781611975482.115</a>.","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.","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.","ieee":"A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” in <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, San Diego, CA, United States, 2019, pp. 1899–1918.","apa":"Bernstein, A., Forster, S., &#38; Henzinger, M. H. (2019). A deamortization approach for dynamic spanner and dynamic maximal matching. In <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1899–1918). San Diego, CA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611975482.115\">https://doi.org/10.1137/1.9781611975482.115</a>","chicago":"Bernstein, Aaron, Sebastian Forster, and Monika H Henzinger. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” In <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1899–1918. Society for Industrial and Applied Mathematics, 2019. <a href=\"https://doi.org/10.1137/1.9781611975482.115\">https://doi.org/10.1137/1.9781611975482.115</a>.","ama":"Bernstein A, Forster S, Henzinger MH. A deamortization approach for dynamic spanner and dynamic maximal matching. In: <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2019:1899-1918. doi:<a href=\"https://doi.org/10.1137/1.9781611975482.115\">10.1137/1.9781611975482.115</a>"},"publication_status":"published","month":"01","page":"1899-1918","main_file_link":[{"url":"https://arxiv.org/abs/1810.10932","open_access":"1"}],"arxiv":1,"type":"conference","external_id":{"arxiv":["1810.10932"]},"day":"01","date_published":"2019-01-01T00:00:00Z","oa_version":"Preprint","author":[{"full_name":"Bernstein, Aaron","first_name":"Aaron","last_name":"Bernstein"},{"full_name":"Forster, Sebastian","first_name":"Sebastian","last_name":"Forster"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H"}],"status":"public","extern":"1","doi":"10.1137/1.9781611975482.115","date_created":"2022-08-16T09:50:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2019","oa":1,"publication_identifier":{"eisbn":["978-1-61197-548-2"]},"article_processing_charge":"No","title":"A deamortization approach for dynamic spanner and dynamic maximal matching","date_updated":"2023-02-21T16:31:21Z","_id":"11871","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"San Diego, CA, United States","start_date":"2019-01-06","end_date":"2019-01-09"},"related_material":{"record":[{"status":"public","id":"11871","relation":"earlier_version"}]}},{"article_type":"original","publication_status":"published","citation":{"short":"S. Bhattacharya, M.H. Henzinger, S. Neumann, Theoretical Computer Science 779 (2019) 72–87.","mla":"Bhattacharya, Sayan, et al. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” <i>Theoretical Computer Science</i>, vol. 779, Elsevier, 2019, pp. 72–87, doi:<a href=\"https://doi.org/10.1016/j.tcs.2019.01.043\">10.1016/j.tcs.2019.01.043</a>.","ista":"Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 779, 72–87.","ieee":"S. Bhattacharya, M. H. Henzinger, and S. Neumann, “New amortized cell-probe lower bounds for dynamic problems,” <i>Theoretical Computer Science</i>, vol. 779. Elsevier, pp. 72–87, 2019.","apa":"Bhattacharya, S., Henzinger, M. H., &#38; Neumann, S. (2019). New amortized cell-probe lower bounds for dynamic problems. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2019.01.043\">https://doi.org/10.1016/j.tcs.2019.01.043</a>","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Stefan Neumann. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” <i>Theoretical Computer Science</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.tcs.2019.01.043\">https://doi.org/10.1016/j.tcs.2019.01.043</a>.","ama":"Bhattacharya S, Henzinger MH, Neumann S. New amortized cell-probe lower bounds for dynamic problems. <i>Theoretical Computer Science</i>. 2019;779:72-87. doi:<a href=\"https://doi.org/10.1016/j.tcs.2019.01.043\">10.1016/j.tcs.2019.01.043</a>"},"quality_controlled":"1","publisher":"Elsevier","publication":"Theoretical Computer Science","scopus_import":"1","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"type":"journal_article","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1902.02304","open_access":"1"}],"page":"72-87","intvolume":"       779","month":"08","doi":"10.1016/j.tcs.2019.01.043","volume":779,"date_created":"2022-08-17T09:02:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","extern":"1","author":[{"first_name":"Sayan","full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Neumann","first_name":"Stefan","full_name":"Neumann, Stefan"}],"status":"public","day":"02","date_published":"2019-08-02T00:00:00Z","external_id":{"arxiv":["1902.02304"]},"_id":"11898","date_updated":"2022-09-09T11:29:04Z","title":"New amortized cell-probe lower bounds for dynamic problems","article_processing_charge":"No","oa":1,"publication_identifier":{"issn":["0304-3975"]},"year":"2019"},{"type":"journal_article","page":"9575-9580","issue":"28","intvolume":"        58","month":"07","article_type":"letter_note","publication_status":"published","quality_controlled":"1","citation":{"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.","mla":"Pieber, Bartholomäus, et al. “Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.” <i>Angewandte Chemie International Edition</i>, vol. 58, no. 28, Wiley, 2019, pp. 9575–80, doi:<a href=\"https://doi.org/10.1002/anie.201902785\">10.1002/anie.201902785</a>.","ieee":"B. Pieber <i>et al.</i>, “Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides,” <i>Angewandte Chemie International Edition</i>, 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.","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. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201902785\">https://doi.org/10.1002/anie.201902785</a>","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.” <i>Angewandte Chemie International Edition</i>. Wiley, 2019. <a href=\"https://doi.org/10.1002/anie.201902785\">https://doi.org/10.1002/anie.201902785</a>.","ama":"Pieber B, Malik JA, Cavedon C, et al. Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. <i>Angewandte Chemie International Edition</i>. 2019;58(28):9575-9580. doi:<a href=\"https://doi.org/10.1002/anie.201902785\">10.1002/anie.201902785</a>"},"publisher":"Wiley","publication":"Angewandte Chemie International Edition","scopus_import":"1","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."}],"language":[{"iso":"eng"}],"date_updated":"2023-02-21T10:09:16Z","_id":"11957","article_processing_charge":"No","title":"Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides","publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"year":"2019","pmid":1,"doi":"10.1002/anie.201902785","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2022-08-24T10:50:19Z","volume":58,"oa_version":"None","status":"public","author":[{"full_name":"Pieber, Bartholomäus","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber"},{"first_name":"Jamal A.","full_name":"Malik, Jamal A.","last_name":"Malik"},{"full_name":"Cavedon, Cristian","first_name":"Cristian","last_name":"Cavedon"},{"first_name":"Sebastian","full_name":"Gisbertz, Sebastian","last_name":"Gisbertz"},{"full_name":"Savateev, Aleksandr","first_name":"Aleksandr","last_name":"Savateev"},{"first_name":"Daniel","full_name":"Cruz, Daniel","last_name":"Cruz"},{"first_name":"Tobias","full_name":"Heil, Tobias","last_name":"Heil"},{"last_name":"Zhang","full_name":"Zhang, Guigang","first_name":"Guigang"},{"last_name":"Seeberger","full_name":"Seeberger, Peter H.","first_name":"Peter H."}],"extern":"1","day":"08","date_published":"2019-07-08T00:00:00Z","external_id":{"pmid":["31050132"]}},{"language":[{"iso":"eng"}],"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."}],"publication":"Organic Letters","scopus_import":"1","publisher":"American Chemical Society","quality_controlled":"1","citation":{"ama":"Cavedon C, Madani A, Seeberger PH, Pieber B. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. <i>Organic Letters</i>. 2019;21(13):5331-5334. doi:<a href=\"https://doi.org/10.1021/acs.orglett.9b01957\">10.1021/acs.orglett.9b01957</a>","chicago":"Cavedon, Cristian, Amiera Madani, Peter H. Seeberger, and Bartholomäus Pieber. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” <i>Organic Letters</i>. American Chemical Society, 2019. <a href=\"https://doi.org/10.1021/acs.orglett.9b01957\">https://doi.org/10.1021/acs.orglett.9b01957</a>.","apa":"Cavedon, C., Madani, A., Seeberger, P. H., &#38; Pieber, B. (2019). Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. <i>Organic Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.orglett.9b01957\">https://doi.org/10.1021/acs.orglett.9b01957</a>","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.","ieee":"C. Cavedon, A. Madani, P. H. Seeberger, and B. Pieber, “Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides,” <i>Organic Letters</i>, vol. 21, no. 13. American Chemical Society, pp. 5331–5334, 2019.","mla":"Cavedon, Cristian, et al. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” <i>Organic Letters</i>, vol. 21, no. 13, American Chemical Society, 2019, pp. 5331–34, doi:<a href=\"https://doi.org/10.1021/acs.orglett.9b01957\">10.1021/acs.orglett.9b01957</a>.","short":"C. Cavedon, A. Madani, P.H. Seeberger, B. Pieber, Organic Letters 21 (2019) 5331–5334."},"publication_status":"published","article_type":"letter_note","month":"07","intvolume":"        21","issue":"13","page":"5331-5334","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.orglett.9b01957"}],"type":"journal_article","external_id":{"pmid":["31247752"]},"date_published":"2019-07-05T00:00:00Z","day":"05","author":[{"last_name":"Cavedon","full_name":"Cavedon, Cristian","first_name":"Cristian"},{"last_name":"Madani","full_name":"Madani, Amiera","first_name":"Amiera"},{"full_name":"Seeberger, Peter H.","first_name":"Peter H.","last_name":"Seeberger"},{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","full_name":"Pieber, Bartholomäus","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X"}],"status":"public","extern":"1","oa_version":"Published Version","date_created":"2022-08-25T11:18:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":21,"pmid":1,"doi":"10.1021/acs.orglett.9b01957","year":"2019","publication_identifier":{"issn":["1523-7060"],"eissn":["1523-7052"]},"oa":1,"title":"Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides","article_processing_charge":"No","date_updated":"2023-02-21T10:10:19Z","_id":"11982"},{"citation":{"ama":"Guberman M, Pieber B, Seeberger PH. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. <i>Organic Process Research and Development</i>. 2019;23(12):2764-2770. doi:<a href=\"https://doi.org/10.1021/acs.oprd.9b00456\">10.1021/acs.oprd.9b00456</a>","chicago":"Guberman, Mónica, Bartholomäus Pieber, and Peter H. Seeberger. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” <i>Organic Process Research and Development</i>. American Chemical Society, 2019. <a href=\"https://doi.org/10.1021/acs.oprd.9b00456\">https://doi.org/10.1021/acs.oprd.9b00456</a>.","apa":"Guberman, M., Pieber, B., &#38; Seeberger, P. H. (2019). Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. <i>Organic Process Research and Development</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.oprd.9b00456\">https://doi.org/10.1021/acs.oprd.9b00456</a>","ieee":"M. Guberman, B. Pieber, and P. H. Seeberger, “Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks,” <i>Organic Process Research and Development</i>, 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.","short":"M. Guberman, B. Pieber, P.H. Seeberger, Organic Process Research and Development 23 (2019) 2764–2770.","mla":"Guberman, Mónica, et al. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” <i>Organic Process Research and Development</i>, vol. 23, no. 12, American Chemical Society, 2019, pp. 2764–70, doi:<a href=\"https://doi.org/10.1021/acs.oprd.9b00456\">10.1021/acs.oprd.9b00456</a>."},"quality_controlled":"1","article_type":"letter_note","publication_status":"published","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."}],"language":[{"iso":"eng"}],"publisher":"American Chemical Society","scopus_import":"1","publication":"Organic Process Research and Development","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.oprd.9b00456"}],"type":"journal_article","intvolume":"        23","month":"12","page":"2764-2770","issue":"12","oa_version":"Published Version","extern":"1","author":[{"last_name":"Guberman","full_name":"Guberman, Mónica","first_name":"Mónica"},{"last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","full_name":"Pieber, Bartholomäus"},{"last_name":"Seeberger","first_name":"Peter H.","full_name":"Seeberger, Peter H."}],"status":"public","doi":"10.1021/acs.oprd.9b00456","volume":23,"date_created":"2022-08-25T11:30:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"20","date_published":"2019-12-20T00:00:00Z","title":"Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks","article_processing_charge":"No","_id":"11984","date_updated":"2023-02-21T10:10:23Z","year":"2019","oa":1,"publication_identifier":{"issn":["1083-6160"],"eissn":["1520-586X"]}},{"type":"journal_article","ddc":["570"],"ec_funded":1,"page":"12-26","issue":"1","intvolume":"       149","isi":1,"month":"04","article_type":"review","license":"https://creativecommons.org/licenses/by/4.0/","publication_status":"published","citation":{"chicago":"Amberg, Nicole, Susanne Laukoter, and Simon Hippenmeyer. “Epigenetic Cues Modulating the Generation of Cell Type Diversity in the Cerebral Cortex.” <i>Journal of Neurochemistry</i>. Wiley, 2019. <a href=\"https://doi.org/10.1111/jnc.14601\">https://doi.org/10.1111/jnc.14601</a>.","apa":"Amberg, N., Laukoter, S., &#38; Hippenmeyer, S. (2019). Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. <i>Journal of Neurochemistry</i>. Wiley. <a href=\"https://doi.org/10.1111/jnc.14601\">https://doi.org/10.1111/jnc.14601</a>","ama":"Amberg N, Laukoter S, Hippenmeyer S. Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. <i>Journal of Neurochemistry</i>. 2019;149(1):12-26. doi:<a href=\"https://doi.org/10.1111/jnc.14601\">10.1111/jnc.14601</a>","mla":"Amberg, Nicole, et al. “Epigenetic Cues Modulating the Generation of Cell Type Diversity in the Cerebral Cortex.” <i>Journal of Neurochemistry</i>, vol. 149, no. 1, Wiley, 2019, pp. 12–26, doi:<a href=\"https://doi.org/10.1111/jnc.14601\">10.1111/jnc.14601</a>.","short":"N. Amberg, S. Laukoter, S. Hippenmeyer, Journal of Neurochemistry 149 (2019) 12–26.","ista":"Amberg N, Laukoter S, Hippenmeyer S. 2019. Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. Journal of Neurochemistry. 149(1), 12–26.","ieee":"N. Amberg, S. Laukoter, and S. Hippenmeyer, “Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex,” <i>Journal of Neurochemistry</i>, vol. 149, no. 1. Wiley, pp. 12–26, 2019."},"quality_controlled":"1","publisher":"Wiley","scopus_import":"1","file":[{"file_size":889709,"date_created":"2020-01-07T13:35:52Z","date_updated":"2020-07-14T12:45:45Z","file_name":"2019_Wiley_Amberg.pdf","relation":"main_file","file_id":"7239","content_type":"application/pdf","checksum":"db027721a95d36f5de36aadcd0bdf7e6","access_level":"open_access","creator":"kschuh"}],"publication":"Journal of Neurochemistry","file_date_updated":"2020-07-14T12:45:45Z","abstract":[{"text":"The cerebral cortex is composed of a large variety of distinct cell-types including projection neurons, interneurons and glial cells which emerge from distinct neural stem cell (NSC) lineages. The vast majority of cortical projection neurons and certain classes of glial cells are generated by radial glial progenitor cells (RGPs) in a highly orchestrated manner. Recent studies employing single cell analysis and clonal lineage tracing suggest that NSC and RGP lineage progression are regulated in a profound deterministic manner. In this review we focus on recent advances based mainly on correlative phenotypic data emerging from functional genetic studies in mice. We establish hypotheses to test in future research and outline a conceptual framework how epigenetic cues modulate the generation of cell-type diversity during cortical development. This article is protected by copyright. All rights reserved.","lang":"eng"}],"language":[{"iso":"eng"}],"department":[{"_id":"SiHi"}],"_id":"27","date_updated":"2023-09-11T13:40:26Z","title":"Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex","article_processing_charge":"Yes (via OA deal)","oa":1,"project":[{"grant_number":"LS13-002","_id":"25D92700-B435-11E9-9278-68D0E5697425","name":"Mapping Cell-Type Specificity of the Genomic Imprintome in the Brain"},{"_id":"25D7962E-B435-11E9-9278-68D0E5697425","name":"Quantitative Structure-Function Analysis of Cerebral Cortex Assembly at Clonal Level","grant_number":"RGP0053/2014"},{"name":"Molecular Mechanisms of Cerebral Cortex Development","_id":"25D61E48-B435-11E9-9278-68D0E5697425","grant_number":"618444","call_identifier":"FP7"},{"_id":"260018B0-B435-11E9-9278-68D0E5697425","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","call_identifier":"H2020","grant_number":"725780"}],"year":"2019","acknowledgement":" This work was supported by IST Austria institutional funds; NÖ Forschung und Bildung \r\nn[f+b]   (C13-002)   to   SH;   a   program   grant   from   the   Human   Frontiers   Science   Program (RGP0053/2014)  to SH;  the  People  Programme  (Marie  Curie  Actions)  of  the  European  Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement No 618444 to SH, and the  European  Research  Council  (ERC)  under  the  European  Union’s  Horizon  2020  research  and innovation programme (grant agreement No 725780 LinPro)to SH.\r\n","has_accepted_license":"1","doi":"10.1111/jnc.14601","volume":149,"date_created":"2018-12-11T11:44:14Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","author":[{"last_name":"Amberg","id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3183-8207","first_name":"Nicole","full_name":"Amberg, Nicole"},{"first_name":"Susanne","full_name":"Laukoter, Susanne","orcid":"0000-0002-7903-3010","id":"2D6B7A9A-F248-11E8-B48F-1D18A9856A87","last_name":"Laukoter"},{"first_name":"Simon","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer"}],"day":"01","date_published":"2019-04-01T00:00:00Z","external_id":{"isi":["000462680200002"]}},{"publication_status":"published","article_type":"original","citation":{"ama":"Gerencser M, Gyöngy I. A Feynman–Kac formula for stochastic Dirichlet problems. <i>Stochastic Processes and their Applications</i>. 2019;129(3):995-1012. doi:<a href=\"https://doi.org/10.1016/j.spa.2018.04.003\">10.1016/j.spa.2018.04.003</a>","apa":"Gerencser, M., &#38; Gyöngy, I. (2019). A Feynman–Kac formula for stochastic Dirichlet problems. <i>Stochastic Processes and Their Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.spa.2018.04.003\">https://doi.org/10.1016/j.spa.2018.04.003</a>","chicago":"Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic Dirichlet Problems.” <i>Stochastic Processes and Their Applications</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.spa.2018.04.003\">https://doi.org/10.1016/j.spa.2018.04.003</a>.","ieee":"M. Gerencser and I. Gyöngy, “A Feynman–Kac formula for stochastic Dirichlet problems,” <i>Stochastic Processes and their Applications</i>, vol. 129, no. 3. Elsevier, pp. 995–1012, 2019.","ista":"Gerencser M, Gyöngy I. 2019. A Feynman–Kac formula for stochastic Dirichlet problems. Stochastic Processes and their Applications. 129(3), 995–1012.","short":"M. Gerencser, I. Gyöngy, Stochastic Processes and Their Applications 129 (2019) 995–1012.","mla":"Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic Dirichlet Problems.” <i>Stochastic Processes and Their Applications</i>, vol. 129, no. 3, Elsevier, 2019, pp. 995–1012, doi:<a href=\"https://doi.org/10.1016/j.spa.2018.04.003\">10.1016/j.spa.2018.04.003</a>."},"quality_controlled":"1","publication":"Stochastic Processes and their Applications","scopus_import":"1","publisher":"Elsevier","department":[{"_id":"JaMa"}],"language":[{"iso":"eng"}],"abstract":[{"text":"A representation formula for solutions of stochastic partial differential equations with Dirichlet boundary conditions is proved. The scope of our setting is wide enough to cover the general situation when the backward characteristics that appear in the usual formulation are not even defined in the Itô sense.","lang":"eng"}],"type":"journal_article","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.04177"}],"issue":"3","page":"995-1012","isi":1,"month":"03","intvolume":"       129","volume":129,"date_created":"2018-12-11T11:45:42Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1016/j.spa.2018.04.003","status":"public","author":[{"full_name":"Gerencser, Mate","first_name":"Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","last_name":"Gerencser"},{"last_name":"Gyöngy","full_name":"Gyöngy, István","first_name":"István"}],"oa_version":"Preprint","date_published":"2019-03-01T00:00:00Z","day":"01","external_id":{"isi":["000458945300012"],"arxiv":["1611.04177"]},"_id":"301","date_updated":"2023-08-24T14:20:49Z","title":"A Feynman–Kac formula for stochastic Dirichlet problems","article_processing_charge":"No","oa":1,"year":"2019"},{"title":"Singular SPDEs in domains with boundaries","article_processing_charge":"Yes (via OA deal)","date_updated":"2023-08-24T14:38:32Z","_id":"319","has_accepted_license":"1","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"year":"2019","acknowledgement":"MG thanks the support of the LMS Postdoctoral Mobility Grant.\r\n\r\n","publication_identifier":{"eissn":["14322064"],"issn":["01788051"]},"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"first_name":"Mate","full_name":"Gerencser, Mate","last_name":"Gerencser","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hairer","first_name":"Martin","full_name":"Hairer, Martin"}],"status":"public","oa_version":"Published Version","date_created":"2018-12-11T11:45:48Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":173,"doi":"10.1007/s00440-018-0841-1","external_id":{"isi":["000463613800001"]},"date_published":"2019-04-01T00:00:00Z","day":"01","ddc":["510"],"type":"journal_article","isi":1,"month":"04","intvolume":"       173","issue":"3-4","page":"697–758","quality_controlled":"1","citation":{"ieee":"M. Gerencser and M. Hairer, “Singular SPDEs in domains with boundaries,” <i>Probability Theory and Related Fields</i>, vol. 173, no. 3–4. Springer, pp. 697–758, 2019.","ista":"Gerencser M, Hairer M. 2019. Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. 173(3–4), 697–758.","short":"M. Gerencser, M. Hairer, Probability Theory and Related Fields 173 (2019) 697–758.","mla":"Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.” <i>Probability Theory and Related Fields</i>, vol. 173, no. 3–4, Springer, 2019, pp. 697–758, doi:<a href=\"https://doi.org/10.1007/s00440-018-0841-1\">10.1007/s00440-018-0841-1</a>.","ama":"Gerencser M, Hairer M. Singular SPDEs in domains with boundaries. <i>Probability Theory and Related Fields</i>. 2019;173(3-4):697–758. doi:<a href=\"https://doi.org/10.1007/s00440-018-0841-1\">10.1007/s00440-018-0841-1</a>","chicago":"Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.” <i>Probability Theory and Related Fields</i>. Springer, 2019. <a href=\"https://doi.org/10.1007/s00440-018-0841-1\">https://doi.org/10.1007/s00440-018-0841-1</a>.","apa":"Gerencser, M., &#38; Hairer, M. (2019). Singular SPDEs in domains with boundaries. <i>Probability Theory and Related Fields</i>. Springer. <a href=\"https://doi.org/10.1007/s00440-018-0841-1\">https://doi.org/10.1007/s00440-018-0841-1</a>"},"publication_status":"published","article_type":"original","publist_id":"7546","language":[{"iso":"eng"}],"department":[{"_id":"JaMa"}],"abstract":[{"lang":"eng","text":"We study spaces of modelled distributions with singular behaviour near the boundary of a domain that, in the context of the theory of regularity structures, allow one to give robust solution theories for singular stochastic PDEs with boundary conditions. The calculus of modelled distributions established in Hairer (Invent Math 198(2):269–504, 2014. https://doi.org/10.1007/s00222-014-0505-4) is extended to this setting. We formulate and solve fixed point problems in these spaces with a class of kernels that is sufficiently large to cover in particular the Dirichlet and Neumann heat kernels. These results are then used to provide solution theories for the KPZ equation with Dirichlet and Neumann boundary conditions and for the 2D generalised parabolic Anderson model with Dirichlet boundary conditions. In the case of the KPZ equation with Neumann boundary conditions, we show that, depending on the class of mollifiers one considers, a “boundary renormalisation” takes place. In other words, there are situations in which a certain boundary condition is applied to an approximation to the KPZ equation, but the limiting process is the Hopf–Cole solution to the KPZ equation with a different boundary condition."}],"file_date_updated":"2020-07-14T12:46:03Z","file":[{"file_name":"2018_ProbTheory_Gerencser.pdf","date_updated":"2020-07-14T12:46:03Z","date_created":"2018-12-17T16:25:24Z","file_size":893182,"relation":"main_file","file_id":"5722","creator":"dernst","access_level":"open_access","content_type":"application/pdf","checksum":"288d16ef7291242f485a9660979486e3"}],"scopus_import":"1","publication":"Probability Theory and Related Fields","publisher":"Springer"},{"publication":"Linear Algebra and Its Applications","scopus_import":"1","publisher":"Elsevier","department":[{"_id":"LaEr"}],"publist_id":"7424","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We investigate the quantum Jensen divergences from the viewpoint of joint convexity. It turns out that the set of the functions which generate jointly convex quantum Jensen divergences on positive matrices coincides with the Matrix Entropy Class which has been introduced by Chen and Tropp quite recently."}],"publication_status":"published","article_type":"original","citation":{"ama":"Virosztek D. Jointly convex quantum Jensen divergences. <i>Linear Algebra and Its Applications</i>. 2019;576:67-78. doi:<a href=\"https://doi.org/10.1016/j.laa.2018.03.002\">10.1016/j.laa.2018.03.002</a>","apa":"Virosztek, D. (2019). Jointly convex quantum Jensen divergences. <i>Linear Algebra and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.laa.2018.03.002\">https://doi.org/10.1016/j.laa.2018.03.002</a>","chicago":"Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” <i>Linear Algebra and Its Applications</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.laa.2018.03.002\">https://doi.org/10.1016/j.laa.2018.03.002</a>.","ista":"Virosztek D. 2019. Jointly convex quantum Jensen divergences. Linear Algebra and Its Applications. 576, 67–78.","ieee":"D. Virosztek, “Jointly convex quantum Jensen divergences,” <i>Linear Algebra and Its Applications</i>, vol. 576. Elsevier, pp. 67–78, 2019.","mla":"Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” <i>Linear Algebra and Its Applications</i>, vol. 576, Elsevier, 2019, pp. 67–78, doi:<a href=\"https://doi.org/10.1016/j.laa.2018.03.002\">10.1016/j.laa.2018.03.002</a>.","short":"D. Virosztek, Linear Algebra and Its Applications 576 (2019) 67–78."},"quality_controlled":"1","ec_funded":1,"page":"67-78","isi":1,"month":"09","intvolume":"       576","type":"journal_article","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.05324"}],"date_published":"2019-09-01T00:00:00Z","day":"01","external_id":{"arxiv":["1712.05324"],"isi":["000470955300005"]},"volume":576,"date_created":"2018-12-11T11:46:17Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1016/j.laa.2018.03.002","author":[{"orcid":"0000-0003-1109-5511","first_name":"Daniel","full_name":"Virosztek, Daniel","last_name":"Virosztek","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87"}],"status":"public","oa_version":"Preprint","oa":1,"acknowledgement":"The author was supported by the ISTFELLOW program of the Institute of Science and Technology Austria (project code IC1027FELL01) and partially supported by the Hungarian National Research, Development and Innovation Office – NKFIH (grant no. K124152)","year":"2019","project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"_id":"405","date_updated":"2023-08-24T14:31:47Z","title":"Jointly convex quantum Jensen divergences","article_processing_charge":"No"},{"doi":"10.1007/s00440-018-0835-z","volume":173,"date_created":"2018-12-11T11:46:25Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"last_name":"Ajanki","id":"36F2FB7E-F248-11E8-B48F-1D18A9856A87","full_name":"Ajanki, Oskari H","first_name":"Oskari H"},{"full_name":"Erdös, László","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"first_name":"Torben H","full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87","last_name":"Krüger"}],"status":"public","day":"01","date_published":"2019-02-01T00:00:00Z","external_id":{"isi":["000459396500007"]},"_id":"429","date_updated":"2023-08-24T14:39:00Z","article_processing_charge":"Yes (via OA deal)","title":"Stability of the matrix Dyson equation and random matrices with correlations","oa":1,"publication_identifier":{"eissn":["14322064"],"issn":["01788051"]},"year":"2019","project":[{"name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","call_identifier":"FP7"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).\r\n","has_accepted_license":"1","article_type":"original","publication_status":"published","citation":{"apa":"Ajanki, O. H., Erdös, L., &#38; Krüger, T. H. (2019). Stability of the matrix Dyson equation and random matrices with correlations. <i>Probability Theory and Related Fields</i>. Springer. <a href=\"https://doi.org/10.1007/s00440-018-0835-z\">https://doi.org/10.1007/s00440-018-0835-z</a>","chicago":"Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Stability of the Matrix Dyson Equation and Random Matrices with Correlations.” <i>Probability Theory and Related Fields</i>. Springer, 2019. <a href=\"https://doi.org/10.1007/s00440-018-0835-z\">https://doi.org/10.1007/s00440-018-0835-z</a>.","ama":"Ajanki OH, Erdös L, Krüger TH. Stability of the matrix Dyson equation and random matrices with correlations. <i>Probability Theory and Related Fields</i>. 2019;173(1-2):293–373. doi:<a href=\"https://doi.org/10.1007/s00440-018-0835-z\">10.1007/s00440-018-0835-z</a>","mla":"Ajanki, Oskari H., et al. “Stability of the Matrix Dyson Equation and Random Matrices with Correlations.” <i>Probability Theory and Related Fields</i>, vol. 173, no. 1–2, Springer, 2019, pp. 293–373, doi:<a href=\"https://doi.org/10.1007/s00440-018-0835-z\">10.1007/s00440-018-0835-z</a>.","short":"O.H. Ajanki, L. Erdös, T.H. Krüger, Probability Theory and Related Fields 173 (2019) 293–373.","ista":"Ajanki OH, Erdös L, Krüger TH. 2019. Stability of the matrix Dyson equation and random matrices with correlations. Probability Theory and Related Fields. 173(1–2), 293–373.","ieee":"O. H. Ajanki, L. Erdös, and T. H. Krüger, “Stability of the matrix Dyson equation and random matrices with correlations,” <i>Probability Theory and Related Fields</i>, vol. 173, no. 1–2. Springer, pp. 293–373, 2019."},"quality_controlled":"1","publisher":"Springer","file_date_updated":"2020-07-14T12:46:26Z","file":[{"relation":"main_file","date_updated":"2020-07-14T12:46:26Z","file_name":"2018_ProbTheory_Ajanki.pdf","date_created":"2018-12-17T16:12:08Z","file_size":1201840,"access_level":"open_access","creator":"dernst","checksum":"f9354fa5c71f9edd17132588f0dc7d01","content_type":"application/pdf","file_id":"5720"}],"scopus_import":"1","publication":"Probability Theory and Related Fields","abstract":[{"text":"We consider real symmetric or complex hermitian random matrices with correlated entries. We prove local laws for the resolvent and universality of the local eigenvalue statistics in the bulk of the spectrum. The correlations have fast decay but are otherwise of general form. The key novelty is the detailed stability analysis of the corresponding matrix valued Dyson equation whose solution is the deterministic limit of the resolvent.","lang":"eng"}],"language":[{"iso":"eng"}],"publist_id":"7394","department":[{"_id":"LaEr"}],"type":"journal_article","ddc":["510"],"ec_funded":1,"page":"293–373","issue":"1-2","intvolume":"       173","isi":1,"month":"02"},{"external_id":{"isi":["000480413600002"],"arxiv":["1604.03382"]},"date_published":"2019-10-01T00:00:00Z","day":"01","status":"public","author":[{"full_name":"Hausel, Tamas","first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel"},{"full_name":"Mereb, Martin","first_name":"Martin","id":"43D735EE-F248-11E8-B48F-1D18A9856A87","last_name":"Mereb"},{"last_name":"Wong","full_name":"Wong, Michael","first_name":"Michael"}],"oa_version":"Preprint","date_created":"2018-12-11T11:46:29Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":21,"doi":"10.4171/JEMS/896","year":"2019","project":[{"name":"Arithmetic and physics of Higgs moduli spaces","_id":"25E549F4-B435-11E9-9278-68D0E5697425","grant_number":"320593","call_identifier":"FP7"}],"publication_identifier":{"eissn":["1435-9855"]},"oa":1,"article_processing_charge":"No","title":"Arithmetic and representation theory of wild character varieties","date_updated":"2023-08-24T14:24:49Z","_id":"439","publist_id":"7384","language":[{"iso":"eng"}],"department":[{"_id":"TaHa"}],"abstract":[{"text":"We count points over a finite field on wild character varieties,of Riemann surfaces for singularities with regular semisimple leading term. The new feature in our counting formulas is the appearance of characters of Yokonuma–Hecke algebras. Our result leads to the conjecture that the mixed Hodge polynomials of these character varieties agree with previously conjectured perverse Hodge polynomials of certain twisted parabolic Higgs moduli spaces, indicating the\r\npossibility of a P = W conjecture for a suitable wild Hitchin system.","lang":"eng"}],"publication":"Journal of the European Mathematical Society","scopus_import":"1","publisher":"European Mathematical Society","quality_controlled":"1","citation":{"ama":"Hausel T, Mereb M, Wong M. Arithmetic and representation theory of wild character varieties. <i>Journal of the European Mathematical Society</i>. 2019;21(10):2995-3052. doi:<a href=\"https://doi.org/10.4171/JEMS/896\">10.4171/JEMS/896</a>","chicago":"Hausel, Tamás, Martin Mereb, and Michael Wong. “Arithmetic and Representation Theory of Wild Character Varieties.” <i>Journal of the European Mathematical Society</i>. European Mathematical Society, 2019. <a href=\"https://doi.org/10.4171/JEMS/896\">https://doi.org/10.4171/JEMS/896</a>.","apa":"Hausel, T., Mereb, M., &#38; Wong, M. (2019). Arithmetic and representation theory of wild character varieties. <i>Journal of the European Mathematical Society</i>. European Mathematical Society. <a href=\"https://doi.org/10.4171/JEMS/896\">https://doi.org/10.4171/JEMS/896</a>","ieee":"T. Hausel, M. Mereb, and M. Wong, “Arithmetic and representation theory of wild character varieties,” <i>Journal of the European Mathematical Society</i>, vol. 21, no. 10. European Mathematical Society, pp. 2995–3052, 2019.","ista":"Hausel T, Mereb M, Wong M. 2019. Arithmetic and representation theory of wild character varieties. Journal of the European Mathematical Society. 21(10), 2995–3052.","short":"T. Hausel, M. Mereb, M. Wong, Journal of the European Mathematical Society 21 (2019) 2995–3052.","mla":"Hausel, Tamás, et al. “Arithmetic and Representation Theory of Wild Character Varieties.” <i>Journal of the European Mathematical Society</i>, vol. 21, no. 10, European Mathematical Society, 2019, pp. 2995–3052, doi:<a href=\"https://doi.org/10.4171/JEMS/896\">10.4171/JEMS/896</a>."},"publication_status":"published","article_type":"original","month":"10","isi":1,"intvolume":"        21","issue":"10","page":"2995-3052","ec_funded":1,"main_file_link":[{"url":"https://arxiv.org/abs/1604.03382","open_access":"1"}],"arxiv":1,"type":"journal_article"},{"type":"journal_article","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.02089"}],"arxiv":1,"page":"909–928","ec_funded":1,"issue":"3","intvolume":"         5","month":"09","article_type":"original","publication_status":"published","quality_controlled":"1","citation":{"apa":"Kalinin, N., &#38; Shkolnikov, M. (2019). Tropical formulae for summation over a part of SL(2,Z). <i>European Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40879-018-0218-0\">https://doi.org/10.1007/s40879-018-0218-0</a>","chicago":"Kalinin, Nikita, and Mikhail Shkolnikov. “Tropical Formulae for Summation over a Part of SL(2,Z).” <i>European Journal of Mathematics</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/s40879-018-0218-0\">https://doi.org/10.1007/s40879-018-0218-0</a>.","ama":"Kalinin N, Shkolnikov M. Tropical formulae for summation over a part of SL(2,Z). <i>European Journal of Mathematics</i>. 2019;5(3):909–928. doi:<a href=\"https://doi.org/10.1007/s40879-018-0218-0\">10.1007/s40879-018-0218-0</a>","short":"N. Kalinin, M. Shkolnikov, European Journal of Mathematics 5 (2019) 909–928.","mla":"Kalinin, Nikita, and Mikhail Shkolnikov. “Tropical Formulae for Summation over a Part of SL(2,Z).” <i>European Journal of Mathematics</i>, vol. 5, no. 3, Springer Nature, 2019, pp. 909–928, doi:<a href=\"https://doi.org/10.1007/s40879-018-0218-0\">10.1007/s40879-018-0218-0</a>.","ieee":"N. Kalinin and M. Shkolnikov, “Tropical formulae for summation over a part of SL(2,Z),” <i>European Journal of Mathematics</i>, 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."},"publisher":"Springer Nature","publication":"European Journal of Mathematics","scopus_import":1,"department":[{"_id":"TaHa"}],"publist_id":"7382","language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:56:46Z","_id":"441","title":"Tropical formulae for summation over a part of SL(2,Z)","article_processing_charge":"No","oa":1,"publication_identifier":{"eissn":["2199-6768"],"issn":["2199-675X"]},"year":"2019","project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"doi":"10.1007/s40879-018-0218-0","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","date_created":"2018-12-11T11:46:29Z","volume":5,"oa_version":"Preprint","status":"public","author":[{"full_name":"Kalinin, Nikita","first_name":"Nikita","last_name":"Kalinin"},{"last_name":"Shkolnikov","id":"35084A62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4310-178X","first_name":"Mikhail","full_name":"Shkolnikov, Mikhail"}],"day":"15","date_published":"2019-09-15T00:00:00Z","external_id":{"arxiv":["1711.02089"]}},{"quality_controlled":"1","citation":{"ama":"Ganev IV. The wonderful compactification for quantum groups. <i>Journal of the London Mathematical Society</i>. 2019;99(3):778-806. doi:<a href=\"https://doi.org/10.1112/jlms.12193\">10.1112/jlms.12193</a>","apa":"Ganev, I. V. (2019). The wonderful compactification for quantum groups. <i>Journal of the London Mathematical Society</i>. Wiley. <a href=\"https://doi.org/10.1112/jlms.12193\">https://doi.org/10.1112/jlms.12193</a>","chicago":"Ganev, Iordan V. “The Wonderful Compactification for Quantum Groups.” <i>Journal of the London Mathematical Society</i>. Wiley, 2019. <a href=\"https://doi.org/10.1112/jlms.12193\">https://doi.org/10.1112/jlms.12193</a>.","ista":"Ganev IV. 2019. The wonderful compactification for quantum groups. Journal of the London Mathematical Society. 99(3), 778–806.","ieee":"I. V. Ganev, “The wonderful compactification for quantum groups,” <i>Journal of the London Mathematical Society</i>, vol. 99, no. 3. Wiley, pp. 778–806, 2019.","short":"I.V. Ganev, Journal of the London Mathematical Society 99 (2019) 778–806.","mla":"Ganev, Iordan V. “The Wonderful Compactification for Quantum Groups.” <i>Journal of the London Mathematical Society</i>, vol. 99, no. 3, Wiley, 2019, pp. 778–806, doi:<a href=\"https://doi.org/10.1112/jlms.12193\">10.1112/jlms.12193</a>."},"publication_status":"published","abstract":[{"lang":"eng","text":"In this paper, we introduce a quantum version of the wonderful compactification of a group as a certain noncommutative projective scheme. Our approach stems from the fact that the wonderful compactification encodes the asymptotics of matrix coefficients, and from its realization as a GIT quotient of the Vinberg semigroup. In order to define the wonderful compactification for a quantum group, we adopt a generalized formalism of Proj categories in the spirit of Artin and Zhang. Key to our construction is a quantum version of the Vinberg semigroup, which we define as a q-deformation of a certain Rees algebra, compatible with a standard Poisson structure. Furthermore, we discuss quantum analogues of the stratification of the wonderful compactification by orbits for a certain group action, and provide explicit computations in the case of SL2."}],"language":[{"iso":"eng"}],"department":[{"_id":"TaHa"}],"publist_id":"8052","publisher":"Wiley","scopus_import":"1","file_date_updated":"2020-07-14T12:46:35Z","publication":"Journal of the London Mathematical Society","file":[{"file_id":"7238","checksum":"1be56239b2cd740a0e9a084f773c22f6","content_type":"application/pdf","creator":"kschuh","access_level":"open_access","file_size":431754,"date_created":"2020-01-07T13:31:53Z","file_name":"2019_Wiley_Ganev.pdf","date_updated":"2020-07-14T12:46:35Z","relation":"main_file"}],"ddc":["510"],"type":"journal_article","intvolume":"        99","isi":1,"month":"06","page":"778-806","issue":"3","oa_version":"Published Version","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"id":"447491B8-F248-11E8-B48F-1D18A9856A87","last_name":"Ganev","full_name":"Ganev, Iordan V","first_name":"Iordan V"}],"doi":"10.1112/jlms.12193","date_created":"2018-12-11T11:44:06Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","volume":99,"external_id":{"isi":["000470025900008"]},"day":"01","date_published":"2019-06-01T00:00:00Z","article_processing_charge":"Yes (via OA deal)","title":"The wonderful compactification for quantum groups","date_updated":"2023-09-19T10:13:08Z","_id":"5","year":"2019","has_accepted_license":"1","oa":1},{"issue":"2","page":"789-826","month":"06","intvolume":"        31","pubrep_id":"712","type":"journal_article","ddc":["519"],"scopus_import":1,"file":[{"date_created":"2018-12-12T10:17:13Z","file_size":671125,"file_name":"IST-2016-712-v1+1_s10959-016-0724-2.pdf","date_updated":"2020-07-14T12:44:39Z","relation":"main_file","file_id":"5266","content_type":"application/pdf","checksum":"47686d58ec21c164540f1a980ff2163f","creator":"system","access_level":"open_access"}],"file_date_updated":"2020-07-14T12:44:39Z","publication":"Journal of Theoretical Probability","publisher":"Springer","publist_id":"6119","language":[{"iso":"eng"}],"department":[{"_id":"JaMa"}],"abstract":[{"text":"Two generalizations of Itô formula to infinite-dimensional spaces are given.\r\nThe first one, in Hilbert spaces, extends the classical one by taking advantage of\r\ncancellations when they occur in examples and it is applied to the case of a group\r\ngenerator. The second one, based on the previous one and a limit procedure, is an Itô\r\nformula in a special class of Banach spaces having a product structure with the noise\r\nin a Hilbert component; again the key point is the extension due to a cancellation. This\r\nextension to Banach spaces and in particular the specific cancellation are motivated\r\nby path-dependent Itô calculus.","lang":"eng"}],"publication_status":"published","citation":{"short":"F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826.","mla":"Flandoli, Franco, et al. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” <i>Journal of Theoretical Probability</i>, vol. 31, no. 2, Springer, 2018, pp. 789–826, doi:<a href=\"https://doi.org/10.1007/s10959-016-0724-2\">10.1007/s10959-016-0724-2</a>.","ieee":"F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under weak spatial regularity of the processes,” <i>Journal of Theoretical Probability</i>, vol. 31, no. 2. Springer, pp. 789–826, 2018.","ista":"Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 31(2), 789–826.","apa":"Flandoli, F., Russo, F., &#38; Zanco, G. A. (2018). Infinite-dimensional calculus under weak spatial regularity of the processes. <i>Journal of Theoretical Probability</i>. Springer. <a href=\"https://doi.org/10.1007/s10959-016-0724-2\">https://doi.org/10.1007/s10959-016-0724-2</a>","chicago":"Flandoli, Franco, Francesco Russo, and Giovanni A Zanco. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” <i>Journal of Theoretical Probability</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s10959-016-0724-2\">https://doi.org/10.1007/s10959-016-0724-2</a>.","ama":"Flandoli F, Russo F, Zanco GA. Infinite-dimensional calculus under weak spatial regularity of the processes. <i>Journal of Theoretical Probability</i>. 2018;31(2):789-826. doi:<a href=\"https://doi.org/10.1007/s10959-016-0724-2\">10.1007/s10959-016-0724-2</a>"},"quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2018","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The second named author benefited partially from the support of the “FMJH Program Gaspard Monge in Optimization and Operations Research” (Project 2014-1607H). He is also grateful for the invitation to the Department of Mathematics of the University of Pisa. The third named author is grateful for the invitation to ENSTA.","_id":"1215","date_updated":"2021-01-12T06:49:09Z","title":"Infinite-dimensional calculus under weak spatial regularity of the processes","article_processing_charge":"Yes (via OA deal)","date_published":"2018-06-01T00:00:00Z","day":"01","volume":31,"date_created":"2018-12-11T11:50:45Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/s10959-016-0724-2","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","author":[{"last_name":"Flandoli","full_name":"Flandoli, Franco","first_name":"Franco"},{"full_name":"Russo, Francesco","first_name":"Francesco","last_name":"Russo"},{"first_name":"Giovanni A","full_name":"Zanco, Giovanni A","last_name":"Zanco","id":"47491882-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version"},{"title":"The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system","date_updated":"2021-01-12T06:49:19Z","_id":"124","type":"journal_article","intvolume":"       223","year":"2018","month":"02","page":"405 - 421","oa_version":"None","status":"public","author":[{"last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","first_name":"Scott R","full_name":"Waitukaitis, Scott R"},{"last_name":"Schrader","first_name":"Devin","full_name":"Schrader, Devin"},{"last_name":"Nagashima","full_name":"Nagashima, Kazuhide","first_name":"Kazuhide"},{"first_name":"Jemma","full_name":"Davidson, Jemma","last_name":"Davidson"},{"first_name":"Timothy","full_name":"Mccoy, Timothy","last_name":"Mccoy"},{"last_name":"Conolly Jr","full_name":"Conolly Jr, Harold","first_name":"Harold"},{"last_name":"Lauretta","first_name":"Dante","full_name":"Lauretta, Dante"}],"quality_controlled":"1","extern":"1","citation":{"ama":"Waitukaitis SR, Schrader D, Nagashima K, et al. The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system. <i>Geochimica et Cosmochimica Acta</i>. 2018;223:405-421. doi:<a href=\"https://doi.org/10.1016/j.gca.2017.12.014\">10.1016/j.gca.2017.12.014</a>","chicago":"Waitukaitis, Scott R, Devin Schrader, Kazuhide Nagashima, Jemma Davidson, Timothy Mccoy, Harold Conolly Jr, and Dante Lauretta. “The Retention of Dust in Protoplanetary Disks: Evidence from Agglomeration Olivine Chondrules from the Outer Solar System.” <i>Geochimica et Cosmochimica Acta</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.gca.2017.12.014\">https://doi.org/10.1016/j.gca.2017.12.014</a>.","apa":"Waitukaitis, S. R., Schrader, D., Nagashima, K., Davidson, J., Mccoy, T., Conolly Jr, H., &#38; Lauretta, D. (2018). The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system. <i>Geochimica et Cosmochimica Acta</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.gca.2017.12.014\">https://doi.org/10.1016/j.gca.2017.12.014</a>","ista":"Waitukaitis SR, Schrader D, Nagashima K, Davidson J, Mccoy T, Conolly Jr H, Lauretta D. 2018. The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system. Geochimica et Cosmochimica Acta. 223, 405–421.","ieee":"S. R. Waitukaitis <i>et al.</i>, “The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system,” <i>Geochimica et Cosmochimica Acta</i>, vol. 223. Elsevier, pp. 405–421, 2018.","mla":"Waitukaitis, Scott R., et al. “The Retention of Dust in Protoplanetary Disks: Evidence from Agglomeration Olivine Chondrules from the Outer Solar System.” <i>Geochimica et Cosmochimica Acta</i>, vol. 223, Elsevier, 2018, pp. 405–21, doi:<a href=\"https://doi.org/10.1016/j.gca.2017.12.014\">10.1016/j.gca.2017.12.014</a>.","short":"S.R. Waitukaitis, D. Schrader, K. Nagashima, J. Davidson, T. Mccoy, H. Conolly Jr, D. Lauretta, Geochimica et Cosmochimica Acta 223 (2018) 405–421."},"doi":"10.1016/j.gca.2017.12.014","publication_status":"published","date_created":"2018-12-11T11:44:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":223,"abstract":[{"text":"By investigating the in situ chemical and O-isotope compositions of olivine in lightly sintered dust agglomerates from the early Solar System, we constrain their origins and the retention of dust in the protoplanetary disk. The grain sizes of silicates in these agglomeratic olivine (AO) chondrules indicate that the grain sizes of chondrule precursors in the Renazzo-like carbonaceous (CR) chondrites ranged from &lt;1 to 80 µm. We infer this grain size range to be equivalent to the size range for dust in the early Solar System. AO chondrules may contain, but are not solely composed of, recycled fragments of earlier formed chondrules. They also contain 16O-rich olivine related to amoeboid olivine aggregates and represent the best record of chondrule-precursor materials. AO chondrules contain one or more large grains, sometimes similar to FeO-poor (type I) and/or FeO-rich (type II) chondrules, while others contain a type II chondrule core. These morphologies are consistent with particle agglomeration by electrostatic charging of grains during collision, a process that may explain solid agglomeration in the protoplanetary disk in the micrometer size regime. The petrographic, isotopic, and chemical compositions of AO chondrules are consistent with chondrule formation by large-scale shocks, bow shocks, and current sheets. The petrographic, isotopic, and chemical similarities between AO chondrules in CR chondrites and chondrule-like objects from comet 81P/Wild 2 indicate that comets contain AO chondrules. We infer that these AO chondrules likely formed in the inner Solar System and migrated to the comet forming region at least 3 Ma after the formation of the first Solar System solids. Observations made in this study imply that the protoplanetary disk retained a dusty disk at least ∼3.7 Ma after the formation of the first Solar System solids, longer than half of the dusty accretion disks observed around other stars.","lang":"eng"}],"publist_id":"7930","language":[{"iso":"eng"}],"publisher":"Elsevier","day":"15","date_published":"2018-02-15T00:00:00Z","publication":"Geochimica et Cosmochimica Acta"},{"date_published":"2018-06-01T00:00:00Z","publication":"Computer Physics Communications","day":"01","publisher":"Elsevier","publist_id":"7928","language":[{"iso":"eng"}],"abstract":[{"text":"Many fields of study, including medical imaging, granular physics, colloidal physics, and active matter, require the precise identification and tracking of particle-like objects in images. While many algorithms exist to track particles in diffuse conditions, these often perform poorly when particles are densely packed together—as in, for example, solid-like systems of granular materials. Incorrect particle identification can have significant effects on the calculation of physical quantities, which makes the development of more precise and faster tracking algorithms a worthwhile endeavor. In this work, we present a new tracking algorithm to identify particles in dense systems that is both highly accurate and fast. We demonstrate the efficacy of our approach by analyzing images of dense, solid-state granular media, where we achieve an identification error of 5% in the worst evaluated cases. Going further, we propose a parallelization strategy for our algorithm using a GPU, which results in a speedup of up to 10× when compared to a sequential CPU implementation in C and up to 40× when compared to the reference MATLAB library widely used for particle tracking. Our results extend the capabilities of state-of-the-art particle tracking methods by allowing fast, high-fidelity detection in dense media at high resolutions.","lang":"eng"}],"date_created":"2018-12-11T11:44:45Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publication_status":"published","volume":227,"doi":"10.1016/j.cpc.2018.02.010","quality_controlled":"1","status":"public","author":[{"full_name":"Cerda, Mauricio","first_name":"Mauricio","last_name":"Cerda"},{"first_name":"Scott R","full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis"},{"last_name":"Navarro","first_name":"Cristóbal","full_name":"Navarro, Cristóbal"},{"full_name":"Silva, Juan","first_name":"Juan","last_name":"Silva"},{"first_name":"Nicolás","full_name":"Mujica, Nicolás","last_name":"Mujica"},{"first_name":"Nancy","full_name":"Hitschfeld, Nancy","last_name":"Hitschfeld"}],"extern":"1","citation":{"ama":"Cerda M, Waitukaitis SR, Navarro C, Silva J, Mujica N, Hitschfeld N. A high-speed tracking algorithm for dense granular media. <i>Computer Physics Communications</i>. 2018;227:8-16. doi:<a href=\"https://doi.org/10.1016/j.cpc.2018.02.010\">10.1016/j.cpc.2018.02.010</a>","chicago":"Cerda, Mauricio, Scott R Waitukaitis, Cristóbal Navarro, Juan Silva, Nicolás Mujica, and Nancy Hitschfeld. “A High-Speed Tracking Algorithm for Dense Granular Media.” <i>Computer Physics Communications</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.cpc.2018.02.010\">https://doi.org/10.1016/j.cpc.2018.02.010</a>.","apa":"Cerda, M., Waitukaitis, S. R., Navarro, C., Silva, J., Mujica, N., &#38; Hitschfeld, N. (2018). A high-speed tracking algorithm for dense granular media. <i>Computer Physics Communications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cpc.2018.02.010\">https://doi.org/10.1016/j.cpc.2018.02.010</a>","ista":"Cerda M, Waitukaitis SR, Navarro C, Silva J, Mujica N, Hitschfeld N. 2018. A high-speed tracking algorithm for dense granular media. Computer Physics Communications. 227, 8–16.","ieee":"M. Cerda, S. R. Waitukaitis, C. Navarro, J. Silva, N. Mujica, and N. Hitschfeld, “A high-speed tracking algorithm for dense granular media,” <i>Computer Physics Communications</i>, vol. 227. Elsevier, pp. 8–16, 2018.","short":"M. Cerda, S.R. Waitukaitis, C. Navarro, J. Silva, N. Mujica, N. Hitschfeld, Computer Physics Communications 227 (2018) 8–16.","mla":"Cerda, Mauricio, et al. “A High-Speed Tracking Algorithm for Dense Granular Media.” <i>Computer Physics Communications</i>, vol. 227, Elsevier, 2018, pp. 8–16, doi:<a href=\"https://doi.org/10.1016/j.cpc.2018.02.010\">10.1016/j.cpc.2018.02.010</a>."},"oa_version":"None","page":"8 - 16","month":"06","intvolume":"       227","year":"2018","date_updated":"2021-01-12T06:49:23Z","_id":"125","type":"journal_article","title":"A high-speed tracking algorithm for dense granular media"},{"title":"From bouncing to floating: the Leidenfrost effect with hydrogel spheres","type":"journal_article","_id":"126","date_updated":"2021-01-12T06:49:27Z","month":"07","article_number":"048001 ","intvolume":"       121","year":"2018","acknowledgement":"We acknowledge funding from the Netherlands Organization for Scientific Research through Grants VICI No. NWO- 680-47-609 (M. v. H. and S. W.) and VENI No. NWO-680- 47-453 (S. W.), and from the German Science Foundation through Grant No. HA8467/1-1 (K. H.).","issue":"4","extern":"1","citation":{"apa":"Waitukaitis, S. R., Harth, K., &#38; Van Hecke, M. (2018). From bouncing to floating: the Leidenfrost effect with hydrogel spheres. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.121.048001\">https://doi.org/10.1103/PhysRevLett.121.048001</a>","chicago":"Waitukaitis, Scott R, Kirsten Harth, and Martin Van Hecke. “From Bouncing to Floating: The Leidenfrost Effect with Hydrogel Spheres.” <i>Physical Review Letters</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevLett.121.048001\">https://doi.org/10.1103/PhysRevLett.121.048001</a>.","ama":"Waitukaitis SR, Harth K, Van Hecke M. From bouncing to floating: the Leidenfrost effect with hydrogel spheres. <i>Physical Review Letters</i>. 2018;121(4). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.121.048001\">10.1103/PhysRevLett.121.048001</a>","short":"S.R. Waitukaitis, K. Harth, M. Van Hecke, Physical Review Letters 121 (2018).","mla":"Waitukaitis, Scott R., et al. “From Bouncing to Floating: The Leidenfrost Effect with Hydrogel Spheres.” <i>Physical Review Letters</i>, vol. 121, no. 4, 048001, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.121.048001\">10.1103/PhysRevLett.121.048001</a>.","ista":"Waitukaitis SR, Harth K, Van Hecke M. 2018. From bouncing to floating: the Leidenfrost effect with hydrogel spheres. Physical Review Letters. 121(4), 048001.","ieee":"S. R. Waitukaitis, K. Harth, and M. Van Hecke, “From bouncing to floating: the Leidenfrost effect with hydrogel spheres,” <i>Physical Review Letters</i>, vol. 121, no. 4. American Physical Society, 2018."},"author":[{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis","full_name":"Waitukaitis, Scott R","first_name":"Scott R","orcid":"0000-0002-2299-3176"},{"last_name":"Harth","first_name":"Kirsten","full_name":"Harth, Kirsten"},{"last_name":"Van Hecke","first_name":"Martin","full_name":"Van Hecke, Martin"}],"quality_controlled":"1","status":"public","oa_version":"None","volume":121,"publication_status":"published","date_created":"2018-12-11T11:44:46Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1103/PhysRevLett.121.048001","language":[{"iso":"eng"}],"publist_id":"7927","abstract":[{"text":"The Leidenfrost effect occurs when a liquid or stiff sublimable solid near a hot surface creates enough vapor beneath it to lift itself up and float. In contrast, vaporizable soft solids, e.g., hydrogels, have been shown to exhibit persistent bouncing - the elastic Leidenfrost effect. By carefully lowering hydrogel spheres towards a hot surface, we discover that they are also capable of floating. The bounce-to-float transition is controlled by the approach velocity and temperature, analogously to the &quot;dynamic Leidenfrost effect.&quot; For the floating regime, we measure power-law scalings for the gap geometry, which we explain with a model that couples the vaporization rate to the spherical shape. Our results reveal that hydrogels are a promising pathway for controlling floating Leidenfrost objects through shape.","lang":"eng"}],"publication":"Physical Review Letters","date_published":"2018-07-25T00:00:00Z","publisher":"American Physical Society","day":"25"},{"main_file_link":[{"url":"https://doi.org/10.1002/hyp.13354","open_access":"1"}],"type":"journal_article","intvolume":"        33","month":"11","page":"214-229","issue":"2","quality_controlled":"1","citation":{"chicago":"Burger, Flavia, Alvaro Ayala, David Farias, Thomas E. Shaw, Shelley MacDonell, Ben Brock, James McPhee, and Francesca Pellicciotti. “Interannual Variability in Glacier Contribution to Runoff from a High‐elevation Andean Catchment: Understanding the Role of Debris Cover in Glacier Hydrology.” <i>Hydrological Processes</i>. Wiley, 2018. <a href=\"https://doi.org/10.1002/hyp.13354\">https://doi.org/10.1002/hyp.13354</a>.","apa":"Burger, F., Ayala, A., Farias, D., Shaw, T. E., MacDonell, S., Brock, B., … Pellicciotti, F. (2018). Interannual variability in glacier contribution to runoff from a high‐elevation Andean catchment: Understanding the role of debris cover in glacier hydrology. <i>Hydrological Processes</i>. Wiley. <a href=\"https://doi.org/10.1002/hyp.13354\">https://doi.org/10.1002/hyp.13354</a>","ama":"Burger F, Ayala A, Farias D, et al. Interannual variability in glacier contribution to runoff from a high‐elevation Andean catchment: Understanding the role of debris cover in glacier hydrology. <i>Hydrological Processes</i>. 2018;33(2):214-229. doi:<a href=\"https://doi.org/10.1002/hyp.13354\">10.1002/hyp.13354</a>","short":"F. Burger, A. Ayala, D. Farias, T.E. Shaw, S. MacDonell, B. Brock, J. McPhee, F. Pellicciotti, Hydrological Processes 33 (2018) 214–229.","mla":"Burger, Flavia, et al. “Interannual Variability in Glacier Contribution to Runoff from a High‐elevation Andean Catchment: Understanding the Role of Debris Cover in Glacier Hydrology.” <i>Hydrological Processes</i>, vol. 33, no. 2, Wiley, 2018, pp. 214–29, doi:<a href=\"https://doi.org/10.1002/hyp.13354\">10.1002/hyp.13354</a>.","ieee":"F. Burger <i>et al.</i>, “Interannual variability in glacier contribution to runoff from a high‐elevation Andean catchment: Understanding the role of debris cover in glacier hydrology,” <i>Hydrological Processes</i>, vol. 33, no. 2. Wiley, pp. 214–229, 2018.","ista":"Burger F, Ayala A, Farias D, Shaw TE, MacDonell S, Brock B, McPhee J, Pellicciotti F. 2018. Interannual variability in glacier contribution to runoff from a high‐elevation Andean catchment: Understanding the role of debris cover in glacier hydrology. Hydrological Processes. 33(2), 214–229."},"keyword":["Water Science and Technology"],"article_type":"original","publication_status":"published","abstract":[{"lang":"eng","text":"We present a field-data rich modelling analysis to reconstruct the climatic forcing, glacier response, and runoff generation from a high-elevation catchment in central Chile over the period 2000–2015 to provide insights into the differing contributions of debris-covered and debris-free glaciers under current and future changing climatic conditions. Model simulations with the physically based glacio-hydrological model TOPKAPI-ETH reveal a period of neutral or slightly positive mass balance between 2000 and 2010, followed by a transition to increasingly large annual mass losses, associated with a recent mega drought. Mass losses commence earlier, and are more severe, for a heavily debris-covered glacier, most likely due to its strong dependence on snow avalanche accumulation, which has declined in recent years. Catchment runoff shows a marked decreasing trend over the study period, but with high interannual variability directly linked to winter snow accumulation, and high contribution from ice melt in dry periods and drought conditions. The study demonstrates the importance of incorporating local-scale processes such as snow avalanche accumulation and spatially variable debris thickness, in understanding the responses of different glacier types to climate change. We highlight the increased dependency of runoff from high Andean catchments on the diminishing resource of glacier ice during dry years."}],"language":[{"iso":"eng"}],"publisher":"Wiley","publication":"Hydrological Processes","scopus_import":"1","article_processing_charge":"No","title":"Interannual variability in glacier contribution to runoff from a high‐elevation Andean catchment: Understanding the role of debris cover in glacier hydrology","date_updated":"2023-02-28T11:49:36Z","_id":"12603","year":"2018","oa":1,"publication_identifier":{"issn":["0885-6087"],"eissn":["1099-1085"]},"oa_version":"Published Version","status":"public","author":[{"full_name":"Burger, Flavia","first_name":"Flavia","last_name":"Burger"},{"last_name":"Ayala","first_name":"Alvaro","full_name":"Ayala, Alvaro"},{"full_name":"Farias, David","first_name":"David","last_name":"Farias"},{"last_name":"Shaw","full_name":"Shaw, Thomas E.","first_name":"Thomas E."},{"last_name":"MacDonell","full_name":"MacDonell, Shelley","first_name":"Shelley"},{"full_name":"Brock, Ben","first_name":"Ben","last_name":"Brock"},{"first_name":"James","full_name":"McPhee, James","last_name":"McPhee"},{"full_name":"Pellicciotti, Francesca","first_name":"Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","last_name":"Pellicciotti"}],"extern":"1","doi":"10.1002/hyp.13354","date_created":"2023-02-20T08:13:14Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":33,"day":"26","date_published":"2018-11-26T00:00:00Z"},{"type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2018GL079678"}],"issue":"19","page":"10464-10473","month":"10","intvolume":"        45","publication_status":"published","article_type":"letter_note","keyword":["General Earth and Planetary Sciences","Geophysics"],"citation":{"ieee":"E. S. Miles, I. Willis, P. Buri, J. F. Steiner, N. S. Arnold, and F. Pellicciotti, “Surface pond energy absorption across four Himalayan Glaciers accounts for 1/8 of total catchment ice loss,” <i>Geophysical Research Letters</i>, vol. 45, no. 19. American Geophysical Union, pp. 10464–10473, 2018.","ista":"Miles ES, Willis I, Buri P, Steiner JF, Arnold NS, Pellicciotti F. 2018. Surface pond energy absorption across four Himalayan Glaciers accounts for 1/8 of total catchment ice loss. Geophysical Research Letters. 45(19), 10464–10473.","short":"E.S. Miles, I. Willis, P. Buri, J.F. Steiner, N.S. Arnold, F. Pellicciotti, Geophysical Research Letters 45 (2018) 10464–10473.","mla":"Miles, Evan S., et al. “Surface Pond Energy Absorption across Four Himalayan Glaciers Accounts for 1/8 of Total Catchment Ice Loss.” <i>Geophysical Research Letters</i>, vol. 45, no. 19, American Geophysical Union, 2018, pp. 10464–73, doi:<a href=\"https://doi.org/10.1029/2018gl079678\">10.1029/2018gl079678</a>.","ama":"Miles ES, Willis I, Buri P, Steiner JF, Arnold NS, Pellicciotti F. Surface pond energy absorption across four Himalayan Glaciers accounts for 1/8 of total catchment ice loss. <i>Geophysical Research Letters</i>. 2018;45(19):10464-10473. doi:<a href=\"https://doi.org/10.1029/2018gl079678\">10.1029/2018gl079678</a>","apa":"Miles, E. S., Willis, I., Buri, P., Steiner, J. F., Arnold, N. S., &#38; Pellicciotti, F. (2018). Surface pond energy absorption across four Himalayan Glaciers accounts for 1/8 of total catchment ice loss. <i>Geophysical Research Letters</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2018gl079678\">https://doi.org/10.1029/2018gl079678</a>","chicago":"Miles, Evan S., Ian Willis, Pascal Buri, Jakob F. Steiner, Neil S. Arnold, and Francesca Pellicciotti. “Surface Pond Energy Absorption across Four Himalayan Glaciers Accounts for 1/8 of Total Catchment Ice Loss.” <i>Geophysical Research Letters</i>. American Geophysical Union, 2018. <a href=\"https://doi.org/10.1029/2018gl079678\">https://doi.org/10.1029/2018gl079678</a>."},"quality_controlled":"1","scopus_import":"1","publication":"Geophysical Research Letters","publisher":"American Geophysical Union","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Glaciers in the high mountains of Asia provide an important water resource for millions of people. Many of these glaciers are partially covered by rocky debris, which protects the ice from solar radiation and warm air. However, studies have found that the surface of these debris-covered glaciers is actually lowering as fast as glaciers without debris. Water ponded on the surface of the glaciers may be partially responsible, as water can absorb atmospheric energy very efficiently. However, the overall effect of these ponds has not been thoroughly assessed yet. We study a valley in Nepal for which we have extensive weather measurements, and we use a numerical model to calculate the energy absorbed by ponds on the surface of the glaciers over 6 months. As we have not observed each individual pond thoroughly, we run the model 5,000 times with different setups. We find that ponds are extremely important for glacier melt and absorb energy 14 times as quickly as the debris-covered ice. Although the ponds account for 1% of the glacier area covered by rocks, and only 0.3% of the total glacier area, they absorb enough energy to account for one eighth of the whole valley's ice loss."}],"_id":"12604","date_updated":"2023-02-28T11:46:48Z","title":"Surface pond energy absorption across four Himalayan Glaciers accounts for 1/8 of total catchment ice loss","article_processing_charge":"No","publication_identifier":{"issn":["0094-8276"],"eissn":["1944-8007"]},"oa":1,"year":"2018","volume":45,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-02-20T08:13:18Z","doi":"10.1029/2018gl079678","extern":"1","author":[{"last_name":"Miles","full_name":"Miles, Evan S.","first_name":"Evan S."},{"full_name":"Willis, Ian","first_name":"Ian","last_name":"Willis"},{"last_name":"Buri","full_name":"Buri, Pascal","first_name":"Pascal"},{"first_name":"Jakob F.","full_name":"Steiner, Jakob F.","last_name":"Steiner"},{"first_name":"Neil S.","full_name":"Arnold, Neil S.","last_name":"Arnold"},{"id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","last_name":"Pellicciotti","full_name":"Pellicciotti, Francesca","first_name":"Francesca"}],"status":"public","oa_version":"Published Version","date_published":"2018-10-18T00:00:00Z","day":"18"}]