[{"publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.10169"}],"article_type":"original","_id":"11566","type":"journal_article","date_created":"2022-07-12T12:33:16Z","author":[{"first_name":"Andra","last_name":"Stroe","full_name":"Stroe, Andra"},{"full_name":"Sobral, David","first_name":"David","last_name":"Sobral"},{"orcid":"0000-0003-2871-127X","last_name":"Matthee","first_name":"Jorryt J","full_name":"Matthee, Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720"},{"last_name":"Calhau","first_name":"João","full_name":"Calhau, João"},{"full_name":"Oteo, Ivan","first_name":"Ivan","last_name":"Oteo"}],"oa_version":"Preprint","quality_controlled":"1","volume":471,"article_processing_charge":"No","language":[{"iso":"eng"}],"issue":"3","month":"11","doi":"10.1093/mnras/stx1712","day":"01","page":"2558-2574","year":"2017","acknowledgement":"We would like to thank the anonymous referee for her/his valuable input that helped improve the clarity and interpretation of our results. DS acknowledges financial support from the Netherlands Organisation for Scientific research (NWO), through a Veni fellowship. IO acknowledges support from the European Research Council in the form of the Advanced Investigator Programme, 321302, COSMICISM. CALYMHA data are based on observations made with the Isaac Newton Telescope (proposals 13AN002, I14AN002, 088-INT7/14A, I14BN006, 118-INT13/14B, I15AN008) operated on the island of La Palma by the Isaac Newton Group in the Spanish Observatorio del Roque de los Muchachos of the Instituto de Astrofísica de Canarias. Also based on data products from observations made with ESO Telescopes at the La Silla Paranal Observatory under ESO programme IDs 098.A-0819 and 179.A-2005. We are grateful to E. L. Wright and J. Schombert for their cosmology calculator. We would like to thank the authors of NUMPY (van der Walt et al. 2011), SCIPY (Jones et al. 2001), MATPLOTLIB (Hunter 2007) and ASTROPY (Astropy Collaboration et al. 2013) for making these packages publicly available. This research has made use of the NASA/IPAC Extragalactic Database (NED), which is ","oa":1,"publication":"Monthly Notices of the Royal Astronomical Society","arxiv":1,"intvolume":"       471","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: active","galaxies: high-redshift","quasars: emission lines","galaxies: star formation","cosmology: observations"],"scopus_import":"1","external_id":{"arxiv":["1703.10169"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Stroe, Andra, et al. “A 1.4 Deg2 Blind Survey for C II], C III] and C IV at z ∼ 0.7–1.5 – I. Nature, Morphologies and Equivalent Widths .” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 471, no. 3, Oxford University Press, 2017, pp. 2558–74, doi:<a href=\"https://doi.org/10.1093/mnras/stx1712\">10.1093/mnras/stx1712</a>.","short":"A. Stroe, D. Sobral, J.J. Matthee, J. Calhau, I. Oteo, Monthly Notices of the Royal Astronomical Society 471 (2017) 2558–2574.","ieee":"A. Stroe, D. Sobral, J. J. Matthee, J. Calhau, and I. Oteo, “A 1.4 deg2 blind survey for C II], C III] and C IV at z ∼ 0.7–1.5 – I. Nature, morphologies and equivalent widths ,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 471, no. 3. Oxford University Press, pp. 2558–2574, 2017.","ista":"Stroe A, Sobral D, Matthee JJ, Calhau J, Oteo I. 2017. A 1.4 deg2 blind survey for C II], C III] and C IV at z ∼ 0.7–1.5 – I. Nature, morphologies and equivalent widths . Monthly Notices of the Royal Astronomical Society. 471(3), 2558–2574.","chicago":"Stroe, Andra, David Sobral, Jorryt J Matthee, João Calhau, and Ivan Oteo. “A 1.4 Deg2 Blind Survey for C II], C III] and C IV at z ∼ 0.7–1.5 – I. Nature, Morphologies and Equivalent Widths .” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/mnras/stx1712\">https://doi.org/10.1093/mnras/stx1712</a>.","ama":"Stroe A, Sobral D, Matthee JJ, Calhau J, Oteo I. A 1.4 deg2 blind survey for C II], C III] and C IV at z ∼ 0.7–1.5 – I. Nature, morphologies and equivalent widths . <i>Monthly Notices of the Royal Astronomical Society</i>. 2017;471(3):2558-2574. doi:<a href=\"https://doi.org/10.1093/mnras/stx1712\">10.1093/mnras/stx1712</a>","apa":"Stroe, A., Sobral, D., Matthee, J. J., Calhau, J., &#38; Oteo, I. (2017). A 1.4 deg2 blind survey for C II], C III] and C IV at z ∼ 0.7–1.5 – I. Nature, morphologies and equivalent widths . <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stx1712\">https://doi.org/10.1093/mnras/stx1712</a>"},"extern":"1","date_updated":"2022-08-19T07:59:57Z","title":"A 1.4 deg2 blind survey for C II], C III] and C IV at z ∼ 0.7–1.5 – I. Nature, morphologies and equivalent widths ","date_published":"2017-11-01T00:00:00Z","publisher":"Oxford University Press","publication_status":"published","abstract":[{"text":"While traditionally associated with active galactic nuclei (AGN), the properties of the C II] (λ = 2326 Å), C III] (λ, λ = 1907, 1909 Å) and C IV (λ, λ = 1549, 1551 Å) emission lines are still uncertain as large, unbiased samples of sources are scarce. We present the first blind, statistical study of C II], C III] and C IV emitters at z ∼ 0.68, 1.05, 1.53, respectively, uniformly selected down to a flux limit of ∼4 × 10−17 erg s−1 cm−1 through a narrow-band survey covering an area of ∼1.4 deg2 over COSMOS and UDS. We detect 16 C II], 35 C III] and 17 C IV emitters, whose nature we investigate using optical colours as well as Hubble Space Telescope (HST), X-ray, radio and far-infrared data. We find that z ∼ 0.7 C II] emitters are consistent with a mixture of blue (UV slope β = −2.0 ± 0.4) star-forming (SF) galaxies with discy HST structure and AGN with Seyfert-like morphologies. Bright C II] emitters have individual X-ray detections as well as high average black hole accretion rates (BHARs) of ∼0.1 M⊙ yr−1. C III] emitters at z ∼ 1.05 trace a general population of SF galaxies, with β = −0.8 ± 1.1, a variety of optical morphologies, including isolated and interacting galaxies and low BHAR (<0.02 M⊙ yr−1). Our C IV emitters at z ∼ 1.5 are consistent with young, blue quasars (β ∼ −1.9) with point-like optical morphologies, bright X-ray counterparts and large BHAR (0.8  M⊙ yr−1). We also find some surprising C II], C III] and C IV emitters with rest-frame equivalent widths (EWs) that could be as large as 50–100 Å. AGN or spatial offsets between the UV continuum stellar disc and the line-emitting regions may explain the large EW. These bright C II], C III] and C IV emitters are ideal candidates for spectroscopic follow-up to fully unveil their nature.","lang":"eng"}]},{"_id":"11567","type":"journal_article","article_type":"original","date_created":"2022-07-12T12:54:57Z","status":"public","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"main_file_link":[{"url":"https://arxiv.org/abs/1703.10169","open_access":"1"}],"oa_version":"Preprint","quality_controlled":"1","author":[{"full_name":"Stroe, Andra","first_name":"Andra","last_name":"Stroe"},{"full_name":"Sobral, David","last_name":"Sobral","first_name":"David"},{"full_name":"Matthee, Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X","first_name":"Jorryt J","last_name":"Matthee"},{"full_name":"Calhau, João","last_name":"Calhau","first_name":"João"},{"full_name":"Oteo, Ivan","first_name":"Ivan","last_name":"Oteo"}],"issue":"3","month":"11","article_processing_charge":"No","volume":471,"language":[{"iso":"eng"}],"oa":1,"year":"2017","doi":"10.1093/mnras/stx1713","day":"01","page":"2575-2586","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: active","galaxies: high redshift","galaxies: luminosity function","mass function","quasars: emission lines","star formation","cosmology: observations"],"scopus_import":"1","publication":"Monthly Notices of the Royal Astronomical Society","intvolume":"       471","arxiv":1,"citation":{"mla":"Stroe, Andra, et al. “A 1.4 Deg2 Blind Survey for C II], C III] and C IV at z ∼ 0.7–1.5 – II. Luminosity Functions and Cosmic Average Line Ratios.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 471, no. 3, Oxford University Press, 2017, pp. 2575–86, doi:<a href=\"https://doi.org/10.1093/mnras/stx1713\">10.1093/mnras/stx1713</a>.","short":"A. Stroe, D. Sobral, J.J. Matthee, J. Calhau, I. Oteo, Monthly Notices of the Royal Astronomical Society 471 (2017) 2575–2586.","ieee":"A. Stroe, D. Sobral, J. J. Matthee, J. Calhau, and I. Oteo, “A 1.4 deg2 blind survey for C II], C III] and C IV at z ∼ 0.7–1.5 – II. Luminosity functions and cosmic average line ratios,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 471, no. 3. Oxford University Press, pp. 2575–2586, 2017.","chicago":"Stroe, Andra, David Sobral, Jorryt J Matthee, João Calhau, and Ivan Oteo. “A 1.4 Deg2 Blind Survey for C II], C III] and C IV at z ∼ 0.7–1.5 – II. Luminosity Functions and Cosmic Average Line Ratios.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/mnras/stx1713\">https://doi.org/10.1093/mnras/stx1713</a>.","ama":"Stroe A, Sobral D, Matthee JJ, Calhau J, Oteo I. A 1.4 deg2 blind survey for C II], C III] and C IV at z ∼ 0.7–1.5 – II. Luminosity functions and cosmic average line ratios. <i>Monthly Notices of the Royal Astronomical Society</i>. 2017;471(3):2575-2586. doi:<a href=\"https://doi.org/10.1093/mnras/stx1713\">10.1093/mnras/stx1713</a>","ista":"Stroe A, Sobral D, Matthee JJ, Calhau J, Oteo I. 2017. A 1.4 deg2 blind survey for C II], C III] and C IV at z ∼ 0.7–1.5 – II. Luminosity functions and cosmic average line ratios. Monthly Notices of the Royal Astronomical Society. 471(3), 2575–2586.","apa":"Stroe, A., Sobral, D., Matthee, J. J., Calhau, J., &#38; Oteo, I. (2017). A 1.4 deg2 blind survey for C II], C III] and C IV at z ∼ 0.7–1.5 – II. Luminosity functions and cosmic average line ratios. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stx1713\">https://doi.org/10.1093/mnras/stx1713</a>"},"date_updated":"2022-08-19T08:02:04Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1703.10169"]},"abstract":[{"text":"Recently, the C III] and C IV emission lines have been observed in galaxies in the early Universe (z > 5), providing new ways to measure their redshift and study their stellar populations and active galactic nuclei (AGN). We explore the first blind C II], C III] and C IV survey (z ∼ 0.68, 1.05, 1.53, respectively) presented in Stroe et al. (2017). We derive luminosity functions (LF) and study properties of C II], C III] and C IV line emitters through comparisons to the LFs of H α and Ly α emitters, UV selected star-forming (SF) galaxies and quasars at similar redshifts. The C II] LF at z ∼ 0.68 is equally well described by a Schechter or a power-law LF, characteristic of a mixture of SF and AGN activity. The C III] LF (z ∼ 1.05) is consistent to a scaled down version of the Schechter H α and Ly α LF at their redshift, indicating a SF origin. In stark contrast, the C IV LF at z ∼ 1.53 is well fit by a power-law, quasar-like LF. We find that the brightest UV sources (MUV < −22) will universally have C III] and C IV emission. However, on average, C III] and C IV are not as abundant as H α or Ly α emitters at the same redshift, with cosmic average ratios of ∼0.02–0.06 to H α and ∼0.01–0.1 to intrinsic Ly α. We predict that the C III] and C IV lines can only be truly competitive in confirming high-redshift candidates when the hosts are intrinsically bright and the effective Ly α escape fraction is below 1 per cent. While C III] and C IV were proposed as good tracers of young, relatively low-metallicity galaxies typical of the early Universe, we find that, at least at z ∼ 1.5, C IV is exclusively hosted by AGN/quasars, especially at large line equivalent widths.","lang":"eng"}],"publication_status":"published","title":"A 1.4 deg2 blind survey for C II], C III] and C IV at z ∼ 0.7–1.5 – II. Luminosity functions and cosmic average line ratios","publisher":"Oxford University Press","date_published":"2017-11-01T00:00:00Z"},{"oa_version":"Preprint","quality_controlled":"1","author":[{"orcid":"0000-0003-2871-127X","first_name":"Jorryt J","last_name":"Matthee","full_name":"Matthee, Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720"},{"last_name":"Sobral","first_name":"David","full_name":"Sobral, David"},{"last_name":"Darvish","first_name":"Behnam","full_name":"Darvish, Behnam"},{"full_name":"Santos, Sérgio","first_name":"Sérgio","last_name":"Santos"},{"full_name":"Mobasher, Bahram","last_name":"Mobasher","first_name":"Bahram"},{"full_name":"Paulino-Afonso, Ana","last_name":"Paulino-Afonso","first_name":"Ana"},{"full_name":"Röttgering, Huub","last_name":"Röttgering","first_name":"Huub"},{"full_name":"Alegre, Lara","last_name":"Alegre","first_name":"Lara"}],"issue":"1","month":"11","volume":472,"article_processing_charge":"No","language":[{"iso":"eng"}],"article_type":"original","_id":"11572","type":"journal_article","date_created":"2022-07-13T09:47:39Z","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1706.06591","open_access":"1"}],"publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"citation":{"apa":"Matthee, J. J., Sobral, D., Darvish, B., Santos, S., Mobasher, B., Paulino-Afonso, A., … Alegre, L. (2017). Spectroscopic properties of luminous Ly α emitters at z ≈ 6–7 and comparison to the Lyman-break population. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stx2061\">https://doi.org/10.1093/mnras/stx2061</a>","ama":"Matthee JJ, Sobral D, Darvish B, et al. Spectroscopic properties of luminous Ly α emitters at z ≈ 6–7 and comparison to the Lyman-break population. <i>Monthly Notices of the Royal Astronomical Society</i>. 2017;472(1):772-787. doi:<a href=\"https://doi.org/10.1093/mnras/stx2061\">10.1093/mnras/stx2061</a>","ista":"Matthee JJ, Sobral D, Darvish B, Santos S, Mobasher B, Paulino-Afonso A, Röttgering H, Alegre L. 2017. Spectroscopic properties of luminous Ly α emitters at z ≈ 6–7 and comparison to the Lyman-break population. Monthly Notices of the Royal Astronomical Society. 472(1), 772–787.","chicago":"Matthee, Jorryt J, David Sobral, Behnam Darvish, Sérgio Santos, Bahram Mobasher, Ana Paulino-Afonso, Huub Röttgering, and Lara Alegre. “Spectroscopic Properties of Luminous Ly α Emitters at z ≈ 6–7 and Comparison to the Lyman-Break Population.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/mnras/stx2061\">https://doi.org/10.1093/mnras/stx2061</a>.","ieee":"J. J. Matthee <i>et al.</i>, “Spectroscopic properties of luminous Ly α emitters at z ≈ 6–7 and comparison to the Lyman-break population,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 472, no. 1. Oxford University Press, pp. 772–787, 2017.","mla":"Matthee, Jorryt J., et al. “Spectroscopic Properties of Luminous Ly α Emitters at z ≈ 6–7 and Comparison to the Lyman-Break Population.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 472, no. 1, Oxford University Press, 2017, pp. 772–87, doi:<a href=\"https://doi.org/10.1093/mnras/stx2061\">10.1093/mnras/stx2061</a>.","short":"J.J. Matthee, D. Sobral, B. Darvish, S. Santos, B. Mobasher, A. Paulino-Afonso, H. Röttgering, L. Alegre, Monthly Notices of the Royal Astronomical Society 472 (2017) 772–787."},"extern":"1","date_updated":"2022-08-19T08:05:37Z","external_id":{"arxiv":["1706.06591"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"text":"We present spectroscopic follow-up of candidate luminous Ly α emitters (LAEs) at z = 5.7–6.6 in the SA22 field with VLT/X-SHOOTER. We confirm two new luminous LAEs at z = 5.676 (SR6) and z = 6.532 (VR7), and also present HST follow-up of both sources. These sources have luminosities LLy α ≈ 3 × 1043 erg s−1, very high rest-frame equivalent widths of EW0 ≳ 200 Å and narrow Ly α lines (200–340 km s−1). VR7 is the most UV-luminous LAE at z > 6.5, with M1500 = −22.5, even brighter in the UV than CR7. Besides Ly α, we do not detect any other rest-frame UV lines in the spectra of SR6 and VR7, and argue that rest-frame UV lines are easier to observe in bright galaxies with low Ly α equivalent widths. We confirm that Ly α line widths increase with Ly α luminosity at z = 5.7, while there are indications that Ly α lines of faint LAEs become broader at z = 6.6, potentially due to reionization. We find a large spread of up to 3 dex in UV luminosity for >L⋆ LAEs, but find that the Ly α luminosity of the brightest LAEs is strongly related to UV luminosity at z = 6.6. Under basic assumptions, we find that several LAEs at z ≈ 6–7 have Ly α escape fractions ≳ 100  per cent, indicating bursty star formation histories, alternative Ly α production mechanisms, or dust attenuating Ly α emission differently than UV emission. Finally, we present a method to compute ξion, the production efficiency of ionizing photons, and find that LAEs at z ≈ 6–7 have high values of log10(ξion/Hz erg−1) ≈ 25.51 ± 0.09 that may alleviate the need for high Lyman-Continuum escape fractions required for reionization.","lang":"eng"}],"title":"Spectroscopic properties of luminous Ly α emitters at z ≈ 6–7 and comparison to the Lyman-break population","publisher":"Oxford University Press","date_published":"2017-11-01T00:00:00Z","oa":1,"day":"01","page":"772-787","year":"2017","doi":"10.1093/mnras/stx2061","acknowledgement":"We thank the referee for a constructive report that has improved the quality and clarity of this work. The authors thank Grecco Oyarzún for discussions. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. DS acknowledges financial support from the Netherlands Organisation for Scientific research (NWO) through a Veni fellowship and from Lancaster University through an Early Career Internal Grant A100679. BD acknowledges financial support from NASA through the Astrophysics Data Analysis Program (ADAP), grant number NNX12AE20G. We thank Kasper Schmidt for providing measurements. Based on observations with the W.M. Keck Observatory through programme C267D. The W.M. Keck Observatory is operated as a scientific partnership amongst the California Institute of Technology, the University of California and the National Aeronautics and Space Administration. Based on observations made with ESO Telescopes at the La Silla Paranal Observatory under programme IDs 097.A-0943, 294.A 5018 and 098.A-0819 and on data products produced by TERAPIX and the Cambridge Astronomy Survey Unit on behalf of the UltraVISTA consortium. The authors acknowledge the award of observing time (W16AN004) and of service time (SW2014b20) on the William Herschel Telescope (WHT). WHT and its service programme are operated on the island of La Palma by the Isaac Newton Group in the Spanish Observatorio del Roque de los Muchachos of the Instituto de Astrofisica de Canarias. Based on observations made with the NASA/ESA HST, obtained (from the Data Archive) at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555. These observations are associated with programme #14699. We are grateful for the excellent data sets from the COSMOS, UltraVISTA, SXDS, UDS and CFHTLS survey teams; without these legacy surveys, this research would have been impossible. We have benefited from the public available programming language PYTHON, including the NUMPY, MATPLOTLIB, PYFITS, SCIPY and ASTROPY packages, the astronomical imaging tools SEXTRACTOR, SWARP and SCAMP and the TOPCAT analysis tool (Taylor 2013).","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution – galaxies: high-redshift","dark ages","reionization","first stars","cosmology: observations"],"scopus_import":"1","publication":"Monthly Notices of the Royal Astronomical Society","arxiv":1,"intvolume":"       472"},{"external_id":{"arxiv":["1704.06263"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2022-08-19T08:07:31Z","citation":{"ieee":"O. J. Turner <i>et al.</i>, “The KMOS Deep Survey (KDS) – I. Dynamical measurements of typical star-forming galaxies at z ≃ 3.5,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 471, no. 2. Oxford University Press, pp. 1280–1320, 2017.","chicago":"Turner, O. J., M. Cirasuolo, C. M. Harrison, R. J. McLure, J. S. Dunlop, A. M. Swinbank, H. L. Johnson, D. Sobral, Jorryt J Matthee, and R. M. Sharples. “The KMOS Deep Survey (KDS) – I. Dynamical Measurements of Typical Star-Forming Galaxies at z ≃ 3.5.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/mnras/stx1366\">https://doi.org/10.1093/mnras/stx1366</a>.","ista":"Turner OJ, Cirasuolo M, Harrison CM, McLure RJ, Dunlop JS, Swinbank AM, Johnson HL, Sobral D, Matthee JJ, Sharples RM. 2017. The KMOS Deep Survey (KDS) – I. Dynamical measurements of typical star-forming galaxies at z ≃ 3.5. Monthly Notices of the Royal Astronomical Society. 471(2), 1280–1320.","ama":"Turner OJ, Cirasuolo M, Harrison CM, et al. The KMOS Deep Survey (KDS) – I. Dynamical measurements of typical star-forming galaxies at z ≃ 3.5. <i>Monthly Notices of the Royal Astronomical Society</i>. 2017;471(2):1280-1320. doi:<a href=\"https://doi.org/10.1093/mnras/stx1366\">10.1093/mnras/stx1366</a>","apa":"Turner, O. J., Cirasuolo, M., Harrison, C. M., McLure, R. J., Dunlop, J. S., Swinbank, A. M., … Sharples, R. M. (2017). The KMOS Deep Survey (KDS) – I. Dynamical measurements of typical star-forming galaxies at z ≃ 3.5. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stx1366\">https://doi.org/10.1093/mnras/stx1366</a>","short":"O.J. Turner, M. Cirasuolo, C.M. Harrison, R.J. McLure, J.S. Dunlop, A.M. Swinbank, H.L. Johnson, D. Sobral, J.J. Matthee, R.M. Sharples, Monthly Notices of the Royal Astronomical Society 471 (2017) 1280–1320.","mla":"Turner, O. J., et al. “The KMOS Deep Survey (KDS) – I. Dynamical Measurements of Typical Star-Forming Galaxies at z ≃ 3.5.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 471, no. 2, Oxford University Press, 2017, pp. 1280–320, doi:<a href=\"https://doi.org/10.1093/mnras/stx1366\">10.1093/mnras/stx1366</a>."},"date_published":"2017-10-01T00:00:00Z","publisher":"Oxford University Press","title":"The KMOS Deep Survey (KDS) – I. Dynamical measurements of typical star-forming galaxies at z ≃ 3.5","publication_status":"published","abstract":[{"text":"We present dynamical measurements from the KMOS (K-band multi-object spectrograph) Deep Survey (KDS), which comprises 77 typical star-forming galaxies at z ≃ 3.5 in the mass range 9.0 < log (M⋆/M⊙) < 10.5. These measurements constrain the internal dynamics, the intrinsic velocity dispersions (σint) and rotation velocities (VC) of galaxies in the high-redshift Universe. The mean velocity dispersion of the galaxies in our sample is σint=70.8+3.3−3.1kms−1⁠, revealing that the increasing average σint with increasing redshift, reported for z ≲ 2, continues out to z ≃ 3.5. Only 36 ± 8 per cent of our galaxies are rotation-dominated (VC/σint > 1), with the sample average VC/σint value much smaller than at lower redshift. After carefully selecting comparable star-forming samples at multiple epochs, we find that the rotation-dominated fraction evolves with redshift with a z−0.2 dependence. The rotation-dominated KDS galaxies show no clear offset from the local rotation velocity–stellar mass (i.e. VC–M⋆) relation, although a smaller fraction of the galaxies are on the relation due to the increase in the dispersion-dominated fraction. These observations are consistent with a simple equilibrium model picture, in which random motions are boosted in high-redshift galaxies by a combination of the increasing gas fractions, accretion efficiency, specific star formation rate and stellar feedback and which may provide significant pressure support against gravity on the galactic disc scale.","lang":"eng"}],"acknowledgement":"We wish to thank the anonymous referee for their comments, which have improved the quality and clarity of this work. OJT acknowledges the financial support of the Science and Technology Facilities Council through a studentship award. MC and OJT acknowledge the KMOS team and all the personnel of the European Southern Observatory Very Large Telescope for outstanding support during the KMOS GTO observations. CMH, AMS and RMS acknowledge the Science and Technology Facilities Council through grant code ST/L00075X/1. RJM acknowledges the support of the European Research Council via the award of a Consolidator Grant (PI: McLure). JSD acknowledges the support of the European Research Council via the award of an Advanced Grant (PI J. Dunlop), and the contribution of the EC FP7 SPACE project ASTRODEEP (Ref.No: 312725). AMS acknowledges the Leverhulme Foundation. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. DS acknowledges financial support from the Netherlands Organization for Scientific research (NWO) through a Veni fellowship and from FCT through an FCT Investigator Starting Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010). This work is based on observations taken by the CANDELS Multi-Cycle Treasury Program with the NASA/ESA HST, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS5-26555. This work is based on observations taken by the 3D HST Treasury Program (GO 12177 and 12328) with the NASA/ESA HST, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS5-26555. Based on data obtained with the European Southern Observatory Very Large Telescope, Paranal, Chile, under Large Program 185.A-0791, and made available by the VUDS team at the CESAM data centre, Laboratoire d’Astrophysique de Marseille, France. Based on observations obtained at the Very Large Telescope of the European Southern Observatory. Programme IDs: 092.A 0399(A), 093.A-0122(A,B), 094.A-0214(A,B),095.A0680(A,B),096.A-0315(A,B,C).","day":"01","year":"2017","page":"1280-1320","doi":"10.1093/mnras/stx1366","oa":1,"arxiv":1,"intvolume":"       471","publication":"Monthly Notices of the Royal Astronomical Society","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: high-redshift","galaxies: kinematics and dynamics"],"scopus_import":"1","author":[{"full_name":"Turner, O. J.","last_name":"Turner","first_name":"O. J."},{"full_name":"Cirasuolo, M.","last_name":"Cirasuolo","first_name":"M."},{"last_name":"Harrison","first_name":"C. M.","full_name":"Harrison, C. M."},{"first_name":"R. J.","last_name":"McLure","full_name":"McLure, R. J."},{"full_name":"Dunlop, J. S.","last_name":"Dunlop","first_name":"J. S."},{"full_name":"Swinbank, A. M.","last_name":"Swinbank","first_name":"A. M."},{"full_name":"Johnson, H. L.","first_name":"H. L.","last_name":"Johnson"},{"full_name":"Sobral, D.","last_name":"Sobral","first_name":"D."},{"first_name":"Jorryt J","last_name":"Matthee","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","full_name":"Matthee, Jorryt J"},{"full_name":"Sharples, R. M.","last_name":"Sharples","first_name":"R. M."}],"quality_controlled":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"volume":471,"article_processing_charge":"No","month":"10","issue":"2","status":"public","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"main_file_link":[{"url":"https://arxiv.org/abs/1704.06263","open_access":"1"}],"date_created":"2022-07-13T10:03:01Z","article_type":"original","_id":"11573","type":"journal_article"},{"oa_version":"Submitted Version","quality_controlled":"1","project":[{"name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","call_identifier":"FP7"}],"author":[{"full_name":"Steenackers, Ward","first_name":"Ward","last_name":"Steenackers"},{"first_name":"Petr","last_name":"Klíma","full_name":"Klíma, Petr"},{"full_name":"Quareshy, Mussa","first_name":"Mussa","last_name":"Quareshy"},{"full_name":"Cesarino, Igor","last_name":"Cesarino","first_name":"Igor"},{"full_name":"Kumpf, Robert","first_name":"Robert","last_name":"Kumpf"},{"full_name":"Corneillie, Sander","first_name":"Sander","last_name":"Corneillie"},{"last_name":"Araújo","first_name":"Pedro","full_name":"Araújo, Pedro"},{"first_name":"Tom","last_name":"Viaene","full_name":"Viaene, Tom"},{"last_name":"Goeminne","first_name":"Geert","full_name":"Goeminne, Geert"},{"last_name":"Nowack","first_name":"Moritz","full_name":"Nowack, Moritz"},{"first_name":"Karin","last_name":"Ljung","full_name":"Ljung, Karin"},{"last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"},{"first_name":"Joshua","last_name":"Blakeslee","full_name":"Blakeslee, Joshua"},{"first_name":"Ondřej","last_name":"Novák","full_name":"Novák, Ondřej"},{"full_name":"Zažímalová, Eva","last_name":"Zažímalová","first_name":"Eva"},{"full_name":"Napier, Richard","first_name":"Richard","last_name":"Napier"},{"first_name":"Wout","last_name":"Boerjan","full_name":"Boerjan, Wout"},{"full_name":"Vanholme, Bartel","first_name":"Bartel","last_name":"Vanholme"}],"file":[{"file_name":"2016_PlantPhysi_Steenackers.pdf","content_type":"application/pdf","date_created":"2019-11-18T16:12:25Z","date_updated":"2020-07-14T12:44:36Z","file_id":"7040","checksum":"fd4d1cfe7ed70e54bb12ae3881f3fb91","creator":"dernst","access_level":"open_access","file_size":4109142,"relation":"main_file"}],"issue":"1","month":"01","has_accepted_license":"1","volume":173,"article_processing_charge":"No","language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","_id":"1159","date_created":"2018-12-11T11:50:28Z","publication_identifier":{"issn":["0032-0889"]},"status":"public","ec_funded":1,"citation":{"short":"W. Steenackers, P. Klíma, M. Quareshy, I. Cesarino, R. Kumpf, S. Corneillie, P. Araújo, T. Viaene, G. Goeminne, M. Nowack, K. Ljung, J. Friml, J. Blakeslee, O. Novák, E. Zažímalová, R. Napier, W. Boerjan, B. Vanholme, Plant Physiology 173 (2017) 552–565.","mla":"Steenackers, Ward, et al. “Cis-Cinnamic Acid Is a Novel Natural Auxin Efflux Inhibitor That Promotes Lateral Root Formation.” <i>Plant Physiology</i>, vol. 173, no. 1, American Society of Plant Biologists, 2017, pp. 552–65, doi:<a href=\"https://doi.org/10.1104/pp.16.00943\">10.1104/pp.16.00943</a>.","ama":"Steenackers W, Klíma P, Quareshy M, et al. Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation. <i>Plant Physiology</i>. 2017;173(1):552-565. doi:<a href=\"https://doi.org/10.1104/pp.16.00943\">10.1104/pp.16.00943</a>","ista":"Steenackers W, Klíma P, Quareshy M, Cesarino I, Kumpf R, Corneillie S, Araújo P, Viaene T, Goeminne G, Nowack M, Ljung K, Friml J, Blakeslee J, Novák O, Zažímalová E, Napier R, Boerjan W, Vanholme B. 2017. Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation. Plant Physiology. 173(1), 552–565.","chicago":"Steenackers, Ward, Petr Klíma, Mussa Quareshy, Igor Cesarino, Robert Kumpf, Sander Corneillie, Pedro Araújo, et al. “Cis-Cinnamic Acid Is a Novel Natural Auxin Efflux Inhibitor That Promotes Lateral Root Formation.” <i>Plant Physiology</i>. American Society of Plant Biologists, 2017. <a href=\"https://doi.org/10.1104/pp.16.00943\">https://doi.org/10.1104/pp.16.00943</a>.","apa":"Steenackers, W., Klíma, P., Quareshy, M., Cesarino, I., Kumpf, R., Corneillie, S., … Vanholme, B. (2017). Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation. <i>Plant Physiology</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1104/pp.16.00943\">https://doi.org/10.1104/pp.16.00943</a>","ieee":"W. Steenackers <i>et al.</i>, “Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation,” <i>Plant Physiology</i>, vol. 173, no. 1. American Society of Plant Biologists, pp. 552–565, 2017."},"department":[{"_id":"JiFr"}],"date_updated":"2025-05-07T11:12:30Z","external_id":{"isi":["000394135800041"],"pmid":["27837086"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","isi":1,"ddc":["580"],"publication_status":"published","abstract":[{"lang":"eng","text":"Auxin steers numerous physiological processes in plants, making the tight control of its endogenous levels and spatiotemporal distribution a necessity. This regulation is achieved by different mechanisms, including auxin biosynthesis, metabolic conversions, degradation, and transport. Here, we introduce cis-cinnamic acid (c-CA) as a novel and unique addition to a small group of endogenous molecules affecting in planta auxin concentrations. c-CA is the photo-isomerization product of the phenylpropanoid pathway intermediate trans-CA (t-CA). When grown on c-CA-containing medium, an evolutionary diverse set of plant species were shown to exhibit phenotypes characteristic for high auxin levels, including inhibition of primary root growth, induction of root hairs, and promotion of adventitious and lateral rooting. By molecular docking and receptor binding assays, we showed that c-CA itself is neither an auxin nor an anti-auxin, and auxin profiling data revealed that c-CA does not significantly interfere with auxin biosynthesis. Single cell-based auxin accumulation assays showed that c-CA, and not t-CA, is a potent inhibitor of auxin efflux. Auxin signaling reporters detected changes in spatiotemporal distribution of the auxin response along the root of c-CA-treated plants, and long-distance auxin transport assays showed no inhibition of rootward auxin transport. Overall, these results suggest that the phenotypes of c-CA-treated plants are the consequence of a local change in auxin accumulation, induced by the inhibition of auxin efflux. This work reveals a novel mechanism how plants may regulate auxin levels and adds a novel, naturally occurring molecule to the chemical toolbox for the studies of auxin homeostasis."}],"title":"Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation","pmid":1,"date_published":"2017-01-01T00:00:00Z","publisher":"American Society of Plant Biologists","file_date_updated":"2020-07-14T12:44:36Z","oa":1,"doi":"10.1104/pp.16.00943","page":"552 - 565","year":"2017","day":"01","scopus_import":"1","publication":"Plant Physiology","publist_id":"6199","intvolume":"       173"},{"scopus_import":"1","publication":"Scientific Reports","publist_id":"6198","intvolume":"         7","oa":1,"year":"2017","doi":"10.1038/srep40012","day":"06","ddc":["532"],"isi":1,"publication_status":"published","abstract":[{"lang":"eng","text":"We investigate fundamental nonlinear dynamics of ferrofluidic Taylor-Couette flow - flow confined be-tween two concentric independently rotating cylinders - consider small aspect ratio by solving the ferro-hydrodynamical equations, carrying out systematic bifurcation analysis. Without magnetic field, we find steady flow patterns, previously observed with a simple fluid, such as those containing normal one- or two vortex cells, as well as anomalous one-cell and twin-cell flow states. However, when a symmetry-breaking transverse magnetic field is present, all flow states exhibit stimulated, finite two-fold mode. Various bifurcations between steady and unsteady states can occur, corresponding to the transitions between the two-cell and one-cell states. While unsteady, axially oscillating flow states can arise, we also detect the emergence of new unsteady flow states. In particular, we uncover two new states: one contains only the azimuthally oscillating solution in the configuration of the twin-cell flow state, and an-other a rotating flow state. Topologically, these flow states are a limit cycle and a quasiperiodic solution on a two-torus, respectively. Emergence of new flow states in addition to observed ones with classical fluid, indicates that richer but potentially more controllable dynamics in ferrofluidic flows, as such flow states depend on the external magnetic field."}],"title":"Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio","file_date_updated":"2020-07-14T12:44:36Z","date_published":"2017-01-06T00:00:00Z","publisher":"Nature Publishing Group","citation":{"mla":"Altmeyer, Sebastian, et al. “Dynamics of Ferrofluidic Flow in the Taylor-Couette System with a Small Aspect Ratio.” <i>Scientific Reports</i>, vol. 7, 40012, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/srep40012\">10.1038/srep40012</a>.","short":"S. Altmeyer, Y. Do, Y. Lai, Scientific Reports 7 (2017).","apa":"Altmeyer, S., Do, Y., &#38; Lai, Y. (2017). Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/srep40012\">https://doi.org/10.1038/srep40012</a>","ista":"Altmeyer S, Do Y, Lai Y. 2017. Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio. Scientific Reports. 7, 40012.","ama":"Altmeyer S, Do Y, Lai Y. Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio. <i>Scientific Reports</i>. 2017;7. doi:<a href=\"https://doi.org/10.1038/srep40012\">10.1038/srep40012</a>","chicago":"Altmeyer, Sebastian, Younghae Do, and Ying Lai. “Dynamics of Ferrofluidic Flow in the Taylor-Couette System with a Small Aspect Ratio.” <i>Scientific Reports</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/srep40012\">https://doi.org/10.1038/srep40012</a>.","ieee":"S. Altmeyer, Y. Do, and Y. Lai, “Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio,” <i>Scientific Reports</i>, vol. 7. Nature Publishing Group, 2017."},"department":[{"_id":"BjHo"}],"date_updated":"2023-09-20T11:28:49Z","external_id":{"isi":["000391269700001"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"pubrep_id":"743","type":"journal_article","_id":"1160","date_created":"2018-12-11T11:50:28Z","license":"https://creativecommons.org/licenses/by/4.0/","status":"public","publication_identifier":{"issn":["20452322"]},"file":[{"access_level":"open_access","file_size":4546835,"checksum":"694aa70399444570825099c1a7ec91f2","file_id":"4802","creator":"system","relation":"main_file","file_name":"IST-2017-743-v1+1_srep40012.pdf","date_created":"2018-12-12T10:10:16Z","date_updated":"2020-07-14T12:44:36Z","content_type":"application/pdf"}],"article_number":"40012","has_accepted_license":"1","month":"01","volume":7,"article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Published Version","quality_controlled":"1","author":[{"orcid":"0000-0001-5964-0203","first_name":"Sebastian","last_name":"Altmeyer","full_name":"Altmeyer, Sebastian","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Do, Younghae","first_name":"Younghae","last_name":"Do"},{"last_name":"Lai","first_name":"Ying","full_name":"Lai, Ying"}]},{"status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.03247"}],"publication_identifier":{"issn":["24699950"]},"_id":"1162","type":"journal_article","date_created":"2018-12-11T11:50:29Z","ec_funded":1,"author":[{"first_name":"Jozef","last_name":"Spałek","full_name":"Spałek, Jozef"},{"full_name":"Zegrodnik, Michał","last_name":"Zegrodnik","first_name":"Michał"},{"full_name":"Kaczmarczyk, Jan","id":"46C405DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1629-3675","last_name":"Kaczmarczyk","first_name":"Jan"}],"oa_version":"Submitted Version","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","article_processing_charge":"No","volume":95,"language":[{"iso":"eng"}],"issue":"2","article_number":"024506","month":"01","year":"2017","doi":"10.1103/PhysRevB.95.024506","day":"13","oa":1,"publication":"Physical Review B - Condensed Matter and Materials Physics","intvolume":"        95","publist_id":"6195","scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000391852800006"]},"citation":{"short":"J. Spałek, M. Zegrodnik, J. Kaczmarczyk, Physical Review B - Condensed Matter and Materials Physics 95 (2017).","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.” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 95, no. 2, 024506, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevB.95.024506\">10.1103/PhysRevB.95.024506</a>.","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.” <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevB.95.024506\">https://doi.org/10.1103/PhysRevB.95.024506</a>.","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. <i>Physical Review B - Condensed Matter and Materials Physics</i>. 2017;95(2). doi:<a href=\"https://doi.org/10.1103/PhysRevB.95.024506\">10.1103/PhysRevB.95.024506</a>","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.","apa":"Spałek, J., Zegrodnik, M., &#38; Kaczmarczyk, J. (2017). Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment. <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.95.024506\">https://doi.org/10.1103/PhysRevB.95.024506</a>","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,” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 95, no. 2. American Physical Society, 2017."},"date_updated":"2023-09-20T11:25:56Z","department":[{"_id":"MiLe"}],"title":"Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment","date_published":"2017-01-13T00:00:00Z","publisher":"American Physical Society","isi":1,"abstract":[{"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.","lang":"eng"}],"publication_status":"published"},{"author":[{"orcid":"0000-0003-0142-4000","last_name":"Bugnet","first_name":"Lisa Annabelle","full_name":"Bugnet, Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"full_name":"Garcia, R. A.","first_name":"R. A.","last_name":"Garcia"},{"full_name":"Davies, G. R.","last_name":"Davies","first_name":"G. R."},{"full_name":"Mathur, S.","last_name":"Mathur","first_name":"S."},{"full_name":"Corsaro, E.","first_name":"E.","last_name":"Corsaro"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1711.02890"]},"date_updated":"2022-08-22T08:45:42Z","extern":"1","citation":{"apa":"Bugnet, L. A., Garcia, R. A., Davies, G. R., Mathur, S., &#38; Corsaro, E. (n.d.). FliPer: Checking the reliability of global seismic parameters from automatic pipelines. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1711.02890\">https://doi.org/10.48550/arXiv.1711.02890</a>","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.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1711.02890\">https://doi.org/10.48550/arXiv.1711.02890</a>.","ama":"Bugnet LA, Garcia RA, Davies GR, Mathur S, Corsaro E. FliPer: Checking the reliability of global seismic parameters from automatic pipelines. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1711.02890\">10.48550/arXiv.1711.02890</a>","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.","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,” <i>arXiv</i>. .","short":"L.A. Bugnet, R.A. Garcia, G.R. Davies, S. Mathur, E. Corsaro, ArXiv (n.d.).","mla":"Bugnet, Lisa Annabelle, et al. “FliPer: Checking the Reliability of Global Seismic Parameters from Automatic Pipelines.” <i>ArXiv</i>, 1711.02890, doi:<a href=\"https://doi.org/10.48550/arXiv.1711.02890\">10.48550/arXiv.1711.02890</a>."},"oa_version":"Preprint","date_published":"2017-11-08T00:00:00Z","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"FliPer: Checking the reliability of global seismic parameters from automatic pipelines","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"}],"publication_status":"submitted","month":"11","article_number":"1711.02890","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1711.02890"}],"status":"public","year":"2017","day":"08","doi":"10.48550/arXiv.1711.02890","oa":1,"date_created":"2022-07-21T07:13:13Z","type":"preprint","_id":"11633","arxiv":1,"publication":"arXiv","keyword":["asteroseismology - methods","data analysis - stars","oscillations"]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["PMLR"],"external_id":{"arxiv":["1706.05826"]},"date_updated":"2023-02-09T09:15:31Z","extern":"1","citation":{"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.","mla":"Wang, Di, et al. “Capacity Releasing Diffusion for Speed and Locality.” <i>Proceedings of the 34th International Conference on Machine Learning</i>, vol. 70, ML Research Press, 2017, pp. 3598–607.","apa":"Wang, D., Fountoulakis, K., Henzinger, M. H., Mahoney, M. W., &#38; Rao ,  Satish. (2017). Capacity releasing diffusion for speed and locality. In <i>Proceedings of the 34th International Conference on Machine Learning</i> (Vol. 70, pp. 3598–3607). Sydney, Australia: ML Research Press.","ama":"Wang D, Fountoulakis K, Henzinger MH, Mahoney MW, Rao   Satish. Capacity releasing diffusion for speed and locality. In: <i>Proceedings of the 34th International Conference on Machine Learning</i>. Vol 70. ML Research Press; 2017:3598-3607.","chicago":"Wang, Di, Kimon Fountoulakis, Monika H Henzinger, Michael W. Mahoney, and  Satish Rao . “Capacity Releasing Diffusion for Speed and Locality.” In <i>Proceedings of the 34th International Conference on Machine Learning</i>, 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.","ieee":"D. Wang, K. Fountoulakis, M. H. Henzinger, M. W. Mahoney, and  Satish Rao , “Capacity releasing diffusion for speed and locality,” in <i>Proceedings of the 34th International Conference on Machine Learning</i>, Sydney, Australia, 2017, vol. 70, pp. 3598–3607."},"publisher":"ML Research Press","date_published":"2017-09-01T00:00:00Z","title":"Capacity releasing diffusion for speed and locality","abstract":[{"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.","lang":"eng"}],"publication_status":"published","day":"01","page":"3598-3607","year":"2017","oa":1,"intvolume":"        70","arxiv":1,"publication":"Proceedings of the 34th International Conference on Machine Learning","author":[{"last_name":"Wang","first_name":"Di","full_name":"Wang, Di"},{"full_name":"Fountoulakis, Kimon","last_name":"Fountoulakis","first_name":"Kimon"},{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Mahoney, Michael W.","first_name":"Michael W.","last_name":"Mahoney"},{"last_name":"Rao ","first_name":" Satish","full_name":"Rao ,  Satish"}],"quality_controlled":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":70,"month":"09","publication_identifier":{"eissn":["2640-3498"]},"main_file_link":[{"open_access":"1","url":"http://proceedings.mlr.press/v70/wang17b/wang17b.pdf"}],"status":"public","date_created":"2022-07-25T13:59:21Z","_id":"11651","type":"conference","conference":{"name":"International Conference on Machine Learning","location":"Sydney, Australia","start_date":"2017-08-06","end_date":"2017-08-11"}},{"publication":"ACM Transactions on Algorithms","intvolume":"        13","arxiv":1,"scopus_import":"1","day":"01","year":"2017","doi":"10.1145/3146550","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.","oa":1,"title":"Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks","publisher":"Association for Computing Machinery","date_published":"2017-10-01T00:00:00Z","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","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1512.08147"]},"citation":{"chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.” <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery, 2017. <a href=\"https://doi.org/10.1145/3146550\">https://doi.org/10.1145/3146550</a>.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. <i>ACM Transactions on Algorithms</i>. 2017;13(4). doi:<a href=\"https://doi.org/10.1145/3146550\">10.1145/3146550</a>","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.","apa":"Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2017). Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3146550\">https://doi.org/10.1145/3146550</a>","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks,” <i>ACM Transactions on Algorithms</i>, vol. 13, no. 4. Association for Computing Machinery, 2017.","mla":"Henzinger, Monika H., et al. “Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.” <i>ACM Transactions on Algorithms</i>, vol. 13, no. 4, 51, Association for Computing Machinery, 2017, doi:<a href=\"https://doi.org/10.1145/3146550\">10.1145/3146550</a>.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, ACM Transactions on Algorithms 13 (2017)."},"date_updated":"2022-09-09T11:57:42Z","extern":"1","publication_identifier":{"issn":["1549-6325"],"eissn":["1549-6333"]},"main_file_link":[{"url":"https://arxiv.org/abs/1512.08147","open_access":"1"}],"status":"public","_id":"11665","type":"journal_article","article_type":"original","date_created":"2022-07-27T11:37:23Z","article_processing_charge":"No","volume":13,"language":[{"iso":"eng"}],"issue":"4","article_number":"51","month":"10","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Krinninger","first_name":"Sebastian","full_name":"Krinninger, Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"oa_version":"Preprint","quality_controlled":"1"},{"month":"01","issue":"1","language":[{"iso":"eng"}],"volume":77,"article_processing_charge":"No","quality_controlled":"1","oa_version":"Preprint","author":[{"first_name":"Wolfgang","last_name":"Dvořák","full_name":"Dvořák, Wolfgang"},{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Williamson, David P.","last_name":"Williamson","first_name":"David P."}],"date_created":"2022-07-27T14:37:24Z","article_type":"original","_id":"11676","type":"journal_article","publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.05753"}],"status":"public","publication_status":"published","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."}],"publisher":"Springer Nature","date_published":"2017-01-01T00:00:00Z","title":"Maximizing a submodular function with viability constraints","extern":"1","date_updated":"2022-09-12T08:58:16Z","citation":{"mla":"Dvořák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.” <i>Algorithmica</i>, vol. 77, no. 1, Springer Nature, 2017, pp. 152–72, doi:<a href=\"https://doi.org/10.1007/s00453-015-0066-y\">10.1007/s00453-015-0066-y</a>.","short":"W. Dvořák, M.H. Henzinger, D.P. Williamson, Algorithmica 77 (2017) 152–172.","ista":"Dvořák W, Henzinger MH, Williamson DP. 2017. Maximizing a submodular function with viability constraints. Algorithmica. 77(1), 152–172.","ama":"Dvořák W, Henzinger MH, Williamson DP. Maximizing a submodular function with viability constraints. <i>Algorithmica</i>. 2017;77(1):152-172. doi:<a href=\"https://doi.org/10.1007/s00453-015-0066-y\">10.1007/s00453-015-0066-y</a>","chicago":"Dvořák, Wolfgang, Monika H Henzinger, and David P. Williamson. “Maximizing a Submodular Function with Viability Constraints.” <i>Algorithmica</i>. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/s00453-015-0066-y\">https://doi.org/10.1007/s00453-015-0066-y</a>.","apa":"Dvořák, W., Henzinger, M. H., &#38; Williamson, D. P. (2017). Maximizing a submodular function with viability constraints. <i>Algorithmica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00453-015-0066-y\">https://doi.org/10.1007/s00453-015-0066-y</a>","ieee":"W. Dvořák, M. H. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” <i>Algorithmica</i>, vol. 77, no. 1. Springer Nature, pp. 152–172, 2017."},"external_id":{"arxiv":["1611.05753"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","keyword":["Approximation algorithms","Submodular functions","Phylogenetic diversity","Viability constraints"],"arxiv":1,"intvolume":"        77","publication":"Algorithmica","oa":1,"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.","doi":"10.1007/s00453-015-0066-y","year":"2017","page":"152-172","day":"01"},{"language":[{"iso":"eng"}],"volume":26,"article_processing_charge":"No","has_accepted_license":"1","month":"08","file":[{"creator":"system","file_id":"5199","checksum":"0b2d1b647ca96e9ef13a14b8b6775e0f","file_size":56664,"access_level":"open_access","relation":"main_file","file_name":"IST-2017-739-v1+2_10260_2016_375_MOESM1_ESM.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:37Z","date_created":"2018-12-12T10:16:13Z"},{"file_name":"IST-2017-739-v1+3_s10260-016-0375-6.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:16:14Z","date_updated":"2020-07-14T12:44:37Z","file_id":"5200","checksum":"3321ef34e02e28acfc427f77cf32812a","creator":"system","access_level":"open_access","file_size":688953,"relation":"main_file"}],"issue":"3","author":[{"id":"2A5F8724-F248-11E8-B48F-1D18A9856A87","full_name":"Perrone, Elisa","last_name":"Perrone","first_name":"Elisa","orcid":"0000-0003-0370-9835"},{"first_name":"Andreas","last_name":"Rappold","full_name":"Rappold, Andreas"},{"last_name":"Müller","first_name":"Werner","full_name":"Müller, Werner"}],"quality_controlled":"1","oa_version":"Submitted Version","pubrep_id":"739","status":"public","date_created":"2018-12-11T11:50:31Z","type":"journal_article","_id":"1168","file_date_updated":"2020-07-14T12:44:37Z","publisher":"Springer","date_published":"2017-08-01T00:00:00Z","title":"D inf s optimality in copula models","publication_status":"published","abstract":[{"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.","lang":"eng"}],"ddc":["519"],"isi":1,"external_id":{"isi":["000407973200004"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"department":[{"_id":"CaUh"}],"date_updated":"2023-09-20T11:25:09Z","citation":{"short":"E. Perrone, A. Rappold, W. Müller, Statistical Methods and Applications 26 (2017) 403–418.","mla":"Perrone, Elisa, et al. “D Inf s Optimality in Copula Models.” <i>Statistical Methods and Applications</i>, vol. 26, no. 3, Springer, 2017, pp. 403–18, doi:<a href=\"https://doi.org/10.1007/s10260-016-0375-6\">10.1007/s10260-016-0375-6</a>.","ieee":"E. Perrone, A. Rappold, and W. Müller, “D inf s optimality in copula models,” <i>Statistical Methods and Applications</i>, vol. 26, no. 3. Springer, pp. 403–418, 2017.","ista":"Perrone E, Rappold A, Müller W. 2017. D inf s optimality in copula models. Statistical Methods and Applications. 26(3), 403–418.","chicago":"Perrone, Elisa, Andreas Rappold, and Werner Müller. “D Inf s Optimality in Copula Models.” <i>Statistical Methods and Applications</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s10260-016-0375-6\">https://doi.org/10.1007/s10260-016-0375-6</a>.","ama":"Perrone E, Rappold A, Müller W. D inf s optimality in copula models. <i>Statistical Methods and Applications</i>. 2017;26(3):403-418. doi:<a href=\"https://doi.org/10.1007/s10260-016-0375-6\">10.1007/s10260-016-0375-6</a>","apa":"Perrone, E., Rappold, A., &#38; Müller, W. (2017). D inf s optimality in copula models. <i>Statistical Methods and Applications</i>. Springer. <a href=\"https://doi.org/10.1007/s10260-016-0375-6\">https://doi.org/10.1007/s10260-016-0375-6</a>"},"publist_id":"6189","intvolume":"        26","publication":"Statistical Methods and Applications","scopus_import":"1","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). ","year":"2017","doi":"10.1007/s10260-016-0375-6","page":"403 - 418","day":"01","oa":1},{"publication_identifier":{"issn":["00166731"]},"status":"public","type":"journal_article","_id":"1169","date_created":"2018-12-11T11:50:31Z","ec_funded":1,"pubrep_id":"727","author":[{"id":"461468AE-F248-11E8-B48F-1D18A9856A87","full_name":"Novak, Sebastian","first_name":"Sebastian","last_name":"Novak","orcid":"0000-0002-2519-824X"},{"full_name":"Kollár, Richard","first_name":"Richard","last_name":"Kollár"}],"oa_version":"Submitted Version","quality_controlled":"1","project":[{"name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","grant_number":"618091","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","volume":205,"language":[{"iso":"eng"}],"issue":"1","file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:10:43Z","date_updated":"2020-07-14T12:44:37Z","file_name":"IST-2016-727-v1+1_SFC_Genetics_final.pdf","relation":"main_file","file_id":"4833","checksum":"7c8ab79cda1f92760bbbbe0f53175bfc","creator":"system","access_level":"open_access","file_size":361500}],"month":"01","has_accepted_license":"1","day":"01","doi":"10.1534/genetics.116.193946","page":"367 - 374","year":"2017","oa":1,"publication":"Genetics","intvolume":"       205","publist_id":"6188","scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000393677300025"]},"citation":{"ieee":"S. Novak and R. Kollár, “Spatial gene frequency waves under genotype dependent dispersal,” <i>Genetics</i>, vol. 205, no. 1. Genetics Society of America, pp. 367–374, 2017.","ama":"Novak S, Kollár R. Spatial gene frequency waves under genotype dependent dispersal. <i>Genetics</i>. 2017;205(1):367-374. doi:<a href=\"https://doi.org/10.1534/genetics.116.193946\">10.1534/genetics.116.193946</a>","chicago":"Novak, Sebastian, and Richard Kollár. “Spatial Gene Frequency Waves under Genotype Dependent Dispersal.” <i>Genetics</i>. Genetics Society of America, 2017. <a href=\"https://doi.org/10.1534/genetics.116.193946\">https://doi.org/10.1534/genetics.116.193946</a>.","ista":"Novak S, Kollár R. 2017. Spatial gene frequency waves under genotype dependent dispersal. Genetics. 205(1), 367–374.","apa":"Novak, S., &#38; Kollár, R. (2017). Spatial gene frequency waves under genotype dependent dispersal. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.116.193946\">https://doi.org/10.1534/genetics.116.193946</a>","mla":"Novak, Sebastian, and Richard Kollár. “Spatial Gene Frequency Waves under Genotype Dependent Dispersal.” <i>Genetics</i>, vol. 205, no. 1, Genetics Society of America, 2017, pp. 367–74, doi:<a href=\"https://doi.org/10.1534/genetics.116.193946\">10.1534/genetics.116.193946</a>.","short":"S. Novak, R. Kollár, Genetics 205 (2017) 367–374."},"date_updated":"2025-05-28T11:42:46Z","department":[{"_id":"NiBa"}],"title":"Spatial gene frequency waves under genotype dependent dispersal","publisher":"Genetics Society of America","date_published":"2017-01-01T00:00:00Z","file_date_updated":"2020-07-14T12:44:37Z","ddc":["576"],"isi":1,"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"}],"publication_status":"published"},{"intvolume":"        37","publist_id":"6182","publication":"Combinatorica","scopus_import":"1","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.","doi":"10.1007/s00493-016-3308-y","page":"887 - 910","day":"01","year":"2017","oa":1,"publisher":"Springer","date_published":"2017-10-01T00:00:00Z","title":"The Voronoi functional is maximized by the Delaunay triangulation in the plane","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_status":"published","isi":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000418056000005"]},"date_updated":"2023-09-20T11:23:53Z","department":[{"_id":"HeEd"}],"citation":{"apa":"Edelsbrunner, H., Glazyrin, A., Musin, O., &#38; Nikitenko, A. (2017). The Voronoi functional is maximized by the Delaunay triangulation in the plane. <i>Combinatorica</i>. Springer. <a href=\"https://doi.org/10.1007/s00493-016-3308-y\">https://doi.org/10.1007/s00493-016-3308-y</a>","chicago":"Edelsbrunner, Herbert, Alexey Glazyrin, Oleg Musin, and Anton Nikitenko. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” <i>Combinatorica</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00493-016-3308-y\">https://doi.org/10.1007/s00493-016-3308-y</a>.","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.","ama":"Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. The Voronoi functional is maximized by the Delaunay triangulation in the plane. <i>Combinatorica</i>. 2017;37(5):887-910. doi:<a href=\"https://doi.org/10.1007/s00493-016-3308-y\">10.1007/s00493-016-3308-y</a>","ieee":"H. Edelsbrunner, A. Glazyrin, O. Musin, and A. Nikitenko, “The Voronoi functional is maximized by the Delaunay triangulation in the plane,” <i>Combinatorica</i>, vol. 37, no. 5. Springer, pp. 887–910, 2017.","short":"H. Edelsbrunner, A. Glazyrin, O. Musin, A. Nikitenko, Combinatorica 37 (2017) 887–910.","mla":"Edelsbrunner, Herbert, et al. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” <i>Combinatorica</i>, vol. 37, no. 5, Springer, 2017, pp. 887–910, doi:<a href=\"https://doi.org/10.1007/s00493-016-3308-y\">10.1007/s00493-016-3308-y</a>."},"ec_funded":1,"publication_identifier":{"issn":["02099683"]},"status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1411.6337","open_access":"1"}],"date_created":"2018-12-11T11:50:32Z","type":"journal_article","_id":"1173","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":37,"month":"10","issue":"5","author":[{"orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Glazyrin, Alexey","last_name":"Glazyrin","first_name":"Alexey"},{"full_name":"Musin, Oleg","first_name":"Oleg","last_name":"Musin"},{"full_name":"Nikitenko, Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0659-3201","last_name":"Nikitenko","first_name":"Anton"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version"},{"article_number":"57","month":"03","article_processing_charge":"No","volume":66,"language":[{"iso":"eng"}],"oa_version":"Submitted Version","quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"author":[{"first_name":"Maciej","last_name":"Skórski","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej"}],"ec_funded":1,"conference":{"end_date":"2017-03-11","start_date":"2017-03-08","location":"Hannover, Germany","name":"STACS: Symposium on Theoretical Aspects of Computer Science"},"_id":"1174","type":"conference","date_created":"2018-12-11T11:50:32Z","status":"public","publication_identifier":{"issn":["18688969"]},"main_file_link":[{"open_access":"1","url":"http://drops.dagstuhl.de/opus/volltexte/2017/6976"}],"isi":1,"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 &quot;RT-bound&quot;, extracting secure keys with significantly smaller entropy loss. In turn Dodis and Yu showed that in squared-friendly applications one can directly use a &quot;weak&quot; key, which has only high entropy, as a secure key. In this paper we give sharp lower bounds on square security assuming security for &quot;weak&quot; 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_status":"published","title":"Lower bounds on key derivation for square-friendly applications","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2017-03-01T00:00:00Z","citation":{"short":"M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Skórski, Maciej. <i>Lower Bounds on Key Derivation for Square-Friendly Applications</i>. Vol. 66, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">10.4230/LIPIcs.STACS.2017.57</a>.","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.","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. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">https://doi.org/10.4230/LIPIcs.STACS.2017.57</a>","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:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">10.4230/LIPIcs.STACS.2017.57</a>","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.","chicago":"Skórski, Maciej. “Lower Bounds on Key Derivation for Square-Friendly Applications,” Vol. 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">https://doi.org/10.4230/LIPIcs.STACS.2017.57</a>."},"date_updated":"2023-09-20T11:23:15Z","department":[{"_id":"KrPi"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","alternative_title":["LIPIcs"],"external_id":{"isi":["000521077300057"]},"scopus_import":"1","intvolume":"        66","publist_id":"6180","oa":1,"year":"2017","day":"01","doi":"10.4230/LIPIcs.STACS.2017.57"},{"conference":{"location":"Berkeley, CA, United States","name":"ITCS: Innovations in Theoretical Computer Science","start_date":"2017-01-09","end_date":"2017-01-11"},"pubrep_id":"927","publication_identifier":{"issn":["18688969"]},"status":"public","type":"conference","_id":"1175","date_created":"2018-12-11T11:50:33Z","volume":67,"language":[{"iso":"eng"}],"file":[{"file_name":"IST-2018-927-v1+1_LIPIcs-ITCS-2017-38.pdf","date_updated":"2020-07-14T12:44:37Z","date_created":"2018-12-12T10:17:11Z","content_type":"application/pdf","file_size":557769,"access_level":"open_access","creator":"system","checksum":"dbc94810be07c2fb1945d5c2a6130e6c","file_id":"5263","relation":"main_file"}],"has_accepted_license":"1","month":"01","author":[{"first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"De Rezende, Susanna","last_name":"De Rezende","first_name":"Susanna"},{"full_name":"Nordstrom, Jakob","last_name":"Nordstrom","first_name":"Jakob"},{"first_name":"Marc","last_name":"Vinyals","full_name":"Vinyals, Marc"}],"oa_version":"Published Version","quality_controlled":"1","publist_id":"6179","intvolume":"        67","editor":[{"full_name":"Papadimitriou, Christos","first_name":"Christos","last_name":"Papadimitriou"}],"scopus_import":1,"day":"01","doi":"10.4230/LIPIcs.ITCS.2017.38","year":"2017","page":"38:1-38-21","oa":1,"title":"Cumulative space in black-white pebbling and resolution","date_published":"2017-01-01T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-07-14T12:44:37Z","ddc":["005","600"],"publication_status":"published","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."}],"alternative_title":["LIPIcs"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Alwen, Joel F., et al. <i>Cumulative Space in Black-White Pebbling and Resolution</i>. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">10.4230/LIPIcs.ITCS.2017.38</a>.","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.","apa":"Alwen, J. F., De Rezende, S., Nordstrom, J., &#38; 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. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">https://doi.org/10.4230/LIPIcs.ITCS.2017.38</a>","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. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">https://doi.org/10.4230/LIPIcs.ITCS.2017.38</a>.","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:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">10.4230/LIPIcs.ITCS.2017.38</a>"},"department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T06:48:51Z"},{"article_processing_charge":"No","language":[{"iso":"eng"}],"article_number":"7961977","month":"07","author":[{"last_name":"Alwen","first_name":"Joel F","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Blocki","first_name":"Jeremiah","full_name":"Blocki, Jeremiah"}],"oa_version":"Submitted Version","quality_controlled":"1","conference":{"name":"EuroS&P: European Symposium on Security and Privacy","location":"Paris, France","start_date":"2017-04-26","end_date":"2017-04-28"},"publication_identifier":{"isbn":["978-150905761-0"]},"status":"public","main_file_link":[{"url":"https://eprint.iacr.org/2016/759","open_access":"1"}],"_id":"1176","type":"conference","date_created":"2018-12-11T11:50:33Z","title":"Towards practical attacks on Argon2i and balloon hashing","date_published":"2017-07-03T00:00:00Z","publisher":"IEEE","isi":1,"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."}],"publication_status":"published","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000424197300011"]},"citation":{"short":"J.F. Alwen, J. Blocki, in:, IEEE, 2017.","mla":"Alwen, Joel F., and Jeremiah Blocki. <i>Towards Practical Attacks on Argon2i and Balloon Hashing</i>. 7961977, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/EuroSP.2017.47\">10.1109/EuroSP.2017.47</a>.","ista":"Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon hashing. EuroS&#38;P: European Symposium on Security and Privacy, 7961977.","ama":"Alwen JF, Blocki J. Towards practical attacks on Argon2i and balloon hashing. In: IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/EuroSP.2017.47\">10.1109/EuroSP.2017.47</a>","chicago":"Alwen, Joel F, and Jeremiah Blocki. “Towards Practical Attacks on Argon2i and Balloon Hashing.” IEEE, 2017. <a href=\"https://doi.org/10.1109/EuroSP.2017.47\">https://doi.org/10.1109/EuroSP.2017.47</a>.","apa":"Alwen, J. F., &#38; Blocki, J. (2017). Towards practical attacks on Argon2i and balloon hashing. Presented at the EuroS&#38;P: European Symposium on Security and Privacy, Paris, France: IEEE. <a href=\"https://doi.org/10.1109/EuroSP.2017.47\">https://doi.org/10.1109/EuroSP.2017.47</a>","ieee":"J. F. Alwen and J. Blocki, “Towards practical attacks on Argon2i and balloon hashing,” presented at the EuroS&#38;P: European Symposium on Security and Privacy, Paris, France, 2017."},"date_updated":"2023-09-20T11:22:25Z","department":[{"_id":"KrPi"}],"publist_id":"6178","scopus_import":"1","year":"2017","doi":"10.1109/EuroSP.2017.47","day":"03","oa":1},{"author":[{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej","last_name":"Skórski","first_name":"Maciej"}],"oa_version":"Submitted Version","quality_controlled":"1","volume":9985,"article_processing_charge":"No","language":[{"iso":"eng"}],"month":"01","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/808.pdf "}],"status":"public","type":"conference","_id":"1178","date_created":"2018-12-11T11:50:34Z","conference":{"name":"TCC: Theory of Cryptography Conference"},"alternative_title":["LNCS"],"external_id":{"isi":["000390176000007"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"M. Skórski, in:, Springer, 2017, pp. 159–179.","mla":"Skórski, Maciej. <i>Simulating Auxiliary Inputs, Revisited</i>. Vol. 9985, Springer, 2017, pp. 159–79, doi:<a href=\"https://doi.org/10.1007/978-3-662-53641-4_7\">10.1007/978-3-662-53641-4_7</a>.","apa":"Skórski, M. (2017). Simulating auxiliary inputs, revisited (Vol. 9985, pp. 159–179). Presented at the TCC: Theory of Cryptography Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-662-53641-4_7\">https://doi.org/10.1007/978-3-662-53641-4_7</a>","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. <a href=\"https://doi.org/10.1007/978-3-662-53641-4_7\">https://doi.org/10.1007/978-3-662-53641-4_7</a>.","ama":"Skórski M. Simulating auxiliary inputs, revisited. In: Vol 9985. Springer; 2017:159-179. doi:<a href=\"https://doi.org/10.1007/978-3-662-53641-4_7\">10.1007/978-3-662-53641-4_7</a>","ieee":"M. Skórski, “Simulating auxiliary inputs, revisited,” presented at the TCC: Theory of Cryptography Conference, 2017, vol. 9985, pp. 159–179."},"extern":"1","date_updated":"2023-09-20T11:21:57Z","title":"Simulating auxiliary inputs, revisited","date_published":"2017-01-01T00:00:00Z","publisher":"Springer","isi":1,"publication_status":"published","abstract":[{"lang":"eng","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 "}],"day":"01","doi":"10.1007/978-3-662-53641-4_7","page":"159 - 179","year":"2017","acknowledgement":"This work was supported by the National Science Center, Poland (2015/17/N/ST6/03564).","oa":1,"publist_id":"6176","intvolume":"      9985"},{"oa":1,"date_created":"2018-12-11T11:48:30Z","_id":"787","type":"conference","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.","year":"2017","day":"01","doi":"doi.org/10.1137/1.9781611974782.169","status":"public","page":"2560 - 2579","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.08032"}],"publist_id":"6869","conference":{"name":"SODA: Symposium on Discrete Algorithms"},"extern":"1","date_updated":"2023-02-23T13:19:13Z","oa_version":"None","citation":{"apa":"Alistarh, D.-A., Aspnes, J., Eisenstat, D., Rivest, R., &#38; Gelashvili, R. (2017). Time-space trade-offs in population protocols (pp. 2560–2579). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. <a href=\"https://doi.org/doi.org/10.1137/1.9781611974782.169\">https://doi.org/doi.org/10.1137/1.9781611974782.169</a>","chicago":"Alistarh, Dan-Adrian, James Aspnes, David Eisenstat, Ronald Rivest, and Rati Gelashvili. “Time-Space Trade-Offs in Population Protocols,” 2560–79. SIAM, 2017. <a href=\"https://doi.org/doi.org/10.1137/1.9781611974782.169\">https://doi.org/doi.org/10.1137/1.9781611974782.169</a>.","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.","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:<a href=\"https://doi.org/doi.org/10.1137/1.9781611974782.169\">doi.org/10.1137/1.9781611974782.169</a>","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.","short":"D.-A. Alistarh, J. Aspnes, D. Eisenstat, R. Rivest, R. Gelashvili, in:, SIAM, 2017, pp. 2560–2579.","mla":"Alistarh, Dan-Adrian, et al. <i>Time-Space Trade-Offs in Population Protocols</i>. SIAM, 2017, pp. 2560–79, doi:<a href=\"https://doi.org/doi.org/10.1137/1.9781611974782.169\">doi.org/10.1137/1.9781611974782.169</a>."},"author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"},{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"full_name":"Eisenstat, David","last_name":"Eisenstat","first_name":"David"},{"full_name":"Rivest, Ronald","first_name":"Ronald","last_name":"Rivest"},{"first_name":"Rati","last_name":"Gelashvili","full_name":"Gelashvili, Rati"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","publication_status":"published","abstract":[{"lang":"eng","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 &quot;leader&quot; 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."}],"date_published":"2017-01-01T00:00:00Z","language":[{"iso":"eng"}],"publisher":"SIAM","title":"Time-space trade-offs in population protocols"},{"oa":1,"day":"01","page":"155 - 171","doi":"10.1007/978-3-319-66799-7_11","year":"2017","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","scopus_import":"1","arxiv":1,"publist_id":"6868","citation":{"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.","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:<a href=\"https://doi.org/10.1007/978-3-319-66799-7_11\">10.1007/978-3-319-66799-7_11</a>","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. <a href=\"https://doi.org/10.1007/978-3-319-66799-7_11\">https://doi.org/10.1007/978-3-319-66799-7_11</a>.","apa":"Alistarh, D.-A., Dudek, B., Kosowski, A., Soloveichik, D., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-319-66799-7_11\">https://doi.org/10.1007/978-3-319-66799-7_11</a>","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.","mla":"Alistarh, Dan-Adrian, et al. <i>Robust Detection in Leak-Prone Population Protocols</i>. Vol. 10467 LNCS, Springer, 2017, pp. 155–71, doi:<a href=\"https://doi.org/10.1007/978-3-319-66799-7_11\">10.1007/978-3-319-66799-7_11</a>.","short":"D.-A. Alistarh, B. Dudek, A. Kosowski, D. Soloveichik, P. Uznański, in:, Springer, 2017, pp. 155–171."},"date_updated":"2022-03-18T12:48:02Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1706.09937"]},"alternative_title":["LNCS"],"abstract":[{"lang":"eng","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."}],"publication_status":"published","title":"Robust detection in leak-prone population protocols","date_published":"2017-01-01T00:00:00Z","publisher":"Springer","type":"conference","_id":"788","date_created":"2018-12-11T11:48:30Z","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1706.09937"}],"conference":{"name":"DNA Computing and Molecular Programming"},"oa_version":"None","quality_controlled":"1","author":[{"orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Dudek, Bartłomiej","first_name":"Bartłomiej","last_name":"Dudek"},{"full_name":"Kosowski, Adrian","first_name":"Adrian","last_name":"Kosowski"},{"full_name":"Soloveichik, David","first_name":"David","last_name":"Soloveichik"},{"full_name":"Uznański, Przemysław","first_name":"Przemysław","last_name":"Uznański"}],"month":"01","article_processing_charge":"No","volume":"10467 LNCS","language":[{"iso":"eng"}]}]