[{"day":"01","article_processing_charge":"No","scopus_import":"1","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: high-redshift","cosmology: observations","dark ages","reionization","first stars"],"date_published":"2017-03-01T00:00:00Z","publication":"Monthly Notices of the Royal Astronomical Society","citation":{"ama":"Matthee JJ, Sobral D, Best P, et al. The production and escape of Lyman-Continuum radiation from star-forming galaxies at z ∼ 2 and their redshift evolution. Monthly Notices of the Royal Astronomical Society. 2017;465(3):3637-3655. doi:10.1093/mnras/stw2973","apa":"Matthee, J. J., Sobral, D., Best, P., Khostovan, A. A., Oteo, I., Bouwens, R., & Röttgering, H. (2017). The production and escape of Lyman-Continuum radiation from star-forming galaxies at z ∼ 2 and their redshift evolution. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stw2973","ieee":"J. J. Matthee et al., “The production and escape of Lyman-Continuum radiation from star-forming galaxies at z ∼ 2 and their redshift evolution,” Monthly Notices of the Royal Astronomical Society, vol. 465, no. 3. Oxford University Press, pp. 3637–3655, 2017.","ista":"Matthee JJ, Sobral D, Best P, Khostovan AA, Oteo I, Bouwens R, Röttgering H. 2017. The production and escape of Lyman-Continuum radiation from star-forming galaxies at z ∼ 2 and their redshift evolution. Monthly Notices of the Royal Astronomical Society. 465(3), 3637–3655.","short":"J.J. Matthee, D. Sobral, P. Best, A.A. Khostovan, I. Oteo, R. Bouwens, H. Röttgering, Monthly Notices of the Royal Astronomical Society 465 (2017) 3637–3655.","mla":"Matthee, Jorryt J., et al. “The Production and Escape of Lyman-Continuum Radiation from Star-Forming Galaxies at z ∼ 2 and Their Redshift Evolution.” Monthly Notices of the Royal Astronomical Society, vol. 465, no. 3, Oxford University Press, 2017, pp. 3637–55, doi:10.1093/mnras/stw2973.","chicago":"Matthee, Jorryt J, David Sobral, Philip Best, Ali Ahmad Khostovan, Iván Oteo, Rychard Bouwens, and Huub Röttgering. “The Production and Escape of Lyman-Continuum Radiation from Star-Forming Galaxies at z ∼ 2 and Their Redshift Evolution.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2017. https://doi.org/10.1093/mnras/stw2973."},"article_type":"original","page":"3637-3655","abstract":[{"lang":"eng","text":"We study the production rate of ionizing photons of a sample of 588 Hα emitters (HAEs) and 160 Lyman-α emitters (LAEs) at z = 2.2 in the COSMOS field in order to assess the implied emissivity from galaxies, based on their ultraviolet (UV) luminosity. By exploring the rest-frame Lyman Continuum (LyC) with GALEX/NUV data, we find fesc < 2.8 (6.4) per cent through median (mean) stacking. By combining the Hα luminosity density with intergalactic medium emissivity measurements from absorption studies, we find a globally averaged 〈fesc〉 of 5.9+14.5−4.2 per cent at z = 2.2 if we assume HAEs are the only source of ionizing photons. We find similarly low values of the global 〈fesc〉 at z ≈ 3–5, also ruling out a high 〈fesc〉 at z < 5. These low escape fractions allow us to measure ξion, the number of produced ionizing photons per unit UV luminosity, and investigate how this depends on galaxy properties. We find a typical ξion ≈ 1024.77 ± 0.04 Hz erg−1 for HAEs and ξion ≈ 1025.14 ± 0.09 Hz erg−1 for LAEs. LAEs and low-mass HAEs at z = 2.2 show similar values of ξion as typically assumed in the reionization era, while the typical HAE is three times less ionizing. Due to an increasing ξion with increasing EW(Hα), ξion likely increases with redshift. This evolution alone is fully in line with the observed evolution of ξion between z ≈ 2 and 5, indicating a typical value of ξion ≈ 1025.4 Hz erg−1 in the reionization era."}],"issue":"3","type":"journal_article","oa_version":"Preprint","_id":"11564","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The production and escape of Lyman-Continuum radiation from star-forming galaxies at z ∼ 2 and their redshift evolution","status":"public","intvolume":" 465","month":"03","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"doi":"10.1093/mnras/stw2973","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1605.08782"]},"main_file_link":[{"url":"https://arxiv.org/abs/1605.08782","open_access":"1"}],"quality_controlled":"1","extern":"1","author":[{"first_name":"Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J"},{"full_name":"Sobral, David","first_name":"David","last_name":"Sobral"},{"full_name":"Best, Philip","first_name":"Philip","last_name":"Best"},{"first_name":"Ali Ahmad","last_name":"Khostovan","full_name":"Khostovan, Ali Ahmad"},{"last_name":"Oteo","first_name":"Iván","full_name":"Oteo, Iván"},{"full_name":"Bouwens, Rychard","first_name":"Rychard","last_name":"Bouwens"},{"last_name":"Röttgering","first_name":"Huub","full_name":"Röttgering, Huub"}],"date_updated":"2022-08-19T07:53:04Z","date_created":"2022-07-12T12:12:14Z","volume":465,"year":"2017","acknowledgement":"We thank the referee for the many helpful and constructive comments which have significantly improved this paper. 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). PNB is grateful for support from the UK STFC via grant ST/M001229/1. IO acknowledges support from the European Research Council in the form of the Advanced Investigator Programme, 321302, COSMICISM. The authors thank Andreas Faisst, Michael Rutkowski and Andreas Sandberg for answering questions related to this work and Daniel Schaerer and Mark Dijkstra for discussions. We acknowledge the work that has been done by both the COSMOS team in assembling such large, state-of-the-art multi-wavelength data set, as this has been crucial for the results presented in this paper. We have benefited greatly from the public available programming language PYTHON, including the NUMPY, MATPLOTLIB, PYFITS, SCIPY (Jones et al. 2001; Hunter 2007; Van Der Walt, Colbert & Varoquaux 2011) and ASTROPY (Astropy Collaboration et al. 2013) packages, the astronomical imaging tools SEXTRACTOR and SWARP (Bertin & Arnouts 1996;\r\nBertin 2010) and the TOPCAT analysis program (Taylor 2013).","publication_status":"published","publisher":"Oxford University Press"},{"type":"journal_article","abstract":[{"lang":"eng","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."}],"issue":"3","_id":"11567","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","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","intvolume":" 471","oa_version":"Preprint","scopus_import":"1","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"],"day":"01","article_processing_charge":"No","publication":"Monthly Notices of the Royal Astronomical Society","citation":{"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. Monthly Notices of the Royal Astronomical Society. 2017;471(3):2575-2586. doi:10.1093/mnras/stx1713","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,” Monthly Notices of the Royal Astronomical Society, vol. 471, no. 3. Oxford University Press, pp. 2575–2586, 2017.","apa":"Stroe, A., Sobral, D., Matthee, J. J., 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. Oxford University Press. https://doi.org/10.1093/mnras/stx1713","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.","short":"A. Stroe, D. Sobral, J.J. Matthee, J. Calhau, I. Oteo, Monthly Notices of the Royal Astronomical Society 471 (2017) 2575–2586.","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.” Monthly Notices of the Royal Astronomical Society, vol. 471, no. 3, Oxford University Press, 2017, pp. 2575–86, doi:10.1093/mnras/stx1713.","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.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2017. https://doi.org/10.1093/mnras/stx1713."},"article_type":"original","page":"2575-2586","date_published":"2017-11-01T00:00:00Z","extern":"1","year":"2017","publication_status":"published","publisher":"Oxford University Press","author":[{"first_name":"Andra","last_name":"Stroe","full_name":"Stroe, Andra"},{"first_name":"David","last_name":"Sobral","full_name":"Sobral, David"},{"full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","first_name":"Jorryt J"},{"first_name":"João","last_name":"Calhau","full_name":"Calhau, João"},{"first_name":"Ivan","last_name":"Oteo","full_name":"Oteo, Ivan"}],"date_created":"2022-07-12T12:54:57Z","date_updated":"2022-08-19T08:02:04Z","volume":471,"month":"11","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"oa":1,"external_id":{"arxiv":["1703.10169"]},"main_file_link":[{"url":"https://arxiv.org/abs/1703.10169","open_access":"1"}],"quality_controlled":"1","doi":"10.1093/mnras/stx1713","language":[{"iso":"eng"}]},{"extern":"1","acknowledgement":"We thank the anonymous referee for their comments. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. JM thanks David Sobral for useful discussions and help with fitting routines and Jonas Chavez Montero and Ying Zu for providing data. We thank PRACE for the access to the Curie facility in France. We have used the DiRAC system which is a part of National E-Infrastructure at Durham University, operated by the Institute for Computational Cosmology on behalf of the STFC DiRAC HPC Facility (www.dirac.ac.uk); the equipment was funded by BIS National E-infrastructure capital grant ST/K00042X/1, STFC capital grant ST/H008519/1, STFC DiRAC Operations grant ST/K003267/1 and Durham University. The study was sponsored by the Dutch National Computing Facilities Foundation (NCF) for the use of supercomputer facilities, with financial support from the Netherlands Organisation for Scientific Research (NWO), through VICI grant 639.043.409, and the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013)/ERC Grant agreement 278594- GasAroundGalaxies, and from the Belgian Science Policy Office ([AP P7/08 CHARM]). We have benefited greatly from the public available programming language PYTHON, including the NUMPY, MATPLOTLIB, PYFITS, SCIPY, H5PY and RPY2 packages, and the TOPCAT analysis program (Taylor 2005).","year":"2017","publisher":"Oxford University Press","publication_status":"published","author":[{"id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X","first_name":"Jorryt J","last_name":"Matthee","full_name":"Matthee, Jorryt J"},{"first_name":"Joop","last_name":"Schaye","full_name":"Schaye, Joop"},{"full_name":"Crain, Robert A.","first_name":"Robert A.","last_name":"Crain"},{"full_name":"Schaller, Matthieu","last_name":"Schaller","first_name":"Matthieu"},{"full_name":"Bower, Richard","first_name":"Richard","last_name":"Bower"},{"first_name":"Tom","last_name":"Theuns","full_name":"Theuns, Tom"}],"volume":465,"date_updated":"2022-08-19T07:56:07Z","date_created":"2022-07-12T12:25:08Z","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"month":"02","main_file_link":[{"url":"https://arxiv.org/abs/1608.08218","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1608.08218"]},"quality_controlled":"1","doi":"10.1093/mnras/stw2884","language":[{"iso":"eng"}],"type":"journal_article","issue":"2","abstract":[{"text":"We use the hydrodynamical EAGLE simulation to study the magnitude and origin of the scatter in the stellar mass–halo mass relation for central galaxies. We separate cause and effect by correlating stellar masses in the baryonic simulation with halo properties in a matched dark matter only (DMO) simulation. The scatter in stellar mass increases with redshift and decreases with halo mass. At z = 0.1, it declines from 0.25 dex at M200, DMO ≈ 1011 M⊙ to 0.12 dex at M200, DMO ≈ 1013 M⊙, but the trend is weak above 1012 M⊙. For M200, DMO < 1012.5 M⊙ up to 0.04 dex of the scatter is due to scatter in the halo concentration. At fixed halo mass, a larger stellar mass corresponds to a more concentrated halo. This is likely because higher concentrations imply earlier formation times and hence more time for accretion and star formation, and/or because feedback is less efficient in haloes with higher binding energies. The maximum circular velocity, Vmax, DMO, and binding energy are therefore more fundamental properties than halo mass, meaning that they are more accurate predictors of stellar mass, and we provide fitting formulae for their relations with stellar mass. However, concentration alone cannot explain the total scatter in the Mstar−M200,DMO relation, and it does not explain the scatter in Mstar–Vmax, DMO. Halo spin, sphericity, triaxiality, substructure and environment are also not responsible for the remaining scatter, which thus could be due to more complex halo properties or non-linear/stochastic baryonic effects.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11565","intvolume":" 465","title":"The origin of scatter in the stellar mass–halo mass relation of central galaxies in the EAGLE simulation","status":"public","oa_version":"Preprint","scopus_import":"1","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: formation","galaxies: haloes","cosmology: theory"],"article_processing_charge":"No","day":"01","citation":{"mla":"Matthee, Jorryt J., et al. “The Origin of Scatter in the Stellar Mass–Halo Mass Relation of Central Galaxies in the EAGLE Simulation.” Monthly Notices of the Royal Astronomical Society, vol. 465, no. 2, Oxford University Press, 2017, pp. 2381–96, doi:10.1093/mnras/stw2884.","short":"J.J. Matthee, J. Schaye, R.A. Crain, M. Schaller, R. Bower, T. Theuns, Monthly Notices of the Royal Astronomical Society 465 (2017) 2381–2396.","chicago":"Matthee, Jorryt J, Joop Schaye, Robert A. Crain, Matthieu Schaller, Richard Bower, and Tom Theuns. “The Origin of Scatter in the Stellar Mass–Halo Mass Relation of Central Galaxies in the EAGLE Simulation.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2017. https://doi.org/10.1093/mnras/stw2884.","ama":"Matthee JJ, Schaye J, Crain RA, Schaller M, Bower R, Theuns T. The origin of scatter in the stellar mass–halo mass relation of central galaxies in the EAGLE simulation. Monthly Notices of the Royal Astronomical Society. 2017;465(2):2381-2396. doi:10.1093/mnras/stw2884","ista":"Matthee JJ, Schaye J, Crain RA, Schaller M, Bower R, Theuns T. 2017. The origin of scatter in the stellar mass–halo mass relation of central galaxies in the EAGLE simulation. Monthly Notices of the Royal Astronomical Society. 465(2), 2381–2396.","ieee":"J. J. Matthee, J. Schaye, R. A. Crain, M. Schaller, R. Bower, and T. Theuns, “The origin of scatter in the stellar mass–halo mass relation of central galaxies in the EAGLE simulation,” Monthly Notices of the Royal Astronomical Society, vol. 465, no. 2. Oxford University Press, pp. 2381–2396, 2017.","apa":"Matthee, J. J., Schaye, J., Crain, R. A., Schaller, M., Bower, R., & Theuns, T. (2017). The origin of scatter in the stellar mass–halo mass relation of central galaxies in the EAGLE simulation. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stw2884"},"publication":"Monthly Notices of the Royal Astronomical Society","page":"2381-2396","article_type":"original","date_published":"2017-02-01T00:00:00Z"},{"publication_identifier":{"issn":["0035-8711","1365-2966"]},"month":"10","doi":"10.1093/mnras/stx1569","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1702.04721"}],"external_id":{"arxiv":["1702.04721"]},"oa":1,"quality_controlled":"1","extern":"1","author":[{"full_name":"Matthee, Jorryt J","first_name":"Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X"},{"full_name":"Sobral, David","first_name":"David","last_name":"Sobral"},{"last_name":"Best","first_name":"Philip","full_name":"Best, Philip"},{"full_name":"Smail, Ian","first_name":"Ian","last_name":"Smail"},{"first_name":"Fuyan","last_name":"Bian","full_name":"Bian, Fuyan"},{"last_name":"Darvish","first_name":"Behnam","full_name":"Darvish, Behnam"},{"last_name":"Röttgering","first_name":"Huub","full_name":"Röttgering, Huub"},{"full_name":"Fan, Xiaohui","last_name":"Fan","first_name":"Xiaohui"}],"volume":471,"date_created":"2022-07-12T11:01:35Z","date_updated":"2022-08-19T07:15:14Z","year":"2017","publisher":"Oxford University Press","publication_status":"published","article_processing_charge":"No","day":"01","scopus_import":"1","keyword":["Space and Planetary Science","Astronomy and Astrophysics galaxies","active","galaxies","evolution","galaxies","high-redshift","galaxies","luminosity function","mass function","galaxies: star formation"],"date_published":"2017-10-01T00:00:00Z","citation":{"chicago":"Matthee, Jorryt J, David Sobral, Philip Best, Ian Smail, Fuyan Bian, Behnam Darvish, Huub Röttgering, and Xiaohui Fan. “Boötes-HiZELS: An Optical to near-Infrared Survey of Emission-Line Galaxies at z = 0.4–4.7.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2017. https://doi.org/10.1093/mnras/stx1569.","short":"J.J. Matthee, D. Sobral, P. Best, I. Smail, F. Bian, B. Darvish, H. Röttgering, X. Fan, Monthly Notices of the Royal Astronomical Society 471 (2017) 629–649.","mla":"Matthee, Jorryt J., et al. “Boötes-HiZELS: An Optical to near-Infrared Survey of Emission-Line Galaxies at z = 0.4–4.7.” Monthly Notices of the Royal Astronomical Society, vol. 471, no. 1, Oxford University Press, 2017, pp. 629–49, doi:10.1093/mnras/stx1569.","ieee":"J. J. Matthee et al., “Boötes-HiZELS: An optical to near-infrared survey of emission-line galaxies at z = 0.4–4.7,” Monthly Notices of the Royal Astronomical Society, vol. 471, no. 1. Oxford University Press, pp. 629–649, 2017.","apa":"Matthee, J. J., Sobral, D., Best, P., Smail, I., Bian, F., Darvish, B., … Fan, X. (2017). Boötes-HiZELS: An optical to near-infrared survey of emission-line galaxies at z = 0.4–4.7. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stx1569","ista":"Matthee JJ, Sobral D, Best P, Smail I, Bian F, Darvish B, Röttgering H, Fan X. 2017. Boötes-HiZELS: An optical to near-infrared survey of emission-line galaxies at z = 0.4–4.7. Monthly Notices of the Royal Astronomical Society. 471(1), 629–649.","ama":"Matthee JJ, Sobral D, Best P, et al. Boötes-HiZELS: An optical to near-infrared survey of emission-line galaxies at z = 0.4–4.7. Monthly Notices of the Royal Astronomical Society. 2017;471(1):629-649. doi:10.1093/mnras/stx1569"},"publication":"Monthly Notices of the Royal Astronomical Society","page":"629-649","article_type":"original","issue":"1","abstract":[{"lang":"eng","text":"We present a sample of ∼1000 emission-line galaxies at z = 0.4–4.7 from the ∼0.7deg2 High-z Emission-Line Survey in the Boötes field identified with a suite of six narrow-band filters at ≈0.4–2.1 μm. These galaxies have been selected on their Ly α (73), [O II] (285), H β/[O III] (387) or H α (362) emission line, and have been classified with optical to near-infrared colours. A subsample of 98 sources have reliable redshifts from multiple narrow-band (e.g. [O II]–H α) detections and/or spectroscopy. In this survey paper, we present the observations, selection and catalogues of emitters. We measure number densities of Ly α, [O II], H β/[O III] and H α and confirm strong luminosity evolution in star-forming galaxies from z ∼ 0.4 to ∼5, in agreement with previous results. To demonstrate the usefulness of dual-line emitters, we use the sample of dual [O II]–H α emitters to measure the observed [O II]/H α ratio at z = 1.47. The observed [O II]/H α ratio increases significantly from 0.40 ± 0.01 at z = 0.1 to 0.52 ± 0.05 at z = 1.47, which we attribute to either decreasing dust attenuation with redshift, or due to a bias in the (typically) fibre measurements in the local Universe that only measure the central kpc regions. At the bright end, we find that both the H α and Ly α number densities at z ≈ 2.2 deviate significantly from a Schechter form, following a power law. We show that this is driven entirely by an increasing X-ray/active galactic nucleus fraction with line luminosity, which reaches ≈100 per cent at line luminosities L ≳ 3 × 1044 erg s−1."}],"type":"journal_article","oa_version":"Preprint","_id":"11561","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 471","title":"Boötes-HiZELS: An optical to near-infrared survey of emission-line galaxies at z = 0.4–4.7","status":"public"},{"issue":"1","abstract":[{"lang":"eng","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."}],"type":"journal_article","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11572","intvolume":" 472","title":"Spectroscopic properties of luminous Ly α emitters at z ≈ 6–7 and comparison to the Lyman-break population","status":"public","article_processing_charge":"No","day":"01","scopus_import":"1","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution – galaxies: high-redshift","dark ages","reionization","first stars","cosmology: observations"],"date_published":"2017-11-01T00:00:00Z","citation":{"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. Monthly Notices of the Royal Astronomical Society. 2017;472(1):772-787. doi:10.1093/mnras/stx2061","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.","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. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stx2061","ieee":"J. J. Matthee et al., “Spectroscopic properties of luminous Ly α emitters at z ≈ 6–7 and comparison to the Lyman-break population,” Monthly Notices of the Royal Astronomical Society, 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.” Monthly Notices of the Royal Astronomical Society, vol. 472, no. 1, Oxford University Press, 2017, pp. 772–87, doi:10.1093/mnras/stx2061.","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.","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.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2017. https://doi.org/10.1093/mnras/stx2061."},"publication":"Monthly Notices of the Royal Astronomical Society","page":"772-787","article_type":"original","extern":"1","author":[{"last_name":"Matthee","first_name":"Jorryt J","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","full_name":"Matthee, Jorryt J"},{"full_name":"Sobral, David","first_name":"David","last_name":"Sobral"},{"first_name":"Behnam","last_name":"Darvish","full_name":"Darvish, Behnam"},{"full_name":"Santos, Sérgio","last_name":"Santos","first_name":"Sérgio"},{"full_name":"Mobasher, Bahram","first_name":"Bahram","last_name":"Mobasher"},{"full_name":"Paulino-Afonso, Ana","first_name":"Ana","last_name":"Paulino-Afonso"},{"last_name":"Röttgering","first_name":"Huub","full_name":"Röttgering, Huub"},{"first_name":"Lara","last_name":"Alegre","full_name":"Alegre, Lara"}],"volume":472,"date_updated":"2022-08-19T08:05:37Z","date_created":"2022-07-13T09:47:39Z","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).","year":"2017","publisher":"Oxford University Press","publication_status":"published","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"month":"11","doi":"10.1093/mnras/stx2061","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1706.06591","open_access":"1"}],"external_id":{"arxiv":["1706.06591"]},"quality_controlled":"1"},{"language":[{"iso":"eng"}],"doi":"10.1093/mnras/stx1366","quality_controlled":"1","external_id":{"arxiv":["1704.06263"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.06263"}],"oa":1,"publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"month":"10","volume":471,"date_created":"2022-07-13T10:03:01Z","date_updated":"2022-08-19T08:07:31Z","author":[{"full_name":"Turner, O. J.","first_name":"O. J.","last_name":"Turner"},{"full_name":"Cirasuolo, M.","last_name":"Cirasuolo","first_name":"M."},{"first_name":"C. M.","last_name":"Harrison","full_name":"Harrison, C. M."},{"full_name":"McLure, R. J.","last_name":"McLure","first_name":"R. J."},{"full_name":"Dunlop, J. S.","first_name":"J. S.","last_name":"Dunlop"},{"last_name":"Swinbank","first_name":"A. M.","full_name":"Swinbank, A. M."},{"last_name":"Johnson","first_name":"H. L.","full_name":"Johnson, H. L."},{"full_name":"Sobral, D.","first_name":"D.","last_name":"Sobral"},{"full_name":"Matthee, Jorryt J","last_name":"Matthee","first_name":"Jorryt J","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720"},{"last_name":"Sharples","first_name":"R. M.","full_name":"Sharples, R. M."}],"publisher":"Oxford University Press","publication_status":"published","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).","year":"2017","extern":"1","date_published":"2017-10-01T00:00:00Z","page":"1280-1320","article_type":"original","citation":{"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.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2017. https://doi.org/10.1093/mnras/stx1366.","mla":"Turner, O. J., et al. “The KMOS Deep Survey (KDS) – I. Dynamical Measurements of Typical Star-Forming Galaxies at z ≃ 3.5.” Monthly Notices of the Royal Astronomical Society, vol. 471, no. 2, Oxford University Press, 2017, pp. 1280–320, doi:10.1093/mnras/stx1366.","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.","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.","ieee":"O. J. Turner et al., “The KMOS Deep Survey (KDS) – I. Dynamical measurements of typical star-forming galaxies at z ≃ 3.5,” Monthly Notices of the Royal Astronomical Society, vol. 471, no. 2. Oxford University Press, pp. 1280–1320, 2017.","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. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stx1366","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. Monthly Notices of the Royal Astronomical Society. 2017;471(2):1280-1320. doi:10.1093/mnras/stx1366"},"publication":"Monthly Notices of the Royal Astronomical Society","article_processing_charge":"No","day":"01","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: high-redshift","galaxies: kinematics and dynamics"],"scopus_import":"1","oa_version":"Preprint","intvolume":" 471","title":"The KMOS Deep Survey (KDS) – I. Dynamical measurements of typical star-forming galaxies at z ≃ 3.5","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11573","issue":"2","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"}],"type":"journal_article"},{"article_number":"1711.02890","type":"preprint","abstract":[{"lang":"eng","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."}],"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11633","year":"2017","title":"FliPer: Checking the reliability of global seismic parameters from automatic pipelines","status":"public","publication_status":"submitted","author":[{"full_name":"Bugnet, Lisa Annabelle","last_name":"Bugnet","first_name":"Lisa Annabelle","orcid":"0000-0003-0142-4000","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"first_name":"R. A.","last_name":"Garcia","full_name":"Garcia, R. A."},{"full_name":"Davies, G. R.","last_name":"Davies","first_name":"G. R."},{"full_name":"Mathur, S.","first_name":"S.","last_name":"Mathur"},{"full_name":"Corsaro, E.","first_name":"E.","last_name":"Corsaro"}],"date_updated":"2022-08-22T08:45:42Z","date_created":"2022-07-21T07:13:13Z","oa_version":"Preprint","keyword":["asteroseismology - methods","data analysis - stars","oscillations"],"day":"08","month":"11","article_processing_charge":"No","publication":"arXiv","oa":1,"external_id":{"arxiv":["1711.02890"]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1711.02890","open_access":"1"}],"citation":{"mla":"Bugnet, Lisa Annabelle, et al. “FliPer: Checking the Reliability of Global Seismic Parameters from Automatic Pipelines.” ArXiv, 1711.02890, doi:10.48550/arXiv.1711.02890.","short":"L.A. Bugnet, R.A. Garcia, G.R. Davies, S. Mathur, E. Corsaro, ArXiv (n.d.).","chicago":"Bugnet, Lisa Annabelle, R. A. Garcia, G. R. Davies, S. Mathur, and E. Corsaro. “FliPer: Checking the Reliability of Global Seismic Parameters from Automatic Pipelines.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1711.02890.","ama":"Bugnet LA, Garcia RA, Davies GR, Mathur S, Corsaro E. FliPer: Checking the reliability of global seismic parameters from automatic pipelines. arXiv. doi:10.48550/arXiv.1711.02890","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.","apa":"Bugnet, L. A., Garcia, R. A., Davies, G. R., Mathur, S., & Corsaro, E. (n.d.). FliPer: Checking the reliability of global seismic parameters from automatic pipelines. arXiv. https://doi.org/10.48550/arXiv.1711.02890","ieee":"L. A. Bugnet, R. A. Garcia, G. R. Davies, S. Mathur, and E. Corsaro, “FliPer: Checking the reliability of global seismic parameters from automatic pipelines,” arXiv. ."},"date_published":"2017-11-08T00:00:00Z","doi":"10.48550/arXiv.1711.02890","language":[{"iso":"eng"}]},{"extern":"1","author":[{"first_name":"Di","last_name":"Wang","full_name":"Wang, Di"},{"full_name":"Fountoulakis, Kimon","first_name":"Kimon","last_name":"Fountoulakis"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Mahoney, Michael W.","last_name":"Mahoney","first_name":"Michael W."},{"full_name":"Rao , Satish","first_name":" Satish","last_name":"Rao "}],"date_updated":"2023-02-09T09:15:31Z","date_created":"2022-07-25T13:59:21Z","volume":70,"year":"2017","publication_status":"published","publisher":"ML Research Press","month":"09","publication_identifier":{"eissn":["2640-3498"]},"conference":{"end_date":"2017-08-11","location":"Sydney, Australia","start_date":"2017-08-06","name":"International Conference on Machine Learning"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["1706.05826"]},"oa":1,"main_file_link":[{"url":"http://proceedings.mlr.press/v70/wang17b/wang17b.pdf","open_access":"1"}],"quality_controlled":"1","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"}],"type":"conference","alternative_title":["PMLR"],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11651","title":"Capacity releasing diffusion for speed and locality","status":"public","intvolume":" 70","day":"01","article_processing_charge":"No","date_published":"2017-09-01T00:00:00Z","publication":"Proceedings of the 34th International Conference on Machine Learning","citation":{"chicago":"Wang, Di, Kimon Fountoulakis, Monika H Henzinger, Michael W. Mahoney, and Satish Rao . “Capacity Releasing Diffusion for Speed and Locality.” In Proceedings of the 34th International Conference on Machine Learning, 70:3598–3607. ML Research Press, 2017.","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.” Proceedings of the 34th International Conference on Machine Learning, vol. 70, ML Research Press, 2017, pp. 3598–607.","ieee":"D. Wang, K. Fountoulakis, M. H. Henzinger, M. W. Mahoney, and Satish Rao , “Capacity releasing diffusion for speed and locality,” in Proceedings of the 34th International Conference on Machine Learning, Sydney, Australia, 2017, vol. 70, pp. 3598–3607.","apa":"Wang, D., Fountoulakis, K., Henzinger, M. H., Mahoney, M. W., & Rao , Satish. (2017). Capacity releasing diffusion for speed and locality. In Proceedings of the 34th International Conference on Machine Learning (Vol. 70, pp. 3598–3607). Sydney, Australia: ML Research Press.","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.","ama":"Wang D, Fountoulakis K, Henzinger MH, Mahoney MW, Rao Satish. Capacity releasing diffusion for speed and locality. In: Proceedings of the 34th International Conference on Machine Learning. Vol 70. ML Research Press; 2017:3598-3607."},"page":"3598-3607"},{"date_updated":"2022-09-09T11:57:42Z","date_created":"2022-07-27T11:37:23Z","volume":13,"author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"publication_status":"published","publisher":"Association for Computing Machinery","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.","year":"2017","extern":"1","article_number":"51","language":[{"iso":"eng"}],"doi":"10.1145/3146550","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1512.08147","open_access":"1"}],"external_id":{"arxiv":["1512.08147"]},"oa":1,"month":"10","publication_identifier":{"issn":["1549-6325"],"eissn":["1549-6333"]},"oa_version":"Preprint","status":"public","title":"Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks","intvolume":" 13","_id":"11665","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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"}],"issue":"4","type":"journal_article","date_published":"2017-10-01T00:00:00Z","article_type":"original","publication":"ACM Transactions on Algorithms","citation":{"mla":"Henzinger, Monika H., et al. “Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.” ACM Transactions on Algorithms, vol. 13, no. 4, 51, Association for Computing Machinery, 2017, doi:10.1145/3146550.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, ACM Transactions on Algorithms 13 (2017).","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.” ACM Transactions on Algorithms. Association for Computing Machinery, 2017. https://doi.org/10.1145/3146550.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. ACM Transactions on Algorithms. 2017;13(4). doi:10.1145/3146550","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., & Nanongkai, D. (2017). Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3146550","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks,” ACM Transactions on Algorithms, vol. 13, no. 4. Association for Computing Machinery, 2017."},"day":"01","article_processing_charge":"No","scopus_import":"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.","year":"2017","publication_status":"published","publisher":"Springer Nature","author":[{"last_name":"Dvořák","first_name":"Wolfgang","full_name":"Dvořák, Wolfgang"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"first_name":"David P.","last_name":"Williamson","full_name":"Williamson, David P."}],"date_updated":"2022-09-12T08:58:16Z","date_created":"2022-07-27T14:37:24Z","volume":77,"extern":"1","oa":1,"external_id":{"arxiv":["1611.05753"]},"main_file_link":[{"url":"https://arxiv.org/abs/1611.05753","open_access":"1"}],"quality_controlled":"1","doi":"10.1007/s00453-015-0066-y","language":[{"iso":"eng"}],"month":"01","publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11676","status":"public","title":"Maximizing a submodular function with viability constraints","intvolume":" 77","oa_version":"Preprint","type":"journal_article","abstract":[{"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.","lang":"eng"}],"issue":"1","publication":"Algorithmica","citation":{"ama":"Dvořák W, Henzinger MH, Williamson DP. Maximizing a submodular function with viability constraints. Algorithmica. 2017;77(1):152-172. doi:10.1007/s00453-015-0066-y","ista":"Dvořák W, Henzinger MH, Williamson DP. 2017. Maximizing a submodular function with viability constraints. Algorithmica. 77(1), 152–172.","apa":"Dvořák, W., Henzinger, M. H., & Williamson, D. P. (2017). Maximizing a submodular function with viability constraints. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-015-0066-y","ieee":"W. Dvořák, M. H. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” Algorithmica, vol. 77, no. 1. Springer Nature, pp. 152–172, 2017.","mla":"Dvořák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.” Algorithmica, vol. 77, no. 1, Springer Nature, 2017, pp. 152–72, doi:10.1007/s00453-015-0066-y.","short":"W. Dvořák, M.H. Henzinger, D.P. Williamson, Algorithmica 77 (2017) 152–172.","chicago":"Dvořák, Wolfgang, Monika H Henzinger, and David P. Williamson. “Maximizing a Submodular Function with Viability Constraints.” Algorithmica. Springer Nature, 2017. https://doi.org/10.1007/s00453-015-0066-y."},"article_type":"original","page":"152-172","date_published":"2017-01-01T00:00:00Z","scopus_import":"1","keyword":["Approximation algorithms","Submodular functions","Phylogenetic diversity","Viability constraints"],"day":"01","article_processing_charge":"No"},{"license":"https://creativecommons.org/licenses/by/4.0/","publist_id":"6179","file_date_updated":"2020-07-14T12:44:37Z","volume":67,"date_updated":"2021-01-12T06:48:51Z","date_created":"2018-12-11T11:50:33Z","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F","full_name":"Alwen, Joel F"},{"first_name":"Susanna","last_name":"De Rezende","full_name":"De Rezende, Susanna"},{"full_name":"Nordstrom, Jakob","last_name":"Nordstrom","first_name":"Jakob"},{"full_name":"Vinyals, Marc","first_name":"Marc","last_name":"Vinyals"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrPi"}],"editor":[{"first_name":"Christos","last_name":"Papadimitriou","full_name":"Papadimitriou, Christos"}],"publication_status":"published","year":"2017","publication_identifier":{"issn":["18688969"]},"month":"01","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.ITCS.2017.38","conference":{"name":"ITCS: Innovations in Theoretical Computer Science","location":"Berkeley, CA, United States","start_date":"2017-01-09","end_date":"2017-01-11"},"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"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"],"type":"conference","file":[{"relation":"main_file","file_id":"5263","date_created":"2018-12-12T10:17:11Z","date_updated":"2020-07-14T12:44:37Z","checksum":"dbc94810be07c2fb1945d5c2a6130e6c","file_name":"IST-2018-927-v1+1_LIPIcs-ITCS-2017-38.pdf","access_level":"open_access","file_size":557769,"content_type":"application/pdf","creator":"system"}],"oa_version":"Published Version","pubrep_id":"927","intvolume":" 67","ddc":["005","600"],"status":"public","title":"Cumulative space in black-white pebbling and resolution","_id":"1175","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2017-01-01T00:00:00Z","page":"38:1-38-21","citation":{"chicago":"Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.” edited by Christos Papadimitriou, 67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.ITCS.2017.38.","mla":"Alwen, Joel F., et al. Cumulative Space in Black-White Pebbling and Resolution. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:10.4230/LIPIcs.ITCS.2017.38.","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.","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.","apa":"Alwen, J. F., De Rezende, S., Nordstrom, J., & Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2017.38","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.","ama":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. Cumulative space in black-white pebbling and resolution. In: Papadimitriou C, ed. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:38:1-38-21. doi:10.4230/LIPIcs.ITCS.2017.38"}},{"scopus_import":"1","article_processing_charge":"No","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783319731179"],"isbn":["9783319731162"]},"day":"22","month":"12","page":"40–44","quality_controlled":"1","citation":{"ama":"Henzinger MH. The state of the art in dynamic graph algorithms. In: 44th International Conference on Current Trends in Theory and Practice of Computer Science. Vol 10706. Springer Nature; 2017:40–44. doi:10.1007/978-3-319-73117-9_3","ista":"Henzinger MH. 2017. The state of the art in dynamic graph algorithms. 44th International Conference on Current Trends in Theory and Practice of Computer Science. SOFSEM: Theory and Practice of Computer Science, LNCS, vol. 10706, 40–44.","apa":"Henzinger, M. H. (2017). The state of the art in dynamic graph algorithms. In 44th International Conference on Current Trends in Theory and Practice of Computer Science (Vol. 10706, pp. 40–44). Krems, Austria: Springer Nature. https://doi.org/10.1007/978-3-319-73117-9_3","ieee":"M. H. Henzinger, “The state of the art in dynamic graph algorithms,” in 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, 2017, vol. 10706, pp. 40–44.","mla":"Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” 44th International Conference on Current Trends in Theory and Practice of Computer Science, vol. 10706, Springer Nature, 2017, pp. 40–44, doi:10.1007/978-3-319-73117-9_3.","short":"M.H. Henzinger, in:, 44th International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2017, pp. 40–44.","chicago":"Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” In 44th International Conference on Current Trends in Theory and Practice of Computer Science, 10706:40–44. Springer Nature, 2017. https://doi.org/10.1007/978-3-319-73117-9_3."},"publication":"44th International Conference on Current Trends in Theory and Practice of Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-73117-9_3","date_published":"2017-12-22T00:00:00Z","conference":{"name":"SOFSEM: Theory and Practice of Computer Science","location":"Krems, Austria","start_date":"2018-01-29","end_date":"2018-02-02"},"alternative_title":["LNCS"],"type":"conference","extern":"1","abstract":[{"lang":"eng","text":"A dynamic graph algorithm is a data structure that supports operations on dynamically changing graphs."}],"publisher":"Springer Nature","intvolume":" 10706","status":"public","publication_status":"published","title":"The state of the art in dynamic graph algorithms","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11772","year":"2017","oa_version":"None","volume":10706,"date_created":"2022-08-08T13:16:37Z","date_updated":"2023-02-10T08:36:03Z","author":[{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"}]},{"oa":1,"external_id":{"arxiv":["1703.01638"]},"main_file_link":[{"url":"https://doi.org/10.4230/LIPICS.ITCS.2017.26","open_access":"1"}],"quality_controlled":"1","conference":{"name":"ITCS: Innovations in Theoretical Computer Science Conference","start_date":"2017-01-09","location":"Berkley, CA, United States","end_date":"2017-01-11"},"doi":"10.4230/LIPICS.ITCS.2017.26","language":[{"iso":"eng"}],"month":"11","publication_identifier":{"isbn":["9783959770293"],"issn":["1868-8969"]},"year":"2017","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Andrea","last_name":"Lincoln","full_name":"Lincoln, Andrea"},{"first_name":"Stefan","last_name":"Neumann","full_name":"Neumann, Stefan"},{"last_name":"Vassilevska Williams","first_name":"Virginia","full_name":"Vassilevska Williams, Virginia"}],"date_updated":"2023-02-16T11:49:15Z","date_created":"2022-08-12T08:55:33Z","volume":67,"article_number":"26","extern":"1","publication":"8th Innovations in Theoretical Computer Science Conference","citation":{"short":"M.H. Henzinger, A. Lincoln, S. Neumann, V. Vassilevska Williams, in:, 8th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Henzinger, Monika H., et al. “Conditional Hardness for Sensitivity Problems.” 8th Innovations in Theoretical Computer Science Conference, vol. 67, 26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ITCS.2017.26.","chicago":"Henzinger, Monika H, Andrea Lincoln, Stefan Neumann, and Virginia Vassilevska Williams. “Conditional Hardness for Sensitivity Problems.” In 8th Innovations in Theoretical Computer Science Conference, Vol. 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ITCS.2017.26.","ama":"Henzinger MH, Lincoln A, Neumann S, Vassilevska Williams V. Conditional hardness for sensitivity problems. In: 8th Innovations in Theoretical Computer Science Conference. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ITCS.2017.26","ieee":"M. H. Henzinger, A. Lincoln, S. Neumann, and V. Vassilevska Williams, “Conditional hardness for sensitivity problems,” in 8th Innovations in Theoretical Computer Science Conference, Berkley, CA, United States, 2017, vol. 67.","apa":"Henzinger, M. H., Lincoln, A., Neumann, S., & Vassilevska Williams, V. (2017). Conditional hardness for sensitivity problems. In 8th Innovations in Theoretical Computer Science Conference (Vol. 67). Berkley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2017.26","ista":"Henzinger MH, Lincoln A, Neumann S, Vassilevska Williams V. 2017. Conditional hardness for sensitivity problems. 8th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science Conference, LIPIcs, vol. 67, 26."},"date_published":"2017-11-28T00:00:00Z","scopus_import":"1","day":"28","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11829","title":"Conditional hardness for sensitivity problems","status":"public","intvolume":" 67","oa_version":"Published Version","type":"conference","alternative_title":["LIPIcs"],"abstract":[{"lang":"eng","text":"In recent years it has become popular to study dynamic problems in a sensitivity setting: Instead of allowing for an arbitrary sequence of updates, the sensitivity model only allows to apply batch updates of small size to the original input data. The sensitivity model is particularly appealing since recent strong conditional lower bounds ruled out fast algorithms for many dynamic problems, such as shortest paths, reachability, or subgraph connectivity.\r\n\r\nIn this paper we prove conditional lower bounds for these and additional problems in a sensitivity setting. For example, we show that under the Boolean Matrix Multiplication (BMM) conjecture combinatorial algorithms cannot compute the (4/3-\\varepsilon)-approximate diameter of an undirected unweighted dense graph with truly subcubic preprocessing time and truly subquadratic update/query time. This result is surprising since in the static setting it is not clear whether a reduction from BMM to diameter is possible. We further show under the BMM conjecture that many problems, such as reachability or approximate shortest paths, cannot be solved faster than by recomputation from scratch even after only one or two edge insertions. We extend our reduction from BMM to Diameter to give a reduction from All Pairs Shortest Paths to Diameter under one deletion in weighted graphs. This is intriguing, as in the static setting it is a big open problem whether Diameter is as hard as APSP. We further get a nearly tight lower bound for shortest paths after two edge deletions based on the APSP conjecture. We give more lower bounds under the Strong Exponential Time Hypothesis. Many of our lower bounds also hold for static oracle data structures where no sensitivity is required.\r\n\r\nFinally, we give the first algorithm for the (1+\\varepsilon)-approximate radius, diameter, and eccentricity problems in directed or undirected unweighted graphs in case of single edges failures. The algorithm has a truly subcubic running time for graphs with a truly subquadratic number of edges; it is tight w.r.t. the conditional lower bounds we obtain."}]},{"article_number":"45","extern":"1","year":"2017","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","author":[{"full_name":"Goranci, Gramoz","first_name":"Gramoz","last_name":"Goranci"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"last_name":"Peng","first_name":"Pan","full_name":"Peng, Pan"}],"volume":87,"date_updated":"2023-02-16T11:56:37Z","date_created":"2022-08-12T10:46:26Z","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-049-1"]},"month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2017.45"}],"oa":1,"external_id":{"arxiv":["1712.06473"]},"quality_controlled":"1","doi":"10.4230/LIPICS.ESA.2017.45","conference":{"name":"ESA: Annual European Symposium on Algorithms","end_date":"2017-09-06","location":"Vienna, Austria","start_date":"2017-09-04"},"language":[{"iso":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"abstract":[{"lang":"eng","text":"We introduce a new algorithmic framework for designing dynamic graph algorithms in minor-free graphs, by exploiting the structure of such graphs and a tool called vertex sparsification, which is a way to compress large graphs into small ones that well preserve relevant properties among a subset of vertices and has previously mainly been used in the design of approximation algorithms.\r\n\r\nUsing this framework, we obtain a Monte Carlo randomized fully dynamic algorithm for (1 + epsilon)-approximating the energy of electrical flows in n-vertex planar graphs with tilde{O}(r epsilon^{-2}) worst-case update time and tilde{O}((r + n / sqrt{r}) epsilon^{-2}) worst-case query time, for any r larger than some constant. For r=n^{2/3}, this gives tilde{O}(n^{2/3} epsilon^{-2}) update time and tilde{O}(n^{2/3} epsilon^{-2}) query time. We also extend this algorithm to work for minor-free graphs with similar approximation and running time guarantees. Furthermore, we illustrate our framework on the all-pairs max flow and shortest path problems by giving corresponding dynamic algorithms in minor-free graphs with both sublinear update and query times. To the best of our knowledge, our results are the first to systematically establish such a connection between dynamic graph algorithms and vertex sparsification.\r\n\r\nWe also present both upper bound and lower bound for maintaining the energy of electrical flows in the incremental subgraph model, where updates consist of only vertex activations, which might be of independent interest."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11833","intvolume":" 87","status":"public","title":"The power of vertex sparsifiers in dynamic graph algorithms","oa_version":"Published Version","scopus_import":"1","article_processing_charge":"No","day":"01","citation":{"mla":"Goranci, Gramoz, et al. “The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.” 25th Annual European Symposium on Algorithms, vol. 87, 45, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.45.","short":"G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","chicago":"Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.” In 25th Annual European Symposium on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ESA.2017.45.","ama":"Goranci G, Henzinger MH, Peng P. The power of vertex sparsifiers in dynamic graph algorithms. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.45","ista":"Goranci G, Henzinger MH, Peng P. 2017. The power of vertex sparsifiers in dynamic graph algorithms. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 45.","apa":"Goranci, G., Henzinger, M. H., & Peng, P. (2017). The power of vertex sparsifiers in dynamic graph algorithms. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2017.45","ieee":"G. Goranci, M. H. Henzinger, and P. Peng, “The power of vertex sparsifiers in dynamic graph algorithms,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87."},"publication":"25th Annual European Symposium on Algorithms","date_published":"2017-09-01T00:00:00Z"},{"conference":{"start_date":"2017-09-04","location":"Vienna, Austria","end_date":"2017-09-06","name":"ESA: Annual European Symposium on Algorithms"},"doi":"10.4230/LIPICS.ESA.2017.48","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1707.02577"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPICS.ESA.2017.48"}],"quality_controlled":"1","month":"09","publication_identifier":{"isbn":["978-3-95977-049-1"],"issn":["1868-8969"]},"author":[{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"last_name":"Leniowski","first_name":"Dariusz","full_name":"Leniowski, Dariusz"},{"full_name":"Mathieu, Claire","last_name":"Mathieu","first_name":"Claire"}],"date_created":"2022-08-12T09:58:46Z","date_updated":"2023-02-16T11:54:12Z","volume":87,"year":"2017","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","extern":"1","article_number":"48","date_published":"2017-09-01T00:00:00Z","publication":"25th Annual European Symposium on Algorithms","citation":{"ista":"Henzinger MH, Leniowski D, Mathieu C. 2017. Dynamic clustering to minimize the sum of radii. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 48.","ieee":"M. H. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.","apa":"Henzinger, M. H., Leniowski, D., & Mathieu, C. (2017). Dynamic clustering to minimize the sum of radii. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2017.48","ama":"Henzinger MH, Leniowski D, Mathieu C. Dynamic clustering to minimize the sum of radii. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.48","chicago":"Henzinger, Monika H, Dariusz Leniowski, and Claire Mathieu. “Dynamic Clustering to Minimize the Sum of Radii.” In 25th Annual European Symposium on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ESA.2017.48.","mla":"Henzinger, Monika H., et al. “Dynamic Clustering to Minimize the Sum of Radii.” 25th Annual European Symposium on Algorithms, vol. 87, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.48.","short":"M.H. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017."},"day":"01","article_processing_charge":"No","scopus_import":"1","oa_version":"Published Version","_id":"11832","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Dynamic clustering to minimize the sum of radii","status":"public","intvolume":" 87","abstract":[{"text":"In this paper, we study the problem of opening centers to cluster a set of clients in a metric space so as to minimize the sum of the costs of the centers and of the cluster radii, in a dynamic environment where clients arrive and depart, and the solution must be updated efficiently while remaining competitive with respect to the current optimal solution. We call this dynamic sum-of-radii clustering problem.\r\n\r\nWe present a data structure that maintains a solution whose cost is within a constant factor of the cost of an optimal solution in metric spaces with bounded doubling dimension and whose worst-case update time is logarithmic in the parameters of the problem.","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"]},{"page":"470 - 489","publication":"28th Annual ACM-SIAM Symposium on Discrete Algorithms","citation":{"ama":"Bhattacharya S, Henzinger MH, Nanongkai D. Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. In: 28th Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 0. Society for Industrial and Applied Mathematics; 2017:470-489. doi:10.1137/1.9781611974782.30","ista":"Bhattacharya S, Henzinger MH, Nanongkai D. 2017. Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 0, 470–489.","apa":"Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2017). Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. In 28th Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 0, pp. 470–489). Barcelona, Spain: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.30","ieee":"S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time,” in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 2017, vol. 0, pp. 470–489.","mla":"Bhattacharya, Sayan, et al. “Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in o(Log3 n) Worst Case Update Time.” 28th Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 0, Society for Industrial and Applied Mathematics, 2017, pp. 470–89, doi:10.1137/1.9781611974782.30.","short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 470–489.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in o(Log3 n) Worst Case Update Time.” In 28th Annual ACM-SIAM Symposium on Discrete Algorithms, 0:470–89. Society for Industrial and Applied Mathematics, 2017. https://doi.org/10.1137/1.9781611974782.30."},"date_published":"2017-01-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","status":"public","title":"Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11874","oa_version":"Preprint","type":"conference","abstract":[{"text":"We consider the problem of maintaining an approximately maximum (fractional) matching and an approximately minimum vertex cover in a dynamic graph. Starting with the seminal paper by Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. There remains, however, a polynomial gap between the best known worst case update time and the best known amortised update time for this problem, even after allowing for randomisation. Specifically, Bernstein and Stein [ICALP 2015, SODA 2016] have the best known worst case update time. They present a deterministic data structure with approximation ratio (3/2 + ∊) and worst case update time O(m1/4/ ∊2), where m is the number of edges in the graph. In recent past, Gupta and Peng [FOCS 2013] gave a deterministic data structure with approximation ratio (1+ ∊) and worst case update time No known randomised data structure beats the worst case update times of these two results. In contrast, the paper by Onak and Rubinfeld [STOC 2010] gave a randomised data structure with approximation ratio O(1) and amortised update time O(log2 n), where n is the number of nodes in the graph. This was later improved by Baswana, Gupta and Sen [FOCS 2011] and Solomon [FOCS 2016], leading to a randomised date structure with approximation ratio 2 and amortised update time O(1).\r\n\r\nWe bridge the polynomial gap between the worst case and amortised update times for this problem, without using any randomisation. We present a deterministic data structure with approximation ratio (2 + ∊) and worst case update time O(log3 n), for all sufficiently small constants ∊.","lang":"eng"}],"quality_controlled":"1","oa":1,"external_id":{"arxiv":["1704.02844"]},"main_file_link":[{"url":"https://arxiv.org/abs/1704.02844","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"start_date":"2017-01-16","location":"Barcelona, Spain","end_date":"2017-01-19","name":"SODA: Symposium on Discrete Algorithms"},"doi":"10.1137/1.9781611974782.30","month":"01","publication_identifier":{"eisbn":["978-161197478-2"]},"publication_status":"published","publisher":"Society for Industrial and Applied Mathematics","year":"2017","date_updated":"2023-02-17T11:54:22Z","date_created":"2022-08-16T12:28:27Z","volume":"0","author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"}],"extern":"1"},{"main_file_link":[{"url":"https://arxiv.org/abs/1704.01254","open_access":"1"}],"external_id":{"arxiv":["1704.01254"]},"oa":1,"quality_controlled":"1","doi":"10.1137/1.9781611974782.125","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2017-01-19","location":"Barcelona, Spain","start_date":"2017-01-16"},"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-161197478-2"]},"month":"01","year":"2017","publisher":"Society for Industrial and Applied Mathematics","publication_status":"published","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"11889"}]},"author":[{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Satish","last_name":"Rao","full_name":"Rao, Satish"},{"first_name":"Di","last_name":"Wang","full_name":"Wang, Di"}],"date_updated":"2023-02-21T16:32:01Z","date_created":"2022-08-16T12:20:59Z","extern":"1","citation":{"chicago":"Henzinger, Monika H, Satish Rao, and Di Wang. “Local Flow Partitioning for Faster Edge Connectivity.” In 28th Annual ACM-SIAM Symposium on Discrete Algorithms, 1919–38. Society for Industrial and Applied Mathematics, 2017. https://doi.org/10.1137/1.9781611974782.125.","short":"M.H. Henzinger, S. Rao, D. Wang, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 1919–1938.","mla":"Henzinger, Monika H., et al. “Local Flow Partitioning for Faster Edge Connectivity.” 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 1919–38, doi:10.1137/1.9781611974782.125.","apa":"Henzinger, M. H., Rao, S., & Wang, D. (2017). Local flow partitioning for faster edge connectivity. In 28th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1919–1938). Barcelona, Spain: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.125","ieee":"M. H. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster edge connectivity,” in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 1919–1938.","ista":"Henzinger MH, Rao S, Wang D. 2017. Local flow partitioning for faster edge connectivity. 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1919–1938.","ama":"Henzinger MH, Rao S, Wang D. Local flow partitioning for faster edge connectivity. In: 28th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2017:1919-1938. doi:10.1137/1.9781611974782.125"},"publication":"28th Annual ACM-SIAM Symposium on Discrete Algorithms","page":"1919-1938","date_published":"2017-01-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","_id":"11873","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Local flow partitioning for faster edge connectivity","status":"public","oa_version":"Preprint","type":"conference","abstract":[{"text":"We study the problem of computing a minimum cut in a simple, undirected graph and give a deterministic O(m log2 n log log2 n) time algorithm. This improves both on the best previously known deterministic running time of O(m log12 n) (Kawarabayashi and Thorup [12]) and the best previously known randomized running time of O(mlog3n) (Karger [11]) for this problem, though Karger's algorithm can be further applied to weighted graphs.\r\n\r\nOur approach is using the Kawarabayashi and Tho- rup graph compression technique, which repeatedly finds low-conductance cuts. To find these cuts they use a diffusion-based local algorithm. We use instead a flow- based local algorithm and suitably adjust their framework to work with our flow-based subroutine. Both flow and diffusion based methods have a long history of being applied to finding low conductance cuts. Diffusion algorithms have several variants that are naturally local while it is more complicated to make flow methods local. Some prior work has proven nice properties for local flow based algorithms with respect to improving or cleaning up low conductance cuts. Our flow subroutine, however, is the first that is both local and produces low conductance cuts. Thus, it may be of independent interest.","lang":"eng"}]},{"language":[{"iso":"eng"}],"conference":{"location":"Vienna, Austria","start_date":"2017-09-04","end_date":"2017-09-06","name":"ESA: Annual European Symposium on Algorithms"},"doi":"10.4230/LIPICS.ESA.2017.44","quality_controlled":"1","external_id":{"arxiv":["1702.01136"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2017.44"}],"month":"09","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-049-1"]},"date_created":"2022-08-12T09:27:11Z","date_updated":"2023-02-21T16:32:16Z","volume":87,"author":[{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"full_name":"Peng, Pan","last_name":"Peng","first_name":"Pan"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"11894"}]},"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2017","extern":"1","article_number":"44","date_published":"2017-09-01T00:00:00Z","publication":"25th Annual European Symposium on Algorithms","citation":{"ieee":"G. Goranci, M. H. Henzinger, and P. Peng, “Improved guarantees for vertex sparsification in planar graphs,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.","apa":"Goranci, G., Henzinger, M. H., & Peng, P. (2017). Improved guarantees for vertex sparsification in planar graphs. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2017.44","ista":"Goranci G, Henzinger MH, Peng P. 2017. Improved guarantees for vertex sparsification in planar graphs. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 44.","ama":"Goranci G, Henzinger MH, Peng P. Improved guarantees for vertex sparsification in planar graphs. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.44","chicago":"Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” In 25th Annual European Symposium on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ESA.2017.44.","short":"G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Goranci, Gramoz, et al. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” 25th Annual European Symposium on Algorithms, vol. 87, 44, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.44."},"day":"01","article_processing_charge":"No","scopus_import":"1","oa_version":"Published Version","title":"Improved guarantees for vertex sparsification in planar graphs","status":"public","intvolume":" 87","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11831","abstract":[{"text":"Graph Sparsification aims at compressing large graphs into smaller ones while (approximately) preserving important characteristics of the input graph. In this work we study Vertex Sparsifiers, i.e., sparsifiers whose goal is to reduce the number of vertices. Given a weighted graph G=(V,E), and a terminal set K with |K|=k, a quality-q vertex cut sparsifier of G is a graph H with K contained in V_H that preserves the value of minimum cuts separating any bipartition of K, up to a factor of q. We show that planar graphs with all the k terminals lying on the same face admit quality-1 vertex cut sparsifier of size O(k^2) that are also planar. Our result extends to vertex flow and distance sparsifiers. It improves the previous best known bound of O(k^2 2^(2k)) for cut and flow sparsifiers by an exponential factor, and matches an Omega(k^2) lower-bound for this class of graphs.\r\n\r\nWe also study vertex reachability sparsifiers for directed graphs. Given a digraph G=(V,E) and a terminal set K, a vertex reachability sparsifier of G is a digraph H=(V_H,E_H), K contained in V_H that preserves all reachability information among terminal pairs. We introduce the notion of reachability-preserving minors, i.e., we require H to be a minor of G. Among others, for general planar digraphs, we construct reachability-preserving minors of size O(k^2 log^2 k). We complement our upper-bound by showing that there exists an infinite family of acyclic planar digraphs such that any reachability-preserving minor must have Omega(k^2) vertices.","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference"},{"month":"11","publication_identifier":{"eissn":["1433-0490"],"issn":["1432-4350"]},"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://doi.org/10.1007/s00224-017-9759-8","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00224-017-9759-8","extern":"1","publication_status":"published","publisher":"Springer Nature","year":"2017","date_updated":"2023-02-21T16:29:58Z","date_created":"2022-08-17T11:14:12Z","volume":61,"author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"full_name":"Dvořák, Wolfgang","first_name":"Wolfgang","last_name":"Dvořák"},{"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":"Starnberger, Martin","first_name":"Martin","last_name":"Starnberger"}],"related_material":{"record":[{"id":"11837","status":"public","relation":"earlier_version"}]},"scopus_import":"1","day":"01","article_processing_charge":"No","article_type":"original","page":"948-986","publication":"Theory of Computing Systems","citation":{"ieee":"S. Bhattacharya, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Welfare maximization with friends-of-friends network externalities,” Theory of Computing Systems, vol. 61, no. 4. Springer Nature, pp. 948–986, 2017.","apa":"Bhattacharya, S., Dvořák, W., Henzinger, M. H., & Starnberger, M. (2017). Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. Springer Nature. https://doi.org/10.1007/s00224-017-9759-8","ista":"Bhattacharya S, Dvořák W, Henzinger MH, Starnberger M. 2017. Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. 61(4), 948–986.","ama":"Bhattacharya S, Dvořák W, Henzinger MH, Starnberger M. Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. 2017;61(4):948-986. doi:10.1007/s00224-017-9759-8","chicago":"Bhattacharya, Sayan, Wolfgang Dvořák, Monika H Henzinger, and Martin Starnberger. “Welfare Maximization with Friends-of-Friends Network Externalities.” Theory of Computing Systems. Springer Nature, 2017. https://doi.org/10.1007/s00224-017-9759-8.","short":"S. Bhattacharya, W. Dvořák, M.H. Henzinger, M. Starnberger, Theory of Computing Systems 61 (2017) 948–986.","mla":"Bhattacharya, Sayan, et al. “Welfare Maximization with Friends-of-Friends Network Externalities.” Theory of Computing Systems, vol. 61, no. 4, Springer Nature, 2017, pp. 948–86, doi:10.1007/s00224-017-9759-8."},"date_published":"2017-11-01T00:00:00Z","type":"journal_article","abstract":[{"text":"Online social networks allow the collection of large amounts of data about the influence between users connected by a friendship-like relationship. When distributing items among agents forming a social network, this information allows us to exploit network externalities that each agent receives from his neighbors that get the same item. In this paper we consider Friends-of-Friends (2-hop) network externalities, i.e., externalities that not only depend on the neighbors that get the same item but also on neighbors of neighbors. For these externalities we study a setting where multiple different items are assigned to unit-demand agents. Specifically, we study the problem of welfare maximization under different types of externality functions. Let n be the number of agents and m be the number of items. Our contributions are the following: (1) We show that welfare maximization is APX-hard; we show that even for step functions with 2-hop (and also with 1-hop) externalities it is NP-hard to approximate social welfare better than (1−1/e). (2) On the positive side we present (i) an 𝑂(𝑛√)-approximation algorithm for general concave externality functions, (ii) an O(log m)-approximation algorithm for linear externality functions, and (iii) a 518(1−1/𝑒)-approximation algorithm for 2-hop step function externalities. We also improve the result from [7] for 1-hop step function externalities by giving a 12(1−1/𝑒)-approximation algorithm.","lang":"eng"}],"issue":"4","title":"Welfare maximization with friends-of-friends network externalities","status":"public","intvolume":" 61","_id":"11903","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version"},{"type":"journal_article","issue":"3","abstract":[{"text":"Variation in genotypes may be responsible for differences in dispersal rates, directional biases, and growth rates of individuals. These traits may favor certain genotypes and enhance their spatiotemporal spreading into areas occupied by the less advantageous genotypes. We study how these factors influence the speed of spreading in the case of two competing genotypes under the assumption that spatial variation of the total population is small compared to the spatial variation of the frequencies of the genotypes in the population. In that case, the dynamics of the frequency of one of the genotypes is approximately described by a generalized Fisher–Kolmogorov–Petrovskii–Piskunov (F–KPP) equation. This generalized F–KPP equation with (nonlinear) frequency-dependent diffusion and advection terms admits traveling wave solutions that characterize the invasion of the dominant genotype. Our existence results generalize the classical theory for traveling waves for the F–KPP with constant coefficients. Moreover, in the particular case of the quadratic (monostable) nonlinear growth–decay rate in the generalized F–KPP we study in detail the influence of the variance in diffusion and mean displacement rates of the two genotypes on the minimal wave propagation speed.","lang":"eng"}],"_id":"1191","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 79","status":"public","title":"Existence of traveling waves for the generalized F–KPP equation","oa_version":"Preprint","scopus_import":1,"day":"01","citation":{"mla":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” Bulletin of Mathematical Biology, vol. 79, no. 3, Springer, 2017, pp. 525–59, doi:10.1007/s11538-016-0244-3.","short":"R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.","chicago":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” Bulletin of Mathematical Biology. Springer, 2017. https://doi.org/10.1007/s11538-016-0244-3.","ama":"Kollár R, Novak S. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 2017;79(3):525-559. doi:10.1007/s11538-016-0244-3","ista":"Kollár R, Novak S. 2017. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 79(3), 525–559.","apa":"Kollár, R., & Novak, S. (2017). Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. Springer. https://doi.org/10.1007/s11538-016-0244-3","ieee":"R. Kollár and S. Novak, “Existence of traveling waves for the generalized F–KPP equation,” Bulletin of Mathematical Biology, vol. 79, no. 3. Springer, pp. 525–559, 2017."},"publication":"Bulletin of Mathematical Biology","page":"525-559","date_published":"2017-03-01T00:00:00Z","publist_id":"6160","ec_funded":1,"acknowledgement":"We thank Nick Barton, Katarína Bod’ová, and Sr\r\n-\r\ndan Sarikas for constructive feed-\r\nback and support. Furthermore, we would like to express our deep gratitude to the anonymous referees (one\r\nof whom, Jimmy Garnier, agreed to reveal his identity) and the editor Max Souza, for very helpful and\r\ndetailed comments and suggestions that significantly helped us to improve the manuscript. This project has\r\nreceived funding from the European Union’s Seventh Framework Programme for research, technological\r\ndevelopment and demonstration under Grant Agreement 618091 Speed of Adaptation in Population Genet-\r\nics and Evolutionary Computation (SAGE) and the European Research Council (ERC) Grant No. 250152\r\n(SN), from the Scientific Grant Agency of the Slovak Republic under the Grant 1/0459/13 and by the Slovak\r\nResearch and Development Agency under the Contract No. APVV-14-0378 (RK). RK would also like to\r\nthank IST Austria for its hospitality during the work on this project.","year":"2017","department":[{"_id":"NiBa"}],"publisher":"Springer","publication_status":"published","author":[{"full_name":"Kollár, Richard","first_name":"Richard","last_name":"Kollár"},{"id":"461468AE-F248-11E8-B48F-1D18A9856A87","last_name":"Novak","first_name":"Sebastian","full_name":"Novak, Sebastian"}],"volume":79,"date_created":"2018-12-11T11:50:38Z","date_updated":"2021-01-12T06:48:58Z","month":"03","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.00944"}],"project":[{"name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","grant_number":"618091"},{"grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation"}],"quality_controlled":"1","doi":"10.1007/s11538-016-0244-3","language":[{"iso":"eng"}]},{"oa_version":"None","intvolume":" 117","title":"The Hitchhiker’s Guide to flow chemistry","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11961","issue":"18","abstract":[{"lang":"eng","text":"Flow chemistry involves the use of channels or tubing to conduct a reaction in a continuous stream rather than in a flask. Flow equipment provides chemists with unique control over reaction parameters enhancing reactivity or in some cases enabling new reactions. This relatively young technology has received a remarkable amount of attention in the past decade with many reports on what can be done in flow. Until recently, however, the question, “Should we do this in flow?” has merely been an afterthought. This review introduces readers to the basic principles and fundamentals of flow chemistry and critically discusses recent flow chemistry accounts."}],"type":"journal_article","date_published":"2017-06-01T00:00:00Z","page":"11796-11893","article_type":"original","citation":{"ama":"Plutschack MB, Pieber B, Gilmore K, Seeberger PH. The Hitchhiker’s Guide to flow chemistry. Chemical Reviews. 2017;117(18):11796-11893. doi:10.1021/acs.chemrev.7b00183","ieee":"M. B. Plutschack, B. Pieber, K. Gilmore, and P. H. Seeberger, “The Hitchhiker’s Guide to flow chemistry,” Chemical Reviews, vol. 117, no. 18. American Chemical Society, pp. 11796–11893, 2017.","apa":"Plutschack, M. B., Pieber, B., Gilmore, K., & Seeberger, P. H. (2017). The Hitchhiker’s Guide to flow chemistry. Chemical Reviews. American Chemical Society. https://doi.org/10.1021/acs.chemrev.7b00183","ista":"Plutschack MB, Pieber B, Gilmore K, Seeberger PH. 2017. The Hitchhiker’s Guide to flow chemistry. Chemical Reviews. 117(18), 11796–11893.","short":"M.B. Plutschack, B. Pieber, K. Gilmore, P.H. Seeberger, Chemical Reviews 117 (2017) 11796–11893.","mla":"Plutschack, Matthew B., et al. “The Hitchhiker’s Guide to Flow Chemistry.” Chemical Reviews, vol. 117, no. 18, American Chemical Society, 2017, pp. 11796–893, doi:10.1021/acs.chemrev.7b00183.","chicago":"Plutschack, Matthew B., Bartholomäus Pieber, Kerry Gilmore, and Peter H. Seeberger. “The Hitchhiker’s Guide to Flow Chemistry.” Chemical Reviews. American Chemical Society, 2017. https://doi.org/10.1021/acs.chemrev.7b00183."},"publication":"Chemical Reviews","article_processing_charge":"No","day":"01","scopus_import":"1","volume":117,"date_created":"2022-08-24T11:07:46Z","date_updated":"2023-02-21T10:09:28Z","author":[{"last_name":"Plutschack","first_name":"Matthew B.","full_name":"Plutschack, Matthew B."},{"full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","last_name":"Pieber"},{"full_name":"Gilmore, Kerry","last_name":"Gilmore","first_name":"Kerry"},{"full_name":"Seeberger, Peter H.","first_name":"Peter H.","last_name":"Seeberger"}],"publisher":"American Chemical Society","publication_status":"published","pmid":1,"year":"2017","extern":"1","language":[{"iso":"eng"}],"doi":"10.1021/acs.chemrev.7b00183","quality_controlled":"1","external_id":{"pmid":["28570059"]},"publication_identifier":{"eissn":["1520-6890"],"issn":["0009-2665"]},"month":"06"},{"language":[{"iso":"eng"}],"doi":"10.1556/1846.2017.00016","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.1556/1846.2017.00016","open_access":"1"}],"oa":1,"publication_identifier":{"eissn":["2063-0212"],"issn":["2062-249X"]},"month":"09","volume":7,"date_created":"2022-08-25T10:47:51Z","date_updated":"2023-02-21T10:10:02Z","author":[{"full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","last_name":"Pieber"},{"full_name":"Gilmore, Kerry","first_name":"Kerry","last_name":"Gilmore"},{"full_name":"Seeberger, Peter H.","last_name":"Seeberger","first_name":"Peter H."}],"publisher":"AKJournals","publication_status":"published","year":"2017","extern":"1","date_published":"2017-09-01T00:00:00Z","page":"129-136","article_type":"original","citation":{"ista":"Pieber B, Gilmore K, Seeberger PH. 2017. Integrated flow processing - challenges in continuous multistep synthesis. Journal of Flow Chemistry. 7(3–4), 129–136.","apa":"Pieber, B., Gilmore, K., & Seeberger, P. H. (2017). Integrated flow processing - challenges in continuous multistep synthesis. Journal of Flow Chemistry. AKJournals. https://doi.org/10.1556/1846.2017.00016","ieee":"B. Pieber, K. Gilmore, and P. H. Seeberger, “Integrated flow processing - challenges in continuous multistep synthesis,” Journal of Flow Chemistry, vol. 7, no. 3–4. AKJournals, pp. 129–136, 2017.","ama":"Pieber B, Gilmore K, Seeberger PH. Integrated flow processing - challenges in continuous multistep synthesis. Journal of Flow Chemistry. 2017;7(3-4):129-136. doi:10.1556/1846.2017.00016","chicago":"Pieber, Bartholomäus, Kerry Gilmore, and Peter H. Seeberger. “Integrated Flow Processing - Challenges in Continuous Multistep Synthesis.” Journal of Flow Chemistry. AKJournals, 2017. https://doi.org/10.1556/1846.2017.00016.","mla":"Pieber, Bartholomäus, et al. “Integrated Flow Processing - Challenges in Continuous Multistep Synthesis.” Journal of Flow Chemistry, vol. 7, no. 3–4, AKJournals, 2017, pp. 129–36, doi:10.1556/1846.2017.00016.","short":"B. Pieber, K. Gilmore, P.H. Seeberger, Journal of Flow Chemistry 7 (2017) 129–136."},"publication":"Journal of Flow Chemistry","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Published Version","intvolume":" 7","status":"public","title":"Integrated flow processing - challenges in continuous multistep synthesis","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11976","issue":"3-4","abstract":[{"text":"The way organic multistep synthesis is performed is changing due to the adoption of flow chemical techniques, which has enabled the development of improved methods to make complex molecules. The modular nature of the technique provides not only access to target molecules via linear flow approaches but also for the targeting of structural cores with single systems. This perspective article summarizes the state of the art of continuous multistep synthesis and discusses the main challenges and opportunities in this area.","lang":"eng"}],"type":"journal_article"},{"issue":"3-4","abstract":[{"text":"Systems such as fluid flows in channels and pipes or the complex Ginzburg–Landau system, defined over periodic domains, exhibit both continuous symmetries, translational and rotational, as well as discrete symmetries under spatial reflections or complex conjugation. The simplest, and very common symmetry of this type is the equivariance of the defining equations under the orthogonal group O(2). We formulate a novel symmetry reduction scheme for such systems by combining the method of slices with invariant polynomial methods, and show how it works by applying it to the Kuramoto–Sivashinsky system in one spatial dimension. As an example, we track a relative periodic orbit through a sequence of bifurcations to the onset of chaos. Within the symmetry-reduced state space we are able to compute and visualize the unstable manifolds of relative periodic orbits, their torus bifurcations, a transition to chaos via torus breakdown, and heteroclinic connections between various relative periodic orbits. It would be very hard to carry through such analysis in the full state space, without a symmetry reduction such as the one we present here.","lang":"eng"}],"type":"journal_article","oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"5319","checksum":"3e971d09eb167761aa0888ed415b0056","date_created":"2018-12-12T10:18:01Z","date_updated":"2020-07-14T12:44:39Z","access_level":"open_access","file_name":"IST-2017-782-v1+1_BudCvi15.pdf","content_type":"application/pdf","file_size":2820207,"creator":"system"}],"pubrep_id":"782","intvolume":" 167","ddc":["530"],"title":"Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system","status":"public","_id":"1211","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2017-05-01T00:00:00Z","page":"636-655","citation":{"ama":"Budanur NB, Cvitanović P. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 2017;167(3-4):636-655. doi:10.1007/s10955-016-1672-z","ieee":"N. B. Budanur and P. Cvitanović, “Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system,” Journal of Statistical Physics, vol. 167, no. 3–4. Springer, pp. 636–655, 2017.","apa":"Budanur, N. B., & Cvitanović, P. (2017). Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-016-1672-z","ista":"Budanur NB, Cvitanović P. 2017. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 167(3–4), 636–655.","short":"N.B. Budanur, P. Cvitanović, Journal of Statistical Physics 167 (2017) 636–655.","mla":"Budanur, Nazmi B., and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” Journal of Statistical Physics, vol. 167, no. 3–4, Springer, 2017, pp. 636–55, doi:10.1007/s10955-016-1672-z.","chicago":"Budanur, Nazmi B, and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” Journal of Statistical Physics. Springer, 2017. https://doi.org/10.1007/s10955-016-1672-z."},"publication":"Journal of Statistical Physics","publist_id":"6136","file_date_updated":"2020-07-14T12:44:39Z","volume":167,"date_updated":"2021-01-12T06:49:07Z","date_created":"2018-12-11T11:50:44Z","author":[{"full_name":"Budanur, Nazmi B","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0423-5010","first_name":"Nazmi B","last_name":"Budanur"},{"first_name":"Predrag","last_name":"Cvitanović","full_name":"Cvitanović, Predrag"}],"department":[{"_id":"BjHo"}],"publisher":"Springer","publication_status":"published","year":"2017","acknowledgement":"This work was supported by the family of late G. Robinson, Jr. and NSF Grant DMS-1211827. ","month":"05","language":[{"iso":"eng"}],"doi":"10.1007/s10955-016-1672-z","quality_controlled":"1","oa":1},{"oa_version":"Preprint","intvolume":" 13","title":"Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"123","issue":"11","abstract":[{"text":"The Leidenfrost effect occurs when an object near a hot surface vaporizes rapidly enough to lift itself up and hover. Although well understood for liquids and stiff sublimable solids, nothing is known about the effect with materials whose stiffness lies between these extremes. Here we introduce a new phenomenon that occurs with vaporizable soft solids - the elastic Leidenfrost effect. By dropping hydrogel spheres onto hot surfaces we find that, rather than hovering, they energetically bounce several times their diameter for minutes at a time. With high-speed video during a single impact, we uncover high-frequency microscopic gap dynamics at the sphere/substrate interface. We show how these otherwise-hidden agitations constitute work cycles that harvest mechanical energy from the vapour and sustain the bouncing. Our findings suggest a new strategy for injecting mechanical energy into a widely used class of soft materials, with potential relevance to fields such as active matter, soft robotics and microfluidics.","lang":"eng"}],"type":"journal_article","date_published":"2017-07-24T00:00:00Z","page":"1095 - 1099","citation":{"mla":"Waitukaitis, Scott R., et al. “Coupling the Leidenfrost Effect and Elastic Deformations to Power Sustained Bouncing.” Nature Physics, vol. 13, no. 11, Nature Publishing Group, 2017, pp. 1095–99, doi:10.1038/nphys4194.","short":"S.R. Waitukaitis, A. Zuiderwijk, A. Souslov, C. Coulais, M. Van Hecke, Nature Physics 13 (2017) 1095–1099.","chicago":"Waitukaitis, Scott R, Antal Zuiderwijk, Anton Souslov, Corentin Coulais, and Martin Van Hecke. “Coupling the Leidenfrost Effect and Elastic Deformations to Power Sustained Bouncing.” Nature Physics. Nature Publishing Group, 2017. https://doi.org/10.1038/nphys4194.","ama":"Waitukaitis SR, Zuiderwijk A, Souslov A, Coulais C, Van Hecke M. Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. Nature Physics. 2017;13(11):1095-1099. doi:10.1038/nphys4194","ista":"Waitukaitis SR, Zuiderwijk A, Souslov A, Coulais C, Van Hecke M. 2017. Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. Nature Physics. 13(11), 1095–1099.","ieee":"S. R. Waitukaitis, A. Zuiderwijk, A. Souslov, C. Coulais, and M. Van Hecke, “Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing,” Nature Physics, vol. 13, no. 11. Nature Publishing Group, pp. 1095–1099, 2017.","apa":"Waitukaitis, S. R., Zuiderwijk, A., Souslov, A., Coulais, C., & Van Hecke, M. (2017). Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/nphys4194"},"publication":"Nature Physics","day":"24","volume":13,"date_created":"2018-12-11T11:44:45Z","date_updated":"2021-01-12T06:49:14Z","author":[{"first_name":"Scott R","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R"},{"full_name":"Zuiderwijk, Antal","last_name":"Zuiderwijk","first_name":"Antal"},{"full_name":"Souslov, Anton","last_name":"Souslov","first_name":"Anton"},{"first_name":"Corentin","last_name":"Coulais","full_name":"Coulais, Corentin"},{"full_name":"Van Hecke, Martin","last_name":"Van Hecke","first_name":"Martin"}],"publisher":"Nature Publishing Group","publication_status":"published","acknowledgement":"A.S. acknowledges funding from the Delta Institute for Theoretical Physics and the hospitality of the IBS Center for Theoretical Physics of Complex Systems, Daejeon, South Korea. We acknowledge funding from the Netherlands Organisation for Scientific Research through grants VICI No. NWO-680-47-609 (M.v.H. and S.R.W.), VENI No. NWO-680-47-445 (C.C.) and VENI No. NWO-680-47-453 (S.R.W.).","year":"2017","extern":"1","publist_id":"7931","language":[{"iso":"eng"}],"doi":"10.1038/nphys4194","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.03530"}],"external_id":{"arxiv":["1705.03530"]},"month":"07"},{"quality_controlled":"1","oa":1,"external_id":{"arxiv":["1611.00198"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.00198"}],"language":[{"iso":"eng"}],"conference":{"name":"IPCO: Integer Programming and Combinatorial Optimization","end_date":"2017-06-28","start_date":"2017-06-26","location":"Waterloo, ON, Canada"},"doi":"10.1007/978-3-319-59250-3_8","month":"05","publication_identifier":{"issn":["0302-9743","1611-3349"],"eisbn":["9783319592503"],"isbn":["9783319592497"]},"publication_status":"published","publisher":"Springer Nature","year":"2017","date_updated":"2023-02-20T07:57:24Z","date_created":"2023-02-20T07:52:31Z","volume":10328,"author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"full_name":"Chakrabarty, Deeparnab","last_name":"Chakrabarty","first_name":"Deeparnab"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"}],"extern":"1","page":"86-98","publication":"19th International Conference on Integer Programming and Combinatorial Optimization","citation":{"ama":"Bhattacharya S, Chakrabarty D, Henzinger MH. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In: 19th International Conference on Integer Programming and Combinatorial Optimization. Vol 10328. Springer Nature; 2017:86-98. doi:10.1007/978-3-319-59250-3_8","ista":"Bhattacharya S, Chakrabarty D, Henzinger MH. 2017. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. 19th International Conference on Integer Programming and Combinatorial Optimization. IPCO: Integer Programming and Combinatorial Optimization, LNCS, vol. 10328, 86–98.","apa":"Bhattacharya, S., Chakrabarty, D., & Henzinger, M. H. (2017). Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In 19th International Conference on Integer Programming and Combinatorial Optimization (Vol. 10328, pp. 86–98). Waterloo, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-319-59250-3_8","ieee":"S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time,” in 19th International Conference on Integer Programming and Combinatorial Optimization, Waterloo, ON, Canada, 2017, vol. 10328, pp. 86–98.","mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.” 19th International Conference on Integer Programming and Combinatorial Optimization, vol. 10328, Springer Nature, 2017, pp. 86–98, doi:10.1007/978-3-319-59250-3_8.","short":"S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, in:, 19th International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2017, pp. 86–98.","chicago":"Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika H Henzinger. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.” In 19th International Conference on Integer Programming and Combinatorial Optimization, 10328:86–98. Springer Nature, 2017. https://doi.org/10.1007/978-3-319-59250-3_8."},"date_published":"2017-05-24T00:00:00Z","scopus_import":"1","day":"24","article_processing_charge":"No","title":"Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time","status":"public","intvolume":" 10328","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12571","oa_version":"Preprint","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"We consider the problems of maintaining approximate maximum matching and minimum vertex cover in a dynamic graph. Starting with the seminal work of Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011], Solomon [FOCS 2016] gave a randomized 2-approximation dynamic algorithm for this problem that has amortized update time of O(1) with high probability. We consider the natural open question of derandomizing this result. We present a new deterministic fully dynamic algorithm that maintains a O(1)-approximate minimum vertex cover and maximum fractional matching, with an amortized update time of O(1). Previously, the best deterministic algorithm for this problem was due to Bhattacharya, Henzinger and Italiano [SODA 2015]; it had an approximation ratio of (2+ϵ) and an amortized update time of O(logn/ϵ2). Our result can be generalized to give a fully dynamic O(f3)-approximation algorithm with O(f2) amortized update time for the hypergraph vertex cover and fractional matching problems, where every hyperedge has at most f vertices.","lang":"eng"}]},{"scopus_import":1,"has_accepted_license":"1","article_processing_charge":"No","day":"01","citation":{"chicago":"Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications. Brown University, 2017. https://doi.org/10.7155/jgaa.00408.","short":"R. Fulek, M. Pelsmajer, M. Schaefer, Journal of Graph Algorithms and Applications 21 (2017) 135–154.","mla":"Fulek, Radoslav, et al. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications, vol. 21, no. 1, Brown University, 2017, pp. 135–54, doi:10.7155/jgaa.00408.","ieee":"R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” Journal of Graph Algorithms and Applications, vol. 21, no. 1. Brown University, pp. 135–154, 2017.","apa":"Fulek, R., Pelsmajer, M., & Schaefer, M. (2017). Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00408","ista":"Fulek R, Pelsmajer M, Schaefer M. 2017. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 21(1), 135–154.","ama":"Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 2017;21(1):135-154. doi:10.7155/jgaa.00408"},"publication":"Journal of Graph Algorithms and Applications","page":"135 - 154","article_type":"original","date_published":"2017-01-01T00:00:00Z","type":"journal_article","issue":"1","abstract":[{"text":"A drawing of a graph G is radial if the vertices of G are placed on concentric circles C 1 , . . . , C k with common center c , and edges are drawn radially : every edge intersects every circle centered at c at most once. G is radial planar if it has a radial embedding, that is, a crossing-free radial drawing. If the vertices of G are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the assignment of vertices to circles corresponds to the given ordering or leveling. We show that a graph G is radial planar if G has a radial drawing in which every two edges cross an even number of times; the radial embedding has the same leveling as the radial drawing. In other words, we establish the weak variant of the Hanani-Tutte theorem for radial planarity. This generalizes a result by Pach and Toth.","lang":"eng"}],"_id":"1113","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 21","ddc":["510"],"title":"Hanani-Tutte for radial planarity","status":"public","file":[{"access_level":"open_access","file_name":"2017_JournalGraphAlgorithms_Fulek.pdf","creator":"dernst","content_type":"application/pdf","file_size":573623,"file_id":"6967","relation":"main_file","success":1,"date_updated":"2019-10-24T10:54:37Z","date_created":"2019-10-24T10:54:37Z"}],"oa_version":"Published Version","month":"01","external_id":{"arxiv":["1608.08662"]},"oa":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"quality_controlled":"1","doi":"10.7155/jgaa.00408","language":[{"iso":"eng"}],"publist_id":"6254","ec_funded":1,"file_date_updated":"2019-10-24T10:54:37Z","year":"2017","publisher":"Brown University","department":[{"_id":"UlWa"}],"publication_status":"published","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1164"},{"relation":"earlier_version","status":"public","id":"1595"}]},"author":[{"orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","first_name":"Radoslav","full_name":"Fulek, Radoslav"},{"last_name":"Pelsmajer","first_name":"Michael","full_name":"Pelsmajer, Michael"},{"full_name":"Schaefer, Marcus","last_name":"Schaefer","first_name":"Marcus"}],"volume":21,"date_updated":"2023-02-23T10:05:57Z","date_created":"2018-12-11T11:50:13Z"},{"author":[{"last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D"},{"first_name":"Vinay","last_name":"Kumaraswamy","full_name":"Kumaraswamy, Vinay"},{"last_name":"Steiner","first_name":"Rapael","full_name":"Steiner, Rapael"}],"date_created":"2018-12-11T11:44:59Z","date_updated":"2021-01-12T06:52:32Z","oa_version":"None","year":"2017","_id":"169","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Twisted Linnik implies optimal covering exponent for S3","status":"public","publication_status":"published","publisher":"Oxford University Press","abstract":[{"text":"We show that a twisted variant of Linnik’s conjecture on sums of Kloosterman sums leads to an optimal covering exponent for S3.","lang":"eng"}],"publist_id":"7752","extern":"1","type":"journal_article","doi":"10.1093/imrn/rnx116","date_published":"2017-06-19T00:00:00Z","language":[{"iso":"eng"}],"publication":"International Mathematics Research Notices","citation":{"chicago":"Browning, Timothy D, Vinay Kumaraswamy, and Rapael Steiner. “Twisted Linnik Implies Optimal Covering Exponent for S3.” International Mathematics Research Notices. Oxford University Press, 2017. https://doi.org/10.1093/imrn/rnx116.","mla":"Browning, Timothy D., et al. “Twisted Linnik Implies Optimal Covering Exponent for S3.” International Mathematics Research Notices, Oxford University Press, 2017, doi:10.1093/imrn/rnx116.","short":"T.D. Browning, V. Kumaraswamy, R. Steiner, International Mathematics Research Notices (2017).","ista":"Browning TD, Kumaraswamy V, Steiner R. 2017. Twisted Linnik implies optimal covering exponent for S3. International Mathematics Research Notices.","ieee":"T. D. Browning, V. Kumaraswamy, and R. Steiner, “Twisted Linnik implies optimal covering exponent for S3,” International Mathematics Research Notices. Oxford University Press, 2017.","apa":"Browning, T. D., Kumaraswamy, V., & Steiner, R. (2017). Twisted Linnik implies optimal covering exponent for S3. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnx116","ama":"Browning TD, Kumaraswamy V, Steiner R. Twisted Linnik implies optimal covering exponent for S3. International Mathematics Research Notices. 2017. doi:10.1093/imrn/rnx116"},"oa":1,"external_id":{"arxiv":["1609.06097"]},"main_file_link":[{"url":"https://arxiv.org/abs/1609.06097","open_access":"1"}],"quality_controlled":"1","day":"19","month":"06","article_processing_charge":"No"},{"abstract":[{"lang":"eng","text":"We study strong approximation for some algebraic varieties over ℚ which are defined using norm forms. This allows us to confirm a special case of a conjecture due to Harpaz and Wittenberg."}],"publist_id":"7749","extern":"1","type":"journal_article","author":[{"full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","first_name":"Timothy D"},{"last_name":"Schindler","first_name":"Damaris","full_name":"Schindler, Damaris"}],"date_created":"2018-12-11T11:45:00Z","date_updated":"2021-01-12T06:52:45Z","oa_version":"None","_id":"172","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017","publication_status":"published","status":"public","title":"Strong approximation and a conjecture of Harpaz and Wittenberg","publisher":"Oxford University Press","month":"10","day":"30","article_processing_charge":"No","date_published":"2017-10-30T00:00:00Z","doi":"10.1093/imrn/rnx252","language":[{"iso":"eng"}],"publication":"International Mathematics Research Notices","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.07744"}],"oa":1,"citation":{"ista":"Browning TD, Schindler D. 2017. Strong approximation and a conjecture of Harpaz and Wittenberg. International Mathematics Research Notices.","apa":"Browning, T. D., & Schindler, D. (2017). Strong approximation and a conjecture of Harpaz and Wittenberg. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnx252","ieee":"T. D. Browning and D. Schindler, “Strong approximation and a conjecture of Harpaz and Wittenberg,” International Mathematics Research Notices. Oxford University Press, 2017.","ama":"Browning TD, Schindler D. Strong approximation and a conjecture of Harpaz and Wittenberg. International Mathematics Research Notices. 2017. doi:10.1093/imrn/rnx252","chicago":"Browning, Timothy D, and Damaris Schindler. “Strong Approximation and a Conjecture of Harpaz and Wittenberg.” International Mathematics Research Notices. Oxford University Press, 2017. https://doi.org/10.1093/imrn/rnx252.","mla":"Browning, Timothy D., and Damaris Schindler. “Strong Approximation and a Conjecture of Harpaz and Wittenberg.” International Mathematics Research Notices, Oxford University Press, 2017, doi:10.1093/imrn/rnx252.","short":"T.D. Browning, D. Schindler, International Mathematics Research Notices (2017)."},"external_id":{"arxiv":["1509.07744"]},"quality_controlled":"1"},{"type":"journal_article","extern":"1","abstract":[{"lang":"eng","text":"Three-dimensional topological insulators are bulk insulators with Z 2 topological electronic order that gives rise to conducting light-like surface states. These surface electrons are exceptionally resistant to localization by non-magnetic disorder, and have been adopted as the basis for a wide range of proposals to achieve new quasiparticle species and device functionality. Recent studies have yielded a surprise by showing that in spite of resisting localization, topological insulator surface electrons can be reshaped by defects into distinctive resonance states. Here we use numerical simulations and scanning tunnelling microscopy data to show that these resonance states have significance well beyond the localized regime usually associated with impurity bands. At native densities in the model Bi2X3 (X=Bi, Te) compounds, defect resonance states are predicted to generate a new quantum basis for an emergent electron gas that supports diffusive electrical transport. "}],"publist_id":"7438","status":"public","title":"Disorder enabled band structure engineering of a topological insulator surface","publication_status":"published","intvolume":" 8","publisher":"Nature Publishing Group","year":"2017","_id":"391","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:53:08Z","date_created":"2018-12-11T11:46:12Z","volume":8,"oa_version":"None","author":[{"full_name":"Xu, Yishuai","first_name":"Yishuai","last_name":"Xu"},{"last_name":"Chiu","first_name":"Janet","full_name":"Chiu, Janet"},{"last_name":"Miao","first_name":"Lin","full_name":"Miao, Lin"},{"first_name":"Haowei","last_name":"He","full_name":"He, Haowei"},{"full_name":"Alpichshev, Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7183-5203","first_name":"Zhanybek","last_name":"Alpichshev"},{"full_name":"Kapitulnik, Aharon","first_name":"Aharon","last_name":"Kapitulnik"},{"last_name":"Biswas","first_name":"Rudro","full_name":"Biswas, Rudro"},{"last_name":"Wray","first_name":"Lewis","full_name":"Wray, Lewis"}],"day":"03","month":"02","publication":"Nature Communications","citation":{"ieee":"Y. Xu et al., “Disorder enabled band structure engineering of a topological insulator surface,” Nature Communications, vol. 8. Nature Publishing Group, 2017.","apa":"Xu, Y., Chiu, J., Miao, L., He, H., Alpichshev, Z., Kapitulnik, A., … Wray, L. (2017). Disorder enabled band structure engineering of a topological insulator surface. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms14081","ista":"Xu Y, Chiu J, Miao L, He H, Alpichshev Z, Kapitulnik A, Biswas R, Wray L. 2017. Disorder enabled band structure engineering of a topological insulator surface. Nature Communications. 8.","ama":"Xu Y, Chiu J, Miao L, et al. Disorder enabled band structure engineering of a topological insulator surface. Nature Communications. 2017;8. doi:10.1038/ncomms14081","chicago":"Xu, Yishuai, Janet Chiu, Lin Miao, Haowei He, Zhanybek Alpichshev, Aharon Kapitulnik, Rudro Biswas, and Lewis Wray. “Disorder Enabled Band Structure Engineering of a Topological Insulator Surface.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms14081.","short":"Y. Xu, J. Chiu, L. Miao, H. He, Z. Alpichshev, A. Kapitulnik, R. Biswas, L. Wray, Nature Communications 8 (2017).","mla":"Xu, Yishuai, et al. “Disorder Enabled Band Structure Engineering of a Topological Insulator Surface.” Nature Communications, vol. 8, Nature Publishing Group, 2017, doi:10.1038/ncomms14081."},"language":[{"iso":"eng"}],"doi":"10.1038/ncomms14081","date_published":"2017-02-03T00:00:00Z"},{"publisher":"American Physical Society","intvolume":" 96","title":"Origin of the exciton mass in the frustrated Mott insulator Na2IrO3","status":"public","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"393","acknowledgement":"Z.A. gratefully acknowledges discussions with P. A. Lee and A. Kemper. A conversation with J. Zaanen was instrumental in clarifying the physical picture described in this paper. We would also like to thank A. Kogar for thoroughly reading the manuscript and making valuable comments. This work was supported by Army Research Office Grant No. W911NF-15-1-0128 and Gordon and Betty Moore Foundation EPiQS Initiative through Grant No. GBMF4540 (time resolved optical spectroscopy), Skoltech, as part of the Skoltech NGP program (theory) and National Science Foundation Grant No. DMR-1265162 (material growth).\r\n\r\n","year":"2017","volume":96,"oa_version":"None","date_updated":"2021-01-12T07:53:16Z","date_created":"2018-12-11T11:46:13Z","author":[{"orcid":"0000-0002-7183-5203","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","last_name":"Alpichshev","first_name":"Zhanybek","full_name":"Alpichshev, Zhanybek"},{"first_name":"Edbert","last_name":"Sie","full_name":"Sie, Edbert"},{"full_name":"Mahmood, Fahad","first_name":"Fahad","last_name":"Mahmood"},{"first_name":"Gang","last_name":"Cao","full_name":"Cao, Gang"},{"last_name":"Gedik","first_name":"Nuh","full_name":"Gedik, Nuh"}],"type":"journal_article","extern":"1","issue":"23","publist_id":"7436","abstract":[{"lang":"eng","text":"We use a three-pulse ultrafast optical spectroscopy to study the relaxation processes in a frustrated Mott insulator Na2IrO3. By being able to independently produce the out-of-equilibrium bound states (excitons) of doublons and holons with the first pulse and suppress the underlying antiferromagnetic order with the second one, we were able to elucidate the relaxation mechanism of quasiparticles in this system. By observing the difference in the exciton dynamics in the magnetically ordered and disordered phases we found that the mass of this quasiparticle is mostly determined by its interaction with the surrounding spins. "}],"main_file_link":[{"url":"http://dspace.mit.edu/handle/1721.1/114259","open_access":"1"}],"citation":{"ama":"Alpichshev Z, Sie E, Mahmood F, Cao G, Gedik N. Origin of the exciton mass in the frustrated Mott insulator Na2IrO3. Physical Review B. 2017;96(23). doi:10.1103/PhysRevB.96.235141","ieee":"Z. Alpichshev, E. Sie, F. Mahmood, G. Cao, and N. Gedik, “Origin of the exciton mass in the frustrated Mott insulator Na2IrO3,” Physical Review B, vol. 96, no. 23. American Physical Society, 2017.","apa":"Alpichshev, Z., Sie, E., Mahmood, F., Cao, G., & Gedik, N. (2017). Origin of the exciton mass in the frustrated Mott insulator Na2IrO3. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.96.235141","ista":"Alpichshev Z, Sie E, Mahmood F, Cao G, Gedik N. 2017. Origin of the exciton mass in the frustrated Mott insulator Na2IrO3. Physical Review B. 96(23).","short":"Z. Alpichshev, E. Sie, F. Mahmood, G. Cao, N. Gedik, Physical Review B 96 (2017).","mla":"Alpichshev, Zhanybek, et al. “Origin of the Exciton Mass in the Frustrated Mott Insulator Na2IrO3.” Physical Review B, vol. 96, no. 23, American Physical Society, 2017, doi:10.1103/PhysRevB.96.235141.","chicago":"Alpichshev, Zhanybek, Edbert Sie, Fahad Mahmood, Gang Cao, and Nuh Gedik. “Origin of the Exciton Mass in the Frustrated Mott Insulator Na2IrO3.” Physical Review B. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.96.235141."},"oa":1,"publication":"Physical Review B","language":[{"iso":"eng"}],"doi":"10.1103/PhysRevB.96.235141","date_published":"2017-12-26T00:00:00Z","month":"12","day":"26"},{"type":"journal_article","issue":"11","publist_id":"7437","abstract":[{"text":"We used femtosecond optical pump-probe spectroscopy to study the photoinduced change in reflectivity of thin films of the electron-doped cuprate La2-xCexCuO4 (LCCO) with dopings of x=0.08 (underdoped) and x=0.11 (optimally doped). Above Tc, we observe fluence-dependent relaxation rates that begin at a temperature similar to the one where transport measurements first show signatures of antiferromagnetic correlations. Upon suppressing superconductivity with a magnetic field, it is found that the fluence and temperature dependence of relaxation rates are consistent with bimolecular recombination of electrons and holes across a gap (2ΔAF) originating from antiferromagnetic correlations which comprise the pseudogap in electron-doped cuprates. This can be used to learn about coupling between electrons and high-energy (ω>2ΔAF) excitations in these compounds and set limits on the time scales on which antiferromagnetic correlations are static.","lang":"eng"}],"extern":"1","year":"2017","_id":"392","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Optical pump-probe work was supported by the Gordon and Betty Moore Foundation's EPiQS initiative through Grant No. GBMF4540. Materials growth and characterization was supported by AFOSR FA95501410332 and NSF DMR1410665.","publisher":"American Physical Society","intvolume":" 95","publication_status":"published","status":"public","title":"Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ","author":[{"full_name":"Vishik, Inna","last_name":"Vishik","first_name":"Inna"},{"first_name":"Fahad","last_name":"Mahmood","full_name":"Mahmood, Fahad"},{"last_name":"Alpichshev","first_name":"Zhanybek","orcid":"0000-0002-7183-5203","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","full_name":"Alpichshev, Zhanybek"},{"first_name":"Nuh","last_name":"Gedik","full_name":"Gedik, Nuh"},{"last_name":"Higgins","first_name":"Joshu","full_name":"Higgins, Joshu"},{"first_name":"Richard","last_name":"Greene","full_name":"Greene, Richard"}],"volume":95,"oa_version":"None","date_updated":"2021-01-12T07:53:12Z","date_created":"2018-12-11T11:46:13Z","day":"13","month":"03","citation":{"chicago":"Vishik, Inna, Fahad Mahmood, Zhanybek Alpichshev, Nuh Gedik, Joshu Higgins, and Richard Greene. “Ultrafast Dynamics in the Presence of Antiferromagnetic Correlations in Electron Doped Cuprate La2 XCexCuO4±δ.” Physical Review B. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.95.115125.","short":"I. Vishik, F. Mahmood, Z. Alpichshev, N. Gedik, J. Higgins, R. Greene, Physical Review B 95 (2017).","mla":"Vishik, Inna, et al. “Ultrafast Dynamics in the Presence of Antiferromagnetic Correlations in Electron Doped Cuprate La2 XCexCuO4±δ.” Physical Review B, vol. 95, no. 11, American Physical Society, 2017, doi:10.1103/PhysRevB.95.115125.","ieee":"I. Vishik, F. Mahmood, Z. Alpichshev, N. Gedik, J. Higgins, and R. Greene, “Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ,” Physical Review B, vol. 95, no. 11. American Physical Society, 2017.","apa":"Vishik, I., Mahmood, F., Alpichshev, Z., Gedik, N., Higgins, J., & Greene, R. (2017). Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.95.115125","ista":"Vishik I, Mahmood F, Alpichshev Z, Gedik N, Higgins J, Greene R. 2017. Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ. Physical Review B. 95(11).","ama":"Vishik I, Mahmood F, Alpichshev Z, Gedik N, Higgins J, Greene R. Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ. Physical Review B. 2017;95(11). doi:10.1103/PhysRevB.95.115125"},"main_file_link":[{"open_access":"1","url":"http://dspace.mit.edu/handle/1721.1/109835"}],"oa":1,"publication":"Physical Review B","doi":"10.1103/PhysRevB.95.115125","date_published":"2017-03-13T00:00:00Z","language":[{"iso":"eng"}]},{"month":"01","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1186/s40170-017-0164-1","extern":"1","file_date_updated":"2020-07-14T12:46:29Z","publist_id":"7380","publication_status":"published","publisher":"BioMed Central","year":"2017","date_updated":"2021-01-12T07:56:55Z","date_created":"2018-12-11T11:46:30Z","volume":5,"author":[{"first_name":"Rae","last_name":"Hardie","full_name":"Hardie, Rae"},{"full_name":"Van Dam, Ellen","last_name":"Van Dam","first_name":"Ellen"},{"first_name":"Mark","last_name":"Cowley","full_name":"Cowley, Mark"},{"first_name":"Ting","last_name":"Han","full_name":"Han, Ting"},{"last_name":"Balaban","first_name":"Seher","full_name":"Balaban, Seher"},{"full_name":"Pajic, Marina","last_name":"Pajic","first_name":"Marina"},{"last_name":"Pinese","first_name":"Mark","full_name":"Pinese, Mark"},{"full_name":"Iconomou, Mary","first_name":"Mary","last_name":"Iconomou"},{"full_name":"Shearer, Robert","first_name":"Robert","last_name":"Shearer"},{"full_name":"Mckenna, Jessie","last_name":"Mckenna","first_name":"Jessie"},{"last_name":"Miller","first_name":"David","full_name":"Miller, David"},{"full_name":"Waddell, Nicola","last_name":"Waddell","first_name":"Nicola"},{"last_name":"Pearson","first_name":"John","full_name":"Pearson, John"},{"first_name":"Sean","last_name":"Grimmond","full_name":"Grimmond, Sean"},{"full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","last_name":"Sazanov","first_name":"Leonid A"},{"full_name":"Biankin, Andrew","last_name":"Biankin","first_name":"Andrew"},{"first_name":"Silas","last_name":"Villas Boas","full_name":"Villas Boas, Silas"},{"first_name":"Andrew","last_name":"Hoy","full_name":"Hoy, Andrew"},{"full_name":"Turner, Nigel","last_name":"Turner","first_name":"Nigel"},{"full_name":"Saunders, Darren","last_name":"Saunders","first_name":"Darren"}],"day":"30","has_accepted_license":"1","publication":"Cancer & Metabolism","citation":{"chicago":"Hardie, Rae, Ellen Van Dam, Mark Cowley, Ting Han, Seher Balaban, Marina Pajic, Mark Pinese, et al. “Mitochondrial Mutations and Metabolic Adaptation in Pancreatic Cancer.” Cancer & Metabolism. BioMed Central, 2017. https://doi.org/10.1186/s40170-017-0164-1.","mla":"Hardie, Rae, et al. “Mitochondrial Mutations and Metabolic Adaptation in Pancreatic Cancer.” Cancer & Metabolism, vol. 5, no. 2, BioMed Central, 2017, doi:10.1186/s40170-017-0164-1.","short":"R. Hardie, E. Van Dam, M. Cowley, T. Han, S. Balaban, M. Pajic, M. Pinese, M. Iconomou, R. Shearer, J. Mckenna, D. Miller, N. Waddell, J. Pearson, S. Grimmond, L.A. Sazanov, A. Biankin, S. Villas Boas, A. Hoy, N. Turner, D. Saunders, Cancer & Metabolism 5 (2017).","ista":"Hardie R, Van Dam E, Cowley M, Han T, Balaban S, Pajic M, Pinese M, Iconomou M, Shearer R, Mckenna J, Miller D, Waddell N, Pearson J, Grimmond S, Sazanov LA, Biankin A, Villas Boas S, Hoy A, Turner N, Saunders D. 2017. Mitochondrial mutations and metabolic adaptation in pancreatic cancer. Cancer & Metabolism. 5(2).","apa":"Hardie, R., Van Dam, E., Cowley, M., Han, T., Balaban, S., Pajic, M., … Saunders, D. (2017). Mitochondrial mutations and metabolic adaptation in pancreatic cancer. Cancer & Metabolism. BioMed Central. https://doi.org/10.1186/s40170-017-0164-1","ieee":"R. Hardie et al., “Mitochondrial mutations and metabolic adaptation in pancreatic cancer,” Cancer & Metabolism, vol. 5, no. 2. BioMed Central, 2017.","ama":"Hardie R, Van Dam E, Cowley M, et al. Mitochondrial mutations and metabolic adaptation in pancreatic cancer. Cancer & Metabolism. 2017;5(2). doi:10.1186/s40170-017-0164-1"},"date_published":"2017-01-30T00:00:00Z","type":"journal_article","abstract":[{"text":"Pancreatic cancer has a five-year survival rate of ~8%, with characteristic molecular heterogeneity and restricted treatment options. Targeting metabolism has emerged as a potentially effective therapeutic strategy for cancers such as pancreatic cancer, which are driven by genetic alterations that are not tractable drug targets. Although somatic mitochondrial genome (mtDNA) mutations have been observed in various tumors types, understanding of metabolic genotype-phenotype relationships is limited.","lang":"eng"}],"issue":"2","title":"Mitochondrial mutations and metabolic adaptation in pancreatic cancer","ddc":["570"],"status":"public","intvolume":" 5","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"443","oa_version":"Published Version","file":[{"file_name":"2017_Cancer_Hardie.pdf","access_level":"open_access","creator":"dernst","file_size":1609174,"content_type":"application/pdf","file_id":"5868","relation":"main_file","date_created":"2019-01-22T08:17:56Z","date_updated":"2020-07-14T12:46:29Z","checksum":"337a65786875f64a1fe9fc0ac24767dc"}]},{"author":[{"full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","last_name":"Sazanov","first_name":"Leonid A"}],"date_created":"2018-12-11T11:46:30Z","date_updated":"2021-01-12T07:56:59Z","oa_version":"None","_id":"444","year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","title":"Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions","department":[{"_id":"LeSa"}],"editor":[{"full_name":"Wikström, Mårten","first_name":"Mårten","last_name":"Wikström"}],"publisher":"Royal Society of Chemistry","abstract":[{"text":"Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular energy generation, contributing to the proton motive force used to produce ATP. It couples the transfer of two electrons between NADH and quinone to translocation of four protons across the membrane. It is the largest protein assembly of bacterial and mitochondrial respiratory chains, composed, in mammals, of up to 45 subunits with a total molecular weight of ∼1 MDa. Bacterial enzyme is about half the size, providing the important “minimal” model of complex I. The l-shaped complex consists of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where proton translocation takes place. Previously, we have solved the crystal structures of the hydrophilic domain of complex I from Thermus thermophilus and of the membrane domain from Escherichia coli, followed by the atomic structure of intact, entire complex I from T. thermophilus. Recently, we have solved by cryo-EM a first complete atomic structure of mammalian (ovine) mitochondrial complex I. Core subunits are well conserved from the bacterial version, whilst supernumerary subunits form an interlinked, stabilizing shell around the core. Subunits containing additional cofactors, including Zn ion, NADPH and phosphopantetheine, probably have regulatory roles. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative diseases. The structure of mammalian enzyme provides many insights into complex I mechanism, assembly, maturation and dysfunction, allowing detailed molecular analysis of disease-causing mutations.","lang":"eng"}],"publist_id":"7379","type":"book_chapter","date_published":"2017-11-29T00:00:00Z","doi":"10.1039/9781788010405-00025","language":[{"iso":"eng"}],"publication":"Mechanisms of primary energy transduction in biology ","citation":{"ama":"Sazanov LA. Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In: Wikström M, ed. Mechanisms of Primary Energy Transduction in Biology . Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry; 2017:25-59. doi:10.1039/9781788010405-00025","ieee":"L. A. Sazanov, “Structure of respiratory complex I: ‘Minimal’ bacterial and ‘de luxe’ mammalian versions,” in Mechanisms of primary energy transduction in biology , M. Wikström, Ed. Royal Society of Chemistry, 2017, pp. 25–59.","apa":"Sazanov, L. A. (2017). Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In M. Wikström (Ed.), Mechanisms of primary energy transduction in biology (pp. 25–59). Royal Society of Chemistry. https://doi.org/10.1039/9781788010405-00025","ista":"Sazanov LA. 2017.Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In: Mechanisms of primary energy transduction in biology . , 25–59.","short":"L.A. Sazanov, in:, M. Wikström (Ed.), Mechanisms of Primary Energy Transduction in Biology , Royal Society of Chemistry, 2017, pp. 25–59.","mla":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” Mechanisms of Primary Energy Transduction in Biology , edited by Mårten Wikström, Royal Society of Chemistry, 2017, pp. 25–59, doi:10.1039/9781788010405-00025.","chicago":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” In Mechanisms of Primary Energy Transduction in Biology , edited by Mårten Wikström, 25–59. Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry, 2017. https://doi.org/10.1039/9781788010405-00025."},"quality_controlled":"1","page":"25 - 59","month":"11","day":"29","publication_identifier":{"isbn":["978-1-78262-865-1"]},"series_title":"Mechanisms of Primary Energy Transduction in Biology "},{"day":"12","month":"07","date_published":"2017-07-12T00:00:00Z","doi":"10.1103/PhysRevB.96.014202","citation":{"mla":"Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized Phases.” Physical Review B - Condensed Matter and Materials Physics, vol. 96, no. 1, American Physical Society, 2017, doi:10.1103/PhysRevB.96.014202.","short":"M. Serbyn, D. Abanin, Physical Review B - Condensed Matter and Materials Physics 96 (2017).","chicago":"Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized Phases.” Physical Review B - Condensed Matter and Materials Physics. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.96.014202.","ama":"Serbyn M, Abanin D. Loschmidt echo in many body localized phases. Physical Review B - Condensed Matter and Materials Physics. 2017;96(1). doi:10.1103/PhysRevB.96.014202","ista":"Serbyn M, Abanin D. 2017. Loschmidt echo in many body localized phases. Physical Review B - Condensed Matter and Materials Physics. 96(1).","ieee":"M. Serbyn and D. Abanin, “Loschmidt echo in many body localized phases,” Physical Review B - Condensed Matter and Materials Physics, vol. 96, no. 1. American Physical Society, 2017.","apa":"Serbyn, M., & Abanin, D. (2017). Loschmidt echo in many body localized phases. Physical Review B - Condensed Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/PhysRevB.96.014202"},"main_file_link":[{"url":"https://arxiv.org/abs/1701.07772","open_access":"1"}],"oa":1,"publication":"Physical Review B - Condensed Matter and Materials Physics","quality_controlled":0,"issue":"1","publist_id":"7378","abstract":[{"lang":"eng","text":"The Loschmidt echo, defined as the overlap between quantum wave function evolved with different Hamiltonians, quantifies the sensitivity of quantum dynamics to perturbations and is often used as a probe of quantum chaos. In this work we consider the behavior of the Loschmidt echo in the many-body localized phase, which is characterized by emergent local integrals of motion and provides a generic example of nonergodic dynamics. We demonstrate that the fluctuations of the Loschmidt echo decay as a power law in time in the many-body localized phase, in contrast to the exponential decay in few-body ergodic systems. We consider the spin-echo generalization of the Loschmidt echo and argue that the corresponding correlation function saturates to a finite value in localized systems. Slow, power-law decay of fluctuations of such spin-echo-type overlap is related to the operator spreading and is present only in the many-body localized phase, but not in a noninteracting Anderson insulator. While most of the previously considered probes of dephasing dynamics could be understood by approximating physical spin operators with local integrals of motion, the Loschmidt echo and its generalizations crucially depend on the full expansion of the physical operators via local integrals of motion operators, as well as operators which flip local integrals of motion. Hence these probes allow one to get insights into the relation between physical operators and local integrals of motion and access the operator spreading in the many-body localized phase."}],"extern":1,"type":"journal_article","author":[{"full_name":"Maksym Serbyn","last_name":"Serbyn","first_name":"Maksym","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Abanin, Dimitry A","first_name":"Dimitry","last_name":"Abanin"}],"volume":96,"date_updated":"2021-01-12T07:57:03Z","date_created":"2018-12-11T11:46:31Z","_id":"445","acknowledgement":"This research was supported in part by the National\nScience Foundation under Grant No. NSF PHY11-25915.\nM.S. was supported by Gordon and Betty Moore Foundation’s\nEPiQS Initiative through Grant No. GBMF4307. D.A. also\nacknowledges support by Swiss National Science Foundation.","year":"2017","publisher":"American Physical Society","intvolume":" 96","title":"Loschmidt echo in many body localized phases","status":"public","publication_status":"published"},{"publist_id":"7370","issue":"8","abstract":[{"lang":"eng","text":"Spinning tops and yo-yos have long fascinated cultures around the world with their unexpected, graceful motions that seemingly elude gravity. Yet, due to the exceeding difficulty of creating stably spinning objects of asymmetric shape in a manual trial-and-error process, there has been little departure from rotationally symmetric designs. With modern 3D printing technologies, however, we can manufacture shapes of almost unbounded complexity at the press of a button, shifting this design complexity toward computation. In this article, we describe an algorithm to generate designs for spinning objects by optimizing their mass distribution: as input, the user provides a solid 3D model and a desired axis of rotation. Our approach then modifies the interior mass distribution such that the principal directions of the moment of inertia align with the target rotation frame. To create voids inside the model, we represent its volume with an adaptive multiresolution voxelization and optimize the discrete voxel fill values using a continuous, nonlinear formulation. We further optimize for rotational stability by maximizing the dominant principal moment. Our method is well-suited for a variety of 3D printed models, ranging from characters to abstract shapes. We demonstrate tops and yo-yos that spin surprisingly stably despite their asymmetric appearance."}],"extern":"1","type":"journal_article","author":[{"last_name":"Bächer","first_name":"Moritz","full_name":"Bächer, Moritz"},{"last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"},{"full_name":"Whiting, Emily","first_name":"Emily","last_name":"Whiting"},{"full_name":"Sorkine Hornung, Olga","first_name":"Olga","last_name":"Sorkine Hornung"}],"volume":60,"oa_version":"None","date_updated":"2022-03-18T12:55:28Z","date_created":"2018-12-11T11:46:33Z","year":"2017","_id":"452","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This project was supported in part by the ERC Starting Grant iModel (StG-2012-306877). Emily Whiting was supported by the ETH Zurich/Marie Curie COFUND Postdoctoral Fellowship. \r\nFirst and foremost, we would like to thank our editor Steve Marschner for his invaluable feedback. We were fortunate to get further help from Maurizio Nitti for model design, Romain Prévost for Make-It-Stand comparisons, Alexander Sorkine-Hornung, Kaan Yücer, and Changil Kim for video and photo assistance, Ronnie Gänsli for metal casting, Alec Jacobson for the posed Elephant and Armadillo models, and Romain Prévost and Amit Bermano for print preparation. Model sources include: Woven Ring: generated by “Sculpture Generator 1” by Carlo H. Séquin, UC Berkeley; Elephant: De Espona model library, courtesy of Robert Sumner; T-Rex: TurboSquid; Armadillo: Stanford Computer Graphics Laboratory; and Utah Teapot: Martin Newell, University of Utah. ","publisher":"ACM","intvolume":" 60","publication_status":"published","status":"public","title":"Spin it: Optimizing moment of inertia for spinnable objects","article_processing_charge":"No","month":"08","day":"01","scopus_import":"1","doi":"10.1145/3068766","date_published":"2017-08-01T00:00:00Z","language":[{"iso":"eng"}],"citation":{"short":"M. Bächer, B. Bickel, E. Whiting, O. Sorkine Hornung, Communications of the ACM 60 (2017) 92–99.","mla":"Bächer, Moritz, et al. “Spin It: Optimizing Moment of Inertia for Spinnable Objects.” Communications of the ACM, vol. 60, no. 8, ACM, 2017, pp. 92–99, doi:10.1145/3068766.","chicago":"Bächer, Moritz, Bernd Bickel, Emily Whiting, and Olga Sorkine Hornung. “Spin It: Optimizing Moment of Inertia for Spinnable Objects.” Communications of the ACM. ACM, 2017. https://doi.org/10.1145/3068766.","ama":"Bächer M, Bickel B, Whiting E, Sorkine Hornung O. Spin it: Optimizing moment of inertia for spinnable objects. Communications of the ACM. 2017;60(8):92-99. doi:10.1145/3068766","ieee":"M. Bächer, B. Bickel, E. Whiting, and O. Sorkine Hornung, “Spin it: Optimizing moment of inertia for spinnable objects,” Communications of the ACM, vol. 60, no. 8. ACM, pp. 92–99, 2017.","apa":"Bächer, M., Bickel, B., Whiting, E., & Sorkine Hornung, O. (2017). Spin it: Optimizing moment of inertia for spinnable objects. Communications of the ACM. ACM. https://doi.org/10.1145/3068766","ista":"Bächer M, Bickel B, Whiting E, Sorkine Hornung O. 2017. Spin it: Optimizing moment of inertia for spinnable objects. Communications of the ACM. 60(8), 92–99."},"publication":"Communications of the ACM","page":"92 - 99"},{"type":"journal_article","abstract":[{"text":"Most kinesin motors move in only one direction along microtubules. Members of the kinesin-5 subfamily were initially described as unidirectional plus-end-directed motors and shown to produce piconewton forces. However, some fungal kinesin-5 motors are bidirectional. The force production of a bidirectional kinesin-5 has not yet been measured. Therefore, it remains unknown whether the mechanism of the unconventional minus-end-directed motility differs fundamentally from that of plus-end-directed stepping. Using force spectroscopy, we have measured here the forces that ensembles of purified budding yeast kinesin-5 Cin8 produce in microtubule gliding assays in both plus- and minus-end direction. Correlation analysis of pause forces demonstrated that individual Cin8 molecules produce additive forces in both directions of movement. In ensembles, Cin8 motors were able to produce single-motor forces up to a magnitude of ∼1.5 pN. Hence, these properties appear to be conserved within the kinesin-5 subfamily. Force production was largely independent of the directionality of movement, indicating similarities between the motility mechanisms for both directions. These results provide constraints for the development of models for the bidirectional motility mechanism of fission yeast kinesin-5 and provide insight into the function of this mitotic motor.","lang":"eng"}],"issue":"9","_id":"453","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"status":"public","title":"Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement","intvolume":" 113","pubrep_id":"965","file":[{"checksum":"99a2474088e20ac74b1882c4fbbb45b1","date_created":"2018-12-12T10:14:03Z","date_updated":"2020-07-14T12:46:31Z","file_id":"5052","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":977192,"access_level":"open_access","file_name":"IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf"}],"oa_version":"Published Version","day":"07","article_processing_charge":"No","has_accepted_license":"1","publication":"Biophysical Journal","citation":{"ieee":"T. Fallesen, J. Roostalu, C. F. Düllberg, G. Pruessner, and T. Surrey, “Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement,” Biophysical Journal, vol. 113, no. 9. Biophysical Society, pp. 2055–2067, 2017.","apa":"Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., & Surrey, T. (2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. Biophysical Society. https://doi.org/10.1016/j.bpj.2017.09.006","ista":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. 2017. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 113(9), 2055–2067.","ama":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 2017;113(9):2055-2067. doi:10.1016/j.bpj.2017.09.006","chicago":"Fallesen, Todd, Johanna Roostalu, Christian F Düllberg, Gunnar Pruessner, and Thomas Surrey. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal. Biophysical Society, 2017. https://doi.org/10.1016/j.bpj.2017.09.006.","short":"T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067.","mla":"Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal, vol. 113, no. 9, Biophysical Society, 2017, pp. 2055–67, doi:10.1016/j.bpj.2017.09.006."},"article_type":"original","page":"2055 - 2067","date_published":"2017-11-07T00:00:00Z","file_date_updated":"2020-07-14T12:46:31Z","publist_id":"7369","year":"2017","acknowledgement":"The plasmid for full-length kinesin-1 was a gift from G. Holzwarth and J. Macosko with permission from J. Howard. We thank I. Lueke and N. I. Cade for technical assistance. G.P. thanks the Francis Crick Institute, and in particular the Surrey and Salbreux groups, for their hospitality during his sabbatical stay, as well as Imperial College London for making it possible. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK (FC001163), the United Kingdom Medical Research Council (FC001163), and the Wellcome Trust (FC001163), and by Imperial College London. J.R. was also supported by a Sir Henry Wellcome Postdoctoral Fellowship (100145/Z/12/Z) and T.S. by the European Research Council (Advanced Grant, project 323042). ","publication_status":"published","department":[{"_id":"MaLo"}],"publisher":"Biophysical Society","author":[{"first_name":"Todd","last_name":"Fallesen","full_name":"Fallesen, Todd"},{"full_name":"Roostalu, Johanna","first_name":"Johanna","last_name":"Roostalu"},{"full_name":"Düllberg, Christian F","id":"459064DC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6335-9748","first_name":"Christian F","last_name":"Düllberg"},{"full_name":"Pruessner, Gunnar","first_name":"Gunnar","last_name":"Pruessner"},{"first_name":"Thomas","last_name":"Surrey","full_name":"Surrey, Thomas"}],"date_updated":"2021-01-12T07:59:28Z","date_created":"2018-12-11T11:46:33Z","volume":113,"month":"11","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","doi":"10.1016/j.bpj.2017.09.006","language":[{"iso":"eng"}]},{"publisher":"International Federation of Computational Logic","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2017","volume":13,"date_updated":"2023-02-23T10:08:55Z","date_created":"2018-12-11T11:46:37Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1661"}]},"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Loitzenbauer, Veronika","first_name":"Veronika","last_name":"Loitzenbauer"}],"article_number":"26","license":"https://creativecommons.org/licenses/by-nd/4.0/","ec_funded":1,"publist_id":"7357","file_date_updated":"2020-07-14T12:46:32Z","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"quality_controlled":"1","external_id":{"arxiv":["1410.0833"]},"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.23638/LMCS-13(3:26)2017","publication_identifier":{"issn":["1860-5974"]},"month":"09","intvolume":" 13","status":"public","ddc":["004"],"title":"Improved algorithms for parity and Streett objectives","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"464","file":[{"file_size":582940,"content_type":"application/pdf","creator":"system","file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:32Z","date_created":"2018-12-12T10:13:27Z","checksum":"12d469ae69b80361333d7dead965cf5d","relation":"main_file","file_id":"5010"}],"oa_version":"Published Version","pubrep_id":"956","type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years."}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017"},"publication":"Logical Methods in Computer Science","date_published":"2017-09-26T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"26"},{"publication_status":"published","department":[{"_id":"ChWo"}],"publisher":"ACM","year":"2017","date_created":"2018-12-11T11:46:39Z","date_updated":"2023-02-23T12:20:26Z","volume":36,"author":[{"full_name":"Jeschke, Stefan","last_name":"Jeschke","first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J"}],"article_number":"103","file_date_updated":"2020-07-14T12:46:34Z","publist_id":"7350","ec_funded":1,"quality_controlled":"1","project":[{"grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales"}],"oa":1,"acknowledged_ssus":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"doi":"10.1145/3072959.3073678","month":"07","publication_identifier":{"issn":["07300301"]},"ddc":["006"],"status":"public","title":"Water wave packets","intvolume":" 36","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"470","oa_version":"Published Version","file":[{"file_id":"7359","relation":"main_file","date_created":"2020-01-24T09:32:35Z","date_updated":"2020-07-14T12:46:34Z","checksum":"82a3b2bfeee4ddef16ecc21675d1a48a","file_name":"wavepackets_final.pdf","access_level":"open_access","creator":"wojtan","content_type":"application/pdf","file_size":13131683}],"type":"journal_article","abstract":[{"text":"This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios.","lang":"eng"}],"issue":"4","article_type":"original","publication":"ACM Transactions on Graphics","citation":{"ama":"Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics. 2017;36(4). doi:10.1145/3072959.3073678","ista":"Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103.","ieee":"S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics, vol. 36, no. 4. ACM, 2017.","apa":"Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3072959.3073678","mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).","chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678."},"date_published":"2017-07-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)"},{"citation":{"ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 2017;18(2). doi:10.1145/3060139","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2017. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 18(2), 12.","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2. ACM, 2017.","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3060139","mla":"Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2, 12, ACM, 2017, doi:10.1145/3060139.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3060139."},"publication":"ACM Transactions on Computational Logic (TOCL)","date_published":"2017-05-01T00:00:00Z","scopus_import":1,"day":"01","_id":"471","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 18","status":"public","title":"Faster statistical model checking for unbounded temporal properties","oa_version":"Submitted Version","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds. "}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.05739"}],"project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"quality_controlled":"1","doi":"10.1145/3060139","language":[{"iso":"eng"}],"publication_identifier":{"issn":["15293785"]},"month":"05","year":"2017","publisher":"ACM","department":[{"_id":"ToHe"}],"publication_status":"published","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1234"}]},"author":[{"last_name":"Daca","first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","full_name":"Daca, Przemyslaw"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","first_name":"Jan","full_name":"Kretinsky, Jan"},{"full_name":"Petrov, Tatjana","first_name":"Tatjana","last_name":"Petrov","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9041-0905"}],"volume":18,"date_updated":"2023-02-21T16:48:11Z","date_created":"2018-12-11T11:46:39Z","article_number":"12","publist_id":"7349","ec_funded":1},{"title":"Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held","status":"public","publication_status":"published","publisher":"Wiley-Blackwell","intvolume":" 37","_id":"472","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2017","date_created":"2018-12-11T11:46:40Z","date_updated":"2021-01-12T08:00:51Z","oa_version":"None","volume":37,"author":[{"full_name":"Eguchi, Kohgaku","first_name":"Kohgaku","last_name":"Eguchi","id":"2B7846DC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6170-2546"},{"full_name":"Taoufiq, Zachari","last_name":"Taoufiq","first_name":"Zachari"},{"full_name":"Thorn Seshold, Oliver","first_name":"Oliver","last_name":"Thorn Seshold"},{"first_name":"Dirk","last_name":"Trauner","full_name":"Trauner, Dirk"},{"first_name":"Masato","last_name":"Hasegawa","full_name":"Hasegawa, Masato"},{"first_name":"Tomoyuki","last_name":"Takahashi","full_name":"Takahashi, Tomoyuki"}],"type":"journal_article","extern":"1","abstract":[{"lang":"eng","text":"α-Synuclein is a presynaptic protein the function of which has yet to be identified, but its neuronal content increases in patients of synucleinopa-thies including Parkinson’s disease. Chronic overexpression of α-synuclein reportedly expresses various phenotypes of synaptic dysfunction, but the primary target of its toxicity has not been determined. To investigate this, we acutely loaded human recombinant α-synuclein or its pathological mutants in their monomeric forms into the calyces of Held presynaptic terminals in slices from auditorily mature and immature rats of either sex. Membrane capacitance measurements revealed significant and specific inhibitory effects of WT monomeric α-synuclein on vesicle endocytosis throughout development. However, the α-synuclein A53T mutant affected vesicle endocytosis only at immature calyces, where as the A30P mutant had no effect throughout. The endocytic impairment by WTα-synuclein was rescued by intraterminal coloading of the microtubule (MT) polymerization blocker nocodazole. Furthermore, it was reversibly rescued by presynaptically loaded photostatin-1, a pho-toswitcheable inhibitor of MT polymerization, inalight-wavelength-dependent manner. Incontrast, endocyticinhibition by the A53T mutant at immature calyces was not rescued by nocodazole. Functionally, presynaptically loaded WT α-synuclein had no effect on basal synaptic transmission evoked at a low frequency, but significantly attenuated exocytosis and impaired the fidelity of neurotransmission during prolonged high-frequency stimulation. We conclude that monomeric WTα-synuclein primarily inhibits vesicle endocytosis via MT overassembly, thereby impairing high-frequency neurotransmission."}],"issue":"25","publist_id":"7348","quality_controlled":"1","page":"6043 - 6052","publication":"European Journal of Neuroscience","citation":{"mla":"Eguchi, Kohgaku, et al. “Wild-Type Monomeric α-Synuclein Can Impair Vesicle Endocytosis and Synaptic Fidelity via Tubulin Polymerization at the Calyx of Held.” European Journal of Neuroscience, vol. 37, no. 25, Wiley-Blackwell, 2017, pp. 6043–52, doi:10.1523/JNEUROSCI.0179-17.2017.","short":"K. Eguchi, Z. Taoufiq, O. Thorn Seshold, D. Trauner, M. Hasegawa, T. Takahashi, European Journal of Neuroscience 37 (2017) 6043–6052.","chicago":"Eguchi, Kohgaku, Zachari Taoufiq, Oliver Thorn Seshold, Dirk Trauner, Masato Hasegawa, and Tomoyuki Takahashi. “Wild-Type Monomeric α-Synuclein Can Impair Vesicle Endocytosis and Synaptic Fidelity via Tubulin Polymerization at the Calyx of Held.” European Journal of Neuroscience. Wiley-Blackwell, 2017. https://doi.org/10.1523/JNEUROSCI.0179-17.2017.","ama":"Eguchi K, Taoufiq Z, Thorn Seshold O, Trauner D, Hasegawa M, Takahashi T. Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held. European Journal of Neuroscience. 2017;37(25):6043-6052. doi:10.1523/JNEUROSCI.0179-17.2017","ista":"Eguchi K, Taoufiq Z, Thorn Seshold O, Trauner D, Hasegawa M, Takahashi T. 2017. Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held. European Journal of Neuroscience. 37(25), 6043–6052.","ieee":"K. Eguchi, Z. Taoufiq, O. Thorn Seshold, D. Trauner, M. Hasegawa, and T. Takahashi, “Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held,” European Journal of Neuroscience, vol. 37, no. 25. Wiley-Blackwell, pp. 6043–6052, 2017.","apa":"Eguchi, K., Taoufiq, Z., Thorn Seshold, O., Trauner, D., Hasegawa, M., & Takahashi, T. (2017). Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held. European Journal of Neuroscience. Wiley-Blackwell. https://doi.org/10.1523/JNEUROSCI.0179-17.2017"},"language":[{"iso":"eng"}],"date_published":"2017-06-21T00:00:00Z","doi":"10.1523/JNEUROSCI.0179-17.2017","day":"21","month":"06","publication_identifier":{"issn":["02706474"]}},{"publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"World Scientific Publishing","year":"2017","acknowledgement":"Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15.","date_updated":"2023-02-21T16:06:22Z","date_created":"2018-12-11T11:46:43Z","volume":26,"author":[{"full_name":"Biedl, Therese","last_name":"Biedl","first_name":"Therese"},{"orcid":"0000-0002-8871-5814","id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber","first_name":"Stefan","full_name":"Huber, Stefan"},{"full_name":"Palfrader, Peter","last_name":"Palfrader","first_name":"Peter"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10892"}]},"file_date_updated":"2020-07-14T12:46:35Z","publist_id":"7338","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1142/S0218195916600050","month":"04","status":"public","title":"Planar matchings for weighted straight skeletons","ddc":["004","514","516"],"intvolume":" 26","_id":"481","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf","content_type":"application/pdf","file_size":769296,"creator":"system","relation":"main_file","file_id":"4758","checksum":"f79e8558bfe4b368dfefeb8eec2e3a5e","date_created":"2018-12-12T10:09:34Z","date_updated":"2020-07-14T12:46:35Z"}],"pubrep_id":"949","type":"journal_article","abstract":[{"text":"We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.","lang":"eng"}],"issue":"3-4","page":"211 - 229","publication":"International Journal of Computational Geometry and Applications","citation":{"ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 2017;26(3-4):211-229. doi:10.1142/S0218195916600050","ista":"Biedl T, Huber S, Palfrader P. 2017. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 26(3–4), 211–229.","apa":"Biedl, T., Huber, S., & Palfrader, P. (2017). Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. World Scientific Publishing. https://doi.org/10.1142/S0218195916600050","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:10.1142/S0218195916600050.","short":"T. Biedl, S. Huber, P. Palfrader, International Journal of Computational Geometry and Applications 26 (2017) 211–229.","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications. World Scientific Publishing, 2017. https://doi.org/10.1142/S0218195916600050."},"date_published":"2017-04-13T00:00:00Z","scopus_import":1,"day":"13","has_accepted_license":"1"},{"language":[{"iso":"eng"}],"doi":"10.4310/ATMP.2017.v21.n3.a4","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27"}],"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1509.04631","open_access":"1"}],"oa":1,"publication_identifier":{"issn":["10950761"]},"month":"01","volume":21,"date_created":"2018-12-11T11:46:43Z","date_updated":"2021-01-12T08:00:58Z","author":[{"id":"404092F4-F248-11E8-B48F-1D18A9856A87","first_name":"Phan","last_name":"Nam","full_name":"Nam, Phan"},{"full_name":"Napiórkowski, Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","first_name":"Marcin M","last_name":"Napiórkowski"}],"department":[{"_id":"RoSe"}],"publisher":"International Press","publication_status":"published","year":"2017","ec_funded":1,"publist_id":"7336","date_published":"2017-01-01T00:00:00Z","page":"683 - 738","citation":{"chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a4.","mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:10.4310/ATMP.2017.v21.n3.a4.","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","ista":"Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3), 683–738.","ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 683–738, 2017.","apa":"Nam, P., & Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a4","ama":"Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 2017;21(3):683-738. doi:10.4310/ATMP.2017.v21.n3.a4"},"publication":"Advances in Theoretical and Mathematical Physics","day":"01","scopus_import":1,"oa_version":"Submitted Version","intvolume":" 21","title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","status":"public","_id":"484","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","issue":"3","abstract":[{"lang":"eng","text":"We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory."}],"type":"journal_article"},{"oa_version":"Submitted Version","title":"Universality for a class of random band matrices","status":"public","intvolume":" 21","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"483","abstract":[{"lang":"eng","text":"We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices."}],"issue":"3","type":"journal_article","date_published":"2017-08-25T00:00:00Z","page":"739 - 800","publication":"Advances in Theoretical and Mathematical Physics","citation":{"ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 2017;21(3):739-800. doi:10.4310/ATMP.2017.v21.n3.a5","ista":"Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.","apa":"Bourgade, P., Erdös, L., Yau, H., & Yin, J. (2017). Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a5","ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 739–800, 2017.","mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 739–800, doi:10.4310/ATMP.2017.v21.n3.a5.","short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800.","chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a5."},"day":"25","scopus_import":1,"date_created":"2018-12-11T11:46:43Z","date_updated":"2021-01-12T08:00:57Z","volume":21,"author":[{"full_name":"Bourgade, Paul","first_name":"Paul","last_name":"Bourgade"},{"last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"first_name":"Horng","last_name":"Yau","full_name":"Yau, Horng"},{"last_name":"Yin","first_name":"Jun","full_name":"Yin, Jun"}],"publication_status":"published","department":[{"_id":"LaEr"}],"publisher":"International Press","year":"2017","publist_id":"7337","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.4310/ATMP.2017.v21.n3.a5","quality_controlled":"1","project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.02312"}],"oa":1,"month":"08","publication_identifier":{"issn":["10950761"]}},{"oa_version":"None","date_created":"2018-12-11T11:46:45Z","date_updated":"2023-02-23T12:21:11Z","author":[{"full_name":"Baig, Ghufran","first_name":"Ghufran","last_name":"Baig"},{"full_name":"Radunovic, Bozidar","first_name":"Bozidar","last_name":"Radunovic"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Balkwill, Matthew","first_name":"Matthew","last_name":"Balkwill"},{"last_name":"Karagiannis","first_name":"Thomas","full_name":"Karagiannis, Thomas"},{"full_name":"Qiu, Lili","last_name":"Qiu","first_name":"Lili"}],"publisher":"ACM","department":[{"_id":"DaAl"}],"publication_status":"published","title":"Towards unlicensed cellular networks in TV white spaces","status":"public","year":"2017","_id":"487","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7333","abstract":[{"lang":"eng","text":"In this paper we study network architecture for unlicensed cellular networking for outdoor coverage in TV white spaces. The main technology proposed for TV white spaces is 802.11af, a Wi-Fi variant adapted for TV frequencies. However, 802.11af is originally designed for improved indoor propagation. We show that long links, typical for outdoor use, exacerbate known Wi-Fi issues, such as hidden and exposed terminal, and significantly reduce its efficiency. Instead, we propose CellFi, an alternative architecture based on LTE. LTE is designed for long-range coverage and throughput efficiency, but it is also designed to operate in tightly controlled and centrally managed networks. CellFi overcomes these problems by designing an LTE-compatible spectrum database component, mandatory for TV white space networking, and introducing an interference management component for distributed coordination. CellFi interference management is compatible with existing LTE mechanisms, requires no explicit communication between base stations, and is more efficient than CSMA for long links. We evaluate our design through extensive real world evaluation on of-the-shelf LTE equipment and simulations. We show that, compared to 802.11af, it increases coverage by 40% and reduces median flow completion times by 2.3x."}],"type":"conference","language":[{"iso":"eng"}],"date_published":"2017-11-28T00:00:00Z","doi":"10.1145/3143361.3143367","conference":{"start_date":"2017-12-12","location":"Incheon, South Korea","end_date":"2017-12-15","name":"CoNEXT: Conference on emerging Networking EXperiments and Technologies"},"page":"2 - 14","quality_controlled":"1","citation":{"ama":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. Towards unlicensed cellular networks in TV white spaces. In: Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies. ACM; 2017:2-14. doi:10.1145/3143361.3143367","ista":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. 2017. Towards unlicensed cellular networks in TV white spaces. Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies. CoNEXT: Conference on emerging Networking EXperiments and Technologies, 2–14.","apa":"Baig, G., Radunovic, B., Alistarh, D.-A., Balkwill, M., Karagiannis, T., & Qiu, L. (2017). Towards unlicensed cellular networks in TV white spaces. In Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies (pp. 2–14). Incheon, South Korea: ACM. https://doi.org/10.1145/3143361.3143367","ieee":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, and L. Qiu, “Towards unlicensed cellular networks in TV white spaces,” in Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies, Incheon, South Korea, 2017, pp. 2–14.","mla":"Baig, Ghufran, et al. “Towards Unlicensed Cellular Networks in TV White Spaces.” Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14, doi:10.1145/3143361.3143367.","short":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, L. Qiu, in:, Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14.","chicago":"Baig, Ghufran, Bozidar Radunovic, Dan-Adrian Alistarh, Matthew Balkwill, Thomas Karagiannis, and Lili Qiu. “Towards Unlicensed Cellular Networks in TV White Spaces.” In Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, 2–14. ACM, 2017. https://doi.org/10.1145/3143361.3143367."},"publication":"Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies","publication_identifier":{"isbn":["978-145035422-6"]},"day":"28","month":"11","scopus_import":1},{"citation":{"ama":"Simonnet J, Nassar M, Stella F, et al. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 2017;8. doi:10.1038/ncomms16032","ista":"Simonnet J, Nassar M, Stella F, Cohen I, Mathon B, Boccara CN, Miles R, Fricker D. 2017. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 8, 16032.","apa":"Simonnet, J., Nassar, M., Stella, F., Cohen, I., Mathon, B., Boccara, C. N., … Fricker, D. (2017). Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms16032","ieee":"J. Simonnet et al., “Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum,” Nature Communications, vol. 8. Nature Publishing Group, 2017.","mla":"Simonnet, Jean, et al. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” Nature Communications, vol. 8, 16032, Nature Publishing Group, 2017, doi:10.1038/ncomms16032.","short":"J. Simonnet, M. Nassar, F. Stella, I. Cohen, B. Mathon, C.N. Boccara, R. Miles, D. Fricker, Nature Communications 8 (2017).","chicago":"Simonnet, Jean, Mérie Nassar, Federico Stella, Ivan Cohen, Bertrand Mathon, Charlotte N. Boccara, Richard Miles, and Desdemona Fricker. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms16032."},"publication":"Nature Communications","date_published":"2017-07-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","intvolume":" 8","ddc":["571"],"status":"public","title":"Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"514","file":[{"content_type":"application/pdf","file_size":2948357,"creator":"system","file_name":"IST-2018-937-v1+1_2017_Stella_Activity_dependent.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:36Z","date_created":"2018-12-12T10:14:31Z","checksum":"76d8a2b72a58e56adb410ec37dfa7eee","relation":"main_file","file_id":"5083"}],"oa_version":"Published Version","pubrep_id":"937","type":"journal_article","abstract":[{"lang":"eng","text":"Orientation in space is represented in specialized brain circuits. Persistent head direction signals are transmitted from anterior thalamus to the presubiculum, but the identity of the presubicular target neurons, their connectivity and function in local microcircuits are unknown. Here, we examine how thalamic afferents recruit presubicular principal neurons and Martinotti interneurons, and the ensuing synaptic interactions between these cells. Pyramidal neuron activation of Martinotti cells in superficial layers is strongly facilitating such that high-frequency head directional stimulation efficiently unmutes synaptic excitation. Martinotti-cell feedback plays a dual role: precisely timed spikes may not inhibit the firing of in-tune head direction cells, while exerting lateral inhibition. Autonomous attractor dynamics emerge from a modelled network implementing wiring motifs and timing sensitive synaptic interactions in the pyramidal - Martinotti-cell feedback loop. This inhibitory microcircuit is therefore tuned to refine and maintain head direction information in the presubiculum."}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1038/ncomms16032","publication_identifier":{"issn":["20411723"]},"month":"07","department":[{"_id":"JoCs"}],"publisher":"Nature Publishing Group","publication_status":"published","year":"2017","volume":8,"date_created":"2018-12-11T11:46:54Z","date_updated":"2021-01-12T08:01:16Z","author":[{"full_name":"Simonnet, Jean","first_name":"Jean","last_name":"Simonnet"},{"first_name":"Mérie","last_name":"Nassar","full_name":"Nassar, Mérie"},{"id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9439-3148","first_name":"Federico","last_name":"Stella","full_name":"Stella, Federico"},{"first_name":"Ivan","last_name":"Cohen","full_name":"Cohen, Ivan"},{"first_name":"Bertrand","last_name":"Mathon","full_name":"Mathon, Bertrand"},{"full_name":"Boccara, Charlotte","id":"3FC06552-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7237-5109","first_name":"Charlotte","last_name":"Boccara"},{"first_name":"Richard","last_name":"Miles","full_name":"Miles, Richard"},{"full_name":"Fricker, Desdemona","last_name":"Fricker","first_name":"Desdemona"}],"article_number":"16032","publist_id":"7305","file_date_updated":"2020-07-14T12:46:36Z"},{"file_date_updated":"2020-07-14T12:46:36Z","publist_id":"7304","ec_funded":1,"year":"2017","publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"LeSa"}],"author":[{"full_name":"Letts, James A","orcid":"0000-0002-9864-3586","id":"322DA418-F248-11E8-B48F-1D18A9856A87","last_name":"Letts","first_name":"James A"},{"orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","last_name":"Sazanov","first_name":"Leonid A","full_name":"Sazanov, Leonid A"}],"date_created":"2018-12-11T11:46:54Z","date_updated":"2021-01-12T08:01:17Z","volume":24,"month":"10","publication_identifier":{"issn":["15459993"]},"oa":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","grant_number":"701309","_id":"2590DB08-B435-11E9-9278-68D0E5697425"}],"doi":"10.1038/nsmb.3460","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"The oxidative phosphorylation electron transport chain (OXPHOS-ETC) of the inner mitochondrial membrane is composed of five large protein complexes, named CI-CV. These complexes convert energy from the food we eat into ATP, a small molecule used to power a multitude of essential reactions throughout the cell. OXPHOS-ETC complexes are organized into supercomplexes (SCs) of defined stoichiometry: CI forms a supercomplex with CIII2 and CIV (SC I+III2+IV, known as the respirasome), as well as with CIII2 alone (SC I+III2). CIII2 forms a supercomplex with CIV (SC III2+IV) and CV forms dimers (CV2). Recent cryo-EM studies have revealed the structures of SC I+III2+IV and SC I+III2. Furthermore, recent work has shed light on the assembly and function of the SCs. Here we review and compare these recent studies and discuss how they have advanced our understanding of mitochondrial electron transport.","lang":"eng"}],"issue":"10","_id":"515","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["572"],"title":"Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain","intvolume":" 24","oa_version":"Submitted Version","file":[{"checksum":"9bc7e8c41b43636dd7566289e511f096","date_created":"2019-11-07T12:51:07Z","date_updated":"2020-07-14T12:46:36Z","relation":"main_file","file_id":"6993","file_size":4118385,"content_type":"application/pdf","creator":"lsazanov","access_level":"open_access","file_name":"29893_2_merged_1501257589_red.pdf"}],"scopus_import":1,"day":"05","has_accepted_license":"1","publication":"Nature Structural and Molecular Biology","citation":{"mla":"Letts, James A., and Leonid A. Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature Structural and Molecular Biology, vol. 24, no. 10, Nature Publishing Group, 2017, pp. 800–08, doi:10.1038/nsmb.3460.","short":"J.A. Letts, L.A. Sazanov, Nature Structural and Molecular Biology 24 (2017) 800–808.","chicago":"Letts, James A, and Leonid A Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature Structural and Molecular Biology. Nature Publishing Group, 2017. https://doi.org/10.1038/nsmb.3460.","ama":"Letts JA, Sazanov LA. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 2017;24(10):800-808. doi:10.1038/nsmb.3460","ista":"Letts JA, Sazanov LA. 2017. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 24(10), 800–808.","ieee":"J. A. Letts and L. A. Sazanov, “Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain,” Nature Structural and Molecular Biology, vol. 24, no. 10. Nature Publishing Group, pp. 800–808, 2017.","apa":"Letts, J. A., & Sazanov, L. A. (2017). Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. Nature Publishing Group. https://doi.org/10.1038/nsmb.3460"},"article_type":"original","page":"800 - 808","date_published":"2017-10-05T00:00:00Z"},{"publication":"Physical Review Fluids","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.02619"}],"oa":1,"citation":{"apa":"Klotz, L., Lemoult, G. M., Frontczak, I., Tuckerman, L., & Wesfreid, J. (2017). Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. American Physical Society. https://doi.org/10.1103/PhysRevFluids.2.043904","ieee":"L. Klotz, G. M. Lemoult, I. Frontczak, L. Tuckerman, and J. Wesfreid, “Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence,” Physical Review Fluids, vol. 2, no. 4. American Physical Society, 2017.","ista":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. 2017. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2(4), 043904.","ama":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2017;2(4). doi:10.1103/PhysRevFluids.2.043904","chicago":"Klotz, Lukasz, Grégoire M Lemoult, Idalia Frontczak, Laurette Tuckerman, and José Wesfreid. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids. American Physical Society, 2017. https://doi.org/10.1103/PhysRevFluids.2.043904.","short":"L. Klotz, G.M. Lemoult, I. Frontczak, L. Tuckerman, J. Wesfreid, Physical Review Fluids 2 (2017).","mla":"Klotz, Lukasz, et al. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids, vol. 2, no. 4, 043904, American Physical Society, 2017, doi:10.1103/PhysRevFluids.2.043904."},"quality_controlled":"1","date_published":"2017-04-01T00:00:00Z","doi":"10.1103/PhysRevFluids.2.043904","language":[{"iso":"eng"}],"scopus_import":1,"month":"04","day":"01","_id":"513","year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","title":"Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence","intvolume":" 2","department":[{"_id":"BjHo"}],"publisher":"American Physical Society","author":[{"id":"2C9AF1C2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1740-7635","first_name":"Lukasz","last_name":"Klotz","full_name":"Klotz, Lukasz"},{"id":"4787FE80-F248-11E8-B48F-1D18A9856A87","first_name":"Grégoire M","last_name":"Lemoult","full_name":"Lemoult, Grégoire M"},{"first_name":"Idalia","last_name":"Frontczak","full_name":"Frontczak, Idalia"},{"full_name":"Tuckerman, Laurette","last_name":"Tuckerman","first_name":"Laurette"},{"full_name":"Wesfreid, José","first_name":"José","last_name":"Wesfreid"}],"date_updated":"2021-01-12T08:01:16Z","date_created":"2018-12-11T11:46:54Z","volume":2,"oa_version":"Preprint","article_number":"043904","type":"journal_article","abstract":[{"lang":"eng","text":"We present an experimental setup that creates a shear flow with zero mean advection velocity achieved by counterbalancing the nonzero streamwise pressure gradient by moving boundaries, which generates plane Couette-Poiseuille flow. We obtain experimental results in the transitional regime for this flow. Using flow visualization, we characterize the subcritical transition to turbulence in Couette-Poiseuille flow and show the existence of turbulent spots generated by a permanent perturbation. Due to the zero mean advection velocity of the base profile, these turbulent structures are nearly stationary. We distinguish two regions of the turbulent spot: the active turbulent core, which is characterized by waviness of the streaks similar to traveling waves, and the surrounding region, which includes in addition the weak undisturbed streaks and oblique waves at the laminar-turbulent interface. We also study the dependence of the size of these two regions on Reynolds number. Finally, we show that the traveling waves move in the downstream (Poiseuille) direction."}],"issue":"4","publist_id":"7306"},{"page":"395 - 401","article_type":"letter_note","citation":{"chicago":"Du, Wei, Andreas Angermayr, Joeri Jongbloets, Douwe Molenaar, Herwig Bachmann, Klaas Hellingwerf, and Filipe Branco Dos Santos. “Nonhierarchical Flux Regulation Exposes the Fitness Burden Associated with Lactate Production in Synechocystis Sp. PCC6803.” ACS Synthetic Biology. American Chemical Society, 2017. https://doi.org/10.1021/acssynbio.6b00235.","short":"W. Du, A. Angermayr, J. Jongbloets, D. Molenaar, H. Bachmann, K. Hellingwerf, F. Branco Dos Santos, ACS Synthetic Biology 6 (2017) 395–401.","mla":"Du, Wei, et al. “Nonhierarchical Flux Regulation Exposes the Fitness Burden Associated with Lactate Production in Synechocystis Sp. PCC6803.” ACS Synthetic Biology, vol. 6, no. 3, American Chemical Society, 2017, pp. 395–401, doi:10.1021/acssynbio.6b00235.","apa":"Du, W., Angermayr, A., Jongbloets, J., Molenaar, D., Bachmann, H., Hellingwerf, K., & Branco Dos Santos, F. (2017). Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. ACS Synthetic Biology. American Chemical Society. https://doi.org/10.1021/acssynbio.6b00235","ieee":"W. Du et al., “Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803,” ACS Synthetic Biology, vol. 6, no. 3. American Chemical Society, pp. 395–401, 2017.","ista":"Du W, Angermayr A, Jongbloets J, Molenaar D, Bachmann H, Hellingwerf K, Branco Dos Santos F. 2017. Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. ACS Synthetic Biology. 6(3), 395–401.","ama":"Du W, Angermayr A, Jongbloets J, et al. Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. ACS Synthetic Biology. 2017;6(3):395-401. doi:10.1021/acssynbio.6b00235"},"publication":"ACS Synthetic Biology","date_published":"2017-03-17T00:00:00Z","scopus_import":1,"day":"17","intvolume":" 6","title":"Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"520","oa_version":"None","type":"journal_article","issue":"3","abstract":[{"text":"Cyanobacteria are mostly engineered to be sustainable cell-factories by genetic manipulations alone. Here, by modulating the concentration of allosteric effectors, we focus on increasing product formation without further burdening the cells with increased expression of enzymes. Resorting to a novel 96-well microplate cultivation system for cyanobacteria, and using lactate-producing strains of Synechocystis PCC6803 expressing different l-lactate dehydrogenases (LDH), we titrated the effect of 2,5-anhydro-mannitol supplementation. The latter acts in cells as a nonmetabolizable analogue of fructose 1,6-bisphosphate, a known allosteric regulator of one of the tested LDHs. In this strain (SAA023), we achieved over 2-fold increase of lactate productivity. Furthermore, we observed that as carbon is increasingly deviated during growth toward product formation, there is an increased fixation rate in the population of spontaneous mutants harboring an impaired production pathway. This is a challenge in the development of green cell factories, which may be countered by the incorporation in biotechnological processes of strategies such as the one pioneered here.","lang":"eng"}],"quality_controlled":"1","external_id":{"pmid":["27936615"]},"language":[{"iso":"eng"}],"doi":"10.1021/acssynbio.6b00235","publication_identifier":{"issn":["21615063"]},"month":"03","publisher":"American Chemical Society","department":[{"_id":"ToBo"}],"publication_status":"published","pmid":1,"year":"2017","volume":6,"date_created":"2018-12-11T11:46:56Z","date_updated":"2021-01-12T08:01:21Z","author":[{"full_name":"Du, Wei","last_name":"Du","first_name":"Wei"},{"orcid":"0000-0001-8619-2223","id":"4677C796-F248-11E8-B48F-1D18A9856A87","last_name":"Angermayr","first_name":"Andreas","full_name":"Angermayr, Andreas"},{"full_name":"Jongbloets, Joeri","last_name":"Jongbloets","first_name":"Joeri"},{"last_name":"Molenaar","first_name":"Douwe","full_name":"Molenaar, Douwe"},{"first_name":"Herwig","last_name":"Bachmann","full_name":"Bachmann, Herwig"},{"last_name":"Hellingwerf","first_name":"Klaas","full_name":"Hellingwerf, Klaas"},{"last_name":"Branco Dos Santos","first_name":"Filipe","full_name":"Branco Dos Santos, Filipe"}],"publist_id":"7298"},{"month":"01","day":"01","publication_identifier":{"issn":["01668641"]},"publication":"Topology and its Applications","main_file_link":[{"url":"https://arxiv.org/abs/1608.03954v1","open_access":"1"}],"oa":1,"citation":{"short":"K. Austin, Z. Virk, Topology and Its Applications 215 (2017) 45–57.","mla":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” Topology and Its Applications, vol. 215, Elsevier, 2017, pp. 45–57, doi:10.1016/j.topol.2016.10.005.","chicago":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” Topology and Its Applications. Elsevier, 2017. https://doi.org/10.1016/j.topol.2016.10.005.","ama":"Austin K, Virk Z. Higson compactification and dimension raising. Topology and its Applications. 2017;215:45-57. doi:10.1016/j.topol.2016.10.005","apa":"Austin, K., & Virk, Z. (2017). Higson compactification and dimension raising. Topology and Its Applications. Elsevier. https://doi.org/10.1016/j.topol.2016.10.005","ieee":"K. Austin and Z. Virk, “Higson compactification and dimension raising,” Topology and its Applications, vol. 215. Elsevier, pp. 45–57, 2017.","ista":"Austin K, Virk Z. 2017. Higson compactification and dimension raising. Topology and its Applications. 215, 45–57."},"quality_controlled":"1","page":"45 - 57","doi":"10.1016/j.topol.2016.10.005","date_published":"2017-01-01T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful in showing that the classical dimension raising theorems hold in large scale; that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely n-to-1 maps, which include the natural quotient maps via a finite group action, and prove that they preserve the asymptotic dimension.","lang":"eng"}],"publist_id":"7299","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"521","year":"2017","status":"public","title":"Higson compactification and dimension raising","publication_status":"published","publisher":"Elsevier","department":[{"_id":"HeEd"}],"intvolume":" 215","author":[{"full_name":"Austin, Kyle","first_name":"Kyle","last_name":"Austin"},{"id":"2E36B656-F248-11E8-B48F-1D18A9856A87","last_name":"Virk","first_name":"Ziga","full_name":"Virk, Ziga"}],"date_updated":"2021-01-12T08:01:21Z","date_created":"2018-12-11T11:46:56Z","volume":215,"oa_version":"Submitted Version"},{"type":"journal_article","issue":"5","publist_id":"7294","file_date_updated":"2020-07-14T12:46:38Z","abstract":[{"lang":"eng","text":"The Casparian strip is an important barrier regulating water and nutrient uptake into root tissues. New research reveals two peptide signals and their co-receptors play critical roles patterning and maintaining barrier integrity. "}],"extern":1,"_id":"525","year":"2017","acknowledgement":"Biotechnology and Biological Sciences Research Council:\tBBSRC BB/M001806/1 and BB/H020314/1\t","intvolume":" 27","publisher":"Cell Press","status":"public","publication_status":"published","title":"Plant biology: Building barriers… in roots","pubrep_id":"983","author":[{"id":"49E91952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6862-1247","first_name":"Daniel","last_name":"Von Wangenheim","full_name":"Daniel von Wangenheim"},{"full_name":"Goh, Tatsuaki","last_name":"Goh","first_name":"Tatsuaki"},{"full_name":"Dietrich, Daniela","first_name":"Daniela","last_name":"Dietrich"},{"first_name":"Malcolm","last_name":"Bennett","full_name":"Bennett, Malcolm J"}],"file":[{"relation":"main_file","file_id":"5330","date_created":"2018-12-12T10:18:11Z","date_updated":"2020-07-14T12:46:38Z","checksum":"81fd4475c5a2a2c6f4313beeab215ed9","file_name":"IST-2018-983-v1+1_Plant_biology_Building_barriers__in_roots.pdf","access_level":"open_access","content_type":"application/pdf","file_size":2840413,"creator":"system"}],"volume":27,"date_updated":"2021-01-12T08:01:23Z","date_created":"2018-12-11T11:46:58Z","month":"03","day":"06","citation":{"apa":"von Wangenheim, D., Goh, T., Dietrich, D., & Bennett, M. (2017). Plant biology: Building barriers… in roots. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2017.01.060","ieee":"D. von Wangenheim, T. Goh, D. Dietrich, and M. Bennett, “Plant biology: Building barriers… in roots,” Current Biology, vol. 27, no. 5. Cell Press, pp. R172–R174, 2017.","ista":"von Wangenheim D, Goh T, Dietrich D, Bennett M. 2017. Plant biology: Building barriers… in roots. Current Biology. 27(5), R172–R174.","ama":"von Wangenheim D, Goh T, Dietrich D, Bennett M. Plant biology: Building barriers… in roots. Current Biology. 2017;27(5):R172-R174. doi:10.1016/j.cub.2017.01.060","chicago":"Wangenheim, Daniel von, Tatsuaki Goh, Daniela Dietrich, and Malcolm Bennett. “Plant Biology: Building Barriers… in Roots.” Current Biology. Cell Press, 2017. https://doi.org/10.1016/j.cub.2017.01.060.","short":"D. von Wangenheim, T. Goh, D. Dietrich, M. Bennett, Current Biology 27 (2017) R172–R174.","mla":"von Wangenheim, Daniel, et al. “Plant Biology: Building Barriers… in Roots.” Current Biology, vol. 27, no. 5, Cell Press, 2017, pp. R172–74, doi:10.1016/j.cub.2017.01.060."},"oa":1,"main_file_link":[{"url":"https://repository.ist.ac.at/id/eprint/983","open_access":"1"}],"publication":"Current Biology","page":"R172 - R174","quality_controlled":0,"doi":"10.1016/j.cub.2017.01.060","date_published":"2017-03-06T00:00:00Z"},{"doi":"10.1016/j.brainres.2016.12.026","date_published":"2017-02-15T00:00:00Z","citation":{"ama":"Gherghina F, Tica A, Deliu E, Abood M, Brailoiu G, Brǎiloiu E. Effects of VPAC1 activation in nucleus ambiguus neurons. Brain Research. 2017;1657:297-303. doi:10.1016/j.brainres.2016.12.026","ista":"Gherghina F, Tica A, Deliu E, Abood M, Brailoiu G, Brǎiloiu E. 2017. Effects of VPAC1 activation in nucleus ambiguus neurons. Brain Research. 1657, 297–303.","apa":"Gherghina, F., Tica, A., Deliu, E., Abood, M., Brailoiu, G., & Brǎiloiu, E. (2017). Effects of VPAC1 activation in nucleus ambiguus neurons. Brain Research. Elsevier. https://doi.org/10.1016/j.brainres.2016.12.026","ieee":"F. Gherghina, A. Tica, E. Deliu, M. Abood, G. Brailoiu, and E. Brǎiloiu, “Effects of VPAC1 activation in nucleus ambiguus neurons,” Brain Research, vol. 1657. Elsevier, pp. 297–303, 2017.","mla":"Gherghina, Florin, et al. “Effects of VPAC1 Activation in Nucleus Ambiguus Neurons.” Brain Research, vol. 1657, Elsevier, 2017, pp. 297–303, doi:10.1016/j.brainres.2016.12.026.","short":"F. Gherghina, A. Tica, E. Deliu, M. Abood, G. Brailoiu, E. Brǎiloiu, Brain Research 1657 (2017) 297–303.","chicago":"Gherghina, Florin, Andrei Tica, Elena Deliu, Mary Abood, G. Brailoiu, and Eugen Brǎiloiu. “Effects of VPAC1 Activation in Nucleus Ambiguus Neurons.” Brain Research. Elsevier, 2017. https://doi.org/10.1016/j.brainres.2016.12.026."},"publication":"Brain Research","page":"297 - 303","quality_controlled":0,"month":"02","day":"15","author":[{"last_name":"Gherghina","first_name":"Florin","full_name":"Gherghina, Florin L"},{"first_name":"Andrei","last_name":"Tica","full_name":"Tica, Andrei A"},{"last_name":"Deliu","first_name":"Elena","orcid":"0000-0002-7370-5293","id":"37A40D7E-F248-11E8-B48F-1D18A9856A87","full_name":"Elena Deliu"},{"first_name":"Mary","last_name":"Abood","full_name":"Abood, Mary E"},{"full_name":"Brailoiu, G. Christina","first_name":"G.","last_name":"Brailoiu"},{"last_name":"Brǎiloiu","first_name":"Eugen","full_name":"Brǎiloiu, Eugen"}],"volume":1657,"date_created":"2018-12-11T11:46:59Z","date_updated":"2021-01-12T08:01:26Z","acknowledgement":"This study was supported by startup funds from the Jefferson College of Pharmacy, and by the National Institutes of Health DA023204 (to M.E.A) and P30 DA 013429 to Center for Substance Abuse Research, Temple University.","_id":"529","year":"2017","publisher":"Elsevier","intvolume":" 1657","title":"Effects of VPAC1 activation in nucleus ambiguus neurons","publication_status":"published","status":"public","publist_id":"7290","abstract":[{"text":"The pituitary adenylyl cyclase-activating polypeptide (PACAP) and its G protein-coupled receptors, PAC1, VPAC1 and VPAC2 form a system involved in a variety of biological processes. Although some sympathetic stimulatory effects of this system have been reported, its central cardiovascular regulatory properties are poorly characterized. VPAC1 receptors are expressed in the nucleus ambiguus (nAmb), a key center controlling cardiac parasympathetic tone. In this study, we report that selective VPAC1 activation in rhodamine-labeled cardiac vagal preganglionic neurons of the rat nAmb produces inositol 1,4,5-trisphosphate receptor-mediated Ca2+ mobilization, membrane depolarization and activation of P/Q-type Ca2+ channels. In vivo, this pathway converges onto transient reduction in heart rate of conscious rats. Therefore we demonstrate a VPAC1-dependent mechanism in the central parasympathetic regulation of the heart rate, adding to the complexity of PACAP-mediated cardiovascular modulation.","lang":"eng"}],"extern":1,"type":"journal_article"},{"_id":"534","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Finding non-orientable surfaces in 3-Manifolds","intvolume":" 58","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case.","lang":"eng"}],"issue":"4","publication":"Discrete & Computational Geometry","citation":{"ista":"Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 58(4), 871–888.","apa":"Burton, B., de Mesmay, A. N., & Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9900-0","ieee":"B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-Manifolds,” Discrete & Computational Geometry, vol. 58, no. 4. Springer, pp. 871–888, 2017.","ama":"Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 2017;58(4):871-888. doi:10.1007/s00454-017-9900-0","chicago":"Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable Surfaces in 3-Manifolds.” Discrete & Computational Geometry. Springer, 2017. https://doi.org/10.1007/s00454-017-9900-0.","mla":"Burton, Benjamin, et al. “Finding Non-Orientable Surfaces in 3-Manifolds.” Discrete & Computational Geometry, vol. 58, no. 4, Springer, 2017, pp. 871–88, doi:10.1007/s00454-017-9900-0.","short":"B. Burton, A.N. de Mesmay, U. Wagner, Discrete & Computational Geometry 58 (2017) 871–888."},"article_type":"original","page":"871 - 888","date_published":"2017-06-09T00:00:00Z","scopus_import":1,"day":"09","article_processing_charge":"No","year":"2017","publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Springer","author":[{"full_name":"Burton, Benjamin","first_name":"Benjamin","last_name":"Burton"},{"full_name":"De Mesmay, Arnaud N","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","last_name":"De Mesmay","first_name":"Arnaud N"},{"first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}],"related_material":{"record":[{"id":"1379","relation":"earlier_version","status":"public"}]},"date_created":"2018-12-11T11:47:01Z","date_updated":"2023-02-21T17:01:34Z","volume":58,"publist_id":"7283","oa":1,"external_id":{"arxiv":["1602.07907"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.07907"}],"quality_controlled":"1","doi":"10.1007/s00454-017-9900-0","language":[{"iso":"eng"}],"month":"06","publication_identifier":{"issn":["01795376"]}},{"issue":"16","abstract":[{"lang":"ger","text":"Optogenetik und Photopharmakologie ermöglichen präzise räumliche und zeitliche Kontrolle von Proteinwechselwirkung und -funktion in Zellen und Tieren. Optogenetische Methoden, die auf grünes Licht ansprechen und zum Trennen von Proteinkomplexen geeignet sind, sind nichtweitläufig verfügbar, würden jedoch mehrfarbige Experimente zur Beantwortung von biologischen Fragestellungen ermöglichen. Hier demonstrieren wir die Verwendung von Cobalamin(Vitamin B12)-bindenden Domänen von bakteriellen CarH-Transkriptionsfaktoren zur Grünlicht-induzierten Dissoziation von Rezeptoren. Fusioniert mit dem Fibroblasten-W achstumsfaktor-Rezeptor 1 führten diese im Dunkeln in kultivierten Zellen zu Signalaktivität durch Oligomerisierung, welche durch Beleuchten umgehend aufgehoben wurde. In Zebrafischembryonen, die einen derartigen Rezeptor exprimieren, ermöglichte grünes Licht die Kontrolle über abnormale Signalaktivität während der Embryonalentwicklung. "}],"type":"journal_article","file":[{"content_type":"application/pdf","file_size":1668557,"creator":"system","access_level":"open_access","file_name":"IST-2018-932-v1+1_Kainrath_et_al-2017-Angewandte_Chemie.pdf","checksum":"d66fee867e7cdbfa3fe276c2fb0778bb","date_updated":"2020-07-14T12:46:39Z","date_created":"2018-12-12T10:13:24Z","relation":"main_file","file_id":"5007"}],"oa_version":"Published Version","pubrep_id":"932","intvolume":" 129","title":"Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen","ddc":["571"],"status":"public","_id":"538","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","day":"20","date_published":"2017-05-20T00:00:00Z","page":"4679 - 4682","citation":{"ama":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 2017;129(16):4679-4682. doi:10.1002/ange.201611998","ista":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. 2017. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 129(16), 4679–4682.","ieee":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, and H. L. Janovjak, “Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen,” Angewandte Chemie, vol. 129, no. 16. Wiley, pp. 4679–4682, 2017.","apa":"Kainrath, S., Stadler, M., Gschaider-Reichhart, E., Distel, M., & Janovjak, H. L. (2017). Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. Wiley. https://doi.org/10.1002/ange.201611998","mla":"Kainrath, Stephanie, et al. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” Angewandte Chemie, vol. 129, no. 16, Wiley, 2017, pp. 4679–82, doi:10.1002/ange.201611998.","short":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, H.L. Janovjak, Angewandte Chemie 129 (2017) 4679–4682.","chicago":"Kainrath, Stephanie, Manuela Stadler, Eva Gschaider-Reichhart, Martin Distel, and Harald L Janovjak. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” Angewandte Chemie. Wiley, 2017. https://doi.org/10.1002/ange.201611998."},"publication":"Angewandte Chemie","ec_funded":1,"publist_id":"7279","file_date_updated":"2020-07-14T12:46:39Z","volume":129,"date_created":"2018-12-11T11:47:02Z","date_updated":"2021-01-12T08:01:33Z","author":[{"id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","first_name":"Stephanie","last_name":"Kainrath","full_name":"Kainrath, Stephanie"},{"full_name":"Stadler, Manuela","last_name":"Stadler","first_name":"Manuela"},{"full_name":"Gschaider-Reichhart, Eva","last_name":"Gschaider-Reichhart","first_name":"Eva","orcid":"0000-0002-7218-7738","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Distel","first_name":"Martin","full_name":"Distel, Martin"},{"full_name":"Janovjak, Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","first_name":"Harald L","last_name":"Janovjak"}],"department":[{"_id":"CaGu"},{"_id":"HaJa"}],"publisher":"Wiley","publication_status":"published","year":"2017","month":"05","language":[{"iso":"eng"}],"doi":"10.1002/ange.201611998","project":[{"call_identifier":"FP7","name":"Microbial Ion Channels for Synthetic Neurobiology","_id":"25548C20-B435-11E9-9278-68D0E5697425","grant_number":"303564"},{"call_identifier":"FWF","name":"Molecular Drug Targets","_id":"255A6082-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1},{"volume":13,"date_created":"2018-12-11T11:47:03Z","date_updated":"2021-01-12T08:01:48Z","author":[{"first_name":"Kseniya","last_name":"Khamina","full_name":"Khamina, Kseniya"},{"last_name":"Lercher","first_name":"Alexander","full_name":"Lercher, Alexander"},{"last_name":"Caldera","first_name":"Michael","full_name":"Caldera, Michael"},{"first_name":"Christopher","last_name":"Schliehe","full_name":"Schliehe, Christopher"},{"first_name":"Bojan","last_name":"Vilagos","full_name":"Vilagos, Bojan"},{"first_name":"Mehmet","last_name":"Sahin","full_name":"Sahin, Mehmet"},{"full_name":"Kosack, Lindsay","first_name":"Lindsay","last_name":"Kosack"},{"first_name":"Anannya","last_name":"Bhattacharya","full_name":"Bhattacharya, Anannya"},{"full_name":"Májek, Peter","last_name":"Májek","first_name":"Peter"},{"last_name":"Stukalov","first_name":"Alexey","full_name":"Stukalov, Alexey"},{"id":"42C9F57E-F248-11E8-B48F-1D18A9856A87","first_name":"Roberto","last_name":"Sacco","full_name":"Sacco, Roberto"},{"first_name":"Leo","last_name":"James","full_name":"James, Leo"},{"last_name":"Pinschewer","first_name":"Daniel","full_name":"Pinschewer, Daniel"},{"full_name":"Bennett, Keiryn","first_name":"Keiryn","last_name":"Bennett"},{"first_name":"Jörg","last_name":"Menche","full_name":"Menche, Jörg"},{"full_name":"Bergthaler, Andreas","first_name":"Andreas","last_name":"Bergthaler"}],"department":[{"_id":"GaNo"}],"publisher":"Public Library of Science","publication_status":"published","year":"2017","publist_id":"7276","file_date_updated":"2020-07-14T12:46:44Z","article_number":"e1006758","language":[{"iso":"eng"}],"doi":"10.1371/journal.ppat.1006758","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_identifier":{"issn":["15537366"]},"month":"12","file":[{"creator":"system","file_size":4106772,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2018-931-v1+1_journal.ppat.1006758.pdf","checksum":"1aa20f19a1e90664fadce6e7d5284fdc","date_created":"2018-12-12T10:12:26Z","date_updated":"2020-07-14T12:46:44Z","file_id":"4944","relation":"main_file"}],"oa_version":"Published Version","pubrep_id":"931","intvolume":" 13","status":"public","title":"Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein","ddc":["576","616"],"_id":"540","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"12","abstract":[{"text":"RNA-dependent RNA polymerases (RdRps) play a key role in the life cycle of RNA viruses and impact their immunobiology. The arenavirus lymphocytic choriomeningitis virus (LCMV) strain Clone 13 provides a benchmark model for studying chronic infection. A major genetic determinant for its ability to persist maps to a single amino acid exchange in the viral L protein, which exhibits RdRp activity, yet its functional consequences remain elusive. To unravel the L protein interactions with the host proteome, we engineered infectious L protein-tagged LCMV virions by reverse genetics. A subsequent mass-spectrometric analysis of L protein pulldowns from infected human cells revealed a comprehensive network of interacting host proteins. The obtained LCMV L protein interactome was bioinformatically integrated with known host protein interactors of RdRps from other RNA viruses, emphasizing interconnected modules of human proteins. Functional characterization of selected interactors highlighted proviral (DDX3X) as well as antiviral (NKRF, TRIM21) host factors. To corroborate these findings, we infected Trim21-/-mice with LCMV and found impaired virus control in chronic infection. These results provide insights into the complex interactions of the arenavirus LCMV and other viral RdRps with the host proteome and contribute to a better molecular understanding of how chronic viruses interact with their host.","lang":"eng"}],"type":"journal_article","date_published":"2017-12-01T00:00:00Z","citation":{"chicago":"Khamina, Kseniya, Alexander Lercher, Michael Caldera, Christopher Schliehe, Bojan Vilagos, Mehmet Sahin, Lindsay Kosack, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” PLoS Pathogens. Public Library of Science, 2017. https://doi.org/10.1371/journal.ppat.1006758.","mla":"Khamina, Kseniya, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” PLoS Pathogens, vol. 13, no. 12, e1006758, Public Library of Science, 2017, doi:10.1371/journal.ppat.1006758.","short":"K. Khamina, A. Lercher, M. Caldera, C. Schliehe, B. Vilagos, M. Sahin, L. Kosack, A. Bhattacharya, P. Májek, A. Stukalov, R. Sacco, L. James, D. Pinschewer, K. Bennett, J. Menche, A. Bergthaler, PLoS Pathogens 13 (2017).","ista":"Khamina K, Lercher A, Caldera M, Schliehe C, Vilagos B, Sahin M, Kosack L, Bhattacharya A, Májek P, Stukalov A, Sacco R, James L, Pinschewer D, Bennett K, Menche J, Bergthaler A. 2017. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 13(12), e1006758.","apa":"Khamina, K., Lercher, A., Caldera, M., Schliehe, C., Vilagos, B., Sahin, M., … Bergthaler, A. (2017). Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. Public Library of Science. https://doi.org/10.1371/journal.ppat.1006758","ieee":"K. Khamina et al., “Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein,” PLoS Pathogens, vol. 13, no. 12. Public Library of Science, 2017.","ama":"Khamina K, Lercher A, Caldera M, et al. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 2017;13(12). doi:10.1371/journal.ppat.1006758"},"publication":"PLoS Pathogens","has_accepted_license":"1","day":"01","scopus_import":1},{"doi":"10.23638/LMCS-13(2:15)2017","language":[{"iso":"eng"}],"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa":1,"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","call_identifier":"H2020","grant_number":"701309","_id":"2590DB08-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","publication_identifier":{"issn":["18605974"]},"month":"07","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1657"},{"relation":"earlier_version","status":"public","id":"5429"},{"id":"5435","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Křetínská, Zuzana","first_name":"Zuzana","last_name":"Křetínská"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky","full_name":"Kretinsky, Jan"}],"volume":13,"date_created":"2018-12-11T11:46:38Z","date_updated":"2023-02-23T12:26:16Z","year":"2017","department":[{"_id":"KrCh"}],"publisher":"International Federation of Computational Logic","publication_status":"published","publist_id":"7355","ec_funded":1,"file_date_updated":"2020-07-14T12:46:33Z","article_number":"15","date_published":"2017-07-03T00:00:00Z","citation":{"chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(2:15)2017.","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).","mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017.","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2. International Federation of Computational Logic, 2017.","apa":"Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017","ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 2017;13(2). doi:10.23638/LMCS-13(2:15)2017"},"publication":"Logical Methods in Computer Science","has_accepted_license":"1","day":"03","scopus_import":1,"pubrep_id":"957","file":[{"file_id":"5354","relation":"main_file","date_created":"2018-12-12T10:18:32Z","date_updated":"2020-07-14T12:46:33Z","checksum":"bfa405385ec6229ad5ead89ab5751639","file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":511832}],"oa_version":"Published Version","_id":"466","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 13","status":"public","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","ddc":["004"],"issue":"2","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. ","lang":"eng"}],"type":"journal_article"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.03598"}],"oa":1,"external_id":{"arxiv":["1606.03598"]},"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1145/3152769","language":[{"iso":"eng"}],"publication_identifier":{"issn":["15293785"]},"month":"12","year":"2017","publisher":"ACM","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","related_material":{"record":[{"id":"1656","status":"public","relation":"earlier_version"},{"id":"5415","status":"public","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5436"}]},"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan"}],"volume":18,"date_created":"2018-12-11T11:46:38Z","date_updated":"2023-02-23T12:26:19Z","article_number":"31","ec_funded":1,"publist_id":"7354","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3152769","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 2017;18(4). doi:10.1145/3152769","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017)."},"publication":"ACM Transactions on Computational Logic (TOCL)","date_published":"2017-12-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"467","intvolume":" 18","status":"public","title":"Nested weighted automata","oa_version":"Preprint","type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}]},{"language":[{"iso":"eng"}],"doi":"10.23638/LMCS-13(3:23)2017","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"}],"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa":1,"month":"09","publication_identifier":{"issn":["18605974"]},"date_updated":"2023-02-23T12:26:25Z","date_created":"2018-12-11T11:46:37Z","volume":13,"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"}],"related_material":{"record":[{"id":"1610","status":"public","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5438"}]},"publication_status":"published","publisher":"International Federation of Computational Logic","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"year":"2017","file_date_updated":"2020-07-14T12:46:33Z","publist_id":"7356","ec_funded":1,"date_published":"2017-09-13T00:00:00Z","publication":"Logical Methods in Computer Science","citation":{"ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017."},"day":"13","has_accepted_license":"1","scopus_import":1,"oa_version":"Published Version","file":[{"file_id":"5090","relation":"main_file","date_updated":"2020-07-14T12:46:33Z","date_created":"2018-12-12T10:14:37Z","checksum":"08041379ba408d40664f449eb5907a8f","file_name":"IST-2015-321-v1+1_main.pdf","access_level":"open_access","creator":"system","file_size":279071,"content_type":"application/pdf"},{"checksum":"08041379ba408d40664f449eb5907a8f","date_updated":"2020-07-14T12:46:33Z","date_created":"2018-12-12T10:14:38Z","relation":"main_file","file_id":"5091","content_type":"application/pdf","file_size":279071,"creator":"system","access_level":"open_access","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf"}],"pubrep_id":"955","title":"Edit distance for pushdown automata","ddc":["004"],"status":"public","intvolume":" 13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"465","abstract":[{"lang":"eng","text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. "}],"issue":"3","type":"journal_article"},{"publication_identifier":{"issn":["20452322"]},"month":"03","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1038/s41598-017-00107-w","article_number":"82","publist_id":"7307","ec_funded":1,"file_date_updated":"2020-07-14T12:46:36Z","publisher":"Nature Publishing Group","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2017","volume":7,"date_created":"2018-12-11T11:46:53Z","date_updated":"2023-02-23T12:26:57Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5449"}]},"author":[{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas"},{"full_name":"Tkadlec, Josef","last_name":"Tkadlec","first_name":"Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"scopus_import":1,"article_processing_charge":"No","has_accepted_license":"1","day":"06","citation":{"apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-017-00107-w","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1. Nature Publishing Group, 2017.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 2017;7(1). doi:10.1038/s41598-017-00107-w","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/s41598-017-00107-w.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017).","mla":"Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports, vol. 7, no. 1, 82, Nature Publishing Group, 2017, doi:10.1038/s41598-017-00107-w."},"publication":"Scientific Reports","date_published":"2017-03-06T00:00:00Z","type":"journal_article","issue":"1","abstract":[{"text":"The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Cometswarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively. ","lang":"eng"}],"intvolume":" 7","status":"public","title":"Amplification on undirected population structures: Comets beat stars","ddc":["004"],"_id":"512","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2018-938-v1+1_2017_Pavlogiannis_Amplification_on.pdf","creator":"system","content_type":"application/pdf","file_size":1536783,"file_id":"5357","relation":"main_file","checksum":"7d05cbdd914e194a019c0f91fb64e9a8","date_updated":"2020-07-14T12:46:36Z","date_created":"2018-12-12T10:18:35Z"}],"pubrep_id":"938"},{"publication_identifier":{"eissn":["2475-1421"]},"month":"12","language":[{"iso":"eng"}],"doi":"10.1145/3158118","conference":{"name":"POPL: Programming Languages","location":"Los Angeles, CA, United States","start_date":"2018-01-07","end_date":"2018-01-13"},"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["1910.00241"]},"ec_funded":1,"file_date_updated":"2021-12-07T08:06:28Z","article_number":"30","volume":2,"date_updated":"2023-02-23T12:27:13Z","date_created":"2021-12-05T23:01:48Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5455"}]},"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Choudhary, Bhavya","last_name":"Choudhary","first_name":"Bhavya"},{"last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas"}],"department":[{"_id":"KrCh"}],"publisher":"Association for Computing Machinery","publication_status":"published","year":"2017","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant (279307: Graph Games).\r\n","article_processing_charge":"No","has_accepted_license":"1","day":"27","scopus_import":"1","date_published":"2017-12-27T00:00:00Z","article_type":"original","citation":{"ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158118","apa":"Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158118","ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2(POPL), 30.","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 2 (2017).","mla":"Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 30, Association for Computing Machinery, 2017, doi:10.1145/3158118.","chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158118."},"publication":"Proceedings of the ACM on Programming Languages","issue":"POPL","abstract":[{"text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graph where the edges are labeled with different types of opening and closing parentheses, and the reachability information is computed via paths whose parentheses are properly matched. We present new results for Dyck reachability problems with applications to alias analysis and data-dependence analysis. Our main contributions, that include improved upper bounds as well as lower bounds that establish optimality guarantees, are as follows: First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph with n nodes and m edges, we present: (i) an algorithm with worst-case running time O(m + n · α(n)), where α(n) is the inverse Ackermann function, improving the previously known O(n2) time bound; (ii) a matching lower bound that shows that our algorithm is optimal wrt to worst-case complexity; and (iii) an optimal average-case upper bound of O(m) time, improving the previously known O(m · logn) bound. Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtain analysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is only linear, and only wrt the number of call sites. Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean Matrix Multiplication, which is a long-standing open problem. Thus we establish that the existing combinatorial algorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the same hardness holds for graphs of constant treewidth. Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependence analysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform all existing methods on the two problems, over real-world benchmarks.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2017_ACMProgLang_Chatterjee.pdf","file_size":460188,"content_type":"application/pdf","creator":"cchlebak","relation":"main_file","file_id":"10421","checksum":"faa3f7b3fe8aab84b50ed805c26a0ee5","success":1,"date_created":"2021-12-07T08:06:28Z","date_updated":"2021-12-07T08:06:28Z"}],"intvolume":" 2","status":"public","title":"Optimal Dyck reachability for data-dependence and Alias analysis","ddc":["000"],"_id":"10416","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"file_date_updated":"2020-07-14T12:46:59Z","year":"2017","department":[{"_id":"KrCh"}],"publisher":"IST Austria","publication_status":"published","related_material":{"record":[{"id":"10416","status":"public","relation":"later_version"}]},"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Choudhary, Bhavya","first_name":"Bhavya","last_name":"Choudhary"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","first_name":"Andreas","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas"}],"date_updated":"2023-02-21T15:54:10Z","date_created":"2018-12-12T11:39:26Z","publication_identifier":{"issn":["2664-1690"]},"month":"10","oa":1,"doi":"10.15479/AT:IST-2017-870-v1-1","language":[{"iso":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"abstract":[{"text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graphwhere the edges are labeled with different types of opening and closing parentheses, and the reachabilityinformation is computed via paths whose parentheses are properly matched. We present new results for Dyckreachability problems with applications to alias analysis and data-dependence analysis. Our main contributions,that include improved upper bounds as well as lower bounds that establish optimality guarantees, are asfollows:First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph withnnodes andmedges, we present: (i) an algorithmwith worst-case running timeO(m+n·α(n)), whereα(n)is the inverse Ackermann function, improving thepreviously knownO(n2)time bound; (ii) a matching lower bound that shows that our algorithm is optimalwrt to worst-case complexity; and (iii) an optimal average-case upper bound ofO(m)time, improving thepreviously knownO(m·logn)bound.Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtainanalysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almostlinear time, after which the contribution of the library in the complexity of the client analysis is only linear,and only wrt the number of call sites.Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean MatrixMultiplication, which is a long-standing open problem. Thus we establish that the existing combinatorialalgorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the samehardness holds for graphs of constant treewidth.Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependenceanalysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform allexisting methods on the two problems, over real-world benchmarks.","lang":"eng"}],"_id":"5455","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Optimal Dyck reachability for data-dependence and alias analysis","ddc":["000"],"status":"public","pubrep_id":"870","file":[{"creator":"system","content_type":"application/pdf","file_size":960491,"access_level":"open_access","file_name":"IST-2017-870-v1+1_main.pdf","checksum":"177a84a46e3ac17e87b31534ad16a4c9","date_created":"2018-12-12T11:54:02Z","date_updated":"2020-07-14T12:46:59Z","file_id":"5524","relation":"main_file"}],"oa_version":"Published Version","has_accepted_license":"1","article_processing_charge":"No","day":"23","citation":{"short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for Data-Dependence and Alias Analysis, IST Austria, 2017.","mla":"Chatterjee, Krishnendu, et al. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017, doi:10.15479/AT:IST-2017-870-v1-1.","chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-870-v1-1.","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria; 2017. doi:10.15479/AT:IST-2017-870-v1-1","ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.","apa":"Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria. https://doi.org/10.15479/AT:IST-2017-870-v1-1","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and alias analysis, IST Austria, 37p."},"page":"37","date_published":"2017-10-23T00:00:00Z"},{"file":[{"file_name":"IST-2017-724-v1+1_DataRep_Project_Report_2017.pdf","access_level":"open_access","creator":"system","file_size":3460985,"content_type":"application/pdf","file_id":"5483","relation":"main_file","date_created":"2018-12-12T11:53:22Z","date_updated":"2020-07-14T12:46:59Z","checksum":"6321792dcfa82bf490f17615a9b22355"}],"date_updated":"2020-07-14T23:05:03Z","date_created":"2018-12-12T11:39:24Z","pubrep_id":"724","author":[{"first_name":"Barbara","last_name":"Petritsch","id":"406048EC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2724-4614","full_name":"Barbara Petritsch"}],"department":[{"_id":"E-Lib"}],"publisher":"IST Austria","status":"public","title":"Implementing the institutional data repository IST DataRep","year":"2017","_id":"5450","extern":0,"file_date_updated":"2020-07-14T12:46:59Z","abstract":[{"lang":"eng","text":"In this report the implementation of the institutional data repository IST DataRep at IST Austria will be covered: Starting with the research phase when requirements for a repository were established, the procedure of choosing a repository-software and its customization based on the results of user-testings will be discussed. Followed by reflections on the marketing strategies in regard of impact, and at the end sharing some experiences of one year operating IST DataRep."}],"type":"report","date_published":"2017-06-26T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://repository.ist.ac.at/id/eprint/724."}],"oa":1,"publication_date":"2017-06-26","citation":{"chicago":"Petritsch, Barbara. Implementing the Institutional Data Repository IST DataRep. IST Austria, 2017.","mla":"Petritsch, Barbara. Implementing the Institutional Data Repository IST DataRep. IST Austria, 2017.","short":"B. Petritsch, Implementing the Institutional Data Repository IST DataRep, IST Austria, 2017.","ista":"Petritsch B. 2017. Implementing the institutional data repository IST DataRep, IST Austria,p.","ieee":"B. Petritsch, Implementing the institutional data repository IST DataRep. IST Austria, 2017.","apa":"Petritsch, B. (2017). Implementing the institutional data repository IST DataRep. IST Austria.","ama":"Petritsch B. Implementing the Institutional Data Repository IST DataRep. IST Austria; 2017."},"day":"26","month":"06"},{"ec_funded":1,"article_number":"31","date_created":"2021-12-05T23:01:49Z","date_updated":"2023-02-23T12:27:16Z","volume":2,"author":[{"last_name":"Chalupa","first_name":"Marek","full_name":"Chalupa, Marek"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"},{"last_name":"Sinha","first_name":"Nishant","full_name":"Sinha, Nishant"},{"last_name":"Vaidya","first_name":"Kapil","full_name":"Vaidya, Kapil"}],"related_material":{"record":[{"id":"5448","relation":"earlier_version","status":"public"},{"id":"5456","relation":"earlier_version","status":"public"}]},"publication_status":"published","publisher":"Association for Computing Machinery","department":[{"_id":"KrCh"}],"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF\r\nNFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Czech\r\nScience Foundation grant GBP202/12/G061.","year":"2017","month":"12","publication_identifier":{"eissn":["2475-1421"]},"language":[{"iso":"eng"}],"conference":{"location":"Los Angeles, CA, United States","start_date":"2018-01-07","end_date":"2018-01-13","name":"POPL: Programming Languages"},"doi":"10.1145/3158119","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"oa":1,"external_id":{"arxiv":["1610.01188"]},"main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/10.1145/3158119"}],"abstract":[{"lang":"eng","text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\n\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence."}],"issue":"POPL","type":"journal_article","oa_version":"Published Version","status":"public","title":"Data-centric dynamic partial order reduction","intvolume":" 2","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10417","day":"27","article_processing_charge":"No","scopus_import":"1","date_published":"2017-12-27T00:00:00Z","article_type":"original","publication":"Proceedings of the ACM on Programming Languages","citation":{"ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2(POPL), 31.","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158119","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158119","chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158119.","mla":"Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 31, Association for Computing Machinery, 2017, doi:10.1145/3158119.","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2017)."}},{"author":[{"full_name":"Chalupa, Marek","first_name":"Marek","last_name":"Chalupa"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","first_name":"Andreas","last_name":"Pavlogiannis"},{"first_name":"Nishant","last_name":"Sinha","full_name":"Sinha, Nishant"},{"full_name":"Vaidya, Kapil","first_name":"Kapil","last_name":"Vaidya"}],"pubrep_id":"872","related_material":{"record":[{"id":"10417","status":"public","relation":"later_version"},{"relation":"earlier_version","status":"public","id":"5448"}]},"date_updated":"2023-02-23T12:26:54Z","date_created":"2018-12-12T11:39:26Z","oa_version":"Published Version","file":[{"creator":"system","content_type":"application/pdf","file_size":910347,"file_name":"IST-2017-872-v1+1_main.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:59Z","date_created":"2018-12-12T11:53:26Z","checksum":"d2635c4cf013000f0a1b09e80f9e4ab7","file_id":"5487","relation":"main_file"}],"_id":"5456","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017","title":"Data-centric dynamic partial order reduction","ddc":["000"],"status":"public","publication_status":"published","publisher":"IST Austria","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:59Z","abstract":[{"text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.\r\n1. For acyclic architectures, our algorithm is guaranteed to explore exactly one representative trace from each observation class, while spending polynomial time per class. Hence, our algorithm is optimal wrt the observation equivalence, and in several cases explores exponentially fewer traces than any enumerative method based on the Mazurkiewicz equivalence.\r\n2. For cyclic architectures, we consider an equivalence between traces which is finer than the observation equivalence; but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence. \r\nFinally, we perform a basic experimental comparison between the existing Mazurkiewicz-based DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show a significant reduction in both running time and the number of explored equivalence classes.","lang":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"date_published":"2017-10-23T00:00:00Z","doi":"10.15479/AT:IST-2017-872-v1-1","language":[{"iso":"eng"}],"citation":{"chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-872-v1-1.","mla":"Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017, doi:10.15479/AT:IST-2017-872-v1-1.","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p.","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. IST Austria. https://doi.org/10.15479/AT:IST-2017-872-v1-1","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.","ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-Centric Dynamic Partial Order Reduction. IST Austria; 2017. doi:10.15479/AT:IST-2017-872-v1-1"},"oa":1,"page":"36","month":"10","day":"23","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]}},{"file_date_updated":"2020-07-14T12:47:00Z","publist_id":"7263","article_number":"61","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"date_created":"2018-12-11T11:47:08Z","date_updated":"2021-01-12T08:02:34Z","volume":83,"year":"2017","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"month":"11","publication_identifier":{"isbn":["978-395977046-0"]},"conference":{"end_date":"2017-08-25","location":"Aalborg, Denmark","start_date":"2017-08-21","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"doi":"10.4230/LIPIcs.MFCS.2017.61","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","abstract":[{"text":"Evolutionary graph theory studies the evolutionary dynamics in a population structure given as a connected graph. Each node of the graph represents an individual of the population, and edges determine how offspring are placed. We consider the classical birth-death Moran process where there are two types of individuals, namely, the residents with fitness 1 and mutants with fitness r. The fitness indicates the reproductive strength. The evolutionary dynamics happens as follows: in the initial step, in a population of all resident individuals a mutant is introduced, and then at each step, an individual is chosen proportional to the fitness of its type to reproduce, and the offspring replaces a neighbor uniformly at random. The process stops when all individuals are either residents or mutants. The probability that all individuals in the end are mutants is called the fixation probability, which is a key factor in the rate of evolution. We consider the problem of approximating the fixation probability. The class of algorithms that is extremely relevant for approximation of the fixation probabilities is the Monte-Carlo simulation of the process. Previous results present a polynomial-time Monte-Carlo algorithm for undirected graphs when r is given in unary. First, we present a simple modification: instead of simulating each step, we discard ineffective steps, where no node changes type (i.e., either residents replace residents, or mutants replace mutants). Using the above simple modification and our result that the number of effective steps is concentrated around the expected number of effective steps, we present faster polynomial-time Monte-Carlo algorithms for undirected graphs. Our algorithms are always at least a factor O(n2/ log n) faster as compared to the previous algorithms, where n is the number of nodes, and is polynomial even if r is given in binary. We also present lower bounds showing that the upper bound on the expected number of effective steps we present is asymptotically tight for undirected graphs. ","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"pubrep_id":"924","file":[{"creator":"system","content_type":"application/pdf","file_size":535077,"access_level":"open_access","file_name":"IST-2018-924-v1+1_LIPIcs-MFCS-2017-61.pdf","checksum":"2eed5224c0e4e259484a1d71acb8ba6a","date_created":"2018-12-12T10:18:04Z","date_updated":"2020-07-14T12:47:00Z","file_id":"5322","relation":"main_file"}],"oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"551","status":"public","title":"Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs","ddc":["004"],"intvolume":" 83","day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2017-11-01T00:00:00Z","publication":"Leibniz International Proceedings in Informatics","citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 61.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.61","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.61","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.","mla":"Chatterjee, Krishnendu, et al. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” Leibniz International Proceedings in Informatics, vol. 83, 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.61.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017."}},{"abstract":[{"lang":"eng","text":"Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a meanpayoff condition). There are two variants of the problem, namely, the threshold problem where the quantitative goal is to ensure that the mean-payoff value is above a threshold, and the value problem where the quantitative goal is to ensure the optimal mean-payoff value; in both cases ensuring the qualitative parity objective. The previous best-known algorithms for game graphs with n vertices, m edges, parity objectives with d priorities, and maximal absolute reward value W for mean-payoff objectives, are as follows: O(nd+1 . m . w) for the threshold problem, and O(nd+2 · m · W) for the value problem. Our main contributions are faster algorithms, and the running times of our algorithms are as follows: O(nd-1 · m ·W) for the threshold problem, and O(nd · m · W · log(n · W)) for the value problem. For mean-payoff parity objectives with two priorities, our algorithms match the best-known bounds of the algorithms for mean-payoff games (without conjunction with parity objectives). Our results are relevant in synthesis of reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective)."}],"alternative_title":["LIPIcs"],"type":"conference","oa_version":"Published Version","file":[{"checksum":"c67f4866ddbfd555afef1f63ae9a8fc7","date_created":"2018-12-12T10:16:57Z","date_updated":"2020-07-14T12:47:00Z","relation":"main_file","file_id":"5248","file_size":610339,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf"}],"pubrep_id":"923","intvolume":" 83","ddc":["004"],"title":"Faster algorithms for mean-payoff parity games","status":"public","_id":"552","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2017-11-01T00:00:00Z","citation":{"chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.","short":"K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean-Payoff Parity Games.” Leibniz International Proceedings in Informatics, vol. 83, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.39.","ieee":"K. Chatterjee, M. H. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","apa":"Chatterjee, K., Henzinger, M. H., & Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.39","ista":"Chatterjee K, Henzinger MH, Svozil A. 2017. Faster algorithms for mean-payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 39.","ama":"Chatterjee K, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.39"},"publication":"Leibniz International Proceedings in Informatics","license":"https://creativecommons.org/licenses/by/3.0/","publist_id":"7262","ec_funded":1,"file_date_updated":"2020-07-14T12:47:00Z","article_number":"39","volume":83,"date_updated":"2023-02-14T10:06:46Z","date_created":"2018-12-11T11:47:08Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Svozil","first_name":"Alexander","full_name":"Svozil, Alexander"}],"department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2017","publication_identifier":{"isbn":["978-395977046-0"]},"month":"11","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2017.39","conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","location":"Aalborg, Denmark","start_date":"2017-08-21","end_date":"2017-08-25"},"project":[{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"}},{"doi":"10.4230/LIPIcs.MFCS.2017.55","conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","start_date":"2017-08-21","location":"Aalborg, Denmark","end_date":"2017-08-25"},"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"main_file_link":[{"url":"https://arxiv.org/abs/1506.02434","open_access":"1"}],"oa":1,"quality_controlled":"1","publication_identifier":{"isbn":["978-395977046-0"]},"month":"11","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Hansen, Kristofer","first_name":"Kristofer","last_name":"Hansen"},{"full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"}],"volume":83,"date_updated":"2021-01-12T08:02:35Z","date_created":"2018-12-11T11:47:08Z","year":"2017","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication_status":"published","publist_id":"7261","file_date_updated":"2020-07-14T12:47:00Z","article_number":"55","date_published":"2017-11-01T00:00:00Z","citation":{"chicago":"Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.","short":"K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.” Leibniz International Proceedings in Informatics, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.55.","ieee":"K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","apa":"Chatterjee, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.55","ista":"Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 55.","ama":"Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent safety games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.55"},"publication":"Leibniz International Proceedings in Informatics","has_accepted_license":"1","day":"01","scopus_import":1,"pubrep_id":"922","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf","creator":"system","content_type":"application/pdf","file_size":549967,"file_id":"4753","relation":"main_file","checksum":"7101facb56ade363205c695d72dbd173","date_updated":"2020-07-14T12:47:00Z","date_created":"2018-12-12T10:09:29Z"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"553","intvolume":" 83","status":"public","ddc":["004"],"title":"Strategy complexity of concurrent safety games","abstract":[{"lang":"eng","text":"We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. Player 1 wins iff a designated goal state is eventually visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed. Our main results are as follows: We show that: (i) the optimal bound on the patience of optimal and -optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. "}],"type":"conference","alternative_title":["LIPIcs"]},{"oa_version":"Submitted Version","_id":"560","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 473","title":"On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions","status":"public","issue":"2207","abstract":[{"text":"In a recent article (Jentzen et al. 2016 Commun. Math. Sci. 14, 1477–1500 (doi:10.4310/CMS.2016.v14. n6.a1)), it has been established that, for every arbitrarily slow convergence speed and every natural number d ? {4, 5, . . .}, there exist d-dimensional stochastic differential equations with infinitely often differentiable and globally bounded coefficients such that no approximation method based on finitely many observations of the driving Brownian motion can converge in absolute mean to the solution faster than the given speed of convergence. In this paper, we strengthen the above result by proving that this slow convergence phenomenon also arises in two (d = 2) and three (d = 3) space dimensions.","lang":"eng"}],"type":"journal_article","date_published":"2017-11-01T00:00:00Z","citation":{"mla":"Gerencser, Mate, et al. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 473, no. 2207, 0104, Royal Society of London, 2017, doi:10.1098/rspa.2017.0104.","short":"M. Gerencser, A. Jentzen, D. Salimova, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 473 (2017).","chicago":"Gerencser, Mate, Arnulf Jentzen, and Diyora Salimova. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2017. https://doi.org/10.1098/rspa.2017.0104.","ama":"Gerencser M, Jentzen A, Salimova D. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2017;473(2207). doi:10.1098/rspa.2017.0104","ista":"Gerencser M, Jentzen A, Salimova D. 2017. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 473(2207), 0104.","apa":"Gerencser, M., Jentzen, A., & Salimova, D. (2017). On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London. https://doi.org/10.1098/rspa.2017.0104","ieee":"M. Gerencser, A. Jentzen, and D. Salimova, “On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 473, no. 2207. Royal Society of London, 2017."},"publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","day":"01","scopus_import":1,"author":[{"last_name":"Gerencser","first_name":"Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","full_name":"Gerencser, Mate"},{"full_name":"Jentzen, Arnulf","first_name":"Arnulf","last_name":"Jentzen"},{"full_name":"Salimova, Diyora","last_name":"Salimova","first_name":"Diyora"}],"volume":473,"date_updated":"2021-01-12T08:03:04Z","date_created":"2018-12-11T11:47:11Z","year":"2017","publisher":"Royal Society of London","department":[{"_id":"JaMa"}],"publication_status":"published","publist_id":"7256","ec_funded":1,"article_number":"0104","doi":"10.1098/rspa.2017.0104","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1702.03229"}],"oa":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"quality_controlled":"1","publication_identifier":{"issn":["13645021"]},"month":"11"},{"publist_id":"7247","ec_funded":1,"year":"2017","department":[{"_id":"LaEr"}],"publisher":"American Mathematical Society","publication_status":"published","author":[{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László"},{"full_name":"Yau, Horng","first_name":"Horng","last_name":"Yau"}],"volume":28,"date_created":"2018-12-11T11:47:13Z","date_updated":"2022-05-24T06:57:28Z","publication_identifier":{"eisbn":["978-1-4704-4194-4"],"isbn":["9-781-4704-3648-3"]},"month":"01","project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"quality_controlled":"1","doi":"10.1090/cln/028","language":[{"iso":"eng"}],"type":"book","alternative_title":["Courant Lecture Notes"],"abstract":[{"text":"This book is a concise and self-contained introduction of recent techniques to prove local spectral universality for large random matrices. Random matrix theory is a fast expanding research area, and this book mainly focuses on the methods that the authors participated in developing over the past few years. Many other interesting topics are not included, and neither are several new developments within the framework of these methods. The authors have chosen instead to present key concepts that they believe are the core of these methods and should be relevant for future applications. They keep technicalities to a minimum to make the book accessible to graduate students. With this in mind, they include in this book the basic notions and tools for high-dimensional analysis, such as large deviation, entropy, Dirichlet form, and the logarithmic Sobolev inequality.\r\n","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"567","intvolume":" 28","title":"A Dynamical Approach to Random Matrix Theory","status":"public","oa_version":"None","series_title":"Courant Lecture Notes","article_processing_charge":"No","day":"01","citation":{"mla":"Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix Theory. Vol. 28, American Mathematical Society, 2017, doi:10.1090/cln/028.","short":"L. Erdös, H. Yau, A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 2017.","chicago":"Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix Theory. Vol. 28. Courant Lecture Notes. American Mathematical Society, 2017. https://doi.org/10.1090/cln/028.","ama":"Erdös L, Yau H. A Dynamical Approach to Random Matrix Theory. Vol 28. American Mathematical Society; 2017. doi:10.1090/cln/028","ista":"Erdös L, Yau H. 2017. A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 226p.","apa":"Erdös, L., & Yau, H. (2017). A Dynamical Approach to Random Matrix Theory (Vol. 28). American Mathematical Society. https://doi.org/10.1090/cln/028","ieee":"L. Erdös and H. Yau, A Dynamical Approach to Random Matrix Theory, vol. 28. American Mathematical Society, 2017."},"page":"226","date_published":"2017-01-01T00:00:00Z"},{"publisher":"International Press","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"publication_status":"published","year":"2017","volume":19,"date_updated":"2021-01-12T08:03:12Z","date_created":"2018-12-11T11:47:14Z","author":[{"id":"473294AE-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Franek","full_name":"Franek, Peter"},{"full_name":"Krcál, Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","last_name":"Krcál","first_name":"Marek"}],"ec_funded":1,"publist_id":"7246","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"701309","_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1507.04310"}],"language":[{"iso":"eng"}],"doi":"10.4310/HHA.2017.v19.n2.a16","publication_identifier":{"issn":["15320073"]},"month":"01","intvolume":" 19","status":"public","title":"Persistence of zero sets","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"568","oa_version":"Submitted Version","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the family Z< r(f) := (g-1(0): ||g - f|| < r) of all zero sets of all continuous maps g closer to f than r in the max-norm. All of these sets are outside A := (x: |f(x)| ≥ r) and we claim that Z< r(f) is fully determined by A and an element of a certain cohomotopy group which (by a recent result) is computable whenever the dimension of X is at most 2n - 3. By considering all r > 0 simultaneously, the pointed cohomotopy groups form a persistence module-a structure leading to persistence diagrams as in the case of persistent homology or well groups. Eventually, we get a descriptor of persistent robust properties of zero sets that has better descriptive power (Theorem A) and better computability status (Theorem B) than the established well diagrams. Moreover, if we endow every point of each zero set with gradients of the perturbation, the robust description of the zero sets by elements of cohomotopy groups is in some sense the best possible (Theorem C)."}],"page":"313 - 342","citation":{"ama":"Franek P, Krcál M. Persistence of zero sets. Homology, Homotopy and Applications. 2017;19(2):313-342. doi:10.4310/HHA.2017.v19.n2.a16","ista":"Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 313–342.","ieee":"P. Franek and M. Krcál, “Persistence of zero sets,” Homology, Homotopy and Applications, vol. 19, no. 2. International Press, pp. 313–342, 2017.","apa":"Franek, P., & Krcál, M. (2017). Persistence of zero sets. Homology, Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2017.v19.n2.a16","mla":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy and Applications, vol. 19, no. 2, International Press, 2017, pp. 313–42, doi:10.4310/HHA.2017.v19.n2.a16.","short":"P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.","chicago":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy and Applications. International Press, 2017. https://doi.org/10.4310/HHA.2017.v19.n2.a16."},"publication":"Homology, Homotopy and Applications","date_published":"2017-01-01T00:00:00Z","scopus_import":1,"day":"01"},{"publication_status":"published","department":[{"_id":"CaGu"},{"_id":"JoBo"},{"_id":"NiBa"}],"publisher":"eLife Sciences Publications","year":"2017","date_updated":"2021-01-12T08:03:15Z","date_created":"2018-12-11T11:47:14Z","volume":6,"author":[{"full_name":"Lagator, Mato","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","first_name":"Mato","last_name":"Lagator"},{"full_name":"Sarikas, Srdjan","id":"35F0286E-F248-11E8-B48F-1D18A9856A87","last_name":"Sarikas","first_name":"Srdjan"},{"full_name":"Acar, Hande","last_name":"Acar","first_name":"Hande","orcid":"0000-0003-1986-9753","id":"2DDF136A-F248-11E8-B48F-1D18A9856A87"},{"id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4624-4612","first_name":"Jonathan P","last_name":"Bollback","full_name":"Bollback, Jonathan P"},{"first_name":"Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C"}],"article_number":"e28921","file_date_updated":"2020-07-14T12:47:10Z","publist_id":"7244","ec_funded":1,"quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"},{"name":"Selective Barriers to Horizontal Gene Transfer","call_identifier":"H2020","grant_number":"648440","_id":"2578D616-B435-11E9-9278-68D0E5697425"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.7554/eLife.28921","month":"11","publication_identifier":{"issn":["2050084X"]},"ddc":["576"],"title":"Regulatory network structure determines patterns of intermolecular epistasis","status":"public","intvolume":" 6","_id":"570","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"5096","relation":"main_file","date_created":"2018-12-12T10:14:42Z","date_updated":"2020-07-14T12:47:10Z","checksum":"273ab17f33305e4eaafd911ff88e7c5b","file_name":"IST-2017-918-v1+1_elife-28921-figures-v3.pdf","access_level":"open_access","creator":"system","file_size":8453470,"content_type":"application/pdf"},{"file_name":"IST-2017-918-v1+2_elife-28921-v3.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1953221,"creator":"system","relation":"main_file","file_id":"5097","date_created":"2018-12-12T10:14:43Z","date_updated":"2020-07-14T12:47:10Z","checksum":"b433f90576c7be597cd43367946f8e7f"}],"oa_version":"Published Version","pubrep_id":"918","type":"journal_article","abstract":[{"text":"Most phenotypes are determined by molecular systems composed of specifically interacting molecules. However, unlike for individual components, little is known about the distributions of mutational effects of molecular systems as a whole. We ask how the distribution of mutational effects of a transcriptional regulatory system differs from the distributions of its components, by first independently, and then simultaneously, mutating a transcription factor and the associated promoter it represses. We find that the system distribution exhibits increased phenotypic variation compared to individual component distributions - an effect arising from intermolecular epistasis between the transcription factor and its DNA-binding site. In large part, this epistasis can be qualitatively attributed to the structure of the transcriptional regulatory system and could therefore be a common feature in prokaryotes. Counter-intuitively, intermolecular epistasis can alleviate the constraints of individual components, thereby increasing phenotypic variation that selection could act on and facilitating adaptive evolution. ","lang":"eng"}],"publication":"eLife","citation":{"ama":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 2017;6. doi:10.7554/eLife.28921","ista":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. 2017. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 6, e28921.","ieee":"M. Lagator, S. Sarikas, H. Acar, J. P. Bollback, and C. C. Guet, “Regulatory network structure determines patterns of intermolecular epistasis,” eLife, vol. 6. eLife Sciences Publications, 2017.","apa":"Lagator, M., Sarikas, S., Acar, H., Bollback, J. P., & Guet, C. C. (2017). Regulatory network structure determines patterns of intermolecular epistasis. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.28921","mla":"Lagator, Mato, et al. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife, vol. 6, e28921, eLife Sciences Publications, 2017, doi:10.7554/eLife.28921.","short":"M. Lagator, S. Sarikas, H. Acar, J.P. Bollback, C.C. Guet, ELife 6 (2017).","chicago":"Lagator, Mato, Srdjan Sarikas, Hande Acar, Jonathan P Bollback, and Calin C Guet. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.28921."},"date_published":"2017-11-13T00:00:00Z","scopus_import":1,"day":"13","has_accepted_license":"1"},{"date_published":"2017-11-06T00:00:00Z","citation":{"mla":"Spira, Felix, et al. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” ELife, vol. 6, e30867, eLife Sciences Publications, 2017, doi:10.7554/eLife.30867.","short":"F. Spira, S. Cuylen Haering, S. Mehta, M. Samwer, A. Reversat, A. Verma, R. Oldenbourg, M.K. Sixt, D. Gerlich, ELife 6 (2017).","chicago":"Spira, Felix, Sara Cuylen Haering, Shalin Mehta, Matthias Samwer, Anne Reversat, Amitabh Verma, Rudolf Oldenbourg, Michael K Sixt, and Daniel Gerlich. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.30867.","ama":"Spira F, Cuylen Haering S, Mehta S, et al. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 2017;6. doi:10.7554/eLife.30867","ista":"Spira F, Cuylen Haering S, Mehta S, Samwer M, Reversat A, Verma A, Oldenbourg R, Sixt MK, Gerlich D. 2017. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 6, e30867.","apa":"Spira, F., Cuylen Haering, S., Mehta, S., Samwer, M., Reversat, A., Verma, A., … Gerlich, D. (2017). Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.30867","ieee":"F. Spira et al., “Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments,” eLife, vol. 6. eLife Sciences Publications, 2017."},"publication":"eLife","has_accepted_license":"1","day":"06","scopus_import":1,"oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:47:10Z","date_created":"2018-12-12T10:10:40Z","checksum":"ba09c1451153d39e4f4b7cee013e314c","relation":"main_file","file_id":"4829","file_size":9666973,"content_type":"application/pdf","creator":"system","file_name":"IST-2017-919-v1+1_elife-30867-figures-v1.pdf","access_level":"open_access"},{"content_type":"application/pdf","file_size":5951246,"creator":"system","access_level":"open_access","file_name":"IST-2017-919-v1+2_elife-30867-v1.pdf","checksum":"01eb51f1d6ad679947415a51c988e137","date_created":"2018-12-12T10:10:41Z","date_updated":"2020-07-14T12:47:10Z","relation":"main_file","file_id":"4830"}],"pubrep_id":"919","intvolume":" 6","title":"Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments","status":"public","ddc":["570"],"_id":"569","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"The actomyosin ring generates force to ingress the cytokinetic cleavage furrow in animal cells, yet its filament organization and the mechanism of contractility is not well understood. We quantified actin filament order in human cells using fluorescence polarization microscopy and found that cleavage furrow ingression initiates by contraction of an equatorial actin network with randomly oriented filaments. The network subsequently gradually reoriented actin filaments along the cell equator. This strictly depended on myosin II activity, suggesting local network reorganization by mechanical forces. Cortical laser microsurgery revealed that during cytokinesis progression, mechanical tension increased substantially along the direction of the cell equator, while the network contracted laterally along the pole-to-pole axis without a detectable increase in tension. Our data suggest that an asymmetric increase in cortical tension promotes filament reorientation along the cytokinetic cleavage furrow, which might have implications for diverse other biological processes involving actomyosin rings.","lang":"eng"}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.7554/eLife.30867","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"publication_identifier":{"issn":["2050084X"]},"month":"11","volume":6,"date_updated":"2023-02-23T12:30:29Z","date_created":"2018-12-11T11:47:14Z","author":[{"first_name":"Felix","last_name":"Spira","full_name":"Spira, Felix"},{"last_name":"Cuylen Haering","first_name":"Sara","full_name":"Cuylen Haering, Sara"},{"last_name":"Mehta","first_name":"Shalin","full_name":"Mehta, Shalin"},{"full_name":"Samwer, Matthias","first_name":"Matthias","last_name":"Samwer"},{"first_name":"Anne","last_name":"Reversat","id":"35B76592-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0666-8928","full_name":"Reversat, Anne"},{"full_name":"Verma, Amitabh","first_name":"Amitabh","last_name":"Verma"},{"full_name":"Oldenbourg, Rudolf","last_name":"Oldenbourg","first_name":"Rudolf"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt"},{"last_name":"Gerlich","first_name":"Daniel","full_name":"Gerlich, Daniel"}],"publisher":"eLife Sciences Publications","department":[{"_id":"MiSi"}],"publication_status":"published","year":"2017","publist_id":"7245","file_date_updated":"2020-07-14T12:47:10Z","article_number":"e30867"},{"issue":"6","abstract":[{"lang":"eng","text":"Blood platelets are critical for hemostasis and thrombosis and play diverse roles during immune responses. Despite these versatile tasks in mammalian biology, their skills on a cellular level are deemed limited, mainly consisting in rolling, adhesion, and aggregate formation. Here, we identify an unappreciated asset of platelets and show that adherent platelets use adhesion receptors to mechanically probe the adhesive substrate in their local microenvironment. When actomyosin-dependent traction forces overcome substrate resistance, platelets migrate and pile up the adhesive substrate together with any bound particulate material. They use this ability to act as cellular scavengers, scanning the vascular surface for potential invaders and collecting deposited bacteria. Microbe collection by migrating platelets boosts the activity of professional phagocytes, exacerbating inflammatory tissue injury in sepsis. This assigns platelets a central role in innate immune responses and identifies them as potential targets to dampen inflammatory tissue damage in clinical scenarios of severe systemic infection. In addition to their role in thrombosis and hemostasis, platelets can also migrate to sites of infection to help trap bacteria and clear the vascular surface."}],"type":"journal_article","oa_version":"None","intvolume":" 171","status":"public","title":"Migrating platelets are mechano scavengers that collect and bundle bacteria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"571","day":"30","scopus_import":1,"date_published":"2017-11-30T00:00:00Z","page":"1368 - 1382","citation":{"ama":"Gärtner FR, Ahmad Z, Rosenberger G, et al. Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. 2017;171(6):1368-1382. doi:10.1016/j.cell.2017.11.001","ista":"Gärtner FR, Ahmad Z, Rosenberger G, Fan S, Nicolai L, Busch B, Yavuz G, Luckner M, Ishikawa Ankerhold H, Hennel R, Benechet A, Lorenz M, Chandraratne S, Schubert I, Helmer S, Striednig B, Stark K, Janko M, Böttcher R, Verschoor A, Leon C, Gachet C, Gudermann T, Mederos Y Schnitzler M, Pincus Z, Iannacone M, Haas R, Wanner G, Lauber K, Sixt MK, Massberg S. 2017. Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. 171(6), 1368–1382.","apa":"Gärtner, F. R., Ahmad, Z., Rosenberger, G., Fan, S., Nicolai, L., Busch, B., … Massberg, S. (2017). Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. Cell Press. https://doi.org/10.1016/j.cell.2017.11.001","ieee":"F. R. Gärtner et al., “Migrating platelets are mechano scavengers that collect and bundle bacteria,” Cell Press, vol. 171, no. 6. Cell Press, pp. 1368–1382, 2017.","mla":"Gärtner, Florian R., et al. “Migrating Platelets Are Mechano Scavengers That Collect and Bundle Bacteria.” Cell Press, vol. 171, no. 6, Cell Press, 2017, pp. 1368–82, doi:10.1016/j.cell.2017.11.001.","short":"F.R. Gärtner, Z. Ahmad, G. Rosenberger, S. Fan, L. Nicolai, B. Busch, G. Yavuz, M. Luckner, H. Ishikawa Ankerhold, R. Hennel, A. Benechet, M. Lorenz, S. Chandraratne, I. Schubert, S. Helmer, B. Striednig, K. Stark, M. Janko, R. Böttcher, A. Verschoor, C. Leon, C. Gachet, T. Gudermann, M. Mederos Y Schnitzler, Z. Pincus, M. Iannacone, R. Haas, G. Wanner, K. Lauber, M.K. Sixt, S. Massberg, Cell Press 171 (2017) 1368–1382.","chicago":"Gärtner, Florian R, Zerkah Ahmad, Gerhild Rosenberger, Shuxia Fan, Leo Nicolai, Benjamin Busch, Gökce Yavuz, et al. “Migrating Platelets Are Mechano Scavengers That Collect and Bundle Bacteria.” Cell Press. Cell Press, 2017. https://doi.org/10.1016/j.cell.2017.11.001."},"publication":"Cell Press","publist_id":"7243","ec_funded":1,"volume":171,"date_updated":"2021-01-12T08:03:15Z","date_created":"2018-12-11T11:47:15Z","author":[{"id":"397A88EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6120-3723","first_name":"Florian R","last_name":"Gärtner","full_name":"Gärtner, Florian R"},{"full_name":"Ahmad, Zerkah","last_name":"Ahmad","first_name":"Zerkah"},{"full_name":"Rosenberger, Gerhild","first_name":"Gerhild","last_name":"Rosenberger"},{"first_name":"Shuxia","last_name":"Fan","full_name":"Fan, Shuxia"},{"last_name":"Nicolai","first_name":"Leo","full_name":"Nicolai, Leo"},{"last_name":"Busch","first_name":"Benjamin","full_name":"Busch, Benjamin"},{"full_name":"Yavuz, Gökce","first_name":"Gökce","last_name":"Yavuz"},{"full_name":"Luckner, Manja","last_name":"Luckner","first_name":"Manja"},{"full_name":"Ishikawa Ankerhold, Hellen","first_name":"Hellen","last_name":"Ishikawa Ankerhold"},{"last_name":"Hennel","first_name":"Roman","full_name":"Hennel, Roman"},{"full_name":"Benechet, Alexandre","first_name":"Alexandre","last_name":"Benechet"},{"full_name":"Lorenz, Michael","first_name":"Michael","last_name":"Lorenz"},{"full_name":"Chandraratne, Sue","last_name":"Chandraratne","first_name":"Sue"},{"last_name":"Schubert","first_name":"Irene","full_name":"Schubert, Irene"},{"last_name":"Helmer","first_name":"Sebastian","full_name":"Helmer, Sebastian"},{"last_name":"Striednig","first_name":"Bianca","full_name":"Striednig, Bianca"},{"full_name":"Stark, Konstantin","last_name":"Stark","first_name":"Konstantin"},{"first_name":"Marek","last_name":"Janko","full_name":"Janko, Marek"},{"full_name":"Böttcher, Ralph","last_name":"Böttcher","first_name":"Ralph"},{"full_name":"Verschoor, Admar","last_name":"Verschoor","first_name":"Admar"},{"full_name":"Leon, Catherine","last_name":"Leon","first_name":"Catherine"},{"first_name":"Christian","last_name":"Gachet","full_name":"Gachet, Christian"},{"last_name":"Gudermann","first_name":"Thomas","full_name":"Gudermann, Thomas"},{"first_name":"Michael","last_name":"Mederos Y Schnitzler","full_name":"Mederos Y Schnitzler, Michael"},{"last_name":"Pincus","first_name":"Zachary","full_name":"Pincus, Zachary"},{"last_name":"Iannacone","first_name":"Matteo","full_name":"Iannacone, Matteo"},{"full_name":"Haas, Rainer","first_name":"Rainer","last_name":"Haas"},{"first_name":"Gerhard","last_name":"Wanner","full_name":"Wanner, Gerhard"},{"last_name":"Lauber","first_name":"Kirsten","full_name":"Lauber, Kirsten"},{"full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","first_name":"Michael K"},{"full_name":"Massberg, Steffen","first_name":"Steffen","last_name":"Massberg"}],"department":[{"_id":"MiSi"}],"publisher":"Cell Press","publication_status":"published","year":"2017","publication_identifier":{"issn":["00928674"]},"month":"11","language":[{"iso":"eng"}],"doi":"10.1016/j.cell.2017.11.001","project":[{"grant_number":"747687","_id":"260AA4E2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells"}],"quality_controlled":"1"},{"type":"journal_article","issue":"12","abstract":[{"text":"In this review, we summarize the different biosynthesis-related pathways that contribute to the regulation of endogenous auxin in plants. We demonstrate that all known genes involved in auxin biosynthesis also have a role in root formation, from the initiation of a root meristem during embryogenesis to the generation of a functional root system with a primary root, secondary lateral root branches and adventitious roots. Furthermore, the versatile adaptation of root development in response to environmental challenges is mediated by both local and distant control of auxin biosynthesis. In conclusion, auxin homeostasis mediated by spatial and temporal regulation of auxin biosynthesis plays a central role in determining root architecture.","lang":"eng"}],"intvolume":" 18","title":"Control of endogenous auxin levels in plant root development","status":"public","ddc":["580"],"_id":"572","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"4718","relation":"main_file","checksum":"82d51f11e493f7eec02976d9a9a9805e","date_created":"2018-12-12T10:08:55Z","date_updated":"2020-07-14T12:47:10Z","access_level":"open_access","file_name":"IST-2017-917-v1+1_ijms-18-02587.pdf","creator":"system","content_type":"application/pdf","file_size":920962}],"oa_version":"Published Version","pubrep_id":"917","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"01","citation":{"short":"D. Olatunji, D. Geelen, I. Verstraeten, International Journal of Molecular Sciences 18 (2017).","mla":"Olatunji, Damilola, et al. “Control of Endogenous Auxin Levels in Plant Root Development.” International Journal of Molecular Sciences, vol. 18, no. 12, 2587, MDPI, 2017, doi:10.3390/ijms18122587.","chicago":"Olatunji, Damilola, Danny Geelen, and Inge Verstraeten. “Control of Endogenous Auxin Levels in Plant Root Development.” International Journal of Molecular Sciences. MDPI, 2017. https://doi.org/10.3390/ijms18122587.","ama":"Olatunji D, Geelen D, Verstraeten I. Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. 2017;18(12). doi:10.3390/ijms18122587","ieee":"D. Olatunji, D. Geelen, and I. Verstraeten, “Control of endogenous auxin levels in plant root development,” International Journal of Molecular Sciences, vol. 18, no. 12. MDPI, 2017.","apa":"Olatunji, D., Geelen, D., & Verstraeten, I. (2017). Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms18122587","ista":"Olatunji D, Geelen D, Verstraeten I. 2017. Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. 18(12), 2587."},"publication":"International Journal of Molecular Sciences","date_published":"2017-12-01T00:00:00Z","article_number":"2587","publist_id":"7242","file_date_updated":"2020-07-14T12:47:10Z","department":[{"_id":"JiFr"}],"publisher":"MDPI","publication_status":"published","year":"2017","volume":18,"date_updated":"2021-01-12T08:03:16Z","date_created":"2018-12-11T11:47:15Z","author":[{"full_name":"Olatunji, Damilola","first_name":"Damilola","last_name":"Olatunji"},{"last_name":"Geelen","first_name":"Danny","full_name":"Geelen, Danny"},{"first_name":"Inge","last_name":"Verstraeten","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7241-2328","full_name":"Verstraeten, Inge"}],"month":"12","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.3390/ijms18122587"},{"publication_identifier":{"issn":["09249907"]},"day":"01","month":"09","date_published":"2017-09-01T00:00:00Z","doi":"10.1007/s10851-017-0718-4","language":[{"iso":"eng"}],"citation":{"short":"R. Biswas, P. Bhowmick, Journal of Mathematical Imaging and Vision 59 (2017) 69–83.","mla":"Biswas, Ranita, and Partha Bhowmick. “On the Functionality and Usefulness of Quadraginta Octants of Naive Sphere.” Journal of Mathematical Imaging and Vision, vol. 59, no. 1, Springer Nature, 2017, pp. 69–83, doi:10.1007/s10851-017-0718-4.","chicago":"Biswas, Ranita, and Partha Bhowmick. “On the Functionality and Usefulness of Quadraginta Octants of Naive Sphere.” Journal of Mathematical Imaging and Vision. Springer Nature, 2017. https://doi.org/10.1007/s10851-017-0718-4.","ama":"Biswas R, Bhowmick P. On the functionality and usefulness of Quadraginta octants of naive sphere. Journal of Mathematical Imaging and Vision. 2017;59(1):69-83. doi:10.1007/s10851-017-0718-4","ieee":"R. Biswas and P. Bhowmick, “On the functionality and usefulness of Quadraginta octants of naive sphere,” Journal of Mathematical Imaging and Vision, vol. 59, no. 1. Springer Nature, pp. 69–83, 2017.","apa":"Biswas, R., & Bhowmick, P. (2017). On the functionality and usefulness of Quadraginta octants of naive sphere. Journal of Mathematical Imaging and Vision. Springer Nature. https://doi.org/10.1007/s10851-017-0718-4","ista":"Biswas R, Bhowmick P. 2017. On the functionality and usefulness of Quadraginta octants of naive sphere. Journal of Mathematical Imaging and Vision. 59(1), 69–83."},"publication":"Journal of Mathematical Imaging and Vision","page":"69-83","quality_controlled":"1","issue":"1","abstract":[{"lang":"eng","text":"This paper presents a novel study on the functional gradation of coordinate planes in connection with the thinnest and tunnel-free (i.e., naive) discretization of sphere in the integer space. For each of the 48-symmetric quadraginta octants of naive sphere with integer radius and integer center, we show that the corresponding voxel set forms a bijection with its projected pixel set on a unique coordinate plane, which thereby serves as its functional plane. We use this fundamental property to prove several other theoretical results for naive sphere. First, the quadraginta octants form symmetry groups and subgroups with certain equivalent topological properties. Second, a naive sphere is always unique and consists of fewest voxels. Third, it is efficiently constructible from its functional-plane projection. And finally, a special class of 4-symmetric discrete 3D circles can be constructed on a naive sphere based on back projection from the functional plane."}],"extern":"1","type":"journal_article","author":[{"full_name":"Biswas, Ranita","first_name":"Ranita","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"}],"oa_version":"None","volume":59,"date_updated":"2021-01-12T08:03:34Z","date_created":"2019-01-08T20:42:08Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5800","year":"2017","intvolume":" 59","publisher":"Springer Nature","status":"public","publication_status":"published","title":"On the functionality and usefulness of Quadraginta octants of naive sphere"},{"type":"journal_article","extern":"1","abstract":[{"text":"We construct a polyhedral surface called a graceful surface, which provides best possible approximation to a given sphere regarding certain criteria. In digital geometry terms, the graceful surface is uniquely characterized by its minimality while guaranteeing the connectivity of certain discrete (polyhedral) curves defined on it. The notion of “gracefulness” was first proposed in Brimkov and Barneva (1999) and shown to be useful for triangular mesh discretization through graceful planes and graceful lines. In this paper we extend the considerations to a nonlinear object such as a sphere. In particular, we investigate the properties of a discrete geodesic path between two voxels and show that discrete 3D circles, circular arcs, and Mobius triangles are all constructible on a graceful sphere, with guaranteed minimum thickness and the desired connectivity in the discrete topological space.","lang":"eng"}],"publisher":"Elsevier","intvolume":" 216","publication_status":"published","status":"public","title":"On the polyhedra of graceful spheres and circular geodesics","_id":"5799","year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":216,"oa_version":"None","date_created":"2019-01-08T20:41:12Z","date_updated":"2021-01-12T08:03:33Z","author":[{"orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","first_name":"Ranita","full_name":"Biswas, Ranita"},{"last_name":"Bhowmick","first_name":"Partha","full_name":"Bhowmick, Partha"},{"first_name":"Valentin E.","last_name":"Brimkov","full_name":"Brimkov, Valentin E."}],"publication_identifier":{"issn":["0166-218X"]},"day":"10","month":"01","page":"362-375","quality_controlled":"1","citation":{"apa":"Biswas, R., Bhowmick, P., & Brimkov, V. E. (2017). On the polyhedra of graceful spheres and circular geodesics. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2015.11.017","ieee":"R. Biswas, P. Bhowmick, and V. E. Brimkov, “On the polyhedra of graceful spheres and circular geodesics,” Discrete Applied Mathematics, vol. 216. Elsevier, pp. 362–375, 2017.","ista":"Biswas R, Bhowmick P, Brimkov VE. 2017. On the polyhedra of graceful spheres and circular geodesics. Discrete Applied Mathematics. 216, 362–375.","ama":"Biswas R, Bhowmick P, Brimkov VE. On the polyhedra of graceful spheres and circular geodesics. Discrete Applied Mathematics. 2017;216:362-375. doi:10.1016/j.dam.2015.11.017","chicago":"Biswas, Ranita, Partha Bhowmick, and Valentin E. Brimkov. “On the Polyhedra of Graceful Spheres and Circular Geodesics.” Discrete Applied Mathematics. Elsevier, 2017. https://doi.org/10.1016/j.dam.2015.11.017.","short":"R. Biswas, P. Bhowmick, V.E. Brimkov, Discrete Applied Mathematics 216 (2017) 362–375.","mla":"Biswas, Ranita, et al. “On the Polyhedra of Graceful Spheres and Circular Geodesics.” Discrete Applied Mathematics, vol. 216, Elsevier, 2017, pp. 362–75, doi:10.1016/j.dam.2015.11.017."},"publication":"Discrete Applied Mathematics","language":[{"iso":"eng"}],"doi":"10.1016/j.dam.2015.11.017","date_published":"2017-01-10T00:00:00Z"},{"place":"Cham","alternative_title":["LNCS"],"type":"conference","extern":"1","abstract":[{"text":"Space filling circles and spheres have various applications in mathematical imaging and physical modeling. In this paper, we first show how the thinnest (i.e., 2-minimal) model of digital sphere can be augmented to a space filling model by fixing certain “simple voxels” and “filler voxels” associated with it. Based on elementary number-theoretic properties of such voxels, we design an efficient incremental algorithm for generation of these space filling spheres with successively increasing radius. The novelty of the proposed technique is established further through circular space filling on 3D digital plane. As evident from a preliminary set of experimental result, this can particularly be useful for parallel computing of 3D Voronoi diagrams in the digital space.","lang":"eng"}],"publication_status":"published","title":"Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space","status":"public","intvolume":" 10502","publisher":"Springer Nature","_id":"5801","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","year":"2017","date_updated":"2022-01-27T15:34:25Z","date_created":"2019-01-08T20:42:22Z","oa_version":"None","volume":10502,"author":[{"first_name":"Shivam","last_name":"Dwivedi","full_name":"Dwivedi, Shivam"},{"full_name":"Gupta, Aniket","first_name":"Aniket","last_name":"Gupta"},{"first_name":"Siddhant","last_name":"Roy","full_name":"Roy, Siddhant"},{"first_name":"Ranita","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita"},{"last_name":"Bhowmick","first_name":"Partha","full_name":"Bhowmick, Partha"}],"month":"08","day":"22","publication_identifier":{"eissn":["1611-3349"],"isbn":["978-3-319-66271-8"],"eisbn":["978-3-319-66272-5"],"issn":["0302-9743"]},"article_processing_charge":"No","quality_controlled":"1","page":"347-359","publication":"20th IAPR International Conference","citation":{"ama":"Dwivedi S, Gupta A, Roy S, Biswas R, Bhowmick P. Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space. In: 20th IAPR International Conference. Vol 10502. Cham: Springer Nature; 2017:347-359. doi:10.1007/978-3-319-66272-5_28","ieee":"S. Dwivedi, A. Gupta, S. Roy, R. Biswas, and P. Bhowmick, “Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space,” in 20th IAPR International Conference, Vienna, Austria, 2017, vol. 10502, pp. 347–359.","apa":"Dwivedi, S., Gupta, A., Roy, S., Biswas, R., & Bhowmick, P. (2017). Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space. In 20th IAPR International Conference (Vol. 10502, pp. 347–359). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-66272-5_28","ista":"Dwivedi S, Gupta A, Roy S, Biswas R, Bhowmick P. 2017. Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space. 20th IAPR International Conference. DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS, vol. 10502, 347–359.","short":"S. Dwivedi, A. Gupta, S. Roy, R. Biswas, P. Bhowmick, in:, 20th IAPR International Conference, Springer Nature, Cham, 2017, pp. 347–359.","mla":"Dwivedi, Shivam, et al. “Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space.” 20th IAPR International Conference, vol. 10502, Springer Nature, 2017, pp. 347–59, doi:10.1007/978-3-319-66272-5_28.","chicago":"Dwivedi, Shivam, Aniket Gupta, Siddhant Roy, Ranita Biswas, and Partha Bhowmick. “Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space.” In 20th IAPR International Conference, 10502:347–59. Cham: Springer Nature, 2017. https://doi.org/10.1007/978-3-319-66272-5_28."},"language":[{"iso":"eng"}],"conference":{"end_date":"2017-09-21","location":"Vienna, Austria","start_date":"2017-09-19","name":"DGCI: International Conference on Discrete Geometry for Computer Imagery"},"doi":"10.1007/978-3-319-66272-5_28","date_published":"2017-08-22T00:00:00Z"},{"extern":"1","place":"Cham","date_created":"2019-01-08T20:42:56Z","date_updated":"2022-01-28T07:48:24Z","volume":10256,"author":[{"full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","first_name":"Ranita"},{"last_name":"Bhowmick","first_name":"Partha","full_name":"Bhowmick, Partha"}],"publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Springer Nature","year":"2017","month":"05","publication_identifier":{"isbn":["978-3-319-59107-0","978-3-319-59108-7"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"conference":{"location":"Plovdiv, Bulgaria","start_date":"2017-06-19","end_date":"2017-06-21","name":"IWCIA: International Workshop on Combinatorial Image Analysis"},"doi":"10.1007/978-3-319-59108-7_8","quality_controlled":"1","abstract":[{"text":"Different distance metrics produce Voronoi diagrams with different properties. It is a well-known that on the (real) 2D plane or even on any 3D plane, a Voronoi diagram (VD) based on the Euclidean distance metric produces convex Voronoi regions. In this paper, we first show that this metric produces a persistent VD on the 2D digital plane, as it comprises digitally convex Voronoi regions and hence correctly approximates the corresponding VD on the 2D real plane. Next, we show that on a 3D digital plane D, the Euclidean metric spanning over its voxel set does not guarantee a digital VD which is persistent with the real-space VD. As a solution, we introduce a novel concept of functional-plane-convexity, which is ensured by the Euclidean metric spanning over the pedal set of D. Necessary proofs and some visual result have been provided to adjudge the merit and usefulness of the proposed concept.","lang":"eng"}],"alternative_title":["LNCS"],"type":"book_chapter","oa_version":"None","title":"Construction of persistent Voronoi diagram on 3D digital plane","status":"public","intvolume":" 10256","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"5803","day":"17","article_processing_charge":"No","date_published":"2017-05-17T00:00:00Z","page":"93-104","publication":"Combinatorial image analysis","citation":{"ama":"Biswas R, Bhowmick P. Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial Image Analysis. Vol 10256. Cham: Springer Nature; 2017:93-104. doi:10.1007/978-3-319-59108-7_8","ista":"Biswas R, Bhowmick P. 2017.Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial image analysis. LNCS, vol. 10256, 93–104.","ieee":"R. Biswas and P. Bhowmick, “Construction of persistent Voronoi diagram on 3D digital plane,” in Combinatorial image analysis, vol. 10256, Cham: Springer Nature, 2017, pp. 93–104.","apa":"Biswas, R., & Bhowmick, P. (2017). Construction of persistent Voronoi diagram on 3D digital plane. In Combinatorial image analysis (Vol. 10256, pp. 93–104). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-59108-7_8","mla":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” Combinatorial Image Analysis, vol. 10256, Springer Nature, 2017, pp. 93–104, doi:10.1007/978-3-319-59108-7_8.","short":"R. Biswas, P. Bhowmick, in:, Combinatorial Image Analysis, Springer Nature, Cham, 2017, pp. 93–104.","chicago":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” In Combinatorial Image Analysis, 10256:93–104. Cham: Springer Nature, 2017. https://doi.org/10.1007/978-3-319-59108-7_8."}},{"abstract":[{"lang":"eng","text":"This papers introduces a definition of digital primitives based on focal points and weighted distances (with positive weights). The proposed definition is applicable to general dimensions and covers in its gamut various regular curves and surfaces like circles, ellipses, digital spheres and hyperspheres, ellipsoids and k-ellipsoids, Cartesian k-ovals, etc. Several interesting properties are presented for this class of digital primitives such as space partitioning, topological separation, and connectivity properties. To demonstrate further the potential of this new way of defining digital primitives, we propose, as extension, another class of digital conics defined by focus-directrix combination."}],"extern":"1","type":"conference","alternative_title":["LNCS"],"place":"Cham","author":[{"full_name":"Andres, Eric","last_name":"Andres","first_name":"Eric"},{"first_name":"Ranita","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita"},{"full_name":"Bhowmick, Partha","last_name":"Bhowmick","first_name":"Partha"}],"date_created":"2019-01-08T20:42:39Z","date_updated":"2022-01-27T15:38:35Z","volume":10502,"oa_version":"None","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"5802","year":"2017","publication_status":"published","status":"public","title":"Digital primitives defined by weighted focal set","intvolume":" 10502","publisher":"Springer Nature","day":"22","month":"08","article_processing_charge":"No","publication_identifier":{"eisbn":["978-3-319-66272-5"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["978-3-319-66271-8"]},"conference":{"name":"DGCI: International Conference on Discrete Geometry for Computer Imagery","end_date":"2017-09-21","start_date":"2017-09-19","location":"Vienna, Austria"},"date_published":"2017-08-22T00:00:00Z","doi":"10.1007/978-3-319-66272-5_31","language":[{"iso":"eng"}],"publication":"20th IAPR International Conference","citation":{"apa":"Andres, E., Biswas, R., & Bhowmick, P. (2017). Digital primitives defined by weighted focal set. In 20th IAPR International Conference (Vol. 10502, pp. 388–398). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-66272-5_31","ieee":"E. Andres, R. Biswas, and P. Bhowmick, “Digital primitives defined by weighted focal set,” in 20th IAPR International Conference, Vienna, Austria, 2017, vol. 10502, pp. 388–398.","ista":"Andres E, Biswas R, Bhowmick P. 2017. Digital primitives defined by weighted focal set. 20th IAPR International Conference. DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS, vol. 10502, 388–398.","ama":"Andres E, Biswas R, Bhowmick P. Digital primitives defined by weighted focal set. In: 20th IAPR International Conference. Vol 10502. Cham: Springer Nature; 2017:388-398. doi:10.1007/978-3-319-66272-5_31","chicago":"Andres, Eric, Ranita Biswas, and Partha Bhowmick. “Digital Primitives Defined by Weighted Focal Set.” In 20th IAPR International Conference, 10502:388–98. Cham: Springer Nature, 2017. https://doi.org/10.1007/978-3-319-66272-5_31.","short":"E. Andres, R. Biswas, P. Bhowmick, in:, 20th IAPR International Conference, Springer Nature, Cham, 2017, pp. 388–398.","mla":"Andres, Eric, et al. “Digital Primitives Defined by Weighted Focal Set.” 20th IAPR International Conference, vol. 10502, Springer Nature, 2017, pp. 388–98, doi:10.1007/978-3-319-66272-5_31."},"quality_controlled":"1","page":"388-398"},{"month":"04","day":"03","doi":"10.1103/PhysRevLett.118.140401","date_published":"2017-04-03T00:00:00Z","language":[{"iso":"eng"}],"publication":"Physical Review Letters","citation":{"ama":"Engelsen N, Krishnakumar R, Hosten O, Kasevich M. Bell correlations in spin-squeezed states of 500 000 atoms. Physical Review Letters. 2017;118(14). doi:10.1103/PhysRevLett.118.140401","ista":"Engelsen N, Krishnakumar R, Hosten O, Kasevich M. 2017. Bell correlations in spin-squeezed states of 500 000 atoms. Physical Review Letters. 118(14).","ieee":"N. Engelsen, R. Krishnakumar, O. Hosten, and M. Kasevich, “Bell correlations in spin-squeezed states of 500 000 atoms,” Physical Review Letters, vol. 118, no. 14. American Physical Society, 2017.","apa":"Engelsen, N., Krishnakumar, R., Hosten, O., & Kasevich, M. (2017). Bell correlations in spin-squeezed states of 500 000 atoms. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.118.140401","mla":"Engelsen, Nils, et al. “Bell Correlations in Spin-Squeezed States of 500 000 Atoms.” Physical Review Letters, vol. 118, no. 14, American Physical Society, 2017, doi:10.1103/PhysRevLett.118.140401.","short":"N. Engelsen, R. Krishnakumar, O. Hosten, M. Kasevich, Physical Review Letters 118 (2017).","chicago":"Engelsen, Nils, Rajiv Krishnakumar, Onur Hosten, and Mark Kasevich. “Bell Correlations in Spin-Squeezed States of 500 000 Atoms.” Physical Review Letters. American Physical Society, 2017. https://doi.org/10.1103/PhysRevLett.118.140401."},"abstract":[{"text":"Bell correlations, indicating nonlocality in composite quantum systems, were until recently only seen in small systems. Here, we demonstrate Bell correlations in squeezed states of 5×105 Rb87 atoms. The correlations are inferred using collective measurements as witnesses and are statistically significant to 124 standard deviations. The states are both generated and characterized using optical-cavity aided measurements.","lang":"eng"}],"publist_id":"7212","issue":"14","extern":"1","type":"journal_article","author":[{"full_name":"Engelsen, Nils","last_name":"Engelsen","first_name":"Nils"},{"full_name":"Krishnakumar, Rajiv","first_name":"Rajiv","last_name":"Krishnakumar"},{"full_name":"Hosten, Onur","first_name":"Onur","last_name":"Hosten","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X"},{"full_name":"Kasevich, Mark","last_name":"Kasevich","first_name":"Mark"}],"date_created":"2018-12-11T11:47:23Z","date_updated":"2021-01-12T08:05:16Z","volume":118,"oa_version":"None","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"593","year":"2017","status":"public","publication_status":"published","title":"Bell correlations in spin-squeezed states of 500 000 atoms","publisher":"American Physical Society","intvolume":" 118"},{"day":"23","month":"03","article_processing_charge":"No","publication_identifier":{"issn":["00928674"]},"quality_controlled":"1","page":"120 - 131.e22","publication":"Cell","citation":{"ista":"Engel C, Gubbey T, Neyer S, Sainsbury S, Oberthuer C, Baejen C, Bernecky C, Cramer P. 2017. Structural basis of RNA polymerase I transcription initiation. Cell. 169(1), 120–131.e22.","ieee":"C. Engel et al., “Structural basis of RNA polymerase I transcription initiation,” Cell, vol. 169, no. 1. Cell Press, p. 120–131.e22, 2017.","apa":"Engel, C., Gubbey, T., Neyer, S., Sainsbury, S., Oberthuer, C., Baejen, C., … Cramer, P. (2017). Structural basis of RNA polymerase I transcription initiation. Cell. Cell Press. https://doi.org/10.1016/j.cell.2017.03.003","ama":"Engel C, Gubbey T, Neyer S, et al. Structural basis of RNA polymerase I transcription initiation. Cell. 2017;169(1):120-131.e22. doi:10.1016/j.cell.2017.03.003","chicago":"Engel, Christoph, Tobias Gubbey, Simon Neyer, Sarah Sainsbury, Christiane Oberthuer, Carlo Baejen, Carrie Bernecky, and Patrick Cramer. “Structural Basis of RNA Polymerase I Transcription Initiation.” Cell. Cell Press, 2017. https://doi.org/10.1016/j.cell.2017.03.003.","mla":"Engel, Christoph, et al. “Structural Basis of RNA Polymerase I Transcription Initiation.” Cell, vol. 169, no. 1, Cell Press, 2017, p. 120–131.e22, doi:10.1016/j.cell.2017.03.003.","short":"C. Engel, T. Gubbey, S. Neyer, S. Sainsbury, C. Oberthuer, C. Baejen, C. Bernecky, P. Cramer, Cell 169 (2017) 120–131.e22."},"language":[{"iso":"eng"}],"doi":"10.1016/j.cell.2017.03.003","date_published":"2017-03-23T00:00:00Z","type":"journal_article","extern":"1","abstract":[{"lang":"eng","text":"Transcription initiation at the ribosomal RNA promoter requires RNA polymerase (Pol) I and the initiation factors Rrn3 and core factor (CF). Here, we combine X-ray crystallography and cryo-electron microscopy (cryo-EM) to obtain a molecular model for basal Pol I initiation. The three-subunit CF binds upstream promoter DNA, docks to the Pol I-Rrn3 complex, and loads DNA into the expanded active center cleft of the polymerase. DNA unwinding between the Pol I protrusion and clamp domains enables cleft contraction, resulting in an active Pol I conformation and RNA synthesis. Comparison with the Pol II system suggests that promoter specificity relies on a distinct “bendability” and “meltability” of the promoter sequence that enables contacts between initiation factors, DNA, and polymerase."}],"publist_id":"7204","issue":"1","status":"public","title":"Structural basis of RNA polymerase I transcription initiation","publication_status":"published","intvolume":" 169","publisher":"Cell Press","year":"2017","_id":"600","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:05:36Z","date_created":"2018-12-11T11:47:25Z","volume":169,"oa_version":"None","author":[{"last_name":"Engel","first_name":"Christoph","full_name":"Engel, Christoph"},{"full_name":"Gubbey, Tobias","first_name":"Tobias","last_name":"Gubbey"},{"first_name":"Simon","last_name":"Neyer","full_name":"Neyer, Simon"},{"full_name":"Sainsbury, Sarah","first_name":"Sarah","last_name":"Sainsbury"},{"full_name":"Oberthuer, Christiane","last_name":"Oberthuer","first_name":"Christiane"},{"last_name":"Baejen","first_name":"Carlo","full_name":"Baejen, Carlo"},{"last_name":"Bernecky","first_name":"Carrie A","orcid":"0000-0003-0893-7036","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","full_name":"Bernecky, Carrie A"},{"full_name":"Cramer, Patrick","first_name":"Patrick","last_name":"Cramer"}]},{"intvolume":" 999","title":"Experimental evidence for Wigner's tunneling time","status":"public","ddc":["530"],"_id":"313","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"checksum":"6e70b525a84f6d5fb175c48e9f5cb59a","date_updated":"2020-07-14T12:46:00Z","date_created":"2019-01-22T08:34:10Z","file_id":"5871","relation":"main_file","creator":"dernst","file_size":949321,"content_type":"application/pdf","access_level":"open_access","file_name":"2017_Physics_Camus.pdf"}],"alternative_title":["Journal of Physics: Conference Series"],"type":"conference","issue":"1","abstract":[{"lang":"eng","text":"Tunneling of a particle through a potential barrier remains one of the most remarkable quantum phenomena. Owing to advances in laser technology, electric fields comparable to those electrons experience in atoms are readily generated and open opportunities to dynamically investigate the process of electron tunneling through the potential barrier formed by the superposition of both laser and atomic fields. Attosecond-time and angstrom-space resolution of the strong laser-field technique allow to address fundamental questions related to tunneling, which are still open and debated: Which time is spent under the barrier and what momentum is picked up by the particle in the meantime? In this combined experimental and theoretical study we demonstrate that for strong-field ionization the leading quantum mechanical Wigner treatment for the time resolved description of tunneling is valid. We achieve a high sensitivity on the tunneling barrier and unambiguously isolate its effects by performing a differential study of two systems with almost identical tunneling geometry. Moreover, working with a low frequency laser, we essentially limit the non-adiabaticity of the process as a major source of uncertainty. The agreement between experiment and theory implies two substantial corrections with respect to the widely employed quasiclassical treatment: In addition to a non-vanishing longitudinal momentum along the laser field-direction we provide clear evidence for a non-zero tunneling time delay. This addresses also the fundamental question how the transition occurs from the tunnel barrier to free space classical evolution of the ejected electron."}],"citation":{"ama":"Camus N, Yakaboylu E, Fechner L, et al. Experimental evidence for Wigner’s tunneling time. In: Vol 999. American Physical Society; 2017. doi:10.1088/1742-6596/999/1/012004","apa":"Camus, N., Yakaboylu, E., Fechner, L., Klaiber, M., Laux, M., Mi, Y., … Moshammer, R. (2017). Experimental evidence for Wigner’s tunneling time (Vol. 999). Presented at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian Federation: American Physical Society. https://doi.org/10.1088/1742-6596/999/1/012004","ieee":"N. Camus et al., “Experimental evidence for Wigner’s tunneling time,” presented at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian Federation, 2017, vol. 999, no. 1.","ista":"Camus N, Yakaboylu E, Fechner L, Klaiber M, Laux M, Mi Y, Hatsagortsyan K, Pfeifer T, Keitel C, Moshammer R. 2017. Experimental evidence for Wigner’s tunneling time. Annual International Laser Physics Workshop LPHYS, Journal of Physics: Conference Series, vol. 999, 012004.","short":"N. Camus, E. Yakaboylu, L. Fechner, M. Klaiber, M. Laux, Y. Mi, K. Hatsagortsyan, T. Pfeifer, C. Keitel, R. Moshammer, in:, American Physical Society, 2017.","mla":"Camus, Nicolas, et al. Experimental Evidence for Wigner’s Tunneling Time. Vol. 999, no. 1, 012004, American Physical Society, 2017, doi:10.1088/1742-6596/999/1/012004.","chicago":"Camus, Nicolas, Enderalp Yakaboylu, Lutz Fechner, Michael Klaiber, Martin Laux, Yonghao Mi, Karen Hatsagortsyan, Thomas Pfeifer, Cristoph Keitel, and Robert Moshammer. “Experimental Evidence for Wigner’s Tunneling Time,” Vol. 999. American Physical Society, 2017. https://doi.org/10.1088/1742-6596/999/1/012004."},"date_published":"2017-07-14T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"14","publisher":"American Physical Society","department":[{"_id":"MiLe"}],"publication_status":"published","year":"2017","volume":999,"date_updated":"2023-02-23T12:36:07Z","date_created":"2018-12-11T11:45:46Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"6013"}]},"author":[{"last_name":"Camus","first_name":"Nicolas","full_name":"Camus, Nicolas"},{"last_name":"Yakaboylu","first_name":"Enderalp","orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","full_name":"Yakaboylu, Enderalp"},{"full_name":"Fechner, Lutz","first_name":"Lutz","last_name":"Fechner"},{"full_name":"Klaiber, Michael","first_name":"Michael","last_name":"Klaiber"},{"last_name":"Laux","first_name":"Martin","full_name":"Laux, Martin"},{"last_name":"Mi","first_name":"Yonghao","full_name":"Mi, Yonghao"},{"full_name":"Hatsagortsyan, Karen","first_name":"Karen","last_name":"Hatsagortsyan"},{"full_name":"Pfeifer, Thomas","last_name":"Pfeifer","first_name":"Thomas"},{"full_name":"Keitel, Cristoph","first_name":"Cristoph","last_name":"Keitel"},{"full_name":"Moshammer, Robert","last_name":"Moshammer","first_name":"Robert"}],"article_number":"012004","publist_id":"7552","file_date_updated":"2020-07-14T12:46:00Z","quality_controlled":"1","external_id":{"arxiv":["1611.03701"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1088/1742-6596/999/1/012004","conference":{"name":"Annual International Laser Physics Workshop LPHYS","location":"Kazan, Russian Federation","start_date":"2017-08-17","end_date":"2017-08-21"},"publication_identifier":{"issn":["17426588"]},"month":"07"},{"day":"06","has_accepted_license":"1","article_processing_charge":"No","date_published":"2017-06-06T00:00:00Z","publication":"Nature Communications","citation":{"ista":"Xu Y, Bernecky C, Lee C, Maier K, Schwalb B, Tegunov D, Plitzko J, Urlaub H, Cramer P. 2017. Architecture of the RNA polymerase II-Paf1C-TFIIS transcription elongation complex. Nature Communications. 8, 15741.","ieee":"Y. Xu et al., “Architecture of the RNA polymerase II-Paf1C-TFIIS transcription elongation complex,” Nature Communications, vol. 8. Nature Publishing Group, 2017.","apa":"Xu, Y., Bernecky, C., Lee, C., Maier, K., Schwalb, B., Tegunov, D., … Cramer, P. (2017). Architecture of the RNA polymerase II-Paf1C-TFIIS transcription elongation complex. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms15741","ama":"Xu Y, Bernecky C, Lee C, et al. Architecture of the RNA polymerase II-Paf1C-TFIIS transcription elongation complex. Nature Communications. 2017;8. doi:10.1038/ncomms15741","chicago":"Xu, Youwei, Carrie Bernecky, Chung Lee, Kerstin Maier, Björn Schwalb, Dimitri Tegunov, Jürgen Plitzko, Henning Urlaub, and Patrick Cramer. “Architecture of the RNA Polymerase II-Paf1C-TFIIS Transcription Elongation Complex.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms15741.","mla":"Xu, Youwei, et al. “Architecture of the RNA Polymerase II-Paf1C-TFIIS Transcription Elongation Complex.” Nature Communications, vol. 8, 15741, Nature Publishing Group, 2017, doi:10.1038/ncomms15741.","short":"Y. Xu, C. Bernecky, C. Lee, K. Maier, B. Schwalb, D. Tegunov, J. Plitzko, H. Urlaub, P. Cramer, Nature Communications 8 (2017)."},"abstract":[{"lang":"eng","text":"The conserved polymerase-Associated factor 1 complex (Paf1C) plays multiple roles in chromatin transcription and genomic regulation. Paf1C comprises the five subunits Paf1, Leo1, Ctr9, Cdc73 and Rtf1, and binds to the RNA polymerase II (Pol II) transcription elongation complex (EC). Here we report the reconstitution of Paf1C from Saccharomyces cerevisiae, and a structural analysis of Paf1C bound to a Pol II EC containing the elongation factor TFIIS. Cryo-electron microscopy and crosslinking data reveal that Paf1C is highly mobile and extends over the outer Pol II surface from the Rpb2 to the Rpb3 subunit. The Paf1-Leo1 heterodimer and Cdc73 form opposite ends of Paf1C, whereas Ctr9 bridges between them. Consistent with the structural observations, the initiation factor TFIIF impairs Paf1C binding to Pol II, whereas the elongation factor TFIIS enhances it. We further show that Paf1C is globally required for normal mRNA transcription in yeast. These results provide a three-dimensional framework for further analysis of Paf1C function in transcription through chromatin. "}],"type":"journal_article","file":[{"file_id":"5865","relation":"main_file","checksum":"940742282a9a285dc4aeae0c2b5ebe96","date_updated":"2020-07-14T12:47:16Z","date_created":"2019-01-21T14:48:10Z","access_level":"open_access","file_name":"2017_NatureComm_Xu.pdf","creator":"dernst","content_type":"application/pdf","file_size":3018075}],"oa_version":"Published Version","ddc":["570"],"status":"public","title":"Architecture of the RNA polymerase II-Paf1C-TFIIS transcription elongation complex","intvolume":" 8","_id":"601","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","publication_identifier":{"issn":["20411723"]},"language":[{"iso":"eng"}],"doi":"10.1038/ncomms15741","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"extern":"1","file_date_updated":"2020-07-14T12:47:16Z","publist_id":"7203","article_number":"15741","date_created":"2018-12-11T11:47:25Z","date_updated":"2021-01-12T08:05:40Z","volume":8,"author":[{"last_name":"Xu","first_name":"Youwei","full_name":"Xu, Youwei"},{"full_name":"Bernecky, Carrie A","first_name":"Carrie A","last_name":"Bernecky","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0893-7036"},{"first_name":"Chung","last_name":"Lee","full_name":"Lee, Chung"},{"full_name":"Maier, Kerstin","last_name":"Maier","first_name":"Kerstin"},{"last_name":"Schwalb","first_name":"Björn","full_name":"Schwalb, Björn"},{"full_name":"Tegunov, Dimitri","first_name":"Dimitri","last_name":"Tegunov"},{"full_name":"Plitzko, Jürgen","last_name":"Plitzko","first_name":"Jürgen"},{"last_name":"Urlaub","first_name":"Henning","full_name":"Urlaub, Henning"},{"first_name":"Patrick","last_name":"Cramer","full_name":"Cramer, Patrick"}],"publication_status":"published","publisher":"Nature Publishing Group","year":"2017"},{"day":"14","scopus_import":1,"date_published":"2017-07-14T00:00:00Z","publication":"Physical Review Letters","citation":{"ama":"Camus N, Yakaboylu E, Fechner L, et al. Experimental evidence for quantum tunneling time. Physical Review Letters. 2017;119(2). doi:10.1103/PhysRevLett.119.023201","apa":"Camus, N., Yakaboylu, E., Fechner, L., Klaiber, M., Laux, M., Mi, Y., … Moshammer, R. (2017). Experimental evidence for quantum tunneling time. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.119.023201","ieee":"N. Camus et al., “Experimental evidence for quantum tunneling time,” Physical Review Letters, vol. 119, no. 2. American Physical Society, 2017.","ista":"Camus N, Yakaboylu E, Fechner L, Klaiber M, Laux M, Mi Y, Hatsagortsyan KZ, Pfeifer T, Keitel CH, Moshammer R. 2017. Experimental evidence for quantum tunneling time. Physical Review Letters. 119(2), 023201.","short":"N. Camus, E. Yakaboylu, L. Fechner, M. Klaiber, M. Laux, Y. Mi, K.Z. Hatsagortsyan, T. Pfeifer, C.H. Keitel, R. Moshammer, Physical Review Letters 119 (2017).","mla":"Camus, Nicolas, et al. “Experimental Evidence for Quantum Tunneling Time.” Physical Review Letters, vol. 119, no. 2, 023201, American Physical Society, 2017, doi:10.1103/PhysRevLett.119.023201.","chicago":"Camus, Nicolas, Enderalp Yakaboylu, Lutz Fechner, Michael Klaiber, Martin Laux, Yonghao Mi, Karen Z. Hatsagortsyan, Thomas Pfeifer, Christoph H. Keitel, and Robert Moshammer. “Experimental Evidence for Quantum Tunneling Time.” Physical Review Letters. American Physical Society, 2017. https://doi.org/10.1103/PhysRevLett.119.023201."},"abstract":[{"text":"The first hundred attoseconds of the electron dynamics during strong field tunneling ionization are investigated. We quantify theoretically how the electron’s classical trajectories in the continuum emerge from the tunneling process and test the results with those achieved in parallel from attoclock measurements. An especially high sensitivity on the tunneling barrier is accomplished here by comparing the momentum distributions of two atomic species of slightly deviating atomic potentials (argon and krypton) being ionized under absolutely identical conditions with near-infrared laser pulses (1300 nm). The agreement between experiment and theory provides clear evidence for a nonzero tunneling time delay and a nonvanishing longitudinal momentum of the electron at the “tunnel exit.”","lang":"eng"}],"issue":"2","type":"journal_article","oa_version":"Preprint","_id":"6013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Experimental evidence for quantum tunneling time","intvolume":" 119","month":"07","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"doi":"10.1103/PhysRevLett.119.023201","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1611.03701","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1611.03701"]},"quality_controlled":"1","article_number":"023201","author":[{"first_name":"Nicolas","last_name":"Camus","full_name":"Camus, Nicolas"},{"full_name":"Yakaboylu, Enderalp","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5973-0874","first_name":"Enderalp","last_name":"Yakaboylu"},{"full_name":"Fechner, Lutz","first_name":"Lutz","last_name":"Fechner"},{"full_name":"Klaiber, Michael","first_name":"Michael","last_name":"Klaiber"},{"last_name":"Laux","first_name":"Martin","full_name":"Laux, Martin"},{"last_name":"Mi","first_name":"Yonghao","full_name":"Mi, Yonghao"},{"first_name":"Karen Z.","last_name":"Hatsagortsyan","full_name":"Hatsagortsyan, Karen Z."},{"full_name":"Pfeifer, Thomas","last_name":"Pfeifer","first_name":"Thomas"},{"full_name":"Keitel, Christoph H.","first_name":"Christoph H.","last_name":"Keitel"},{"full_name":"Moshammer, Robert","first_name":"Robert","last_name":"Moshammer"}],"related_material":{"record":[{"id":"313","relation":"earlier_version","status":"public"}]},"date_created":"2019-02-14T15:24:13Z","date_updated":"2023-02-23T11:13:36Z","volume":119,"year":"2017","publication_status":"published","publisher":"American Physical Society","department":[{"_id":"MiLe"}]},{"type":"journal_article","abstract":[{"lang":"eng","text":"During transcription, RNA polymerase II (Pol II) associates with the conserved elongation factor DSIF. DSIF renders the elongation complex stable and functions during Pol II pausing and RNA processing. We combined cryo-EM and X-ray crystallography to determine the structure of the mammalian Pol II-DSIF elongation complex at a nominal resolution of 3.4. Human DSIF has a modular structure with two domains forming a DNA clamp, two domains forming an RNA clamp, and one domain buttressing the RNA clamp. The clamps maintain the transcription bubble, position upstream DNA, and retain the RNA transcript in the exit tunnel. The mobile C-terminal region of DSIF is located near exiting RNA, where it can recruit factors for RNA processing. The structure provides insight into the roles of DSIF during mRNA synthesis."}],"publist_id":"7202","issue":"10","extern":"1","year":"2017","_id":"603","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Structure of a transcribing RNA polymerase II-DSIF complex reveals a multidentate DNA-RNA clamp","status":"public","publication_status":"published","intvolume":" 24","publisher":"Nature Publishing Group","author":[{"id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0893-7036","first_name":"Carrie A","last_name":"Bernecky","full_name":"Bernecky, Carrie A"},{"last_name":"Plitzko","first_name":"Jürgen","full_name":"Plitzko, Jürgen"},{"last_name":"Cramer","first_name":"Patrick","full_name":"Cramer, Patrick"}],"date_updated":"2021-01-12T08:05:47Z","date_created":"2018-12-11T11:47:26Z","oa_version":"None","volume":24,"month":"10","day":"05","publication_identifier":{"issn":["15459993"]},"article_processing_charge":"No","publication":"Nature Structural and Molecular Biology","citation":{"chicago":"Bernecky, Carrie, Jürgen Plitzko, and Patrick Cramer. “Structure of a Transcribing RNA Polymerase II-DSIF Complex Reveals a Multidentate DNA-RNA Clamp.” Nature Structural and Molecular Biology. Nature Publishing Group, 2017. https://doi.org/10.1038/nsmb.3465.","mla":"Bernecky, Carrie, et al. “Structure of a Transcribing RNA Polymerase II-DSIF Complex Reveals a Multidentate DNA-RNA Clamp.” Nature Structural and Molecular Biology, vol. 24, no. 10, Nature Publishing Group, 2017, pp. 809–15, doi:10.1038/nsmb.3465.","short":"C. Bernecky, J. Plitzko, P. Cramer, Nature Structural and Molecular Biology 24 (2017) 809–815.","ista":"Bernecky C, Plitzko J, Cramer P. 2017. Structure of a transcribing RNA polymerase II-DSIF complex reveals a multidentate DNA-RNA clamp. Nature Structural and Molecular Biology. 24(10), 809–815.","apa":"Bernecky, C., Plitzko, J., & Cramer, P. (2017). Structure of a transcribing RNA polymerase II-DSIF complex reveals a multidentate DNA-RNA clamp. Nature Structural and Molecular Biology. Nature Publishing Group. https://doi.org/10.1038/nsmb.3465","ieee":"C. Bernecky, J. Plitzko, and P. Cramer, “Structure of a transcribing RNA polymerase II-DSIF complex reveals a multidentate DNA-RNA clamp,” Nature Structural and Molecular Biology, vol. 24, no. 10. Nature Publishing Group, pp. 809–815, 2017.","ama":"Bernecky C, Plitzko J, Cramer P. Structure of a transcribing RNA polymerase II-DSIF complex reveals a multidentate DNA-RNA clamp. Nature Structural and Molecular Biology. 2017;24(10):809-815. doi:10.1038/nsmb.3465"},"quality_controlled":"1","page":"809 - 815","doi":"10.1038/nsmb.3465","date_published":"2017-10-05T00:00:00Z","language":[{"iso":"eng"}]},{"page":"56 - 81","citation":{"apa":"Brody, J., Dziembowski, S., Faust, S., & Pietrzak, K. Z. (2017). Position based cryptography and multiparty communication complexity. In Y. Kalai & L. Reyzin (Eds.) (Vol. 10677, pp. 56–81). Presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States: Springer. https://doi.org/10.1007/978-3-319-70500-2_3","ieee":"J. Brody, S. Dziembowski, S. Faust, and K. Z. Pietrzak, “Position based cryptography and multiparty communication complexity,” presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States, 2017, vol. 10677, pp. 56–81.","ista":"Brody J, Dziembowski S, Faust S, Pietrzak KZ. 2017. Position based cryptography and multiparty communication complexity. TCC: Theory of Cryptography Conference, LNCS, vol. 10677, 56–81.","ama":"Brody J, Dziembowski S, Faust S, Pietrzak KZ. Position based cryptography and multiparty communication complexity. In: Kalai Y, Reyzin L, eds. Vol 10677. Springer; 2017:56-81. doi:10.1007/978-3-319-70500-2_3","chicago":"Brody, Joshua, Stefan Dziembowski, Sebastian Faust, and Krzysztof Z Pietrzak. “Position Based Cryptography and Multiparty Communication Complexity.” edited by Yael Kalai and Leonid Reyzin, 10677:56–81. Springer, 2017. https://doi.org/10.1007/978-3-319-70500-2_3.","short":"J. Brody, S. Dziembowski, S. Faust, K.Z. Pietrzak, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 56–81.","mla":"Brody, Joshua, et al. Position Based Cryptography and Multiparty Communication Complexity. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 56–81, doi:10.1007/978-3-319-70500-2_3."},"date_published":"2017-11-05T00:00:00Z","scopus_import":1,"day":"05","status":"public","title":"Position based cryptography and multiparty communication complexity","intvolume":" 10677","_id":"605","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Position based cryptography (PBC), proposed in the seminal work of Chandran, Goyal, Moriarty, and Ostrovsky (SIAM J. Computing, 2014), aims at constructing cryptographic schemes in which the identity of the user is his geographic position. Chandran et al. construct PBC schemes for secure positioning and position-based key agreement in the bounded-storage model (Maurer, J. Cryptology, 1992). Apart from bounded memory, their security proofs need a strong additional restriction on the power of the adversary: he cannot compute joint functions of his inputs. Removing this assumption is left as an open problem. We show that an answer to this question would resolve a long standing open problem in multiparty communication complexity: finding a function that is hard to compute with low communication complexity in the simultaneous message model, but easy to compute in the fully adaptive model. On a more positive side: we also show some implications in the other direction, i.e.: we prove that lower bounds on the communication complexity of certain multiparty problems imply existence of PBC primitives. Using this result we then show two attractive ways to “bypass” our hardness result: the first uses the random oracle model, the second weakens the locality requirement in the bounded-storage model to online computability. The random oracle construction is arguably one of the simplest proposed so far in this area. Our results indicate that constructing improved provably secure protocols for PBC requires a better understanding of multiparty communication complexity. This is yet another example where negative results in one area (in our case: lower bounds in multiparty communication complexity) can be used to construct secure cryptographic schemes.","lang":"eng"}],"quality_controlled":"1","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2016/536","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"name":"TCC: Theory of Cryptography Conference","end_date":"2017-11-15","location":"Baltimore, MD, United States","start_date":"2017-11-12"},"doi":"10.1007/978-3-319-70500-2_3","month":"11","publication_identifier":{"isbn":["978-331970499-9"]},"publication_status":"published","editor":[{"full_name":"Kalai, Yael","last_name":"Kalai","first_name":"Yael"},{"full_name":"Reyzin, Leonid","first_name":"Leonid","last_name":"Reyzin"}],"publisher":"Springer","department":[{"_id":"KrPi"}],"year":"2017","date_created":"2018-12-11T11:47:27Z","date_updated":"2021-01-12T08:05:53Z","volume":10677,"author":[{"last_name":"Brody","first_name":"Joshua","full_name":"Brody, Joshua"},{"full_name":"Dziembowski, Stefan","first_name":"Stefan","last_name":"Dziembowski"},{"first_name":"Sebastian","last_name":"Faust","full_name":"Faust, Sebastian"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"}],"publist_id":"7200","ec_funded":1},{"publication_identifier":{"issn":["20413181"]},"month":"12","language":[{"iso":"eng"}],"doi":"10.1039/9781782626800-00444","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.06753"}],"oa":1,"publist_id":"7201","volume":11,"date_created":"2018-12-11T11:47:27Z","date_updated":"2021-01-12T08:05:50Z","author":[{"full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","first_name":"Mikhail"},{"full_name":"Schmidt, Richard","last_name":"Schmidt","first_name":"Richard"}],"publisher":"The Royal Society of Chemistry","editor":[{"last_name":"Dulieu","first_name":"Oliver","full_name":"Dulieu, Oliver"},{"first_name":"Andreas","last_name":"Osterwalder","full_name":"Osterwalder, Andreas"}],"department":[{"_id":"MiLe"}],"publication_status":"published","year":"2017","day":"14","series_title":"Theoretical and Computational Chemistry Series","scopus_import":1,"date_published":"2017-12-14T00:00:00Z","page":"444 - 495","citation":{"ama":"Lemeshko M, Schmidt R. Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Dulieu O, Osterwalder A, eds. Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero . Vol 11. Theoretical and Computational Chemistry Series. The Royal Society of Chemistry; 2017:444-495. doi:10.1039/9781782626800-00444","apa":"Lemeshko, M., & Schmidt, R. (2017). Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In O. Dulieu & A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero (Vol. 11, pp. 444–495). The Royal Society of Chemistry. https://doi.org/10.1039/9781782626800-00444","ieee":"M. Lemeshko and R. Schmidt, “Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets,” in Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , vol. 11, O. Dulieu and A. Osterwalder, Eds. The Royal Society of Chemistry, 2017, pp. 444–495.","ista":"Lemeshko M, Schmidt R. 2017.Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero . Theoretical and Computational Chemistry Series, vol. 11, 444–495.","short":"M. Lemeshko, R. Schmidt, in:, O. Dulieu, A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , The Royal Society of Chemistry, 2017, pp. 444–495.","mla":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , edited by Oliver Dulieu and Andreas Osterwalder, vol. 11, The Royal Society of Chemistry, 2017, pp. 444–95, doi:10.1039/9781782626800-00444.","chicago":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” In Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , edited by Oliver Dulieu and Andreas Osterwalder, 11:444–95. Theoretical and Computational Chemistry Series. The Royal Society of Chemistry, 2017. https://doi.org/10.1039/9781782626800-00444."},"publication":"Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero ","abstract":[{"lang":"eng","text":"In several settings of physics and chemistry one has to deal with molecules interacting with some kind of an external environment, be it a gas, a solution, or a crystal surface. Understanding molecular processes in the presence of such a many-particle bath is inherently challenging, and usually requires large-scale numerical computations. Here, we present an alternative approach to the problem, based on the notion of the angulon quasiparticle. We show that molecules rotating inside superfluid helium nanodroplets and Bose–Einstein condensates form angulons, and therefore can be described by straightforward solutions of a simple microscopic Hamiltonian. Casting the problem in the language of angulons allows us not only to greatly simplify it, but also to gain insights into the origins of the observed phenomena and to make predictions for future experimental studies."}],"alternative_title":["Theoretical and Computational Chemistry Series"],"type":"book_chapter","oa_version":"Submitted Version","intvolume":" 11","title":"Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"604"},{"publication":"Methods","citation":{"ista":"Balta E, Stopp JA, Castelletti L, Kirchgessner H, Samstag Y, Wabnitz GH. 2017. Qualitative and quantitative analysis of PMN/T-cell interactions by InFlow and super-resolution microscopy. Methods. 112(1), 25–38.","apa":"Balta, E., Stopp, J. A., Castelletti, L., Kirchgessner, H., Samstag, Y., & Wabnitz, G. H. (2017). Qualitative and quantitative analysis of PMN/T-cell interactions by InFlow and super-resolution microscopy. Methods. Elsevier. https://doi.org/10.1016/j.ymeth.2016.09.013","ieee":"E. Balta, J. A. Stopp, L. Castelletti, H. Kirchgessner, Y. Samstag, and G. H. Wabnitz, “Qualitative and quantitative analysis of PMN/T-cell interactions by InFlow and super-resolution microscopy,” Methods, vol. 112, no. 1. Elsevier, pp. 25–38, 2017.","ama":"Balta E, Stopp JA, Castelletti L, Kirchgessner H, Samstag Y, Wabnitz GH. Qualitative and quantitative analysis of PMN/T-cell interactions by InFlow and super-resolution microscopy. Methods. 2017;112(1):25-38. doi:10.1016/j.ymeth.2016.09.013","chicago":"Balta, Emre, Julian A Stopp, Laura Castelletti, Henning Kirchgessner, Yvonne Samstag, and Guido H. Wabnitz. “Qualitative and Quantitative Analysis of PMN/T-Cell Interactions by InFlow and Super-Resolution Microscopy.” Methods. Elsevier, 2017. https://doi.org/10.1016/j.ymeth.2016.09.013.","mla":"Balta, Emre, et al. “Qualitative and Quantitative Analysis of PMN/T-Cell Interactions by InFlow and Super-Resolution Microscopy.” Methods, vol. 112, no. 1, Elsevier, 2017, pp. 25–38, doi:10.1016/j.ymeth.2016.09.013.","short":"E. Balta, J.A. Stopp, L. Castelletti, H. Kirchgessner, Y. Samstag, G.H. Wabnitz, Methods 112 (2017) 25–38."},"external_id":{"pmid":["27693880"]},"quality_controlled":"1","page":"25-38","doi":"10.1016/j.ymeth.2016.09.013","date_published":"2017-01-01T00:00:00Z","language":[{"iso":"eng"}],"month":"01","day":"01","publication_identifier":{"issn":["1046-2023"]},"_id":"6059","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017","pmid":1,"publication_status":"published","title":"Qualitative and quantitative analysis of PMN/T-cell interactions by InFlow and super-resolution microscopy","status":"public","intvolume":" 112","publisher":"Elsevier","author":[{"full_name":"Balta, Emre","first_name":"Emre","last_name":"Balta"},{"full_name":"Stopp, Julian A","last_name":"Stopp","first_name":"Julian A","id":"489E3F00-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Castelletti, Laura","first_name":"Laura","last_name":"Castelletti"},{"first_name":"Henning","last_name":"Kirchgessner","full_name":"Kirchgessner, Henning"},{"full_name":"Samstag, Yvonne","first_name":"Yvonne","last_name":"Samstag"},{"full_name":"Wabnitz, Guido H.","first_name":"Guido H.","last_name":"Wabnitz"}],"related_material":{"link":[{"url":"http://dx.doi.org/10.1016/j.ymeth.2016.09.013","relation":"supplementary_material"}]},"date_created":"2019-02-26T13:45:17Z","date_updated":"2021-01-12T08:05:57Z","volume":112,"oa_version":"None","type":"journal_article","abstract":[{"text":"Neutrophils or polymorphonuclear cells (PMN) eliminate bacteria via phagocytosis and/or NETosis. Apartfrom these conventional roles, PMN also have immune-regulatory functions. They can transdifferentiateand upregulate MHCII as well as ligands for costimulatory receptors which enables them to behave asantigen presenting cells (APC). The initial step for activating T-cells is the formation of an immunesynapse between T-cells and antigen-presenting cells. However, the immune synapse that develops atthe PMN/T-cell contact zone is as yet hardly investigated due to the non-availability of methods foranalysis of large number of PMN interactions. In order to overcome these obstacles, we introduce herea workflow to analyse the immune synapse of primary human PMN and T-cells using multispectral imag-ing flow cytometry (InFlow microscopy) and super-resolution microscopy. For that purpose, we used CD3and CD66b as the lineage markers for T-cells and PMN, respectively. Thereafter, we applied and criticallydiscussed various ‘‘masks” for identification of T-cell PMN interactions. Using this approach, we foundthat a small fraction of transdifferentiated PMN (CD66b+CD86high) formed stable PMN/T-cell conjugates.Interestingly, while both CD3 and CD66b accumulation in the immune synapse was dependent on thematuration state of the PMN, only CD3 accumulation was greatly enhanced by the presence of superanti-gen. The actin cytoskeleton was weakly rearranged at the PMN side on the immune synapse upon contactwith a T-cell in the presence of superantigen. A more detailed analysis using super-resolution microscopy(structured-illumination microscopy, SIM) confirmed this finding. Together, we present an InFlow micro-scopy based approach for the large scale analysis of PMN/T-cell interactions and – combined with SIM – apossibility for an in-depth analysis of protein translocation at the site of interactions.","lang":"eng"}],"issue":"1","extern":"1"},{"abstract":[{"text":"Several cryptographic schemes and applications are based on functions that are both reasonably efficient to compute and moderately hard to invert, including client puzzles for Denial-of-Service protection, password protection via salted hashes, or recent proof-of-work blockchain systems. Despite their wide use, a definition of this concept has not yet been distilled and formalized explicitly. Instead, either the applications are proven directly based on the assumptions underlying the function, or some property of the function is proven, but the security of the application is argued only informally. The goal of this work is to provide a (universal) definition that decouples the efforts of designing new moderately hard functions and of building protocols based on them, serving as an interface between the two. On a technical level, beyond the mentioned definitions, we instantiate the model for four different notions of hardness. We extend the work of Alwen and Serbinenko (STOC 2015) by providing a general tool for proving security for the first notion of memory-hard functions that allows for provably secure applications. The tool allows us to recover all of the graph-theoretic techniques developed for proving security under the older, non-composable, notion of security used by Alwen and Serbinenko. As an application of our definition of moderately hard functions, we prove the security of two different schemes for proofs of effort (PoE). We also formalize and instantiate the concept of a non-interactive proof of effort (niPoE), in which the proof is not bound to a particular communication context but rather any bit-string chosen by the prover.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Submitted Version","title":"Moderately hard functions: Definition, instantiations, and applications","status":"public","intvolume":" 10677","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"609","day":"05","scopus_import":1,"date_published":"2017-11-05T00:00:00Z","page":"493 - 526","citation":{"ista":"Alwen JF, Tackmann B. 2017. Moderately hard functions: Definition, instantiations, and applications. TCC: Theory of Cryptography, LNCS, vol. 10677, 493–526.","ieee":"J. F. Alwen and B. Tackmann, “Moderately hard functions: Definition, instantiations, and applications,” presented at the TCC: Theory of Cryptography, Baltimore, MD, United States, 2017, vol. 10677, pp. 493–526.","apa":"Alwen, J. F., & Tackmann, B. (2017). Moderately hard functions: Definition, instantiations, and applications. In Y. Kalai & L. Reyzin (Eds.) (Vol. 10677, pp. 493–526). Presented at the TCC: Theory of Cryptography, Baltimore, MD, United States: Springer. https://doi.org/10.1007/978-3-319-70500-2_17","ama":"Alwen JF, Tackmann B. Moderately hard functions: Definition, instantiations, and applications. In: Kalai Y, Reyzin L, eds. Vol 10677. Springer; 2017:493-526. doi:10.1007/978-3-319-70500-2_17","chicago":"Alwen, Joel F, and Björn Tackmann. “Moderately Hard Functions: Definition, Instantiations, and Applications.” edited by Yael Kalai and Leonid Reyzin, 10677:493–526. Springer, 2017. https://doi.org/10.1007/978-3-319-70500-2_17.","mla":"Alwen, Joel F., and Björn Tackmann. Moderately Hard Functions: Definition, Instantiations, and Applications. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 493–526, doi:10.1007/978-3-319-70500-2_17.","short":"J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526."},"publist_id":"7196","date_created":"2018-12-11T11:47:28Z","date_updated":"2021-01-12T08:06:04Z","volume":10677,"author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F"},{"full_name":"Tackmann, Björn","last_name":"Tackmann","first_name":"Björn"}],"publication_status":"published","publisher":"Springer","department":[{"_id":"KrPi"}],"editor":[{"first_name":"Yael","last_name":"Kalai","full_name":"Kalai, Yael"},{"full_name":"Reyzin, Leonid","last_name":"Reyzin","first_name":"Leonid"}],"year":"2017","month":"11","publication_identifier":{"isbn":["978-331970499-9"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2017-11-15","location":"Baltimore, MD, United States","start_date":"2017-11-12","name":"TCC: Theory of Cryptography"},"doi":"10.1007/978-3-319-70500-2_17","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2017/945","open_access":"1"}]},{"type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"The fact that the complete graph K5 does not embed in the plane has been generalized in two independent directions. On the one hand, the solution of the classical Heawood problem for graphs on surfaces established that the complete graph Kn embeds in a closed surface M (other than the Klein bottle) if and only if (n−3)(n−4) ≤ 6b1(M), where b1(M) is the first Z2-Betti number of M. On the other hand, van Kampen and Flores proved that the k-skeleton of the n-dimensional simplex (the higher-dimensional analogue of Kn+1) embeds in R2k if and only if n ≤ 2k + 1. Two decades ago, Kühnel conjectured that the k-skeleton of the n-simplex embeds in a compact, (k − 1)-connected 2k-manifold with kth Z2-Betti number bk only if the following generalized Heawood inequality holds: (k+1 n−k−1) ≤ (k+1 2k+1)bk. This is a common generalization of the case of graphs on surfaces as well as the van Kampen–Flores theorem. In the spirit of Kühnel’s conjecture, we prove that if the k-skeleton of the n-simplex embeds in a compact 2k-manifold with kth Z2-Betti number bk, then n ≤ 2bk(k 2k+2)+2k+4. This bound is weaker than the generalized Heawood inequality, but does not require the assumption that M is (k−1)-connected. Our results generalize to maps without q-covered points, in the spirit of Tverberg’s theorem, for q a prime power. Our proof uses a result of Volovikov about maps that satisfy a certain homological triviality condition."}],"intvolume":" 222","status":"public","title":"On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"610","oa_version":"Preprint","scopus_import":1,"day":"01","page":"841 - 866","citation":{"ista":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. 2017. On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. 222(2), 841–866.","ieee":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result,” Israel Journal of Mathematics, vol. 222, no. 2. Springer, pp. 841–866, 2017.","apa":"Goaoc, X., Mabillard, I., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2017). On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-017-1607-7","ama":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. 2017;222(2):841-866. doi:10.1007/s11856-017-1607-7","chicago":"Goaoc, Xavier, Isaac Mabillard, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “On Generalized Heawood Inequalities for Manifolds: A van Kampen–Flores Type Nonembeddability Result.” Israel Journal of Mathematics. Springer, 2017. https://doi.org/10.1007/s11856-017-1607-7.","mla":"Goaoc, Xavier, et al. “On Generalized Heawood Inequalities for Manifolds: A van Kampen–Flores Type Nonembeddability Result.” Israel Journal of Mathematics, vol. 222, no. 2, Springer, 2017, pp. 841–66, doi:10.1007/s11856-017-1607-7.","short":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, Israel Journal of Mathematics 222 (2017) 841–866."},"publication":"Israel Journal of Mathematics","date_published":"2017-10-01T00:00:00Z","ec_funded":1,"publist_id":"7194","publisher":"Springer","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2017","acknowledgement":"The work by Z. P. was partially supported by the Israel Science Foundation grant ISF-768/12. The work by Z. P. and M. T. was partially supported by the project CE-ITI (GACR P202/12/G061) of the Czech Science Foundation and by the ERC Advanced Grant No. 267165. Part of the research work of M.T. was conducted at IST Austria, supported by an IST Fellowship. The research of P. P. was supported by the ERC Advanced grant no. 320924. The work by I. M. and U. W. was supported by the Swiss National Science Foundation (grants SNSF-200020-138230 and SNSF-PP00P2-138948). The collaboration between U. W. and X. G. was partially supported by the LabEx Bézout (ANR-10-LABX-58).","volume":222,"date_updated":"2023-02-23T10:02:13Z","date_created":"2018-12-11T11:47:29Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1511"}]},"author":[{"full_name":"Goaoc, Xavier","first_name":"Xavier","last_name":"Goaoc"},{"full_name":"Mabillard, Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","first_name":"Isaac","last_name":"Mabillard"},{"full_name":"Paták, Pavel","last_name":"Paták","first_name":"Pavel"},{"last_name":"Patakova","first_name":"Zuzana","orcid":"0000-0002-3975-1683","id":"48B57058-F248-11E8-B48F-1D18A9856A87","full_name":"Patakova, Zuzana"},{"id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","first_name":"Martin","last_name":"Tancer","full_name":"Tancer, Martin"},{"full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli"}],"month":"10","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1610.09063"}],"language":[{"iso":"eng"}],"doi":"10.1007/s11856-017-1607-7"},{"month":"04","publication_identifier":{"issn":["0027-8424","1091-6490"]},"doi":"10.1073/pnas.1618934114","language":[{"iso":"eng"}],"oa":1,"external_id":{"pmid":["28373553"]},"quality_controlled":"1","file_date_updated":"2020-07-14T12:47:20Z","extern":"1","author":[{"full_name":"Fenk, Lorenz A.","last_name":"Fenk","first_name":"Lorenz A."},{"last_name":"de Bono","first_name":"Mario","orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario"}],"date_created":"2019-03-19T13:46:36Z","date_updated":"2021-01-12T08:06:11Z","volume":114,"year":"2017","pmid":1,"publication_status":"published","publisher":"National Academy of Sciences","day":"18","has_accepted_license":"1","date_published":"2017-04-18T00:00:00Z","publication":"Proceedings of the National Academy of Sciences","citation":{"chicago":"Fenk, Lorenz A., and Mario de Bono. “Memory of Recent Oxygen Experience Switches Pheromone Valence InCaenorhabditis Elegans.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1618934114.","short":"L.A. Fenk, M. de Bono, Proceedings of the National Academy of Sciences 114 (2017) 4195–4200.","mla":"Fenk, Lorenz A., and Mario de Bono. “Memory of Recent Oxygen Experience Switches Pheromone Valence InCaenorhabditis Elegans.” Proceedings of the National Academy of Sciences, vol. 114, no. 16, National Academy of Sciences, 2017, pp. 4195–200, doi:10.1073/pnas.1618934114.","apa":"Fenk, L. A., & de Bono, M. (2017). Memory of recent oxygen experience switches pheromone valence inCaenorhabditis elegans. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1618934114","ieee":"L. A. Fenk and M. de Bono, “Memory of recent oxygen experience switches pheromone valence inCaenorhabditis elegans,” Proceedings of the National Academy of Sciences, vol. 114, no. 16. National Academy of Sciences, pp. 4195–4200, 2017.","ista":"Fenk LA, de Bono M. 2017. Memory of recent oxygen experience switches pheromone valence inCaenorhabditis elegans. Proceedings of the National Academy of Sciences. 114(16), 4195–4200.","ama":"Fenk LA, de Bono M. Memory of recent oxygen experience switches pheromone valence inCaenorhabditis elegans. Proceedings of the National Academy of Sciences. 2017;114(16):4195-4200. doi:10.1073/pnas.1618934114"},"page":"4195-4200","abstract":[{"lang":"eng","text":"Animals adjust their behavioral priorities according to momentary needs and prior experience. We show that Caenorhabditis elegans changes how it processes sensory information according to the oxygen environment it experienced recently. C. elegans acclimated to 7% O2 are aroused by CO2 and repelled by pheromones that attract animals acclimated to 21% O2. This behavioral plasticity arises from prolonged activity differences in a circuit that continuously signals O2 levels. A sustained change in the activity of O2-sensing neurons reprograms the properties of their postsynaptic partners, the RMG hub interneurons. RMG is gap-junctionally coupled to the ASK and ADL pheromone sensors that respectively drive pheromone attraction and repulsion. Prior O2 experience has opposite effects on the pheromone responsiveness of these neurons. These circuit changes provide a physiological correlate of altered pheromone valence. Our results suggest C. elegans stores a memory of recent O2 experience in the RMG circuit and illustrate how a circuit is flexibly sculpted to guide behavioral decisions in a context-dependent manner."}],"issue":"16","type":"journal_article","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"6116","checksum":"1801bc8319b752fa17598004ec375279","date_created":"2019-03-19T14:00:42Z","date_updated":"2020-07-14T12:47:20Z","access_level":"open_access","file_name":"2017_PNAS_Fenk.pdf","content_type":"application/pdf","file_size":1217696,"creator":"kschuh"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6115","status":"public","ddc":["570"],"title":"Memory of recent oxygen experience switches pheromone valence inCaenorhabditis elegans","intvolume":" 114"},{"month":"02","publication_identifier":{"issn":["0028-0836","1476-4687"]},"language":[{"iso":"eng"}],"doi":"10.1038/nature20818","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/28099418","open_access":"1"}],"external_id":{"pmid":[" 28099418"]},"extern":"1","date_updated":"2021-01-12T08:06:12Z","date_created":"2019-03-19T14:06:41Z","volume":542,"author":[{"full_name":"Chen, Changchun","last_name":"Chen","first_name":"Changchun"},{"last_name":"Itakura","first_name":"Eisuke","full_name":"Itakura, Eisuke"},{"first_name":"Geoffrey M.","last_name":"Nelson","full_name":"Nelson, Geoffrey M."},{"full_name":"Sheng, Ming","last_name":"Sheng","first_name":"Ming"},{"last_name":"Laurent","first_name":"Patrick","full_name":"Laurent, Patrick"},{"first_name":"Lorenz A.","last_name":"Fenk","full_name":"Fenk, Lorenz A."},{"first_name":"Rebecca A.","last_name":"Butcher","full_name":"Butcher, Rebecca A."},{"full_name":"Hegde, Ramanujan S.","first_name":"Ramanujan S.","last_name":"Hegde"},{"full_name":"de Bono, Mario","first_name":"Mario","last_name":"de Bono","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8347-0443"}],"publication_status":"published","publisher":"Springer Nature","year":"2017","pmid":1,"day":"02","date_published":"2017-02-02T00:00:00Z","page":"43-48","publication":"Nature","citation":{"ista":"Chen C, Itakura E, Nelson GM, Sheng M, Laurent P, Fenk LA, Butcher RA, Hegde RS, de Bono M. 2017. IL-17 is a neuromodulator of Caenorhabditis elegans sensory responses. Nature. 542(7639), 43–48.","ieee":"C. Chen et al., “IL-17 is a neuromodulator of Caenorhabditis elegans sensory responses,” Nature, vol. 542, no. 7639. Springer Nature, pp. 43–48, 2017.","apa":"Chen, C., Itakura, E., Nelson, G. M., Sheng, M., Laurent, P., Fenk, L. A., … de Bono, M. (2017). IL-17 is a neuromodulator of Caenorhabditis elegans sensory responses. Nature. Springer Nature. https://doi.org/10.1038/nature20818","ama":"Chen C, Itakura E, Nelson GM, et al. IL-17 is a neuromodulator of Caenorhabditis elegans sensory responses. Nature. 2017;542(7639):43-48. doi:10.1038/nature20818","chicago":"Chen, Changchun, Eisuke Itakura, Geoffrey M. Nelson, Ming Sheng, Patrick Laurent, Lorenz A. Fenk, Rebecca A. Butcher, Ramanujan S. Hegde, and Mario de Bono. “IL-17 Is a Neuromodulator of Caenorhabditis Elegans Sensory Responses.” Nature. Springer Nature, 2017. https://doi.org/10.1038/nature20818.","mla":"Chen, Changchun, et al. “IL-17 Is a Neuromodulator of Caenorhabditis Elegans Sensory Responses.” Nature, vol. 542, no. 7639, Springer Nature, 2017, pp. 43–48, doi:10.1038/nature20818.","short":"C. Chen, E. Itakura, G.M. Nelson, M. Sheng, P. Laurent, L.A. Fenk, R.A. Butcher, R.S. Hegde, M. de Bono, Nature 542 (2017) 43–48."},"abstract":[{"lang":"eng","text":"Interleukin-17 (IL-17) is a major pro-inflammatory cytokine: it mediates responses to pathogens or tissue damage, and drives autoimmune diseases. Little is known about its role in the nervous system. Here we show that IL-17 has neuromodulator-like properties in Caenorhabditis elegans. IL-17 can act directly on neurons to alter their response properties and contribution to behaviour. Using unbiased genetic screens, we delineate an IL-17 signalling pathway and show that it acts in the RMG hub interneurons. Disrupting IL-17 signalling reduces RMG responsiveness to input from oxygen sensors, and renders sustained escape from 21% oxygen transient and contingent on additional stimuli. Over-activating IL-17 receptors abnormally heightens responses to 21% oxygen in RMG neurons and whole animals. IL-17 deficiency can be bypassed by optogenetic stimulation of RMG. Inducing IL-17 expression in adults can rescue mutant defects within 6 h. These findings reveal a non-immunological role of IL-17 modulating circuit function and behaviour."}],"issue":"7639","type":"journal_article","oa_version":"Submitted Version","status":"public","title":"IL-17 is a neuromodulator of Caenorhabditis elegans sensory responses","intvolume":" 542","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6117"},{"doi":"10.1126/science.aao3526","date_published":"2017-11-17T00:00:00Z","language":[{"iso":"eng"}],"publication":"Science","citation":{"apa":"Bradley, D., Xu, P., Mohorianu, I., Whibley, A., Field, D., Tavares, H., … Coen, E. (2017). Evolution of flower color pattern through selection on regulatory small RNAs. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aao3526","ieee":"D. Bradley et al., “Evolution of flower color pattern through selection on regulatory small RNAs,” Science, vol. 358, no. 6365. American Association for the Advancement of Science, pp. 925–928, 2017.","ista":"Bradley D, Xu P, Mohorianu I, Whibley A, Field D, Tavares H, Couchman M, Copsey L, Carpenter R, Li M, Li Q, Xue Y, Dalmay T, Coen E. 2017. Evolution of flower color pattern through selection on regulatory small RNAs. Science. 358(6365), 925–928.","ama":"Bradley D, Xu P, Mohorianu I, et al. Evolution of flower color pattern through selection on regulatory small RNAs. Science. 2017;358(6365):925-928. doi:10.1126/science.aao3526","chicago":"Bradley, Desmond, Ping Xu, Irina Mohorianu, Annabel Whibley, David Field, Hugo Tavares, Matthew Couchman, et al. “Evolution of Flower Color Pattern through Selection on Regulatory Small RNAs.” Science. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/science.aao3526.","short":"D. Bradley, P. Xu, I. Mohorianu, A. Whibley, D. Field, H. Tavares, M. Couchman, L. Copsey, R. Carpenter, M. Li, Q. Li, Y. Xue, T. Dalmay, E. Coen, Science 358 (2017) 925–928.","mla":"Bradley, Desmond, et al. “Evolution of Flower Color Pattern through Selection on Regulatory Small RNAs.” Science, vol. 358, no. 6365, American Association for the Advancement of Science, 2017, pp. 925–28, doi:10.1126/science.aao3526."},"quality_controlled":"1","page":"925 - 928","month":"11","day":"17","publication_identifier":{"issn":["00368075"]},"scopus_import":1,"author":[{"last_name":"Bradley","first_name":"Desmond","full_name":"Bradley, Desmond"},{"full_name":"Xu, Ping","first_name":"Ping","last_name":"Xu"},{"full_name":"Mohorianu, Irina","last_name":"Mohorianu","first_name":"Irina"},{"full_name":"Whibley, Annabel","last_name":"Whibley","first_name":"Annabel"},{"full_name":"Field, David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4014-8478","first_name":"David","last_name":"Field"},{"full_name":"Tavares, Hugo","last_name":"Tavares","first_name":"Hugo"},{"full_name":"Couchman, Matthew","first_name":"Matthew","last_name":"Couchman"},{"last_name":"Copsey","first_name":"Lucy","full_name":"Copsey, Lucy"},{"full_name":"Carpenter, Rosemary","last_name":"Carpenter","first_name":"Rosemary"},{"last_name":"Li","first_name":"Miaomiao","full_name":"Li, Miaomiao"},{"last_name":"Li","first_name":"Qun","full_name":"Li, Qun"},{"last_name":"Xue","first_name":"Yongbiao","full_name":"Xue, Yongbiao"},{"full_name":"Dalmay, Tamas","last_name":"Dalmay","first_name":"Tamas"},{"first_name":"Enrico","last_name":"Coen","full_name":"Coen, Enrico"}],"date_updated":"2021-01-12T08:06:10Z","date_created":"2018-12-11T11:47:29Z","oa_version":"None","volume":358,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"611","year":"2017","status":"public","title":"Evolution of flower color pattern through selection on regulatory small RNAs","publication_status":"published","publisher":"American Association for the Advancement of Science","department":[{"_id":"NiBa"}],"intvolume":" 358","abstract":[{"lang":"eng","text":"Small RNAs (sRNAs) regulate genes in plants and animals. Here, we show that population-wide differences in color patterns in snapdragon flowers are caused by an inverted duplication that generates sRNAs. The complexity and size of the transcripts indicate that the duplication represents an intermediate on the pathway to microRNA evolution. The sRNAs repress a pigment biosynthesis gene, creating a yellow highlight at the site of pollinator entry. The inverted duplication exhibits steep clines in allele frequency in a natural hybrid zone, showing that the allele is under selection. Thus, regulatory interactions of evolutionarily recent sRNAs can be acted upon by selection and contribute to the evolution of phenotypic diversity."}],"issue":"6365","publist_id":"7193","type":"journal_article"},{"extern":"1","file_date_updated":"2020-07-14T12:47:19Z","volume":114,"date_created":"2019-03-19T13:29:51Z","date_updated":"2021-01-12T08:06:11Z","author":[{"last_name":"Oda","first_name":"Shigekazu","full_name":"Oda, Shigekazu"},{"full_name":"Toyoshima, Yu","last_name":"Toyoshima","first_name":"Yu"},{"orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","last_name":"de Bono","first_name":"Mario","full_name":"de Bono, Mario"}],"publisher":"National Academy of Sciences","publication_status":"published","pmid":1,"year":"2017","publication_identifier":{"issn":["0027-8424","1091-6490"]},"month":"06","language":[{"iso":"eng"}],"doi":"10.1073/pnas.1614596114","quality_controlled":"1","external_id":{"pmid":["28536200"]},"oa":1,"issue":"23","type":"journal_article","file":[{"relation":"main_file","file_id":"6114","checksum":"9e42ce47090ecdad7d76f2dbdebb924e","date_updated":"2020-07-14T12:47:19Z","date_created":"2019-03-19T13:42:58Z","access_level":"open_access","file_name":"2017_PNAS_Oda.pdf","content_type":"application/pdf","file_size":1469622,"creator":"kschuh"}],"oa_version":"Published Version","intvolume":" 114","status":"public","title":"Modulation of sensory information processing by a neuroglobin in Caenorhabditis elegans","ddc":["570"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6113","has_accepted_license":"1","day":"06","date_published":"2017-06-06T00:00:00Z","page":"E4658-E4665","citation":{"ama":"Oda S, Toyoshima Y, de Bono M. Modulation of sensory information processing by a neuroglobin in Caenorhabditis elegans. Proceedings of the National Academy of Sciences. 2017;114(23):E4658-E4665. doi:10.1073/pnas.1614596114","ieee":"S. Oda, Y. Toyoshima, and M. de Bono, “Modulation of sensory information processing by a neuroglobin in Caenorhabditis elegans,” Proceedings of the National Academy of Sciences, vol. 114, no. 23. National Academy of Sciences, pp. E4658–E4665, 2017.","apa":"Oda, S., Toyoshima, Y., & de Bono, M. (2017). Modulation of sensory information processing by a neuroglobin in Caenorhabditis elegans. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1614596114","ista":"Oda S, Toyoshima Y, de Bono M. 2017. Modulation of sensory information processing by a neuroglobin in Caenorhabditis elegans. Proceedings of the National Academy of Sciences. 114(23), E4658–E4665.","short":"S. Oda, Y. Toyoshima, M. de Bono, Proceedings of the National Academy of Sciences 114 (2017) E4658–E4665.","mla":"Oda, Shigekazu, et al. “Modulation of Sensory Information Processing by a Neuroglobin in Caenorhabditis Elegans.” Proceedings of the National Academy of Sciences, vol. 114, no. 23, National Academy of Sciences, 2017, pp. E4658–65, doi:10.1073/pnas.1614596114.","chicago":"Oda, Shigekazu, Yu Toyoshima, and Mario de Bono. “Modulation of Sensory Information Processing by a Neuroglobin in Caenorhabditis Elegans.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1614596114."},"publication":"Proceedings of the National Academy of Sciences"},{"day":"01","article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","scopus_import":1,"date_published":"2017-12-01T00:00:00Z","publication":"Nature Communications","citation":{"short":"R.P. Chait, J. Ruess, T. Bergmiller, G. Tkačik, C.C. Guet, Nature Communications 8 (2017).","mla":"Chait, Remy P., et al. “Shaping Bacterial Population Behavior through Computer Interfaced Control of Individual Cells.” Nature Communications, vol. 8, no. 1, 1535, Nature Publishing Group, 2017, doi:10.1038/s41467-017-01683-1.","chicago":"Chait, Remy P, Jakob Ruess, Tobias Bergmiller, Gašper Tkačik, and Calin C Guet. “Shaping Bacterial Population Behavior through Computer Interfaced Control of Individual Cells.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/s41467-017-01683-1.","ama":"Chait RP, Ruess J, Bergmiller T, Tkačik G, Guet CC. Shaping bacterial population behavior through computer interfaced control of individual cells. Nature Communications. 2017;8(1). doi:10.1038/s41467-017-01683-1","ieee":"R. P. Chait, J. Ruess, T. Bergmiller, G. Tkačik, and C. C. Guet, “Shaping bacterial population behavior through computer interfaced control of individual cells,” Nature Communications, vol. 8, no. 1. Nature Publishing Group, 2017.","apa":"Chait, R. P., Ruess, J., Bergmiller, T., Tkačik, G., & Guet, C. C. (2017). Shaping bacterial population behavior through computer interfaced control of individual cells. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-017-01683-1","ista":"Chait RP, Ruess J, Bergmiller T, Tkačik G, Guet CC. 2017. Shaping bacterial population behavior through computer interfaced control of individual cells. Nature Communications. 8(1), 1535."},"abstract":[{"text":"Bacteria in groups vary individually, and interact with other bacteria and the environment to produce population-level patterns of gene expression. Investigating such behavior in detail requires measuring and controlling populations at the single-cell level alongside precisely specified interactions and environmental characteristics. Here we present an automated, programmable platform that combines image-based gene expression and growth measurements with on-line optogenetic expression control for hundreds of individual Escherichia coli cells over days, in a dynamically adjustable environment. This integrated platform broadly enables experiments that bridge individual and population behaviors. We demonstrate: (i) population structuring by independent closed-loop control of gene expression in many individual cells, (ii) cell-cell variation control during antibiotic perturbation, (iii) hybrid bio-digital circuits in single cells, and freely specifiable digital communication between individual bacteria. These examples showcase the potential for real-time integration of theoretical models with measurement and control of many individual cells to investigate and engineer microbial population behavior.","lang":"eng"}],"issue":"1","type":"journal_article","pubrep_id":"911","oa_version":"Published Version","file":[{"file_id":"5190","relation":"main_file","date_created":"2018-12-12T10:16:05Z","date_updated":"2020-07-14T12:47:20Z","checksum":"44bb5d0229926c23a9955d9fe0f9723f","file_name":"IST-2017-911-v1+1_s41467-017-01683-1.pdf","access_level":"open_access","creator":"system","file_size":1951699,"content_type":"application/pdf"}],"_id":"613","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Shaping bacterial population behavior through computer interfaced control of individual cells","ddc":["576","579"],"status":"public","intvolume":" 8","month":"12","publication_identifier":{"issn":["20411723"]},"doi":"10.1038/s41467-017-01683-1","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"grant_number":"P28844-B27","_id":"254E9036-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Biophysics of information processing in gene regulation"}],"file_date_updated":"2020-07-14T12:47:20Z","publist_id":"7191","ec_funded":1,"article_number":"1535","author":[{"full_name":"Chait, Remy P","first_name":"Remy P","last_name":"Chait","id":"3464AE84-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0876-3187"},{"last_name":"Ruess","first_name":"Jakob","orcid":"0000-0003-1615-3282","id":"4A245D00-F248-11E8-B48F-1D18A9856A87","full_name":"Ruess, Jakob"},{"full_name":"Bergmiller, Tobias","last_name":"Bergmiller","first_name":"Tobias","orcid":"0000-0001-5396-4346","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","first_name":"Gasper","full_name":"Tkacik, Gasper"},{"orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet","first_name":"Calin C","full_name":"Guet, Calin C"}],"date_created":"2018-12-11T11:47:30Z","date_updated":"2021-01-12T08:06:15Z","volume":8,"acknowledgement":"We are grateful to M. Lang, H. Janovjak, M. Khammash, A. Milias-Argeitis, M. Rullan, G. Batt, A. Bosma-Moody, Aryan, S. Leibler, and members of the Guet and Tkačik groups for helpful discussion, comments, and suggestions. We thank A. Moglich, T. Mathes, J. Tabor, and S. Schmidl for kind gifts of strains, and R. Hauschild, B. Knep, M. Lang, T. Asenov, E. Papusheva, T. Menner, T. Adletzberger, and J. Merrin for technical assistance. The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013) under REA grant agreement no. [291734]. (to R.C. and J.R.), Austrian Science Fund grant FWF P28844 (to G.T.), and internal IST Austria Interdisciplinary Project Support. J.R. acknowledges support from the Agence Nationale de la Recherche (ANR) under Grant Nos. ANR-16-CE33-0018 (MEMIP), ANR-16-CE12-0025 (COGEX) and ANR-10-BINF-06-01 (ICEBERG).","year":"2017","publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"CaGu"},{"_id":"GaTk"}]},{"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.00650"}],"project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"}],"quality_controlled":"1","doi":"10.1214/16-AIHP765","language":[{"iso":"eng"}],"publication_identifier":{"issn":["02460203"]},"month":"11","year":"2017","publisher":"Institute of Mathematical Statistics","department":[{"_id":"LaEr"}],"publication_status":"published","author":[{"full_name":"Erdös, László","first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603"},{"full_name":"Schnelli, Kevin","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0954-3231","first_name":"Kevin","last_name":"Schnelli"}],"volume":53,"date_updated":"2021-01-12T08:06:22Z","date_created":"2018-12-11T11:47:30Z","publist_id":"7189","ec_funded":1,"citation":{"ama":"Erdös L, Schnelli K. Universality for random matrix flows with time dependent density. Annales de l’institut Henri Poincare (B) Probability and Statistics. 2017;53(4):1606-1656. doi:10.1214/16-AIHP765","ista":"Erdös L, Schnelli K. 2017. Universality for random matrix flows with time dependent density. Annales de l’institut Henri Poincare (B) Probability and Statistics. 53(4), 1606–1656.","apa":"Erdös, L., & Schnelli, K. (2017). Universality for random matrix flows with time dependent density. Annales de l’institut Henri Poincare (B) Probability and Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/16-AIHP765","ieee":"L. Erdös and K. Schnelli, “Universality for random matrix flows with time dependent density,” Annales de l’institut Henri Poincare (B) Probability and Statistics, vol. 53, no. 4. Institute of Mathematical Statistics, pp. 1606–1656, 2017.","mla":"Erdös, László, and Kevin Schnelli. “Universality for Random Matrix Flows with Time Dependent Density.” Annales de l’institut Henri Poincare (B) Probability and Statistics, vol. 53, no. 4, Institute of Mathematical Statistics, 2017, pp. 1606–56, doi:10.1214/16-AIHP765.","short":"L. Erdös, K. Schnelli, Annales de l’institut Henri Poincare (B) Probability and Statistics 53 (2017) 1606–1656.","chicago":"Erdös, László, and Kevin Schnelli. “Universality for Random Matrix Flows with Time Dependent Density.” Annales de l’institut Henri Poincare (B) Probability and Statistics. Institute of Mathematical Statistics, 2017. https://doi.org/10.1214/16-AIHP765."},"publication":"Annales de l'institut Henri Poincare (B) Probability and Statistics","page":"1606 - 1656","date_published":"2017-11-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"615","intvolume":" 53","title":"Universality for random matrix flows with time dependent density","status":"public","oa_version":"Submitted Version","type":"journal_article","issue":"4","abstract":[{"text":"We show that the Dyson Brownian Motion exhibits local universality after a very short time assuming that local rigidity and level repulsion of the eigenvalues hold. These conditions are verified, hence bulk spectral universality is proven, for a large class of Wigner-like matrices, including deformed Wigner ensembles and ensembles with non-stochastic variance matrices whose limiting densities differ from Wigner's semicircle law.","lang":"eng"}]},{"article_number":"52","publist_id":"7186","file_date_updated":"2020-07-14T12:47:22Z","extern":"1","year":"2017","publisher":"BioMed Central","publication_status":"published","author":[{"full_name":"Franke, Frederik","last_name":"Franke","first_name":"Frederik"},{"last_name":"Armitage","first_name":"Sophie","full_name":"Armitage, Sophie"},{"orcid":"0000-0002-8696-6978","id":"29D0B332-F248-11E8-B48F-1D18A9856A87","last_name":"Kutzer","first_name":"Megan","full_name":"Kutzer, Megan"},{"full_name":"Kurtz, Joachim","last_name":"Kurtz","first_name":"Joachim"},{"full_name":"Scharsack, Jörn","first_name":"Jörn","last_name":"Scharsack"}],"volume":10,"date_created":"2018-12-11T11:47:31Z","date_updated":"2021-01-12T08:06:35Z","publication_identifier":{"issn":["17563305"]},"month":"06","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","doi":"10.1186/s13071-017-2192-7","language":[{"iso":"eng"}],"type":"journal_article","issue":"252","abstract":[{"lang":"eng","text":"Background: Increasing temperatures are predicted to strongly impact host-parasite interactions, but empirical tests are rare. Host species that are naturally exposed to a broad temperature spectrum offer the possibility to investigate the effects of elevated temperatures on hosts and parasites. Using three-spined sticklebacks, Gasterosteus aculeatus L., and tapeworms, Schistocephalus solidus (Müller, 1776), originating from a cold and a warm water site of a volcanic lake, we subjected sympatric and allopatric host-parasite combinations to cold and warm conditions in a fully crossed design. We predicted that warm temperatures would promote the development of the parasites, while the hosts might benefit from cooler temperatures. We further expected adaptations to the local temperature and mutual adaptations of local host-parasite pairs. Results: Overall, S. solidus parasites grew faster at warm temperatures and stickleback hosts at cold temperatures. On a finer scale, we observed that parasites were able to exploit their hosts more efficiently at the parasite’s temperature of origin. In contrast, host tolerance towards parasite infection was higher when sticklebacks were infected with parasites at the parasite’s ‘foreign’ temperature. Cold-origin sticklebacks tended to grow faster and parasite infection induced a stronger immune response. Conclusions: Our results suggest that increasing environmental temperatures promote the parasite rather than the host and that host tolerance is dependent on the interaction between parasite infection and temperature. Sticklebacks might use tolerance mechanisms towards parasite infection in combination with their high plasticity towards temperature changes to cope with increasing parasite infection pressures and rising temperatures."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"618","intvolume":" 10","title":"Environmental temperature variation influences fitness trade-offs in a fish-tapeworm association ","status":"public","ddc":["570"],"file":[{"date_created":"2019-01-21T13:45:36Z","date_updated":"2020-07-14T12:47:22Z","checksum":"742943377a38ee208108705b8e2f4dbf","relation":"main_file","file_id":"5864","content_type":"application/pdf","file_size":671807,"creator":"dernst","file_name":"2017_Parasites_Franke.pdf","access_level":"open_access"}],"oa_version":"Published Version","has_accepted_license":"1","day":"02","citation":{"mla":"Franke, Frederik, et al. “Environmental Temperature Variation Influences Fitness Trade-Offs in a Fish-Tapeworm Association .” Parasites & Vectors, vol. 10, no. 252, 52, BioMed Central, 2017, doi:10.1186/s13071-017-2192-7.","short":"F. Franke, S. Armitage, M. Kutzer, J. Kurtz, J. Scharsack, Parasites & Vectors 10 (2017).","chicago":"Franke, Frederik, Sophie Armitage, Megan Kutzer, Joachim Kurtz, and Jörn Scharsack. “Environmental Temperature Variation Influences Fitness Trade-Offs in a Fish-Tapeworm Association .” Parasites & Vectors. BioMed Central, 2017. https://doi.org/10.1186/s13071-017-2192-7.","ama":"Franke F, Armitage S, Kutzer M, Kurtz J, Scharsack J. Environmental temperature variation influences fitness trade-offs in a fish-tapeworm association . Parasites & Vectors. 2017;10(252). doi:10.1186/s13071-017-2192-7","ista":"Franke F, Armitage S, Kutzer M, Kurtz J, Scharsack J. 2017. Environmental temperature variation influences fitness trade-offs in a fish-tapeworm association . Parasites & Vectors. 10(252), 52.","apa":"Franke, F., Armitage, S., Kutzer, M., Kurtz, J., & Scharsack, J. (2017). Environmental temperature variation influences fitness trade-offs in a fish-tapeworm association . Parasites & Vectors. BioMed Central. https://doi.org/10.1186/s13071-017-2192-7","ieee":"F. Franke, S. Armitage, M. Kutzer, J. Kurtz, and J. Scharsack, “Environmental temperature variation influences fitness trade-offs in a fish-tapeworm association ,” Parasites & Vectors, vol. 10, no. 252. BioMed Central, 2017."},"publication":"Parasites & Vectors","date_published":"2017-06-02T00:00:00Z"},{"month":"05","publication_identifier":{"isbn":["978-3-319-52496-2"],"issn":["03015556"]},"doi":"10.1007/978-3-319-52498-6_9","language":[{"iso":"eng"}],"quality_controlled":"1","publist_id":"7177","author":[{"first_name":"Elisa","last_name":"Hill Yardin","full_name":"Hill Yardin, Elisa"},{"last_name":"Mckeown","first_name":"Sonja","full_name":"Mckeown, Sonja"},{"first_name":"Gaia","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia"},{"full_name":"Grabrucker, Andreas","last_name":"Grabrucker","first_name":"Andreas"}],"date_updated":"2021-01-12T08:06:46Z","date_created":"2018-12-11T11:47:33Z","volume":224,"year":"2017","publication_status":"published","editor":[{"full_name":"Schmeisser, Michael","first_name":"Michael","last_name":"Schmeisser"},{"last_name":"Boekers","first_name":"Tobias","full_name":"Boekers, Tobias"}],"publisher":"Springer","department":[{"_id":"GaNo"}],"day":"28","scopus_import":1,"series_title":"Advances in Anatomy Embryology and Cell Biology","date_published":"2017-05-28T00:00:00Z","publication":"Translational Anatomy and Cell Biology of Autism Spectrum Disorder","citation":{"chicago":"Hill Yardin, Elisa, Sonja Mckeown, Gaia Novarino, and Andreas Grabrucker. “Extracerebral Dysfunction in Animal Models of Autism Spectrum Disorder.” In Translational Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias Boekers, 224:159–87. Advances in Anatomy Embryology and Cell Biology. Springer, 2017. https://doi.org/10.1007/978-3-319-52498-6_9.","short":"E. Hill Yardin, S. Mckeown, G. Novarino, A. Grabrucker, in:, M. Schmeisser, T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder, Springer, 2017, pp. 159–187.","mla":"Hill Yardin, Elisa, et al. “Extracerebral Dysfunction in Animal Models of Autism Spectrum Disorder.” Translational Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias Boekers, vol. 224, Springer, 2017, pp. 159–87, doi:10.1007/978-3-319-52498-6_9.","ieee":"E. Hill Yardin, S. Mckeown, G. Novarino, and A. Grabrucker, “Extracerebral dysfunction in animal models of autism spectrum disorder,” in Translational Anatomy and Cell Biology of Autism Spectrum Disorder, vol. 224, M. Schmeisser and T. Boekers, Eds. Springer, 2017, pp. 159–187.","apa":"Hill Yardin, E., Mckeown, S., Novarino, G., & Grabrucker, A. (2017). Extracerebral dysfunction in animal models of autism spectrum disorder. In M. Schmeisser & T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder (Vol. 224, pp. 159–187). Springer. https://doi.org/10.1007/978-3-319-52498-6_9","ista":"Hill Yardin E, Mckeown S, Novarino G, Grabrucker A. 2017.Extracerebral dysfunction in animal models of autism spectrum disorder. In: Translational Anatomy and Cell Biology of Autism Spectrum Disorder. ADVSANAT, vol. 224, 159–187.","ama":"Hill Yardin E, Mckeown S, Novarino G, Grabrucker A. Extracerebral dysfunction in animal models of autism spectrum disorder. In: Schmeisser M, Boekers T, eds. Translational Anatomy and Cell Biology of Autism Spectrum Disorder. Vol 224. Advances in Anatomy Embryology and Cell Biology. Springer; 2017:159-187. doi:10.1007/978-3-319-52498-6_9"},"page":"159 - 187","abstract":[{"text":"Genetic factors might be largely responsible for the development of autism spectrum disorder (ASD) that alone or in combination with specific environmental risk factors trigger the pathology. Multiple mutations identified in ASD patients that impair synaptic function in the central nervous system are well studied in animal models. How these mutations might interact with other risk factors is not fully understood though. Additionally, how systems outside of the brain are altered in the context of ASD is an emerging area of research. Extracerebral influences on the physiology could begin in utero and contribute to changes in the brain and in the development of other body systems and further lead to epigenetic changes. Therefore, multiple recent studies have aimed at elucidating the role of gene-environment interactions in ASD. Here we provide an overview on the extracerebral systems that might play an important associative role in ASD and review evidence regarding the potential roles of inflammation, trace metals, metabolism, genetic susceptibility, enteric nervous system function and the microbiota of the gastrointestinal (GI) tract on the development of endophenotypes in animal models of ASD. By influencing environmental conditions, it might be possible to reduce or limit the severity of ASD pathology.","lang":"eng"}],"type":"book_chapter","alternative_title":["ADVSANAT"],"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"623","title":"Extracerebral dysfunction in animal models of autism spectrum disorder","status":"public","intvolume":" 224"},{"month":"12","publication_identifier":{"issn":["00405809"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.tpb.2017.06.001","quality_controlled":"1","project":[{"name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"file_date_updated":"2020-07-14T12:47:25Z","ec_funded":1,"publist_id":"7169","date_updated":"2021-01-12T08:06:50Z","date_created":"2018-12-11T11:47:34Z","volume":118,"author":[{"last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"},{"full_name":"Etheridge, Alison","last_name":"Etheridge","first_name":"Alison"},{"full_name":"Véber, Amandine","first_name":"Amandine","last_name":"Véber"}],"publication_status":"published","department":[{"_id":"NiBa"}],"publisher":"Academic Press","year":"2017","day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2017-12-01T00:00:00Z","page":"50 - 73","publication":"Theoretical Population Biology","citation":{"ama":"Barton NH, Etheridge A, Véber A. The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. 2017;118:50-73. doi:10.1016/j.tpb.2017.06.001","apa":"Barton, N. H., Etheridge, A., & Véber, A. (2017). The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2017.06.001","ieee":"N. H. Barton, A. Etheridge, and A. Véber, “The infinitesimal model: Definition derivation and implications,” Theoretical Population Biology, vol. 118. Academic Press, pp. 50–73, 2017.","ista":"Barton NH, Etheridge A, Véber A. 2017. The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. 118, 50–73.","short":"N.H. Barton, A. Etheridge, A. Véber, Theoretical Population Biology 118 (2017) 50–73.","mla":"Barton, Nicholas H., et al. “The Infinitesimal Model: Definition Derivation and Implications.” Theoretical Population Biology, vol. 118, Academic Press, 2017, pp. 50–73, doi:10.1016/j.tpb.2017.06.001.","chicago":"Barton, Nicholas H, Alison Etheridge, and Amandine Véber. “The Infinitesimal Model: Definition Derivation and Implications.” Theoretical Population Biology. Academic Press, 2017. https://doi.org/10.1016/j.tpb.2017.06.001."},"abstract":[{"text":"Our focus here is on the infinitesimal model. In this model, one or several quantitative traits are described as the sum of a genetic and a non-genetic component, the first being distributed within families as a normal random variable centred at the average of the parental genetic components, and with a variance independent of the parental traits. Thus, the variance that segregates within families is not perturbed by selection, and can be predicted from the variance components. This does not necessarily imply that the trait distribution across the whole population should be Gaussian, and indeed selection or population structure may have a substantial effect on the overall trait distribution. One of our main aims is to identify some general conditions on the allelic effects for the infinitesimal model to be accurate. We first review the long history of the infinitesimal model in quantitative genetics. Then we formulate the model at the phenotypic level in terms of individual trait values and relationships between individuals, but including different evolutionary processes: genetic drift, recombination, selection, mutation, population structure, …. We give a range of examples of its application to evolutionary questions related to stabilising selection, assortative mating, effective population size and response to selection, habitat preference and speciation. We provide a mathematical justification of the model as the limit as the number M of underlying loci tends to infinity of a model with Mendelian inheritance, mutation and environmental noise, when the genetic component of the trait is purely additive. We also show how the model generalises to include epistatic effects. We prove in particular that, within each family, the genetic components of the individual trait values in the current generation are indeed normally distributed with a variance independent of ancestral traits, up to an error of order 1∕M. Simulations suggest that in some cases the convergence may be as fast as 1∕M.","lang":"eng"}],"type":"journal_article","file":[{"file_size":1133924,"content_type":"application/pdf","creator":"system","file_name":"IST-2017-908-v1+1_1-s2.0-S0040580917300886-main_1_.pdf","access_level":"open_access","date_created":"2018-12-12T10:12:45Z","date_updated":"2020-07-14T12:47:25Z","checksum":"7dd02bfcfe8f244f4a6c19091aedf2c8","relation":"main_file","file_id":"4964"}],"oa_version":"Published Version","pubrep_id":"908","ddc":["576"],"title":"The infinitesimal model: Definition derivation and implications","status":"public","intvolume":" 118","_id":"626","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"oa":1,"quality_controlled":"1","project":[{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"doi":"10.1007/978-3-319-63121-9_18","language":[{"iso":"eng"}],"month":"07","publication_identifier":{"issn":["0302-9743"],"isbn":["978-3-319-63120-2"]},"year":"2017","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 and S11407-N23 (RiSE/SHiNE), and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003.","publication_status":"published","publisher":"Springer","editor":[{"first_name":"Luca","last_name":"Aceto","full_name":"Aceto, Luca"},{"first_name":"Giorgio","last_name":"Bacci","full_name":"Bacci, Giorgio"},{"full_name":"Ingólfsdóttir, Anna","last_name":"Ingólfsdóttir","first_name":"Anna"},{"first_name":"Axel","last_name":"Legay","full_name":"Legay, Axel"},{"full_name":"Mardare, Radu","last_name":"Mardare","first_name":"Radu"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"date_created":"2018-12-11T11:47:34Z","date_updated":"2022-05-23T08:54:02Z","volume":10460,"file_date_updated":"2020-07-14T12:47:25Z","ec_funded":1,"publist_id":"7170","publication":"Models, Algorithms, Logics and Tools","citation":{"ista":"Chatterjee K, Doyen L, Henzinger TA. 2017.The cost of exactness in quantitative reachability. In: Models, Algorithms, Logics and Tools. LNCS, vol. 10460, 367–381.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in Models, Algorithms, Logics and Tools, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.","apa":"Chatterjee, K., Doyen, L., & Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, & R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer. https://doi.org/10.1007/978-3-319-63121-9_18","ama":"Chatterjee K, Doyen L, Henzinger TA. The cost of exactness in quantitative reachability. In: Aceto L, Bacci G, Ingólfsdóttir A, Legay A, Mardare R, eds. Models, Algorithms, Logics and Tools. Vol 10460. Theoretical Computer Science and General Issues. Springer; 2017:367-381. doi:10.1007/978-3-319-63121-9_18","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.” In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017. https://doi.org/10.1007/978-3-319-63121-9_18.","mla":"Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.” Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381."},"page":"367 - 381","date_published":"2017-07-25T00:00:00Z","scopus_import":"1","series_title":"Theoretical Computer Science and General Issues","day":"25","has_accepted_license":"1","article_processing_charge":"No","_id":"625","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"title":"The cost of exactness in quantitative reachability","status":"public","intvolume":" 10460","oa_version":"Submitted Version","file":[{"creator":"dernst","content_type":"application/pdf","file_size":192826,"access_level":"open_access","file_name":"2017_ModelsAlgorithms_Chatterjee.pdf","checksum":"b2402766ec02c79801aac634bd8f9f6c","date_updated":"2020-07-14T12:47:25Z","date_created":"2019-11-19T08:06:50Z","file_id":"7048","relation":"main_file"}],"type":"book_chapter","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"In the analysis of reactive systems a quantitative objective assigns a real value to every trace of the system. The value decision problem for a quantitative objective requires a trace whose value is at least a given threshold, and the exact value decision problem requires a trace whose value is exactly the threshold. We compare the computational complexity of the value and exact value decision problems for classical quantitative objectives, such as sum, discounted sum, energy, and mean-payoff for two standard models of reactive systems, namely, graphs and graph games."}]},{"article_number":"3830","publist_id":"7172","file_date_updated":"2020-07-14T12:47:24Z","acknowledgement":"Austrian Science Fund (FWF): M1697, P22249; Swiss National Science Foundation (SNF): 145706; European Commission;FWF Special Research Program: RNA-REG F43","year":"2017","publisher":"PeerJ","department":[{"_id":"CaGu"}],"publication_status":"published","author":[{"id":"42D9CABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9068-6090","first_name":"Nela","last_name":"Nikolic","full_name":"Nikolic, Nela"},{"full_name":"Didara, Zrinka","last_name":"Didara","first_name":"Zrinka"},{"full_name":"Moll, Isabella","last_name":"Moll","first_name":"Isabella"}],"volume":2017,"date_updated":"2021-01-12T08:06:48Z","date_created":"2018-12-11T11:47:33Z","publication_identifier":{"issn":["21678359"]},"month":"09","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","doi":"10.7717/peerj.3830","language":[{"iso":"eng"}],"type":"journal_article","issue":"9","abstract":[{"lang":"eng","text":"Bacteria adapt to adverse environmental conditions by altering gene expression patterns. Recently, a novel stress adaptation mechanism has been described that allows Escherichia coli to alter gene expression at the post-transcriptional level. The key player in this regulatory pathway is the endoribonuclease MazF, the toxin component of the toxin-antitoxin module mazEF that is triggered by various stressful conditions. In general, MazF degrades the majority of transcripts by cleaving at ACA sites, which results in the retardation of bacterial growth. Furthermore, MazF can process a small subset of mRNAs and render them leaderless by removing their ribosome binding site. MazF concomitantly modifies ribosomes, making them selective for the translation of leaderless mRNAs. In this study, we employed fluorescent reporter-systems to investigate mazEF expression during stressful conditions, and to infer consequences of the mRNA processing mediated by MazF on gene expression at the single-cell level. Our results suggest that mazEF transcription is maintained at low levels in single cells encountering adverse conditions, such as antibiotic stress or amino acid starvation. Moreover, using the grcA mRNA as a model for MazF-mediated mRNA processing, we found that MazF activation promotes heterogeneity in the grcA reporter expression, resulting in a subpopulation of cells with increased levels of GrcA reporter protein."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"624","intvolume":" 2017","ddc":["579"],"title":"MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations","status":"public","pubrep_id":"909","oa_version":"Published Version","file":[{"file_id":"4908","relation":"main_file","date_created":"2018-12-12T10:11:51Z","date_updated":"2020-07-14T12:47:24Z","checksum":"3d79ae6b6eabc90b0eaaed82ff3493b0","file_name":"IST-2017-909-v1+1_peerj-3830.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":682064}],"scopus_import":1,"has_accepted_license":"1","day":"21","citation":{"ista":"Nikolic N, Didara Z, Moll I. 2017. MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. 2017(9), 3830.","ieee":"N. Nikolic, Z. Didara, and I. Moll, “MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations,” PeerJ, vol. 2017, no. 9. PeerJ, 2017.","apa":"Nikolic, N., Didara, Z., & Moll, I. (2017). MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. PeerJ. https://doi.org/10.7717/peerj.3830","ama":"Nikolic N, Didara Z, Moll I. MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. 2017;2017(9). doi:10.7717/peerj.3830","chicago":"Nikolic, Nela, Zrinka Didara, and Isabella Moll. “MazF Activation Promotes Translational Heterogeneity of the GrcA MRNA in Escherichia Coli Populations.” PeerJ. PeerJ, 2017. https://doi.org/10.7717/peerj.3830.","mla":"Nikolic, Nela, et al. “MazF Activation Promotes Translational Heterogeneity of the GrcA MRNA in Escherichia Coli Populations.” PeerJ, vol. 2017, no. 9, 3830, PeerJ, 2017, doi:10.7717/peerj.3830.","short":"N. Nikolic, Z. Didara, I. Moll, PeerJ 2017 (2017)."},"publication":"PeerJ","date_published":"2017-09-21T00:00:00Z"}]