[{"intvolume":"       440","language":[{"iso":"eng"}],"doi":"10.1038/nature04580","date_created":"2024-09-06T11:37:20Z","quality_controlled":"1","external_id":{"arxiv":["0602450"]},"issue":"7083","publication":"Nature","citation":{"ama":"Jimenez R, Haiman Z. Significant primordial star formation at redshifts z ≈ 3–4. <i>Nature</i>. 2006;440(7083):501-504. doi:<a href=\"https://doi.org/10.1038/nature04580\">10.1038/nature04580</a>","chicago":"Jimenez, Raul, and Zoltán Haiman. “Significant Primordial Star Formation at Redshifts z ≈ 3–4.” <i>Nature</i>. Springer Science and Business Media LLC, 2006. <a href=\"https://doi.org/10.1038/nature04580\">https://doi.org/10.1038/nature04580</a>.","apa":"Jimenez, R., &#38; Haiman, Z. (2006). Significant primordial star formation at redshifts z ≈ 3–4. <i>Nature</i>. Springer Science and Business Media LLC. <a href=\"https://doi.org/10.1038/nature04580\">https://doi.org/10.1038/nature04580</a>","short":"R. Jimenez, Z. Haiman, Nature 440 (2006) 501–504.","ista":"Jimenez R, Haiman Z. 2006. Significant primordial star formation at redshifts z ≈ 3–4. Nature. 440(7083), 501–504.","mla":"Jimenez, Raul, and Zoltán Haiman. “Significant Primordial Star Formation at Redshifts z ≈ 3–4.” <i>Nature</i>, vol. 440, no. 7083, Springer Science and Business Media LLC, 2006, pp. 501–04, doi:<a href=\"https://doi.org/10.1038/nature04580\">10.1038/nature04580</a>.","ieee":"R. Jimenez and Z. Haiman, “Significant primordial star formation at redshifts z ≈ 3–4,” <i>Nature</i>, vol. 440, no. 7083. Springer Science and Business Media LLC, pp. 501–504, 2006."},"arxiv":1,"volume":440,"_id":"17808","page":"501-504","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.astro-ph/0602450"}],"oa":1,"title":"Significant primordial star formation at redshifts z ≈ 3–4","date_updated":"2024-09-25T14:01:07Z","scopus_import":"1","publication_status":"published","status":"public","date_published":"2006-03-23T00:00:00Z","type":"journal_article","month":"03","abstract":[{"text":"Four recent observational results have challenged our understanding of high--redshift galaxies, as they require the presence of far more ultraviolet photons than should be emitted by normal stellar populations. First, there is significant ultraviolet emission from Lyman Break Galaxies (LBGs) at wavelenghts shorter than 912Å. Second, there is strong Lyman alpha emission from extended ``blobs'' with little or no associated apparent ionizing continuum. Third, there is a population of galaxies with unusually strong Lyman-alpha emission lines. And fourth, there is a strong HeII (1640 Å) emission line in a composite of LBGs. The proposed explanations for the first three observations are internally inconsistent, and the fourth puzzle has remained hitherto unexplained. Here we show that all four problems are resolved simultaneously if 10-30 percent of the stars in many galaxies at z ~ 3-4 are mainly primordial - unenriched by elements heavier than helium ('metals'). Most models of hierarchical galaxy formation assume efficient intra--galactic metal mixing, and therefore do not predict metal-free star formation at redshifts significantly below z ~5. Our results imply that micro-mixing of metals within galaxies is inefficient on a ~ Gyr time-scale, a conclusion that can be verified with higher resolution simulations, and future observations of the HeII emission line.","lang":"eng"}],"publisher":"Springer Science and Business Media LLC","article_processing_charge":"No","year":"2006","article_type":"original","author":[{"first_name":"Raul","full_name":"Jimenez, Raul","last_name":"Jimenez"},{"full_name":"Haiman, Zoltán","last_name":"Haiman","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36"}],"related_material":{"link":[{"url":"https://doi.org/10.1038/nature04774","relation":"erratum"}]},"fulldoi":"https://doi.org/10.1038/nature04580","day":"23","extern":"1","publication_identifier":{"issn":["0028-0836","1476-4687"]},"oa_version":"Preprint"},{"title":"Novel anti-viral therapy: Drugs that block HIV entry at different target sites","date_updated":"2021-01-12T06:53:15Z","day":"01","extern":1,"publist_id":"5314","volume":6,"_id":"1796","fulldoi":"https://doi.org/10.2174/138955706776876267","page":"557 - 562","publication":"Mini-Reviews in Medicinal Chemistry","author":[{"id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8635-0877","first_name":"Sandra","full_name":"Sandra Siegert","last_name":"Siegert"},{"first_name":"Peter","last_name":"Schnierle","full_name":"Schnierle, Peter"},{"full_name":"Schnierle, Barbara S","last_name":"Schnierle","first_name":"Barbara"}],"citation":{"ieee":"S. Siegert, P. Schnierle, and B. Schnierle, “Novel anti-viral therapy: Drugs that block HIV entry at different target sites,” <i>Mini-Reviews in Medicinal Chemistry</i>, vol. 6, no. 5. Bentham Science Publishers, pp. 557–562, 2006.","mla":"Siegert, Sandra, et al. “Novel Anti-Viral Therapy: Drugs That Block HIV Entry at Different Target Sites.” <i>Mini-Reviews in Medicinal Chemistry</i>, vol. 6, no. 5, Bentham Science Publishers, 2006, pp. 557–62, doi:<a href=\"https://doi.org/10.2174/138955706776876267\">10.2174/138955706776876267</a>.","ista":"Siegert S, Schnierle P, Schnierle B. 2006. Novel anti-viral therapy: Drugs that block HIV entry at different target sites. Mini-Reviews in Medicinal Chemistry. 6(5), 557–562.","short":"S. Siegert, P. Schnierle, B. Schnierle, Mini-Reviews in Medicinal Chemistry 6 (2006) 557–562.","apa":"Siegert, S., Schnierle, P., &#38; Schnierle, B. (2006). Novel anti-viral therapy: Drugs that block HIV entry at different target sites. <i>Mini-Reviews in Medicinal Chemistry</i>. Bentham Science Publishers. <a href=\"https://doi.org/10.2174/138955706776876267\">https://doi.org/10.2174/138955706776876267</a>","chicago":"Siegert, Sandra, Peter Schnierle, and Barbara Schnierle. “Novel Anti-Viral Therapy: Drugs That Block HIV Entry at Different Target Sites.” <i>Mini-Reviews in Medicinal Chemistry</i>. Bentham Science Publishers, 2006. <a href=\"https://doi.org/10.2174/138955706776876267\">https://doi.org/10.2174/138955706776876267</a>.","ama":"Siegert S, Schnierle P, Schnierle B. Novel anti-viral therapy: Drugs that block HIV entry at different target sites. <i>Mini-Reviews in Medicinal Chemistry</i>. 2006;6(5):557-562. doi:<a href=\"https://doi.org/10.2174/138955706776876267\">10.2174/138955706776876267</a>"},"abstract":[{"text":"Drugs that block the entry of human immunodeficiency virus type 1 (HIV-1) into host cells abrogate the establishment of a productive infection and should ideally diminish the chances of HIV-1 developing resistance. This review will give an overview of the mechanism by which the envelope glycoprotein mediates HIV-1 entry and will summarize current drug developments.","lang":"eng"}],"publisher":"Bentham Science Publishers","year":"2006","issue":"5","date_created":"2018-12-11T11:54:03Z","month":"05","quality_controlled":0,"type":"journal_article","doi":"10.2174/138955706776876267","publication_status":"published","date_published":"2006-05-01T00:00:00Z","status":"public","intvolume":"         6"},{"publication":"Nature","citation":{"ieee":"L. Venkataraman, J. E. Klare, C. Nuckolls, M. S. Hybertsen, and M. L. Steigerwald, “Dependence of single-molecule junction conductance on molecular conformation,” <i>Nature</i>, vol. 442, no. 7105. Springer Nature, pp. 904–907, 2006.","mla":"Venkataraman, Latha, et al. “Dependence of Single-Molecule Junction Conductance on Molecular Conformation.” <i>Nature</i>, vol. 442, no. 7105, Springer Nature, 2006, pp. 904–07, doi:<a href=\"https://doi.org/10.1038/nature05037\">10.1038/nature05037</a>.","ista":"Venkataraman L, Klare JE, Nuckolls C, Hybertsen MS, Steigerwald ML. 2006. Dependence of single-molecule junction conductance on molecular conformation. Nature. 442(7105), 904–907.","short":"L. Venkataraman, J.E. Klare, C. Nuckolls, M.S. Hybertsen, M.L. Steigerwald, Nature 442 (2006) 904–907.","apa":"Venkataraman, L., Klare, J. E., Nuckolls, C., Hybertsen, M. S., &#38; Steigerwald, M. L. (2006). Dependence of single-molecule junction conductance on molecular conformation. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/nature05037\">https://doi.org/10.1038/nature05037</a>","chicago":"Venkataraman, Latha, Jennifer E. Klare, Colin Nuckolls, Mark S. Hybertsen, and Michael L. Steigerwald. “Dependence of Single-Molecule Junction Conductance on Molecular Conformation.” <i>Nature</i>. Springer Nature, 2006. <a href=\"https://doi.org/10.1038/nature05037\">https://doi.org/10.1038/nature05037</a>.","ama":"Venkataraman L, Klare JE, Nuckolls C, Hybertsen MS, Steigerwald ML. Dependence of single-molecule junction conductance on molecular conformation. <i>Nature</i>. 2006;442(7105):904-907. doi:<a href=\"https://doi.org/10.1038/nature05037\">10.1038/nature05037</a>"},"volume":442,"_id":"18041","page":"904-907","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"closed access","title":"Dependence of single-molecule junction conductance on molecular conformation","scopus_import":"1","date_updated":"2025-01-03T11:13:23Z","intvolume":"       442","language":[{"iso":"eng"}],"doi":"10.1038/nature05037","date_created":"2024-09-09T15:07:33Z","quality_controlled":"1","pmid":1,"external_id":{"pmid":["16929295"]},"issue":"7105","article_type":"letter_note","author":[{"full_name":"Venkataraman, Latha","last_name":"Venkataraman","orcid":"0000-0002-6957-6089","first_name":"Latha","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf"},{"full_name":"Klare, Jennifer E.","last_name":"Klare","first_name":"Jennifer E."},{"last_name":"Nuckolls","full_name":"Nuckolls, Colin","first_name":"Colin"},{"first_name":"Mark S.","last_name":"Hybertsen","full_name":"Hybertsen, Mark S."},{"last_name":"Steigerwald","full_name":"Steigerwald, Michael L.","first_name":"Michael L."}],"fulldoi":"https://doi.org/10.1038/nature05037","extern":"1","day":"24","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"oa_version":"None","publication_status":"published","date_published":"2006-08-24T00:00:00Z","status":"public","type":"journal_article","month":"08","abstract":[{"lang":"eng","text":"Since it was first suggested1 that a single molecule might function as an active electronic component, a number of techniques have been developed to measure the charge transport properties of single molecules2,3,4,5,6,7,8,9,10,11,12. Although scanning tunnelling microscopy observations under high vacuum conditions can allow stable measurements of electron transport, most measurements of a single molecule bonded in a metal–molecule–metal junction exhibit relatively large variations in conductance. As a result, even simple predictions about how molecules behave in such junctions have still not been rigorously tested. For instance, it is well known13,14 that the tunnelling current passing through a molecule depends on its conformation; but although some experiments have verified this effect15,16,17,18, a comprehensive mapping of how junction conductance changes with molecular conformation is not yet available. In the simple case of a biphenyl—a molecule with two phenyl rings linked by a single C–C bond—conductance is expected to change with the relative twist angle between the two rings, with the planar conformation having the highest conductance. Here we use amine link groups to form single-molecule junctions with more reproducible current–voltage characteristics19. This allows us to extract average conductance values from thousands of individual measurements on a series of seven biphenyl molecules with different ring substitutions that alter the twist angle of the molecules. We find that the conductance for the series decreases with increasing twist angle, consistent with a cosine-squared relation predicted for transport through π-conjugated biphenyl systems13."}],"year":"2006","article_processing_charge":"No","publisher":"Springer Nature"},{"month":"02","article_processing_charge":"No","year":"2006","publisher":"American Physical Society","abstract":[{"text":"We have measured electron transport in small bundles of identical conducting molybdenum selenide nanowires where the number of weakly interacting one-dimensional chains ranges from 1 to 300. The linear conductance and current in these nanowires exhibit a power-law dependence on temperature and bias voltage, respectively. The exponents governing these power laws decrease as the number of conducting channels increase. These exponents can be related to the electron-electron interaction parameter for transport in multichannel 1D systems with a few defects.","lang":"eng"}],"date_published":"2006-02-21T00:00:00Z","status":"public","publication_status":"published","type":"journal_article","extern":"1","day":"21","oa_version":"Preprint","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"author":[{"orcid":"0000-0002-6957-6089","first_name":"Latha","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","full_name":"Venkataraman, Latha","last_name":"Venkataraman"},{"first_name":"Yeon Suk","last_name":"Hong","full_name":"Hong, Yeon Suk"},{"full_name":"Kim, Philip","last_name":"Kim","first_name":"Philip"}],"article_type":"original","fulldoi":"https://doi.org/10.1103/physrevlett.96.076601","OA_place":"repository","quality_controlled":"1","date_created":"2024-09-09T15:08:34Z","issue":"7","article_number":"076601","pmid":1,"external_id":{"arxiv":["cond-mat/0601454"],"pmid":["16606116"]},"intvolume":"        96","doi":"10.1103/physrevlett.96.076601","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/cond-mat/0601454"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_updated":"2025-01-03T11:16:00Z","title":"Electron transport in m Multichannel one-dimensional conductor: Molybdenum selenide nanowires","OA_type":"green","oa":1,"arxiv":1,"citation":{"short":"L. Venkataraman, Y.S. Hong, P. Kim, Physical Review Letters 96 (2006).","ista":"Venkataraman L, Hong YS, Kim P. 2006. Electron transport in m Multichannel one-dimensional conductor: Molybdenum selenide nanowires. Physical Review Letters. 96(7), 076601.","ieee":"L. Venkataraman, Y. S. Hong, and P. Kim, “Electron transport in m Multichannel one-dimensional conductor: Molybdenum selenide nanowires,” <i>Physical Review Letters</i>, vol. 96, no. 7. American Physical Society, 2006.","mla":"Venkataraman, Latha, et al. “Electron Transport in m Multichannel One-Dimensional Conductor: Molybdenum Selenide Nanowires.” <i>Physical Review Letters</i>, vol. 96, no. 7, 076601, American Physical Society, 2006, doi:<a href=\"https://doi.org/10.1103/physrevlett.96.076601\">10.1103/physrevlett.96.076601</a>.","ama":"Venkataraman L, Hong YS, Kim P. Electron transport in m Multichannel one-dimensional conductor: Molybdenum selenide nanowires. <i>Physical Review Letters</i>. 2006;96(7). doi:<a href=\"https://doi.org/10.1103/physrevlett.96.076601\">10.1103/physrevlett.96.076601</a>","chicago":"Venkataraman, Latha, Yeon Suk Hong, and Philip Kim. “Electron Transport in m Multichannel One-Dimensional Conductor: Molybdenum Selenide Nanowires.” <i>Physical Review Letters</i>. American Physical Society, 2006. <a href=\"https://doi.org/10.1103/physrevlett.96.076601\">https://doi.org/10.1103/physrevlett.96.076601</a>.","apa":"Venkataraman, L., Hong, Y. S., &#38; Kim, P. (2006). Electron transport in m Multichannel one-dimensional conductor: Molybdenum selenide nanowires. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.96.076601\">https://doi.org/10.1103/physrevlett.96.076601</a>"},"publication":"Physical Review Letters","volume":96,"_id":"18042"},{"author":[{"full_name":"Venkataraman, Latha","last_name":"Venkataraman","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","first_name":"Latha","orcid":"0000-0002-6957-6089"},{"full_name":"Klare, Jennifer E.","last_name":"Klare","first_name":"Jennifer E."},{"first_name":"Iris W.","full_name":"Tam, Iris W.","last_name":"Tam"},{"first_name":"Colin","full_name":"Nuckolls, Colin","last_name":"Nuckolls"},{"first_name":"Mark S.","full_name":"Hybertsen, Mark S.","last_name":"Hybertsen"},{"first_name":"Michael L.","full_name":"Steigerwald, Michael L.","last_name":"Steigerwald"}],"article_type":"letter_note","fulldoi":"https://doi.org/10.1021/nl052373+","OA_place":"repository","day":"01","extern":"1","oa_version":"Preprint","publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]},"status":"public","date_published":"2006-02-01T00:00:00Z","publication_status":"published","type":"journal_article","month":"02","publisher":"American Chemical Society","year":"2006","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We measure the conductance of amine-terminated molecules by breaking Au point contacts in a molecular solution at room temperature. We find that the variability of the observed conductance for the diamine molecule−Au junctions is much less than the variability for diisonitrile− and dithiol−Au junctions. This narrow distribution enables unambiguous conductance measurements of single molecules. For an alkane diamine series with 2−8 carbon atoms in the hydrocarbon chain, our results show a systematic trend in the conductance from which we extract a tunneling decay constant of 0.91 ± 0.03 per methylene group. We hypothesize that the diamine link binds preferentially to undercoordinated Au atoms in the junction. This is supported by density functional theory-based calculations that show the amine binding to a gold adatom with sufficient angular flexibility for easy junction formation but well-defined electronic coupling of the N lone pair to the Au. Therefore, the amine linkage leads to well-defined conductance measurements of a single molecule junction in a statistical study."}],"arxiv":1,"citation":{"short":"L. Venkataraman, J.E. Klare, I.W. Tam, C. Nuckolls, M.S. Hybertsen, M.L. Steigerwald, Nano Letters 6 (2006) 458–462.","ista":"Venkataraman L, Klare JE, Tam IW, Nuckolls C, Hybertsen MS, Steigerwald ML. 2006. Single-molecule circuits with well-defined molecular conductance. Nano Letters. 6(3), 458–462.","mla":"Venkataraman, Latha, et al. “Single-Molecule Circuits with Well-Defined Molecular Conductance.” <i>Nano Letters</i>, vol. 6, no. 3, American Chemical Society, 2006, pp. 458–62, doi:<a href=\"https://doi.org/10.1021/nl052373+\">10.1021/nl052373+</a>.","ieee":"L. Venkataraman, J. E. Klare, I. W. Tam, C. Nuckolls, M. S. Hybertsen, and M. L. Steigerwald, “Single-molecule circuits with well-defined molecular conductance,” <i>Nano Letters</i>, vol. 6, no. 3. American Chemical Society, pp. 458–462, 2006.","ama":"Venkataraman L, Klare JE, Tam IW, Nuckolls C, Hybertsen MS, Steigerwald ML. Single-molecule circuits with well-defined molecular conductance. <i>Nano Letters</i>. 2006;6(3):458-462. doi:<a href=\"https://doi.org/10.1021/nl052373+\">10.1021/nl052373+</a>","chicago":"Venkataraman, Latha, Jennifer E. Klare, Iris W. Tam, Colin Nuckolls, Mark S. Hybertsen, and Michael L. Steigerwald. “Single-Molecule Circuits with Well-Defined Molecular Conductance.” <i>Nano Letters</i>. American Chemical Society, 2006. <a href=\"https://doi.org/10.1021/nl052373+\">https://doi.org/10.1021/nl052373+</a>.","apa":"Venkataraman, L., Klare, J. E., Tam, I. W., Nuckolls, C., Hybertsen, M. S., &#38; Steigerwald, M. L. (2006). Single-molecule circuits with well-defined molecular conductance. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/nl052373+\">https://doi.org/10.1021/nl052373+</a>"},"publication":"Nano Letters","page":"458-462","volume":6,"_id":"18043","main_file_link":[{"url":"https://arxiv.org/abs/cond-mat/0603281","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-01-03T11:19:52Z","scopus_import":"1","title":"Single-molecule circuits with well-defined molecular conductance","oa":1,"OA_type":"green","intvolume":"         6","doi":"10.1021/nl052373+","language":[{"iso":"eng"}],"quality_controlled":"1","date_created":"2024-09-09T15:09:24Z","issue":"3","external_id":{"arxiv":["cond-mat/0603281"]}},{"citation":{"ama":"Ulrich J, Esrail D, Pontius W, Venkataraman L, Millar D, Doerrer LH. Variability of conductance in molecular junctions. <i>The Journal of Physical Chemistry B</i>. 2006;110(6):2462-2466. doi:<a href=\"https://doi.org/10.1021/jp056455y\">10.1021/jp056455y</a>","chicago":"Ulrich, Jochen, Donna Esrail, William Pontius, Latha Venkataraman, David Millar, and Linda H. Doerrer. “Variability of Conductance in Molecular Junctions.” <i>The Journal of Physical Chemistry B</i>. American Chemical Society, 2006. <a href=\"https://doi.org/10.1021/jp056455y\">https://doi.org/10.1021/jp056455y</a>.","apa":"Ulrich, J., Esrail, D., Pontius, W., Venkataraman, L., Millar, D., &#38; Doerrer, L. H. (2006). Variability of conductance in molecular junctions. <i>The Journal of Physical Chemistry B</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jp056455y\">https://doi.org/10.1021/jp056455y</a>","short":"J. Ulrich, D. Esrail, W. Pontius, L. Venkataraman, D. Millar, L.H. Doerrer, The Journal of Physical Chemistry B 110 (2006) 2462–2466.","ista":"Ulrich J, Esrail D, Pontius W, Venkataraman L, Millar D, Doerrer LH. 2006. Variability of conductance in molecular junctions. The Journal of Physical Chemistry B. 110(6), 2462–2466.","mla":"Ulrich, Jochen, et al. “Variability of Conductance in Molecular Junctions.” <i>The Journal of Physical Chemistry B</i>, vol. 110, no. 6, American Chemical Society, 2006, pp. 2462–66, doi:<a href=\"https://doi.org/10.1021/jp056455y\">10.1021/jp056455y</a>.","ieee":"J. Ulrich, D. Esrail, W. Pontius, L. Venkataraman, D. Millar, and L. H. Doerrer, “Variability of conductance in molecular junctions,” <i>The Journal of Physical Chemistry B</i>, vol. 110, no. 6. American Chemical Society, pp. 2462–2466, 2006."},"publication":"The Journal of Physical Chemistry B","page":"2462-2466","_id":"18044","volume":110,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_updated":"2025-01-03T11:22:15Z","title":"Variability of conductance in molecular junctions","OA_type":"closed access","intvolume":"       110","doi":"10.1021/jp056455y","language":[{"iso":"eng"}],"quality_controlled":"1","date_created":"2024-09-09T15:10:13Z","issue":"6","pmid":1,"external_id":{"pmid":["16471840"]},"author":[{"first_name":"Jochen","full_name":"Ulrich, Jochen","last_name":"Ulrich"},{"full_name":"Esrail, Donna","last_name":"Esrail","first_name":"Donna"},{"first_name":"William","full_name":"Pontius, William","last_name":"Pontius"},{"id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","orcid":"0000-0002-6957-6089","first_name":"Latha","last_name":"Venkataraman","full_name":"Venkataraman, Latha"},{"first_name":"David","full_name":"Millar, David","last_name":"Millar"},{"full_name":"Doerrer, Linda H.","last_name":"Doerrer","first_name":"Linda H."}],"article_type":"letter_note","fulldoi":"https://doi.org/10.1021/jp056455y","extern":"1","day":"21","oa_version":"None","publication_identifier":{"eissn":["1520-5207"],"issn":["1520-6106"]},"status":"public","date_published":"2006-01-21T00:00:00Z","publication_status":"published","type":"journal_article","month":"01","article_processing_charge":"No","year":"2006","publisher":"American Chemical Society","abstract":[{"lang":"eng","text":"The conductance of molecular junctions, formed by breaking gold point contacts dressed with various thiol functionalized organic molecules, is measured at 293 K and at 30 K. In the presence of molecules, individual conductance traces measured as a function of increasing gold electrode displacement show clear steps below the quantum conductance steps of the gold contact. These steps are distributed over a wide range of molecule-dependent conductance values. Histograms constructed from all conductance traces therefore do not show clear peaks either at room or low temperatures. Filtering of the data sets by an objective automated procedure only marginally improves the visibility of such features. We conclude that the geometrical junction to junction variations dominate the conductance measurements."}]},{"publication":"Numerical Linear Algebra with Applications","citation":{"ista":"Bronstein MM, Bronstein AM, Kimmel R, Yavneh I. 2006. Multigrid multidimensional scaling. Numerical Linear Algebra with Applications. 13(2–3), 149–171.","short":"M.M. Bronstein, A.M. Bronstein, R. Kimmel, I. Yavneh, Numerical Linear Algebra with Applications 13 (2006) 149–171.","ieee":"M. M. Bronstein, A. M. Bronstein, R. Kimmel, and I. Yavneh, “Multigrid multidimensional scaling,” <i>Numerical Linear Algebra with Applications</i>, vol. 13, no. 2–3. Wiley, pp. 149–171, 2006.","mla":"Bronstein, M. M., et al. “Multigrid Multidimensional Scaling.” <i>Numerical Linear Algebra with Applications</i>, vol. 13, no. 2–3, Wiley, 2006, pp. 149–71, doi:<a href=\"https://doi.org/10.1002/nla.475\">10.1002/nla.475</a>.","chicago":"Bronstein, M. M., Alex M. Bronstein, R. Kimmel, and I. Yavneh. “Multigrid Multidimensional Scaling.” <i>Numerical Linear Algebra with Applications</i>. Wiley, 2006. <a href=\"https://doi.org/10.1002/nla.475\">https://doi.org/10.1002/nla.475</a>.","ama":"Bronstein MM, Bronstein AM, Kimmel R, Yavneh I. Multigrid multidimensional scaling. <i>Numerical Linear Algebra with Applications</i>. 2006;13(2-3):149-171. doi:<a href=\"https://doi.org/10.1002/nla.475\">10.1002/nla.475</a>","apa":"Bronstein, M. M., Bronstein, A. M., Kimmel, R., &#38; Yavneh, I. (2006). Multigrid multidimensional scaling. <i>Numerical Linear Algebra with Applications</i>. Wiley. <a href=\"https://doi.org/10.1002/nla.475\">https://doi.org/10.1002/nla.475</a>"},"volume":13,"_id":"18318","page":"149-171","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Multigrid multidimensional scaling","date_updated":"2024-11-12T08:45:09Z","scopus_import":"1","intvolume":"        13","language":[{"iso":"eng"}],"doi":"10.1002/nla.475","date_created":"2024-10-15T11:12:06Z","quality_controlled":"1","issue":"2-3","article_type":"original","author":[{"first_name":"M. M.","full_name":"Bronstein, M. M.","last_name":"Bronstein"},{"last_name":"Bronstein","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730"},{"first_name":"R.","last_name":"Kimmel","full_name":"Kimmel, R."},{"full_name":"Yavneh, I.","last_name":"Yavneh","first_name":"I."}],"fulldoi":"https://doi.org/10.1002/nla.475","day":"01","extern":"1","publication_identifier":{"eissn":["1099-1506"],"issn":["1070-5325"]},"oa_version":"None","publication_status":"published","date_published":"2006-03-01T00:00:00Z","status":"public","type":"journal_article","month":"03","abstract":[{"lang":"eng","text":"Multidimensional scaling (MDS) is a generic name for a family of algorithms that construct a configuration of points in a target metric space from information about inter-point distances measured in some other metric space. Large-scale MDS problems often occur in data analysis, representation and visualization. Solving such problems efficiently is of key importance in many applications.\r\nIn this paper we present a multigrid framework for MDS problems. We demonstrate the performance of our algorithm on dimensionality reduction and isometric embedding problems, two classical problems requiring efficient large-scale MDS. Simulation results show that the proposed approach significantly outperforms conventional MDS algorithms."}],"publisher":"Wiley","year":"2006","article_processing_charge":"No"},{"publisher":"Springer Nature","year":"2006","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Presented here is the problem of recovering a dynamic image superimposed on a static background. Such a problem is ill-posed and may arise e.g. in imaging through semireflective media, in separation of an illumination image from a reflectance image, in imaging with diffraction phenomena, etc. In this work we study regularization of this problem in spirit of Total Variation and general sparsifying transformations."}],"conference":{"location":"Charleston, SC, United States","end_date":"2006-03-08","start_date":"2006-03-05","name":"ICA: International Conference on Independent Component Analysis and Signal Separation"},"month":"02","type":"conference","date_published":"2006-02-13T00:00:00Z","status":"public","publication_status":"published","oa_version":"None","publication_identifier":{"eisbn":["9783540326311"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783540326304"]},"day":"13","extern":"1","fulldoi":"https://doi.org/10.1007/11679363_116","author":[{"full_name":"Bronstein, Alexander","last_name":"Bronstein","first_name":"Alexander","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"last_name":"Bronstein","full_name":"Bronstein, Michael M.","first_name":"Michael M."},{"first_name":"Michael","last_name":"Zibulevsky","full_name":"Zibulevsky, Michael"}],"alternative_title":["LNISA"],"quality_controlled":"1","date_created":"2024-10-15T11:20:53Z","doi":"10.1007/11679363_116","language":[{"iso":"eng"}],"intvolume":"      3889","date_updated":"2024-10-22T07:00:45Z","scopus_import":"1","title":"On separation of semitransparent dynamic images from static background","OA_type":"closed access","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"934-940","volume":3889,"_id":"18320","citation":{"ieee":"A. M. Bronstein, M. M. Bronstein, and M. Zibulevsky, “On separation of semitransparent dynamic images from static background,” in <i>6th International Conference on Independent Component Analysis and Signal Separation</i>, Charleston, SC, United States, 2006, vol. 3889, pp. 934–940.","mla":"Bronstein, Alex M., et al. “On Separation of Semitransparent Dynamic Images from Static Background.” <i>6th International Conference on Independent Component Analysis and Signal Separation</i>, vol. 3889, Springer Nature, 2006, pp. 934–40, doi:<a href=\"https://doi.org/10.1007/11679363_116\">10.1007/11679363_116</a>.","ista":"Bronstein AM, Bronstein MM, Zibulevsky M. 2006. On separation of semitransparent dynamic images from static background. 6th International Conference on Independent Component Analysis and Signal Separation. ICA: International Conference on Independent Component Analysis and Signal Separation, LNISA, vol. 3889, 934–940.","short":"A.M. Bronstein, M.M. Bronstein, M. Zibulevsky, in:, 6th International Conference on Independent Component Analysis and Signal Separation, Springer Nature, 2006, pp. 934–940.","apa":"Bronstein, A. M., Bronstein, M. M., &#38; Zibulevsky, M. (2006). On separation of semitransparent dynamic images from static background. In <i>6th International Conference on Independent Component Analysis and Signal Separation</i> (Vol. 3889, pp. 934–940). Charleston, SC, United States: Springer Nature. <a href=\"https://doi.org/10.1007/11679363_116\">https://doi.org/10.1007/11679363_116</a>","chicago":"Bronstein, Alex M., Michael M. Bronstein, and Michael Zibulevsky. “On Separation of Semitransparent Dynamic Images from Static Background.” In <i>6th International Conference on Independent Component Analysis and Signal Separation</i>, 3889:934–40. Springer Nature, 2006. <a href=\"https://doi.org/10.1007/11679363_116\">https://doi.org/10.1007/11679363_116</a>.","ama":"Bronstein AM, Bronstein MM, Zibulevsky M. On separation of semitransparent dynamic images from static background. In: <i>6th International Conference on Independent Component Analysis and Signal Separation</i>. Vol 3889. Springer Nature; 2006:934-940. doi:<a href=\"https://doi.org/10.1007/11679363_116\">10.1007/11679363_116</a>"},"publication":"6th International Conference on Independent Component Analysis and Signal Separation"},{"fulldoi":"https://doi.org/10.1007/11744078_31","_id":"18321","volume":3953,"author":[{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","first_name":"Alexander","last_name":"Bronstein","full_name":"Bronstein, Alexander"},{"last_name":"Bronstein","full_name":"Bronstein, Michael M.","first_name":"Michael M."},{"last_name":"Kimmel","full_name":"Kimmel, Ron","first_name":"Ron"}],"citation":{"ieee":"A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Robust expression-invariant face recognition from partially missing data,” in <i>9th European Conference on Computer Vision</i>, Graz, Austria, 2006, vol. 3953.","mla":"Bronstein, Alex M., et al. “Robust Expression-Invariant Face Recognition from Partially Missing Data.” <i>9th European Conference on Computer Vision</i>, vol. 3953, Springer Nature, 2006, doi:<a href=\"https://doi.org/10.1007/11744078_31\">10.1007/11744078_31</a>.","short":"A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 9th European Conference on Computer Vision, Springer Nature, 2006.","ista":"Bronstein AM, Bronstein MM, Kimmel R. 2006. Robust expression-invariant face recognition from partially missing data. 9th European Conference on Computer Vision. ECCV: European Conference on Computer Vision, LNCS, vol. 3953.","apa":"Bronstein, A. M., Bronstein, M. M., &#38; Kimmel, R. (2006). Robust expression-invariant face recognition from partially missing data. In <i>9th European Conference on Computer Vision</i> (Vol. 3953). Graz, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/11744078_31\">https://doi.org/10.1007/11744078_31</a>","ama":"Bronstein AM, Bronstein MM, Kimmel R. Robust expression-invariant face recognition from partially missing data. In: <i>9th European Conference on Computer Vision</i>. Vol 3953. Springer Nature; 2006. doi:<a href=\"https://doi.org/10.1007/11744078_31\">10.1007/11744078_31</a>","chicago":"Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Robust Expression-Invariant Face Recognition from Partially Missing Data.” In <i>9th European Conference on Computer Vision</i>, Vol. 3953. Springer Nature, 2006. <a href=\"https://doi.org/10.1007/11744078_31\">https://doi.org/10.1007/11744078_31</a>."},"publication":"9th European Conference on Computer Vision","alternative_title":["LNCS"],"oa_version":"None","date_updated":"2024-10-22T06:46:14Z","scopus_import":"1","OA_type":"closed access","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783540338369"],"eisbn":["9783540338376"],"issn":["0302-9743"]},"title":"Robust expression-invariant face recognition from partially missing data","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","type":"conference","doi":"10.1007/11744078_31","language":[{"iso":"eng"}],"status":"public","date_published":"2006-01-01T00:00:00Z","intvolume":"      3953","publication_status":"published","publisher":"Springer Nature","year":"2006","article_processing_charge":"No","abstract":[{"text":"Recent studies on three-dimensional face recognition proposed to model facial expressions as isometries of the facial surface. Based on this model, expression-invariant signatures of the face were constructed by means of approximate isometric embedding into flat spaces. Here, we apply a new method for measuring isometry-invariant similarity between faces by embedding one facial surface into another. We demonstrate that our approach has several significant advantages, one of which is the ability to handle partially missing data. Promising face recognition results are obtained in numerical experiments even when the facial surfaces are severely occluded.","lang":"eng"}],"conference":{"location":"Graz, Austria","start_date":"2006-05-07","end_date":"2006-05-13","name":"ECCV: European Conference on Computer Vision"},"month":"01","quality_controlled":"1","date_created":"2024-10-15T11:20:53Z"},{"citation":{"mla":"Bronstein, Alex M., et al. “Facetoface: An Isometric Model for Facial Animation.” <i>4th International Conference on Articulated Motion and Deformable Objects</i>, vol. 4069, Springer Nature, 2006, pp. 38–47, doi:<a href=\"https://doi.org/10.1007/11789239_5\">10.1007/11789239_5</a>.","ieee":"A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Facetoface: An isometric model for facial animation,” in <i>4th International Conference on Articulated Motion and Deformable Objects</i>, Mallorca, Spain, 2006, vol. 4069, pp. 38–47.","short":"A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 4th International Conference on Articulated Motion and Deformable Objects, Springer Nature, 2006, pp. 38–47.","ista":"Bronstein AM, Bronstein MM, Kimmel R. 2006. Facetoface: An isometric model for facial animation. 4th International Conference on Articulated Motion and Deformable Objects. AMDO: Conference on Articulated Motion and Deformable Objects, LNIP, vol. 4069, 38–47.","apa":"Bronstein, A. M., Bronstein, M. M., &#38; Kimmel, R. (2006). Facetoface: An isometric model for facial animation. In <i>4th International Conference on Articulated Motion and Deformable Objects</i> (Vol. 4069, pp. 38–47). Mallorca, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/11789239_5\">https://doi.org/10.1007/11789239_5</a>","ama":"Bronstein AM, Bronstein MM, Kimmel R. Facetoface: An isometric model for facial animation. In: <i>4th International Conference on Articulated Motion and Deformable Objects</i>. Vol 4069. Springer Nature; 2006:38-47. doi:<a href=\"https://doi.org/10.1007/11789239_5\">10.1007/11789239_5</a>","chicago":"Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Facetoface: An Isometric Model for Facial Animation.” In <i>4th International Conference on Articulated Motion and Deformable Objects</i>, 4069:38–47. Springer Nature, 2006. <a href=\"https://doi.org/10.1007/11789239_5\">https://doi.org/10.1007/11789239_5</a>."},"publication":"4th International Conference on Articulated Motion and Deformable Objects","page":"38-47","volume":4069,"_id":"18322","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-22T06:42:42Z","scopus_import":"1","OA_type":"closed access","title":"Facetoface: An isometric model for facial animation","intvolume":"      4069","doi":"10.1007/11789239_5","language":[{"iso":"eng"}],"quality_controlled":"1","date_created":"2024-10-15T11:20:53Z","author":[{"first_name":"Alexander","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","full_name":"Bronstein, Alexander"},{"last_name":"Bronstein","full_name":"Bronstein, Michael M.","first_name":"Michael M."},{"first_name":"Ron","full_name":"Kimmel, Ron","last_name":"Kimmel"}],"alternative_title":["LNIP"],"fulldoi":"https://doi.org/10.1007/11789239_5","day":"18","extern":"1","oa_version":"None","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783540360315"],"issn":["0302-9743"],"eisbn":["9783540360322"]},"status":"public","date_published":"2006-07-18T00:00:00Z","publication_status":"published","type":"conference","month":"07","publisher":"Springer Nature","article_processing_charge":"No","year":"2006","abstract":[{"lang":"eng","text":"A geometric framework for finding intrinsic correspondence between animated 3D faces is presented. We model facial expressions as isometries of the facial surface and find the correspondence between two faces as the minimum-distortion mapping. Generalized multidimensional scaling is used for this goal. We apply our approach to texture mapping onto 3D video, expression exaggeration and morphing between faces."}],"conference":{"name":"AMDO: Conference on Articulated Motion and Deformable Objects","location":"Mallorca, Spain","start_date":"2006-07-11","end_date":"2006-07-14"}},{"date_created":"2024-10-15T11:20:53Z","quality_controlled":"1","intvolume":"      4069","language":[{"iso":"eng"}],"doi":"10.1007/11789239_6","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Matching two-dimensional articulated shapes using generalized multidimensional scaling","OA_type":"closed access","scopus_import":"1","date_updated":"2024-10-22T06:35:45Z","publication":"4th International Conference on Articulated Motion and Deformable Objects","citation":{"apa":"Bronstein, A. M., Bronstein, M. M., Bruckstein, A. M., &#38; Kimmel, R. (2006). Matching two-dimensional articulated shapes using generalized multidimensional scaling. In <i>4th International Conference on Articulated Motion and Deformable Objects</i> (Vol. 4069, pp. 48–57). Mallorca, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/11789239_6\">https://doi.org/10.1007/11789239_6</a>","chicago":"Bronstein, Alex M., Michael M. Bronstein, Alfred M. Bruckstein, and Ron Kimmel. “Matching Two-Dimensional Articulated Shapes Using Generalized Multidimensional Scaling.” In <i>4th International Conference on Articulated Motion and Deformable Objects</i>, 4069:48–57. Springer Nature, 2006. <a href=\"https://doi.org/10.1007/11789239_6\">https://doi.org/10.1007/11789239_6</a>.","ama":"Bronstein AM, Bronstein MM, Bruckstein AM, Kimmel R. Matching two-dimensional articulated shapes using generalized multidimensional scaling. In: <i>4th International Conference on Articulated Motion and Deformable Objects</i>. Vol 4069. Springer Nature; 2006:48-57. doi:<a href=\"https://doi.org/10.1007/11789239_6\">10.1007/11789239_6</a>","ieee":"A. M. Bronstein, M. M. Bronstein, A. M. Bruckstein, and R. Kimmel, “Matching two-dimensional articulated shapes using generalized multidimensional scaling,” in <i>4th International Conference on Articulated Motion and Deformable Objects</i>, Mallorca, Spain, 2006, vol. 4069, pp. 48–57.","mla":"Bronstein, Alex M., et al. “Matching Two-Dimensional Articulated Shapes Using Generalized Multidimensional Scaling.” <i>4th International Conference on Articulated Motion and Deformable Objects</i>, vol. 4069, Springer Nature, 2006, pp. 48–57, doi:<a href=\"https://doi.org/10.1007/11789239_6\">10.1007/11789239_6</a>.","ista":"Bronstein AM, Bronstein MM, Bruckstein AM, Kimmel R. 2006. Matching two-dimensional articulated shapes using generalized multidimensional scaling. 4th International Conference on Articulated Motion and Deformable Objects. AMDO: Conference on Articulated Motion and Deformable Objects, LNIP, vol. 4069, 48–57.","short":"A.M. Bronstein, M.M. Bronstein, A.M. Bruckstein, R. Kimmel, in:, 4th International Conference on Articulated Motion and Deformable Objects, Springer Nature, 2006, pp. 48–57."},"_id":"18323","volume":4069,"page":"48-57","month":"07","conference":{"start_date":"2006-07-11","end_date":"2006-07-14","location":"Mallorca, Spain","name":"AMDO: Conference on Articulated Motion and Deformable Objects"},"abstract":[{"lang":"eng","text":"We present a theoretical and computational framework for matching of two-dimensional articulated shapes. Assuming that articulations can be modeled as near-isometries, we show an axiomatic construction of an articulation-invariant distance between shapes, formulated as a generalized multidimensional scaling (GMDS) problem and solved efficiently. Some numerical results demonstrating the accuracy of our method are presented."}],"year":"2006","article_processing_charge":"No","publisher":"Springer Nature","publication_status":"published","date_published":"2006-07-18T00:00:00Z","status":"public","type":"conference","extern":"1","day":"18","publication_identifier":{"eisbn":["9783540360322"],"issn":["0302-9743"],"isbn":["9783540360315"],"eissn":["1611-3349"]},"oa_version":"None","alternative_title":["LNIP"],"author":[{"full_name":"Bronstein, Alexander","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","first_name":"Alexander"},{"last_name":"Bronstein","full_name":"Bronstein, Michael M.","first_name":"Michael M."},{"first_name":"Alfred M.","last_name":"Bruckstein","full_name":"Bruckstein, Alfred M."},{"full_name":"Kimmel, Ron","last_name":"Kimmel","first_name":"Ron"}],"fulldoi":"https://doi.org/10.1007/11789239_6"},{"intvolume":"       103","doi":"10.1073/pnas.0508601103","language":[{"iso":"eng"}],"quality_controlled":"1","date_created":"2024-10-15T11:20:54Z","issue":"5","external_id":{"pmid":["16432211"]},"pmid":1,"citation":{"ama":"Bronstein AM, Bronstein MM, Kimmel R. Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching. <i>PNAS</i>. 2006;103(5):1168-1172. doi:<a href=\"https://doi.org/10.1073/pnas.0508601103\">10.1073/pnas.0508601103</a>","chicago":"Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Generalized Multidimensional Scaling: A Framework for Isometry-Invariant Partial Surface Matching.” <i>PNAS</i>. National Academy of Sciences, 2006. <a href=\"https://doi.org/10.1073/pnas.0508601103\">https://doi.org/10.1073/pnas.0508601103</a>.","apa":"Bronstein, A. M., Bronstein, M. M., &#38; Kimmel, R. (2006). Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.0508601103\">https://doi.org/10.1073/pnas.0508601103</a>","short":"A.M. Bronstein, M.M. Bronstein, R. Kimmel, PNAS 103 (2006) 1168–1172.","ista":"Bronstein AM, Bronstein MM, Kimmel R. 2006. Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching. PNAS. 103(5), 1168–1172.","ieee":"A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching,” <i>PNAS</i>, vol. 103, no. 5. National Academy of Sciences, pp. 1168–1172, 2006.","mla":"Bronstein, Alex M., et al. “Generalized Multidimensional Scaling: A Framework for Isometry-Invariant Partial Surface Matching.” <i>PNAS</i>, vol. 103, no. 5, National Academy of Sciences, 2006, pp. 1168–72, doi:<a href=\"https://doi.org/10.1073/pnas.0508601103\">10.1073/pnas.0508601103</a>."},"publication":"PNAS","page":"1168-1172","volume":103,"_id":"18370","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-21T09:09:19Z","scopus_import":"1","title":"Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching","date_published":"2006-01-23T00:00:00Z","status":"public","publication_status":"published","type":"journal_article","month":"01","publisher":"National Academy of Sciences","article_processing_charge":"No","year":"2006","abstract":[{"text":"An efficient algorithm for isometry-invariant matching of surfaces is presented. The key idea is computing the minimum-distortion mapping between two surfaces. For this purpose, we introduce the generalized multidimensional scaling, a computationally efficient continuous optimization algorithm for finding the least distortion embedding of one surface into another. The generalized multidimensional scaling algorithm allows for both full and partial surface matching. As an example, it is applied to the problem of expression-invariant three-dimensional face recognition.","lang":"eng"}],"author":[{"last_name":"Bronstein","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730"},{"first_name":"Michael M.","last_name":"Bronstein","full_name":"Bronstein, Michael M."},{"first_name":"Ron","last_name":"Kimmel","full_name":"Kimmel, Ron"}],"article_type":"original","fulldoi":"https://doi.org/10.1073/pnas.0508601103","day":"23","extern":"1","oa_version":"None","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]}},{"quality_controlled":"1","date_created":"2024-10-15T11:20:54Z","issue":"1","external_id":{"pmid":["17283777"]},"pmid":1,"intvolume":"        16","doi":"10.1109/tip.2006.884940","language":[{"iso":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2024-10-18T12:04:51Z","scopus_import":"1","title":"Expression-invariant representations of faces","citation":{"mla":"Bronstein, Alex M., et al. “Expression-Invariant Representations of Faces.” <i>IEEE Transactions on Image Processing</i>, vol. 16, no. 1, Institute of Electrical and Electronics Engineers, 2006, pp. 188–97, doi:<a href=\"https://doi.org/10.1109/tip.2006.884940\">10.1109/tip.2006.884940</a>.","ieee":"A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Expression-invariant representations of faces,” <i>IEEE Transactions on Image Processing</i>, vol. 16, no. 1. Institute of Electrical and Electronics Engineers, pp. 188–197, 2006.","short":"A.M. Bronstein, M.M. Bronstein, R. Kimmel, IEEE Transactions on Image Processing 16 (2006) 188–197.","ista":"Bronstein AM, Bronstein MM, Kimmel R. 2006. Expression-invariant representations of faces. IEEE Transactions on Image Processing. 16(1), 188–197.","apa":"Bronstein, A. M., Bronstein, M. M., &#38; Kimmel, R. (2006). Expression-invariant representations of faces. <i>IEEE Transactions on Image Processing</i>. Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/tip.2006.884940\">https://doi.org/10.1109/tip.2006.884940</a>","ama":"Bronstein AM, Bronstein MM, Kimmel R. Expression-invariant representations of faces. <i>IEEE Transactions on Image Processing</i>. 2006;16(1):188-197. doi:<a href=\"https://doi.org/10.1109/tip.2006.884940\">10.1109/tip.2006.884940</a>","chicago":"Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Expression-Invariant Representations of Faces.” <i>IEEE Transactions on Image Processing</i>. Institute of Electrical and Electronics Engineers, 2006. <a href=\"https://doi.org/10.1109/tip.2006.884940\">https://doi.org/10.1109/tip.2006.884940</a>."},"publication":"IEEE Transactions on Image Processing","page":"188-197","_id":"18408","volume":16,"month":"12","publisher":"Institute of Electrical and Electronics Engineers","year":"2006","article_processing_charge":"No","abstract":[{"text":"Addressed here is the problem of constructing and analyzing expression-invariant representations of human faces. We demonstrate and justify experimentally a simple geometric model that allows to describe facial expressions as isometric deformations of the facial surface. The main step in the construction of expression-invariant representation of a face involves embedding of the facial intrinsic geometric structure into some low-dimensional space. We study the influence of the embedding space geometry and dimensionality choice on the representation accuracy and argue that compared to its Euclidean counterpart, spherical embedding leads to notably smaller metric distortions. We experimentally support our claim showing that a smaller embedding error leads to better recognition.","lang":"eng"}],"status":"public","date_published":"2006-12-16T00:00:00Z","publication_status":"published","type":"journal_article","day":"16","extern":"1","oa_version":"None","publication_identifier":{"issn":["1057-7149"]},"author":[{"last_name":"Bronstein","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730"},{"last_name":"Bronstein","full_name":"Bronstein, Michael M.","first_name":"Michael M."},{"first_name":"Ron","last_name":"Kimmel","full_name":"Kimmel, Ron"}],"article_type":"original","fulldoi":"https://doi.org/10.1109/tip.2006.884940"},{"extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","title":"Efficient computation of isometry-invariant distances between surfaces","publication_identifier":{"eissn":["1095-7197"],"issn":["1064-8275"]},"scopus_import":"1","oa_version":"None","date_updated":"2024-12-18T15:49:10Z","publication":"SIAM Journal on Scientific Computing","citation":{"apa":"Bronstein, A. M., Bronstein, M. M., &#38; Kimmel, R. (2006). Efficient computation of isometry-invariant distances between surfaces. <i>SIAM Journal on Scientific Computing</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/050639296\">https://doi.org/10.1137/050639296</a>","chicago":"Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Efficient Computation of Isometry-Invariant Distances between Surfaces.” <i>SIAM Journal on Scientific Computing</i>. Society for Industrial &#38; Applied Mathematics, 2006. <a href=\"https://doi.org/10.1137/050639296\">https://doi.org/10.1137/050639296</a>.","ama":"Bronstein AM, Bronstein MM, Kimmel R. Efficient computation of isometry-invariant distances between surfaces. <i>SIAM Journal on Scientific Computing</i>. 2006;28(5):1812-1836. doi:<a href=\"https://doi.org/10.1137/050639296\">10.1137/050639296</a>","mla":"Bronstein, Alex M., et al. “Efficient Computation of Isometry-Invariant Distances between Surfaces.” <i>SIAM Journal on Scientific Computing</i>, vol. 28, no. 5, Society for Industrial &#38; Applied Mathematics, 2006, pp. 1812–36, doi:<a href=\"https://doi.org/10.1137/050639296\">10.1137/050639296</a>.","ieee":"A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Efficient computation of isometry-invariant distances between surfaces,” <i>SIAM Journal on Scientific Computing</i>, vol. 28, no. 5. Society for Industrial &#38; Applied Mathematics, pp. 1812–1836, 2006.","ista":"Bronstein AM, Bronstein MM, Kimmel R. 2006. Efficient computation of isometry-invariant distances between surfaces. SIAM Journal on Scientific Computing. 28(5), 1812–1836.","short":"A.M. Bronstein, M.M. Bronstein, R. Kimmel, SIAM Journal on Scientific Computing 28 (2006) 1812–1836."},"author":[{"full_name":"Bronstein, Alexander","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","first_name":"Alexander"},{"last_name":"Bronstein","full_name":"Bronstein, Michael M.","first_name":"Michael M."},{"last_name":"Kimmel","full_name":"Kimmel, Ron","first_name":"Ron"}],"_id":"18429","volume":28,"page":"1812-1836","fulldoi":"https://doi.org/10.1137/050639296","date_created":"2024-10-15T11:20:55Z","month":"10","quality_controlled":"1","abstract":[{"text":"We present an efficient computational framework for isometry‐invariant comparison of smooth surfaces. We formulate the Gromov–Hausdorff distance as a multidimensional scaling–like continuous optimization problem. In order to construct an efficient optimization scheme, we develop a numerical tool for interpolating geodesic distances on a sampled surface from precomputed geodesic distances between the samples. For isometry‐invariant comparison of surfaces in the case of partially missing data, we present the partial embedding distance, which is computed using a similar scheme. The main idea is finding a minimum‐distortion mapping from one surface to another, while considering only relevant geodesic distances. We discuss numerical implementation issues and present experimental results that demonstrate its accuracy and efficiency.","lang":"eng"}],"article_processing_charge":"No","issue":"5","year":"2006","publisher":"Society for Industrial & Applied Mathematics","publication_status":"published","intvolume":"        28","status":"public","date_published":"2006-10-01T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1137/050639296","type":"journal_article"},{"page":"211-238","_id":"22076","volume":266,"citation":{"apa":"Goldberg, M., &#38; Vişan, M. (2006). A counterexample to dispersive estimates for Schrödinger operators in higher dimensions. <i>Communications in Mathematical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00220-006-0013-5\">https://doi.org/10.1007/s00220-006-0013-5</a>","ama":"Goldberg M, Vişan M. A counterexample to dispersive estimates for Schrödinger operators in higher dimensions. <i>Communications in Mathematical Physics</i>. 2006;266:211-238. doi:<a href=\"https://doi.org/10.1007/s00220-006-0013-5\">10.1007/s00220-006-0013-5</a>","chicago":"Goldberg, Michael, and Monica Vişan. “A Counterexample to Dispersive Estimates for Schrödinger Operators in Higher Dimensions.” <i>Communications in Mathematical Physics</i>. Springer Nature, 2006. <a href=\"https://doi.org/10.1007/s00220-006-0013-5\">https://doi.org/10.1007/s00220-006-0013-5</a>.","mla":"Goldberg, Michael, and Monica Vişan. “A Counterexample to Dispersive Estimates for Schrödinger Operators in Higher Dimensions.” <i>Communications in Mathematical Physics</i>, vol. 266, Springer Nature, 2006, pp. 211–38, doi:<a href=\"https://doi.org/10.1007/s00220-006-0013-5\">10.1007/s00220-006-0013-5</a>.","ieee":"M. Goldberg and M. Vişan, “A counterexample to dispersive estimates for Schrödinger operators in higher dimensions,” <i>Communications in Mathematical Physics</i>, vol. 266. Springer Nature, pp. 211–238, 2006.","short":"M. Goldberg, M. Vişan, Communications in Mathematical Physics 266 (2006) 211–238.","ista":"Goldberg M, Vişan M. 2006. A counterexample to dispersive estimates for Schrödinger operators in higher dimensions. Communications in Mathematical Physics. 266, 211–238."},"arxiv":1,"publication":"Communications in Mathematical Physics","scopus_import":"1","date_updated":"2026-06-30T11:26:34Z","OA_type":"green","title":"A counterexample to dispersive estimates for Schrödinger operators in higher dimensions","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.math/0508206","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/s00220-006-0013-5","language":[{"iso":"eng"}],"intvolume":"       266","external_id":{"arxiv":["math/0508206"]},"quality_controlled":"1","date_created":"2026-06-19T08:23:36Z","fulldoi":"https://doi.org/10.1007/s00220-006-0013-5","OA_place":"repository","author":[{"first_name":"Michael","full_name":"Goldberg, Michael","last_name":"Goldberg"},{"first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","full_name":"Visan, Monica","last_name":"Visan"}],"article_type":"original","oa_version":"Preprint","publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"das_tickbox":"1","extern":"1","day":"01","type":"journal_article","status":"public","date_published":"2006-08-01T00:00:00Z","publication_status":"published","article_processing_charge":"No","year":"2006","publisher":"Springer Nature","abstract":[{"text":"In dimension n > 3 we show the existence of a compactly supported potential in the differentiability class Cα, α < n-3/2, for which the solutions to the linear Schrödinger equation in ℝn, ∂tu = - Δ u + Vu, u(0)=f, fail to satisfy an evolution estimate of the form ||u(t, ̇)||∞ ≤ C |t| -n/2 ||u(0,\\̇)||1̇. This contrasts with known results in dimensions n ≤ 3, where a pointwise decay condition on V is generally sufficient to imply dispersive bounds. The obstructions in our example are generated by an expression with scaling law |t|-n+3/2+α, which becomes dominant in the time interval |t| ≪ 1.","lang":"eng"}],"month":"08"},{"intvolume":"      4144","doi":"10.1007/11817963_48","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:09:33Z","citation":{"apa":"Beyer, D., Henzinger, T. A., &#38; Théoduloz, G. (2006). Lazy shape analysis. In <i>Proceedings of the 18th international conference on Computer Aided Verification</i> (Vol. 4144, pp. 532–546). Seattle, WA, United States: Springer. <a href=\"https://doi.org/10.1007/11817963_48\">https://doi.org/10.1007/11817963_48</a>","ama":"Beyer D, Henzinger TA, Théoduloz G. Lazy shape analysis. In: <i>Proceedings of the 18th International Conference on Computer Aided Verification</i>. Vol 4144. Springer; 2006:532-546. doi:<a href=\"https://doi.org/10.1007/11817963_48\">10.1007/11817963_48</a>","chicago":"Beyer, Dirk, Thomas A Henzinger, and Grégory Théoduloz. “Lazy Shape Analysis.” In <i>Proceedings of the 18th International Conference on Computer Aided Verification</i>, 4144:532–46. Springer, 2006. <a href=\"https://doi.org/10.1007/11817963_48\">https://doi.org/10.1007/11817963_48</a>.","mla":"Beyer, Dirk, et al. “Lazy Shape Analysis.” <i>Proceedings of the 18th International Conference on Computer Aided Verification</i>, vol. 4144, Springer, 2006, pp. 532–46, doi:<a href=\"https://doi.org/10.1007/11817963_48\">10.1007/11817963_48</a>.","ieee":"D. Beyer, T. A. Henzinger, and G. Théoduloz, “Lazy shape analysis,” in <i>Proceedings of the 18th international conference on Computer Aided Verification</i>, Seattle, WA, United States, 2006, vol. 4144, pp. 532–546.","short":"D. Beyer, T.A. Henzinger, G. Théoduloz, in:, Proceedings of the 18th International Conference on Computer Aided Verification, Springer, 2006, pp. 532–546.","ista":"Beyer D, Henzinger TA, Théoduloz G. 2006. Lazy shape analysis. Proceedings of the 18th international conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 4144, 532–546."},"publication":"Proceedings of the 18th international conference on Computer Aided Verification","page":"532 - 546","_id":"4574","volume":4144,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-08-21T09:37:53Z","OA_type":"closed access","title":"Lazy shape analysis","date_published":"2006-08-08T00:00:00Z","status":"public","publication_status":"published","type":"conference","month":"08","publisher":"Springer","year":"2006","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is difficult to find adequate predicate abstractions for the heap. In contrast, shape analysis, which uses graph-based heap abstractions, can provide a compact representation of recursive data structures. We integrate shape analysis into the software model checker Blast. Because shape analysis is expensive, we do not apply it globally. Instead, we ensure that, like predicates, shape graphs are computed and stored locally, only where necessary for proving the verification goal. To achieve this, we extend lazy abstraction refinement, which so far has been used only for predicate abstractions, to three-valued logical structures. This approach does not only increase the precision of model checking, but it also increases the efficiency of shape analysis. We implemented the technique by extending Blast with calls to Tvla."}],"conference":{"location":"Seattle, WA, United States","end_date":"2006-08-20","start_date":"2006-08-17","name":"CAV: Computer Aided Verification"},"author":[{"last_name":"Beyer","full_name":"Beyer, Dirk","first_name":"Dirk"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Grégory","last_name":"Théoduloz","full_name":"Théoduloz, Grégory"}],"alternative_title":["LNCS"],"fulldoi":"https://doi.org/10.1007/11817963_48","publist_id":"133","day":"08","extern":"1","oa_version":"None","publication_identifier":{"eisbn":["9783540374114"],"isbn":["9783540374060"]}},{"publication":"Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems","citation":{"mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. “Finitary Winning in Omega-Regular Games.” <i>Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 3920, Springer, 2006, pp. 257–71, doi:<a href=\"https://doi.org/10.1007/11691372_17\">10.1007/11691372_17</a>.","ieee":"K. Chatterjee and T. A. Henzinger, “Finitary winning in omega-regular games,” in <i>Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Vienna, Austria, 2006, vol. 3920, pp. 257–271.","short":"K. Chatterjee, T.A. Henzinger, in:, Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2006, pp. 257–271.","ista":"Chatterjee K, Henzinger TA. 2006. Finitary winning in omega-regular games. Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 3920, 257–271.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (2006). Finitary winning in omega-regular games. In <i>Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 3920, pp. 257–271). Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/11691372_17\">https://doi.org/10.1007/11691372_17</a>","ama":"Chatterjee K, Henzinger TA. Finitary winning in omega-regular games. In: <i>Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 3920. Springer; 2006:257-271. doi:<a href=\"https://doi.org/10.1007/11691372_17\">10.1007/11691372_17</a>","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Finitary Winning in Omega-Regular Games.” In <i>Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 3920:257–71. Springer, 2006. <a href=\"https://doi.org/10.1007/11691372_17\">https://doi.org/10.1007/11691372_17</a>."},"_id":"4539","volume":3920,"page":"257 - 271","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","OA_type":"closed access","title":"Finitary winning in omega-regular games","date_updated":"2026-08-21T10:38:21Z","intvolume":"      3920","language":[{"iso":"eng"}],"doi":"10.1007/11691372_17","date_created":"2018-12-11T12:09:22Z","acknowledgement":"This research was supported in part by the AFOSR MURI grant F49620-00-1-0327 and the NSF ITR grant CCR-0225610.","alternative_title":["LNCS"],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"fulldoi":"https://doi.org/10.1007/11691372_17","day":"15","extern":"1","publist_id":"183","publication_identifier":{"isbn":["9783540330561"],"eisbn":["9783540330578"]},"oa_version":"None","publication_status":"published","status":"public","date_published":"2006-03-15T00:00:00Z","type":"conference","month":"03","abstract":[{"text":"Games on graphs with ω-regular objectives provide a model for the control and synthesis of reactive systems. Every ω-regular objective can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. While for one-shot liveness (reachability) objectives, classical and finitary liveness coincide, for repeated liveness (Büchi) objectives, the finitary formulation is strictly stronger. In this work we study games with finitary parity and Streett (fairness) objectives. We prove the determinacy of these games, present algorithms for solving these games, and characterize the memory requirements of winning strategies. Our algorithms can be used, for example, for synthesizing controllers that do not let the response time of a system increase without bound.","lang":"eng"}],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2006-03-25","end_date":"2006-04-02","location":"Vienna, Austria"},"publisher":"Springer","article_processing_charge":"No","year":"2006"},{"publication":"Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science","citation":{"chicago":"Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Markov Decision Processes with Multiple Objectives.” In <i>Proceedings of the 23rd Annual Conference on Theoretical Aspects of Computer Science</i>, 3884:325–36. Springer, 2006. <a href=\"https://doi.org/10.1007/11672142_26\">https://doi.org/10.1007/11672142_26</a>.","ama":"Chatterjee K, Majumdar R, Henzinger TA. Markov decision processes with multiple objectives. In: <i>Proceedings of the 23rd Annual Conference on Theoretical Aspects of Computer Science</i>. Vol 3884. Springer; 2006:325-336. doi:<a href=\"https://doi.org/10.1007/11672142_26\">10.1007/11672142_26</a>","apa":"Chatterjee, K., Majumdar, R., &#38; Henzinger, T. A. (2006). Markov decision processes with multiple objectives. In <i>Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science</i> (Vol. 3884, pp. 325–336). Marseille, France: Springer. <a href=\"https://doi.org/10.1007/11672142_26\">https://doi.org/10.1007/11672142_26</a>","ista":"Chatterjee K, Majumdar R, Henzinger TA. 2006. Markov decision processes with multiple objectives. Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 3884, 325–336.","short":"K. Chatterjee, R. Majumdar, T.A. Henzinger, in:, Proceedings of the 23rd Annual Conference on Theoretical Aspects of Computer Science, Springer, 2006, pp. 325–336.","ieee":"K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Markov decision processes with multiple objectives,” in <i>Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science</i>, Marseille, France, 2006, vol. 3884, pp. 325–336.","mla":"Chatterjee, Krishnendu, et al. “Markov Decision Processes with Multiple Objectives.” <i>Proceedings of the 23rd Annual Conference on Theoretical Aspects of Computer Science</i>, vol. 3884, Springer, 2006, pp. 325–36, doi:<a href=\"https://doi.org/10.1007/11672142_26\">10.1007/11672142_26</a>."},"volume":3884,"_id":"4551","page":"325 - 336","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Markov decision processes with multiple objectives","OA_type":"closed access","date_updated":"2026-08-21T09:46:06Z","intvolume":"      3884","language":[{"iso":"eng"}],"doi":"10.1007/11672142_26","date_created":"2018-12-11T12:09:26Z","acknowledgement":"This research was supported in part by the AFOSR MURI grant F49620-00-1-0327, and the NSF grants CCR-0225610, CCR-0234690, and CCR-0427202.","alternative_title":["LNCS"],"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ritankar","full_name":"Majumdar, Ritankar","last_name":"Majumdar"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"fulldoi":"https://doi.org/10.1007/11672142_26","extern":"1","day":"14","publist_id":"161","publication_identifier":{"isbn":["9783540323013"],"issn":["0302-9743"],"eisbn":["9783540322887"]},"oa_version":"None","publication_status":"published","status":"public","date_published":"2006-02-14T00:00:00Z","type":"conference","month":"02","conference":{"name":"STACS: Theoretical Aspects of Computer Science","location":"Marseille, France","end_date":"2006-02-25","start_date":"2006-02-23"},"abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple discounted reward objectives. Such MDPs occur in design problems where one wishes to simultaneously optimize several criteria, for example, latency and power. The possible trade-offs between the different objectives are characterized by the Pareto curve. We show that every Pareto-optimal point can be achieved by a memoryless strategy; however, unlike in the single-objective case, the memoryless strategy may require randomization. Moreover, we show that the Pareto curve can be approximated in polynomial time in the size of the MDP. Additionally, we study the problem if a given value vector is realizable by any strategy, and show that it can be decided in polynomial time; but the question whether it is realizable by a deterministic memoryless strategy is NP-complete. These results provide efficient algorithms for design exploration in MDP models with multiple objectives.\r\nThis research was supported in part by the AFOSR MURI grant F49620-00-1-0327, and the NSF grants CCR-0225610, CCR-0234690, and CCR-0427202. ","lang":"eng"}],"article_processing_charge":"No","year":"2006","publisher":"Springer"},{"publication_status":"published","status":"public","date_published":"2006-02-14T00:00:00Z","type":"conference","month":"02","abstract":[{"text":"A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with ω-regular winning conditions specified as parity objectives. These games lie in NP ∩ coNP. We present a strategy improvement algorithm for stochastic parity games; this is the first non-brute-force algorithm for solving these games. From the strategy improvement algorithm we obtain a randomized subexponential-time algorithm to solve such games.","lang":"eng"}],"conference":{"name":"STACS: Theoretical Aspects of Computer Science","start_date":"2006-02-23","end_date":"2006-02-25","location":"Marseille, France"},"publisher":"Springer","article_processing_charge":"No","year":"2006","alternative_title":["LNCS"],"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"fulldoi":"https://doi.org/10.1007/11672142_42","day":"14","extern":"1","publist_id":"184","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783540323013"],"eisbn":["9783540322887"],"issn":["0302-9743"]},"oa_version":"None","intvolume":"      3884","language":[{"iso":"eng"}],"doi":"10.1007/11672142_42","date_created":"2018-12-11T12:09:22Z","publication":"Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science","citation":{"mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. “Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games.” <i>Proceedings of the 23rd Annual Conference on Theoretical Aspects of Computer Science</i>, vol. 3884, Springer, 2006, pp. 512–23, doi:<a href=\"https://doi.org/10.1007/11672142_42\">10.1007/11672142_42</a>.","ieee":"K. Chatterjee and T. A. Henzinger, “Strategy improvement and randomized subexponential algorithms for stochastic parity games,” in <i>Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science</i>, Marseille, France, 2006, vol. 3884, pp. 512–523.","short":"K. Chatterjee, T.A. Henzinger, in:, Proceedings of the 23rd Annual Conference on Theoretical Aspects of Computer Science, Springer, 2006, pp. 512–523.","ista":"Chatterjee K, Henzinger TA. 2006. Strategy improvement and randomized subexponential algorithms for stochastic parity games. Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 3884, 512–523.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (2006). Strategy improvement and randomized subexponential algorithms for stochastic parity games. In <i>Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science</i> (Vol. 3884, pp. 512–523). Marseille, France: Springer. <a href=\"https://doi.org/10.1007/11672142_42\">https://doi.org/10.1007/11672142_42</a>","ama":"Chatterjee K, Henzinger TA. Strategy improvement and randomized subexponential algorithms for stochastic parity games. In: <i>Proceedings of the 23rd Annual Conference on Theoretical Aspects of Computer Science</i>. Vol 3884. Springer; 2006:512-523. doi:<a href=\"https://doi.org/10.1007/11672142_42\">10.1007/11672142_42</a>","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games.” In <i>Proceedings of the 23rd Annual Conference on Theoretical Aspects of Computer Science</i>, 3884:512–23. Springer, 2006. <a href=\"https://doi.org/10.1007/11672142_42\">https://doi.org/10.1007/11672142_42</a>."},"volume":3884,"_id":"4538","page":"512 - 523","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Strategy improvement and randomized subexponential algorithms for stochastic parity games","OA_type":"closed access","date_updated":"2026-08-21T10:42:04Z"},{"oa_version":"None","date_updated":"2026-08-21T09:55:30Z","OA_type":"closed access","title":"Compositional quantitative reasoning","publication_identifier":{"isbn":["0769526659"]},"publist_id":"163","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","extern":"1","fulldoi":"https://doi.org/10.1109/QEST.2006.11","page":"179 - 188","_id":"4549","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"De Alfaro","full_name":"De Alfaro, Luca","first_name":"Luca"},{"full_name":"Faella, Marco","last_name":"Faella","first_name":"Marco"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"},{"first_name":"Mariëlle","last_name":"Stoelinga","full_name":"Stoelinga, Mariëlle"}],"citation":{"apa":"Chatterjee, K., De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., &#38; Stoelinga, M. (2006). Compositional quantitative reasoning. In <i>Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems</i> (pp. 179–188). Riverside, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/QEST.2006.11\">https://doi.org/10.1109/QEST.2006.11</a>","ama":"Chatterjee K, De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. Compositional quantitative reasoning. In: <i>Proceedings of the 3rd International Conference on the Quantitative Evaluation of Systems</i>. IEEE; 2006:179-188. doi:<a href=\"https://doi.org/10.1109/QEST.2006.11\">10.1109/QEST.2006.11</a>","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, Thomas A Henzinger, Ritankar Majumdar, and Mariëlle Stoelinga. “Compositional Quantitative Reasoning.” In <i>Proceedings of the 3rd International Conference on the Quantitative Evaluation of Systems</i>, 179–88. IEEE, 2006. <a href=\"https://doi.org/10.1109/QEST.2006.11\">https://doi.org/10.1109/QEST.2006.11</a>.","ieee":"K. Chatterjee, L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “Compositional quantitative reasoning,” in <i>Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems</i>, Riverside, CA, United States, 2006, pp. 179–188.","mla":"Chatterjee, Krishnendu, et al. “Compositional Quantitative Reasoning.” <i>Proceedings of the 3rd International Conference on the Quantitative Evaluation of Systems</i>, IEEE, 2006, pp. 179–88, doi:<a href=\"https://doi.org/10.1109/QEST.2006.11\">10.1109/QEST.2006.11</a>.","short":"K. Chatterjee, L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, in:, Proceedings of the 3rd International Conference on the Quantitative Evaluation of Systems, IEEE, 2006, pp. 179–188.","ista":"Chatterjee K, De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. 2006. Compositional quantitative reasoning. Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems. QEST: Quantitative Evaluation of Systems, 179–188."},"publication":"Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems","publisher":"IEEE","year":"2006","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We present a compositional theory of system verification, where specifications assign real-numbered costs to systems. These costs can express a wide variety of quantitative system properties, such as resource consumption, price, or a measure of how well a system satisfies its specification. The theory supports the composition of systems and specifications, and the hiding of variables. Boolean refinement relations are replaced by real-numbered distances between descriptions of a system at different levels of detail. We show that the classical Boolean rules for compositional reasoning have quantitative counterparts in our setting. While our general theory allows costs to be specified by arbitrary cost functions, we also consider a class of linear cost functions, which give rise to an instance of our framework where all operations are computable in polynomial time."}],"conference":{"location":"Riverside, CA, United States","start_date":"2006-09-11","end_date":"2006-09-14","name":"QEST: Quantitative Evaluation of Systems"},"month":"09","acknowledgement":"Supported in part by the NSF grants CCR-0234690, CCR-0208875, and CCR-0225610; by the NSF grant CCR-0132780 and ARP grant SC20051123.","date_created":"2018-12-11T12:09:26Z","type":"conference","doi":"10.1109/QEST.2006.11","language":[{"iso":"eng"}],"date_published":"2006-09-01T00:00:00Z","status":"public","publication_status":"published"}]