[{"quality_controlled":"1","publisher":"IOS Press","oa":1,"date_published":"2019-01-01T00:00:00Z","doi":"10.3233/JCS-181131","date_created":"2019-01-27T22:59:10Z","page":"75-111","day":"1","publication":"Journal of Computer Security","year":"2019","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"title":"Per-session security: Password-based cryptography revisited","author":[{"first_name":"Gregory","last_name":"Demay","full_name":"Demay, Gregory"},{"first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","last_name":"Gazi","full_name":"Gazi, Peter"},{"first_name":"Ueli","full_name":"Maurer, Ueli","last_name":"Maurer"},{"full_name":"Tackmann, Bjorn","last_name":"Tackmann","first_name":"Bjorn"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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","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","short":"G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27 (2019) 75–111.","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.","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."},"month":"01","intvolume":" 27","scopus_import":"1","main_file_link":[{"url":"https://eprint.iacr.org/2016/166","open_access":"1"}],"oa_version":"Preprint","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."}],"volume":27,"issue":"1","ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0926227X"]},"publication_status":"published","status":"public","article_type":"original","type":"journal_article","_id":"5887","department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T08:05:08Z"},{"year":"2019","publication_status":"published","publication_identifier":{"isbn":["978-3-6624-6446-5","978-3-6624-6447-2"],"issn":["0302-9743","1611-3349"]},"publication":"21st IAPR International Conference on Discrete Geometry for Computer Imagery","language":[{"iso":"eng"}],"day":"23","page":"27-37","date_created":"2019-03-21T12:12:19Z","date_published":"2019-02-23T00:00:00Z","volume":11414,"doi":"10.1007/978-3-030-14085-4_3","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"}],"oa_version":"None","alternative_title":["LNCS"],"quality_controlled":"1","publisher":"Springer Berlin Heidelberg","intvolume":" 11414","place":"Berlin, Heidelberg","month":"02","citation":{"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.","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.","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","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","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.","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.","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."},"date_updated":"2022-01-27T14:25:17Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","extern":"1","article_processing_charge":"No","author":[{"first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890"},{"first_name":"Gaëlle","full_name":"Largeteau-Skapin, Gaëlle","last_name":"Largeteau-Skapin"},{"last_name":"Zrour","full_name":"Zrour, Rita","first_name":"Rita"},{"last_name":"Andres","full_name":"Andres, Eric","first_name":"Eric"}],"title":"Rhombic dodecahedron grid—coordinate system and 3D digital object definitions","_id":"6163","conference":{"start_date":"2019-03-26","location":"Marne-la-Vallée, France","end_date":"2019-03-28","name":"DGCI: International Conference on Discrete Geometry for Computer Imagery"},"type":"conference","status":"public"},{"day":"01","publication":"Journal of Computational Geometry ","has_accepted_license":"1","year":"2019","date_published":"2019-07-01T00:00:00Z","doi":"10.20382/jocg.v10i1a9","date_created":"2019-06-03T09:35:33Z","page":"223–256","quality_controlled":"1","publisher":"Carleton University","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","ama":"Dyer R, Vegter G, Wintraecken M. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 2019;10(1):223–256. doi:10.20382/jocg.v10i1a9","apa":"Dyer, R., Vegter, G., & Wintraecken, M. (2019). Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . Carleton University. https://doi.org/10.20382/jocg.v10i1a9","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.","short":"R. Dyer, G. Vegter, M. Wintraecken, Journal of Computational Geometry 10 (2019) 223–256.","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.","ista":"Dyer R, Vegter G, Wintraecken M. 2019. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 10(1), 223–256."},"title":"Simplices modelled on spaces of constant curvature","author":[{"last_name":"Dyer","full_name":"Dyer, Ramsay","first_name":"Ramsay"},{"first_name":"Gert","full_name":"Vegter, Gert","last_name":"Vegter"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs"}],"project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"57b4df2f16a74eb499734ec8ee240178","file_id":"6516","creator":"mwintrae","file_size":2170882,"date_updated":"2020-07-14T12:47:32Z","file_name":"mainJournalFinal.pdf","date_created":"2019-06-03T09:30:01Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1920-180X"]},"publication_status":"published","volume":10,"issue":"1","license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"oa_version":"Published Version","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."}],"month":"07","intvolume":" 10","scopus_import":1,"ddc":["510"],"date_updated":"2021-01-12T08:07:50Z","file_date_updated":"2020-07-14T12:47:32Z","department":[{"_id":"HeEd"}],"_id":"6515","status":"public","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"}},{"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","date_created":"2019-06-06T14:12:36Z","doi":"10.4230/LIPICS.ITCS.2019.60","date_published":"2019-01-10T00:00:00Z","publication":"10th Innovations in Theoretical Computer Science Conference","day":"10","year":"2019","has_accepted_license":"1","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"article_number":"60","title":"Simple verifiable delay functions","article_processing_charge":"No","author":[{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","ista":"Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 60.","mla":"Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60.","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","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","ieee":"K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124.","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019."},"intvolume":" 124","month":"01","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/627"}],"scopus_import":1,"alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"ec_funded":1,"volume":124,"language":[{"iso":"eng"}],"file":[{"checksum":"f0ae1bb161431d9db3dea5ace082bfb5","file_id":"6529","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2019-06-06T14:22:04Z","file_name":"2019_LIPIcs_Pietrzak.pdf","date_updated":"2020-07-14T12:47:33Z","file_size":558770,"creator":"dernst"}],"publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-095-8"]},"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"end_date":"2019-01-12","location":"San Diego, CA, United States","start_date":"2019-01-10","name":"ITCS 2019: Innovations in Theoretical Computer Science"},"type":"conference","_id":"6528","department":[{"_id":"KrPi"}],"file_date_updated":"2020-07-14T12:47:33Z","ddc":["000"],"date_updated":"2021-01-12T08:07:53Z"},{"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"In this paper, we address the problem of synthesizing periodic switching controllers for stabilizing a family of linear systems. Our broad approach consists of constructing a finite game graph based on the family of linear systems such that every winning strategy on the game graph corresponds to a stabilizing switching controller for the family of linear systems. The construction of a (finite) game graph, the synthesis of a winning strategy and the extraction of a stabilizing controller are all computationally feasible. We illustrate our method on an example."}],"month":"05","scopus_import":"1","file":[{"file_name":"2019_ICC_Kundu.pdf","date_created":"2020-10-21T13:13:49Z","file_size":396031,"date_updated":"2020-10-21T13:13:49Z","creator":"dernst","success":1,"file_id":"8687","checksum":"d622a91af1e427f6b1e0ba8e18a2b767","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-153866246-5"]},"publication_status":"published","_id":"6565","status":"public","type":"conference","conference":{"end_date":"2019-01-11","location":"Delhi, India","start_date":"2019-01-09","name":"ICC 2019 - Indian Control Conference"},"ddc":["000"],"date_updated":"2021-01-12T08:08:01Z","file_date_updated":"2020-10-21T13:13:49Z","department":[{"_id":"ToHe"}],"publisher":"IEEE","quality_controlled":"1","oa":1,"day":"16","publication":"5th Indian Control Conference Proceedings","has_accepted_license":"1","year":"2019","date_published":"2019-05-16T00:00:00Z","doi":"10.1109/INDIANCC.2019.8715598","date_created":"2019-06-17T06:57:33Z","article_number":"8715598","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","chicago":"Kundu, Atreyee, Miriam Garcia Soto, and Pavithra Prabhakar. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” In 5th Indian Control Conference Proceedings. IEEE, 2019. https://doi.org/10.1109/INDIANCC.2019.8715598.","ieee":"A. Kundu, M. Garcia Soto, and P. Prabhakar, “Formal synthesis of stabilizing controllers for periodically controlled linear switched systems,” in 5th Indian Control Conference Proceedings, Delhi, India, 2019.","short":"A. Kundu, M. Garcia Soto, P. Prabhakar, in:, 5th Indian Control Conference Proceedings, IEEE, 2019.","ama":"Kundu A, Garcia Soto M, Prabhakar P. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In: 5th Indian Control Conference Proceedings. IEEE; 2019. doi:10.1109/INDIANCC.2019.8715598","apa":"Kundu, A., Garcia Soto, M., & Prabhakar, P. (2019). Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In 5th Indian Control Conference Proceedings. Delhi, India: IEEE. https://doi.org/10.1109/INDIANCC.2019.8715598","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."},"title":"Formal synthesis of stabilizing controllers for periodically controlled linear switched systems","author":[{"last_name":"Kundu","full_name":"Kundu, Atreyee","first_name":"Atreyee"},{"id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","first_name":"Miriam","orcid":"0000−0003−2936−5719","full_name":"Garcia Soto, Miriam","last_name":"Garcia Soto"},{"full_name":"Prabhakar, Pavithra","last_name":"Prabhakar","first_name":"Pavithra"}],"article_processing_charge":"No"},{"page":"275-279","date_published":"2019-08-01T00:00:00Z","date_created":"2019-07-12T08:34:57Z","ec_funded":1,"has_accepted_license":"1","year":"2019","publication_status":"published","day":"01","file":[{"date_updated":"2020-07-14T12:47:34Z","file_size":321176,"creator":"mwintrae","date_created":"2019-07-12T08:32:46Z","file_name":"IntrinsicExtrinsicCCCG2019.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"ceabd152cfa55170d57763f9c6c60a53","file_id":"6629"}],"language":[{"iso":"eng"}],"publication":"The 31st Canadian Conference in Computational Geometry","scopus_import":1,"quality_controlled":"1","oa":1,"month":"08","abstract":[{"lang":"eng","text":"Fejes Tóth [5] and Schneider [9] studied approximations of smooth convex hypersurfaces in Euclidean space by piecewise flat triangular meshes with a given number of vertices on the hypersurface that are optimal with respect to Hausdorff distance. They proved that this Hausdorff distance decreases inversely proportional with m 2/(d−1), where m is the number of vertices and d is the dimension of Euclidean space. Moreover the pro-portionality constant can be expressed in terms of the Gaussian curvature, an intrinsic quantity. In this short note, we prove the extrinsic nature of this constant for manifolds of sufficiently high codimension. We do so by constructing an family of isometric embeddings of the flat torus in Euclidean space."}],"oa_version":"Submitted Version","author":[{"last_name":"Vegter","full_name":"Vegter, Gert","first_name":"Gert"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220"}],"file_date_updated":"2020-07-14T12:47:34Z","title":"The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds","department":[{"_id":"HeEd"}],"citation":{"ama":"Vegter G, Wintraecken M. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In: The 31st Canadian Conference in Computational Geometry. ; 2019:275-279.","apa":"Vegter, G., & Wintraecken, M. (2019). The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In The 31st Canadian Conference in Computational Geometry (pp. 275–279). Edmonton, Canada.","short":"G. Vegter, M. Wintraecken, in:, The 31st Canadian Conference in Computational Geometry, 2019, pp. 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.","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.","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.","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."},"date_updated":"2021-01-12T08:08:16Z","ddc":["004"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"conference","conference":{"name":"CCCG: Canadian Conference in Computational Geometry","start_date":"2019-08-08","location":"Edmonton, Canada","end_date":"2019-08-10"},"project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"status":"public","_id":"6628"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"SoCG 2019: Symposium on Computational Geometry","start_date":"2019-06-18","location":"Portland, OR, United States","end_date":"2019-06-21"},"type":"conference","status":"public","_id":"6648","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:47:35Z","date_updated":"2021-01-12T08:08:23Z","ddc":["510"],"scopus_import":1,"alternative_title":["LIPIcs"],"intvolume":" 129","month":"06","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"}],"oa_version":"Published Version","volume":129,"publication_status":"published","publication_identifier":{"isbn":["9783959771047"]},"language":[{"iso":"eng"}],"file":[{"file_id":"6666","checksum":"8ec8720730d4c789bf7b06540f1c29f4","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2019-07-24T06:40:01Z","file_name":"2019_LIPICS_Edelsbrunner.pdf","date_updated":"2020-07-14T12:47:35Z","file_size":1355179,"creator":"dernst"}],"project":[{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"external_id":{"arxiv":["1903.08510"]},"author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"last_name":"Virk","full_name":"Virk, Ziga","first_name":"Ziga"},{"last_name":"Wagner","full_name":"Wagner, Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert"}],"title":"Topological data analysis in information space","citation":{"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.","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.","ama":"Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:31:1-31:14. doi:10.4230/LIPICS.SOCG.2019.31","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2019). Topological data analysis in information space. In 35th International Symposium on Computational Geometry (Vol. 129, p. 31:1-31:14). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.31","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","page":"31:1-31:14","date_created":"2019-07-17T10:36:09Z","doi":"10.4230/LIPICS.SOCG.2019.31","date_published":"2019-06-01T00:00:00Z","year":"2019","has_accepted_license":"1","publication":"35th International Symposium on Computational Geometry","day":"01"},{"_id":"6659","status":"public","article_type":"original","type":"journal_article","ddc":["570"],"date_updated":"2021-01-12T08:08:26Z","file_date_updated":"2020-10-02T08:49:58Z","department":[{"_id":"RySh"}],"oa_version":"Published Version","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"}],"intvolume":" 92","month":"05","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"success":1,"file_id":"8594","checksum":"186de511d6e0ca93f5d981e2443eb8cd","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2019_BCSJ_Zenmyo.pdf","date_created":"2020-10-02T08:49:58Z","creator":"dernst","file_size":2464903,"date_updated":"2020-10-02T08:49:58Z"}],"publication_status":"published","publication_identifier":{"issn":["00092673"]},"ec_funded":1,"issue":"5","volume":92,"project":[{"grant_number":"694539","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","_id":"25CA28EA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","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","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","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."},"title":"Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins","article_processing_charge":"No","author":[{"full_name":"Zenmyo, Naoki","last_name":"Zenmyo","first_name":"Naoki"},{"full_name":"Tokumaru, Hiroki","last_name":"Tokumaru","first_name":"Hiroki"},{"first_name":"Shohei","full_name":"Uchinomiya, Shohei","last_name":"Uchinomiya"},{"first_name":"Hirokazu","last_name":"Fuchida","full_name":"Fuchida, Hirokazu"},{"last_name":"Tabata","full_name":"Tabata, Shigekazu","id":"4427179E-F248-11E8-B48F-1D18A9856A87","first_name":"Shigekazu"},{"first_name":"Itaru","last_name":"Hamachi","full_name":"Hamachi, Itaru"},{"last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"full_name":"Ojida, Akio","last_name":"Ojida","first_name":"Akio"}],"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.","oa":1,"quality_controlled":"1","publisher":"Bulletin of the Chemical Society of Japan","publication":"Bulletin of the Chemical Society of Japan","day":"15","year":"2019","has_accepted_license":"1","date_created":"2019-07-21T21:59:16Z","date_published":"2019-05-15T00:00:00Z","doi":"10.1246/bcsj.20190034","page":"995-1000"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","ama":"Mondelli M, Montanari A. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 2019;19(3):703-773. doi:10.1007/s10208-018-9395-y","apa":"Mondelli, M., & Montanari, A. (2019). Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-018-9395-y","short":"M. Mondelli, A. Montanari, Foundations of Computational Mathematics 19 (2019) 703–773.","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.","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.","ista":"Mondelli M, Montanari A. 2019. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 19(3), 703–773."},"title":"Fundamental limits of weak recovery with applications to phase retrieval","external_id":{"arxiv":["1708.05932"]},"author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"last_name":"Montanari","full_name":"Montanari, Andrea","first_name":"Andrea"}],"publication":"Foundations of Computational Mathematics","day":"01","year":"2019","date_created":"2019-07-22T13:23:48Z","date_published":"2019-06-01T00:00:00Z","doi":"10.1007/s10208-018-9395-y","page":"703-773","oa":1,"publisher":"Springer","quality_controlled":"1","extern":"1","date_updated":"2021-01-12T08:08:28Z","_id":"6662","status":"public","article_type":"original","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1615-3383"]},"volume":19,"issue":"3","oa_version":"Preprint","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"}],"intvolume":" 19","month":"06","main_file_link":[{"url":"https://arxiv.org/abs/1708.05932","open_access":"1"}]},{"type":"journal_article","status":"public","_id":"6672","author":[{"full_name":"Boissonnat, Jean-Daniel","last_name":"Boissonnat","first_name":"Jean-Daniel"},{"first_name":"Mael","last_name":"Rouxel-Labbé","full_name":"Rouxel-Labbé, Mael"},{"orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs"}],"external_id":{"arxiv":["1703.06487"]},"title":"Anisotropic triangulations via discrete Riemannian Voronoi diagrams","date_updated":"2021-01-12T08:08:30Z","citation":{"ista":"Boissonnat J-D, Rouxel-Labbé M, Wintraecken M. 2019. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. 48(3), 1046–1097.","chicago":"Boissonnat, Jean-Daniel, Mael Rouxel-Labbé, and Mathijs Wintraecken. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM), 2019. https://doi.org/10.1137/17m1152292.","ama":"Boissonnat J-D, Rouxel-Labbé M, Wintraecken M. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. 2019;48(3):1046-1097. doi:10.1137/17m1152292","apa":"Boissonnat, J.-D., Rouxel-Labbé, M., & Wintraecken, M. (2019). Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM). https://doi.org/10.1137/17m1152292","short":"J.-D. Boissonnat, M. Rouxel-Labbé, M. Wintraecken, SIAM Journal on Computing 48 (2019) 1046–1097.","ieee":"J.-D. Boissonnat, M. Rouxel-Labbé, and M. Wintraecken, “Anisotropic triangulations via discrete Riemannian Voronoi diagrams,” SIAM Journal on Computing, vol. 48, no. 3. Society for Industrial & Applied Mathematics (SIAM), pp. 1046–1097, 2019.","mla":"Boissonnat, Jean-Daniel, et al. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.” SIAM Journal on Computing, vol. 48, no. 3, Society for Industrial & Applied Mathematics (SIAM), 2019, pp. 1046–97, doi:10.1137/17m1152292."},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Society for Industrial & Applied Mathematics (SIAM)","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1703.06487","open_access":"1"}],"month":"05","intvolume":" 48","abstract":[{"lang":"eng","text":"The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult problem in a practical way, we introduce the discrete Riemannian Voronoi diagram, a discrete structure that approximates the Riemannian Voronoi diagram. This structure has been implemented and was shown to lead to good triangulations in $\\mathbb{R}^2$ and on surfaces embedded in $\\mathbb{R}^3$ as detailed in our experimental companion paper. In this paper, we study theoretical aspects of our structure. Given a finite set of points $\\mathcal{P}$ in a domain $\\Omega$ equipped with a Riemannian metric, we compare the discrete Riemannian Voronoi diagram of $\\mathcal{P}$ to its Riemannian Voronoi diagram. Both diagrams have dual structures called the discrete Riemannian Delaunay and the Riemannian Delaunay complex. We provide conditions that guarantee that these dual structures are identical. It then follows from previous results that the discrete Riemannian Delaunay complex can be embedded in $\\Omega$ under sufficient conditions, leading to an anisotropic triangulation with curved simplices. Furthermore, we show that, under similar conditions, the simplices of this triangulation can be straightened."}],"oa_version":"Preprint","page":"1046-1097","doi":"10.1137/17m1152292","date_published":"2019-05-21T00:00:00Z","volume":48,"issue":"3","date_created":"2019-07-24T08:42:12Z","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"year":"2019","publication_status":"published","day":"21","publication":"SIAM Journal on Computing","language":[{"iso":"eng"}]}]