[{"external_id":{"isi":["000391852800006"]},"year":"2017","isi":1,"publist_id":"6195","publication":"Physical Review B - Condensed Matter and Materials Physics","status":"public","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"date_published":"2017-01-13T00:00:00Z","ec_funded":1,"publisher":"American Physical Society","article_processing_charge":"No","doi":"10.1103/PhysRevB.95.024506","type":"journal_article","_id":"1162","date_updated":"2023-09-20T11:25:56Z","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1606.03247","open_access":"1"}],"month":"01","article_number":"024506","department":[{"_id":"MiLe"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Spałek J, Zegrodnik M, Kaczmarczyk J. Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment. Physical Review B - Condensed Matter and Materials Physics. 2017;95(2). doi:10.1103/PhysRevB.95.024506","short":"J. Spałek, M. Zegrodnik, J. Kaczmarczyk, Physical Review B - Condensed Matter and Materials Physics 95 (2017).","ieee":"J. Spałek, M. Zegrodnik, and J. Kaczmarczyk, “Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment,” Physical Review B - Condensed Matter and Materials Physics, vol. 95, no. 2. American Physical Society, 2017.","chicago":"Spałek, Jozef, Michał Zegrodnik, and Jan Kaczmarczyk. “Universal Properties of High Temperature Superconductors from Real Space Pairing T-J-U Model and Its Quantitative Comparison with Experiment.” Physical Review B - Condensed Matter and Materials Physics. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.95.024506.","ista":"Spałek J, Zegrodnik M, Kaczmarczyk J. 2017. Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment. Physical Review B - Condensed Matter and Materials Physics. 95(2), 024506.","mla":"Spałek, Jozef, et al. “Universal Properties of High Temperature Superconductors from Real Space Pairing T-J-U Model and Its Quantitative Comparison with Experiment.” Physical Review B - Condensed Matter and Materials Physics, vol. 95, no. 2, 024506, American Physical Society, 2017, doi:10.1103/PhysRevB.95.024506.","apa":"Spałek, J., Zegrodnik, M., & Kaczmarczyk, J. (2017). Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment. Physical Review B - Condensed Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/PhysRevB.95.024506"},"issue":"2","title":"Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment","oa_version":"Submitted Version","day":"13","scopus_import":"1","author":[{"first_name":"Jozef","last_name":"Spałek","full_name":"Spałek, Jozef"},{"first_name":"Michał","last_name":"Zegrodnik","full_name":"Zegrodnik, Michał"},{"full_name":"Kaczmarczyk, Jan","id":"46C405DE-F248-11E8-B48F-1D18A9856A87","last_name":"Kaczmarczyk","orcid":"0000-0002-1629-3675","first_name":"Jan"}],"date_created":"2018-12-11T11:50:29Z","volume":95,"intvolume":" 95","abstract":[{"lang":"eng","text":"Selected universal experimental properties of high-temperature superconducting (HTS) cuprates have been singled out in the last decade. One of the pivotal challenges in this field is the designation of a consistent interpretation framework within which we can describe quantitatively the universal features of those systems. Here we analyze in a detailed manner the principal experimental data and compare them quantitatively with the approach based on a single-band model of strongly correlated electrons supplemented with strong antiferromagnetic (super)exchange interaction (the so-called t−J−U model). The model rationale is provided by estimating its microscopic parameters on the basis of the three-band approach for the Cu-O plane. We use our original full Gutzwiller wave-function solution by going beyond the renormalized mean-field theory (RMFT) in a systematic manner. Our approach reproduces very well the observed hole doping (δ) dependence of the kinetic-energy gain in the superconducting phase, one of the principal non-Bardeen-Cooper-Schrieffer features of the cuprates. The calculated Fermi velocity in the nodal direction is practically δ-independent and its universal value agrees very well with that determined experimentally. Also, a weak doping dependence of the Fermi wave vector leads to an almost constant value of the effective mass in a pure superconducting phase which is both observed in experiment and reproduced within our approach. An assessment of the currently used models (t−J, Hubbard) is carried out and the results of the canonical RMFT as a zeroth-order solution are provided for comparison to illustrate the necessity of the introduced higher-order contributions."}],"publication_status":"published","publication_identifier":{"issn":["24699950"]}},{"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"status":"public","publication":"Journal of Physics: Condensed Matter","date_published":"2017-01-16T00:00:00Z","ec_funded":1,"external_id":{"isi":["000393955500001"]},"isi":1,"year":"2017","publist_id":"6194","quality_controlled":"1","publisher":"IOP Publishing Ltd.","doi":"10.1088/1361-648X/aa532f","article_processing_charge":"No","type":"journal_article","date_updated":"2023-09-20T11:25:32Z","_id":"1163","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"8","citation":{"ieee":"M. Wysokiński and J. Kaczmarczyk, “Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms,” Journal of Physics: Condensed Matter, vol. 29, no. 8. IOP Publishing Ltd., 2017.","short":"M. Wysokiński, J. Kaczmarczyk, Journal of Physics: Condensed Matter 29 (2017).","ama":"Wysokiński M, Kaczmarczyk J. Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms. Journal of Physics: Condensed Matter. 2017;29(8). doi:10.1088/1361-648X/aa532f","apa":"Wysokiński, M., & Kaczmarczyk, J. (2017). Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms. Journal of Physics: Condensed Matter. IOP Publishing Ltd. https://doi.org/10.1088/1361-648X/aa532f","mla":"Wysokiński, Marcin, and Jan Kaczmarczyk. “Unconventional Superconductivity in Generalized Hubbard Model Role of Electron–Hole Symmetry Breaking Terms.” Journal of Physics: Condensed Matter, vol. 29, no. 8, 085604, IOP Publishing Ltd., 2017, doi:10.1088/1361-648X/aa532f.","ista":"Wysokiński M, Kaczmarczyk J. 2017. Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms. Journal of Physics: Condensed Matter. 29(8), 085604.","chicago":"Wysokiński, Marcin, and Jan Kaczmarczyk. “Unconventional Superconductivity in Generalized Hubbard Model Role of Electron–Hole Symmetry Breaking Terms.” Journal of Physics: Condensed Matter. IOP Publishing Ltd., 2017. https://doi.org/10.1088/1361-648X/aa532f."},"month":"01","article_number":"085604","department":[{"_id":"MiLe"}],"abstract":[{"lang":"eng","text":"We investigate the effect of the electron-hole (e-h) symmetry breaking on d-wave superconductivity induced by non-local effects of correlations in the generalized Hubbard model. The symmetry breaking is introduced in a two-fold manner: by the next-to-nearest neighbor hopping of electrons and by the charge-bond interaction - the off-diagonal term of the Coulomb potential. Both terms lead to a pronounced asymmetry of the superconducting order parameter. The next-to-nearest neighbor hopping enhances superconductivity for h-doping, while diminishes it for e-doping. The charge-bond interaction alone leads to the opposite effect and, additionally, to the kinetic-energy gain upon condensation in the underdoped regime. With both terms included, with similar amplitudes, the height of the superconducting dome and the critical doping remain in favor of h-doping. The influence of the charge-bond interaction on deviations from symmetry of the shape of the gap at the Fermi surface in the momentum space is briefly discussed."}],"intvolume":" 29","publication_status":"published","publication_identifier":{"issn":["09538984"]},"title":"Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms","oa_version":"None","author":[{"first_name":"Marcin","full_name":"Wysokiński, Marcin","last_name":"Wysokiński"},{"orcid":"0000-0002-1629-3675","first_name":"Jan","last_name":"Kaczmarczyk","full_name":"Kaczmarczyk, Jan","id":"46C405DE-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","day":"16","date_created":"2018-12-11T11:50:29Z","volume":29},{"keyword":["asteroseismology - methods","data analysis - stars","oscillations"],"article_number":"1711.02890","year":"2017","external_id":{"arxiv":["1711.02890"]},"arxiv":1,"month":"11","citation":{"ama":"Bugnet LA, Garcia RA, Davies GR, Mathur S, Corsaro E. FliPer: Checking the reliability of global seismic parameters from automatic pipelines. arXiv. doi:10.48550/arXiv.1711.02890","ieee":"L. A. Bugnet, R. A. Garcia, G. R. Davies, S. Mathur, and E. Corsaro, “FliPer: Checking the reliability of global seismic parameters from automatic pipelines,” arXiv. .","short":"L.A. Bugnet, R.A. Garcia, G.R. Davies, S. Mathur, E. Corsaro, ArXiv (n.d.).","ista":"Bugnet LA, Garcia RA, Davies GR, Mathur S, Corsaro E. FliPer: Checking the reliability of global seismic parameters from automatic pipelines. arXiv, 1711.02890.","chicago":"Bugnet, Lisa Annabelle, R. A. Garcia, G. R. Davies, S. Mathur, and E. Corsaro. “FliPer: Checking the Reliability of Global Seismic Parameters from Automatic Pipelines.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1711.02890.","apa":"Bugnet, L. A., Garcia, R. A., Davies, G. R., Mathur, S., & Corsaro, E. (n.d.). FliPer: Checking the reliability of global seismic parameters from automatic pipelines. arXiv. https://doi.org/10.48550/arXiv.1711.02890","mla":"Bugnet, Lisa Annabelle, et al. “FliPer: Checking the Reliability of Global Seismic Parameters from Automatic Pipelines.” ArXiv, 1711.02890, doi:10.48550/arXiv.1711.02890."},"date_published":"2017-11-08T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"status":"public","extern":"1","language":[{"iso":"eng"}],"publication":"arXiv","date_updated":"2022-08-22T08:45:42Z","_id":"11633","type":"preprint","date_created":"2022-07-21T07:13:13Z","author":[{"last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000","first_name":"Lisa Annabelle"},{"full_name":"Garcia, R. A.","last_name":"Garcia","first_name":"R. A."},{"first_name":"G. R.","last_name":"Davies","full_name":"Davies, G. R."},{"first_name":"S.","last_name":"Mathur","full_name":"Mathur, S."},{"last_name":"Corsaro","full_name":"Corsaro, E.","first_name":"E."}],"doi":"10.48550/arXiv.1711.02890","day":"08","article_processing_charge":"No","title":"FliPer: Checking the reliability of global seismic parameters from automatic pipelines","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1711.02890"}],"publication_status":"submitted","abstract":[{"text":"Our understanding of stars through asteroseismic data analysis is limited by our ability to take advantage of the huge amount of observed stars provided by space missions such as CoRoT, Kepler , K2, and soon TESS and PLATO. Global seismic pipelines provide global stellar parameters such as mass and radius using the mean seismic parameters, as well as the effective temperature. These pipelines are commonly used automatically on thousands of stars observed by K2 for 3 months (and soon TESS for at least ∼ 1 month). However, pipelines are not immune from misidentifying noise peaks and stellar oscillations. Therefore, new validation techniques are required to assess the quality of these results. We present a new metric called FliPer (Flicker in Power), which takes into account the average variability at all measured time scales. The proper calibration of FliPer enables us to obtain good estimations of global stellar parameters such as surface gravity that are robust against the influence of noise peaks and hence are an excellent way to find faults in asteroseismic pipelines.","lang":"eng"}]},{"volume":70,"date_created":"2022-07-25T13:59:21Z","day":"01","author":[{"first_name":"Di","full_name":"Wang, Di","last_name":"Wang"},{"last_name":"Fountoulakis","full_name":"Fountoulakis, Kimon","first_name":"Kimon"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Mahoney, Michael W.","last_name":"Mahoney","first_name":"Michael W."},{"first_name":" Satish","full_name":"Rao , Satish","last_name":"Rao "}],"title":"Capacity releasing diffusion for speed and locality","oa_version":"Published Version","publication_identifier":{"eissn":["2640-3498"]},"publication_status":"published","intvolume":" 70","abstract":[{"lang":"eng","text":"Diffusions and related random walk procedures are of central importance in many areas of machine learning, data analysis, and applied mathematics. Because they spread mass agnostically at each step in an iterative manner, they can sometimes spread mass “too aggressively,” thereby failing to find the “right” clusters. We introduce a novel Capacity Releasing Diffusion (CRD) Process, which is both faster and stays more local than the classical spectral diffusion process. As an application, we use our CRD Process to develop an improved local algorithm for graph clustering. Our local graph clustering method can find local clusters in a model of clustering where one begins the CRD Process in a cluster whose vertices are connected better internally than externally by an O(log2n) factor, where n is the number of nodes in the cluster. Thus, our CRD Process is the first local graph clustering algorithm that is not subject to the well-known quadratic Cheeger barrier. Our result requires a certain smoothness condition, which we expect to be an artifact of our analysis. Our empirical evaluation demonstrates improved results, in particular for realistic social graphs where there are moderately good—but not very good—clusters."}],"arxiv":1,"month":"09","citation":{"chicago":"Wang, Di, Kimon Fountoulakis, Monika H Henzinger, Michael W. Mahoney, and Satish Rao . “Capacity Releasing Diffusion for Speed and Locality.” In Proceedings of the 34th International Conference on Machine Learning, 70:3598–3607. ML Research Press, 2017.","ista":"Wang D, Fountoulakis K, Henzinger MH, Mahoney MW, Rao Satish. 2017. Capacity releasing diffusion for speed and locality. Proceedings of the 34th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 70, 3598–3607.","apa":"Wang, D., Fountoulakis, K., Henzinger, M. H., Mahoney, M. W., & Rao , Satish. (2017). Capacity releasing diffusion for speed and locality. In Proceedings of the 34th International Conference on Machine Learning (Vol. 70, pp. 3598–3607). Sydney, Australia: ML Research Press.","mla":"Wang, Di, et al. “Capacity Releasing Diffusion for Speed and Locality.” Proceedings of the 34th International Conference on Machine Learning, vol. 70, ML Research Press, 2017, pp. 3598–607.","ama":"Wang D, Fountoulakis K, Henzinger MH, Mahoney MW, Rao Satish. Capacity releasing diffusion for speed and locality. In: Proceedings of the 34th International Conference on Machine Learning. Vol 70. ML Research Press; 2017:3598-3607.","ieee":"D. Wang, K. Fountoulakis, M. H. Henzinger, M. W. Mahoney, and Satish Rao , “Capacity releasing diffusion for speed and locality,” in Proceedings of the 34th International Conference on Machine Learning, Sydney, Australia, 2017, vol. 70, pp. 3598–3607.","short":"D. Wang, K. Fountoulakis, M.H. Henzinger, M.W. Mahoney, Satish Rao , in:, Proceedings of the 34th International Conference on Machine Learning, ML Research Press, 2017, pp. 3598–3607."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"_id":"11651","date_updated":"2023-02-09T09:15:31Z","type":"conference","alternative_title":["PMLR"],"article_processing_charge":"No","publisher":"ML Research Press","main_file_link":[{"open_access":"1","url":"http://proceedings.mlr.press/v70/wang17b/wang17b.pdf"}],"quality_controlled":"1","page":"3598-3607","year":"2017","external_id":{"arxiv":["1706.05826"]},"date_published":"2017-09-01T00:00:00Z","conference":{"location":"Sydney, Australia","name":"International Conference on Machine Learning","start_date":"2017-08-06","end_date":"2017-08-11"},"publication":"Proceedings of the 34th International Conference on Machine Learning","status":"public","extern":"1"},{"status":"public","publication":"ACM Transactions on Algorithms","extern":"1","date_published":"2017-10-01T00:00:00Z","acknowledgement":"We thank the reviewers of ICALP 2013 for pointing to related articles and to an error in an example\r\ngiven in a previous version of this article. We also thank one of the reviewers of Transactions on\r\nAlgorithms for very detailed comments.","external_id":{"arxiv":["1512.08147"]},"year":"2017","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1512.08147","open_access":"1"}],"publisher":"Association for Computing Machinery","article_processing_charge":"No","doi":"10.1145/3146550","type":"journal_article","_id":"11665","date_updated":"2022-09-09T11:57:42Z","language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2017). Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3146550","mla":"Henzinger, Monika H., et al. “Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.” ACM Transactions on Algorithms, vol. 13, no. 4, 51, Association for Computing Machinery, 2017, doi:10.1145/3146550.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.” ACM Transactions on Algorithms. Association for Computing Machinery, 2017. https://doi.org/10.1145/3146550.","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2017. Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. ACM Transactions on Algorithms. 13(4), 51.","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks,” ACM Transactions on Algorithms, vol. 13, no. 4. Association for Computing Machinery, 2017.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, ACM Transactions on Algorithms 13 (2017).","ama":"Henzinger MH, Krinninger S, Nanongkai D. Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. ACM Transactions on Algorithms. 2017;13(4). doi:10.1145/3146550"},"issue":"4","month":"10","arxiv":1,"article_number":"51","intvolume":" 13","abstract":[{"text":"We study the problem of maintaining a breadth-first spanning tree (BFS tree) in partially dynamic distributed networks modeling a sequence of either failures or additions of communication links (but not both). We present deterministic (1+ϵ)-approximation algorithms whose amortized time (over some number of link changes) is sublinear in D, the maximum diameter of the network.\r\n\r\nOur technique also leads to a deterministic (1+ϵ)-approximate incremental algorithm for single-source shortest paths in the sequential (usual RAM) model. Prior to our work, the state of the art was the classic exact algorithm of Even and Shiloach (1981), which is optimal under some assumptions (Roditty and Zwick 2011; Henzinger et al. 2015). Our result is the first to show that, in the incremental setting, this bound can be beaten in certain cases if some approximation is allowed.","lang":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1549-6333"],"issn":["1549-6325"]},"oa_version":"Preprint","title":"Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks","scopus_import":"1","day":"01","author":[{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"last_name":"Nanongkai","full_name":"Nanongkai, Danupon","first_name":"Danupon"}],"date_created":"2022-07-27T11:37:23Z","article_type":"original","volume":13},{"_id":"11676","date_updated":"2022-09-12T08:58:16Z","type":"journal_article","article_processing_charge":"No","doi":"10.1007/s00453-015-0066-y","publisher":"Springer Nature","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.05753"}],"quality_controlled":"1","page":"152-172","keyword":["Approximation algorithms","Submodular functions","Phylogenetic diversity","Viability constraints"],"year":"2017","external_id":{"arxiv":["1611.05753"]},"acknowledgement":"The research leading to these results has received funding from the European Research\r\nCouncil under the European Union’s Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement No. 340506.","date_published":"2017-01-01T00:00:00Z","status":"public","extern":"1","publication":"Algorithmica","volume":77,"date_created":"2022-07-27T14:37:24Z","article_type":"original","day":"01","scopus_import":"1","author":[{"full_name":"Dvořák, Wolfgang","last_name":"Dvořák","first_name":"Wolfgang"},{"first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"first_name":"David P.","full_name":"Williamson, David P.","last_name":"Williamson"}],"oa_version":"Preprint","title":"Maximizing a submodular function with viability constraints","publication_status":"published","publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"abstract":[{"lang":"eng","text":"We study the problem of maximizing a monotone submodular function with viability constraints. This problem originates from computational biology, where we are given a phylogenetic tree over a set of species and a directed graph, the so-called food web, encoding viability constraints between these species. These food webs usually have constant depth. The goal is to select a subset of k species that satisfies the viability constraints and has maximal phylogenetic diversity. As this problem is known to be NP-hard, we investigate approximation algorithms. We present the first constant factor approximation algorithm if the depth is constant. Its approximation ratio is (1−1e√). This algorithm not only applies to phylogenetic trees with viability constraints but for arbitrary monotone submodular set functions with viability constraints. Second, we show that there is no (1−1/e+ϵ)-approximation algorithm for our problem setting (even for additive functions) and that there is no approximation algorithm for a slight extension of this setting."}],"intvolume":" 77","month":"01","arxiv":1,"citation":{"ama":"Dvořák W, Henzinger MH, Williamson DP. Maximizing a submodular function with viability constraints. Algorithmica. 2017;77(1):152-172. doi:10.1007/s00453-015-0066-y","ieee":"W. Dvořák, M. H. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” Algorithmica, vol. 77, no. 1. Springer Nature, pp. 152–172, 2017.","short":"W. Dvořák, M.H. Henzinger, D.P. Williamson, Algorithmica 77 (2017) 152–172.","chicago":"Dvořák, Wolfgang, Monika H Henzinger, and David P. Williamson. “Maximizing a Submodular Function with Viability Constraints.” Algorithmica. Springer Nature, 2017. https://doi.org/10.1007/s00453-015-0066-y.","ista":"Dvořák W, Henzinger MH, Williamson DP. 2017. Maximizing a submodular function with viability constraints. Algorithmica. 77(1), 152–172.","apa":"Dvořák, W., Henzinger, M. H., & Williamson, D. P. (2017). Maximizing a submodular function with viability constraints. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-015-0066-y","mla":"Dvořák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.” Algorithmica, vol. 77, no. 1, Springer Nature, 2017, pp. 152–72, doi:10.1007/s00453-015-0066-y."},"issue":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}]},{"department":[{"_id":"CaUh"}],"file":[{"date_created":"2018-12-12T10:16:13Z","file_size":56664,"date_updated":"2020-07-14T12:44:37Z","creator":"system","file_id":"5199","file_name":"IST-2017-739-v1+2_10260_2016_375_MOESM1_ESM.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"0b2d1b647ca96e9ef13a14b8b6775e0f"},{"relation":"main_file","checksum":"3321ef34e02e28acfc427f77cf32812a","file_name":"IST-2017-739-v1+3_s10260-016-0375-6.pdf","content_type":"application/pdf","access_level":"open_access","file_id":"5200","file_size":688953,"date_created":"2018-12-12T10:16:14Z","date_updated":"2020-07-14T12:44:37Z","creator":"system"}],"month":"08","citation":{"short":"E. Perrone, A. Rappold, W. Müller, Statistical Methods and Applications 26 (2017) 403–418.","ieee":"E. Perrone, A. Rappold, and W. Müller, “D inf s optimality in copula models,” Statistical Methods and Applications, vol. 26, no. 3. Springer, pp. 403–418, 2017.","ama":"Perrone E, Rappold A, Müller W. D inf s optimality in copula models. Statistical Methods and Applications. 2017;26(3):403-418. doi:10.1007/s10260-016-0375-6","mla":"Perrone, Elisa, et al. “D Inf s Optimality in Copula Models.” Statistical Methods and Applications, vol. 26, no. 3, Springer, 2017, pp. 403–18, doi:10.1007/s10260-016-0375-6.","apa":"Perrone, E., Rappold, A., & Müller, W. (2017). D inf s optimality in copula models. Statistical Methods and Applications. Springer. https://doi.org/10.1007/s10260-016-0375-6","chicago":"Perrone, Elisa, Andreas Rappold, and Werner Müller. “D Inf s Optimality in Copula Models.” Statistical Methods and Applications. Springer, 2017. https://doi.org/10.1007/s10260-016-0375-6.","ista":"Perrone E, Rappold A, Müller W. 2017. D inf s optimality in copula models. Statistical Methods and Applications. 26(3), 403–418."},"issue":"3","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"language":[{"iso":"eng"}],"pubrep_id":"739","volume":26,"date_created":"2018-12-11T11:50:31Z","scopus_import":"1","day":"01","author":[{"full_name":"Perrone, Elisa","id":"2A5F8724-F248-11E8-B48F-1D18A9856A87","last_name":"Perrone","orcid":"0000-0003-0370-9835","first_name":"Elisa"},{"first_name":"Andreas","last_name":"Rappold","full_name":"Rappold, Andreas"},{"first_name":"Werner","last_name":"Müller","full_name":"Müller, Werner"}],"title":"D inf s optimality in copula models","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:44:37Z","publication_status":"published","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Optimum experimental design theory has recently been extended for parameter estimation in copula models. The use of these models allows one to gain in flexibility by considering the model parameter set split into marginal and dependence parameters. However, this separation also leads to the natural issue of estimating only a subset of all model parameters. In this work, we treat this problem with the application of the (Formula presented.)-optimality to copula models. First, we provide an extension of the corresponding equivalence theory. Then, we analyze a wide range of flexible copula models to highlight the usefulness of (Formula presented.)-optimality in many possible scenarios. Finally, we discuss how the usage of the introduced design criterion also relates to the more general issue of copula selection and optimal design for model discrimination."}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"intvolume":" 26","publist_id":"6189","isi":1,"year":"2017","external_id":{"isi":["000407973200004"]},"acknowledgement":"This work has been supported by the project ANR-2011-IS01-001-01 “DESIRE” and Austrian Science Fund (FWF) I833-N18. Open access funding is provided by the Austrian Science Fund (FWF). ","date_published":"2017-08-01T00:00:00Z","publication":"Statistical Methods and Applications","status":"public","_id":"1168","date_updated":"2023-09-20T11:25:09Z","type":"journal_article","article_processing_charge":"No","doi":"10.1007/s10260-016-0375-6","publisher":"Springer","quality_controlled":"1","page":"403 - 418","ddc":["519"]},{"volume":205,"date_created":"2018-12-11T11:50:31Z","author":[{"orcid":"0000-0002-2519-824X","first_name":"Sebastian","full_name":"Novak, Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87","last_name":"Novak"},{"full_name":"Kollár, Richard","last_name":"Kollár","first_name":"Richard"}],"scopus_import":"1","day":"01","title":"Spatial gene frequency waves under genotype dependent dispersal","oa_version":"Submitted Version","publication_identifier":{"issn":["00166731"]},"publication_status":"published","file_date_updated":"2020-07-14T12:44:37Z","has_accepted_license":"1","intvolume":" 205","abstract":[{"text":"Dispersal is a crucial factor in natural evolution, since it determines the habitat experienced by any population and defines the spatial scale of interactions between individuals. There is compelling evidence for systematic differences in dispersal characteristics within the same population, i.e., genotype-dependent dispersal. The consequences of genotype-dependent dispersal on other evolutionary phenomena, however, are poorly understood. In this article we investigate the effect of genotype-dependent dispersal on spatial gene frequency patterns, using a generalization of the classical diffusion model of selection and dispersal. Dispersal is characterized by the variance of dispersal (diffusion coefficient) and the mean displacement (directional advection term). We demonstrate that genotype-dependent dispersal may change the qualitative behavior of Fisher waves, which change from being “pulled” to being “pushed” wave fronts as the discrepancy in dispersal between genotypes increases. The speed of any wave is partitioned into components due to selection, genotype-dependent variance of dispersal, and genotype-dependent mean displacement. We apply our findings to wave fronts maintained by selection against heterozygotes. Furthermore, we identify a benefit of increased variance of dispersal, quantify its effect on the speed of the wave, and discuss the implications for the evolution of dispersal strategies.","lang":"eng"}],"department":[{"_id":"NiBa"}],"file":[{"file_name":"IST-2016-727-v1+1_SFC_Genetics_final.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"7c8ab79cda1f92760bbbbe0f53175bfc","date_created":"2018-12-12T10:10:43Z","file_size":361500,"date_updated":"2020-07-14T12:44:37Z","creator":"system","file_id":"4833"}],"month":"01","issue":"1","citation":{"chicago":"Novak, Sebastian, and Richard Kollár. “Spatial Gene Frequency Waves under Genotype Dependent Dispersal.” Genetics. Genetics Society of America, 2017. https://doi.org/10.1534/genetics.116.193946.","ista":"Novak S, Kollár R. 2017. Spatial gene frequency waves under genotype dependent dispersal. Genetics. 205(1), 367–374.","mla":"Novak, Sebastian, and Richard Kollár. “Spatial Gene Frequency Waves under Genotype Dependent Dispersal.” Genetics, vol. 205, no. 1, Genetics Society of America, 2017, pp. 367–74, doi:10.1534/genetics.116.193946.","apa":"Novak, S., & Kollár, R. (2017). Spatial gene frequency waves under genotype dependent dispersal. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.116.193946","ama":"Novak S, Kollár R. Spatial gene frequency waves under genotype dependent dispersal. Genetics. 2017;205(1):367-374. doi:10.1534/genetics.116.193946","short":"S. Novak, R. Kollár, Genetics 205 (2017) 367–374.","ieee":"S. Novak and R. Kollár, “Spatial gene frequency waves under genotype dependent dispersal,” Genetics, vol. 205, no. 1. Genetics Society of America, pp. 367–374, 2017."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"pubrep_id":"727","language":[{"iso":"eng"}],"date_updated":"2025-05-28T11:42:46Z","_id":"1169","type":"journal_article","doi":"10.1534/genetics.116.193946","article_processing_charge":"No","publisher":"Genetics Society of America","quality_controlled":"1","page":"367 - 374","ddc":["576"],"publist_id":"6188","isi":1,"year":"2017","external_id":{"isi":["000393677300025"]},"ec_funded":1,"date_published":"2017-01-01T00:00:00Z","project":[{"call_identifier":"FP7","grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425"},{"_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"}],"publication":"Genetics","status":"public"},{"month":"10","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Edelsbrunner, Herbert, Alexey Glazyrin, Oleg Musin, and Anton Nikitenko. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” Combinatorica. Springer, 2017. https://doi.org/10.1007/s00493-016-3308-y.","ista":"Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. 2017. The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. 37(5), 887–910.","apa":"Edelsbrunner, H., Glazyrin, A., Musin, O., & Nikitenko, A. (2017). The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. Springer. https://doi.org/10.1007/s00493-016-3308-y","mla":"Edelsbrunner, Herbert, et al. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” Combinatorica, vol. 37, no. 5, Springer, 2017, pp. 887–910, doi:10.1007/s00493-016-3308-y.","ama":"Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. 2017;37(5):887-910. doi:10.1007/s00493-016-3308-y","ieee":"H. Edelsbrunner, A. Glazyrin, O. Musin, and A. Nikitenko, “The Voronoi functional is maximized by the Delaunay triangulation in the plane,” Combinatorica, vol. 37, no. 5. Springer, pp. 887–910, 2017.","short":"H. Edelsbrunner, A. Glazyrin, O. Musin, A. Nikitenko, Combinatorica 37 (2017) 887–910."},"issue":"5","title":"The Voronoi functional is maximized by the Delaunay triangulation in the plane","oa_version":"Submitted Version","day":"01","scopus_import":"1","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"first_name":"Alexey","full_name":"Glazyrin, Alexey","last_name":"Glazyrin"},{"first_name":"Oleg","last_name":"Musin","full_name":"Musin, Oleg"},{"last_name":"Nikitenko","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","full_name":"Nikitenko, Anton","orcid":"0000-0002-0659-3201","first_name":"Anton"}],"date_created":"2018-12-11T11:50:32Z","volume":37,"intvolume":" 37","abstract":[{"lang":"eng","text":"We introduce the Voronoi functional of a triangulation of a finite set of points in the Euclidean plane and prove that among all geometric triangulations of the point set, the Delaunay triangulation maximizes the functional. This result neither extends to topological triangulations in the plane nor to geometric triangulations in three and higher dimensions."}],"publication_identifier":{"issn":["02099683"]},"publication_status":"published","external_id":{"isi":["000418056000005"]},"year":"2017","isi":1,"publist_id":"6182","status":"public","publication":"Combinatorica","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems","grant_number":"318493","call_identifier":"FP7"}],"acknowledgement":"This research is partially supported by the Russian Government under the Mega Project 11.G34.31.0053, by the Toposys project FP7-ICT-318493-STREP, by ESF under the ACAT Research Network Programme, by RFBR grant 11-01-00735, and by NSF grants DMS-1101688, DMS-1400876.","date_published":"2017-10-01T00:00:00Z","ec_funded":1,"publisher":"Springer","article_processing_charge":"No","doi":"10.1007/s00493-016-3308-y","type":"journal_article","_id":"1173","date_updated":"2023-09-20T11:23:53Z","page":"887 - 910","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1411.6337"}]},{"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"status":"public","date_published":"2017-03-01T00:00:00Z","conference":{"location":"Hannover, Germany","name":"STACS: Symposium on Theoretical Aspects of Computer Science","end_date":"2017-03-11","start_date":"2017-03-08"},"ec_funded":1,"external_id":{"isi":["000521077300057"]},"year":"2017","isi":1,"publist_id":"6180","quality_controlled":"1","main_file_link":[{"url":"http://drops.dagstuhl.de/opus/volltexte/2017/6976","open_access":"1"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPIcs.STACS.2017.57","alternative_title":["LIPIcs"],"article_processing_charge":"No","type":"conference","date_updated":"2023-09-20T11:23:15Z","_id":"1174","language":[{"iso":"eng"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Skórski, Maciej. “Lower Bounds on Key Derivation for Square-Friendly Applications,” Vol. 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.STACS.2017.57.","ista":"Skórski M. 2017. Lower bounds on key derivation for square-friendly applications. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 66, 57.","mla":"Skórski, Maciej. Lower Bounds on Key Derivation for Square-Friendly Applications. Vol. 66, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.STACS.2017.57.","apa":"Skórski, M. (2017). Lower bounds on key derivation for square-friendly applications (Vol. 66). Presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2017.57","ama":"Skórski M. Lower bounds on key derivation for square-friendly applications. In: Vol 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.STACS.2017.57","short":"M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ieee":"M. Skórski, “Lower bounds on key derivation for square-friendly applications,” presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 2017, vol. 66."},"month":"03","article_number":"57","department":[{"_id":"KrPi"}],"intvolume":" 66","abstract":[{"lang":"eng","text":"Security of cryptographic applications is typically defined by security games. The adversary, within certain resources, cannot win with probability much better than 0 (for unpredictability applications, like one-way functions) or much better than 1/2 (indistinguishability applications for instance encryption schemes). In so called squared-friendly applications the winning probability of the adversary, for different values of the application secret randomness, is not only close to 0 or 1/2 on average, but also concentrated in the sense that its second central moment is small. The class of squared-friendly applications, which contains all unpredictability applications and many indistinguishability applications, is particularly important for key derivation. Barak et al. observed that for square-friendly applications one can beat the "RT-bound", extracting secure keys with significantly smaller entropy loss. In turn Dodis and Yu showed that in squared-friendly applications one can directly use a "weak" key, which has only high entropy, as a secure key. In this paper we give sharp lower bounds on square security assuming security for "weak" keys. We show that any application which is either (a) secure with weak keys or (b) allows for entropy savings for keys derived by universal hashing, must be square-friendly. Quantitatively, our lower bounds match the positive results of Dodis and Yu and Barak et al. (TCC\\'13, CRYPTO\\'11) Hence, they can be understood as a general characterization of squared-friendly applications. While the positive results on squared-friendly applications where derived by one clever application of the Cauchy-Schwarz Inequality, for tight lower bounds we need more machinery. In our approach we use convex optimization techniques and some theory of circular matrices."}],"publication_identifier":{"issn":["18688969"]},"publication_status":"published","oa_version":"Submitted Version","title":"Lower bounds on key derivation for square-friendly applications","author":[{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej","last_name":"Skórski","first_name":"Maciej"}],"scopus_import":"1","day":"01","date_created":"2018-12-11T11:50:32Z","volume":66},{"year":"2017","publist_id":"6179","status":"public","conference":{"name":"ITCS: Innovations in Theoretical Computer Science","start_date":"2017-01-09","end_date":"2017-01-11","location":"Berkeley, CA, United States"},"date_published":"2017-01-01T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","editor":[{"last_name":"Papadimitriou","full_name":"Papadimitriou, Christos","first_name":"Christos"}],"alternative_title":["LIPIcs"],"doi":"10.4230/LIPIcs.ITCS.2017.38","type":"conference","_id":"1175","date_updated":"2021-01-12T06:48:51Z","ddc":["005","600"],"page":"38:1-38-21","quality_controlled":"1","month":"01","file":[{"file_id":"5263","date_updated":"2020-07-14T12:44:37Z","creator":"system","date_created":"2018-12-12T10:17:11Z","file_size":557769,"checksum":"dbc94810be07c2fb1945d5c2a6130e6c","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"IST-2018-927-v1+1_LIPIcs-ITCS-2017-38.pdf"}],"department":[{"_id":"KrPi"}],"pubrep_id":"927","language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. Cumulative space in black-white pebbling and resolution. In: Papadimitriou C, ed. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:38:1-38-21. doi:10.4230/LIPIcs.ITCS.2017.38","short":"J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.","ieee":"J. F. Alwen, S. De Rezende, J. Nordstrom, and M. Vinyals, “Cumulative space in black-white pebbling and resolution,” presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States, 2017, vol. 67, p. 38:1-38-21.","ista":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67, 38:1-38-21.","chicago":"Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.” edited by Christos Papadimitriou, 67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.ITCS.2017.38.","mla":"Alwen, Joel F., et al. Cumulative Space in Black-White Pebbling and Resolution. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:10.4230/LIPIcs.ITCS.2017.38.","apa":"Alwen, J. F., De Rezende, S., Nordstrom, J., & Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2017.38"},"title":"Cumulative space in black-white pebbling and resolution","oa_version":"Published Version","scopus_import":1,"day":"01","author":[{"first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","last_name":"Alwen"},{"first_name":"Susanna","last_name":"De Rezende","full_name":"De Rezende, Susanna"},{"full_name":"Nordstrom, Jakob","last_name":"Nordstrom","first_name":"Jakob"},{"last_name":"Vinyals","full_name":"Vinyals, Marc","first_name":"Marc"}],"date_created":"2018-12-11T11:50:33Z","volume":67,"intvolume":" 67","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"lang":"eng","text":"We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation. Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko ’15] as a tool for obtaining results in cryptography. We consider instead the non- deterministic black-white pebble game and prove optimal cumulative space lower bounds and trade-offs, where in order to minimize pebbling time the space has to remain large during a significant fraction of the pebbling. We also initiate the study of cumulative space in proof complexity, an area where other space complexity measures have been extensively studied during the last 10–15 years. Using and extending the connection between proof complexity and pebble games in [Ben-Sasson and Nordström ’08, ’11] we obtain several strong cumulative space results for (even parallel versions of) the resolution proof system, and outline some possible future directions of study of this, in our opinion, natural and interesting space measure."}],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:44:37Z","publication_identifier":{"issn":["18688969"]},"publication_status":"published"},{"department":[{"_id":"KrPi"}],"article_number":"7961977","month":"07","citation":{"ieee":"J. F. Alwen and J. Blocki, “Towards practical attacks on Argon2i and balloon hashing,” presented at the EuroS&P: European Symposium on Security and Privacy, Paris, France, 2017.","short":"J.F. Alwen, J. Blocki, in:, IEEE, 2017.","ama":"Alwen JF, Blocki J. Towards practical attacks on Argon2i and balloon hashing. In: IEEE; 2017. doi:10.1109/EuroSP.2017.47","apa":"Alwen, J. F., & Blocki, J. (2017). Towards practical attacks on Argon2i and balloon hashing. Presented at the EuroS&P: European Symposium on Security and Privacy, Paris, France: IEEE. https://doi.org/10.1109/EuroSP.2017.47","mla":"Alwen, Joel F., and Jeremiah Blocki. Towards Practical Attacks on Argon2i and Balloon Hashing. 7961977, IEEE, 2017, doi:10.1109/EuroSP.2017.47.","chicago":"Alwen, Joel F, and Jeremiah Blocki. “Towards Practical Attacks on Argon2i and Balloon Hashing.” IEEE, 2017. https://doi.org/10.1109/EuroSP.2017.47.","ista":"Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon hashing. EuroS&P: European Symposium on Security and Privacy, 7961977."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:50:33Z","day":"03","scopus_import":"1","author":[{"full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F"},{"first_name":"Jeremiah","last_name":"Blocki","full_name":"Blocki, Jeremiah"}],"title":"Towards practical attacks on Argon2i and balloon hashing","oa_version":"Submitted Version","publication_identifier":{"isbn":["978-150905761-0"]},"publication_status":"published","abstract":[{"lang":"eng","text":"The algorithm Argon2i-B of Biryukov, Dinu and Khovratovich is currently being considered by the IRTF (Internet Research Task Force) as a new de-facto standard for password hashing. An older version (Argon2i-A) of the same algorithm was chosen as the winner of the recent Password Hashing Competition. An important competitor to Argon2i-B is the recently introduced Balloon Hashing (BH) algorithm of Corrigan-Gibs, Boneh and Schechter. A key security desiderata for any such algorithm is that evaluating it (even using a custom device) requires a large amount of memory amortized across multiple instances. Alwen and Blocki (CRYPTO 2016) introduced a class of theoretical attacks against Argon2i-A and BH. While these attacks yield large asymptotic reductions in the amount of memory, it was not, a priori, clear if (1) they can be extended to the newer Argon2i-B, (2) the attacks are effective on any algorithm for practical parameter ranges (e.g., 1GB of memory) and (3) if they can be effectively instantiated against any algorithm under realistic hardware constrains. In this work we answer all three of these questions in the affirmative for all three algorithms. This is also the first work to analyze the security of Argon2i-B. In more detail, we extend the theoretical attacks of Alwen and Blocki (CRYPTO 2016) to the recent Argon2i-B proposal demonstrating severe asymptotic deficiencies in its security. Next we introduce several novel heuristics for improving the attack's concrete memory efficiency even when on-chip memory bandwidth is bounded. We then simulate our attacks on randomly sampled Argon2i-A, Argon2i-B and BH instances and measure the resulting memory consumption for various practical parameter ranges and for a variety of upperbounds on the amount of parallelism available to the attacker. Finally we describe, implement, and test a new heuristic for applying the Alwen-Blocki attack to functions employing a technique developed by Corrigan-Gibs et al. for improving concrete security of memory-hard functions. We analyze the collected data and show the effects various parameters have on the memory consumption of the attack. In particular, we can draw several interesting conclusions about the level of security provided by these functions. · For the Alwen-Blocki attack to fail against practical memory parameters, Argon2i-B must be instantiated with more than 10 passes on memory - beyond the \"paranoid\" parameter setting in the current IRTF proposal. · The technique of Corrigan-Gibs for improving security can also be overcome by the Alwen-Blocki attack under realistic hardware constraints. · On a positive note, both the asymptotic and concrete security of Argon2i-B seem to improve on that of Argon2i-A."}],"publist_id":"6178","isi":1,"year":"2017","external_id":{"isi":["000424197300011"]},"date_published":"2017-07-03T00:00:00Z","conference":{"location":"Paris, France","name":"EuroS&P: European Symposium on Security and Privacy","start_date":"2017-04-26","end_date":"2017-04-28"},"status":"public","_id":"1176","date_updated":"2023-09-20T11:22:25Z","type":"conference","article_processing_charge":"No","doi":"10.1109/EuroSP.2017.47","publisher":"IEEE","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/759"}],"quality_controlled":"1"},{"month":"12","year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Krems, Austria","name":"SOFSEM: Theory and Practice of Computer Science","end_date":"2018-02-02","start_date":"2018-01-29"},"date_published":"2017-12-22T00:00:00Z","citation":{"ama":"Henzinger MH. The state of the art in dynamic graph algorithms. In: 44th International Conference on Current Trends in Theory and Practice of Computer Science. Vol 10706. Springer Nature; 2017:40–44. doi:10.1007/978-3-319-73117-9_3","ieee":"M. H. Henzinger, “The state of the art in dynamic graph algorithms,” in 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, 2017, vol. 10706, pp. 40–44.","short":"M.H. Henzinger, in:, 44th International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2017, pp. 40–44.","ista":"Henzinger MH. 2017. The state of the art in dynamic graph algorithms. 44th International Conference on Current Trends in Theory and Practice of Computer Science. SOFSEM: Theory and Practice of Computer Science, LNCS, vol. 10706, 40–44.","chicago":"Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” In 44th International Conference on Current Trends in Theory and Practice of Computer Science, 10706:40–44. Springer Nature, 2017. https://doi.org/10.1007/978-3-319-73117-9_3.","apa":"Henzinger, M. H. (2017). The state of the art in dynamic graph algorithms. In 44th International Conference on Current Trends in Theory and Practice of Computer Science (Vol. 10706, pp. 40–44). Krems, Austria: Springer Nature. https://doi.org/10.1007/978-3-319-73117-9_3","mla":"Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” 44th International Conference on Current Trends in Theory and Practice of Computer Science, vol. 10706, Springer Nature, 2017, pp. 40–44, doi:10.1007/978-3-319-73117-9_3."},"status":"public","extern":"1","language":[{"iso":"eng"}],"publication":"44th International Conference on Current Trends in Theory and Practice of Computer Science","date_created":"2022-08-08T13:16:37Z","type":"conference","_id":"11772","volume":10706,"date_updated":"2023-02-10T08:36:03Z","publisher":"Springer Nature","oa_version":"None","title":"The state of the art in dynamic graph algorithms","alternative_title":["LNCS"],"scopus_import":"1","article_processing_charge":"No","day":"22","author":[{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H"}],"doi":"10.1007/978-3-319-73117-9_3","publication_status":"published","quality_controlled":"1","publication_identifier":{"isbn":["9783319731162"],"issn":["0302-9743"],"eisbn":["9783319731179"]},"intvolume":" 10706","abstract":[{"text":"A dynamic graph algorithm is a data structure that supports operations on dynamically changing graphs.","lang":"eng"}],"page":"40–44"},{"intvolume":" 9985","abstract":[{"text":"For any pair (X, Z) of correlated random variables we can think of Z as a randomized function of X. If the domain of Z is small, one can make this function computationally efficient by allowing it to be only approximately correct. In folklore this problem is known as simulating auxiliary inputs. This idea of simulating auxiliary information turns out to be a very usefull tool, finding applications in complexity theory, cryptography, pseudorandomness and zero-knowledge. In this paper we revisit this problem, achieving the following results: (a) We present a novel boosting algorithm for constructing the simulator. This boosting proof is of independent interest, as it shows how to handle “negative mass” issues when constructing probability measures by shifting distinguishers in descent algorithms. Our technique essentially fixes the flaw in the TCC’14 paper “How to Fake Auxiliary Inputs”. (b) The complexity of our simulator is better than in previous works, including results derived from the uniform min-max theorem due to Vadhan and Zheng. To achieve (s,ϵ) -indistinguishability we need the complexity O(s⋅25ℓϵ−2) in time/circuit size, which improve previous bounds by a factor of ϵ−2. In particular, with we get meaningful provable security for the EUROCRYPT’09 leakage-resilient stream cipher instantiated with a standard 256-bit block cipher, like ","lang":"eng"}],"publication_status":"published","title":"Simulating auxiliary inputs, revisited","oa_version":"Submitted Version","author":[{"first_name":"Maciej","full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski"}],"day":"01","date_created":"2018-12-11T11:50:34Z","volume":9985,"language":[{"iso":"eng"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"M. Skórski, “Simulating auxiliary inputs, revisited,” presented at the TCC: Theory of Cryptography Conference, 2017, vol. 9985, pp. 159–179.","short":"M. Skórski, in:, Springer, 2017, pp. 159–179.","ama":"Skórski M. Simulating auxiliary inputs, revisited. In: Vol 9985. Springer; 2017:159-179. doi:10.1007/978-3-662-53641-4_7","apa":"Skórski, M. (2017). Simulating auxiliary inputs, revisited (Vol. 9985, pp. 159–179). Presented at the TCC: Theory of Cryptography Conference, Springer. https://doi.org/10.1007/978-3-662-53641-4_7","mla":"Skórski, Maciej. Simulating Auxiliary Inputs, Revisited. Vol. 9985, Springer, 2017, pp. 159–79, doi:10.1007/978-3-662-53641-4_7.","ista":"Skórski M. 2017. Simulating auxiliary inputs, revisited. TCC: Theory of Cryptography Conference, LNCS, vol. 9985, 159–179.","chicago":"Skórski, Maciej. “Simulating Auxiliary Inputs, Revisited,” 9985:159–79. Springer, 2017. https://doi.org/10.1007/978-3-662-53641-4_7."},"month":"01","page":"159 - 179","quality_controlled":"1","main_file_link":[{"url":"https://eprint.iacr.org/2016/808.pdf ","open_access":"1"}],"publisher":"Springer","doi":"10.1007/978-3-662-53641-4_7","article_processing_charge":"No","alternative_title":["LNCS"],"type":"conference","date_updated":"2023-09-20T11:21:57Z","_id":"1178","extern":"1","status":"public","date_published":"2017-01-01T00:00:00Z","acknowledgement":"This work was supported by the National Science Center, Poland (2015/17/N/ST6/03564).","conference":{"name":"TCC: Theory of Cryptography Conference"},"external_id":{"isi":["000390176000007"]},"year":"2017","isi":1,"publist_id":"6176"},{"publist_id":"6869","month":"01","year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Dan Alistarh was supported by a Swiss National Science\r\nFoundation Ambizione Fellowship. James Aspnes was supported by the National Science Foundation under grants\r\nCCF-1637385 and CCF-1650596. Rati Gelashvili was supported by the National Science Foundation under grants\r\nCCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and\r\nOracle and Intel corporations.\r\nThe authors would like to thank David Doty, David\r\nSoloveichik, and Milan Vojnovic for insightful discussions\r\nand feedback during the development of this work.","conference":{"name":"SODA: Symposium on Discrete Algorithms"},"date_published":"2017-01-01T00:00:00Z","citation":{"mla":"Alistarh, Dan-Adrian, et al. Time-Space Trade-Offs in Population Protocols. SIAM, 2017, pp. 2560–79, doi:doi.org/10.1137/1.9781611974782.169.","apa":"Alistarh, D.-A., Aspnes, J., Eisenstat, D., Rivest, R., & Gelashvili, R. (2017). Time-space trade-offs in population protocols (pp. 2560–2579). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/doi.org/10.1137/1.9781611974782.169","chicago":"Alistarh, Dan-Adrian, James Aspnes, David Eisenstat, Ronald Rivest, and Rati Gelashvili. “Time-Space Trade-Offs in Population Protocols,” 2560–79. SIAM, 2017. https://doi.org/doi.org/10.1137/1.9781611974782.169.","ista":"Alistarh D-A, Aspnes J, Eisenstat D, Rivest R, Gelashvili R. 2017. Time-space trade-offs in population protocols. SODA: Symposium on Discrete Algorithms, 2560–2579.","short":"D.-A. Alistarh, J. Aspnes, D. Eisenstat, R. Rivest, R. Gelashvili, in:, SIAM, 2017, pp. 2560–2579.","ieee":"D.-A. Alistarh, J. Aspnes, D. Eisenstat, R. Rivest, and R. Gelashvili, “Time-space trade-offs in population protocols,” presented at the SODA: Symposium on Discrete Algorithms, 2017, pp. 2560–2579.","ama":"Alistarh D-A, Aspnes J, Eisenstat D, Rivest R, Gelashvili R. Time-space trade-offs in population protocols. In: SIAM; 2017:2560-2579. doi:doi.org/10.1137/1.9781611974782.169"},"extern":"1","status":"public","language":[{"iso":"eng"}],"oa":1,"date_created":"2018-12-11T11:48:30Z","type":"conference","_id":"787","date_updated":"2023-02-23T13:19:13Z","oa_version":"None","title":"Time-space trade-offs in population protocols","publisher":"SIAM","day":"01","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"},{"first_name":"James","last_name":"Aspnes","full_name":"Aspnes, James"},{"last_name":"Eisenstat","full_name":"Eisenstat, David","first_name":"David"},{"last_name":"Rivest","full_name":"Rivest, Ronald","first_name":"Ronald"},{"first_name":"Rati","full_name":"Gelashvili, Rati","last_name":"Gelashvili"}],"doi":"doi.org/10.1137/1.9781611974782.169","publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/1602.08032","open_access":"1"}],"abstract":[{"text":"Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental tasks in the population model, such as leader election (which requires convergence to a single agent in a special "leader" state), and majority (in which agents must converge to a decision as to which of two possible initial states had higher initial count). Known results point towards an inherent trade-off between the time complexity of such algorithms, and the space complexity, i.e. size of the memory available to each agent. In this paper, we explore this trade-off and provide new upper and lower bounds for majority and leader election. First, we prove a unified lower bound, which relates the space available per node with the time complexity achievable by a protocol: for instance, our result implies that any protocol solving either of these tasks for n agents using O(log log n) states must take (n=polylogn) expected time. This is the first result to characterize time complexity for protocols which employ super-constant number of states per node, and proves that fast, poly-logarithmic running times require protocols to have relatively large space costs. On the positive side, we give algorithms showing that fast, poly-logarithmic convergence time can be achieved using O(log2 n) space per node, in the case of both tasks. Overall, our results highlight a time complexity separation between O(log log n) and (log2 n) state space size for both majority and leader election in population protocols, and introduce new techniques, which should be applicable more broadly.","lang":"eng"}],"page":"2560 - 2579"},{"title":"Robust detection in leak-prone population protocols","oa_version":"None","scopus_import":"1","day":"01","author":[{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Bartłomiej","full_name":"Dudek, Bartłomiej","last_name":"Dudek"},{"first_name":"Adrian","last_name":"Kosowski","full_name":"Kosowski, Adrian"},{"last_name":"Soloveichik","full_name":"Soloveichik, David","first_name":"David"},{"first_name":"Przemysław","full_name":"Uznański, Przemysław","last_name":"Uznański"}],"date_created":"2018-12-11T11:48:30Z","volume":"10467 LNCS","abstract":[{"text":"In contrast to electronic computation, chemical computation is noisy and susceptible to a variety of sources of error, which has prevented the construction of robust complex systems. To be effective, chemical algorithms must be designed with an appropriate error model in mind. Here we consider the model of chemical reaction networks that preserve molecular count (population protocols), and ask whether computation can be made robust to a natural model of unintended “leak” reactions. Our definition of leak is motivated by both the particular spurious behavior seen when implementing chemical reaction networks with DNA strand displacement cascades, as well as the unavoidable side reactions in any implementation due to the basic laws of chemistry. We develop a new “Robust Detection” algorithm for the problem of fast (logarithmic time) single molecule detection, and prove that it is robust to this general model of leaks. Besides potential applications in single molecule detection, the error-correction ideas developed here might enable a new class of robust-by-design chemical algorithms. Our analysis is based on a non-standard hybrid argument, combining ideas from discrete analysis of population protocols with classic Markov chain techniques.","lang":"eng"}],"publication_status":"published","arxiv":1,"month":"01","language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Alistarh, D.-A., Dudek, B., Kosowski, A., Soloveichik, D., & Uznański, P. (2017). Robust detection in leak-prone population protocols (Vol. 10467 LNCS, pp. 155–171). Presented at the DNA Computing and Molecular Programming, Springer. https://doi.org/10.1007/978-3-319-66799-7_11","mla":"Alistarh, Dan-Adrian, et al. Robust Detection in Leak-Prone Population Protocols. Vol. 10467 LNCS, Springer, 2017, pp. 155–71, doi:10.1007/978-3-319-66799-7_11.","chicago":"Alistarh, Dan-Adrian, Bartłomiej Dudek, Adrian Kosowski, David Soloveichik, and Przemysław Uznański. “Robust Detection in Leak-Prone Population Protocols,” 10467 LNCS:155–71. Springer, 2017. https://doi.org/10.1007/978-3-319-66799-7_11.","ista":"Alistarh D-A, Dudek B, Kosowski A, Soloveichik D, Uznański P. 2017. Robust detection in leak-prone population protocols. DNA Computing and Molecular Programming, LNCS, vol. 10467 LNCS, 155–171.","ieee":"D.-A. Alistarh, B. Dudek, A. Kosowski, D. Soloveichik, and P. Uznański, “Robust detection in leak-prone population protocols,” presented at the DNA Computing and Molecular Programming, 2017, vol. 10467 LNCS, pp. 155–171.","short":"D.-A. Alistarh, B. Dudek, A. Kosowski, D. Soloveichik, P. Uznański, in:, Springer, 2017, pp. 155–171.","ama":"Alistarh D-A, Dudek B, Kosowski A, Soloveichik D, Uznański P. Robust detection in leak-prone population protocols. In: Vol 10467 LNCS. Springer; 2017:155-171. doi:10.1007/978-3-319-66799-7_11"},"publisher":"Springer","alternative_title":["LNCS"],"article_processing_charge":"No","doi":"10.1007/978-3-319-66799-7_11","type":"conference","_id":"788","date_updated":"2022-03-18T12:48:02Z","page":"155 - 171","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1706.09937","open_access":"1"}],"external_id":{"arxiv":["1706.09937"]},"year":"2017","publist_id":"6868","extern":"1","status":"public","date_published":"2017-01-01T00:00:00Z","acknowledgement":"D. Alistarh - Supported by an SNF Ambizione Fellowship. A. Kosowski — Supported by Inria project GANG, ANR project DESCARTES, and\r\nNCN grant 2015/17/B/ST6/01897. D. Soloveichik — Supported by NSF grants CCF-1618895 and CCF-1652824.\r\n\r\n","conference":{"name":"DNA Computing and Molecular Programming"}},{"abstract":[{"lang":"eng","text":"The problem of efficient concurrent memory reclamation in unmanaged languages such as C or C++ is one of the major challenges facing the parallelization of billions of lines of legacy code. Garbage collectors for C/C++ can be inefficient; thus, programmers are often forced to use finely-crafted concurrent memory reclamation techniques. These techniques can provide good performance, but require considerable programming effort to deploy, and have strict requirements, allowing the programmer very little room for error. In this work, we present Forkscan, a new conservative concurrent memory reclamation scheme which is fully automatic and surprisingly scalable. Forkscan's semantics place it between automatic garbage collectors (it requires the programmer to explicitly retire nodes before they can be reclaimed), and concurrent memory reclamation techniques (as it does not assume that nodes are completely unlinked from the data structure for correctness). Forkscan's implementation exploits these new semantics for efficiency: we leverage parallelism and optimized implementations of signaling and copy-on-write in modern operating systems to efficiently obtain and process consistent snapshots of memory that can be scanned concurrently with the normal program operation. Empirical evaluation on a range of classical concurrent data structure microbenchmarks shows that Forkscan can preserve the scalability of the original code, while maintaining an order of magnitude lower latency than automatic garbage collection, and demonstrating competitive performance with finely crafted memory reclamation techniques."}],"page":"483 - 498","publication_status":"published","title":"Forkscan: Conservative memory reclamation for modern operating systems","publisher":"ACM","oa_version":"None","author":[{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Leiserson","full_name":"Leiserson, William","first_name":"William"},{"full_name":"Matveev, Alexander","last_name":"Matveev","first_name":"Alexander"},{"first_name":"Nir","last_name":"Shavit","full_name":"Shavit, Nir"}],"doi":"10.1145/3064176.3064214","day":"01","article_processing_charge":"No","type":"conference","date_created":"2018-12-11T11:48:30Z","date_updated":"2023-02-23T13:19:44Z","_id":"789","extern":"1","language":[{"iso":"eng"}],"status":"public","acknowledgement":"William Leiserson, Alexander Matveev, and Nir Shavit were supported by the NSF under grants IIS-1447786 and CCF-1563880, and Dan Alistarh was supported by a Swiss National Fund Ambizione Fellowship.","conference":{"name":"EuroSys: European Conference on Computer Systems"},"date_published":"2017-01-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. Forkscan: Conservative memory reclamation for modern operating systems. In: ACM; 2017:483-498. doi:10.1145/3064176.3064214","ieee":"D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “Forkscan: Conservative memory reclamation for modern operating systems,” presented at the EuroSys: European Conference on Computer Systems, 2017, pp. 483–498.","short":"D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, in:, ACM, 2017, pp. 483–498.","chicago":"Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit. “Forkscan: Conservative Memory Reclamation for Modern Operating Systems,” 483–98. ACM, 2017. https://doi.org/10.1145/3064176.3064214.","ista":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. 2017. Forkscan: Conservative memory reclamation for modern operating systems. EuroSys: European Conference on Computer Systems, 483–498.","apa":"Alistarh, D.-A., Leiserson, W., Matveev, A., & Shavit, N. (2017). Forkscan: Conservative memory reclamation for modern operating systems (pp. 483–498). Presented at the EuroSys: European Conference on Computer Systems, ACM. https://doi.org/10.1145/3064176.3064214","mla":"Alistarh, Dan-Adrian, et al. Forkscan: Conservative Memory Reclamation for Modern Operating Systems. ACM, 2017, pp. 483–98, doi:10.1145/3064176.3064214."},"month":"01","year":"2017","publist_id":"6867"},{"publist_id":"6865","month":"06","year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"FCCM: Field-Programmable Custom Computing Machines"},"date_published":"2017-06-30T00:00:00Z","citation":{"short":"K. Kara, D.-A. Alistarh, G. Alonso, O. Mutlu, C. Zhang, in:, IEEE, 2017, pp. 160–167.","ieee":"K. Kara, D.-A. Alistarh, G. Alonso, O. Mutlu, and C. Zhang, “FPGA-accelerated dense linear machine learning: A precision-convergence trade-off,” presented at the FCCM: Field-Programmable Custom Computing Machines, 2017, pp. 160–167.","ama":"Kara K, Alistarh D-A, Alonso G, Mutlu O, Zhang C. FPGA-accelerated dense linear machine learning: A precision-convergence trade-off. In: IEEE; 2017:160-167. doi:10.1109/FCCM.2017.39","mla":"Kara, Kaan, et al. FPGA-Accelerated Dense Linear Machine Learning: A Precision-Convergence Trade-Off. IEEE, 2017, pp. 160–67, doi:10.1109/FCCM.2017.39.","apa":"Kara, K., Alistarh, D.-A., Alonso, G., Mutlu, O., & Zhang, C. (2017). FPGA-accelerated dense linear machine learning: A precision-convergence trade-off (pp. 160–167). Presented at the FCCM: Field-Programmable Custom Computing Machines, IEEE. https://doi.org/10.1109/FCCM.2017.39","ista":"Kara K, Alistarh D-A, Alonso G, Mutlu O, Zhang C. 2017. FPGA-accelerated dense linear machine learning: A precision-convergence trade-off. FCCM: Field-Programmable Custom Computing Machines, 160–167.","chicago":"Kara, Kaan, Dan-Adrian Alistarh, Gustavo Alonso, Onur Mutlu, and Ce Zhang. “FPGA-Accelerated Dense Linear Machine Learning: A Precision-Convergence Trade-Off,” 160–67. IEEE, 2017. https://doi.org/10.1109/FCCM.2017.39."},"extern":"1","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T11:48:31Z","type":"conference","_id":"790","date_updated":"2023-02-23T13:19:52Z","publisher":"IEEE","oa_version":"None","title":"FPGA-accelerated dense linear machine learning: A precision-convergence trade-off","article_processing_charge":"No","day":"30","author":[{"last_name":"Kara","full_name":"Kara, Kaan","first_name":"Kaan"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"},{"first_name":"Gustavo","full_name":"Alonso, Gustavo","last_name":"Alonso"},{"first_name":"Onur","last_name":"Mutlu","full_name":"Mutlu, Onur"},{"first_name":"Ce","full_name":"Zhang, Ce","last_name":"Zhang"}],"doi":"10.1109/FCCM.2017.39","publication_status":"published","abstract":[{"text":"Stochastic gradient descent (SGD) is a commonly used algorithm for training linear machine learning models. Based on vector algebra, it benefits from the inherent parallelism available in an FPGA. In this paper, we first present a single-precision floating-point SGD implementation on an FPGA that provides similar performance as a 10-core CPU. We then adapt the design to make it capable of processing low-precision data. The low-precision data is obtained from a novel compression scheme - called stochastic quantization, specifically designed for machine learning applications. We test both full-precision and low-precision designs on various regression and classification data sets. We achieve up to an order of magnitude training speedup when using low-precision data compared to a full-precision SGD on the same FPGA and a state-of-the-art multi-core solution, while maintaining the quality of training. We open source the designs presented in this paper.","lang":"eng"}],"page":"160 - 167"},{"date_created":"2018-12-11T11:48:31Z","volume":"Part F129314","oa_version":"Submitted Version","title":"The power of choice in priority scheduling","day":"26","scopus_import":"1","author":[{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"},{"last_name":"Kopinsky","full_name":"Kopinsky, Justin","first_name":"Justin"},{"full_name":"Li, Jerry","last_name":"Li","first_name":"Jerry"},{"first_name":"Giorgi","orcid":"0000-0001-5634-0731","last_name":"Nadiradze","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","full_name":"Nadiradze, Giorgi"}],"publication_identifier":{"isbn":["978-145034992-5"]},"publication_status":"published","abstract":[{"lang":"eng","text":"Consider the following random process: we are given n queues, into which elements of increasing labels are inserted uniformly at random. To remove an element, we pick two queues at random, and remove the element of lower label (higher priority) among the two. The cost of a removal is the rank of the label removed, among labels still present in any of the queues, that is, the distance from the optimal choice at each step. Variants of this strategy are prevalent in state-of-the-art concurrent priority queue implementations. Nonetheless, it is not known whether such implementations provide any rank guarantees, even in a sequential model. We answer this question, showing that this strategy provides surprisingly strong guarantees: Although the single-choice process, where we always insert and remove from a single randomly chosen queue, has degrading cost, going to infinity as we increase the number of steps, in the two choice process, the expected rank of a removed element is O(n) while the expected worst-case cost is O(n log n). These bounds are tight, and hold irrespective of the number of steps for which we run the process. The argument is based on a new technical connection between "heavily loaded" balls-into-bins processes and priority scheduling. Our analytic results inspire a new concurrent priority queue implementation, which improves upon the state of the art in terms of practical performance."}],"department":[{"_id":"DaAl"}],"month":"07","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Alistarh D-A, Kopinsky J, Li J, Nadiradze G. 2017. The power of choice in priority scheduling. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing vol. Part F129314, 283–292.","chicago":"Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Giorgi Nadiradze. “The Power of Choice in Priority Scheduling.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, Part F129314:283–92. ACM, 2017. https://doi.org/10.1145/3087801.3087810.","mla":"Alistarh, Dan-Adrian, et al. “The Power of Choice in Priority Scheduling.” Proceedings of the ACM Symposium on Principles of Distributed Computing, vol. Part F129314, ACM, 2017, pp. 283–92, doi:10.1145/3087801.3087810.","apa":"Alistarh, D.-A., Kopinsky, J., Li, J., & Nadiradze, G. (2017). The power of choice in priority scheduling. In Proceedings of the ACM Symposium on Principles of Distributed Computing (Vol. Part F129314, pp. 283–292). Washington, WA, USA: ACM. https://doi.org/10.1145/3087801.3087810","ama":"Alistarh D-A, Kopinsky J, Li J, Nadiradze G. The power of choice in priority scheduling. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Vol Part F129314. ACM; 2017:283-292. doi:10.1145/3087801.3087810","short":"D.-A. Alistarh, J. Kopinsky, J. Li, G. Nadiradze, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, 2017, pp. 283–292.","ieee":"D.-A. Alistarh, J. Kopinsky, J. Li, and G. Nadiradze, “The power of choice in priority scheduling,” in Proceedings of the ACM Symposium on Principles of Distributed Computing, Washington, WA, USA, 2017, vol. Part F129314, pp. 283–292."},"language":[{"iso":"eng"}],"oa":1,"type":"conference","_id":"791","date_updated":"2023-09-27T12:17:59Z","publisher":"ACM","article_processing_charge":"No","doi":"10.1145/3087801.3087810","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1706.04178","open_access":"1"}],"page":"283 - 292","publist_id":"6864","external_id":{"isi":["000462995000035"]},"isi":1,"year":"2017","date_published":"2017-07-26T00:00:00Z","conference":{"name":"PODC: Principles of Distributed Computing","start_date":"2017-07-25","end_date":"2017-07-27","location":"Washington, WA, USA"},"status":"public","publication":"Proceedings of the ACM Symposium on Principles of Distributed Computing"},{"citation":{"mla":"Budanur, Nazmi B., et al. “Relative Periodic Orbits Form the Backbone of Turbulent Pipe Flow.” Journal of Fluid Mechanics, vol. 833, Cambridge University Press, 2017, pp. 274–301, doi:10.1017/jfm.2017.699.","apa":"Budanur, N. B., Short, K., Farazmand, M., Willis, A., & Cvitanović, P. (2017). Relative periodic orbits form the backbone of turbulent pipe flow. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2017.699","chicago":"Budanur, Nazmi B, Kimberly Short, Mohammad Farazmand, Ashley Willis, and Predrag Cvitanović. “Relative Periodic Orbits Form the Backbone of Turbulent Pipe Flow.” Journal of Fluid Mechanics. Cambridge University Press, 2017. https://doi.org/10.1017/jfm.2017.699.","ista":"Budanur NB, Short K, Farazmand M, Willis A, Cvitanović P. 2017. Relative periodic orbits form the backbone of turbulent pipe flow. Journal of Fluid Mechanics. 833, 274–301.","short":"N.B. Budanur, K. Short, M. Farazmand, A. Willis, P. Cvitanović, Journal of Fluid Mechanics 833 (2017) 274–301.","ieee":"N. B. Budanur, K. Short, M. Farazmand, A. Willis, and P. Cvitanović, “Relative periodic orbits form the backbone of turbulent pipe flow,” Journal of Fluid Mechanics, vol. 833. Cambridge University Press, pp. 274–301, 2017.","ama":"Budanur NB, Short K, Farazmand M, Willis A, Cvitanović P. Relative periodic orbits form the backbone of turbulent pipe flow. Journal of Fluid Mechanics. 2017;833:274-301. doi:10.1017/jfm.2017.699"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"BjHo"}],"month":"12","publication_identifier":{"issn":["00221120"]},"publication_status":"published","abstract":[{"lang":"eng","text":"The chaotic dynamics of low-dimensional systems, such as Lorenz or Rössler flows, is guided by the infinity of periodic orbits embedded in their strange attractors. Whether this is also the case for the infinite-dimensional dynamics of Navier–Stokes equations has long been speculated, and is a topic of ongoing study. Periodic and relative periodic solutions have been shown to be involved in transitions to turbulence. Their relevance to turbulent dynamics – specifically, whether periodic orbits play the same role in high-dimensional nonlinear systems like the Navier–Stokes equations as they do in lower-dimensional systems – is the focus of the present investigation. We perform here a detailed study of pipe flow relative periodic orbits with energies and mean dissipations close to turbulent values. We outline several approaches to reduction of the translational symmetry of the system. We study pipe flow in a minimal computational cell at Re=2500, and report a library of invariant solutions found with the aid of the method of slices. Detailed study of the unstable manifolds of a sample of these solutions is consistent with the picture that relative periodic orbits are embedded in the chaotic saddle and that they guide the turbulent dynamics."}],"intvolume":" 833","volume":833,"date_created":"2018-12-11T11:48:32Z","scopus_import":"1","day":"25","author":[{"full_name":"Budanur, Nazmi B","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","last_name":"Budanur","orcid":"0000-0003-0423-5010","first_name":"Nazmi B"},{"first_name":"Kimberly","last_name":"Short","full_name":"Short, Kimberly"},{"full_name":"Farazmand, Mohammad","last_name":"Farazmand","first_name":"Mohammad"},{"last_name":"Willis","full_name":"Willis, Ashley","first_name":"Ashley"},{"last_name":"Cvitanović","full_name":"Cvitanović, Predrag","first_name":"Predrag"}],"title":"Relative periodic orbits form the backbone of turbulent pipe flow","oa_version":"Submitted Version","date_published":"2017-12-25T00:00:00Z","publication":"Journal of Fluid Mechanics","status":"public","project":[{"grant_number":"11-NSF-1070","name":"ROOTS Genome-wide Analysis of Root Traits","_id":"25636330-B435-11E9-9278-68D0E5697425"}],"publist_id":"6862","isi":1,"year":"2017","external_id":{"isi":["000414641700001"]},"main_file_link":[{"url":"https://arxiv.org/abs/1705.03720","open_access":"1"}],"quality_controlled":"1","page":"274 - 301","_id":"792","date_updated":"2023-09-27T12:17:35Z","type":"journal_article","article_processing_charge":"No","doi":"10.1017/jfm.2017.699","publisher":"Cambridge University Press"}]