[{"year":"2019","day":"19","publication":"The Astrophysical Journal Supplement Series","doi":"10.3847/1538-4365/ab3b56","date_published":"2019-09-19T00:00:00Z","date_created":"2022-07-19T09:21:58Z","acknowledgement":"The authors thank Róbert Szabó Paul G. Beck, Katrien Kolenberg, and Isabel L. Colman for helping on the classification of stars. This paper includes data collected by the Kepler mission and obtained from the MAST data archive at the Space Telescope Science Institute (STScI). Funding for the Kepler mission is provided by the National Aeronautics and Space Administration (NASA) Science Mission Directorate. STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5–26555. A.R.G.S. acknowledges the support from NASA under grant NNX17AF27G. R.A.G. and L.B. acknowledge the support from PLATO and GOLF CNES grants. S.M. acknowledges the support from the Ramon y Cajal fellowship number RYC-2015-17697. T.S.M. acknowledges support from a Visiting Fellowship at the Max Planck Institute for Solar System Research. This research has made use of the NASA Exoplanet Archive, which is operated by the California Institute of Technology, under contract with the National Aeronautics and Space Administration under the Exoplanet Exploration Program.\r\n\r\nSoftware: KADACS (García et al. 2011), NumPy (van der Walt et al. 2011), SciPy (Jones et al. 2001), Matplotlib (Hunter 2007).\r\n\r\nFacilities: MAST - , Kepler Eclipsing Binary Catalog - , Exoplanet Archive. -","quality_controlled":"1","publisher":"IOP Publishing","oa":1,"citation":{"ista":"Santos ARG, García RA, Mathur S, Bugnet LA, van Saders JL, Metcalfe TS, Simonian GVA, Pinsonneault MH. 2019. Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. The Astrophysical Journal Supplement Series. 244(1), 21.","chicago":"Santos, A. R. G., R. A. García, S. Mathur, Lisa Annabelle Bugnet, J. L. van Saders, T. S. Metcalfe, G. V. A. Simonian, and M. H. Pinsonneault. “Surface Rotation and Photometric Activity for Kepler Targets. I. M and K Main-Sequence Stars.” The Astrophysical Journal Supplement Series. IOP Publishing, 2019. https://doi.org/10.3847/1538-4365/ab3b56.","ama":"Santos ARG, García RA, Mathur S, et al. Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. The Astrophysical Journal Supplement Series. 2019;244(1). doi:10.3847/1538-4365/ab3b56","apa":"Santos, A. R. G., García, R. A., Mathur, S., Bugnet, L. A., van Saders, J. L., Metcalfe, T. S., … Pinsonneault, M. H. (2019). Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. The Astrophysical Journal Supplement Series. IOP Publishing. https://doi.org/10.3847/1538-4365/ab3b56","ieee":"A. R. G. Santos et al., “Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars,” The Astrophysical Journal Supplement Series, vol. 244, no. 1. IOP Publishing, 2019.","short":"A.R.G. Santos, R.A. García, S. Mathur, L.A. Bugnet, J.L. van Saders, T.S. Metcalfe, G.V.A. Simonian, M.H. Pinsonneault, The Astrophysical Journal Supplement Series 244 (2019).","mla":"Santos, A. R. G., et al. “Surface Rotation and Photometric Activity for Kepler Targets. I. M and K Main-Sequence Stars.” The Astrophysical Journal Supplement Series, vol. 244, no. 1, 21, IOP Publishing, 2019, doi:10.3847/1538-4365/ab3b56."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Santos, A. R. G.","last_name":"Santos","first_name":"A. R. G."},{"first_name":"R. A.","last_name":"García","full_name":"García, R. A."},{"first_name":"S.","full_name":"Mathur, S.","last_name":"Mathur"},{"last_name":"Bugnet","orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","first_name":"Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"last_name":"van Saders","full_name":"van Saders, J. L.","first_name":"J. L."},{"first_name":"T. S.","last_name":"Metcalfe","full_name":"Metcalfe, T. S."},{"first_name":"G. V. A.","full_name":"Simonian, G. V. A.","last_name":"Simonian"},{"full_name":"Pinsonneault, M. H.","last_name":"Pinsonneault","first_name":"M. H."}],"external_id":{"arxiv":["1908.05222"]},"article_processing_charge":"No","title":"Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars","article_number":"21","publication_identifier":{"issn":["0067-0049"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"1","volume":244,"abstract":[{"text":"Brightness variations due to dark spots on the stellar surface encode information about stellar surface rotation and magnetic activity. In this work, we analyze the Kepler long-cadence data of 26,521 main-sequence stars of spectral types M and K in order to measure their surface rotation and photometric activity level. Rotation-period estimates are obtained by the combination of a wavelet analysis and autocorrelation function of the light curves. Reliable rotation estimates are determined by comparing the results from the different rotation diagnostics and four data sets. We also measure the photometric activity proxy Sph using the amplitude of the flux variations on an appropriate timescale. We report rotation periods and photometric activity proxies for about 60% of the sample, including 4431 targets for which McQuillan et al. did not report a rotation period. For the common targets with rotation estimates in this study and in McQuillan et al., our rotation periods agree within 99%. In this work, we also identify potential polluters, such as misclassified red giants and classical pulsator candidates. Within the parameter range we study, there is a mild tendency for hotter stars to have shorter rotation periods. The photometric activity proxy spans a wider range of values with increasing effective temperature. The rotation period and photometric activity proxy are also related, with Sph being larger for fast rotators. Similar to McQuillan et al., we find a bimodal distribution of rotation periods.","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1908.05222","open_access":"1"}],"month":"09","intvolume":" 244","date_updated":"2022-08-22T08:10:38Z","extern":"1","_id":"11623","article_type":"original","type":"journal_article","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics","methods: data analysis","stars: activity","stars: low-mass","stars: rotation","starspots","techniques: photometric"]},{"oa_version":"Preprint","abstract":[{"lang":"eng","text":"For a solar-like star, the surface rotation evolves with time, allowing in principle to estimate the age of a star from its surface rotation period. Here we are interested in measuring surface rotation periods of solar-like stars observed by the NASA mission Kepler. Different methods have been developed to track rotation signals in Kepler photometric light curves: time-frequency analysis based on wavelet techniques, autocorrelation and composite spectrum. We use the learning abilities of random forest classifiers to take decisions during two crucial steps of the analysis. First, given some input parameters, we discriminate the considered Kepler targets between rotating MS stars, non-rotating MS stars, red giants, binaries and pulsators. We then use a second classifier only on the MS rotating targets to decide the best data analysis treatment."}],"month":"06","main_file_link":[{"url":"https://arxiv.org/abs/1906.09609","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"publication":"arXiv","day":"23","year":"2019","publication_status":"submitted","date_created":"2022-07-20T11:18:53Z","doi":"10.48550/arXiv.1906.09609","date_published":"2019-06-23T00:00:00Z","article_number":"1906.09609","_id":"11627","keyword":["asteroseismology","rotation","solar-like stars","kepler","machine learning","random forest"],"status":"public","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"mla":"Breton, S. N., et al. “Determining Surface Rotation Periods of Solar-like Stars Observed by the Kepler Mission Using Machine Learning Techniques.” ArXiv, 1906.09609, doi:10.48550/arXiv.1906.09609.","short":"S.N. Breton, L.A. Bugnet, A.R.G. Santos, A.L. Saux, S. Mathur, P.L. Palle, R.A. Garcia, ArXiv (n.d.).","ieee":"S. N. Breton et al., “Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques,” arXiv. .","ama":"Breton SN, Bugnet LA, Santos ARG, et al. Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques. arXiv. doi:10.48550/arXiv.1906.09609","apa":"Breton, S. N., Bugnet, L. A., Santos, A. R. G., Saux, A. L., Mathur, S., Palle, P. L., & Garcia, R. A. (n.d.). Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques. arXiv. https://doi.org/10.48550/arXiv.1906.09609","chicago":"Breton, S. N., Lisa Annabelle Bugnet, A. R. G. Santos, A. Le Saux, S. Mathur, P. L. Palle, and R. A. Garcia. “Determining Surface Rotation Periods of Solar-like Stars Observed by the Kepler Mission Using Machine Learning Techniques.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1906.09609.","ista":"Breton SN, Bugnet LA, Santos ARG, Saux AL, Mathur S, Palle PL, Garcia RA. Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques. arXiv, 1906.09609."},"date_updated":"2022-08-22T08:16:53Z","title":"Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques","external_id":{"arxiv":["1906.09609"]},"article_processing_charge":"No","author":[{"full_name":"Breton, S. N.","last_name":"Breton","first_name":"S. N."},{"id":"d9edb345-f866-11ec-9b37-d119b5234501","first_name":"Lisa Annabelle","last_name":"Bugnet","orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle"},{"first_name":"A. R. G.","last_name":"Santos","full_name":"Santos, A. R. G."},{"first_name":"A. Le","last_name":"Saux","full_name":"Saux, A. Le"},{"first_name":"S.","full_name":"Mathur, S.","last_name":"Mathur"},{"last_name":"Palle","full_name":"Palle, P. L.","first_name":"P. L."},{"full_name":"Garcia, R. A.","last_name":"Garcia","first_name":"R. A."}]},{"date_published":"2019-06-23T00:00:00Z","doi":"10.48550/arXiv.1906.09611","date_created":"2022-07-21T06:57:10Z","publication_status":"submitted","year":"2019","day":"23","language":[{"iso":"eng"}],"publication":"arXiv","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1906.09611"}],"oa":1,"month":"06","abstract":[{"text":"The second mission of NASA’s Kepler satellite, K2, has collected hundreds of thousands of lightcurves for stars close to the ecliptic plane. This new sample could increase the number of known pulsating stars and then improve our understanding of those stars. For the moment only a few stars have been properly classified and published. In this work, we present a method to automaticly classify K2 pulsating stars using a Machine Learning technique called Random Forest. The objective is to sort out the stars in four classes: red giant (RG), main-sequence Solar-like stars (SL), classical pulsators (PULS) and Other. To do this we use the effective temperatures and the luminosities of the stars as well as the FliPer features, that measures the amount of power contained in the power spectral density. The classifier now retrieves the right classification for more than 80% of the stars.","lang":"eng"}],"oa_version":"Preprint","author":[{"first_name":"A. Le","last_name":"Saux","full_name":"Saux, A. Le"},{"last_name":"Bugnet","orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501","first_name":"Lisa Annabelle"},{"first_name":"S.","full_name":"Mathur, S.","last_name":"Mathur"},{"first_name":"S. N.","full_name":"Breton, S. N.","last_name":"Breton"},{"last_name":"Garcia","full_name":"Garcia, R. A.","first_name":"R. A."}],"article_processing_charge":"No","external_id":{"arxiv":["1906.09611"]},"title":"Automatic classification of K2 pulsating stars using machine learning techniques","date_updated":"2022-08-22T08:20:29Z","citation":{"chicago":"Saux, A. Le, Lisa Annabelle Bugnet, S. Mathur, S. N. Breton, and R. A. Garcia. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1906.09611.","ista":"Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. arXiv, 1906.09611.","mla":"Saux, A. Le, et al. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” ArXiv, 1906.09611, doi:10.48550/arXiv.1906.09611.","ama":"Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. arXiv. doi:10.48550/arXiv.1906.09611","apa":"Saux, A. L., Bugnet, L. A., Mathur, S., Breton, S. N., & Garcia, R. A. (n.d.). Automatic classification of K2 pulsating stars using machine learning techniques. arXiv. https://doi.org/10.48550/arXiv.1906.09611","short":"A.L. Saux, L.A. Bugnet, S. Mathur, S.N. Breton, R.A. Garcia, ArXiv (n.d.).","ieee":"A. L. Saux, L. A. Bugnet, S. Mathur, S. N. Breton, and R. A. Garcia, “Automatic classification of K2 pulsating stars using machine learning techniques,” arXiv. ."},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","status":"public","keyword":["asteroseismology - methods","data analysis - thecniques","machine learning - stars","oscillations"],"_id":"11630","article_number":"1906.09611"},{"year":"2019","publication":"46th International Colloquium on Automata, Languages, and Programming","day":"04","date_created":"2022-08-12T08:14:51Z","date_published":"2019-07-04T00:00:00Z","doi":"10.4230/LIPICS.ICALP.2019.13","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"chicago":"Ancona, Bertie, Monika H Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein. “Algorithms and Hardness for Diameter in Dynamic Graphs.” In 46th International Colloquium on Automata, Languages, and Programming, Vol. 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.13.","ista":"Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. 2019. Algorithms and hardness for diameter in dynamic graphs. 46th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 132, 13.","mla":"Ancona, Bertie, et al. “Algorithms and Hardness for Diameter in Dynamic Graphs.” 46th International Colloquium on Automata, Languages, and Programming, vol. 132, 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ICALP.2019.13.","ama":"Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. Algorithms and hardness for diameter in dynamic graphs. In: 46th International Colloquium on Automata, Languages, and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ICALP.2019.13","apa":"Ancona, B., Henzinger, M. H., Roditty, L., Williams, V. V., & Wein, N. (2019). Algorithms and hardness for diameter in dynamic graphs. In 46th International Colloquium on Automata, Languages, and Programming (Vol. 132). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.13","short":"B. Ancona, M.H. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"B. Ancona, M. H. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms and hardness for diameter in dynamic graphs,” in 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["811.12527"]},"article_processing_charge":"No","author":[{"first_name":"Bertie","last_name":"Ancona","full_name":"Ancona, Bertie"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"first_name":"Liam","last_name":"Roditty","full_name":"Roditty, Liam"},{"first_name":"Virginia Vassilevska","last_name":"Williams","full_name":"Williams, Virginia Vassilevska"},{"first_name":"Nicole","full_name":"Wein, Nicole","last_name":"Wein"}],"title":"Algorithms and hardness for diameter in dynamic graphs","article_number":"13","publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-109-2"]},"language":[{"iso":"eng"}],"volume":132,"abstract":[{"lang":"eng","text":"The diameter, radius and eccentricities are natural graph parameters. While these problems have been studied extensively, there are no known dynamic algorithms for them beyond the ones that follow from trivial recomputation after each update or from solving dynamic All-Pairs Shortest Paths (APSP), which is very computationally intensive. This is the situation for dynamic approximation algorithms as well, and even if only edge insertions or edge deletions need to be supported.\r\nThis paper provides a comprehensive study of the dynamic approximation of Diameter, Radius and Eccentricities, providing both conditional lower bounds, and new algorithms whose bounds are optimal under popular hypotheses in fine-grained complexity. Some of the highlights include:\r\n- Under popular hardness hypotheses, there can be no significantly better fully dynamic approximation algorithms than recomputing the answer after each update, or maintaining full APSP.\r\n- Nearly optimal partially dynamic (incremental/decremental) algorithms can be achieved via efficient reductions to (incremental/decremental) maintenance of Single-Source Shortest Paths. For instance, a nearly (3/2+epsilon)-approximation to Diameter in directed or undirected n-vertex, m-edge graphs can be maintained decrementally in total time m^{1+o(1)}sqrt{n}/epsilon^2. This nearly matches the static 3/2-approximation algorithm for the problem that is known to be conditionally optimal."}],"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ICALP.2019.13"}],"alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 132","month":"07","date_updated":"2023-02-16T10:48:24Z","extern":"1","_id":"11826","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"2019-07-09","end_date":"2019-07-12","location":"Patras, Greece"},"type":"conference","status":"public"},{"page":"43–44","date_published":"2019-06-20T00:00:00Z","doi":"10.1145/3309697.3331503","date_created":"2022-08-16T07:14:57Z","publication_identifier":{"isbn":["978-1-4503-6678-6"]},"publication_status":"published","year":"2019","day":"20","language":[{"iso":"eng"}],"publication":"SIGMETRICS'19: International Conference on Measurement and Modeling of Computer Systems","quality_controlled":"1","scopus_import":"1","publisher":"Association for Computing Machinery","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1904.05474","open_access":"1"}],"month":"06","abstract":[{"lang":"eng","text":"Modern networked systems are increasingly reconfigurable, enabling demand-aware infrastructures whose resources can be adjusted according to the workload they currently serve. Such dynamic adjustments can be exploited to improve network utilization and hence performance, by moving frequently interacting communication partners closer, e.g., collocating them in the same server or datacenter. However, dynamically changing the embedding of workloads is algorithmically challenging: communication patterns are often not known ahead of time, but must be learned. During the learning process, overheads related to unnecessary moves (i.e., re-embeddings) should be minimized. This paper studies a fundamental model which captures the tradeoff between the benefits and costs of dynamically collocating communication partners on l servers, in an online manner. Our main contribution is a distributed online algorithm which is asymptotically almost optimal, i.e., almost matches the lower bound (also derived in this paper) on the competitive ratio of any (distributed or centralized) online algorithm."}],"oa_version":"Preprint","author":[{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Neumann","full_name":"Neumann, Stefan","first_name":"Stefan"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"article_processing_charge":"No","external_id":{"arxiv":["1904.05474"]},"title":"Efficient distributed workload (re-)embedding","date_updated":"2023-02-17T09:41:45Z","citation":{"mla":"Henzinger, Monika H., et al. “Efficient Distributed Workload (Re-)Embedding.” SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44, doi:10.1145/3309697.3331503.","ama":"Henzinger MH, Neumann S, Schmid S. Efficient distributed workload (re-)embedding. In: SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery; 2019:43–44. doi:10.1145/3309697.3331503","apa":"Henzinger, M. H., Neumann, S., & Schmid, S. (2019). Efficient distributed workload (re-)embedding. In SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems (pp. 43–44). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3309697.3331503","ieee":"M. H. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload (re-)embedding,” in SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Phoenix, AZ, United States, 2019, pp. 43–44.","short":"M.H. Henzinger, S. Neumann, S. Schmid, in:, SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44.","chicago":"Henzinger, Monika H, Stefan Neumann, and Stefan Schmid. “Efficient Distributed Workload (Re-)Embedding.” In SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, 43–44. Association for Computing Machinery, 2019. https://doi.org/10.1145/3309697.3331503.","ista":"Henzinger MH, Neumann S, Schmid S. 2019. Efficient distributed workload (re-)embedding. SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 43–44."},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","conference":{"end_date":"2019-06-28","location":"Phoenix, AZ, United States","start_date":"2019-06-24","name":"SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems"},"status":"public","_id":"11850"},{"citation":{"ieee":"S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Vienna Graph Clustering,” in Protein-Protein Interaction Networks, vol. 2074, S. Canzar and F. Rojas Ringeling, Eds. Springer Nature, 2019, pp. 215–231.","short":"S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, S. Canzar, F. Rojas Ringeling (Eds.), Protein-Protein Interaction Networks, Springer Nature, 2019, pp. 215–231.","apa":"Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2019). Vienna Graph Clustering. In S. Canzar & F. Rojas Ringeling (Eds.), Protein-Protein Interaction Networks (Vol. 2074, pp. 215–231). Springer Nature. https://doi.org/10.1007/978-1-4939-9873-9_16","ama":"Biedermann S, Henzinger MH, Schulz C, Schuster B. Vienna Graph Clustering. In: Canzar S, Rojas Ringeling F, eds. Protein-Protein Interaction Networks. Vol 2074. MIMB. Springer Nature; 2019:215–231. doi:10.1007/978-1-4939-9873-9_16","mla":"Biedermann, Sonja, et al. “Vienna Graph Clustering.” Protein-Protein Interaction Networks, edited by Stefan Canzar and Francisca Rojas Ringeling, vol. 2074, Springer Nature, 2019, pp. 215–231, doi:10.1007/978-1-4939-9873-9_16.","ista":"Biedermann S, Henzinger MH, Schulz C, Schuster B. 2019.Vienna Graph Clustering. In: Protein-Protein Interaction Networks. Methods in Molecular Biology, vol. 2074, 215–231.","chicago":"Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster. “Vienna Graph Clustering.” In Protein-Protein Interaction Networks, edited by Stefan Canzar and Francisca Rojas Ringeling, 2074:215–231. MIMB. Springer Nature, 2019. https://doi.org/10.1007/978-1-4939-9873-9_16."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Sonja","full_name":"Biedermann, Sonja","last_name":"Biedermann"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Schulz, Christian","last_name":"Schulz","first_name":"Christian"},{"last_name":"Schuster","full_name":"Schuster, Bernhard","first_name":"Bernhard"}],"article_processing_charge":"No","external_id":{"pmid":["31583641"]},"title":"Vienna Graph Clustering","editor":[{"first_name":"Stefan","full_name":"Canzar, Stefan","last_name":"Canzar"},{"full_name":"Rojas Ringeling, Francisca","last_name":"Rojas Ringeling","first_name":"Francisca"}],"quality_controlled":"1","publisher":"Springer Nature","year":"2019","day":"04","publication":"Protein-Protein Interaction Networks","page":"215–231","date_published":"2019-10-04T00:00:00Z","doi":"10.1007/978-1-4939-9873-9_16","date_created":"2022-08-16T06:54:48Z","_id":"11847","series_title":"MIMB","type":"book_chapter","status":"public","date_updated":"2023-02-17T09:34:26Z","extern":"1","abstract":[{"text":"This paper serves as a user guide to the Vienna graph clustering framework. We review our general memetic algorithm, VieClus, to tackle the graph clustering problem. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. After giving a description of the algorithms employed, we establish the connection of the graph clustering problem to protein–protein interaction networks and moreover give a description on how the software can be used, what file formats are expected, and how this can be used to find functional groups in protein–protein interaction networks.","lang":"eng"}],"pmid":1,"oa_version":"None","scopus_import":"1","alternative_title":["Methods in Molecular Biology"],"month":"10","intvolume":" 2074","publication_identifier":{"eisbn":["9781493998739"],"isbn":["9781493998722"],"eissn":["1940-6029"],"issn":["1064-3745"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":2074},{"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."}],"oa_version":"Preprint","quality_controlled":"1","scopus_import":"1","publisher":"Institute of Electrical and Electronics Engineers","main_file_link":[{"url":"https://arxiv.org/abs/1909.11600","open_access":"1"}],"oa":1,"month":"11","publication_identifier":{"eisbn":["978-1-7281-4952-3"],"issn":["2575-8454"],"isbn":["978-1-7281-4953-0"]},"year":"2019","publication_status":"published","day":"01","publication":"60th Annual Symposium on Foundations of Computer Science","language":[{"iso":"eng"}],"page":"406-423","doi":"10.1109/focs.2019.00033","date_published":"2019-11-01T00:00:00Z","date_created":"2022-08-16T08:00:00Z","_id":"11853","type":"conference","conference":{"location":"Baltimore, MD, United States","end_date":"2019-11-12","start_date":"2019-11-09","name":"FOCS: Annual Symposium on Foundations of Computer Science"},"status":"public","citation":{"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.","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.","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.","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.","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","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."},"date_updated":"2023-02-17T09:50:37Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan","first_name":"Sayan"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"external_id":{"arxiv":["1909.11600"]},"article_processing_charge":"No","title":"A new deterministic algorithm for dynamic set cover"},{"oa_version":"Preprint","abstract":[{"lang":"eng","text":"The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weighted sum of the cut edges. In this paper, we engineer the fastest known exact algorithm for the problem. State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce the graph size such that at least one minimum cut is maintained in the contracted graph. Our algorithm achieves improvements in running time over these algorithms by a multitude of techniques. First, we use a recently developed fast and parallel inexact minimum cut algorithm to obtain a better bound for the problem. Afterwards, we use reductions that depend on this bound to reduce the size of the graph much faster than previously possible. We use improved data structures to further lower the running time of our algorithm. Additionally, we parallelize the contraction routines of Nagamochi et al. . Overall, we arrive at a system that significantly outperforms the fastest state-of-the-art solvers for the exact minimum cut problem."}],"month":"05","scopus_import":"1","quality_controlled":"1","publisher":"Institute of Electrical and Electronics Engineers","main_file_link":[{"url":"https://arxiv.org/abs/1808.05458"}],"day":"01","language":[{"iso":"eng"}],"publication":"33rd International Parallel and Distributed Processing Symposium","publication_identifier":{"eissn":["1530-2075"],"isbn":["978-1-7281-1247-3"],"eisbn":["978-1-7281-1246-6"]},"year":"2019","publication_status":"published","date_published":"2019-05-01T00:00:00Z","doi":"10.1109/ipdps.2019.00013","related_material":{"record":[{"relation":"later_version","id":"11851","status":"public"}]},"date_created":"2022-08-16T07:25:23Z","article_number":"8820968","_id":"11851","status":"public","type":"conference","conference":{"name":"IPDPS: International Parallel and Distributed Processing Symposium","start_date":"2019-05-20","end_date":"2019-05-24","location":"Rio de Janeiro, Brazil"},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T16:30:34Z","citation":{"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.","short":"M.H. Henzinger, A. Noe, C. Schulz, in:, 33rd International Parallel and Distributed Processing Symposium, Institute of Electrical and Electronics Engineers, 2019.","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","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","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.","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.","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."},"title":"Shared-memory exact minimum cuts","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"first_name":"Alexander","last_name":"Noe","full_name":"Noe, Alexander"},{"last_name":"Schulz","full_name":"Schulz, Christian","first_name":"Christian"}],"article_processing_charge":"No","external_id":{"arxiv":["1808.05458"]}},{"language":[{"iso":"eng"}],"publication":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","day":"01","year":"2019","publication_status":"published","publication_identifier":{"issn":["0737-8017"],"isbn":["978-1-4503-6705-9"]},"date_created":"2022-08-16T09:11:17Z","date_published":"2019-06-01T00:00:00Z","doi":"10.1145/3313276.3316346","page":"343–354","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We present the first sublinear-time algorithm that can compute the edge connectivity λ of a network exactly on distributed message-passing networks (the CONGEST model), as long as the network contains no multi-edge. We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity λ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes Õ(n1−1/353D1/353+n1−1/706) time to compute λ and a cut of cardinality λ with high probability, where n and D are the number of nodes and the diameter of the network, respectively, and Õ hides polylogarithmic factors. This running time is sublinear in n (i.e. Õ(n1−є)) whenever D is. Previous sublinear-time distributed algorithms can solve this problem either (i) exactly only when λ=O(n1/8−є) [Thurimella PODC’95; Pritchard, Thurimella, ACM Trans. Algorithms’11; Nanongkai, Su, DISC’14] or (ii) approximately [Ghaffari, Kuhn, DISC’13; Nanongkai, Su, DISC’14]. To achieve this we develop and combine several new techniques. First, we design the first distributed algorithm that can compute a k-edge connectivity certificate for any k=O(n1−є) in time Õ(√nk+D). The previous sublinear-time algorithm can do so only when k=o(√n) [Thurimella PODC’95]. In fact, our algorithm can be turned into the first parallel algorithm with polylogarithmic depth and near-linear work. Previous near-linear work algorithms are essentially sequential and previous polylogarithmic-depth algorithms require Ω(mk) work in the worst case (e.g. [Karger, Motwani, STOC’93]). Second, we show that by combining the recent distributed expander decomposition technique of [Chang, Pettie, Zhang, SODA’19] with techniques from the sequential deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC’15], we can decompose the network into a sublinear number of clusters with small average diameter and without any mincut separating a cluster (except the “trivial” ones). This leads to a simplification of the Kawarabayashi-Thorup framework (except that we are randomized while they are deterministic). This might make this framework more useful in other models of computation. Finally, by extending the tree packing technique from [Karger STOC’96], we can find the minimum cut in time proportional to the number of components. As a byproduct of this technique, we obtain an Õ(n)-time algorithm for computing exact minimum cut for weighted graphs."}],"month":"06","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.04341"}],"oa":1,"publisher":"Association for Computing Machinery","scopus_import":"1","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2023-02-17T10:26:25Z","citation":{"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.","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.","ama":"Daga M, Henzinger MH, Nanongkai D, Saranurak T. Distributed edge connectivity in sublinear time. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery; 2019:343–354. doi:10.1145/3313276.3316346","apa":"Daga, M., Henzinger, M. H., Nanongkai, D., & Saranurak, T. (2019). Distributed edge connectivity in sublinear time. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp. 343–354). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3313276.3316346","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.","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.","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."},"title":"Distributed edge connectivity in sublinear time","article_processing_charge":"No","external_id":{"arxiv":["1904.04341"]},"author":[{"last_name":"Daga","full_name":"Daga, Mohit","first_name":"Mohit"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Danupon","full_name":"Nanongkai, Danupon","last_name":"Nanongkai"},{"last_name":"Saranurak","full_name":"Saranurak, Thatchaphol","first_name":"Thatchaphol"}],"_id":"11865","status":"public","conference":{"location":"Phoenix, AZ, United States","end_date":"2019-06-26","start_date":"2019-06-23","name":"STOC: Symposium on Theory of Computing"},"type":"conference"},{"year":"2019","day":"01","publication":"30th Annual ACM-SIAM Symposium on Discrete Algorithms","page":"1899-1918","doi":"10.1137/1.9781611975482.115","date_published":"2019-01-01T00:00:00Z","date_created":"2022-08-16T09:50:33Z","quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics","oa":1,"citation":{"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.","ama":"Bernstein A, Forster S, Henzinger MH. A deamortization approach for dynamic spanner and dynamic maximal matching. In: 30th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2019:1899-1918. doi:10.1137/1.9781611975482.115","apa":"Bernstein, A., Forster, S., & Henzinger, M. H. (2019). A deamortization approach for dynamic spanner and dynamic maximal matching. In 30th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1899–1918). San Diego, CA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.115","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.","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Bernstein, Aaron","last_name":"Bernstein","first_name":"Aaron"},{"last_name":"Forster","full_name":"Forster, Sebastian","first_name":"Sebastian"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"external_id":{"arxiv":["1810.10932"]},"article_processing_charge":"No","title":"A deamortization approach for dynamic spanner and dynamic maximal matching","publication_identifier":{"eisbn":["978-1-61197-548-2"]},"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"earlier_version","id":"11871","status":"public"}]},"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"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1810.10932","open_access":"1"}],"month":"01","date_updated":"2023-02-21T16:31:21Z","extern":"1","_id":"11871","type":"conference","conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2019-01-06","location":"San Diego, CA, United States","end_date":"2019-01-09"},"status":"public"},{"date_updated":"2022-09-09T11:29:04Z","extern":"1","type":"journal_article","article_type":"original","status":"public","_id":"11898","volume":779,"publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.02304"}],"scopus_import":"1","intvolume":" 779","month":"08","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."}],"oa_version":"Preprint","article_processing_charge":"No","external_id":{"arxiv":["1902.02304"]},"author":[{"last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan","first_name":"Sayan"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Neumann, Stefan","last_name":"Neumann","first_name":"Stefan"}],"title":"New amortized cell-probe lower bounds for dynamic problems","citation":{"mla":"Bhattacharya, Sayan, et al. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science, vol. 779, Elsevier, 2019, pp. 72–87, doi:10.1016/j.tcs.2019.01.043.","short":"S. Bhattacharya, M.H. Henzinger, S. Neumann, Theoretical Computer Science 779 (2019) 72–87.","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","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","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.","ista":"Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 779, 72–87."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"72-87","date_created":"2022-08-17T09:02:15Z","doi":"10.1016/j.tcs.2019.01.043","date_published":"2019-08-02T00:00:00Z","year":"2019","publication":"Theoretical Computer Science","day":"02","oa":1,"quality_controlled":"1","publisher":"Elsevier"},{"author":[{"first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X"},{"last_name":"Malik","full_name":"Malik, Jamal A.","first_name":"Jamal A."},{"last_name":"Cavedon","full_name":"Cavedon, Cristian","first_name":"Cristian"},{"last_name":"Gisbertz","full_name":"Gisbertz, Sebastian","first_name":"Sebastian"},{"first_name":"Aleksandr","full_name":"Savateev, Aleksandr","last_name":"Savateev"},{"full_name":"Cruz, Daniel","last_name":"Cruz","first_name":"Daniel"},{"last_name":"Heil","full_name":"Heil, Tobias","first_name":"Tobias"},{"full_name":"Zhang, Guigang","last_name":"Zhang","first_name":"Guigang"},{"first_name":"Peter H.","full_name":"Seeberger, Peter H.","last_name":"Seeberger"}],"article_processing_charge":"No","external_id":{"pmid":["31050132"]},"title":"Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides","citation":{"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.","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.","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.","ama":"Pieber B, Malik JA, Cavedon C, et al. Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie International Edition. 2019;58(28):9575-9580. doi:10.1002/anie.201902785","apa":"Pieber, B., Malik, J. A., Cavedon, C., Gisbertz, S., Savateev, A., Cruz, D., … Seeberger, P. H. (2019). Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201902785","chicago":"Pieber, Bartholomäus, Jamal A. Malik, Cristian Cavedon, Sebastian Gisbertz, Aleksandr Savateev, Daniel Cruz, Tobias Heil, Guigang Zhang, and Peter H. Seeberger. “Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.” Angewandte Chemie International Edition. Wiley, 2019. https://doi.org/10.1002/anie.201902785.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Wiley","page":"9575-9580","doi":"10.1002/anie.201902785","date_published":"2019-07-08T00:00:00Z","date_created":"2022-08-24T10:50:19Z","year":"2019","day":"08","publication":"Angewandte Chemie International Edition","type":"journal_article","article_type":"letter_note","status":"public","_id":"11957","date_updated":"2023-02-21T10:09:16Z","extern":"1","scopus_import":"1","month":"07","intvolume":" 58","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."}],"pmid":1,"oa_version":"None","issue":"28","volume":58,"publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"publication_status":"published","language":[{"iso":"eng"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","ista":"Guberman M, Pieber B, Seeberger PH. 2019. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. 23(12), 2764–2770.","mla":"Guberman, Mónica, et al. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” Organic Process Research and Development, vol. 23, no. 12, American Chemical Society, 2019, pp. 2764–70, doi:10.1021/acs.oprd.9b00456.","short":"M. Guberman, B. Pieber, P.H. Seeberger, Organic Process Research and Development 23 (2019) 2764–2770.","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","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"},"title":"Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks","author":[{"full_name":"Guberman, Mónica","last_name":"Guberman","first_name":"Mónica"},{"first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"},{"first_name":"Peter H.","full_name":"Seeberger, Peter H.","last_name":"Seeberger"}],"article_processing_charge":"No","quality_controlled":"1","publisher":"American Chemical Society","oa":1,"day":"20","publication":"Organic Process Research and Development","year":"2019","date_published":"2019-12-20T00:00:00Z","doi":"10.1021/acs.oprd.9b00456","date_created":"2022-08-25T11:30:33Z","page":"2764-2770","_id":"11984","status":"public","type":"journal_article","article_type":"letter_note","extern":"1","date_updated":"2023-02-21T10:10:23Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Differentially protected galactosamine building blocks are key components for the synthesis of human and bacterial oligosaccharides. The azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal provides straightforward access to the corresponding 2-nitrogenated glycoside. Poor reproducibility and the use of azides that lead to the formation of potentially explosive and toxic species limit the scalability of this reaction and render it a bottleneck for carbohydrate synthesis. Here, we present a method for the safe, efficient, and reliable azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal at room temperature, using continuous flow chemistry. Careful analysis of the transformation resulted in reaction conditions that produce minimal side products while the reaction time was reduced drastically when compared to batch reactions. The flow setup is readily scalable to process 5 mmol of galactal in 3 h, producing 1.2 mmol/h of product."}],"month":"12","intvolume":" 23","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.oprd.9b00456"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1083-6160"],"eissn":["1520-586X"]},"publication_status":"published","volume":23,"issue":"12"},{"extern":"1","date_updated":"2023-02-21T10:10:19Z","_id":"11982","status":"public","article_type":"letter_note","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1523-7052"],"issn":["1523-7060"]},"issue":"13","volume":21,"pmid":1,"oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"intvolume":" 21","month":"07","main_file_link":[{"url":"https://doi.org/10.1021/acs.orglett.9b01957","open_access":"1"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","ista":"Cavedon C, Madani A, Seeberger PH, Pieber B. 2019. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. 21(13), 5331–5334.","mla":"Cavedon, Cristian, et al. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” Organic Letters, vol. 21, no. 13, American Chemical Society, 2019, pp. 5331–34, doi:10.1021/acs.orglett.9b01957.","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","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","short":"C. Cavedon, A. Madani, P.H. Seeberger, B. Pieber, Organic Letters 21 (2019) 5331–5334.","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."},"title":"Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides","external_id":{"pmid":["31247752"]},"article_processing_charge":"No","author":[{"first_name":"Cristian","last_name":"Cavedon","full_name":"Cavedon, Cristian"},{"first_name":"Amiera","full_name":"Madani, Amiera","last_name":"Madani"},{"last_name":"Seeberger","full_name":"Seeberger, Peter H.","first_name":"Peter H."},{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus","last_name":"Pieber","full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X"}],"publication":"Organic Letters","day":"05","year":"2019","date_created":"2022-08-25T11:18:00Z","date_published":"2019-07-05T00:00:00Z","doi":"10.1021/acs.orglett.9b01957","page":"5331-5334","oa":1,"quality_controlled":"1","publisher":"American Chemical Society"},{"volume":373,"issue":"3-4","file":[{"date_created":"2019-05-23T07:53:27Z","file_name":"2019_MathAnnalen_Browning.pdf","date_updated":"2020-07-14T12:45:12Z","file_size":712847,"creator":"dernst","file_id":"6479","checksum":"4061dc2fe99bee25d9adf2d2018cf608","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"04","intvolume":" 373","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Upper and lower bounds, of the expected order of magnitude, are obtained for the number of rational points of bounded height on any quartic del Pezzo surface over ℚ that contains a conic defined over ℚ ."}],"file_date_updated":"2020-07-14T12:45:12Z","extern":"1","ddc":["510"],"date_updated":"2021-01-12T06:52:37Z","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)"},"_id":"170","date_published":"2019-04-01T00:00:00Z","doi":"10.1007/s00208-018-1716-6","date_created":"2018-12-11T11:44:59Z","page":"977-1016","day":"01","publication":"Mathematische Annalen","has_accepted_license":"1","year":"2019","publisher":"Springer Nature","quality_controlled":"1","oa":1,"title":"Counting rational points on quartic del Pezzo surfaces with a rational conic","author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","last_name":"Browning","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D"},{"first_name":"Efthymios","last_name":"Sofos","full_name":"Sofos, Efthymios"}],"external_id":{"arxiv":["1609.09057"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","ista":"Browning TD, Sofos E. 2019. Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. 373(3–4), 977–1016.","mla":"Browning, Timothy D., and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” Mathematische Annalen, vol. 373, no. 3–4, Springer Nature, 2019, pp. 977–1016, doi:10.1007/s00208-018-1716-6.","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.","short":"T.D. Browning, E. Sofos, Mathematische Annalen 373 (2019) 977–1016.","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","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"}},{"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"title":"Tropical formulae for summation over a part of SL(2,Z)","publist_id":"7382","author":[{"last_name":"Kalinin","full_name":"Kalinin, Nikita","first_name":"Nikita"},{"first_name":"Mikhail","id":"35084A62-F248-11E8-B48F-1D18A9856A87","full_name":"Shkolnikov, Mikhail","orcid":"0000-0002-4310-178X","last_name":"Shkolnikov"}],"article_processing_charge":"No","external_id":{"arxiv":["1711.02089"]},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","citation":{"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.","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.","ama":"Kalinin N, Shkolnikov M. Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. 2019;5(3):909–928. doi:10.1007/s40879-018-0218-0","apa":"Kalinin, N., & Shkolnikov, M. (2019). Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-018-0218-0","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.","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."},"publisher":"Springer Nature","quality_controlled":"1","oa":1,"doi":"10.1007/s40879-018-0218-0","date_published":"2019-09-15T00:00:00Z","date_created":"2018-12-11T11:46:29Z","page":"909–928","day":"15","publication":"European Journal of Mathematics","year":"2019","status":"public","article_type":"original","type":"journal_article","_id":"441","department":[{"_id":"TaHa"}],"date_updated":"2021-01-12T07:56:46Z","month":"09","intvolume":" 5","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.02089"}],"oa_version":"Preprint","issue":"3","volume":5,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2199-675X"],"eissn":["2199-6768"]},"publication_status":"published"},{"abstract":[{"lang":"eng","text":"The transcription coactivator, Yes-associated protein (YAP), which is a nuclear effector of the Hippo signaling pathway, has been shown to be a mechano-transducer. By using mutant fish and human 3D spheroids, we have recently demonstrated that YAP is also a mechano-effector. YAP functions in three-dimensional (3D) morphogenesis of organ and global body shape by controlling actomyosin-mediated tissue tension. In this chapter, we present a platform that links the findings in fish embryos with human cells. The protocols for analyzing tissue tension-mediated global body shape/organ morphogenesis in vivo and ex vivo using medaka fish embryos and in vitro using human cell spheroids represent useful tools for unraveling the molecular mechanisms by which YAP functions in regulating global body/organ morphogenesis."}],"oa_version":"None","alternative_title":["MIMB"],"quality_controlled":"1","publisher":"Springer","scopus_import":1,"intvolume":" 1893","month":"01","year":"2019","publication_status":"published","publication_identifier":{"isbn":["978-1-4939-8909-6"]},"language":[{"iso":"eng"}],"publication":"The hippo pathway","day":"01","page":"167-181","date_created":"2019-01-06T22:59:11Z","date_published":"2019-01-01T00:00:00Z","volume":1893,"doi":"10.1007/978-1-4939-8910-2_14","series_title":"Methods in Molecular Biology","_id":"5793","type":"book_chapter","status":"public","citation":{"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.","ista":"Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. 2019.Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: The hippo pathway. MIMB, vol. 1893, 167–181.","mla":"Asaoka, Yoichi, et al. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos and Human Spheroids.” The Hippo Pathway, edited by Alexander Hergovich, vol. 1893, Springer, 2019, pp. 167–81, doi:10.1007/978-1-4939-8910-2_14.","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","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","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.","short":"Y. Asaoka, H. Morita, H. Furumoto, C.-P.J. Heisenberg, M. Furutani-Seiki, in:, A. Hergovich (Ed.), The Hippo Pathway, Springer, 2019, pp. 167–181."},"date_updated":"2021-01-12T08:03:30Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Yoichi","full_name":"Asaoka, Yoichi","last_name":"Asaoka"},{"first_name":"Hitoshi","last_name":"Morita","full_name":"Morita, Hitoshi"},{"first_name":"Hiroko","full_name":"Furumoto, Hiroko","last_name":"Furumoto"},{"last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J"},{"full_name":"Furutani-Seiki, Makoto","last_name":"Furutani-Seiki","first_name":"Makoto"}],"editor":[{"first_name":"Alexander","full_name":"Hergovich, Alexander","last_name":"Hergovich"}],"department":[{"_id":"CaHe"}],"title":"Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids"},{"date_updated":"2021-01-12T08:05:08Z","department":[{"_id":"KrPi"}],"_id":"5887","type":"journal_article","article_type":"original","status":"public","publication_identifier":{"issn":["0926227X"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"1","volume":27,"ec_funded":1,"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."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://eprint.iacr.org/2016/166","open_access":"1"}],"month":"01","intvolume":" 27","citation":{"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.","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","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Gregory","full_name":"Demay, Gregory","last_name":"Demay"},{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","full_name":"Gazi, Peter","last_name":"Gazi"},{"last_name":"Maurer","full_name":"Maurer, Ueli","first_name":"Ueli"},{"first_name":"Bjorn","full_name":"Tackmann, Bjorn","last_name":"Tackmann"}],"article_processing_charge":"No","title":"Per-session security: Password-based cryptography revisited","project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"year":"2019","day":"1","publication":"Journal of Computer Security","page":"75-111","doi":"10.3233/JCS-181131","date_published":"2019-01-01T00:00:00Z","date_created":"2019-01-27T22:59:10Z","quality_controlled":"1","publisher":"IOS Press","oa":1},{"title":"Rhombic dodecahedron grid—coordinate system and 3D digital object definitions","article_processing_charge":"No","author":[{"first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita","last_name":"Biswas"},{"first_name":"Gaëlle","full_name":"Largeteau-Skapin, Gaëlle","last_name":"Largeteau-Skapin"},{"first_name":"Rita","last_name":"Zrour","full_name":"Zrour, Rita"},{"first_name":"Eric","last_name":"Andres","full_name":"Andres, Eric"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","extern":"1","citation":{"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.","ama":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. In: 21st IAPR International Conference on Discrete Geometry for Computer Imagery. Vol 11414. Berlin, Heidelberg: Springer Berlin Heidelberg; 2019:27-37. doi:10.1007/978-3-030-14085-4_3","apa":"Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2019). Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. In 21st IAPR International Conference on Discrete Geometry for Computer Imagery (Vol. 11414, pp. 27–37). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-030-14085-4_3","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.","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."},"date_updated":"2022-01-27T14:25:17Z","status":"public","conference":{"name":"DGCI: International Conference on Discrete Geometry for Computer Imagery","end_date":"2019-03-28","location":"Marne-la-Vallée, France","start_date":"2019-03-26"},"type":"conference","_id":"6163","date_created":"2019-03-21T12:12:19Z","doi":"10.1007/978-3-030-14085-4_3","volume":11414,"date_published":"2019-02-23T00:00:00Z","page":"27-37","publication":"21st IAPR International Conference on Discrete Geometry for Computer Imagery","language":[{"iso":"eng"}],"day":"23","publication_status":"published","year":"2019","publication_identifier":{"isbn":["978-3-6624-6446-5","978-3-6624-6447-2"],"issn":["0302-9743","1611-3349"]},"intvolume":" 11414","place":"Berlin, Heidelberg","month":"02","quality_controlled":"1","alternative_title":["LNCS"],"publisher":"Springer Berlin Heidelberg","oa_version":"None","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"}]},{"quality_controlled":"1","publisher":"Carleton University","oa":1,"page":"223–256","date_published":"2019-07-01T00:00:00Z","doi":"10.20382/jocg.v10i1a9","date_created":"2019-06-03T09:35:33Z","has_accepted_license":"1","year":"2019","day":"01","publication":"Journal of Computational Geometry ","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"author":[{"full_name":"Dyer, Ramsay","last_name":"Dyer","first_name":"Ramsay"},{"full_name":"Vegter, Gert","last_name":"Vegter","first_name":"Gert"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs"}],"title":"Simplices modelled on spaces of constant curvature","citation":{"ista":"Dyer R, Vegter G, Wintraecken M. 2019. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 10(1), 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.","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","short":"R. Dyer, G. Vegter, M. Wintraecken, Journal of Computational Geometry 10 (2019) 223–256.","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.","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."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"month":"07","intvolume":" 10","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."}],"oa_version":"Published Version","volume":10,"issue":"1","ec_funded":1,"publication_identifier":{"issn":["1920-180X"]},"publication_status":"published","file":[{"file_id":"6516","checksum":"57b4df2f16a74eb499734ec8ee240178","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"mainJournalFinal.pdf","date_created":"2019-06-03T09:30:01Z","creator":"mwintrae","file_size":2170882,"date_updated":"2020-07-14T12:47:32Z"}],"language":[{"iso":"eng"}],"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)"},"status":"public","_id":"6515","file_date_updated":"2020-07-14T12:47:32Z","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T08:07:50Z","ddc":["510"]},{"status":"public","type":"conference","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":"ITCS 2019: Innovations in Theoretical Computer Science","start_date":"2019-01-10","end_date":"2019-01-12","location":"San Diego, CA, United States"},"_id":"6528","file_date_updated":"2020-07-14T12:47:33Z","department":[{"_id":"KrPi"}],"ddc":["000"],"date_updated":"2021-01-12T08:07:53Z","month":"01","intvolume":" 124","scopus_import":1,"alternative_title":["LIPIcs"],"main_file_link":[{"url":"https://eprint.iacr.org/2018/627","open_access":"1"}],"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"}],"volume":124,"ec_funded":1,"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"6529","checksum":"f0ae1bb161431d9db3dea5ace082bfb5","creator":"dernst","date_updated":"2020-07-14T12:47:33Z","file_size":558770,"date_created":"2019-06-06T14:22:04Z","file_name":"2019_LIPIcs_Pietrzak.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-95977-095-8"],"issn":["1868-8969"]},"publication_status":"published","project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"article_number":"60","title":"Simple verifiable delay functions","author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124.","ama":"Pietrzak KZ. Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ITCS.2019.60","apa":"Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.60","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.","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.","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."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"doi":"10.4230/LIPICS.ITCS.2019.60","date_published":"2019-01-10T00:00:00Z","date_created":"2019-06-06T14:12:36Z","day":"10","publication":"10th Innovations in Theoretical Computer Science Conference","has_accepted_license":"1","year":"2019"},{"article_number":"8715598","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"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.","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","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","short":"A. Kundu, M. Garcia Soto, P. Prabhakar, in:, 5th Indian Control Conference Proceedings, IEEE, 2019.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Atreyee","last_name":"Kundu","full_name":"Kundu, Atreyee"},{"last_name":"Garcia Soto","orcid":"0000−0003−2936−5719","full_name":"Garcia Soto, Miriam","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","first_name":"Miriam"},{"last_name":"Prabhakar","full_name":"Prabhakar, Pavithra","first_name":"Pavithra"}],"article_processing_charge":"No","title":"Formal synthesis of stabilizing controllers for periodically controlled linear switched systems","quality_controlled":"1","publisher":"IEEE","oa":1,"has_accepted_license":"1","year":"2019","day":"16","publication":"5th Indian Control Conference Proceedings","date_published":"2019-05-16T00:00:00Z","doi":"10.1109/INDIANCC.2019.8715598","date_created":"2019-06-17T06:57:33Z","_id":"6565","type":"conference","conference":{"start_date":"2019-01-09","end_date":"2019-01-11","location":"Delhi, India","name":"ICC 2019 - Indian Control Conference"},"status":"public","date_updated":"2021-01-12T08:08:01Z","ddc":["000"],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-10-21T13:13:49Z","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"}],"oa_version":"Submitted Version","scopus_import":"1","month":"05","publication_identifier":{"isbn":["978-153866246-5"]},"publication_status":"published","file":[{"creator":"dernst","file_size":396031,"date_updated":"2020-10-21T13:13:49Z","file_name":"2019_ICC_Kundu.pdf","date_created":"2020-10-21T13:13:49Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"d622a91af1e427f6b1e0ba8e18a2b767","file_id":"8687"}],"language":[{"iso":"eng"}]},{"page":"275-279","date_created":"2019-07-12T08:34:57Z","ec_funded":1,"date_published":"2019-08-01T00:00:00Z","year":"2019","publication_status":"published","has_accepted_license":"1","publication":"The 31st Canadian Conference in Computational Geometry","language":[{"iso":"eng"}],"day":"01","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"6629","checksum":"ceabd152cfa55170d57763f9c6c60a53","date_updated":"2020-07-14T12:47:34Z","file_size":321176,"creator":"mwintrae","date_created":"2019-07-12T08:32:46Z","file_name":"IntrinsicExtrinsicCCCG2019.pdf"}],"oa":1,"scopus_import":1,"quality_controlled":"1","month":"08","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"}],"oa_version":"Submitted Version","author":[{"last_name":"Vegter","full_name":"Vegter, Gert","first_name":"Gert"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","last_name":"Wintraecken"}],"title":"The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:47:34Z","citation":{"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.","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.","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","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"conference":{"end_date":"2019-08-10","location":"Edmonton, Canada","start_date":"2019-08-08","name":"CCCG: Canadian Conference in Computational Geometry"},"type":"conference","status":"public","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"_id":"6628"},{"citation":{"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","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.","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.","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","external_id":{"arxiv":["1903.08510"]},"author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ziga","last_name":"Virk","full_name":"Virk, Ziga"},{"last_name":"Wagner","full_name":"Wagner, Hubert","first_name":"Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87"}],"title":"Topological data analysis in information space","project":[{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}],"year":"2019","has_accepted_license":"1","publication":"35th International Symposium on Computational Geometry","day":"01","page":"31:1-31:14","date_created":"2019-07-17T10:36:09Z","date_published":"2019-06-01T00:00:00Z","doi":"10.4230/LIPICS.SOCG.2019.31","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2021-01-12T08:08:23Z","ddc":["510"],"file_date_updated":"2020-07-14T12:47:35Z","department":[{"_id":"HeEd"}],"_id":"6648","conference":{"start_date":"2019-06-18","end_date":"2019-06-21","location":"Portland, OR, United States","name":"SoCG 2019: Symposium on Computational Geometry"},"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)"},"type":"conference","status":"public","publication_status":"published","publication_identifier":{"isbn":["9783959771047"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2019_LIPICS_Edelsbrunner.pdf","date_created":"2019-07-24T06:40:01Z","file_size":1355179,"date_updated":"2020-07-14T12:47:35Z","creator":"dernst","file_id":"6666","checksum":"8ec8720730d4c789bf7b06540f1c29f4","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"volume":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"}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"intvolume":" 129","month":"06"},{"_id":"6659","type":"journal_article","article_type":"original","status":"public","date_updated":"2021-01-12T08:08:26Z","ddc":["570"],"department":[{"_id":"RySh"}],"file_date_updated":"2020-10-02T08:49:58Z","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"}],"oa_version":"Published Version","scopus_import":"1","month":"05","intvolume":" 92","publication_identifier":{"issn":["00092673"]},"publication_status":"published","file":[{"success":1,"checksum":"186de511d6e0ca93f5d981e2443eb8cd","file_id":"8594","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2019_BCSJ_Zenmyo.pdf","date_created":"2020-10-02T08:49:58Z","file_size":2464903,"date_updated":"2020-10-02T08:49:58Z","creator":"dernst"}],"language":[{"iso":"eng"}],"volume":92,"issue":"5","ec_funded":1,"project":[{"name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","grant_number":"694539","call_identifier":"H2020","_id":"25CA28EA-B435-11E9-9278-68D0E5697425"}],"citation":{"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.","ista":"Zenmyo N, Tokumaru H, Uchinomiya S, Fuchida H, Tabata S, Hamachi I, Shigemoto R, Ojida A. 2019. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 92(5), 995–1000.","mla":"Zenmyo, Naoki, et al. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan, vol. 92, no. 5, Bulletin of the Chemical Society of Japan, 2019, pp. 995–1000, doi:10.1246/bcsj.20190034.","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","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Zenmyo","full_name":"Zenmyo, Naoki","first_name":"Naoki"},{"last_name":"Tokumaru","full_name":"Tokumaru, Hiroki","first_name":"Hiroki"},{"last_name":"Uchinomiya","full_name":"Uchinomiya, Shohei","first_name":"Shohei"},{"full_name":"Fuchida, Hirokazu","last_name":"Fuchida","first_name":"Hirokazu"},{"last_name":"Tabata","full_name":"Tabata, Shigekazu","id":"4427179E-F248-11E8-B48F-1D18A9856A87","first_name":"Shigekazu"},{"full_name":"Hamachi, Itaru","last_name":"Hamachi","first_name":"Itaru"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto"},{"first_name":"Akio","last_name":"Ojida","full_name":"Ojida, Akio"}],"article_processing_charge":"No","title":"Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins","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.","publisher":"Bulletin of the Chemical Society of Japan","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2019","day":"15","publication":"Bulletin of the Chemical Society of Japan","page":"995-1000","date_published":"2019-05-15T00:00:00Z","doi":"10.1246/bcsj.20190034","date_created":"2019-07-21T21:59:16Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Mondelli M, Montanari A. 2019. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 19(3), 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.","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","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","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.","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."},"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","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"first_name":"Andrea","full_name":"Montanari, Andrea","last_name":"Montanari"}],"publication":"Foundations of Computational Mathematics","day":"01","year":"2019","date_created":"2019-07-22T13:23:48Z","doi":"10.1007/s10208-018-9395-y","date_published":"2019-06-01T00:00:00Z","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":[{"lang":"eng","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."}],"intvolume":" 19","month":"06","main_file_link":[{"url":"https://arxiv.org/abs/1708.05932","open_access":"1"}]},{"title":"Anisotropic triangulations via discrete Riemannian Voronoi diagrams","external_id":{"arxiv":["1703.06487"]},"author":[{"full_name":"Boissonnat, Jean-Daniel","last_name":"Boissonnat","first_name":"Jean-Daniel"},{"last_name":"Rouxel-Labbé","full_name":"Rouxel-Labbé, Mael","first_name":"Mael"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","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.","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.","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","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","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."},"date_updated":"2021-01-12T08:08:30Z","status":"public","type":"journal_article","_id":"6672","date_created":"2019-07-24T08:42:12Z","doi":"10.1137/17m1152292","volume":48,"issue":"3","date_published":"2019-05-21T00:00:00Z","page":"1046-1097","language":[{"iso":"eng"}],"publication":"SIAM Journal on Computing","day":"21","year":"2019","publication_status":"published","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"intvolume":" 48","month":"05","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1703.06487","open_access":"1"}],"quality_controlled":"1","publisher":"Society for Industrial & Applied Mathematics (SIAM)","oa_version":"Preprint","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."}]},{"abstract":[{"lang":"eng","text":"A Valued Constraint Satisfaction Problem (VCSP) provides a common framework that can express a wide range of discrete optimization problems. A VCSP instance is given by a finite set of variables, a finite domain of labels, and an objective function to be minimized. This function is represented as a sum of terms where each term depends on a subset of the variables. To obtain different classes of optimization problems, one can restrict all terms to come from a fixed set Γ of cost functions, called a language. \r\nRecent breakthrough results have established a complete complexity classification of such classes with respect to language Γ: if all cost functions in Γ satisfy a certain algebraic condition then all Γ-instances can be solved in polynomial time, otherwise the problem is NP-hard. Unfortunately, testing this condition for a given language Γ is known to be NP-hard. We thus study exponential algorithms for this meta-problem. We show that the tractability condition of a finite-valued language Γ can be tested in O(3‾√3|D|⋅poly(size(Γ))) time, where D is the domain of Γ and poly(⋅) is some fixed polynomial. We also obtain a matching lower bound under the Strong Exponential Time Hypothesis (SETH). More precisely, we prove that for any constant δ<1 there is no O(3‾√3δ|D|) algorithm, assuming that SETH holds."}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"month":"07","intvolume":" 132","publication_identifier":{"isbn":["978-3-95977-109-2"],"issn":["1868-8969"]},"publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"f5ebee8eec6ae09e30365578ee63a492","file_id":"6738","creator":"dernst","date_updated":"2020-07-14T12:47:38Z","file_size":575475,"date_created":"2019-07-31T07:01:45Z","file_name":"2019_LIPICS_Kolmogorov.pdf"}],"language":[{"iso":"eng"}],"volume":132,"ec_funded":1,"_id":"6725","type":"conference","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":{"location":"Patras, Greece","end_date":"2019-07-12","start_date":"2019-07-08","name":"ICALP 2019: International Colloquim on Automata, Languages and Programming"},"status":"public","date_updated":"2021-01-12T08:08:40Z","ddc":["000"],"department":[{"_id":"VlKo"}],"file_date_updated":"2020-07-14T12:47:38Z","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"has_accepted_license":"1","year":"2019","day":"01","publication":"46th International Colloquium on Automata, Languages and Programming","page":"77:1-77:12","doi":"10.4230/LIPICS.ICALP.2019.77","date_published":"2019-07-01T00:00:00Z","date_created":"2019-07-29T12:23:29Z","project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"citation":{"ista":"Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming. ICALP 2019: International Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.","chicago":"Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” In 46th International Colloquium on Automata, Languages and Programming, 132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.77.","short":"V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12.","ieee":"V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 77:1-77:12.","ama":"Kolmogorov V. Testing the complexity of a valued CSP language. In: 46th International Colloquium on Automata, Languages and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:77:1-77:12. doi:10.4230/LIPICS.ICALP.2019.77","apa":"Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In 46th International Colloquium on Automata, Languages and Programming (Vol. 132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.77","mla":"Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"external_id":{"arxiv":["1803.02289"]},"title":"Testing the complexity of a valued CSP language"},{"date_created":"2019-07-29T12:25:31Z","date_published":"2019-06-29T00:00:00Z","doi":"10.1007/978-3-030-23696-0_9","page":"157-180","publication":"Progress in Cryptology – AFRICACRYPT 2019","day":"29","year":"2019","oa":1,"quality_controlled":"1","publisher":"Springer Nature","editor":[{"first_name":"J","full_name":"Buchmann, J","last_name":"Buchmann"},{"first_name":"A","last_name":"Nitaj","full_name":"Nitaj, A"},{"first_name":"T","last_name":"Rachidi","full_name":"Rachidi, T"}],"title":"Sampling the integers with low relative error","article_processing_charge":"No","author":[{"orcid":"0000-0003-3186-2482","full_name":"Walter, Michael","last_name":"Walter","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","first_name":"Michael"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Walter M. 2019.Sampling the integers with low relative error. In: Progress in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.","chicago":"Walter, Michael. “Sampling the Integers with Low Relative Error.” In Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann, A Nitaj, and T Rachidi, 11627:157–80. LNCS. Cham: Springer Nature, 2019. https://doi.org/10.1007/978-3-030-23696-0_9.","short":"M. Walter, in:, J. Buchmann, A. Nitaj, T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019, Springer Nature, Cham, 2019, pp. 157–180.","ieee":"M. Walter, “Sampling the integers with low relative error,” in Progress in Cryptology – AFRICACRYPT 2019, vol. 11627, J. Buchmann, A. Nitaj, and T. Rachidi, Eds. Cham: Springer Nature, 2019, pp. 157–180.","ama":"Walter M. Sampling the integers with low relative error. In: Buchmann J, Nitaj A, Rachidi T, eds. Progress in Cryptology – AFRICACRYPT 2019. Vol 11627. LNCS. Cham: Springer Nature; 2019:157-180. doi:10.1007/978-3-030-23696-0_9","apa":"Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann, A. Nitaj, & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019 (Vol. 11627, pp. 157–180). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-23696-0_9","mla":"Walter, Michael. “Sampling the Integers with Low Relative Error.” Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann et al., vol. 11627, Springer Nature, 2019, pp. 157–80, doi:10.1007/978-3-030-23696-0_9."},"project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"ec_funded":1,"volume":11627,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eisbn":["978-3-0302-3696-0"],"issn":["0302-9743","1611-3349"],"isbn":["978-3-0302-3695-3"]},"intvolume":" 11627","place":"Cham","month":"06","main_file_link":[{"url":"https://eprint.iacr.org/2019/068","open_access":"1"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Randomness is an essential part of any secure cryptosystem, but many constructions rely on distributions that are not uniform. This is particularly true for lattice based cryptosystems, which more often than not make use of discrete Gaussian distributions over the integers. For practical purposes it is crucial to evaluate the impact that approximation errors have on the security of a scheme to provide the best possible trade-off between security and performance. Recent years have seen surprising results allowing to use relatively low precision while maintaining high levels of security. A key insight in these results is that sampling a distribution with low relative error can provide very strong security guarantees. Since floating point numbers provide guarantees on the relative approximation error, they seem a suitable tool in this setting, but it is not obvious which sampling algorithms can actually profit from them. While previous works have shown that inversion sampling can be adapted to provide a low relative error (Pöppelmann et al., CHES 2014; Prest, ASIACRYPT 2017), other works have called into question if this is possible for other sampling techniques (Zheng et al., Eprint report 2018/309). In this work, we consider all sampling algorithms that are popular in the cryptographic setting and analyze the relationship of floating point precision and the resulting relative error. We show that all of the algorithms either natively achieve a low relative error or can be adapted to do so."}],"department":[{"_id":"KrPi"}],"date_updated":"2023-02-23T12:50:15Z","status":"public","conference":{"name":"AFRICACRYPT: International Conference on Cryptology in Africa","start_date":"2019-07-09","end_date":"2019-07-11","location":"Rabat, Morocco"},"type":"book_chapter","_id":"6726","series_title":"LNCS"},{"day":"01","language":[{"iso":"eng"}],"publication":"IEEE","year":"2019","publication_status":"published","doi":"10.1109/tit.2018.2889667","issue":"5","date_published":"2019-05-01T00:00:00Z","volume":65,"related_material":{"record":[{"status":"public","id":"6729","relation":"earlier_version"}]},"date_created":"2019-07-23T07:32:57Z","page":"2782-2791","oa_version":"Preprint","abstract":[{"text":"Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, we know from two independent works by Schürch and by Bardet et al. that the synthetic channels are partially ordered with respect to degradation. Hence, it is natural to ask whether the partial order can be exploited to reduce the computational burden of the construction problem. We show that, if we take advantage of the partial order, we can construct a polar code by computing the reliability of roughly a fraction 1/ log 3/2 N of the synthetic channels. In particular, we prove that N/ log 3/2 N is a lower bound on the number of synthetic channels to be considered and such a bound is tight up to a multiplicative factor log log N. This set of roughly N/ log 3/2 N synthetic channels is universal, in the sense that it allows one to construct polar codes for any W, and it can be identified by solving a maximum matching problem on a bipartite graph. Our proof technique consists of reducing the construction problem to the problem of computing the maximum cardinality of an antichain for a suitable partially ordered set. As such, this method is general, and it can be used to further improve the complexity of the construction problem, in case a refined partial order on the synthetic channels of polar codes is discovered.","lang":"eng"}],"month":"05","intvolume":" 65","publisher":"IEEE","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1612.05295"}],"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “Construction of polar codes with sublinear complexity,” IEEE, vol. 65, no. 5. IEEE, pp. 2782–2791, 2019.","short":"M. Mondelli, H. Hassani, R. Urbanke, IEEE 65 (2019) 2782–2791.","ama":"Mondelli M, Hassani H, Urbanke R. Construction of polar codes with sublinear complexity. IEEE. 2019;65(5):2782-2791. doi:10.1109/tit.2018.2889667","apa":"Mondelli, M., Hassani, H., & Urbanke, R. (2019). Construction of polar codes with sublinear complexity. IEEE. IEEE. https://doi.org/10.1109/tit.2018.2889667","mla":"Mondelli, Marco, et al. “Construction of Polar Codes with Sublinear Complexity.” IEEE, vol. 65, no. 5, IEEE, 2019, pp. 2782–91, doi:10.1109/tit.2018.2889667.","ista":"Mondelli M, Hassani H, Urbanke R. 2019. Construction of polar codes with sublinear complexity. IEEE. 65(5), 2782–2791.","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “Construction of Polar Codes with Sublinear Complexity.” IEEE. IEEE, 2019. https://doi.org/10.1109/tit.2018.2889667."},"date_updated":"2023-02-23T12:50:20Z","title":"Construction of polar codes with sublinear complexity","author":[{"last_name":"Mondelli","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"last_name":"Hassani","full_name":"Hassani, Hamed","first_name":"Hamed"},{"first_name":"Rudiger","last_name":"Urbanke","full_name":"Urbanke, Rudiger"}],"external_id":{"arxiv":["1612.05295"]},"_id":"6663","status":"public","type":"journal_article"},{"publisher":"Proceedings of Machine Learning Research","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1802.07301","open_access":"1"}],"oa":1,"month":"04","intvolume":" 89","abstract":[{"text":"We establish connections between the problem of learning a two-layer neural network and tensor decomposition. We consider a model with feature vectors x∈ℝd, r hidden units with weights {wi}1≤i≤r and output y∈ℝ, i.e., y=∑ri=1σ(w𝖳ix), with activation functions given by low-degree polynomials. In particular, if σ(x)=a0+a1x+a3x3, we prove that no polynomial-time learning algorithm can outperform the trivial predictor that assigns to each example the response variable 𝔼(y), when d3/2≪r≪d2. Our conclusion holds for a `natural data distribution', namely standard Gaussian feature vectors x, and output distributed according to a two-layer neural network with random isotropic weights, and under a certain complexity-theoretic assumption on tensor decomposition. Roughly speaking, we assume that no polynomial-time algorithm can substantially outperform current methods for tensor decomposition based on the sum-of-squares hierarchy. We also prove generalizations of this statement for higher degree polynomial activations, and non-random weight vectors. Remarkably, several existing algorithms for learning two-layer networks with rigorous guarantees are based on tensor decomposition. Our results support the idea that this is indeed the core computational difficulty in learning such networks, under the stated generative model for the data. As a side result, we show that under this model learning the network requires accurate learning of its weights, a property that does not hold in a more general setting. ","lang":"eng"}],"oa_version":"Preprint","page":"1051-1060","date_published":"2019-04-01T00:00:00Z","volume":89,"date_created":"2019-07-31T09:31:26Z","year":"2019","publication_status":"published","day":"01","language":[{"iso":"eng"}],"publication":"Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics","type":"conference","conference":{"location":"Naha, Okinawa, Japan","end_date":"2019-04-18","start_date":"2019-04-16","name":"AISTATS: Artificial Intelligence and Statistics"},"status":"public","_id":"6747","author":[{"first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"full_name":"Montanari, Andrea","last_name":"Montanari","first_name":"Andrea"}],"article_processing_charge":"No","external_id":{"arxiv":["1802.07301"]},"title":"On the connection between learning two-layers neural networks and tensor decomposition","citation":{"short":"M. Mondelli, A. Montanari, in:, Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, 2019, pp. 1051–1060.","ieee":"M. Mondelli and A. Montanari, “On the connection between learning two-layers neural networks and tensor decomposition,” in Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, Naha, Okinawa, Japan, 2019, vol. 89, pp. 1051–1060.","ama":"Mondelli M, Montanari A. On the connection between learning two-layers neural networks and tensor decomposition. In: Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics. Vol 89. Proceedings of Machine Learning Research; 2019:1051-1060.","apa":"Mondelli, M., & Montanari, A. (2019). On the connection between learning two-layers neural networks and tensor decomposition. In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics (Vol. 89, pp. 1051–1060). Naha, Okinawa, Japan: Proceedings of Machine Learning Research.","mla":"Mondelli, Marco, and Andrea Montanari. “On the Connection between Learning Two-Layers Neural Networks and Tensor Decomposition.” Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, vol. 89, Proceedings of Machine Learning Research, 2019, pp. 1051–60.","ista":"Mondelli M, Montanari A. 2019. On the connection between learning two-layers neural networks and tensor decomposition. Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics. AISTATS: Artificial Intelligence and Statistics vol. 89, 1051–1060.","chicago":"Mondelli, Marco, and Andrea Montanari. “On the Connection between Learning Two-Layers Neural Networks and Tensor Decomposition.” In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 89:1051–60. Proceedings of Machine Learning Research, 2019."},"date_updated":"2021-01-12T08:08:49Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"issue":"22","volume":67,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1053587X"]},"intvolume":" 67","month":"11","main_file_link":[{"url":"https://arxiv.org/abs/1903.09203","open_access":"1"}],"scopus_import":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC list (SCL) and SC flip (SCF), provide a reasonable error performance for polar codes at the cost of low decoding speed. Fast SC-based decoders, such as Fast-SSC, Fast-SSCL, and Fast-SSCF, identify the special constituent codes in a polar code graph off-line, produce a list of operations, store the list in memory, and feed the list to the decoder to decode the constituent codes in order efficiently, thus increasing the decoding speed. However, the list of operations is dependent on the code rate and as the rate changes, a new list is produced, making fast SC-based decoders not rate-flexible. In this paper, we propose a completely rate-flexible fast SC-based decoder by creating the list of operations directly in hardware, with low implementation complexity. We further propose a hardware architecture implementing the proposed method and show that the area occupation of the rate-flexible fast SC-based decoder in this paper is only 38% of the total area of the memory-based base-line decoder when 5G code rates are supported. "}],"department":[{"_id":"MaMo"}],"date_updated":"2021-01-12T08:08:51Z","status":"public","type":"journal_article","article_type":"original","_id":"6750","date_created":"2019-07-31T09:51:14Z","date_published":"2019-11-15T00:00:00Z","doi":"10.1109/TSP.2019.2944738","publication":"IEEE Transactions on Signal Processing","day":"15","year":"2019","oa":1,"publisher":"IEEE","quality_controlled":"1","title":"Rate-flexible fast polar decoders","external_id":{"arxiv":["1903.09203"]},"article_processing_charge":"No","author":[{"last_name":"Hashemi","full_name":"Hashemi, Seyyed Ali","first_name":"Seyyed Ali"},{"first_name":"Carlo","last_name":"Condo","full_name":"Condo, Carlo"},{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"first_name":"Warren J","last_name":"Gross","full_name":"Gross, Warren J"}],"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","citation":{"mla":"Hashemi, Seyyed Ali, et al. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing, vol. 67, no. 22, 8854897, IEEE, 2019, doi:10.1109/TSP.2019.2944738.","ama":"Hashemi SA, Condo C, Mondelli M, Gross WJ. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 2019;67(22). doi:10.1109/TSP.2019.2944738","apa":"Hashemi, S. A., Condo, C., Mondelli, M., & Gross, W. J. (2019). Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. IEEE. https://doi.org/10.1109/TSP.2019.2944738","ieee":"S. A. Hashemi, C. Condo, M. Mondelli, and W. J. Gross, “Rate-flexible fast polar decoders,” IEEE Transactions on Signal Processing, vol. 67, no. 22. IEEE, 2019.","short":"S.A. Hashemi, C. Condo, M. Mondelli, W.J. Gross, IEEE Transactions on Signal Processing 67 (2019).","chicago":"Hashemi, Seyyed Ali, Carlo Condo, Marco Mondelli, and Warren J Gross. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing. IEEE, 2019. https://doi.org/10.1109/TSP.2019.2944738.","ista":"Hashemi SA, Condo C, Mondelli M, Gross WJ. 2019. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 67(22), 8854897."},"article_number":"8854897"},{"article_processing_charge":"No","external_id":{"arxiv":["1808.04148"]},"author":[{"first_name":"Vít","full_name":"Jelínek, Vít","last_name":"Jelínek"},{"last_name":"Töpfer","full_name":"Töpfer, Martin","first_name":"Martin","id":"4B865388-F248-11E8-B48F-1D18A9856A87"}],"title":"On grounded L-graphs and their relatives","citation":{"short":"V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).","ieee":"V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019.","ama":"Jelínek V, Töpfer M. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 2019;26(3). doi:10.37236/8096","apa":"Jelínek, V., & Töpfer, M. (2019). On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/8096","mla":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics, vol. 26, no. 3, P3.17, Electronic Journal of Combinatorics, 2019, doi:10.37236/8096.","ista":"Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17.","chicago":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2019. https://doi.org/10.37236/8096."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"}],"article_number":"P3.17","date_created":"2019-08-04T21:59:20Z","date_published":"2019-07-19T00:00:00Z","doi":"10.37236/8096","year":"2019","has_accepted_license":"1","publication":"Electronic Journal of Combinatorics","day":"19","oa":1,"publisher":"Electronic Journal of Combinatorics","quality_controlled":"1","file_date_updated":"2020-07-14T12:47:39Z","department":[{"_id":"DaAl"}],"date_updated":"2022-03-18T12:32:02Z","ddc":["510"],"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)"},"type":"journal_article","article_type":"original","status":"public","_id":"6759","ec_funded":1,"volume":26,"issue":"3","publication_status":"published","publication_identifier":{"eissn":["10778926"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:47:39Z","file_size":533697,"creator":"dernst","date_created":"2019-08-05T06:46:55Z","file_name":"2019_eJourCombinatorics_Jelinek.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"6764","checksum":"20fc366fc6683ef0b074a019b73a663a"}],"scopus_import":"1","intvolume":" 26","month":"07","abstract":[{"lang":"eng","text":"We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove that Grounded-L graphs admit an equivalent characterisation in terms of vertex ordering with forbidden patterns. \r\nWe also compare this class to related intersection classes, such as the grounded segment graphs, the monotone L-graphs (a.k.a. max point-tolerance graphs), or the outer-1-string graphs. We give constructions showing that these classes are all distinct and satisfy only trivial or previously known inclusions."}],"oa_version":"Published Version"},{"project":[{"name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-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":{"mla":"Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.","ieee":"G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision processes. In: Proceedings of the 13th International Conference of Reachability Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1","apa":"Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding games on Markov decision processes. In Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer. https://doi.org/10.1007/978-3-030-30806-3_1","chicago":"Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1.","ista":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12."},"title":"Bidding games on Markov decision processes","author":[{"last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"first_name":"Petr","full_name":"Novotny, Petr","last_name":"Novotny"}],"oa":1,"publisher":"Springer","quality_controlled":"1","publication":" Proceedings of the 13th International Conference of Reachability Problems","day":"06","year":"2019","has_accepted_license":"1","date_created":"2019-08-19T07:58:10Z","doi":"10.1007/978-3-030-30806-3_1","date_published":"2019-09-06T00:00:00Z","page":"1-12","_id":"6822","status":"public","conference":{"end_date":"2019-09-13","location":"Brussels, Belgium","start_date":"2019-09-11","name":"RP: Reachability Problems"},"type":"conference","ddc":["000"],"date_updated":"2021-01-12T08:09:12Z","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:41Z","oa_version":"Submitted Version","abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher\r\nbidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called \r\n randomturn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and meanpayoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one.","lang":"eng"}],"intvolume":" 11674","month":"09","alternative_title":["LNCS"],"scopus_import":1,"language":[{"iso":"eng"}],"file":[{"checksum":"45ebbc709af2b247d28c7c293c01504b","file_id":"6823","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-08-19T07:56:40Z","file_name":"prob.pdf","creator":"gavni","date_updated":"2020-07-14T12:47:41Z","file_size":436635}],"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["978-303030805-6"]},"volume":11674},{"article_number":"7","project":[{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” Leibniz International Proceedings in Informatics, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7","ama":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.7","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","article_processing_charge":"No","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Wolfgang","full_name":"Dvorák, Wolfgang","last_name":"Dvorák"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"title":"Near-linear time algorithms for Streett objectives in graphs and MDPs","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2019","has_accepted_license":"1","publication":"Leibniz International Proceedings in Informatics","day":"01","date_created":"2019-09-18T08:07:58Z","date_published":"2019-08-01T00:00:00Z","doi":"10.4230/LIPICS.CONCUR.2019.7","_id":"6887","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":"CONCUR: International Conference on Concurrency Theory","start_date":"2019-08-27","end_date":"2019-08-30","location":"Amsterdam, Netherlands"},"type":"conference","status":"public","date_updated":"2022-08-12T10:54:34Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:43Z","abstract":[{"text":"The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. ","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":" 140","month":"08","publication_status":"published","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"e1f0e4061212454574f34a1368d018ec","file_id":"6922","creator":"kschuh","date_updated":"2020-07-14T12:47:43Z","file_size":730112,"date_created":"2019-10-01T08:20:30Z","file_name":"2019_LIPIcs_Chatterjee.pdf"}],"ec_funded":1,"volume":140},{"_id":"6888","type":"conference","conference":{"name":"ICRA: International Conference on Robotics and Automation","location":"Montreal, QC, Canada","end_date":"2019-05-24","start_date":"2019-05-20"},"status":"public","date_updated":"2021-01-12T08:09:28Z","ddc":["000"],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-10-08T17:30:38Z","abstract":[{"text":"In this paper, we design novel liquid time-constant recurrent neural networks for robotic control, inspired by the brain of the nematode, C. elegans. In the worm's nervous system, neurons communicate through nonlinear time-varying synaptic links established amongst them by their particular wiring structure. This property enables neurons to express liquid time-constants dynamics and therefore allows the network to originate complex behaviors with a small number of neurons. We identify neuron-pair communication motifs as design operators and use them to configure compact neuronal network structures to govern sequential robotic tasks. The networks are systematically designed to map the environmental observations to motor actions, by their hierarchical topology from sensory neurons, through recurrently-wired interneurons, to motor neurons. The networks are then parametrized in a supervised-learning scheme by a search-based algorithm. We demonstrate that obtained networks realize interpretable dynamics. We evaluate their performance in controlling mobile and arm robots, and compare their attributes to other artificial neural network-based control agents. Finally, we experimentally show their superior resilience to environmental noise, compared to the existing machine learning-based methods.","lang":"eng"}],"oa_version":"Submitted Version","alternative_title":["ICRA"],"scopus_import":"1","month":"05","publication_identifier":{"isbn":["9781538660270"]},"publication_status":"published","file":[{"date_created":"2020-10-08T17:30:38Z","file_name":"2019_ICRA_Lechner.pdf","date_updated":"2020-10-08T17:30:38Z","file_size":3265107,"creator":"dernst","file_id":"8636","checksum":"f5545a6b60c3ffd01feb3613f81d03b6","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"volume":"2019-May","article_number":"8793840","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"citation":{"mla":"Lechner, Mathias, et al. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” Proceedings - IEEE International Conference on Robotics and Automation, vol. 2019–May, 8793840, IEEE, 2019, doi:10.1109/icra.2019.8793840.","ama":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. Designing worm-inspired neural networks for interpretable robotic control. In: Proceedings - IEEE International Conference on Robotics and Automation. Vol 2019-May. IEEE; 2019. doi:10.1109/icra.2019.8793840","apa":"Lechner, M., Hasani, R., Zimmer, M., Henzinger, T. A., & Grosu, R. (2019). Designing worm-inspired neural networks for interpretable robotic control. In Proceedings - IEEE International Conference on Robotics and Automation (Vol. 2019–May). Montreal, QC, Canada: IEEE. https://doi.org/10.1109/icra.2019.8793840","ieee":"M. Lechner, R. Hasani, M. Zimmer, T. A. Henzinger, and R. Grosu, “Designing worm-inspired neural networks for interpretable robotic control,” in Proceedings - IEEE International Conference on Robotics and Automation, Montreal, QC, Canada, 2019, vol. 2019–May.","short":"M. Lechner, R. Hasani, M. Zimmer, T.A. Henzinger, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2019.","chicago":"Lechner, Mathias, Ramin Hasani, Manuel Zimmer, Thomas A Henzinger, and Radu Grosu. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” In Proceedings - IEEE International Conference on Robotics and Automation, Vol. 2019–May. IEEE, 2019. https://doi.org/10.1109/icra.2019.8793840.","ista":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. 2019. Designing worm-inspired neural networks for interpretable robotic control. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, vol. 2019–May, 8793840."},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"first_name":"Manuel","last_name":"Zimmer","full_name":"Zimmer, Manuel"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"article_processing_charge":"No","title":"Designing worm-inspired neural networks for interpretable robotic control","quality_controlled":"1","publisher":"IEEE","oa":1,"has_accepted_license":"1","year":"2019","day":"01","publication":"Proceedings - IEEE International Conference on Robotics and Automation","doi":"10.1109/icra.2019.8793840","date_published":"2019-05-01T00:00:00Z","date_created":"2019-09-18T08:09:51Z"},{"citation":{"ista":"Aghajohari M, Avni G, Henzinger TA. 2019. Determinacy in discrete-bidding infinite-duration games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 20.","chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.20.","ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","short":"M. Aghajohari, G. Avni, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.20","apa":"Aghajohari, M., Avni, G., & Henzinger, T. A. (2019). Determinacy in discrete-bidding infinite-duration games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.20","mla":"Aghajohari, Milad, et al. Determinacy in Discrete-Bidding Infinite-Duration Games. Vol. 140, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.20."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"full_name":"Aghajohari, Milad","last_name":"Aghajohari","first_name":"Milad"},{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","last_name":"Avni","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"article_processing_charge":"No","external_id":{"arxiv":["1905.03588"]},"title":"Determinacy in discrete-bidding infinite-duration games","article_number":"20","project":[{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"has_accepted_license":"1","year":"2019","day":"01","date_published":"2019-08-01T00:00:00Z","doi":"10.4230/LIPICS.CONCUR.2019.20","date_created":"2019-09-18T08:06:58Z","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"date_updated":"2022-01-26T08:27:10Z","ddc":["000"],"file_date_updated":"2020-07-14T12:47:43Z","department":[{"_id":"ToHe"}],"_id":"6886","type":"conference","conference":{"name":"CONCUR: International Conference on Concurrency Theory","location":"Amsterdam, Netherlands","end_date":"2019-08-30","start_date":"2019-08-27"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"status":"public","publication_status":"published","file":[{"date_created":"2019-09-27T12:21:38Z","file_name":"2019_LIPIcs_Aghajohari.pdf","creator":"kschuh","date_updated":"2020-07-14T12:47:43Z","file_size":741425,"checksum":"4df6d3575c506edb17215adada03cc8e","file_id":"6915","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"volume":140,"license":"https://creativecommons.org/licenses/by/3.0/","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets. "}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":"1","month":"08","intvolume":" 140"},{"volume":140,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"6914","checksum":"4985e26e1572d1575d64d38acabd71d6","file_size":538120,"date_updated":"2020-07-14T12:47:43Z","creator":"kschuh","file_name":"2019_LIPIcs_Chatterjee.pdf","date_created":"2019-09-27T12:09:35Z"}],"publication_status":"published","intvolume":" 140","month":"08","alternative_title":["LIPIcs"],"scopus_import":1,"oa_version":"Published Version","abstract":[{"text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. ","lang":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:43Z","ddc":["000"],"date_updated":"2021-01-12T08:09:27Z","status":"public","conference":{"name":"CONCUR: International Conference on Concurrency Theory","end_date":"2019-08-30","location":"Amsterdam, Netherlands","start_date":"2019-08-27"},"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)"},"type":"conference","_id":"6885","date_created":"2019-09-18T08:06:14Z","date_published":"2019-08-01T00:00:00Z","doi":"10.4230/LIPICS.CONCUR.2019.27","day":"01","year":"2019","has_accepted_license":"1","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","title":"Long-run average behavior of vector addition systems with states","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27","ama":"Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.27","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27.","ista":"Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27."},"project":[{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"}],"article_number":"27"},{"citation":{"chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6.","ista":"Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.","mla":"Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6.","ama":"Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.6","apa":"Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6","short":"K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Piterman, Nir","last_name":"Piterman","first_name":"Nir"}],"title":"Combinations of Qualitative Winning for Stochastic Parity Games","article_number":"6","project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","year":"2019","day":"01","doi":"10.4230/LIPICS.CONCUR.2019.6","date_published":"2019-08-01T00:00:00Z","date_created":"2019-09-18T08:11:43Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"date_updated":"2021-01-12T08:09:28Z","ddc":["000"],"file_date_updated":"2020-07-14T12:47:43Z","department":[{"_id":"KrCh"}],"_id":"6889","type":"conference","conference":{"name":"CONCUR: International Conference on Concurrency Theory","start_date":"2019-08-27","location":"Amsterdam, Netherlands","end_date":"2019-08-30"},"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)"},"status":"public","publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"6923","checksum":"7b2ecfd4d9d02360308c0ca986fc10a7","date_updated":"2020-07-14T12:47:43Z","file_size":509163,"creator":"kschuh","date_created":"2019-10-01T08:49:45Z","file_name":"2019_LIPIcs_Chatterjee.pdf"}],"language":[{"iso":"eng"}],"volume":140,"abstract":[{"text":"We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. ","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"month":"08","intvolume":" 140"},{"ec_funded":1,"volume":146,"language":[{"iso":"eng"}],"file":[{"date_created":"2019-10-08T12:47:19Z","file_name":"LIPIcs-DISC-2019-29.pdf","creator":"jrybicki","date_updated":"2020-07-14T12:47:44Z","file_size":639378,"checksum":"2d2202f90c6ac991e50876451627c4b5","file_id":"6934","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"eisbn":["978-3-95977-126-9"]},"intvolume":" 146","scopus_import":1,"alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Consider a distributed system with n processors out of which f can be Byzantine faulty. In the\r\napproximate agreement task, each processor i receives an input value xi and has to decide on an\r\noutput value yi such that\r\n1. the output values are in the convex hull of the non-faulty processors’ input values,\r\n2. the output values are within distance d of each other.\r\n\r\n\r\nClassically, the values are assumed to be from an m-dimensional Euclidean space, where m ≥ 1.\r\nIn this work, we study the task in a discrete setting, where input values with some structure\r\nexpressible as a graph. Namely, the input values are vertices of a finite graph G and the goal is to\r\noutput vertices that are within distance d of each other in G, but still remain in the graph-induced\r\nconvex hull of the input values. For d = 0, the task reduces to consensus and cannot be solved with\r\na deterministic algorithm in an asynchronous system even with a single crash fault. For any d ≥ 1,\r\nwe show that the task is solvable in asynchronous systems when G is chordal and n > (ω + 1)f,\r\nwhere ω is the clique number of G. In addition, we give the first Byzantine-tolerant algorithm for a\r\nvariant of lattice agreement. For synchronous systems, we show tight resilience bounds for the exact\r\nvariants of these and related tasks over a large class of combinatorial structures."}],"file_date_updated":"2020-07-14T12:47:44Z","department":[{"_id":"DaAl"}],"ddc":["004"],"date_updated":"2021-01-12T08:09:38Z","keyword":["consensus","approximate agreement","Byzantine faults","chordal graphs","lattice agreement"],"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":{"start_date":"2019-10-14","location":"Budapest, Hungary","end_date":"2019-10-18","name":"DISC: International Symposium on Distributed Computing"},"type":"conference","_id":"6931","date_created":"2019-10-08T12:41:38Z","doi":"10.4230/LIPICS.DISC.2019.29","date_published":"2019-01-01T00:00:00Z","page":"29:1--29:17","publication":"33rd International Symposium on Distributed Computing","year":"2019","has_accepted_license":"1","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","title":"Byzantine approximate agreement on graphs","external_id":{"arxiv":["1908.02743"]},"article_processing_charge":"No","author":[{"full_name":"Nowak, Thomas","last_name":"Nowak","first_name":"Thomas"},{"first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki","orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” 33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29.","ieee":"T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17.","short":"T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17.","ama":"Nowak T, Rybicki J. Byzantine approximate agreement on graphs. In: 33rd International Symposium on Distributed Computing. Vol 146. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:29:1--29:17. doi:10.4230/LIPICS.DISC.2019.29","apa":"Nowak, T., & Rybicki, J. (2019). Byzantine approximate agreement on graphs. In 33rd International Symposium on Distributed Computing (Vol. 146, p. 29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.DISC.2019.29","chicago":"Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” In 33rd International Symposium on Distributed Computing, 146:29:1--29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.DISC.2019.29.","ista":"Nowak T, Rybicki J. 2019. Byzantine approximate agreement on graphs. 33rd International Symposium on Distributed Computing. DISC: International Symposium on Distributed Computing, LIPIcs, vol. 146, 29:1--29:17."},"project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}]},{"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.03864"}],"publisher":"IEEE","scopus_import":1,"quality_controlled":"1","month":"09","abstract":[{"text":"In this paper, we introduce a novel method to interpret recurrent neural networks (RNNs), particularly long short-term memory networks (LSTMs) at the cellular level. We propose a systematic pipeline for interpreting individual hidden state dynamics within the network using response characterization methods. The ranked contribution of individual cells to the network's output is computed by analyzing a set of interpretable metrics of their decoupled step and sinusoidal responses. As a result, our method is able to uniquely identify neurons with insightful dynamics, quantify relationships between dynamical properties and test accuracy through ablation analysis, and interpret the impact of network capacity on a network's dynamical distribution. Finally, we demonstrate the generalizability and scalability of our method by evaluating a series of different benchmark sequential datasets.","lang":"eng"}],"oa_version":"Preprint","date_created":"2019-11-04T15:59:58Z","date_published":"2019-09-30T00:00:00Z","doi":"10.1109/ijcnn.2019.8851954","year":"2019","publication_status":"published","publication_identifier":{"isbn":["9781728119854"]},"publication":"Proceedings of the International Joint Conference on Neural Networks","language":[{"iso":"eng"}],"day":"30","conference":{"location":"Budapest, Hungary","end_date":"2019-07-19","start_date":"2019-07-14","name":"IJCNN: International Joint Conference on Neural Networks"},"type":"conference","status":"public","_id":"6985","article_number":"8851954","external_id":{"arxiv":["1809.03864"]},"author":[{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"first_name":"Felix","last_name":"Naser","full_name":"Naser, Felix"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"}],"title":"Response characterization for auditing cell dynamics in long short-term memory networks","department":[{"_id":"ToHe"}],"citation":{"chicago":"Hasani, Ramin, Alexander Amini, Mathias Lechner, Felix Naser, Radu Grosu, and Daniela Rus. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” In Proceedings of the International Joint Conference on Neural Networks. IEEE, 2019. https://doi.org/10.1109/ijcnn.2019.8851954.","ista":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. 2019. Response characterization for auditing cell dynamics in long short-term memory networks. Proceedings of the International Joint Conference on Neural Networks. IJCNN: International Joint Conference on Neural Networks, 8851954.","mla":"Hasani, Ramin, et al. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” Proceedings of the International Joint Conference on Neural Networks, 8851954, IEEE, 2019, doi:10.1109/ijcnn.2019.8851954.","ieee":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, and D. Rus, “Response characterization for auditing cell dynamics in long short-term memory networks,” in Proceedings of the International Joint Conference on Neural Networks, Budapest, Hungary, 2019.","short":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, D. Rus, in:, Proceedings of the International Joint Conference on Neural Networks, IEEE, 2019.","apa":"Hasani, R., Amini, A., Lechner, M., Naser, F., Grosu, R., & Rus, D. (2019). Response characterization for auditing cell dynamics in long short-term memory networks. In Proceedings of the International Joint Conference on Neural Networks. Budapest, Hungary: IEEE. https://doi.org/10.1109/ijcnn.2019.8851954","ama":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. Response characterization for auditing cell dynamics in long short-term memory networks. In: Proceedings of the International Joint Conference on Neural Networks. IEEE; 2019. doi:10.1109/ijcnn.2019.8851954"},"date_updated":"2021-01-12T08:11:19Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication":"Algorithms","day":"18","year":"2019","has_accepted_license":"1","date_created":"2019-11-12T14:46:19Z","date_published":"2019-10-18T00:00:00Z","doi":"10.3390/a12100218","oa":1,"publisher":"MDPI","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Mondelli, Marco, S. Hamed Hassani, and Rüdiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms. MDPI, 2019. https://doi.org/10.3390/a12100218.","ista":"Mondelli M, Hassani SH, Urbanke R. 2019. A new coding paradigm for the primitive relay channel. Algorithms. 12(10), 218.","mla":"Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms, vol. 12, no. 10, 218, MDPI, 2019, doi:10.3390/a12100218.","short":"M. Mondelli, S.H. Hassani, R. Urbanke, Algorithms 12 (2019).","ieee":"M. Mondelli, S. H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” Algorithms, vol. 12, no. 10. MDPI, 2019.","apa":"Mondelli, M., Hassani, S. H., & Urbanke, R. (2019). A new coding paradigm for the primitive relay channel. Algorithms. MDPI. https://doi.org/10.3390/a12100218","ama":"Mondelli M, Hassani SH, Urbanke R. A new coding paradigm for the primitive relay channel. Algorithms. 2019;12(10). doi:10.3390/a12100218"},"title":"A new coding paradigm for the primitive relay channel","external_id":{"arxiv":["1801.03153"]},"author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"first_name":"S. Hamed","full_name":"Hassani, S. Hamed","last_name":"Hassani"},{"full_name":"Urbanke, Rüdiger","last_name":"Urbanke","first_name":"Rüdiger"}],"article_number":"218","language":[{"iso":"eng"}],"file":[{"date_created":"2019-11-12T14:48:45Z","file_name":"2019_Algorithms_Mondelli.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:47Z","file_size":696791,"file_id":"7008","checksum":"267756d8f9db572f496cd1663c89d59a","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"issn":["1999-4893"]},"related_material":{"record":[{"id":"6675","status":"public","relation":"earlier_version"}]},"issue":"10","volume":12,"oa_version":"Published Version","abstract":[{"text":"We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding techniques have been introduced for this setting: decode-and-forward and compress-and-forward. In decode-and-forward, the relay completely decodes the message and sends some information to the destination; in compress-and-forward, the relay does not decode, and it sends a compressed version of the received signal to the destination using Wyner–Ziv coding. In this paper, we present a novel coding paradigm that provides an improved achievable rate for the primitive relay channel. The idea is to combine compress-and-forward and decode-and-forward via a chaining construction. We transmit over pairs of blocks: in the first block, we use compress-and-forward; and, in the second block, we use decode-and-forward. More specifically, in the first block, the relay does not decode, it compresses the received signal via Wyner–Ziv, and it sends only part of the compression to the destination. In the second block, the relay completely decodes the message, it sends some information to the destination, and it also sends the remaining part of the compression coming from the first block. By doing so, we are able to strictly outperform both compress-and-forward and decode-and-forward. Note that the proposed coding scheme can be implemented with polar codes. As such, it has the typical attractive properties of polar coding schemes, namely, quasi-linear encoding and decoding complexity, and error probability that decays at super-polynomial speed. As a running example, we take into account the special case of the erasure relay channel, and we provide a comparison between the rates achievable by our proposed scheme and the existing upper and lower bounds.","lang":"eng"}],"intvolume":" 12","month":"10","scopus_import":1,"ddc":["510"],"date_updated":"2023-02-23T12:49:28Z","file_date_updated":"2020-07-14T12:47:47Z","department":[{"_id":"MaMo"}],"_id":"7007","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)"},"type":"journal_article","article_type":"original"},{"abstract":[{"lang":"eng","text":"The aim of this short note is to expound one particular issue that was discussed during the talk [10] given at the symposium ”Researches on isometries as preserver problems and related topics” at Kyoto RIMS. That is, the role of Dirac masses by describing the isometry group of various metric spaces of probability measures. This article is of survey character, and it does not contain any essentially new results.From an isometric point of view, in some cases, metric spaces of measures are similar to C(K)-type function spaces. Similarity means here that their isometries are driven by some nice transformations of the underlying space. Of course, it depends on the particular choice of the metric how nice these transformations should be. Sometimes, as we will see, being a homeomorphism is enough to generate an isometry. But sometimes we need more: the transformation must preserve the underlying distance as well. Statements claiming that isometries in questions are necessarily induced by homeomorphisms are called Banach-Stone-type results, while results asserting that the underlying transformation is necessarily an isometry are termed as isometric rigidity results.As Dirac masses can be considered as building bricks of the set of all Borel measures, a natural question arises:Is it enough to understand how an isometry acts on the set of Dirac masses? Does this action extend uniquely to all measures?In what follows, we will thoroughly investigate this question."}],"oa_version":"Submitted Version","oa":1,"main_file_link":[{"url":"http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/2125.html","open_access":"1"}],"quality_controlled":"1","publisher":"Research Institute for Mathematical Sciences, Kyoto University","intvolume":" 2125","month":"01","publication_status":"published","year":"2019","publication":"Kyoto RIMS Kôkyûroku","language":[{"iso":"eng"}],"day":"30","page":"34-41","date_created":"2019-11-18T15:39:53Z","date_published":"2019-01-30T00:00:00Z","volume":2125,"_id":"7035","conference":{"name":"Research on isometries as preserver problems and related topics","start_date":"2019-01-28","location":"Kyoto, Japan","end_date":"2019-01-30"},"type":"conference","status":"public","citation":{"ista":"Geher GP, Titkos T, Virosztek D. 2019. Dirac masses and isometric rigidity. Kyoto RIMS Kôkyûroku. Research on isometries as preserver problems and related topics vol. 2125, 34–41.","chicago":"Geher, Gyorgy Pal, Tamas Titkos, and Daniel Virosztek. “Dirac Masses and Isometric Rigidity.” In Kyoto RIMS Kôkyûroku, 2125:34–41. Research Institute for Mathematical Sciences, Kyoto University, 2019.","short":"G.P. Geher, T. Titkos, D. Virosztek, in:, Kyoto RIMS Kôkyûroku, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41.","ieee":"G. P. Geher, T. Titkos, and D. Virosztek, “Dirac masses and isometric rigidity,” in Kyoto RIMS Kôkyûroku, Kyoto, Japan, 2019, vol. 2125, pp. 34–41.","ama":"Geher GP, Titkos T, Virosztek D. Dirac masses and isometric rigidity. In: Kyoto RIMS Kôkyûroku. Vol 2125. Research Institute for Mathematical Sciences, Kyoto University; 2019:34-41.","apa":"Geher, G. P., Titkos, T., & Virosztek, D. (2019). Dirac masses and isometric rigidity. In Kyoto RIMS Kôkyûroku (Vol. 2125, pp. 34–41). Kyoto, Japan: Research Institute for Mathematical Sciences, Kyoto University.","mla":"Geher, Gyorgy Pal, et al. “Dirac Masses and Isometric Rigidity.” Kyoto RIMS Kôkyûroku, vol. 2125, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41."},"date_updated":"2021-01-12T08:11:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"first_name":"Gyorgy Pal","full_name":"Geher, Gyorgy Pal","last_name":"Geher"},{"first_name":"Tamas","full_name":"Titkos, Tamas","last_name":"Titkos"},{"first_name":"Daniel","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1109-5511","full_name":"Virosztek, Daniel","last_name":"Virosztek"}],"department":[{"_id":"LaEr"}],"title":"Dirac masses and isometric rigidity"},{"issue":"10","volume":7,"file":[{"file_name":"2019_APL_Shirer.pdf","date_created":"2019-11-20T12:27:01Z","file_size":2453220,"date_updated":"2020-07-14T12:47:48Z","creator":"dernst","file_id":"7087","checksum":"142fe7b3e37d8e916071743bb194360d","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2166-532X"]},"publication_status":"published","month":"10","intvolume":" 7","oa_version":"Published Version","abstract":[{"text":"A recent class of topological nodal-line semimetals with the general formula MSiX (M = Zr, Hf and X = S, Se, Te) has attracted much experimental and theoretical interest due to their properties, particularly their large magnetoresistances and high carrier mobilities. The plateletlike nature of the MSiX crystals and their extremely low residual resistivities make measurements of the resistivity along the [001] direction extremely challenging. To accomplish such measurements, microstructures of single crystals were prepared using focused ion beam techniques. Microstructures prepared in this manner have very well-defined geometries and maintain their high crystal quality, verified by the observations of quantum oscillations. We present magnetoresistance and quantum oscillation data for currents applied along both [001] and [100] in ZrSiS and ZrSiSe, which are consistent with the nontrivial topology of the Dirac line-node, as determined by a measured π Berry phase. Surprisingly, we find that, despite the three dimensional nature of both the Fermi surfaces of ZrSiS and ZrSiSe, both the resistivity anisotropy under applied magnetic fields and the in-plane angular dependent magnetoresistance differ considerably between the two compounds. Finally, we discuss the role microstructuring can play in the study of these materials and our ability to make these microstructures free-standing.","lang":"eng"}],"file_date_updated":"2020-07-14T12:47:48Z","extern":"1","ddc":["530"],"date_updated":"2021-01-12T08:11:35Z","status":"public","article_type":"original","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)"},"_id":"7055","date_published":"2019-10-17T00:00:00Z","doi":"10.1063/1.5124568","date_created":"2019-11-19T12:52:43Z","day":"17","publication":"APL Materials","has_accepted_license":"1","year":"2019","quality_controlled":"1","publisher":"AIP","oa":1,"title":"Out-of-plane transport in ZrSiS and ZrSiSe microstructures","author":[{"last_name":"Shirer","full_name":"Shirer, Kent R.","first_name":"Kent R."},{"first_name":"Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","full_name":"Modic, Kimberly A","orcid":"0000-0001-9760-3147","last_name":"Modic"},{"full_name":"Zimmerling, Tino","last_name":"Zimmerling","first_name":"Tino"},{"first_name":"Maja D.","full_name":"Bachmann, Maja D.","last_name":"Bachmann"},{"full_name":"König, Markus","last_name":"König","first_name":"Markus"},{"full_name":"Moll, Philip J. W.","last_name":"Moll","first_name":"Philip J. W."},{"first_name":"Leslie","full_name":"Schoop, Leslie","last_name":"Schoop"},{"first_name":"Andrew P.","last_name":"Mackenzie","full_name":"Mackenzie, Andrew P."}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"K.R. Shirer, K.A. Modic, T. Zimmerling, M.D. Bachmann, M. König, P.J.W. Moll, L. Schoop, A.P. Mackenzie, APL Materials 7 (2019).","ieee":"K. R. Shirer et al., “Out-of-plane transport in ZrSiS and ZrSiSe microstructures,” APL Materials, vol. 7, no. 10. AIP, 2019.","apa":"Shirer, K. R., Modic, K. A., Zimmerling, T., Bachmann, M. D., König, M., Moll, P. J. W., … Mackenzie, A. P. (2019). Out-of-plane transport in ZrSiS and ZrSiSe microstructures. APL Materials. AIP. https://doi.org/10.1063/1.5124568","ama":"Shirer KR, Modic KA, Zimmerling T, et al. Out-of-plane transport in ZrSiS and ZrSiSe microstructures. APL Materials. 2019;7(10). doi:10.1063/1.5124568","mla":"Shirer, Kent R., et al. “Out-of-Plane Transport in ZrSiS and ZrSiSe Microstructures.” APL Materials, vol. 7, no. 10, 101116, AIP, 2019, doi:10.1063/1.5124568.","ista":"Shirer KR, Modic KA, Zimmerling T, Bachmann MD, König M, Moll PJW, Schoop L, Mackenzie AP. 2019. Out-of-plane transport in ZrSiS and ZrSiSe microstructures. APL Materials. 7(10), 101116.","chicago":"Shirer, Kent R., Kimberly A Modic, Tino Zimmerling, Maja D. Bachmann, Markus König, Philip J. W. Moll, Leslie Schoop, and Andrew P. Mackenzie. “Out-of-Plane Transport in ZrSiS and ZrSiSe Microstructures.” APL Materials. AIP, 2019. https://doi.org/10.1063/1.5124568."},"article_number":"101116"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Modic, Kimberly A, Tobias Meng, Filip Ronning, Eric D. Bauer, Philip J. W. Moll, and B. J. Ramshaw. “Thermodynamic Signatures of Weyl Fermions in NbP.” Scientific Reports. Springer Nature, 2019. https://doi.org/10.1038/s41598-018-38161-7.","ista":"Modic KA, Meng T, Ronning F, Bauer ED, Moll PJW, Ramshaw BJ. 2019. Thermodynamic signatures of Weyl fermions in NbP. Scientific Reports. 9(1), 2095.","mla":"Modic, Kimberly A., et al. “Thermodynamic Signatures of Weyl Fermions in NbP.” Scientific Reports, vol. 9, no. 1, 2095, Springer Nature, 2019, doi:10.1038/s41598-018-38161-7.","apa":"Modic, K. A., Meng, T., Ronning, F., Bauer, E. D., Moll, P. J. W., & Ramshaw, B. J. (2019). Thermodynamic signatures of Weyl fermions in NbP. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-018-38161-7","ama":"Modic KA, Meng T, Ronning F, Bauer ED, Moll PJW, Ramshaw BJ. Thermodynamic signatures of Weyl fermions in NbP. Scientific Reports. 2019;9(1). doi:10.1038/s41598-018-38161-7","ieee":"K. A. Modic, T. Meng, F. Ronning, E. D. Bauer, P. J. W. Moll, and B. J. Ramshaw, “Thermodynamic signatures of Weyl fermions in NbP,” Scientific Reports, vol. 9, no. 1. Springer Nature, 2019.","short":"K.A. Modic, T. Meng, F. Ronning, E.D. Bauer, P.J.W. Moll, B.J. Ramshaw, Scientific Reports 9 (2019)."},"title":"Thermodynamic signatures of Weyl fermions in NbP","author":[{"last_name":"Modic","full_name":"Modic, Kimberly A","orcid":"0000-0001-9760-3147","first_name":"Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425"},{"full_name":"Meng, Tobias","last_name":"Meng","first_name":"Tobias"},{"last_name":"Ronning","full_name":"Ronning, Filip","first_name":"Filip"},{"first_name":"Eric D.","last_name":"Bauer","full_name":"Bauer, Eric D."},{"first_name":"Philip J. W.","full_name":"Moll, Philip J. W.","last_name":"Moll"},{"first_name":"B. J.","full_name":"Ramshaw, B. J.","last_name":"Ramshaw"}],"article_processing_charge":"No","article_number":"2095","day":"14","publication":"Scientific Reports","has_accepted_license":"1","year":"2019","date_published":"2019-02-14T00:00:00Z","doi":"10.1038/s41598-018-38161-7","date_created":"2019-11-19T13:00:35Z","quality_controlled":"1","publisher":"Springer Nature","oa":1,"extern":"1","ddc":["530"],"date_updated":"2021-01-12T08:11:36Z","file_date_updated":"2020-07-14T12:47:48Z","_id":"7057","status":"public","type":"journal_article","article_type":"original","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)"},"file":[{"file_id":"7086","checksum":"3b5a7b316e1ff22aa0f89e8d1f1ace91","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2019-11-20T12:24:13Z","file_name":"2019_ScientificReports_Modic.pdf","date_updated":"2020-07-14T12:47:48Z","file_size":3256400,"creator":"dernst"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2045-2322"]},"publication_status":"published","issue":"1","volume":9,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We present a high magnetic field study of NbP—a member of the monopnictide Weyl semimetal (WSM) family. While the monoarsenides (NbAs and TaAs) have topologically distinct left and right-handed Weyl fermi surfaces, NbP is argued to be “topologically trivial” due to the fact that all pairs of Weyl nodes are encompassed by a single Fermi surface. We use torque magnetometry to measure the magnetic response of NbP up to 60 tesla and uncover a Berry paramagnetic response, characteristic of the topological Weyl nodes, across the entire field range. At the quantum limit B* (≈32 T), τ/B experiences a change in slope when the chemical potential enters the last Landau level. Our calculations confirm that this magnetic response arises from band topology of the Weyl pocket, even though the Fermi surface encompasses both Weyl nodes at zero magnetic field. We also find that the magnetic field pulls the chemical potential to the chiral n = 0 Landau level in the quantum limit, providing a disorder-free way of accessing chiral Weyl fermions in systems that are “not quite” WSMs in zero magnetic field."}],"month":"02","intvolume":" 9"},{"article_type":"original","type":"journal_article","status":"public","_id":"7056","date_updated":"2021-01-12T08:11:35Z","extern":"1","main_file_link":[{"url":"https://arxiv.org/abs/1905.08640","open_access":"1"}],"month":"09","intvolume":" 31","abstract":[{"lang":"eng","text":"In the Ca1−x La x FeAs2 (1 1 2) family of pnictide superconductors, we have investigated a highly overdoped composition (x = 0.56), prepared by a high-pressure, high-temperature synthesis. Magnetic measurements show an antiferromagnetic transition at T N = 120 K, well above the one at lower doping (0.15 < x < 0.27).\r\n\r\nBelow the onset of long-range magnetic order at T N, the electrical resistivity is strongly reduced and is dominated by electron–electron interactions, as evident from its temperature dependence. The Seebeck coefficient shows a clear metallic behavior as in narrow band conductors. The temperature dependence of the Hall coefficient and the violation of Kohler's rule agree with the multiband character of the material. No superconductivity was observed down to 1.8 K. The success of the high-pressure synthesis encourages further investigations of the so far only partially explored phase diagram in this family of Iron-based high temperature superconductors.\r\n"}],"oa_version":"Preprint","volume":31,"issue":"48","publication_identifier":{"issn":["0953-8984"],"eissn":["1361-648X"]},"publication_status":"published","language":[{"iso":"eng"}],"article_number":"485705","author":[{"first_name":"Edoardo","last_name":"Martino","full_name":"Martino, Edoardo"},{"full_name":"Bachmann, Maja D","last_name":"Bachmann","first_name":"Maja D"},{"first_name":"Lidia","last_name":"Rossi","full_name":"Rossi, Lidia"},{"id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","first_name":"Kimberly A","last_name":"Modic","full_name":"Modic, Kimberly A","orcid":"0000-0001-9760-3147"},{"last_name":"Zivkovic","full_name":"Zivkovic, Ivica","first_name":"Ivica"},{"full_name":"Rønnow, Henrik M","last_name":"Rønnow","first_name":"Henrik M"},{"full_name":"Moll, Philip J W","last_name":"Moll","first_name":"Philip J W"},{"first_name":"Ana","last_name":"Akrap","full_name":"Akrap, Ana"},{"first_name":"László","last_name":"Forró","full_name":"Forró, László"},{"first_name":"Sergiy","full_name":"Katrych, Sergiy","last_name":"Katrych"}],"external_id":{"arxiv":["1905.08640"]},"article_processing_charge":"No","title":"Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2","citation":{"ista":"Martino E, Bachmann MD, Rossi L, Modic KA, Zivkovic I, Rønnow HM, Moll PJW, Akrap A, Forró L, Katrych S. 2019. Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2. Journal of Physics: Condensed Matter. 31(48), 485705.","chicago":"Martino, Edoardo, Maja D Bachmann, Lidia Rossi, Kimberly A Modic, Ivica Zivkovic, Henrik M Rønnow, Philip J W Moll, Ana Akrap, László Forró, and Sergiy Katrych. “Persistent Antiferromagnetic Order in Heavily Overdoped Ca1−x La x FeAs2.” Journal of Physics: Condensed Matter. IOP Publishing, 2019. https://doi.org/10.1088/1361-648x/ab3b43.","ama":"Martino E, Bachmann MD, Rossi L, et al. Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2. Journal of Physics: Condensed Matter. 2019;31(48). doi:10.1088/1361-648x/ab3b43","apa":"Martino, E., Bachmann, M. D., Rossi, L., Modic, K. A., Zivkovic, I., Rønnow, H. M., … Katrych, S. (2019). Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2. Journal of Physics: Condensed Matter. IOP Publishing. https://doi.org/10.1088/1361-648x/ab3b43","ieee":"E. Martino et al., “Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2,” Journal of Physics: Condensed Matter, vol. 31, no. 48. IOP Publishing, 2019.","short":"E. Martino, M.D. Bachmann, L. Rossi, K.A. Modic, I. Zivkovic, H.M. Rønnow, P.J.W. Moll, A. Akrap, L. Forró, S. Katrych, Journal of Physics: Condensed Matter 31 (2019).","mla":"Martino, Edoardo, et al. “Persistent Antiferromagnetic Order in Heavily Overdoped Ca1−x La x FeAs2.” Journal of Physics: Condensed Matter, vol. 31, no. 48, 485705, IOP Publishing, 2019, doi:10.1088/1361-648x/ab3b43."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IOP Publishing","quality_controlled":"1","oa":1,"doi":"10.1088/1361-648x/ab3b43","date_published":"2019-09-03T00:00:00Z","date_created":"2019-11-19T12:56:17Z","year":"2019","day":"03","publication":"Journal of Physics: Condensed Matter"},{"date_created":"2019-11-19T13:55:58Z","doi":"10.1126/science.aao6640","volume":366,"issue":"6462","date_published":"2019-10-11T00:00:00Z","page":"221-226","language":[{"iso":"eng"}],"publication":"Science","day":"11","year":"2019","publication_status":"published","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"intvolume":" 366","month":"10","quality_controlled":"1","publisher":"AAAS","oa_version":"None","abstract":[{"text":"Although crystals of strongly correlated metals exhibit a diverse set of electronic ground states, few approaches exist for spatially modulating their properties. In this study, we demonstrate disorder-free control, on the micrometer scale, over the superconducting state in samples of the heavy-fermion superconductor CeIrIn5. We pattern crystals by focused ion beam milling to tailor the boundary conditions for the elastic deformation upon thermal contraction during cooling. The resulting nonuniform strain fields induce complex patterns of superconductivity, owing to the strong dependence of the transition temperature on the strength and direction of strain. These results showcase a generic approach to manipulating electronic order on micrometer length scales in strongly correlated matter without compromising the cleanliness, stoichiometry, or mean free path.","lang":"eng"}],"title":"Spatial control of heavy-fermion superconductivity in CeIrIn5","article_processing_charge":"No","author":[{"first_name":"Maja D.","last_name":"Bachmann","full_name":"Bachmann, Maja D."},{"first_name":"G. M.","last_name":"Ferguson","full_name":"Ferguson, G. M."},{"first_name":"Florian","full_name":"Theuss, Florian","last_name":"Theuss"},{"first_name":"Tobias","last_name":"Meng","full_name":"Meng, Tobias"},{"full_name":"Putzke, Carsten","last_name":"Putzke","first_name":"Carsten"},{"full_name":"Helm, Toni","last_name":"Helm","first_name":"Toni"},{"full_name":"Shirer, K. R.","last_name":"Shirer","first_name":"K. R."},{"first_name":"You-Sheng","last_name":"Li","full_name":"Li, You-Sheng"},{"last_name":"Modic","full_name":"Modic, Kimberly A","orcid":"0000-0001-9760-3147","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","first_name":"Kimberly A"},{"last_name":"Nicklas","full_name":"Nicklas, Michael","first_name":"Michael"},{"last_name":"König","full_name":"König, Markus","first_name":"Markus"},{"first_name":"D.","full_name":"Low, D.","last_name":"Low"},{"first_name":"Sayak","full_name":"Ghosh, Sayak","last_name":"Ghosh"},{"last_name":"Mackenzie","full_name":"Mackenzie, Andrew P.","first_name":"Andrew P."},{"last_name":"Arnold","full_name":"Arnold, Frank","first_name":"Frank"},{"first_name":"Elena","last_name":"Hassinger","full_name":"Hassinger, Elena"},{"full_name":"McDonald, Ross D.","last_name":"McDonald","first_name":"Ross D."},{"last_name":"Winter","full_name":"Winter, Laurel E.","first_name":"Laurel E."},{"last_name":"Bauer","full_name":"Bauer, Eric D.","first_name":"Eric D."},{"full_name":"Ronning, Filip","last_name":"Ronning","first_name":"Filip"},{"first_name":"B. J.","full_name":"Ramshaw, B. J.","last_name":"Ramshaw"},{"first_name":"Katja C.","last_name":"Nowack","full_name":"Nowack, Katja C."},{"last_name":"Moll","full_name":"Moll, Philip J. W.","first_name":"Philip J. W."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2021-01-12T08:11:46Z","citation":{"ista":"Bachmann MD, Ferguson GM, Theuss F, Meng T, Putzke C, Helm T, Shirer KR, Li Y-S, Modic KA, Nicklas M, König M, Low D, Ghosh S, Mackenzie AP, Arnold F, Hassinger E, McDonald RD, Winter LE, Bauer ED, Ronning F, Ramshaw BJ, Nowack KC, Moll PJW. 2019. Spatial control of heavy-fermion superconductivity in CeIrIn5. Science. 366(6462), 221–226.","chicago":"Bachmann, Maja D., G. M. Ferguson, Florian Theuss, Tobias Meng, Carsten Putzke, Toni Helm, K. R. Shirer, et al. “Spatial Control of Heavy-Fermion Superconductivity in CeIrIn5.” Science. AAAS, 2019. https://doi.org/10.1126/science.aao6640.","short":"M.D. Bachmann, G.M. Ferguson, F. Theuss, T. Meng, C. Putzke, T. Helm, K.R. Shirer, Y.-S. Li, K.A. Modic, M. Nicklas, M. König, D. Low, S. Ghosh, A.P. Mackenzie, F. Arnold, E. Hassinger, R.D. McDonald, L.E. Winter, E.D. Bauer, F. Ronning, B.J. Ramshaw, K.C. Nowack, P.J.W. Moll, Science 366 (2019) 221–226.","ieee":"M. D. Bachmann et al., “Spatial control of heavy-fermion superconductivity in CeIrIn5,” Science, vol. 366, no. 6462. AAAS, pp. 221–226, 2019.","ama":"Bachmann MD, Ferguson GM, Theuss F, et al. Spatial control of heavy-fermion superconductivity in CeIrIn5. Science. 2019;366(6462):221-226. doi:10.1126/science.aao6640","apa":"Bachmann, M. D., Ferguson, G. M., Theuss, F., Meng, T., Putzke, C., Helm, T., … Moll, P. J. W. (2019). Spatial control of heavy-fermion superconductivity in CeIrIn5. Science. AAAS. https://doi.org/10.1126/science.aao6640","mla":"Bachmann, Maja D., et al. “Spatial Control of Heavy-Fermion Superconductivity in CeIrIn5.” Science, vol. 366, no. 6462, AAAS, 2019, pp. 221–26, doi:10.1126/science.aao6640."},"status":"public","article_type":"original","type":"journal_article","_id":"7082"},{"_id":"7128","keyword":["cardiomyocyte","cell cycle","Cofilin2","cytoskeleton","Hippo","microRNA","regeneration","YAP"],"status":"public","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"article_type":"original","type":"journal_article","ddc":["576"],"extern":"1","date_updated":"2021-01-12T08:11:56Z","file_date_updated":"2020-07-14T12:47:50Z","oa_version":"Published Version","pmid":1,"abstract":[{"lang":"eng","text":"Loss of functional cardiomyocytes is a major determinant of heart failure after myocardial infarction. Previous high throughput screening studies have identified a few microRNAs (miRNAs) that can induce cardiomyocyte proliferation and stimulate cardiac regeneration in mice. Here, we show that all of the most effective of these miRNAs activate nuclear localization of the master transcriptional cofactor Yes-associated protein (YAP) and induce expression of YAP-responsive genes. In particular, miR-199a-3p directly targets two mRNAs coding for proteins impinging on the Hippo pathway, the upstream YAP inhibitory kinase TAOK1, and the E3 ubiquitin ligase β-TrCP, which leads to YAP degradation. Several of the pro-proliferative miRNAs (including miR-199a-3p) also inhibit filamentous actin depolymerization by targeting Cofilin2, a process that by itself activates YAP nuclear translocation. Thus, activation of YAP and modulation of the actin cytoskeleton are major components of the pro-proliferative action of miR-199a-3p and other miRNAs that induce cardiomyocyte proliferation."}],"intvolume":" 27","month":"05","language":[{"iso":"eng"}],"file":[{"file_id":"7129","checksum":"c5d855d07263bfec718673385d0ea2d7","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"torrini_cellreports_2019.pdf","date_created":"2019-11-26T22:30:43Z","creator":"rcubero","file_size":4650750,"date_updated":"2020-07-14T12:47:50Z"}],"publication_status":"published","publication_identifier":{"issn":["2211-1247"]},"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","volume":27,"issue":"9","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Torrini C, Cubero RJ, Dirkx E, Braga L, Ali H, Prosdocimo G, Gutierrez MI, Collesi C, Licastro D, Zentilin L, Mano M, Zacchigna S, Vendruscolo M, Marsili M, Samal A, Giacca M. 2019. Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. Cell Reports. 27(9), 2759–2771.e5.","chicago":"Torrini, Consuelo, Ryan J Cubero, Ellen Dirkx, Luca Braga, Hashim Ali, Giulia Prosdocimo, Maria Ines Gutierrez, et al. “Common Regulatory Pathways Mediate Activity of MicroRNAs Inducing Cardiomyocyte Proliferation.” Cell Reports. Elsevier, 2019. https://doi.org/10.1016/j.celrep.2019.05.005.","apa":"Torrini, C., Cubero, R. J., Dirkx, E., Braga, L., Ali, H., Prosdocimo, G., … Giacca, M. (2019). Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. Cell Reports. Elsevier. https://doi.org/10.1016/j.celrep.2019.05.005","ama":"Torrini C, Cubero RJ, Dirkx E, et al. Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. Cell Reports. 2019;27(9):2759-2771.e5. doi:10.1016/j.celrep.2019.05.005","short":"C. Torrini, R.J. Cubero, E. Dirkx, L. Braga, H. Ali, G. Prosdocimo, M.I. Gutierrez, C. Collesi, D. Licastro, L. Zentilin, M. Mano, S. Zacchigna, M. Vendruscolo, M. Marsili, A. Samal, M. Giacca, Cell Reports 27 (2019) 2759–2771.e5.","ieee":"C. Torrini et al., “Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation,” Cell Reports, vol. 27, no. 9. Elsevier, p. 2759–2771.e5, 2019.","mla":"Torrini, Consuelo, et al. “Common Regulatory Pathways Mediate Activity of MicroRNAs Inducing Cardiomyocyte Proliferation.” Cell Reports, vol. 27, no. 9, Elsevier, 2019, p. 2759–2771.e5, doi:10.1016/j.celrep.2019.05.005."},"title":"Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation","article_processing_charge":"Yes","external_id":{"pmid":["31141697"]},"author":[{"full_name":"Torrini, Consuelo","last_name":"Torrini","first_name":"Consuelo"},{"last_name":"Cubero","orcid":"0000-0003-0002-1867","full_name":"Cubero, Ryan J","first_name":"Ryan J","id":"850B2E12-9CD4-11E9-837F-E719E6697425"},{"full_name":"Dirkx, Ellen","last_name":"Dirkx","first_name":"Ellen"},{"last_name":"Braga","full_name":"Braga, Luca","first_name":"Luca"},{"first_name":"Hashim","last_name":"Ali","full_name":"Ali, Hashim"},{"first_name":"Giulia","full_name":"Prosdocimo, Giulia","last_name":"Prosdocimo"},{"full_name":"Gutierrez, Maria Ines","last_name":"Gutierrez","first_name":"Maria Ines"},{"last_name":"Collesi","full_name":"Collesi, Chiara","first_name":"Chiara"},{"last_name":"Licastro","full_name":"Licastro, Danilo","first_name":"Danilo"},{"first_name":"Lorena","full_name":"Zentilin, Lorena","last_name":"Zentilin"},{"first_name":"Miguel","full_name":"Mano, Miguel","last_name":"Mano"},{"last_name":"Zacchigna","full_name":"Zacchigna, Serena","first_name":"Serena"},{"last_name":"Vendruscolo","full_name":"Vendruscolo, Michele","first_name":"Michele"},{"full_name":"Marsili, Matteo","last_name":"Marsili","first_name":"Matteo"},{"first_name":"Areejit","full_name":"Samal, Areejit","last_name":"Samal"},{"last_name":"Giacca","full_name":"Giacca, Mauro","first_name":"Mauro"}],"oa":1,"publisher":"Elsevier","quality_controlled":"1","publication":"Cell Reports","day":"28","year":"2019","has_accepted_license":"1","date_created":"2019-11-26T22:30:07Z","date_published":"2019-05-28T00:00:00Z","doi":"10.1016/j.celrep.2019.05.005","page":"2759-2771.e5"},{"quality_controlled":"1","publisher":"IOP Publishing","oa":1,"acknowledgement":"We acknowledge interesting discussions with M Abbott, E Aurell, J Barbier, R Monasson, T Mora, I Nemenman, N Tishby and R Zecchina. This research was supported by the Kavli Foundation and the Centre of Excellence scheme of the Research Council of Norway (Centre for Neural Computation) (RJC and YR), by the Basic Science Research Program through the National Research Foundation of Korea (NRF), funded by the Ministry of Education (2016R1D1A1B03932264) (JJ), and, in part, by the ICTP through the OEA-AC-98 (JS).","doi":"10.1088/1742-5468/ab16c8","date_published":"2019-06-17T00:00:00Z","date_created":"2019-11-26T22:36:09Z","year":"2019","day":"17","publication":"Journal of Statistical Mechanics: Theory and Experiment","article_number":"063402","author":[{"first_name":"Ryan J","id":"850B2E12-9CD4-11E9-837F-E719E6697425","last_name":"Cubero","orcid":"0000-0003-0002-1867","full_name":"Cubero, Ryan J"},{"first_name":"Junghyo","last_name":"Jo","full_name":"Jo, Junghyo"},{"last_name":"Marsili","full_name":"Marsili, Matteo","first_name":"Matteo"},{"full_name":"Roudi, Yasser","last_name":"Roudi","first_name":"Yasser"},{"full_name":"Song, Juyong","last_name":"Song","first_name":"Juyong"}],"external_id":{"arxiv":["1808.00249"]},"article_processing_charge":"No","title":"Statistical criticality arises in most informative representations","citation":{"mla":"Cubero, Ryan J., et al. “Statistical Criticality Arises in Most Informative Representations.” Journal of Statistical Mechanics: Theory and Experiment, vol. 2019, no. 6, 063402, IOP Publishing, 2019, doi:10.1088/1742-5468/ab16c8.","short":"R.J. Cubero, J. Jo, M. Marsili, Y. Roudi, J. Song, Journal of Statistical Mechanics: Theory and Experiment 2019 (2019).","ieee":"R. J. Cubero, J. Jo, M. Marsili, Y. Roudi, and J. Song, “Statistical criticality arises in most informative representations,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2019, no. 6. IOP Publishing, 2019.","apa":"Cubero, R. J., Jo, J., Marsili, M., Roudi, Y., & Song, J. (2019). Statistical criticality arises in most informative representations. Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing. https://doi.org/10.1088/1742-5468/ab16c8","ama":"Cubero RJ, Jo J, Marsili M, Roudi Y, Song J. Statistical criticality arises in most informative representations. Journal of Statistical Mechanics: Theory and Experiment. 2019;2019(6). doi:10.1088/1742-5468/ab16c8","chicago":"Cubero, Ryan J, Junghyo Jo, Matteo Marsili, Yasser Roudi, and Juyong Song. “Statistical Criticality Arises in Most Informative Representations.” Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing, 2019. https://doi.org/10.1088/1742-5468/ab16c8.","ista":"Cubero RJ, Jo J, Marsili M, Roudi Y, Song J. 2019. Statistical criticality arises in most informative representations. Journal of Statistical Mechanics: Theory and Experiment. 2019(6), 063402."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://arxiv.org/abs/1808.00249","open_access":"1"}],"month":"06","intvolume":" 2019","abstract":[{"lang":"eng","text":"We show that statistical criticality, i.e. the occurrence of power law frequency distributions, arises in samples that are maximally informative about the underlying generating process. In order to reach this conclusion, we first identify the frequency with which different outcomes occur in a sample, as the variable carrying useful information on the generative process. The entropy of the frequency, that we call relevance, provides an upper bound to the number of informative bits. This differs from the entropy of the data, that we take as a measure of resolution. Samples that maximise relevance at a given resolution—that we call maximally informative samples—exhibit statistical criticality. In particular, Zipf's law arises at the optimal trade-off between resolution (i.e. compression) and relevance. As a byproduct, we derive a bound of the maximal number of parameters that can be estimated from a dataset, in the absence of prior knowledge on the generative model.\r\n\r\nFurthermore, we relate criticality to the statistical properties of the representation of the data generating process. We show that, as a consequence of the concentration property of the asymptotic equipartition property, representations that are maximally informative about the data generating process are characterised by an exponential distribution of energy levels. This arises from a principle of minimal entropy, that is conjugate of the maximum entropy principle in statistical mechanics. This explains why statistical criticality requires no parameter fine tuning in maximally informative samples."}],"oa_version":"Preprint","issue":"6","volume":2019,"publication_identifier":{"issn":["1742-5468"]},"publication_status":"published","language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","status":"public","keyword":["optimization under uncertainty","source coding","large deviation"],"_id":"7130","date_updated":"2021-01-12T08:11:57Z","extern":"1"},{"publisher":"Springer Nature","quality_controlled":"1","oa":1,"day":"01","publication":"Distributed Computing","year":"2019","date_published":"2019-12-01T00:00:00Z","doi":"10.1007/s00446-016-0270-2","date_created":"2019-12-05T09:49:49Z","page":"461-478","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Censor-Hillel, Keren, Petteri Kaski, Janne Korhonen, Christoph Lenzen, Ami Paz, and Jukka Suomela. “Algebraic Methods in the Congested Clique.” Distributed Computing. Springer Nature, 2019. https://doi.org/10.1007/s00446-016-0270-2.","ista":"Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. 2019. Algebraic methods in the congested clique. Distributed Computing. 32(6), 461–478.","mla":"Censor-Hillel, Keren, et al. “Algebraic Methods in the Congested Clique.” Distributed Computing, vol. 32, no. 6, Springer Nature, 2019, pp. 461–78, doi:10.1007/s00446-016-0270-2.","ama":"Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. Algebraic methods in the congested clique. Distributed Computing. 2019;32(6):461-478. doi:10.1007/s00446-016-0270-2","apa":"Censor-Hillel, K., Kaski, P., Korhonen, J., Lenzen, C., Paz, A., & Suomela, J. (2019). Algebraic methods in the congested clique. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-016-0270-2","short":"K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, J. Suomela, Distributed Computing 32 (2019) 461–478.","ieee":"K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, and J. Suomela, “Algebraic methods in the congested clique,” Distributed Computing, vol. 32, no. 6. Springer Nature, pp. 461–478, 2019."},"title":"Algebraic methods in the congested clique","author":[{"full_name":"Censor-Hillel, Keren","last_name":"Censor-Hillel","first_name":"Keren"},{"first_name":"Petteri","last_name":"Kaski","full_name":"Kaski, Petteri"},{"id":"C5402D42-15BC-11E9-A202-CA2BE6697425","first_name":"Janne","full_name":"Korhonen, Janne","last_name":"Korhonen"},{"first_name":"Christoph","full_name":"Lenzen, Christoph","last_name":"Lenzen"},{"full_name":"Paz, Ami","last_name":"Paz","first_name":"Ami"},{"last_name":"Suomela","full_name":"Suomela, Jukka","first_name":"Jukka"}],"article_processing_charge":"No","external_id":{"arxiv":["1503.04963"]},"oa_version":"Preprint","abstract":[{"lang":"eng","text":"In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an O(n1−2/ω) round matrix multiplication algorithm, where ω<2.3728639 is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include:\r\n\r\n1. triangle and 4-cycle counting in O(n0.158) rounds, improving upon the O(n1/3) algorithm of Dolev et al. [DISC 2012],\r\n2. a (1+o(1))-approximation of all-pairs shortest paths in O(n0.158) rounds, improving upon the O~(n1/2)-round (2+o(1))-approximation algorithm given by Nanongkai [STOC 2014], and\r\n 3. computing the girth in O(n0.158) rounds, which is the first non-trivial solution in this model.\r\n \r\nIn addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles."}],"month":"12","intvolume":" 32","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1503.04963"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0178-2770","1432-0452"]},"publication_status":"published","volume":32,"issue":"6","_id":"7150","status":"public","type":"journal_article","article_type":"original","extern":"1","date_updated":"2021-01-12T08:12:05Z"}]