[{"quality_controlled":"1","page":"406-423","publication":"60th Annual Symposium on Foundations of Computer Science","citation":{"ama":"Bhattacharya S, Henzinger MH, Nanongkai D. A new deterministic algorithm for dynamic set cover. In: 60th Annual Symposium on Foundations of Computer Science. Institute of Electrical and Electronics Engineers; 2019:406-423. doi:10.1109/focs.2019.00033","ista":"Bhattacharya S, Henzinger MH, Nanongkai D. 2019. A new deterministic algorithm for dynamic set cover. 60th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 406–423.","ieee":"S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “A new deterministic algorithm for dynamic set cover,” in 60th Annual Symposium on Foundations of Computer Science, Baltimore, MD, United States, 2019, pp. 406–423.","apa":"Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2019). A new deterministic algorithm for dynamic set cover. In 60th Annual Symposium on Foundations of Computer Science (pp. 406–423). Baltimore, MD, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2019.00033","mla":"Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set Cover.” 60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:10.1109/focs.2019.00033.","short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–423.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “A New Deterministic Algorithm for Dynamic Set Cover.” In 60th Annual Symposium on Foundations of Computer Science, 406–23. Institute of Electrical and Electronics Engineers, 2019. https://doi.org/10.1109/focs.2019.00033."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1909.11600"}],"external_id":{"arxiv":["1909.11600"]},"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"FOCS: Annual Symposium on Foundations of Computer Science","start_date":"2019-11-09","location":"Baltimore, MD, United States","end_date":"2019-11-12"},"doi":"10.1109/focs.2019.00033","date_published":"2019-11-01T00:00:00Z","scopus_import":"1","month":"11","day":"01","article_processing_charge":"No","publication_identifier":{"eisbn":["978-1-7281-4952-3"],"issn":["2575-8454"],"isbn":["978-1-7281-4953-0"]},"publication_status":"published","title":"A new deterministic algorithm for dynamic set cover","status":"public","publisher":"Institute of Electrical and Electronics Engineers","_id":"11853","year":"2019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-17T09:50:37Z","date_created":"2022-08-16T08:00:00Z","oa_version":"Preprint","author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"type":"conference","extern":"1","abstract":[{"lang":"eng","text":"We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f sets, and the cost of each set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17], implies that there is a deterministic algorithm for this problem with O(f log(Cn)) amortized update time and O(min(log n, f)) -approximation ratio, which nearly matches the polynomial-time hardness of approximation for minimum set cover in the static setting. Our update time is only O(log (Cn)) away from a trivial lower bound. Prior to our work, the previous best approximation ratio guaranteed by deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15]. In contrast, the only result that guaranteed O(f) -approximation was obtained very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with (1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the extra O(f) factor in the update time compared to our and Gupta~et~al.'s results, the Abboud~et~al.~algorithm is randomized, and works only when the adversary is oblivious and the sets are unweighted (each set has the same cost). We achieve our result via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual algorithms that try to satisfy some local constraints for individual sets at all time, our algorithm basically waits until the dual solution changes significantly globally, and fixes the solution only where the fix is needed."}]},{"publisher":"Institute of Electrical and Electronics Engineers","publication_status":"published","title":"Shared-memory exact minimum cuts","status":"public","_id":"11851","year":"2019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","date_updated":"2023-02-21T16:30:34Z","date_created":"2022-08-16T07:25:23Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"11851"}]},"author":[{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"first_name":"Alexander","last_name":"Noe","full_name":"Noe, Alexander"},{"first_name":"Christian","last_name":"Schulz","full_name":"Schulz, Christian"}],"type":"conference","article_number":"8820968","extern":"1","abstract":[{"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.","lang":"eng"}],"quality_controlled":"1","citation":{"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.","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.","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.","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","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.","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"},"external_id":{"arxiv":["1808.05458"]},"main_file_link":[{"url":"https://arxiv.org/abs/1808.05458"}],"publication":"33rd International Parallel and Distributed Processing Symposium","language":[{"iso":"eng"}],"date_published":"2019-05-01T00:00:00Z","doi":"10.1109/ipdps.2019.00013","conference":{"name":"IPDPS: International Parallel and Distributed Processing Symposium","start_date":"2019-05-20","location":"Rio de Janeiro, Brazil","end_date":"2019-05-24"},"scopus_import":"1","publication_identifier":{"eisbn":["978-1-7281-1246-6"],"eissn":["1530-2075"],"isbn":["978-1-7281-1247-3"]},"article_processing_charge":"No","month":"05","day":"01"},{"title":"Distributed edge connectivity in sublinear time","status":"public","publication_status":"published","publisher":"Association for Computing Machinery","_id":"11865","year":"2019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2022-08-16T09:11:17Z","date_updated":"2023-02-17T10:26:25Z","oa_version":"Preprint","author":[{"first_name":"Mohit","last_name":"Daga","full_name":"Daga, Mohit"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"},{"full_name":"Saranurak, Thatchaphol","last_name":"Saranurak","first_name":"Thatchaphol"}],"type":"conference","extern":"1","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"}],"quality_controlled":"1","page":"343–354","publication":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","external_id":{"arxiv":["1904.04341"]},"oa":1,"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","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.","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","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.” 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.","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."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.04341"}],"language":[{"iso":"eng"}],"conference":{"location":"Phoenix, AZ, United States","start_date":"2019-06-23","end_date":"2019-06-26","name":"STOC: Symposium on Theory of Computing"},"date_published":"2019-06-01T00:00:00Z","doi":"10.1145/3313276.3316346","scopus_import":"1","day":"01","month":"06","article_processing_charge":"No","publication_identifier":{"issn":["0737-8017"],"isbn":["978-1-4503-6705-9"]}},{"month":"01","publication_identifier":{"eisbn":["978-1-61197-548-2"]},"quality_controlled":"1","external_id":{"arxiv":["1810.10932"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1810.10932","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2019-01-09","start_date":"2019-01-06","location":"San Diego, CA, United States"},"doi":"10.1137/1.9781611975482.115","extern":"1","publication_status":"published","publisher":"Society for Industrial and Applied Mathematics","year":"2019","date_created":"2022-08-16T09:50:33Z","date_updated":"2023-02-21T16:31:21Z","author":[{"full_name":"Bernstein, Aaron","first_name":"Aaron","last_name":"Bernstein"},{"full_name":"Forster, Sebastian","first_name":"Sebastian","last_name":"Forster"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"11871"}]},"scopus_import":"1","day":"01","article_processing_charge":"No","page":"1899-1918","publication":"30th Annual ACM-SIAM Symposium on Discrete Algorithms","citation":{"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.","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","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.","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","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.","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."},"date_published":"2019-01-01T00:00:00Z","type":"conference","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"}],"title":"A deamortization approach for dynamic spanner and dynamic maximal matching","status":"public","_id":"11871","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint"},{"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."}],"type":"journal_article","oa_version":"Preprint","_id":"11898","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"New amortized cell-probe lower bounds for dynamic problems","status":"public","intvolume":" 779","day":"02","article_processing_charge":"No","scopus_import":"1","date_published":"2019-08-02T00:00:00Z","publication":"Theoretical Computer Science","citation":{"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.","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.” Theoretical Computer Science, vol. 779, Elsevier, 2019, pp. 72–87, doi: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.","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","ista":"Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 779, 72–87.","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"},"article_type":"original","page":"72-87","extern":"1","author":[{"first_name":"Sayan","last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"first_name":"Stefan","last_name":"Neumann","full_name":"Neumann, Stefan"}],"date_created":"2022-08-17T09:02:15Z","date_updated":"2022-09-09T11:29:04Z","volume":779,"year":"2019","publication_status":"published","publisher":"Elsevier","month":"08","publication_identifier":{"issn":["0304-3975"]},"doi":"10.1016/j.tcs.2019.01.043","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1902.02304","open_access":"1"}],"external_id":{"arxiv":["1902.02304"]},"quality_controlled":"1"},{"article_processing_charge":"No","day":"08","scopus_import":"1","date_published":"2019-07-08T00:00:00Z","page":"9575-9580","article_type":"letter_note","citation":{"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.","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.” Angewandte Chemie International Edition, vol. 58, no. 28, Wiley, 2019, pp. 9575–80, 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","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.","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"},"publication":"Angewandte Chemie International Edition","issue":"28","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."}],"type":"journal_article","oa_version":"None","intvolume":" 58","title":"Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides","status":"public","_id":"11957","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["1433-7851"],"eissn":["1521-3773"]},"month":"07","language":[{"iso":"eng"}],"doi":"10.1002/anie.201902785","quality_controlled":"1","external_id":{"pmid":["31050132"]},"extern":"1","volume":58,"date_created":"2022-08-24T10:50:19Z","date_updated":"2023-02-21T10:09:16Z","author":[{"orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","first_name":"Bartholomäus","full_name":"Pieber, Bartholomäus"},{"first_name":"Jamal A.","last_name":"Malik","full_name":"Malik, Jamal A."},{"first_name":"Cristian","last_name":"Cavedon","full_name":"Cavedon, Cristian"},{"full_name":"Gisbertz, Sebastian","last_name":"Gisbertz","first_name":"Sebastian"},{"full_name":"Savateev, Aleksandr","last_name":"Savateev","first_name":"Aleksandr"},{"full_name":"Cruz, Daniel","first_name":"Daniel","last_name":"Cruz"},{"full_name":"Heil, Tobias","first_name":"Tobias","last_name":"Heil"},{"full_name":"Zhang, Guigang","last_name":"Zhang","first_name":"Guigang"},{"full_name":"Seeberger, Peter H.","first_name":"Peter H.","last_name":"Seeberger"}],"publisher":"Wiley","publication_status":"published","pmid":1,"year":"2019"},{"date_published":"2019-12-20T00:00:00Z","publication":"Organic Process Research and Development","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","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.","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","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.” Organic Process Research and Development, vol. 23, no. 12, American Chemical Society, 2019, pp. 2764–70, doi: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."},"article_type":"letter_note","page":"2764-2770","day":"20","article_processing_charge":"No","scopus_import":"1","oa_version":"Published Version","_id":"11984","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks","status":"public","intvolume":" 23","abstract":[{"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.","lang":"eng"}],"issue":"12","type":"journal_article","doi":"10.1021/acs.oprd.9b00456","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.oprd.9b00456"}],"oa":1,"quality_controlled":"1","month":"12","publication_identifier":{"issn":["1083-6160"],"eissn":["1520-586X"]},"author":[{"first_name":"Mónica","last_name":"Guberman","full_name":"Guberman, Mónica"},{"full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","last_name":"Pieber"},{"first_name":"Peter H.","last_name":"Seeberger","full_name":"Seeberger, Peter H."}],"date_created":"2022-08-25T11:30:33Z","date_updated":"2023-02-21T10:10:23Z","volume":23,"year":"2019","publication_status":"published","publisher":"American Chemical Society","extern":"1"},{"type":"journal_article","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."}],"issue":"13","_id":"11982","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides","status":"public","intvolume":" 21","oa_version":"Published Version","scopus_import":"1","day":"05","article_processing_charge":"No","publication":"Organic Letters","citation":{"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.","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.","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.","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","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.","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"},"article_type":"letter_note","page":"5331-5334","date_published":"2019-07-05T00:00:00Z","extern":"1","year":"2019","pmid":1,"publication_status":"published","publisher":"American Chemical Society","author":[{"last_name":"Cavedon","first_name":"Cristian","full_name":"Cavedon, Cristian"},{"last_name":"Madani","first_name":"Amiera","full_name":"Madani, Amiera"},{"last_name":"Seeberger","first_name":"Peter H.","full_name":"Seeberger, Peter H."},{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","last_name":"Pieber","full_name":"Pieber, Bartholomäus"}],"date_updated":"2023-02-21T10:10:19Z","date_created":"2022-08-25T11:18:00Z","volume":21,"month":"07","publication_identifier":{"eissn":["1523-7052"],"issn":["1523-7060"]},"external_id":{"pmid":["31247752"]},"main_file_link":[{"url":"https://doi.org/10.1021/acs.orglett.9b01957","open_access":"1"}],"oa":1,"quality_controlled":"1","doi":"10.1021/acs.orglett.9b01957","language":[{"iso":"eng"}]},{"day":"01","has_accepted_license":"1","date_published":"2019-04-01T00:00:00Z","page":"977-1016","publication":"Mathematische Annalen","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","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.","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.","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","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.","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."},"abstract":[{"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 ℚ .","lang":"eng"}],"issue":"3-4","type":"journal_article","file":[{"file_name":"2019_MathAnnalen_Browning.pdf","access_level":"open_access","content_type":"application/pdf","file_size":712847,"creator":"dernst","relation":"main_file","file_id":"6479","date_updated":"2020-07-14T12:45:12Z","date_created":"2019-05-23T07:53:27Z","checksum":"4061dc2fe99bee25d9adf2d2018cf608"}],"oa_version":"Published Version","ddc":["510"],"status":"public","title":"Counting rational points on quartic del Pezzo surfaces with a rational conic","intvolume":" 373","_id":"170","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","language":[{"iso":"eng"}],"doi":"10.1007/s00208-018-1716-6","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1609.09057"]},"oa":1,"extern":"1","file_date_updated":"2020-07-14T12:45:12Z","date_created":"2018-12-11T11:44:59Z","date_updated":"2021-01-12T06:52:37Z","volume":373,"author":[{"full_name":"Browning, Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","first_name":"Timothy D","last_name":"Browning"},{"last_name":"Sofos","first_name":"Efthymios","full_name":"Sofos, Efthymios"}],"publication_status":"published","publisher":"Springer Nature","year":"2019"},{"doi":"10.1007/s40879-018-0218-0","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.02089"}],"oa":1,"external_id":{"arxiv":["1711.02089"]},"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","publication_identifier":{"issn":["2199-675X"],"eissn":["2199-6768"]},"month":"09","author":[{"full_name":"Kalinin, Nikita","first_name":"Nikita","last_name":"Kalinin"},{"full_name":"Shkolnikov, Mikhail","last_name":"Shkolnikov","first_name":"Mikhail","orcid":"0000-0002-4310-178X","id":"35084A62-F248-11E8-B48F-1D18A9856A87"}],"volume":5,"date_created":"2018-12-11T11:46:29Z","date_updated":"2021-01-12T07:56:46Z","year":"2019","department":[{"_id":"TaHa"}],"publisher":"Springer Nature","publication_status":"published","publist_id":"7382","ec_funded":1,"date_published":"2019-09-15T00:00:00Z","citation":{"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.","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).” European Journal of Mathematics, vol. 5, no. 3, Springer Nature, 2019, pp. 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","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.","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"},"publication":"European Journal of Mathematics","page":"909–928","article_type":"original","article_processing_charge":"No","day":"15","scopus_import":1,"oa_version":"Preprint","_id":"441","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","intvolume":" 5","status":"public","title":"Tropical formulae for summation over a part of SL(2,Z)","issue":"3","type":"journal_article"},{"series_title":"Methods in Molecular Biology","scopus_import":1,"publication_identifier":{"isbn":["978-1-4939-8909-6"]},"month":"01","day":"01","page":"167-181","quality_controlled":"1","citation":{"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","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.","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","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.","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.","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."},"publication":"The hippo pathway","language":[{"iso":"eng"}],"date_published":"2019-01-01T00:00:00Z","doi":"10.1007/978-1-4939-8910-2_14","alternative_title":["MIMB"],"type":"book_chapter","abstract":[{"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.","lang":"eng"}],"intvolume":" 1893","department":[{"_id":"CaHe"}],"publisher":"Springer","editor":[{"first_name":"Alexander","last_name":"Hergovich","full_name":"Hergovich, Alexander"}],"publication_status":"published","status":"public","title":"Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids","_id":"5793","year":"2019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":1893,"oa_version":"None","date_updated":"2021-01-12T08:03:30Z","date_created":"2019-01-06T22:59:11Z","author":[{"first_name":"Yoichi","last_name":"Asaoka","full_name":"Asaoka, Yoichi"},{"full_name":"Morita, Hitoshi","last_name":"Morita","first_name":"Hitoshi"},{"last_name":"Furumoto","first_name":"Hiroko","full_name":"Furumoto, Hiroko"},{"orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J"},{"full_name":"Furutani-Seiki, Makoto","first_name":"Makoto","last_name":"Furutani-Seiki"}]},{"doi":"10.3233/JCS-181131","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/166"}],"oa":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"month":"01","publication_identifier":{"issn":["0926227X"]},"author":[{"full_name":"Demay, Gregory","first_name":"Gregory","last_name":"Demay"},{"full_name":"Gazi, Peter","last_name":"Gazi","first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Maurer","first_name":"Ueli","full_name":"Maurer, Ueli"},{"full_name":"Tackmann, Bjorn","first_name":"Bjorn","last_name":"Tackmann"}],"date_updated":"2021-01-12T08:05:08Z","date_created":"2019-01-27T22:59:10Z","volume":27,"year":"2019","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"IOS Press","ec_funded":1,"date_published":"2019-01-01T00:00:00Z","publication":"Journal of Computer Security","citation":{"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","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.","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","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.","short":"G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27 (2019) 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."},"article_type":"original","page":"75-111","day":"1","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","_id":"5887","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Per-session security: Password-based cryptography revisited","status":"public","intvolume":" 27","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."}],"issue":"1","type":"journal_article"},{"author":[{"full_name":"Biswas, Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890","first_name":"Ranita","last_name":"Biswas"},{"first_name":"Gaëlle","last_name":"Largeteau-Skapin","full_name":"Largeteau-Skapin, Gaëlle"},{"last_name":"Zrour","first_name":"Rita","full_name":"Zrour, Rita"},{"last_name":"Andres","first_name":"Eric","full_name":"Andres, Eric"}],"oa_version":"None","volume":11414,"date_updated":"2022-01-27T14:25:17Z","date_created":"2019-03-21T12:12:19Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"6163","year":"2019","publisher":"Springer Berlin Heidelberg","intvolume":" 11414","publication_status":"published","status":"public","title":"Rhombic dodecahedron grid—coordinate system and 3D digital object definitions","abstract":[{"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.","lang":"eng"}],"extern":"1","type":"conference","place":"Berlin, Heidelberg","alternative_title":["LNCS"],"doi":"10.1007/978-3-030-14085-4_3","date_published":"2019-02-23T00:00:00Z","conference":{"end_date":"2019-03-28","location":"Marne-la-Vallée, France","start_date":"2019-03-26","name":"DGCI: International Conference on Discrete Geometry for Computer Imagery"},"language":[{"iso":"eng"}],"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","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.","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.","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","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.","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."},"publication":"21st IAPR International Conference on Discrete Geometry for Computer Imagery","page":"27-37","quality_controlled":"1","article_processing_charge":"No","publication_identifier":{"isbn":["978-3-6624-6446-5","978-3-6624-6447-2"],"issn":["0302-9743","1611-3349"]},"day":"23","month":"02"},{"ddc":["510"],"status":"public","title":"Simplices modelled on spaces of constant curvature","intvolume":" 10","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6515","file":[{"file_size":2170882,"content_type":"application/pdf","creator":"mwintrae","access_level":"open_access","file_name":"mainJournalFinal.pdf","checksum":"57b4df2f16a74eb499734ec8ee240178","date_updated":"2020-07-14T12:47:32Z","date_created":"2019-06-03T09:30:01Z","relation":"main_file","file_id":"6516"}],"oa_version":"Published Version","type":"journal_article","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."}],"issue":"1","page":"223–256","publication":"Journal of Computational Geometry ","citation":{"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.","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","ista":"Dyer R, Vegter G, Wintraecken M. 2019. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 10(1), 223–256.","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","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.","short":"R. Dyer, G. Vegter, M. Wintraecken, Journal of Computational Geometry 10 (2019) 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."},"date_published":"2019-07-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Carleton University","year":"2019","date_created":"2019-06-03T09:35:33Z","date_updated":"2021-01-12T08:07:50Z","volume":10,"author":[{"full_name":"Dyer, Ramsay","first_name":"Ramsay","last_name":"Dyer"},{"first_name":"Gert","last_name":"Vegter","full_name":"Vegter, Gert"},{"orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","first_name":"Mathijs","full_name":"Wintraecken, Mathijs"}],"file_date_updated":"2020-07-14T12:47:32Z","ec_funded":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.20382/jocg.v10i1a9","month":"07","publication_identifier":{"issn":["1920-180X"]}},{"scopus_import":1,"day":"10","article_processing_charge":"No","has_accepted_license":"1","publication":"10th Innovations in Theoretical Computer Science Conference","citation":{"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.","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","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.","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","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.","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"},"date_published":"2019-01-10T00:00:00Z","type":"conference","alternative_title":["LIPIcs"],"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."}],"_id":"6528","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Simple verifiable delay functions","status":"public","ddc":["000"],"intvolume":" 124","file":[{"relation":"main_file","file_id":"6529","checksum":"f0ae1bb161431d9db3dea5ace082bfb5","date_created":"2019-06-06T14:22:04Z","date_updated":"2020-07-14T12:47:33Z","access_level":"open_access","file_name":"2019_LIPIcs_Pietrzak.pdf","file_size":558770,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","month":"01","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-095-8"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/627"}],"quality_controlled":"1","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"conference":{"name":"ITCS 2019: Innovations in Theoretical Computer Science","end_date":"2019-01-12","start_date":"2019-01-10","location":"San Diego, CA, United States"},"doi":"10.4230/LIPICS.ITCS.2019.60","language":[{"iso":"eng"}],"article_number":"60","file_date_updated":"2020-07-14T12:47:33Z","ec_funded":1,"year":"2019","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrPi"}],"author":[{"first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}],"date_created":"2019-06-06T14:12:36Z","date_updated":"2021-01-12T08:07:53Z","volume":124},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6565","ddc":["000"],"title":"Formal synthesis of stabilizing controllers for periodically controlled linear switched systems","status":"public","file":[{"file_size":396031,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2019_ICC_Kundu.pdf","checksum":"d622a91af1e427f6b1e0ba8e18a2b767","success":1,"date_created":"2020-10-21T13:13:49Z","date_updated":"2020-10-21T13:13:49Z","relation":"main_file","file_id":"8687"}],"oa_version":"Submitted Version","type":"conference","abstract":[{"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.","lang":"eng"}],"citation":{"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.","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.","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","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.","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.","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"},"publication":"5th Indian Control Conference Proceedings","date_published":"2019-05-16T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"16","year":"2019","department":[{"_id":"ToHe"}],"publisher":"IEEE","publication_status":"published","author":[{"full_name":"Kundu, Atreyee","last_name":"Kundu","first_name":"Atreyee"},{"full_name":"Garcia Soto, Miriam","orcid":"0000−0003−2936−5719","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","last_name":"Garcia Soto","first_name":"Miriam"},{"full_name":"Prabhakar, Pavithra","last_name":"Prabhakar","first_name":"Pavithra"}],"date_created":"2019-06-17T06:57:33Z","date_updated":"2021-01-12T08:08:01Z","article_number":"8715598","file_date_updated":"2020-10-21T13:13:49Z","oa":1,"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"quality_controlled":"1","doi":"10.1109/INDIANCC.2019.8715598","conference":{"name":"ICC 2019 - Indian Control Conference","location":"Delhi, India","start_date":"2019-01-09","end_date":"2019-01-11"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-153866246-5"]},"month":"05"},{"scopus_import":1,"has_accepted_license":"1","day":"01","month":"08","oa":1,"citation":{"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.","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.","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.","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.","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.","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."},"publication":"The 31st Canadian Conference in Computational Geometry","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"page":"275-279","quality_controlled":"1","date_published":"2019-08-01T00:00:00Z","conference":{"name":"CCCG: Canadian Conference in Computational Geometry","start_date":"2019-08-08","location":"Edmonton, Canada","end_date":"2019-08-10"},"language":[{"iso":"eng"}],"type":"conference","ec_funded":1,"file_date_updated":"2020-07-14T12:47:34Z","abstract":[{"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.","lang":"eng"}],"year":"2019","_id":"6628","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"title":"The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds","publication_status":"published","status":"public","ddc":["004"],"author":[{"first_name":"Gert","last_name":"Vegter","full_name":"Vegter, Gert"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","first_name":"Mathijs","last_name":"Wintraecken","full_name":"Wintraecken, Mathijs"}],"oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"6629","date_updated":"2020-07-14T12:47:34Z","date_created":"2019-07-12T08:32:46Z","checksum":"ceabd152cfa55170d57763f9c6c60a53","file_name":"IntrinsicExtrinsicCCCG2019.pdf","access_level":"open_access","file_size":321176,"content_type":"application/pdf","creator":"mwintrae"}],"date_updated":"2021-01-12T08:08:16Z","date_created":"2019-07-12T08:34:57Z"},{"author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Virk, Ziga","first_name":"Ziga","last_name":"Virk"},{"last_name":"Wagner","first_name":"Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Hubert"}],"date_updated":"2021-01-12T08:08:23Z","date_created":"2019-07-17T10:36:09Z","volume":129,"year":"2019","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:47:35Z","conference":{"start_date":"2019-06-18","location":"Portland, OR, United States","end_date":"2019-06-21","name":"SoCG 2019: Symposium on Computational Geometry"},"doi":"10.4230/LIPICS.SOCG.2019.31","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1903.08510"]},"oa":1,"quality_controlled":"1","project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","call_identifier":"FWF","name":"Persistence and stability of geometric complexes"}],"month":"06","publication_identifier":{"isbn":["9783959771047"]},"oa_version":"Published Version","file":[{"date_created":"2019-07-24T06:40:01Z","date_updated":"2020-07-14T12:47:35Z","checksum":"8ec8720730d4c789bf7b06540f1c29f4","file_id":"6666","relation":"main_file","creator":"dernst","file_size":1355179,"content_type":"application/pdf","file_name":"2019_LIPICS_Edelsbrunner.pdf","access_level":"open_access"}],"_id":"6648","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Topological data analysis in information space","ddc":["510"],"intvolume":" 129","abstract":[{"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.","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"date_published":"2019-06-01T00:00:00Z","publication":"35th International Symposium on Computational Geometry","citation":{"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.","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.","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.","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.","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","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"},"page":"31:1-31:14","day":"01","has_accepted_license":"1","scopus_import":1},{"doi":"10.1246/bcsj.20190034","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","project":[{"grant_number":"694539","_id":"25CA28EA-B435-11E9-9278-68D0E5697425","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","call_identifier":"H2020"}],"month":"05","publication_identifier":{"issn":["00092673"]},"author":[{"full_name":"Zenmyo, Naoki","first_name":"Naoki","last_name":"Zenmyo"},{"last_name":"Tokumaru","first_name":"Hiroki","full_name":"Tokumaru, Hiroki"},{"full_name":"Uchinomiya, Shohei","last_name":"Uchinomiya","first_name":"Shohei"},{"full_name":"Fuchida, Hirokazu","first_name":"Hirokazu","last_name":"Fuchida"},{"last_name":"Tabata","first_name":"Shigekazu","id":"4427179E-F248-11E8-B48F-1D18A9856A87","full_name":"Tabata, Shigekazu"},{"last_name":"Hamachi","first_name":"Itaru","full_name":"Hamachi, Itaru"},{"last_name":"Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"},{"first_name":"Akio","last_name":"Ojida","full_name":"Ojida, Akio"}],"date_updated":"2021-01-12T08:08:26Z","date_created":"2019-07-21T21:59:16Z","volume":92,"year":"2019","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.","publication_status":"published","department":[{"_id":"RySh"}],"publisher":"Bulletin of the Chemical Society of Japan","file_date_updated":"2020-10-02T08:49:58Z","ec_funded":1,"date_published":"2019-05-15T00:00:00Z","publication":"Bulletin of the Chemical Society of Japan","citation":{"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","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.","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","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.","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.","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."},"article_type":"original","page":"995-1000","day":"15","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","oa_version":"Published Version","file":[{"file_id":"8594","relation":"main_file","date_updated":"2020-10-02T08:49:58Z","date_created":"2020-10-02T08:49:58Z","success":1,"checksum":"186de511d6e0ca93f5d981e2443eb8cd","file_name":"2019_BCSJ_Zenmyo.pdf","access_level":"open_access","creator":"dernst","file_size":2464903,"content_type":"application/pdf"}],"_id":"6659","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins","ddc":["570"],"intvolume":" 92","abstract":[{"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.","lang":"eng"}],"issue":"5","type":"journal_article"},{"issue":"3","abstract":[{"text":"In phase retrieval, we want to recover an unknown signal 𝑥∈ℂ𝑑 from n quadratic measurements of the form 𝑦𝑖=|⟨𝑎𝑖,𝑥⟩|2+𝑤𝑖, where 𝑎𝑖∈ℂ𝑑 are known sensing vectors and 𝑤𝑖 is measurement noise. We ask the following weak recovery question: What is the minimum number of measurements n needed to produce an estimator 𝑥^(𝑦) that is positively correlated with the signal 𝑥? We consider the case of Gaussian vectors 𝑎𝑎𝑖. 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 𝑛≤𝑑−𝑜(𝑑), no estimator can do significantly better than random and achieve a strictly positive correlation. For 𝑛≥𝑑+𝑜(𝑑), 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 𝑦𝑖 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.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","_id":"6662","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 19","status":"public","title":"Fundamental limits of weak recovery with applications to phase retrieval","day":"01","date_published":"2019-06-01T00:00:00Z","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","ista":"Mondelli M, Montanari A. 2019. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 19(3), 703–773.","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","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.","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.","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."},"publication":"Foundations of Computational Mathematics","page":"703-773","article_type":"original","extern":"1","author":[{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","first_name":"Marco","last_name":"Mondelli"},{"full_name":"Montanari, Andrea","last_name":"Montanari","first_name":"Andrea"}],"volume":19,"date_created":"2019-07-22T13:23:48Z","date_updated":"2021-01-12T08:08:28Z","year":"2019","publisher":"Springer","publication_status":"published","publication_identifier":{"eissn":["1615-3383"]},"month":"06","doi":"10.1007/s10208-018-9395-y","language":[{"iso":"eng"}],"external_id":{"arxiv":["1708.05932"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.05932"}],"quality_controlled":"1"}]