[{"page":"293-341","day":"01","type":"book_chapter","article_processing_charge":"No","OA_type":"green","publisher":"Springer Berlin Heidelberg","extern":"1","publication":"The First Galaxies","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1203.6075"}],"status":"public","abstract":[{"lang":"eng","text":"Supermassive black holes (SMBHs) are common in local galactic nuclei, and SMBHs as massive as several billion solar masses already exist at redshift z = 6. These earliest SMBHs may grow by the combination of radiation-pressure-limited accretion and mergers of stellar-mass seed BHs, left behind by the first generation of metal-free stars, or may be formed by more rapid direct collapse of gas in rare special environments where dense gas can accumulate without first fragmenting into stars. This chapter offers a review of these two competing scenarios, as well as some more exotic alternative ideas. It also briefly discusses how the different models may be distinguished in the future by observations with JWST, LISA and other instruments."}],"_id":"18737","publication_status":"published","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The Formation of the First Massive Black Holes","citation":{"ieee":"Z. Haiman, “The Formation of the First Massive Black Holes,” in <i>The First Galaxies</i>, T. Wiklind, B. Mobasher, and V. Brumm, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 293–341.","short":"Z. Haiman, in:, T. Wiklind, B. Mobasher, V. Brumm (Eds.), The First Galaxies, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 293–341.","mla":"Haiman, Zoltán. “The Formation of the First Massive Black Holes.” <i>The First Galaxies</i>, edited by Tommy Wiklind et al., Springer Berlin Heidelberg, 2012, pp. 293–341, doi:<a href=\"https://doi.org/10.1007/978-3-642-32362-1_6\">10.1007/978-3-642-32362-1_6</a>.","chicago":"Haiman, Zoltán. “The Formation of the First Massive Black Holes.” In <i>The First Galaxies</i>, edited by Tommy Wiklind, Bahram Mobasher, and Volker Brumm, 293–341. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32362-1_6\">https://doi.org/10.1007/978-3-642-32362-1_6</a>.","apa":"Haiman, Z. (2012). The Formation of the First Massive Black Holes. In T. Wiklind, B. Mobasher, &#38; V. Brumm (Eds.), <i>The First Galaxies</i> (pp. 293–341). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-32362-1_6\">https://doi.org/10.1007/978-3-642-32362-1_6</a>","ista":"Haiman Z. 2012.The Formation of the First Massive Black Holes. In: The First Galaxies. Astrophysics and Space Science Library, , 293–341.","ama":"Haiman Z. The Formation of the First Massive Black Holes. In: Wiklind T, Mobasher B, Brumm V, eds. <i>The First Galaxies</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:293-341. doi:<a href=\"https://doi.org/10.1007/978-3-642-32362-1_6\">10.1007/978-3-642-32362-1_6</a>"},"oa":1,"quality_controlled":"1","year":"2012","date_created":"2025-01-03T12:30:53Z","oa_version":"Preprint","scopus_import":"1","month":"01","external_id":{"arxiv":["1203.6075"]},"language":[{"iso":"eng"}],"date_updated":"2025-01-07T13:01:05Z","OA_place":"repository","author":[{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán","last_name":"Haiman","orcid":"0000-0003-3633-5403","first_name":"Zoltán"}],"place":"Berlin, Heidelberg","alternative_title":["Astrophysics and Space Science Library"],"date_published":"2012-01-01T00:00:00Z","editor":[{"first_name":"Tommy","full_name":"Wiklind, Tommy","last_name":"Wiklind"},{"full_name":"Mobasher, Bahram","last_name":"Mobasher","first_name":"Bahram"},{"last_name":"Brumm","full_name":"Brumm, Volker","first_name":"Volker"}],"publication_identifier":{"issn":["0067-0057"],"eisbn":["9783642323621"],"eissn":["2214-7985"],"isbn":["9783642323614"]},"doi":"10.1007/978-3-642-32362-1_6"},{"article_number":"W03509","publication_identifier":{"issn":["0043-1397"]},"doi":"10.1029/2011wr010559","scopus_import":"1","oa_version":"Published Version","month":"03","language":[{"iso":"eng"}],"date_updated":"2023-02-21T09:38:36Z","author":[{"full_name":"Ragettli, S.","last_name":"Ragettli","first_name":"S."},{"last_name":"Pellicciotti","full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca"}],"date_published":"2012-03-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Calibration of a physically based, spatially distributed hydrological model in a glacierized basin: On the use of knowledge from glaciometeorological processes to constrain model parameters","citation":{"apa":"Ragettli, S., &#38; Pellicciotti, F. (2012). Calibration of a physically based, spatially distributed hydrological model in a glacierized basin: On the use of knowledge from glaciometeorological processes to constrain model parameters. <i>Water Resources Research</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2011wr010559\">https://doi.org/10.1029/2011wr010559</a>","chicago":"Ragettli, S., and Francesca Pellicciotti. “Calibration of a Physically Based, Spatially Distributed Hydrological Model in a Glacierized Basin: On the Use of Knowledge from Glaciometeorological Processes to Constrain Model Parameters.” <i>Water Resources Research</i>. American Geophysical Union, 2012. <a href=\"https://doi.org/10.1029/2011wr010559\">https://doi.org/10.1029/2011wr010559</a>.","ama":"Ragettli S, Pellicciotti F. Calibration of a physically based, spatially distributed hydrological model in a glacierized basin: On the use of knowledge from glaciometeorological processes to constrain model parameters. <i>Water Resources Research</i>. 2012;48(3). doi:<a href=\"https://doi.org/10.1029/2011wr010559\">10.1029/2011wr010559</a>","ista":"Ragettli S, Pellicciotti F. 2012. Calibration of a physically based, spatially distributed hydrological model in a glacierized basin: On the use of knowledge from glaciometeorological processes to constrain model parameters. Water Resources Research. 48(3), W03509.","short":"S. Ragettli, F. Pellicciotti, Water Resources Research 48 (2012).","mla":"Ragettli, S., and Francesca Pellicciotti. “Calibration of a Physically Based, Spatially Distributed Hydrological Model in a Glacierized Basin: On the Use of Knowledge from Glaciometeorological Processes to Constrain Model Parameters.” <i>Water Resources Research</i>, vol. 48, no. 3, W03509, American Geophysical Union, 2012, doi:<a href=\"https://doi.org/10.1029/2011wr010559\">10.1029/2011wr010559</a>.","ieee":"S. Ragettli and F. Pellicciotti, “Calibration of a physically based, spatially distributed hydrological model in a glacierized basin: On the use of knowledge from glaciometeorological processes to constrain model parameters,” <i>Water Resources Research</i>, vol. 48, no. 3. American Geophysical Union, 2012."},"oa":1,"article_type":"original","quality_controlled":"1","year":"2012","date_created":"2023-02-20T08:17:39Z","day":"01","volume":48,"type":"journal_article","article_processing_charge":"No","publisher":"American Geophysical Union","issue":"3","extern":"1","publication":"Water Resources Research","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2011WR010559"}],"status":"public","_id":"12644","intvolume":"        48","abstract":[{"text":"In the Dry Andes of central Chile, summer water resources originate mostly from snowmelt and ice melt. We use the physically based, spatially distributed hydrological model TOPKAPI to study the exchange between glaciers and climate in the upper Aconcagua River Basin during the summer season and identify the model parameters that are robust and transferable and those that are more dependent on calibration. TOPKAPI has recently been adapted to incorporate an enhanced temperature index approach for snow and ice melting. We suggest a calibration procedure that allows calibration of parameters in three steps by separating parameters governing distinct processes. We evaluate the parameters' transferability in time and in space by applying the model at two spatial scales. TOPKAPI's ability to simulate the relevant processes is tested against meteorological, ablation, and glacier runoff data measured on Juncal Norte Glacier during two glacier ablation seasons. The model was applied successfully to the climatic setting of the Dry Andes once its parameters were recalibrated. We found a clear distinction between parameters that are stable in time and those that need recalibration. The parameters of the melt model are transferable from one season to the other, while the parameters governing the extrapolation of meteorological input data and the routing of glacier meltwater need recalibration from one season to the other. Sensitivity analysis revealed that the model is most sensitive to the temperature lapse rate governing the extrapolation of air temperature from point measurements to the glacier scale and to the melt parameter that multiplies the shortwave radiation balance.","lang":"eng"}],"publication_status":"published"},{"date_updated":"2024-10-14T12:01:31Z","author":[{"first_name":"Francesca","orcid":"0000-0002-5554-8087","full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70"},{"last_name":"Buergi","full_name":"Buergi, Cyrill","first_name":"Cyrill"},{"full_name":"Immerzeel, Walter Willem","last_name":"Immerzeel","first_name":"Walter Willem"},{"full_name":"Konz, Markus","last_name":"Konz","first_name":"Markus"},{"full_name":"Shrestha, Arun B.","last_name":"Shrestha","first_name":"Arun B."}],"date_published":"2012-02-01T00:00:00Z","scopus_import":"1","oa_version":"Published Version","month":"02","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1994-7151"],"issn":["0276-4741"]},"doi":"10.1659/mrd-journal-d-11-00092.1","main_file_link":[{"url":"https://doi.org/10.1659/MRD-JOURNAL-D-11-00092.1","open_access":"1"}],"status":"public","_id":"12646","abstract":[{"text":"Assessment of water resources from remote mountainous catchments plays a crucial role for the development of rural areas in or in the vicinity of mountain ranges. The scarcity of data, however, prevents the application of standard approaches that are based on data-driven models. The Hindu Kush–Karakoram–Himalaya mountain range is a crucial area in terms of water resources, but our understanding of the response of its high-elevation catchments to a changing climate is hindered by lack of hydro-meteorological and cryospheric data. Hydrological modeling is challenging here because internal inconsistencies—such as an underestimation of precipitation input that can be compensated for by an overestimation of meltwater—might be hidden due to the complexity of feedback mechanisms that govern melt and runoff generation in such basins. Data scarcity adds to this difficulty by preventing the application of systematic calibration procedures that would allow identification of the parameter set that could guarantee internal consistency in the simulation of the single hydrological components. In this work, we use simulations from the Hunza River Basin in the Karakoram region obtained with the hydrological model TOPKAPI to quantify the predictive power of discharge and snow-cover data sets, as well as the combination of both. We also show that short-term measurements of meteorological variables such as radiative fluxes, wind speed, relative humidity, and air temperature from glacio-meteorological experiments are crucial for a correct parameterization of surface melt processes. They enable detailed simulations of the energy fluxes governing glacier–atmosphere interaction and the resulting ablation through energy-balance modeling. These simulations are used to derive calibrated parameters for the simplified snow and glacier routines in TOPKAPI. We demonstrate that such parameters are stable in space and time in similar climatic regions, thus reducing the number of parameters requiring calibration.","lang":"eng"}],"intvolume":"        32","publication_status":"published","day":"01","page":"39-50","volume":32,"type":"journal_article","article_processing_charge":"No","publisher":"International Mountain Society","publication":"Mountain Research and Development","issue":"1","extern":"1","citation":{"ama":"Pellicciotti F, Buergi C, Immerzeel WW, Konz M, Shrestha AB. Challenges and uncertainties in hydrological modeling of remote Hindu Kush–Karakoram–Himalayan (HKH) basins: Suggestions for calibration strategies. <i>Mountain Research and Development</i>. 2012;32(1):39-50. doi:<a href=\"https://doi.org/10.1659/mrd-journal-d-11-00092.1\">10.1659/mrd-journal-d-11-00092.1</a>","ista":"Pellicciotti F, Buergi C, Immerzeel WW, Konz M, Shrestha AB. 2012. Challenges and uncertainties in hydrological modeling of remote Hindu Kush–Karakoram–Himalayan (HKH) basins: Suggestions for calibration strategies. Mountain Research and Development. 32(1), 39–50.","apa":"Pellicciotti, F., Buergi, C., Immerzeel, W. W., Konz, M., &#38; Shrestha, A. B. (2012). Challenges and uncertainties in hydrological modeling of remote Hindu Kush–Karakoram–Himalayan (HKH) basins: Suggestions for calibration strategies. <i>Mountain Research and Development</i>. International Mountain Society. <a href=\"https://doi.org/10.1659/mrd-journal-d-11-00092.1\">https://doi.org/10.1659/mrd-journal-d-11-00092.1</a>","chicago":"Pellicciotti, Francesca, Cyrill Buergi, Walter Willem Immerzeel, Markus Konz, and Arun B. Shrestha. “Challenges and Uncertainties in Hydrological Modeling of Remote Hindu Kush–Karakoram–Himalayan (HKH) Basins: Suggestions for Calibration Strategies.” <i>Mountain Research and Development</i>. International Mountain Society, 2012. <a href=\"https://doi.org/10.1659/mrd-journal-d-11-00092.1\">https://doi.org/10.1659/mrd-journal-d-11-00092.1</a>.","ieee":"F. Pellicciotti, C. Buergi, W. W. Immerzeel, M. Konz, and A. B. Shrestha, “Challenges and uncertainties in hydrological modeling of remote Hindu Kush–Karakoram–Himalayan (HKH) basins: Suggestions for calibration strategies,” <i>Mountain Research and Development</i>, vol. 32, no. 1. International Mountain Society, pp. 39–50, 2012.","mla":"Pellicciotti, Francesca, et al. “Challenges and Uncertainties in Hydrological Modeling of Remote Hindu Kush–Karakoram–Himalayan (HKH) Basins: Suggestions for Calibration Strategies.” <i>Mountain Research and Development</i>, vol. 32, no. 1, International Mountain Society, 2012, pp. 39–50, doi:<a href=\"https://doi.org/10.1659/mrd-journal-d-11-00092.1\">10.1659/mrd-journal-d-11-00092.1</a>.","short":"F. Pellicciotti, C. Buergi, W.W. Immerzeel, M. Konz, A.B. Shrestha, Mountain Research and Development 32 (2012) 39–50."},"oa":1,"article_type":"original","quality_controlled":"1","year":"2012","date_created":"2023-02-20T08:17:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Challenges and uncertainties in hydrological modeling of remote Hindu Kush–Karakoram–Himalayan (HKH) basins: Suggestions for calibration strategies"},{"author":[{"last_name":"Immerzeel","full_name":"Immerzeel, Walter Willem","first_name":"Walter Willem"},{"first_name":"Francesca","full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70"},{"first_name":"Arun B.","last_name":"Shrestha","full_name":"Shrestha, Arun B."}],"date_published":"2012-02-01T00:00:00Z","date_updated":"2023-02-21T08:56:29Z","language":[{"iso":"eng"}],"oa_version":"Published Version","scopus_import":"1","month":"02","doi":"10.1659/mrd-journal-d-11-00097.1","publication_identifier":{"eissn":["1994-7151"],"issn":["0276-4741"]},"publication_status":"published","main_file_link":[{"url":"https://doi.org/10.1659/MRD-JOURNAL-D-11-00097.1","open_access":"1"}],"abstract":[{"lang":"eng","text":"Accurate quantification of the spatial distribution of precipitation in mountain regions is crucial for assessments of water resources and for the understanding of high-altitude hydrology, yet it is one of the largest unknowns due to the lack of high-altitude observations. The Hunza basin in Pakistan contains very large glacier systems, which, given the melt, cannot persist unless precipitation (snow input) is much higher than what is observed at the meteorological stations, mostly located in mountain valleys. Several studies, therefore, suggest strong positive vertical precipitation lapse rates; in the present study, we quantify this lapse rate by using glaciers as a proxy. We assume a neutral mass balance for the glaciers for the period from 2001 to 2003, and we inversely model the precipitation lapse by balancing the total accumulation in the catchment area and the ablation over the glacier area for the 50 largest glacier systems in the Hunza basin in the Karakoram. Our results reveal a vertical precipitation lapse rate that equals 0.21 ± 0.12% m−1, with a maximum precipitation at an elevation of 5500 masl. We showed that the total annual basin precipitation (828 mm) is 260% higher than what is estimated based on interpolated observations (319 mm); this has major consequences for hydrological modeling and water resource assessments in general. Our results were validated by using previously published studies on individual glaciers as well as the water balance of the Hunza basin. The approach is more widely applicable in mountain ranges where precipitation measurements at high altitude are lacking."}],"_id":"12647","intvolume":"        32","status":"public","article_processing_charge":"No","issue":"1","extern":"1","publication":"Mountain Research and Development","publisher":"International Mountain Society","volume":32,"keyword":["General Environmental Science","Development","Environmental Chemistry"],"day":"01","page":"30-38","type":"journal_article","quality_controlled":"1","article_type":"original","date_created":"2023-02-20T08:17:52Z","year":"2012","citation":{"ama":"Immerzeel WW, Pellicciotti F, Shrestha AB. Glaciers as a proxy to quantify the spatial distribution of precipitation in the Hunza basin. <i>Mountain Research and Development</i>. 2012;32(1):30-38. doi:<a href=\"https://doi.org/10.1659/mrd-journal-d-11-00097.1\">10.1659/mrd-journal-d-11-00097.1</a>","ista":"Immerzeel WW, Pellicciotti F, Shrestha AB. 2012. Glaciers as a proxy to quantify the spatial distribution of precipitation in the Hunza basin. Mountain Research and Development. 32(1), 30–38.","apa":"Immerzeel, W. W., Pellicciotti, F., &#38; Shrestha, A. B. (2012). Glaciers as a proxy to quantify the spatial distribution of precipitation in the Hunza basin. <i>Mountain Research and Development</i>. International Mountain Society. <a href=\"https://doi.org/10.1659/mrd-journal-d-11-00097.1\">https://doi.org/10.1659/mrd-journal-d-11-00097.1</a>","chicago":"Immerzeel, Walter Willem, Francesca Pellicciotti, and Arun B. Shrestha. “Glaciers as a Proxy to Quantify the Spatial Distribution of Precipitation in the Hunza Basin.” <i>Mountain Research and Development</i>. International Mountain Society, 2012. <a href=\"https://doi.org/10.1659/mrd-journal-d-11-00097.1\">https://doi.org/10.1659/mrd-journal-d-11-00097.1</a>.","short":"W.W. Immerzeel, F. Pellicciotti, A.B. Shrestha, Mountain Research and Development 32 (2012) 30–38.","mla":"Immerzeel, Walter Willem, et al. “Glaciers as a Proxy to Quantify the Spatial Distribution of Precipitation in the Hunza Basin.” <i>Mountain Research and Development</i>, vol. 32, no. 1, International Mountain Society, 2012, pp. 30–38, doi:<a href=\"https://doi.org/10.1659/mrd-journal-d-11-00097.1\">10.1659/mrd-journal-d-11-00097.1</a>.","ieee":"W. W. Immerzeel, F. Pellicciotti, and A. B. Shrestha, “Glaciers as a proxy to quantify the spatial distribution of precipitation in the Hunza basin,” <i>Mountain Research and Development</i>, vol. 32, no. 1. International Mountain Society, pp. 30–38, 2012."},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Glaciers as a proxy to quantify the spatial distribution of precipitation in the Hunza basin"},{"year":"2012","date_created":"2023-02-20T08:17:57Z","article_type":"original","quality_controlled":"1","oa":1,"citation":{"ista":"Reid TD, Carenzo M, Pellicciotti F, Brock BW. 2012. Including debris cover effects in a distributed model of glacier ablation. Journal of Geophysical Research: Atmospheres. 117(D18), D18105.","ama":"Reid TD, Carenzo M, Pellicciotti F, Brock BW. Including debris cover effects in a distributed model of glacier ablation. <i>Journal of Geophysical Research: Atmospheres</i>. 2012;117(D18). doi:<a href=\"https://doi.org/10.1029/2012jd017795\">10.1029/2012jd017795</a>","chicago":"Reid, T. D., M. Carenzo, Francesca Pellicciotti, and B. W. Brock. “Including Debris Cover Effects in a Distributed Model of Glacier Ablation.” <i>Journal of Geophysical Research: Atmospheres</i>. American Geophysical Union, 2012. <a href=\"https://doi.org/10.1029/2012jd017795\">https://doi.org/10.1029/2012jd017795</a>.","apa":"Reid, T. D., Carenzo, M., Pellicciotti, F., &#38; Brock, B. W. (2012). Including debris cover effects in a distributed model of glacier ablation. <i>Journal of Geophysical Research: Atmospheres</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2012jd017795\">https://doi.org/10.1029/2012jd017795</a>","ieee":"T. D. Reid, M. Carenzo, F. Pellicciotti, and B. W. Brock, “Including debris cover effects in a distributed model of glacier ablation,” <i>Journal of Geophysical Research: Atmospheres</i>, vol. 117, no. D18. American Geophysical Union, 2012.","short":"T.D. Reid, M. Carenzo, F. Pellicciotti, B.W. Brock, Journal of Geophysical Research: Atmospheres 117 (2012).","mla":"Reid, T. D., et al. “Including Debris Cover Effects in a Distributed Model of Glacier Ablation.” <i>Journal of Geophysical Research: Atmospheres</i>, vol. 117, no. D18, D18105, American Geophysical Union, 2012, doi:<a href=\"https://doi.org/10.1029/2012jd017795\">10.1029/2012jd017795</a>."},"title":"Including debris cover effects in a distributed model of glacier ablation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","intvolume":"       117","_id":"12648","abstract":[{"text":"Distributed glacier melt models generally assume that the glacier surface consists of bare exposed ice and snow. In reality, many glaciers are wholly or partially covered in layers of debris that tend to suppress ablation rates. In this paper, an existing physically based point model for the ablation of debris-covered ice is incorporated in a distributed melt model and applied to Haut Glacier d'Arolla, Switzerland, which has three large patches of debris cover on its surface. The model is based on a 10 m resolution digital elevation model (DEM) of the area; each glacier pixel in the DEM is defined as either bare or debris-covered ice, and may be covered in snow that must be melted off before ice ablation is assumed to occur. Each debris-covered pixel is assigned a debris thickness value using probability distributions based on over 1000 manual thickness measurements. Locally observed meteorological data are used to run energy balance calculations in every pixel, using an approach suitable for snow, bare ice or debris-covered ice as appropriate. The use of the debris model significantly reduces the total ablation in the debris-covered areas, however the precise reduction is sensitive to the temperature extrapolation used in the model distribution because air near the debris surface tends to be slightly warmer than over bare ice. Overall results suggest that the debris patches, which cover 10% of the glacierized area, reduce total runoff from the glacierized part of the basin by up to 7%.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1029/2012JD017795","open_access":"1"}],"publisher":"American Geophysical Union","extern":"1","publication":"Journal of Geophysical Research: Atmospheres","issue":"D18","article_processing_charge":"No","type":"journal_article","keyword":["Paleontology","Space and Planetary Science","Earth and Planetary Sciences (miscellaneous)","Atmospheric Science","Earth-Surface Processes","Geochemistry and Petrology","Soil Science","Water Science and Technology","Ecology","Aquatic Science","Forestry","Oceanography","Geophysics"],"day":"27","volume":117,"doi":"10.1029/2012jd017795","publication_identifier":{"issn":["0148-0227"]},"article_number":"D18105","date_published":"2012-09-27T00:00:00Z","author":[{"first_name":"T. D.","last_name":"Reid","full_name":"Reid, T. D."},{"last_name":"Carenzo","full_name":"Carenzo, M.","first_name":"M."},{"id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","last_name":"Pellicciotti","full_name":"Pellicciotti, Francesca","first_name":"Francesca"},{"last_name":"Brock","full_name":"Brock, B. W.","first_name":"B. W."}],"date_updated":"2023-02-20T10:57:31Z","language":[{"iso":"eng"}],"month":"09","oa_version":"Published Version","scopus_import":"1"},{"ddc":["570"],"date_published":"2012-06-08T00:00:00Z","author":[{"last_name":"Lohse","full_name":"Lohse, Konrad","first_name":"Konrad"},{"last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240"},{"last_name":"Stone","full_name":"Stone, Graham","first_name":"Graham"},{"first_name":"George","full_name":"Melika, George","last_name":"Melika"}],"status":"public","date_updated":"2025-09-30T08:04:02Z","_id":"13075","abstract":[{"text":"Little is known about the stability of trophic relationships in complex natural communities over evolutionary timescales. Here, we use sequence data from 18 nuclear loci to reconstruct and compare the intraspecific histories of major Pleistocene refugial populations in the Middle East, the Balkans and Iberia in a guild of four Chalcid parasitoids (Cecidostiba fungosa, C. semifascia, Hobbya stenonota and Mesopolobus amaenus) all attacking Cynipid oak galls. We develop a likelihood method to numerically estimate models of divergence between three populations from multilocus data. We investigate the power of this framework on simulated data, and - using triplet alignments of intronic loci - quantify the support for all possible divergence relationships between refugial populations in the four parasitoids. Although an East to West order of population divergence has highest support in all but one species, we cannot rule out alternative population tree topologies. Comparing the estimated times of population splits between species, we find that one species, M. amaenus, has a significantly older history than the rest of the guild and must have arrived in central Europe at least one glacial cycle prior to other guild members. This suggests that although all four species may share a common origin in the East, they expanded westwards into Europe at different times.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.0g0fs"}],"publisher":"Dryad","article_processing_charge":"No","type":"research_data_reference","month":"06","day":"08","oa_version":"Published Version","year":"2012","doi":"10.5061/DRYAD.0G0FS","date_created":"2023-05-23T17:01:02Z","oa":1,"citation":{"ama":"Lohse K, Barton NH, Stone G, Melika G. Data from: A likelihood-based comparison of population histories in a parasitoid guild. 2012. doi:<a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>","ista":"Lohse K, Barton NH, Stone G, Melika G. 2012. Data from: A likelihood-based comparison of population histories in a parasitoid guild, Dryad, <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>.","apa":"Lohse, K., Barton, N. H., Stone, G., &#38; Melika, G. (2012). Data from: A likelihood-based comparison of population histories in a parasitoid guild. Dryad. <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">https://doi.org/10.5061/DRYAD.0G0FS</a>","chicago":"Lohse, Konrad, Nicholas H Barton, Graham Stone, and George Melika. “Data from: A Likelihood-Based Comparison of Population Histories in a Parasitoid Guild.” Dryad, 2012. <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">https://doi.org/10.5061/DRYAD.0G0FS</a>.","ieee":"K. Lohse, N. H. Barton, G. Stone, and G. Melika, “Data from: A likelihood-based comparison of population histories in a parasitoid guild.” Dryad, 2012.","mla":"Lohse, Konrad, et al. <i>Data from: A Likelihood-Based Comparison of Population Histories in a Parasitoid Guild</i>. Dryad, 2012, doi:<a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>.","short":"K. Lohse, N.H. Barton, G. Stone, G. Melika, (2012)."},"title":"Data from: A likelihood-based comparison of population histories in a parasitoid guild","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"2968"}]},"tmp":{"short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"department":[{"_id":"NiBa"}]},{"volume":109,"page":"15283 - 15288","day":"18","month":"09","type":"journal_article","extern":1,"issue":"38","publication":"PNAS","publisher":"National Academy of Sciences","abstract":[{"lang":"eng","text":"In the living cell, proteins are able to organize space much larger than their dimensions. In return, changes of intracellular space can influence biochemical reactions, allowing cells to sense their size and shape. Despite the possibility to reconstitute protein self-organization with only a few purified components, we still lack knowledge of how geometrical boundaries affect spatiotemporal protein patterns. Following a minimal systems approach, we used purified proteins and photolithographically patterned membranes to study the influence of spatial confinement on the self-organization of the Min system, a spatial regulator of bacterial cytokinesis, in vitro. We found that the emerging protein pattern responds even to the lateral, two-dimensional geometry of the membrane such that, as in the three-dimensional cell, Min protein waves travel along the longest axis of the membrane patch. This shows that for spatial sensing the Min system does not need to be enclosed in a three-dimensional compartment. Using a computational model we quantitatively analyzed our experimental findings and identified persistent binding of MinE to the membrane as requirement for the Min system to sense geometry. Our results give insight into the interplay between geometrical confinement and biochemical patterns emerging from a nonlinear reaction-diffusion system.\n"}],"_id":"1987","intvolume":"       109","date_updated":"2021-01-12T06:54:31Z","status":"public","publication_status":"published","author":[{"first_name":"Jakob","full_name":"Schweizer, Jakob","last_name":"Schweizer"},{"full_name":"Martin Loose","last_name":"Loose","id":"462D4284-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","orcid":"0000-0001-7309-9724"},{"first_name":"Mike","full_name":"Bonny, Mike ","last_name":"Bonny"},{"first_name":"Karsten","last_name":"Kruse","full_name":"Kruse, Karsten"},{"first_name":"Ingolf","full_name":"Mönch, Ingolf","last_name":"Mönch"},{"full_name":"Schwille, Petra ","last_name":"Schwille","first_name":"Petra"}],"date_published":"2012-09-18T00:00:00Z","title":"Geometry sensing by self-organized protein patterns","publist_id":"5096","citation":{"apa":"Schweizer, J., Loose, M., Bonny, M., Kruse, K., Mönch, I., &#38; Schwille, P. (2012). Geometry sensing by self-organized protein patterns. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1206953109\">https://doi.org/10.1073/pnas.1206953109</a>","chicago":"Schweizer, Jakob, Martin Loose, Mike Bonny, Karsten Kruse, Ingolf Mönch, and Petra Schwille. “Geometry Sensing by Self-Organized Protein Patterns.” <i>PNAS</i>. National Academy of Sciences, 2012. <a href=\"https://doi.org/10.1073/pnas.1206953109\">https://doi.org/10.1073/pnas.1206953109</a>.","ama":"Schweizer J, Loose M, Bonny M, Kruse K, Mönch I, Schwille P. Geometry sensing by self-organized protein patterns. <i>PNAS</i>. 2012;109(38):15283-15288. doi:<a href=\"https://doi.org/10.1073/pnas.1206953109\">10.1073/pnas.1206953109</a>","ista":"Schweizer J, Loose M, Bonny M, Kruse K, Mönch I, Schwille P. 2012. Geometry sensing by self-organized protein patterns. PNAS. 109(38), 15283–15288.","short":"J. Schweizer, M. Loose, M. Bonny, K. Kruse, I. Mönch, P. Schwille, PNAS 109 (2012) 15283–15288.","ieee":"J. Schweizer, M. Loose, M. Bonny, K. Kruse, I. Mönch, and P. Schwille, “Geometry sensing by self-organized protein patterns,” <i>PNAS</i>, vol. 109, no. 38. National Academy of Sciences, pp. 15283–15288, 2012.","mla":"Schweizer, Jakob, et al. “Geometry Sensing by Self-Organized Protein Patterns.” <i>PNAS</i>, vol. 109, no. 38, National Academy of Sciences, 2012, pp. 15283–88, doi:<a href=\"https://doi.org/10.1073/pnas.1206953109\">10.1073/pnas.1206953109</a>."},"acknowledgement":"This work was supported by the Max-Planck-Society (P.S. and M.L.) and by the German Research Foundation as part of the Research Training Group “Nano- and Biotechnologies for Electronic Device Packaging” (GRK 1401) (J.S.) and by the Leibniz-Award (P.S.). ","quality_controlled":0,"date_created":"2018-12-11T11:55:04Z","doi":"10.1073/pnas.1206953109","year":"2012"},{"publication_status":"published","_id":"2048","abstract":[{"lang":"eng","text":"Leakage resilient cryptography attempts to incorporate side-channel leakage into the black-box security model and designs cryptographic schemes that are provably secure within it. Informally, a scheme is leakage-resilient if it remains secure even if an adversary learns a bounded amount of arbitrary information about the schemes internal state. Unfortunately, most leakage resilient schemes are unnecessarily complicated in order to achieve strong provable security guarantees. As advocated by Yu et al. [CCS’10], this mostly is an artefact of the security proof and in practice much simpler construction may already suffice to protect against realistic side-channel attacks. In this paper, we show that indeed for simpler constructions leakage-resilience can be obtained when we aim for relaxed security notions where the leakage-functions and/or the inputs to the primitive are chosen non-adaptively. For example, we show that a three round Feistel network instantiated with a leakage resilient PRF yields a leakage resilient PRP if the inputs are chosen non-adaptively (This complements the result of Dodis and Pietrzak [CRYPTO’10] who show that if a adaptive queries are allowed, a superlogarithmic number of rounds is necessary.) We also show that a minor variation of the classical GGM construction gives a leakage resilient PRF if both, the leakage-function and the inputs, are chosen non-adaptively."}],"intvolume":"      7428","status":"public","main_file_link":[{"open_access":"1","url":"http://www.iacr.org/archive/ches2012/74280211/74280211.pdf"}],"publication":" Conference proceedings CHES 2012","publisher":"Springer","type":"conference","volume":7428,"page":"213 - 232","day":"01","date_created":"2018-12-11T11:55:25Z","year":"2012","quality_controlled":"1","oa":1,"citation":{"chicago":"Faust, Sebastian, Krzysztof Z Pietrzak, and Joachim Schipper. “Practical Leakage-Resilient Symmetric Cryptography.” In <i> Conference Proceedings CHES 2012</i>, 7428:213–32. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>.","apa":"Faust, S., Pietrzak, K. Z., &#38; Schipper, J. (2012). Practical leakage-resilient symmetric cryptography. In <i> Conference proceedings CHES 2012</i> (Vol. 7428, pp. 213–232). Leuven, Belgium: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>","ista":"Faust S, Pietrzak KZ, Schipper J. 2012. Practical leakage-resilient symmetric cryptography.  Conference proceedings CHES 2012. CHES: Cryptographic Hardware and Embedded Systems, LNCS, vol. 7428, 213–232.","ama":"Faust S, Pietrzak KZ, Schipper J. Practical leakage-resilient symmetric cryptography. In: <i> Conference Proceedings CHES 2012</i>. Vol 7428. Springer; 2012:213-232. doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>","ieee":"S. Faust, K. Z. Pietrzak, and J. Schipper, “Practical leakage-resilient symmetric cryptography,” in <i> Conference proceedings CHES 2012</i>, Leuven, Belgium, 2012, vol. 7428, pp. 213–232.","mla":"Faust, Sebastian, et al. “Practical Leakage-Resilient Symmetric Cryptography.” <i> Conference Proceedings CHES 2012</i>, vol. 7428, Springer, 2012, pp. 213–32, doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>.","short":"S. Faust, K.Z. Pietrzak, J. Schipper, in:,  Conference Proceedings CHES 2012, Springer, 2012, pp. 213–232."},"publist_id":"5003","title":"Practical leakage-resilient symmetric cryptography","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2012-09-01T00:00:00Z","alternative_title":["LNCS"],"author":[{"last_name":"Faust","full_name":"Faust, Sebastian","first_name":"Sebastian"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"},{"first_name":"Joachim","id":"7BE863D4-E9CF-11E9-9EDB-90527418172C","full_name":"Schipper, Joachim","last_name":"Schipper"}],"date_updated":"2021-01-12T06:54:58Z","project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2012-09-12","start_date":"2012-09-09","location":"Leuven, Belgium","name":"CHES: Cryptographic Hardware and Embedded Systems"},"month":"09","scopus_import":1,"oa_version":"Preprint","doi":"10.1007/978-3-642-33027-8_13","acknowledgement":"Sebastian Faust acknowledges support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61061130540) for the Sino-Danish Center for the Theory of Interactive Computation, within part of this work was performed; and from the CFEM research center, supported by the Danish Strategic Research Council. \r\nSupported by the European Research Council/ERC Starting Grant 259668-PSPC.\r\n","department":[{"_id":"KrPi"}]},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Lapin: An efficient authentication protocol based on ring-LPN","ec_funded":1,"publist_id":"5002","citation":{"ieee":"S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, and K. Z. Pietrzak, “Lapin: An efficient authentication protocol based on ring-LPN,” in <i> Conference proceedings FSE 2012</i>, Washington, DC, USA, 2012, vol. 7549, pp. 346–365.","mla":"Heyse, Stefan, et al. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” <i> Conference Proceedings FSE 2012</i>, vol. 7549, Springer, 2012, pp. 346–65, doi:<a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">10.1007/978-3-642-34047-5_20</a>.","short":"S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, K.Z. Pietrzak, in:,  Conference Proceedings FSE 2012, Springer, 2012, pp. 346–365.","ista":"Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. 2012. Lapin: An efficient authentication protocol based on ring-LPN.  Conference proceedings FSE 2012. FSE: Fast Software Encryption, LNCS, vol. 7549, 346–365.","ama":"Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. Lapin: An efficient authentication protocol based on ring-LPN. In: <i> Conference Proceedings FSE 2012</i>. Vol 7549. Springer; 2012:346-365. doi:<a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">10.1007/978-3-642-34047-5_20</a>","chicago":"Heyse, Stefan, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, and Krzysztof Z Pietrzak. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” In <i> Conference Proceedings FSE 2012</i>, 7549:346–65. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">https://doi.org/10.1007/978-3-642-34047-5_20</a>.","apa":"Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., &#38; Pietrzak, K. Z. (2012). Lapin: An efficient authentication protocol based on ring-LPN. In <i> Conference proceedings FSE 2012</i> (Vol. 7549, pp. 346–365). Washington, DC, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">https://doi.org/10.1007/978-3-642-34047-5_20</a>"},"oa":1,"quality_controlled":"1","year":"2012","date_created":"2018-12-11T11:55:25Z","page":"346 - 365","day":"01","volume":7549,"type":"conference","publisher":"Springer","publication":" Conference proceedings FSE 2012","main_file_link":[{"url":"http://www.iacr.org/archive/fse2012/75490350/75490350.pdf","open_access":"1"}],"status":"public","_id":"2049","intvolume":"      7549","abstract":[{"text":"We propose a new authentication protocol that is provably secure based on a ring variant of the learning parity with noise (LPN) problem. The protocol follows the design principle of the LPN-based protocol from Eurocrypt’11 (Kiltz et al.), and like it, is a two round protocol secure against active attacks. Moreover, our protocol has small communication complexity and a very small footprint which makes it applicable in scenarios that involve low-cost, resource-constrained devices.\r\n\r\nPerformance-wise, our protocol is more efficient than previous LPN-based schemes, such as the many variants of the Hopper-Blum (HB) protocol and the aforementioned protocol from Eurocrypt’11. Our implementation results show that it is even comparable to the standard challenge-and-response protocols based on the AES block-cipher. Our basic protocol is roughly 20 times slower than AES, but with the advantage of having 10 times smaller code size. Furthermore, if a few hundred bytes of non-volatile memory are available to allow the storage of some off-line pre-computations, then the online phase of our protocols is only twice as slow as AES.\r\n","lang":"eng"}],"publication_status":"published","department":[{"_id":"KrPi"}],"acknowledgement":"Supported by the European Research Council / ERC Starting Grant (259668- PSPC)\r\nWe would like to thank the anonymous referees of this confer- ence and those of the ECRYPT Workshop on Lightweight Cryptography for very useful comments, and in particular for the suggestion that the scheme is somewhat vulnerable to a man-in-the-middle attack whenever an adversary observes two reader challenges that are the same. We hope that the attack we described in Appendix A corresponds to what the reviewer had in mind. We also thank Tanja Lange for pointing us to the pa- per of [Kir11] and for discussions of some of her recent work. ","doi":"10.1007/978-3-642-34047-5_20","oa_version":"Preprint","scopus_import":1,"month":"03","conference":{"start_date":"2012-03-19","end_date":"2012-03-21","name":"FSE: Fast Software Encryption","location":"Washington, DC, USA"},"language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:54:58Z","project":[{"grant_number":"259668","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography"}],"author":[{"first_name":"Stefan","full_name":"Heyse, Stefan","last_name":"Heyse"},{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"},{"first_name":"Vadim","last_name":"Lyubashevsky","full_name":"Lyubashevsky, Vadim"},{"full_name":"Paar, Christof","last_name":"Paar","first_name":"Christof"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"alternative_title":["LNCS"],"date_published":"2012-03-01T00:00:00Z"},{"month":"03","type":"journal_article","volume":13,"day":"22","issue":"1","extern":1,"publication":"BMC Genomics","publisher":"BioMed Central","_id":"2073","abstract":[{"text":"Background: Drosophila albomicans is a unique model organism for studying both sex chromosome and B chromosome evolution. A pair of its autosomes comprising roughly 40% of the whole genome has fused to the ancient X and Y chromosomes only about 0.12 million years ago, thereby creating the youngest and most gene-rich neo-sex system reported to date. This species also possesses recently derived B chromosomes that show non-Mendelian inheritance and significantly influence fertility.Methods: We sequenced male flies with B chromosomes at 124.5-fold genome coverage using next-generation sequencing. To characterize neo-Y specific changes and B chromosome sequences, we also sequenced inbred female flies derived from the same strain but without B's at 28.5-fold.Results: We assembled a female genome and placed 53% of the sequence and 85% of the annotated proteins into specific chromosomes, by comparison with the 12 Drosophila genomes. Despite its very recent origin, the non-recombining neo-Y chromosome shows various signs of degeneration, including a significant enrichment of non-functional genes compared to the neo-X, and an excess of tandem duplications relative to other chromosomes. We also characterized a B-chromosome linked scaffold that contains an actively transcribed unit and shows sequence similarity to the subcentromeric regions of both the ancient X and the neo-X chromosome.Conclusions: Our results provide novel insights into the very early stages of sex chromosome evolution and B chromosome origination, and suggest an unprecedented connection between the births of these two systems in D. albomicans.","lang":"eng"}],"intvolume":"        13","date_updated":"2021-01-12T06:55:08Z","status":"public","date_published":"2012-03-22T00:00:00Z","publication_status":"published","author":[{"first_name":"Qi","last_name":"Zhou","full_name":"Zhou, Qi"},{"last_name":"Zhu","full_name":"Zhu, Hongmei","first_name":"Hongmei"},{"full_name":"Huang, Quanfei","last_name":"Huang","first_name":"Quanfei"},{"full_name":"Zhao, Li","last_name":"Zhao","first_name":"Li"},{"first_name":"Guo","full_name":"Zhang, Guo J","last_name":"Zhang"},{"full_name":"Roy, Scott W","last_name":"Roy","first_name":"Scott"},{"last_name":"Vicoso","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","full_name":"Beatriz Vicoso","first_name":"Beatriz","orcid":"0000-0002-4579-8306"},{"full_name":"Xuan, Zhaolin","last_name":"Xuan","first_name":"Zhaolin"},{"first_name":"Jue","last_name":"Ruan","full_name":"Ruan, Jue"},{"first_name":"Yue","full_name":"Zhang, Yue","last_name":"Zhang"},{"last_name":"Zhao","full_name":"Zhao, Ruoping","first_name":"Ruoping"},{"first_name":"Chen","last_name":"Ye","full_name":"Ye, Chen"},{"first_name":"Xiuqing","full_name":"Zhang, Xiuqing","last_name":"Zhang"},{"last_name":"Wang","full_name":"Wang, Jùn","first_name":"Jùn"},{"first_name":"Wen","full_name":"Wang, Wen","last_name":"Wang"},{"full_name":"Bachtrog, Doris","last_name":"Bachtrog","first_name":"Doris"}],"title":"Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans","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"},"publist_id":"4965","citation":{"ista":"Zhou Q, Zhu H, Huang Q, Zhao L, Zhang G, Roy S, Vicoso B, Xuan Z, Ruan J, Zhang Y, Zhao R, Ye C, Zhang X, Wang J, Wang W, Bachtrog D. 2012. Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans. BMC Genomics. 13(1).","ama":"Zhou Q, Zhu H, Huang Q, et al. Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans. <i>BMC Genomics</i>. 2012;13(1). doi:<a href=\"https://doi.org/10.1186/1471-2164-13-109\">10.1186/1471-2164-13-109</a>","chicago":"Zhou, Qi, Hongmei Zhu, Quanfei Huang, Li Zhao, Guo Zhang, Scott Roy, Beatriz Vicoso, et al. “Deciphering Neo-Sex and B Chromosome Evolution by the Draft Genome of Drosophila Albomicans.” <i>BMC Genomics</i>. BioMed Central, 2012. <a href=\"https://doi.org/10.1186/1471-2164-13-109\">https://doi.org/10.1186/1471-2164-13-109</a>.","apa":"Zhou, Q., Zhu, H., Huang, Q., Zhao, L., Zhang, G., Roy, S., … Bachtrog, D. (2012). Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans. <i>BMC Genomics</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2164-13-109\">https://doi.org/10.1186/1471-2164-13-109</a>","ieee":"Q. Zhou <i>et al.</i>, “Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans,” <i>BMC Genomics</i>, vol. 13, no. 1. BioMed Central, 2012.","mla":"Zhou, Qi, et al. “Deciphering Neo-Sex and B Chromosome Evolution by the Draft Genome of Drosophila Albomicans.” <i>BMC Genomics</i>, vol. 13, no. 1, BioMed Central, 2012, doi:<a href=\"https://doi.org/10.1186/1471-2164-13-109\">10.1186/1471-2164-13-109</a>.","short":"Q. Zhou, H. Zhu, Q. Huang, L. Zhao, G. Zhang, S. Roy, B. Vicoso, Z. Xuan, J. Ruan, Y. Zhang, R. Zhao, C. Ye, X. Zhang, J. Wang, W. Wang, D. Bachtrog, BMC Genomics 13 (2012)."},"date_created":"2018-12-11T11:55:33Z","doi":"10.1186/1471-2164-13-109","year":"2012","quality_controlled":0},{"doi":"10.1111/j.1467-8659.2012.03037.x","date_created":"2018-12-11T11:55:35Z","year":"2012","quality_controlled":0,"citation":{"short":"K. Hildebrand, B. Bickel, M. Alexa, Computer Graphics Forum 31 (2012) 583–592.","ieee":"K. Hildebrand, B. Bickel, and M. Alexa, “crdbrd: Shape fabrication by sliding planar slices,” <i>Computer Graphics Forum</i>, vol. 31, no. 2pt3. Wiley-Blackwell, pp. 583–592, 2012.","mla":"Hildebrand, Kristian, et al. “Crdbrd: Shape Fabrication by Sliding Planar Slices.” <i>Computer Graphics Forum</i>, vol. 31, no. 2pt3, Wiley-Blackwell, 2012, pp. 583–92, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03037.x\">10.1111/j.1467-8659.2012.03037.x</a>.","ista":"Hildebrand K, Bickel B, Alexa M. 2012. crdbrd: Shape fabrication by sliding planar slices. Computer Graphics Forum. 31(2pt3), 583–592.","ama":"Hildebrand K, Bickel B, Alexa M. crdbrd: Shape fabrication by sliding planar slices. <i>Computer Graphics Forum</i>. 2012;31(2pt3):583-592. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03037.x\">10.1111/j.1467-8659.2012.03037.x</a>","chicago":"Hildebrand, Kristian, Bernd Bickel, and Marc Alexa. “Crdbrd: Shape Fabrication by Sliding Planar Slices.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03037.x\">https://doi.org/10.1111/j.1467-8659.2012.03037.x</a>.","apa":"Hildebrand, K., Bickel, B., &#38; Alexa, M. (2012). crdbrd: Shape fabrication by sliding planar slices. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03037.x\">https://doi.org/10.1111/j.1467-8659.2012.03037.x</a>"},"publist_id":"4959","title":"crdbrd: Shape fabrication by sliding planar slices","date_published":"2012-05-01T00:00:00Z","publication_status":"published","author":[{"last_name":"Hildebrand","full_name":"Hildebrand, Kristian","first_name":"Kristian"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd"},{"first_name":"Marc","last_name":"Alexa","full_name":"Alexa, Marc"}],"abstract":[{"lang":"eng","text":"We introduce an algorithm and representation for fabricating 3D shape abstractions using mutually intersecting planar cut-outs. The planes have prefabricated slits at their intersections and are assembled by sliding them together. Often such abstractions are used as a sculptural art form or in architecture and are colloquially called ‘cardboard sculptures’. Based on an analysis of construction rules, we propose an extended binary space partitioning tree as an efficient representation of such cardboard models which allows us to quickly evaluate the feasibility of newly added planar elements. The complexity of insertion order quickly increases with the number of planar elements and manual analysis becomes intractable. We provide tools for generating cardboard sculptures with guaranteed constructibility. In combination with a simple optimization and sampling strategy for new elements, planar shape abstraction models can be designed by iteratively adding elements. As an output, we obtain a fabrication plan that can be printed or sent to a laser cutter. We demonstrate the complete process by designing and fabricating cardboard models of various well-known 3D shapes."}],"_id":"2079","intvolume":"        31","date_updated":"2021-01-12T06:55:10Z","status":"public","publication":"Computer Graphics Forum","issue":"2pt3","extern":1,"publisher":"Wiley-Blackwell","month":"05","type":"journal_article","volume":31,"day":"01","page":"583 - 592"},{"intvolume":"       178","_id":"1972","abstract":[{"text":"Outer membrane protein F, a major component of the Escherichia coli outer membrane, was crystallized for the first time in lipidic mesophase of monoolein in novel space groups, P1 and H32. Due to ease of its purification and crystallization OmpF can be used as a benchmark protein for establishing membrane protein crystallization in meso, as a &quot;membrane lyzozyme&quot; The packing of porin trimers in the crystals of space group H32 is similar to natural outer membranes, providing the first high-resolution insight into the close to native packing of OmpF. Surprisingly, interaction between trimers is mediated exclusively by lipids, without direct protein-protein contacts. Multiple ordered lipids are observed and many of them occupy identical positions independently of the space group, identifying preferential interaction sites of lipid acyl chains. Presence of ordered aliphatic chains close to a positively charged area on the porin surface suggests a position for a lipopolysaccharide binding site on the surface of the major E. coli porins.","lang":"eng"}],"date_updated":"2021-01-12T06:54:26Z","status":"public","date_published":"2012-06-01T00:00:00Z","publication_status":"published","author":[{"full_name":"Efremov, Rouslan G","last_name":"Efremov","first_name":"Rouslan"},{"first_name":"Leonid A","orcid":"0000-0002-0977-7989","last_name":"Sazanov","full_name":"Leonid Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"}],"month":"06","type":"journal_article","volume":178,"page":"311 - 318","day":"01","extern":1,"issue":"3","publication":"Journal of Structural Biology","publisher":"Academic Press","citation":{"mla":"Efremov, Rouslan, and Leonid A. Sazanov. “Structure of Escherichia Coli OmpF Porin from Lipidic Mesophase.” <i>Journal of Structural Biology</i>, vol. 178, no. 3, Academic Press, 2012, pp. 311–18, doi:<a href=\"https://doi.org/10.1016/j.jsb.2012.03.005\">10.1016/j.jsb.2012.03.005</a>.","ieee":"R. Efremov and L. A. Sazanov, “Structure of Escherichia coli OmpF porin from lipidic mesophase,” <i>Journal of Structural Biology</i>, vol. 178, no. 3. Academic Press, pp. 311–318, 2012.","short":"R. Efremov, L.A. Sazanov, Journal of Structural Biology 178 (2012) 311–318.","apa":"Efremov, R., &#38; Sazanov, L. A. (2012). Structure of Escherichia coli OmpF porin from lipidic mesophase. <i>Journal of Structural Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jsb.2012.03.005\">https://doi.org/10.1016/j.jsb.2012.03.005</a>","chicago":"Efremov, Rouslan, and Leonid A Sazanov. “Structure of Escherichia Coli OmpF Porin from Lipidic Mesophase.” <i>Journal of Structural Biology</i>. Academic Press, 2012. <a href=\"https://doi.org/10.1016/j.jsb.2012.03.005\">https://doi.org/10.1016/j.jsb.2012.03.005</a>.","ama":"Efremov R, Sazanov LA. Structure of Escherichia coli OmpF porin from lipidic mesophase. <i>Journal of Structural Biology</i>. 2012;178(3):311-318. doi:<a href=\"https://doi.org/10.1016/j.jsb.2012.03.005\">10.1016/j.jsb.2012.03.005</a>","ista":"Efremov R, Sazanov LA. 2012. Structure of Escherichia coli OmpF porin from lipidic mesophase. Journal of Structural Biology. 178(3), 311–318."},"acknowledgement":"This work was funded by the Medical Research Council.","doi":"10.1016/j.jsb.2012.03.005","date_created":"2018-12-11T11:54:59Z","year":"2012","quality_controlled":0,"title":"Structure of Escherichia coli OmpF porin from lipidic mesophase","publist_id":"5109"},{"extern":1,"publication":"Biochimica et Biophysica Acta - Bioenergetics","issue":"10","publisher":"Elsevier","volume":1817,"page":"1785 - 1795","day":"01","month":"10","type":"review","publication_status":"published","author":[{"full_name":"Efremov, Rouslan G","last_name":"Efremov","first_name":"Rouslan"},{"first_name":"Leonid A","orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","full_name":"Leonid Sazanov","last_name":"Sazanov"}],"date_published":"2012-10-01T00:00:00Z","abstract":[{"lang":"eng","text":"Complex I is a key enzyme of the respiratory chain in many organisms. This multi-protein complex with an intricate evolutionary history originated from the unification of prebuilt modules of hydrogenases and transporters. Using recently determined crystallographic structures of complex I we reanalyzed evolutionarily related complexes that couple oxidoreduction to trans-membrane ion translocation. Our analysis points to the previously unnoticed structural homology of the electron input module of formate dehydrogenlyases and subunit NuoG of complex I. We also show that all related to complex I hydrogenases likely operate via a conformation driven mechanism with structural changes generated in the conserved coupling site located at the interface of subunits NuoB/D/H. The coupling apparently originated once in evolutionary history, together with subunit NuoH joining hydrogenase and transport modules. Analysis of quinone oxidoreduction properties and the structure of complex I allows us to suggest a fully reversible coupling mechanism. Our model predicts that: 1) proton access to the ketone groups of the bound quinone is rigorously controlled by the protein, 2) the negative electric charge of the anionic ubiquinol head group is a major driving force for conformational changes."}],"_id":"1976","intvolume":"      1817","date_updated":"2019-04-26T07:22:06Z","status":"public","publist_id":"5108","title":"The coupling mechanism of respiratory complex i - A structural and evolutionary perspective","quality_controlled":0,"date_created":"2018-12-11T11:55:00Z","doi":"10.1016/j.bbabio.2012.02.015","year":"2012","citation":{"mla":"Efremov, Rouslan, and Leonid A. Sazanov. “The Coupling Mechanism of Respiratory Complex i - A Structural and Evolutionary Perspective.” <i>Biochimica et Biophysica Acta - Bioenergetics</i>, vol. 1817, no. 10, Elsevier, 2012, pp. 1785–95, doi:<a href=\"https://doi.org/10.1016/j.bbabio.2012.02.015\">10.1016/j.bbabio.2012.02.015</a>.","ieee":"R. Efremov and L. A. Sazanov, “The coupling mechanism of respiratory complex i - A structural and evolutionary perspective,” <i>Biochimica et Biophysica Acta - Bioenergetics</i>, vol. 1817, no. 10. Elsevier, pp. 1785–1795, 2012.","short":"R. Efremov, L.A. Sazanov, Biochimica et Biophysica Acta - Bioenergetics 1817 (2012) 1785–1795.","ama":"Efremov R, Sazanov LA. The coupling mechanism of respiratory complex i - A structural and evolutionary perspective. <i>Biochimica et Biophysica Acta - Bioenergetics</i>. 2012;1817(10):1785-1795. doi:<a href=\"https://doi.org/10.1016/j.bbabio.2012.02.015\">10.1016/j.bbabio.2012.02.015</a>","ista":"Efremov R, Sazanov LA. 2012. The coupling mechanism of respiratory complex i - A structural and evolutionary perspective. Biochimica et Biophysica Acta - Bioenergetics. 1817(10), 1785–1795.","apa":"Efremov, R., &#38; Sazanov, L. A. (2012). The coupling mechanism of respiratory complex i - A structural and evolutionary perspective. <i>Biochimica et Biophysica Acta - Bioenergetics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.bbabio.2012.02.015\">https://doi.org/10.1016/j.bbabio.2012.02.015</a>","chicago":"Efremov, Rouslan, and Leonid A Sazanov. “The Coupling Mechanism of Respiratory Complex i - A Structural and Evolutionary Perspective.” <i>Biochimica et Biophysica Acta - Bioenergetics</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.bbabio.2012.02.015\">https://doi.org/10.1016/j.bbabio.2012.02.015</a>."},"acknowledgement":"The work in authors' laboratory was funded by the Medical Research Council."},{"date_created":"2018-12-11T11:49:55Z","year":"2012","oa":1,"citation":{"chicago":"Mark, Manfred, Elmar Haller, Katharina Lauber, Johann G Danzl, Alexander Janisch, Hans Büchler, Andrew Daley, and Hanns Nägerl. “Preparation and Spectroscopy of a Metastable Mott-Insulator State with Attractive Interactions.” <i>Physical Review Letters</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/PhysRevLett.108.215302\">https://doi.org/10.1103/PhysRevLett.108.215302</a>.","apa":"Mark, M., Haller, E., Lauber, K., Danzl, J. G., Janisch, A., Büchler, H., … Nägerl, H. (2012). Preparation and spectroscopy of a metastable mott-insulator state with attractive interactions. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.108.215302\">https://doi.org/10.1103/PhysRevLett.108.215302</a>","ista":"Mark M, Haller E, Lauber K, Danzl JG, Janisch A, Büchler H, Daley A, Nägerl H. 2012. Preparation and spectroscopy of a metastable mott-insulator state with attractive interactions. Physical Review Letters. 108(21).","ama":"Mark M, Haller E, Lauber K, et al. Preparation and spectroscopy of a metastable mott-insulator state with attractive interactions. <i>Physical Review Letters</i>. 2012;108(21). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.108.215302\">10.1103/PhysRevLett.108.215302</a>","mla":"Mark, Manfred, et al. “Preparation and Spectroscopy of a Metastable Mott-Insulator State with Attractive Interactions.” <i>Physical Review Letters</i>, vol. 108, no. 21, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.108.215302\">10.1103/PhysRevLett.108.215302</a>.","ieee":"M. Mark <i>et al.</i>, “Preparation and spectroscopy of a metastable mott-insulator state with attractive interactions,” <i>Physical Review Letters</i>, vol. 108, no. 21. American Physical Society, 2012.","short":"M. Mark, E. Haller, K. Lauber, J.G. Danzl, A. Janisch, H. Büchler, A. Daley, H. Nägerl, Physical Review Letters 108 (2012)."},"publist_id":"6334","title":"Preparation and spectroscopy of a metastable mott-insulator state with attractive interactions","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication_status":"published","abstract":[{"text":"We prepare and study a metastable attractive Mott-insulator state formed with bosonic atoms in a three-dimensional optical lattice. Starting from a Mott insulator with Cs atoms at weak repulsive interactions, we use a magnetic Feshbach resonance to tune the interactions to large attractive values and produce a metastable state pinned by attractive interactions with a lifetime on the order of 10 s. We probe the (de)excitation spectrum via lattice modulation spectroscopy, measuring the interaction dependence of two- and three-body bound-state energies. As a result of increased on-site three-body loss we observe resonance broadening and suppression of tunneling processes that produce three-body occupation.","lang":"eng"}],"intvolume":"       108","_id":"1056","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1201.1008"}],"issue":"21","extern":"1","publication":"Physical Review Letters","publisher":"American Physical Society","article_processing_charge":"No","type":"journal_article","volume":108,"day":"25","doi":"10.1103/PhysRevLett.108.215302","acknowledgement":"We are indebted to R. Grimm for generous support. We thank J. von Stecher, P. Johnson, and E. Tiesinga for fruitful discussions. We gratefully acknowledge funding by the Austrian Science Fund (FWF) within Project No. I153-N16 and within the framework of the European Science Foundation (ESF) EuroQUASAR collective research project QuDeGPM, and by the European Research Council (ERC) under Project No. 278417.","date_published":"2012-05-25T00:00:00Z","author":[{"full_name":"Mark, Manfred","last_name":"Mark","first_name":"Manfred"},{"full_name":"Haller, Elmar","last_name":"Haller","first_name":"Elmar"},{"full_name":"Lauber, Katharina","last_name":"Lauber","first_name":"Katharina"},{"id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","full_name":"Danzl, Johann G","last_name":"Danzl","orcid":"0000-0001-8559-3973","first_name":"Johann G"},{"first_name":"Alexander","full_name":"Janisch, Alexander","last_name":"Janisch"},{"last_name":"Büchler","full_name":"Büchler, Hans","first_name":"Hans"},{"full_name":"Daley, Andrew","last_name":"Daley","first_name":"Andrew"},{"full_name":"Nägerl, Hanns","last_name":"Nägerl","first_name":"Hanns"}],"date_updated":"2021-01-12T06:47:58Z","language":[{"iso":"eng"}],"external_id":{"arxiv":["1201.1008"]},"month":"05","oa_version":"Preprint"},{"date_updated":"2022-02-08T10:48:01Z","author":[{"first_name":"Hryhoriy","orcid":"0000-0001-8223-8896","full_name":"Polshyn, Hryhoriy","last_name":"Polshyn","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48"},{"full_name":"Budakian, Raffi","last_name":"Budakian","first_name":"Raffi"}],"alternative_title":["Bulletin of the American Physical Society"],"date_published":"2012-02-01T00:00:00Z","oa_version":"Published Version","month":"02","conference":{"name":"APS: American Physical Society","location":"Boston, MA, United States","start_date":"2012-02-27","end_date":"2012-03-02"},"language":[{"iso":"eng"}],"acknowledgement":"This work was supported by the Center for Emergent Superconductivity, an Energy Frontier Research Center funded by the U.S. DOE, Office of Science, under Award No. DE-AC0298CH1088.","publication_identifier":{"issn":["0003-0503"]},"article_number":"X21.00008","main_file_link":[{"url":"https://meetings.aps.org/Meeting/MAR12/Event/167014","open_access":"1"}],"status":"public","_id":"10750","abstract":[{"lang":"eng","text":"The goal of this work is to study the superconducting coherence length in the fluctuation regime in cuprate superconductors. In this work we present cantilever torque magnetometry measurements of micron-size BSCCO flakes patterned with arrays of nanometer scale rings or holes. Using ultrasensitive dynamic torque magnetometry, oscillations in magnetization are observed near Tc as a function of the applied magnetic flux threading the array. Special effort was made to detect the oscillations in magnetization at temperatures above Tc, where the Nernst effect and magnetization measurements suggest the possibility of pairing. To constrain the magnitude of the coherence length in the fluctuation regime, we will present the dependence of the amplitude of the h/2e period oscillations as a function of temperature and hole size."}],"intvolume":"        57","publication_status":"published","day":"01","volume":57,"type":"conference","article_processing_charge":"No","publisher":"American Physical Society","publication":"APS March Meeting 2012","extern":"1","issue":"1","citation":{"mla":"Polshyn, Hryhoriy, and Raffi Budakian. “Cantilever Torque Magnetometry Study of Multiply Connected BSCCO Arrays near Tc.” <i>APS March Meeting 2012</i>, vol. 57, no. 1, X21.00008, American Physical Society, 2012.","short":"H. Polshyn, R. Budakian, in:, APS March Meeting 2012, American Physical Society, 2012.","ieee":"H. Polshyn and R. Budakian, “Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc,” in <i>APS March Meeting 2012</i>, Boston, MA, United States, 2012, vol. 57, no. 1.","apa":"Polshyn, H., &#38; Budakian, R. (2012). Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc. In <i>APS March Meeting 2012</i> (Vol. 57). Boston, MA, United States: American Physical Society.","chicago":"Polshyn, Hryhoriy, and Raffi Budakian. “Cantilever Torque Magnetometry Study of Multiply Connected BSCCO Arrays near Tc.” In <i>APS March Meeting 2012</i>, Vol. 57. American Physical Society, 2012.","ama":"Polshyn H, Budakian R. Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc. In: <i>APS March Meeting 2012</i>. Vol 57. American Physical Society; 2012.","ista":"Polshyn H, Budakian R. 2012. Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc. APS March Meeting 2012. APS: American Physical Society, Bulletin of the American Physical Society, vol. 57, X21.00008."},"oa":1,"quality_controlled":"1","year":"2012","date_created":"2022-02-08T10:39:08Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc"},{"article_processing_charge":"No","language":[{"iso":"eng"}],"publication":"Adenosine","publisher":"Springer","scopus_import":"1","oa_version":"None","page":"109-129","day":"23","month":"07","type":"book_chapter","place":"New York","publication_status":"published","author":[{"last_name":"zur Nedden","full_name":"zur Nedden, Stephanie","id":"3C77F464-F248-11E8-B48F-1D18A9856A87","first_name":"Stephanie"},{"full_name":"Doney, Alexander S.","last_name":"Doney","first_name":"Alexander S."},{"last_name":"Frenguelli","full_name":"Frenguelli, Bruno G.","first_name":"Bruno G."}],"edition":"1","date_published":"2012-07-23T00:00:00Z","abstract":[{"lang":"eng","text":"Under physiological conditions the brain, via the purine salvage pathway, reuses the preformed purine bases hypoxanthine, derived from ATP degradation, and adenine (Ade), derived from polyamine synthesis, to restore its ATP pool. However, the massive degradation of ATP during ischemia, although providing valuable neuroprotective adenosine, results in the accumulation and loss of diffusible purine metabolites and thereby leads to a protracted reduction in the post-ischemic ATP pool size. In vivo, this may both limit the ability to deploy ATP-dependent reparative mechanisms and reduce the subsequent availability of adenosine, whilst in brain slices results in tissue with substantially lower levels of ATP than in vivo. In the present review, we describe the mechanisms by which brain tissue replenishes its ATP, how this can be improved with the clinically tolerated chemicals D-ribose and adenine, and the functional, and potential therapeutic, implications of doing so."}],"_id":"10896","date_updated":"2022-06-21T11:51:58Z","status":"public","department":[{"_id":"HaJa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books","quality_controlled":"1","doi":"10.1007/978-1-4614-3903-5_6","date_created":"2022-03-21T07:16:12Z","year":"2012","citation":{"ista":"zur Nedden S, Doney AS, Frenguelli BG. 2012.The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books. In: Adenosine. , 109–129.","ama":"zur Nedden S, Doney AS, Frenguelli BG. The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books. In: Masino S, Boison D, eds. <i>Adenosine</i>. 1st ed. New York: Springer; 2012:109-129. doi:<a href=\"https://doi.org/10.1007/978-1-4614-3903-5_6\">10.1007/978-1-4614-3903-5_6</a>","chicago":"Nedden, Stephanie zur, Alexander S. Doney, and Bruno G. Frenguelli. “The Double-Edged Sword: Gaining Adenosine at the Expense of ATP. How to Balance the Books.” In <i>Adenosine</i>, edited by Susan Masino and Detlev Boison, 1st ed., 109–29. New York: Springer, 2012. <a href=\"https://doi.org/10.1007/978-1-4614-3903-5_6\">https://doi.org/10.1007/978-1-4614-3903-5_6</a>.","apa":"zur Nedden, S., Doney, A. S., &#38; Frenguelli, B. G. (2012). The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books. In S. Masino &#38; D. Boison (Eds.), <i>Adenosine</i> (1st ed., pp. 109–129). New York: Springer. <a href=\"https://doi.org/10.1007/978-1-4614-3903-5_6\">https://doi.org/10.1007/978-1-4614-3903-5_6</a>","mla":"zur Nedden, Stephanie, et al. “The Double-Edged Sword: Gaining Adenosine at the Expense of ATP. How to Balance the Books.” <i>Adenosine</i>, edited by Susan Masino and Detlev Boison, 1st ed., Springer, 2012, pp. 109–29, doi:<a href=\"https://doi.org/10.1007/978-1-4614-3903-5_6\">10.1007/978-1-4614-3903-5_6</a>.","short":"S. zur Nedden, A.S. Doney, B.G. Frenguelli, in:, S. Masino, D. Boison (Eds.), Adenosine, 1st ed., Springer, New York, 2012, pp. 109–129.","ieee":"S. zur Nedden, A. S. Doney, and B. G. Frenguelli, “The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books,” in <i>Adenosine</i>, 1st ed., S. Masino and D. Boison, Eds. New York: Springer, 2012, pp. 109–129."},"editor":[{"first_name":"Susan","last_name":"Masino","full_name":"Masino, Susan"},{"full_name":"Boison, Detlev","last_name":"Boison","first_name":"Detlev"}],"acknowledgement":"We are grateful to Research into Ageing/Ageing UK and The Dunhill Trust for funding SzN’s graduate studies, and to Prof Nicholas Dale for his valuable input.","publication_identifier":{"isbn":["9781461439028"],"eisbn":["9781461439035"]}},{"place":"Berlin, Heidelberg","author":[{"last_name":"Bouajjani","full_name":"Bouajjani, Ahmed","first_name":"Ahmed"},{"first_name":"Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","full_name":"Dragoi, Cezara","last_name":"Dragoi"},{"full_name":"Enea, Constantin","last_name":"Enea","first_name":"Constantin"},{"last_name":"Sighireanu","full_name":"Sighireanu, Mihaela","first_name":"Mihaela"}],"date_published":"2012-10-15T00:00:00Z","alternative_title":["LNCS"],"date_updated":"2024-10-09T21:02:34Z","language":[{"iso":"eng"}],"conference":{"start_date":"2012-10-03","end_date":"2012-10-06","name":"ATVA: Automated Technology for Verification and Analysis","location":"Thiruvananthapuram, India"},"scopus_import":"1","oa_version":"None","month":"10","doi":"10.1007/978-3-642-33386-6_14","acknowledgement":"This work has been partially supported by the French ANR project Veridyc","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783642333859"],"issn":["0302-9743"],"eisbn":["9783642333866"]},"department":[{"_id":"ToHe"}],"publication_status":"published","intvolume":"      7561","_id":"10903","abstract":[{"text":"We propose a logic-based framework for automated reasoning about sequential programs manipulating singly-linked lists and arrays with unbounded data. We introduce the logic SLAD, which allows combining shape constraints, written in a fragment of Separation Logic, with data and size constraints. We address the problem of checking the entailment between SLAD formulas, which is crucial in performing pre-post condition reasoning. Although this problem is undecidable in general for SLAD, we propose a sound and powerful procedure that is able to solve this problem for a large class of formulas, beyond the capabilities of existing techniques and tools. We prove that this procedure is complete, i.e., it is actually a decision procedure for this problem, for an important fragment of SLAD including known decidable logics. We implemented this procedure and shown its preciseness and its efficiency on a significant benchmark of formulas.","lang":"eng"}],"status":"public","article_processing_charge":"No","publication":"Automated Technology for Verification and Analysis","publisher":"Springer","volume":7561,"page":"167-182","day":"15","series_title":"LNCS","type":"conference","corr_author":"1","quality_controlled":"1","date_created":"2022-03-21T07:58:39Z","year":"2012","citation":{"mla":"Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” <i>Automated Technology for Verification and Analysis</i>, vol. 7561, Springer, 2012, pp. 167–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">10.1007/978-3-642-33386-6_14</a>.","ieee":"A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Accurate invariant checking for programs manipulating lists and arrays with infinite data,” in <i>Automated Technology for Verification and Analysis</i>, Thiruvananthapuram, India, 2012, vol. 7561, pp. 167–182.","short":"A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Automated Technology for Verification and Analysis, Springer, Berlin, Heidelberg, 2012, pp. 167–182.","apa":"Bouajjani, A., Dragoi, C., Enea, C., &#38; Sighireanu, M. (2012). Accurate invariant checking for programs manipulating lists and arrays with infinite data. In <i>Automated Technology for Verification and Analysis</i> (Vol. 7561, pp. 167–182). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">https://doi.org/10.1007/978-3-642-33386-6_14</a>","chicago":"Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” In <i>Automated Technology for Verification and Analysis</i>, 7561:167–82. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">https://doi.org/10.1007/978-3-642-33386-6_14</a>.","ama":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. Accurate invariant checking for programs manipulating lists and arrays with infinite data. In: <i>Automated Technology for Verification and Analysis</i>. Vol 7561. LNCS. Berlin, Heidelberg: Springer; 2012:167-182. doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">10.1007/978-3-642-33386-6_14</a>","ista":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Accurate invariant checking for programs manipulating lists and arrays with infinite data. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and AnalysisLNCS, LNCS, vol. 7561, 167–182."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Accurate invariant checking for programs manipulating lists and arrays with infinite data"},{"type":"conference","day":"15","page":"115-131","volume":7454,"publisher":"Springer","publication":"CONCUR 2012 - Concurrency Theory","article_processing_charge":"No","OA_type":"green","status":"public","_id":"10904","abstract":[{"lang":"eng","text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω-regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on VASS (vector addition systems with states). Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts."}],"intvolume":"      7454","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1201.5073","open_access":"1"}],"arxiv":1,"publication_status":"published","ec_funded":1,"title":"Strategy synthesis for multi-dimensional quantitative objectives","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"2716","relation":"later_version","status":"public"}]},"oa":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>.","ieee":"K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” in <i>CONCUR 2012 - Concurrency Theory</i>, Newcastle upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.","short":"K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.","ama":"Chatterjee K, Randour M, Raskin J-F. Strategy synthesis for multi-dimensional quantitative objectives. In: Koutny M, Ulidowski I, eds. <i>CONCUR 2012 - Concurrency Theory</i>. Vol 7454. Berlin, Heidelberg: Springer; 2012:115-131. doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>","ista":"Chatterjee K, Randour M, Raskin J-F. 2012. Strategy synthesis for multi-dimensional quantitative objectives. CONCUR 2012 - Concurrency Theory. CONCUR: Conference on Concurrency Theory, LNCS, vol. 7454, 115–131.","apa":"Chatterjee, K., Randour, M., &#38; Raskin, J.-F. (2012). Strategy synthesis for multi-dimensional quantitative objectives. In M. Koutny &#38; I. Ulidowski (Eds.), <i>CONCUR 2012 - Concurrency Theory</i> (Vol. 7454, pp. 115–131). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” In <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>."},"year":"2012","date_created":"2022-03-21T08:00:21Z","corr_author":"1","quality_controlled":"1","month":"09","oa_version":"Preprint","scopus_import":"1","conference":{"location":"Newcastle upon Tyne, United Kingdom","name":"CONCUR: Conference on Concurrency Theory","end_date":"2012-09-07","start_date":"2012-09-04"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["1201.5073"]},"date_updated":"2025-09-29T11:10:44Z","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"OA_place":"repository","alternative_title":["LNCS"],"date_published":"2012-09-15T00:00:00Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Mickael","last_name":"Randour","full_name":"Randour, Mickael"},{"first_name":"Jean-François","full_name":"Raskin, Jean-François","last_name":"Raskin"}],"place":"Berlin, Heidelberg","department":[{"_id":"KrCh"}],"publication_identifier":{"isbn":["9783642329395"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783642329401"]},"acknowledgement":"Author supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Start Grant (279307: Graph Games), Microsoft faculty fellowship.","editor":[{"full_name":"Koutny, Maciej","last_name":"Koutny","first_name":"Maciej"},{"last_name":"Ulidowski","full_name":"Ulidowski, Irek","first_name":"Irek"}],"doi":"10.1007/978-3-642-32940-1_10"},{"status":"public","intvolume":"      7501","_id":"10905","abstract":[{"lang":"eng","text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP ∩ co−NP, but are not known to be in P. While the existence of polynomial-time algorithms has been a major open problem for decades, there is no algorithm that solves any non-trivial subclass in polynomial time.\r\nIn this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several counter examples that show that many previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting graph structures need not help."}],"main_file_link":[{"url":"https://arxiv.org/abs/1604.08234","open_access":"1"}],"arxiv":1,"publication_status":"published","type":"conference","day":"01","page":"301-312","volume":7501,"publisher":"Springer","publication":"Algorithms – ESA 2012","article_processing_charge":"No","oa":1,"citation":{"ista":"Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. 2012. Polynomial-time algorithms for energy games with special weight structures. Algorithms – ESA 2012. ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.","ama":"Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. In: <i>Algorithms – ESA 2012</i>. Vol 7501. Springer; 2012:301-312. doi:<a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">10.1007/978-3-642-33090-2_27</a>","chicago":"Chatterjee, Krishnendu, Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” In <i>Algorithms – ESA 2012</i>, 7501:301–12. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>.","apa":"Chatterjee, K., Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In <i>Algorithms – ESA 2012</i> (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>","ieee":"K. Chatterjee, M. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in <i>Algorithms – ESA 2012</i>, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.","mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithms – ESA 2012</i>, vol. 7501, Springer, 2012, pp. 301–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">10.1007/978-3-642-33090-2_27</a>.","short":"K. Chatterjee, M. Henzinger, S. Krinninger, D. Nanongkai, in:, Algorithms – ESA 2012, Springer, 2012, pp. 301–312."},"year":"2012","date_created":"2022-03-21T08:01:45Z","corr_author":"1","quality_controlled":"1","ec_funded":1,"title":"Polynomial-time algorithms for energy games with special weight structures","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"535","relation":"later_version","status":"public"}]},"date_updated":"2025-09-29T13:18:37Z","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"alternative_title":["LNCS"],"date_published":"2012-10-01T00:00:00Z","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"month":"10","scopus_import":"1","oa_version":"Preprint","conference":{"name":"ESA: European Symposium on Algorithms","location":"Ljubljana, Slovenia","start_date":"2012-09-10","end_date":"2012-09-12"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["1604.08234"]},"publication_identifier":{"isbn":["9783642330896"],"eissn":["1611-3349"],"eisbn":["9783642330902"],"issn":["0302-9743"]},"acknowledgement":"Supported by the Austrian Science Fund (FWF): P23499-N23, the Austrian Science Fund (FWF): S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award","doi":"10.1007/978-3-642-33090-2_27","department":[{"_id":"KrCh"}]},{"title":"HSF(C): A software verifier based on Horn clauses","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"citation":{"chicago":"Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>.","apa":"Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., &#38; Rybalchenko, A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan &#38; B. König (Eds.), <i>Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>","ista":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.","ama":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. HSF(C): A software verifier based on Horn clauses. In: Flanagan C, König B, eds. <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 7214. LNCS. Berlin, Heidelberg: Springer; 2012:549-551. doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>","ieee":"S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko, “HSF(C): A software verifier based on Horn clauses,” in <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Tallinn, Estonia, 2012, vol. 7214, pp. 549–551.","short":"S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:, C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551.","mla":"Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>."},"date_created":"2022-03-21T08:03:30Z","year":"2012","corr_author":"1","quality_controlled":"1","series_title":"LNCS","type":"conference","volume":7214,"day":"01","page":"549-551","publication":"Tools and Algorithms for the Construction and Analysis of Systems","publisher":"Springer","article_processing_charge":"No","_id":"10906","intvolume":"      7214","abstract":[{"lang":"eng","text":"HSF(C) is a tool that automates verification of safety and liveness properties for C programs. This paper describes the verification approach taken by HSF(C) and provides instructions on how to install and use the tool."}],"status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-642-28756-5_46"}],"publication_status":"published","department":[{"_id":"ToHe"}],"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783642287558"],"issn":["0302-9743"],"eisbn":["9783642287565"]},"editor":[{"first_name":"Cormac","last_name":"Flanagan","full_name":"Flanagan, Cormac"},{"full_name":"König, Barbara","last_name":"König","first_name":"Barbara"}],"doi":"10.1007/978-3-642-28756-5_46","month":"04","oa_version":"Published Version","scopus_import":"1","language":[{"iso":"eng"}],"conference":{"end_date":"2012-04-01","start_date":"2012-03-24","location":"Tallinn, Estonia","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"date_updated":"2024-10-09T21:02:32Z","date_published":"2012-04-01T00:00:00Z","alternative_title":["LNCS"],"place":"Berlin, Heidelberg","author":[{"first_name":"Sergey","last_name":"Grebenshchikov","full_name":"Grebenshchikov, Sergey"},{"last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","first_name":"Ashutosh"},{"full_name":"Lopes, Nuno P.","last_name":"Lopes","first_name":"Nuno P."},{"first_name":"Corneliu","full_name":"Popeea, Corneliu","last_name":"Popeea"},{"full_name":"Rybalchenko, Andrey","last_name":"Rybalchenko","first_name":"Andrey"}]}]