[{"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A subquadratic-time algorithm for decremental single-source shortest paths","publication":"25th Annual ACM-SIAM Symposium on Discrete Algorithms","language":[{"iso":"eng"}],"extern":"1","main_file_link":[{"url":"https://doi.org/10.1137/1.9781611973402.79","open_access":"1"}],"date_updated":"2024-11-06T12:21:22Z","abstract":[{"text":"We study dynamic (1 + ∊)-approximation algorithms for the single-source shortest paths problem in an unweighted undirected n-node m-edge graph under edge deletions. The fastest algorithm for this problem is an algorithm with O(n2+o(1)) total update time and constant query time by Bernstein and Roditty (SODA 2011). In this paper, we improve the total update time to O(n1.8+o(1) + m1+o(1)) while keeping the query time constant. This running time is essentially tight when m = Ω(n1.8) since we need Ω(m) time even in the static setting. For smaller values of m, the running time of our algorithm is subquadratic, and is the first that breaks through the quadratic time barrier.\r\n\r\nIn obtaining this result, we develop a fast algorithm for what we call center cover data structure. We also make non-trivial extensions to our previous techniques called lazy-update and monotone Even-Shiloach trees (ICALP 2013 and FOCS 2013). As by-products of our new techniques, we obtain two new results for the decremental all-pairs shortest-paths problem. Our first result is the first approximation algorithm whose total update time is faster than Õ(mn) for all values of m. Our second result is a new trade-off between the total update time and the additive approximation guarantee.","lang":"eng"}],"author":[{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"}],"conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Portland, OR, United States","end_date":"2014-01-07","start_date":"2014-01-05"},"type":"conference","publisher":"Society for Industrial and Applied Mathematics","month":"01","scopus_import":"1","_id":"11876","oa_version":"Published Version","day":"01","citation":{"chicago":"Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.” In <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1053–72. Society for Industrial and Applied Mathematics, 2014. <a href=\"https://doi.org/10.1137/1.9781611973402.79\">https://doi.org/10.1137/1.9781611973402.79</a>.","mla":"Henzinger, Monika, et al. “A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.” <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2014, pp. 1053–72, doi:<a href=\"https://doi.org/10.1137/1.9781611973402.79\">10.1137/1.9781611973402.79</a>.","short":"M. Henzinger, S. Krinninger, D. Nanongkai, in:, 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 1053–1072.","ieee":"M. Henzinger, S. Krinninger, and D. Nanongkai, “A subquadratic-time algorithm for decremental single-source shortest paths,” in <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Portland, OR, United States, 2014, pp. 1053–1072.","apa":"Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2014). A subquadratic-time algorithm for decremental single-source shortest paths. In <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1053–1072). Portland, OR, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973402.79\">https://doi.org/10.1137/1.9781611973402.79</a>","ista":"Henzinger M, Krinninger S, Nanongkai D. 2014. A subquadratic-time algorithm for decremental single-source shortest paths. 25th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1053–1072.","ama":"Henzinger M, Krinninger S, Nanongkai D. A subquadratic-time algorithm for decremental single-source shortest paths. In: <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2014:1053-1072. doi:<a href=\"https://doi.org/10.1137/1.9781611973402.79\">10.1137/1.9781611973402.79</a>"},"page":"1053-1072","date_published":"2014-01-01T00:00:00Z","oa":1,"status":"public","quality_controlled":"1","doi":"10.1137/1.9781611973402.79","publication_identifier":{"eisbn":["978-1-61197-340-2"],"isbn":["978-1-61197-338-9"]},"fulldoi":"https://doi.org/10.1137/1.9781611973402.79","article_processing_charge":"No","year":"2014","date_created":"2022-08-16T12:58:31Z"},{"year":"2014","date_created":"2018-12-11T11:44:44Z","acknowledgement":"This work was supported by the NSF through DMR-1309611. Access to the shared experimental facilities provided by the NSF-supported Chicago MRSEC (DMR-0820054) is gratefully acknowledged. S. L. F. and J. L. P. acknowledge funding from UIC NSF Grants No. 0850830 and No. 0602308. S. R. W. acknowledges support from a University of Chicago Millikan Fellowship and from Mrs. Joan Winstein through the Winstein Prize for Instrumentation.","oa":1,"external_id":{"arxiv":["1309.2578"]},"arxiv":1,"publist_id":"7935","article_number":"218001","day":"30","citation":{"ama":"Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. Size-dependent same-material tribocharging in insulating grains. <i>APS Physics, Physical Review Letters</i>. 2014;112(21). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">10.1103/PhysRevLett.112.218001</a>","mla":"Waitukaitis, Scott R., et al. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” <i>APS Physics, Physical Review Letters</i>, vol. 112, no. 21, 218001, American Physical Society, 2014, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">10.1103/PhysRevLett.112.218001</a>.","short":"S.R. Waitukaitis, V. Lee, J. Pierson, S. Forman, H. Jaeger, APS Physics, Physical Review Letters 112 (2014).","chicago":"Waitukaitis, Scott R, Victor Lee, James Pierson, Steven Forman, and Heinrich Jaeger. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” <i>APS Physics, Physical Review Letters</i>. American Physical Society, 2014. <a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">https://doi.org/10.1103/PhysRevLett.112.218001</a>.","ista":"Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. 2014. Size-dependent same-material tribocharging in insulating grains. APS Physics, Physical Review Letters. 112(21), 218001.","apa":"Waitukaitis, S. R., Lee, V., Pierson, J., Forman, S., &#38; Jaeger, H. (2014). Size-dependent same-material tribocharging in insulating grains. <i>APS Physics, Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">https://doi.org/10.1103/PhysRevLett.112.218001</a>","ieee":"S. R. Waitukaitis, V. Lee, J. Pierson, S. Forman, and H. Jaeger, “Size-dependent same-material tribocharging in insulating grains,” <i>APS Physics, Physical Review Letters</i>, vol. 112, no. 21. American Physical Society, 2014."},"intvolume":"       112","volume":112,"title":"Size-dependent same-material tribocharging in insulating grains","date_updated":"2021-01-12T06:48:58Z","extern":"1","abstract":[{"lang":"eng","text":"Observations of flowing granular matter have suggested that same-material tribocharging depends on particle size, typically rendering large grains positive and small ones negative. Models assuming the transfer of trapped electrons can account for this trend, but have not been validated. Tracking individual grains in an electric field, we show quantitatively that charge is transferred based on size between materially identical grains. However, the surface density of trapped electrons, measured independently by thermoluminescence techniques, is orders of magnitude too small to account for the scale of charge transferred. This reveals that trapped electrons are not a necessary ingredient for same-material tribocharging."}],"author":[{"full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","first_name":"Scott R","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lee, Victor","first_name":"Victor","last_name":"Lee"},{"full_name":"Pierson, James","last_name":"Pierson","first_name":"James"},{"full_name":"Forman, Steven","first_name":"Steven","last_name":"Forman"},{"full_name":"Jaeger, Heinrich","last_name":"Jaeger","first_name":"Heinrich"}],"quality_controlled":"1","doi":"10.1103/PhysRevLett.112.218001","fulldoi":"https://doi.org/10.1103/PhysRevLett.112.218001","date_published":"2014-05-30T00:00:00Z","issue":"21","status":"public","month":"05","oa_version":"Submitted Version","_id":"119","language":[{"iso":"eng"}],"publication":"APS Physics, Physical Review Letters","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1309.2578"}],"publisher":"American Physical Society","type":"journal_article"},{"author":[{"full_name":"Moghaddam, Mojtaba Mirhosseini","first_name":"Mojtaba Mirhosseini","last_name":"Moghaddam"},{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"},{"first_name":"Toma","last_name":"Glasnov","full_name":"Glasnov, Toma"},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"}],"abstract":[{"text":"An experimentally easy to perform method for the generation of alumina-supported Fe3O4 nanoparticles [(6±1) nm size, 0.67 wt %]and the use of this material in hydrazine-mediated heterogeneously catalyzed reductions of nitroarenes to anilines under batch and continuous-flow conditions is presented. The bench-stable, reusable nano-Fe3O4@Al2O3 catalyst can selectively reduce functionalized nitroarenes at 1 mol % catalyst loading by using a 20 mol % excess of hydrazine hydrate in an elevated temperature regime (150 °C, reaction time 2–6 min in batch). For continuous-flow processing, the catalyst material is packed into dedicated cartridges and used in a commercially available high-temperature/-pressure flow device. In continuous mode, reaction times can be reduced to less than 1 min at 150 °C (30 bar back pressure) in a highly intensified process. The nano-Fe3O4@Al2O3 catalyst demonstrated stable reduction of nitrobenzene (0.5 M in MeOH) for more than 10 h on stream at a productivity of 30 mmol h−1 (0.72 mol per day). Importantly, virtually no leaching of the catalytically active material could be observed by inductively coupled plasma MS monitoring.","lang":"eng"}],"title":"Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow","date_updated":"2023-02-21T10:09:42Z","extern":"1","day":"01","intvolume":"         7","citation":{"ama":"Moghaddam MM, Pieber B, Glasnov T, Kappe CO. Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. <i>ChemSusChem</i>. 2014;7(11):3122-3131. doi:<a href=\"https://doi.org/10.1002/cssc.201402455\">10.1002/cssc.201402455</a>","short":"M.M. Moghaddam, B. Pieber, T. Glasnov, C.O. Kappe, ChemSusChem 7 (2014) 3122–3131.","mla":"Moghaddam, Mojtaba Mirhosseini, et al. “Immobilized Iron Oxide Nanoparticles as Stable and Reusable Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous Flow.” <i>ChemSusChem</i>, vol. 7, no. 11, Wiley, 2014, pp. 3122–31, doi:<a href=\"https://doi.org/10.1002/cssc.201402455\">10.1002/cssc.201402455</a>.","chicago":"Moghaddam, Mojtaba Mirhosseini, Bartholomäus Pieber, Toma Glasnov, and C. Oliver Kappe. “Immobilized Iron Oxide Nanoparticles as Stable and Reusable Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous Flow.” <i>ChemSusChem</i>. Wiley, 2014. <a href=\"https://doi.org/10.1002/cssc.201402455\">https://doi.org/10.1002/cssc.201402455</a>.","ista":"Moghaddam MM, Pieber B, Glasnov T, Kappe CO. 2014. Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. ChemSusChem. 7(11), 3122–3131.","apa":"Moghaddam, M. M., Pieber, B., Glasnov, T., &#38; Kappe, C. O. (2014). Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. <i>ChemSusChem</i>. Wiley. <a href=\"https://doi.org/10.1002/cssc.201402455\">https://doi.org/10.1002/cssc.201402455</a>","ieee":"M. M. Moghaddam, B. Pieber, T. Glasnov, and C. O. Kappe, “Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow,” <i>ChemSusChem</i>, vol. 7, no. 11. Wiley, pp. 3122–3131, 2014."},"volume":7,"article_type":"original","external_id":{"pmid":["25209099"]},"article_processing_charge":"No","date_created":"2022-08-25T08:36:54Z","year":"2014","publisher":"Wiley","type":"journal_article","language":[{"iso":"eng"}],"publication":"ChemSusChem","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"3122-3131","month":"11","_id":"11967","oa_version":"None","scopus_import":"1","pmid":1,"status":"public","issue":"11","date_published":"2014-11-01T00:00:00Z","fulldoi":"https://doi.org/10.1002/cssc.201402455","quality_controlled":"1","publication_identifier":{"issn":["1864-5631"],"eissn":["1864-564X"]},"doi":"10.1002/cssc.201402455"},{"month":"06","_id":"11968","oa_version":"Published Version","scopus_import":"1","page":"P729-739","language":[{"iso":"eng"}],"publication":"Developmental Cell","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.devcel.2014.04.025"}],"publisher":"Elsevier","type":"journal_article","quality_controlled":"1","doi":"10.1016/j.devcel.2014.04.025","publication_identifier":{"issn":["1534-5807"],"eissn":["1878-1551"]},"fulldoi":"https://doi.org/10.1016/j.devcel.2014.04.025","date_published":"2014-06-23T00:00:00Z","pmid":1,"status":"public","issue":"6","day":"23","intvolume":"        29","citation":{"ama":"Hofbauer HF, Schopf FH, Schleifer H, et al. Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. <i>Developmental Cell</i>. 2014;29(6):P729-739. doi:<a href=\"https://doi.org/10.1016/j.devcel.2014.04.025\">10.1016/j.devcel.2014.04.025</a>","short":"H.F. Hofbauer, F.H. Schopf, H. Schleifer, O.L. Knittelfelder, B. Pieber, G.N. Rechberger, H. Wolinski, M.L. Gaspar, C.O. Kappe, J. Stadlmann, K. Mechtler, A. Zenz, K. Lohner, O. Tehlivets, S.A. Henry, S.D. Kohlwein, Developmental Cell 29 (2014) P729-739.","mla":"Hofbauer, Harald F., et al. “Regulation of Gene Expression through a Transcriptional Repressor That Senses Acyl-Chain Length in Membrane Phospholipids.” <i>Developmental Cell</i>, vol. 29, no. 6, Elsevier, 2014, pp. P729-739, doi:<a href=\"https://doi.org/10.1016/j.devcel.2014.04.025\">10.1016/j.devcel.2014.04.025</a>.","chicago":"Hofbauer, Harald F., Florian H. Schopf, Hannes Schleifer, Oskar L. Knittelfelder, Bartholomäus Pieber, Gerald N. Rechberger, Heimo Wolinski, et al. “Regulation of Gene Expression through a Transcriptional Repressor That Senses Acyl-Chain Length in Membrane Phospholipids.” <i>Developmental Cell</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.devcel.2014.04.025\">https://doi.org/10.1016/j.devcel.2014.04.025</a>.","ista":"Hofbauer HF, Schopf FH, Schleifer H, Knittelfelder OL, Pieber B, Rechberger GN, Wolinski H, Gaspar ML, Kappe CO, Stadlmann J, Mechtler K, Zenz A, Lohner K, Tehlivets O, Henry SA, Kohlwein SD. 2014. Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. Developmental Cell. 29(6), P729-739.","apa":"Hofbauer, H. F., Schopf, F. H., Schleifer, H., Knittelfelder, O. L., Pieber, B., Rechberger, G. N., … Kohlwein, S. D. (2014). Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2014.04.025\">https://doi.org/10.1016/j.devcel.2014.04.025</a>","ieee":"H. F. Hofbauer <i>et al.</i>, “Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids,” <i>Developmental Cell</i>, vol. 29, no. 6. Elsevier, pp. P729-739, 2014."},"volume":29,"title":"Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids","date_updated":"2023-02-21T10:09:45Z","extern":"1","abstract":[{"text":"Membrane phospholipids typically contain fatty acids (FAs) of 16 and 18 carbon atoms. This particular chain length is evolutionarily highly conserved and presumably provides maximum stability and dynamic properties to biological membranes in response to nutritional or environmental cues. Here, we show that the relative proportion of C16 versus C18 FAs is regulated by the activity of acetyl-CoA carboxylase (Acc1), the first and rate-limiting enzyme of FA de novo synthesis. Acc1 activity is attenuated by AMPK/Snf1-dependent phosphorylation, which is required to maintain an appropriate acyl-chain length distribution. Moreover, we find that the transcriptional repressor Opi1 preferentially binds to C16 over C18 phosphatidic acid (PA) species: thus, C16-chain containing PA sequesters Opi1 more effectively to the ER, enabling AMPK/Snf1 control of PA acyl-chain length to determine the degree of derepression of Opi1 target genes. These findings reveal an unexpected regulatory link between the major energy-sensing kinase, membrane lipid composition, and transcription.","lang":"eng"}],"author":[{"last_name":"Hofbauer","first_name":"Harald F.","full_name":"Hofbauer, Harald F."},{"first_name":"Florian H.","last_name":"Schopf","full_name":"Schopf, Florian H."},{"last_name":"Schleifer","first_name":"Hannes","full_name":"Schleifer, Hannes"},{"first_name":"Oskar L.","last_name":"Knittelfelder","full_name":"Knittelfelder, Oskar L."},{"first_name":"Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"},{"full_name":"Rechberger, Gerald N.","last_name":"Rechberger","first_name":"Gerald N."},{"full_name":"Wolinski, Heimo","first_name":"Heimo","last_name":"Wolinski"},{"last_name":"Gaspar","first_name":"Maria L.","full_name":"Gaspar, Maria L."},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"},{"last_name":"Stadlmann","first_name":"Johannes","full_name":"Stadlmann, Johannes"},{"first_name":"Karl","last_name":"Mechtler","full_name":"Mechtler, Karl"},{"full_name":"Zenz, Alexandra","last_name":"Zenz","first_name":"Alexandra"},{"last_name":"Lohner","first_name":"Karl","full_name":"Lohner, Karl"},{"full_name":"Tehlivets, Oksana","first_name":"Oksana","last_name":"Tehlivets"},{"full_name":"Henry, Susan A.","first_name":"Susan A.","last_name":"Henry"},{"full_name":"Kohlwein, Sepp D.","first_name":"Sepp D.","last_name":"Kohlwein"}],"article_processing_charge":"No","date_created":"2022-08-25T08:42:42Z","year":"2014","oa":1,"external_id":{"pmid":["24960695"]},"article_type":"original"},{"publisher":"Royal Society of Chemistry","type":"journal_article","publication":"RSC Advances","language":[{"iso":"eng"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11987","oa_version":"None","scopus_import":"1","month":"03","issue":"26","status":"public","date_published":"2014-03-03T00:00:00Z","fulldoi":"https://doi.org/10.1039/c4ra01442a","doi":"10.1039/c4ra01442a","publication_identifier":{"eissn":["2046-2069"]},"quality_controlled":"1","abstract":[{"text":"A method for the direct lithiation of terminal alkynes and heterocycles with subsequent carboxylation in a continuous flow format was developed. This method provides carboxylic acids at ambient conditions within less than five seconds with only little excess of the organometallic base and CO2.","lang":"eng"}],"author":[{"orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus","first_name":"Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726"},{"full_name":"Glasnov, Toma","last_name":"Glasnov","first_name":"Toma"},{"first_name":"C. O.","last_name":"Kappe","full_name":"Kappe, C. O."}],"date_updated":"2023-02-21T10:10:31Z","extern":"1","title":"Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow","citation":{"apa":"Pieber, B., Glasnov, T., &#38; Kappe, C. O. (2014). Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow. <i>RSC Advances</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/c4ra01442a\">https://doi.org/10.1039/c4ra01442a</a>","ieee":"B. Pieber, T. Glasnov, and C. O. Kappe, “Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow,” <i>RSC Advances</i>, vol. 4, no. 26. Royal Society of Chemistry, 2014.","ista":"Pieber B, Glasnov T, Kappe CO. 2014. Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow. RSC Advances. 4(26), 13430.","chicago":"Pieber, Bartholomäus, Toma Glasnov, and C. O. Kappe. “Flash Carboxylation: Fast Lithiation–Carboxylation Sequence at Room Temperature in Continuous Flow.” <i>RSC Advances</i>. Royal Society of Chemistry, 2014. <a href=\"https://doi.org/10.1039/c4ra01442a\">https://doi.org/10.1039/c4ra01442a</a>.","short":"B. Pieber, T. Glasnov, C.O. Kappe, RSC Advances 4 (2014).","mla":"Pieber, Bartholomäus, et al. “Flash Carboxylation: Fast Lithiation–Carboxylation Sequence at Room Temperature in Continuous Flow.” <i>RSC Advances</i>, vol. 4, no. 26, 13430, Royal Society of Chemistry, 2014, doi:<a href=\"https://doi.org/10.1039/c4ra01442a\">10.1039/c4ra01442a</a>.","ama":"Pieber B, Glasnov T, Kappe CO. Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow. <i>RSC Advances</i>. 2014;4(26). doi:<a href=\"https://doi.org/10.1039/c4ra01442a\">10.1039/c4ra01442a</a>"},"intvolume":"         4","volume":4,"day":"03","article_number":"13430","article_type":"letter_note","year":"2014","date_created":"2022-08-25T11:48:19Z","article_processing_charge":"No"},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1203.4886","open_access":"1"}],"language":[{"iso":"eng"}],"publication":"Mathematische Annalen","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"Springer Nature","type":"journal_article","oa_version":"Preprint","_id":"22031","scopus_import":"1","month":"02","page":"289-350","das_tickbox":"1","date_published":"2014-02-01T00:00:00Z","status":"public","issue":"1-2","doi":"10.1007/s00208-013-0960-z","publication_identifier":{"eissn":["1432-1807"],"issn":["0025-5831"]},"quality_controlled":"1","OA_place":"repository","OA_type":"green","fulldoi":"https://doi.org/10.1007/s00208-013-0960-z","date_updated":"2026-06-22T11:16:03Z","extern":"1","title":"Blowup behaviour for the nonlinear Klein-Gordon equation","author":[{"full_name":"Killip, Rowan","last_name":"Killip","first_name":"Rowan"},{"full_name":"Stovall, Betsy","last_name":"Stovall","first_name":"Betsy"},{"full_name":"Visan, Monica","last_name":"Visan","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","first_name":"Monica"}],"abstract":[{"text":"We analyze the blowup behaviour of solutions to the focusing nonlinear Klein–Gordon equation in spatial dimensions d>=2. We obtain upper bounds on the blowup rate, both globally in space and in light cones. The results are sharp in the conformal and sub-conformal cases. The argument relies on Lyapunov functionals derived from the dilation identity. We also prove that the critical Sobolev norm diverges near the blowup time.","lang":"eng"}],"arxiv":1,"intvolume":"       358","citation":{"mla":"Killip, Rowan, et al. “Blowup Behaviour for the Nonlinear Klein-Gordon Equation.” <i>Mathematische Annalen</i>, vol. 358, no. 1–2, Springer Nature, 2014, pp. 289–350, doi:<a href=\"https://doi.org/10.1007/s00208-013-0960-z\">10.1007/s00208-013-0960-z</a>.","short":"R. Killip, B. Stovall, M. Vişan, Mathematische Annalen 358 (2014) 289–350.","chicago":"Killip, Rowan, Betsy Stovall, and Monica Vişan. “Blowup Behaviour for the Nonlinear Klein-Gordon Equation.” <i>Mathematische Annalen</i>. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/s00208-013-0960-z\">https://doi.org/10.1007/s00208-013-0960-z</a>.","ista":"Killip R, Stovall B, Vişan M. 2014. Blowup behaviour for the nonlinear Klein-Gordon equation. Mathematische Annalen. 358(1–2), 289–350.","apa":"Killip, R., Stovall, B., &#38; Vişan, M. (2014). Blowup behaviour for the nonlinear Klein-Gordon equation. <i>Mathematische Annalen</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00208-013-0960-z\">https://doi.org/10.1007/s00208-013-0960-z</a>","ieee":"R. Killip, B. Stovall, and M. Vişan, “Blowup behaviour for the nonlinear Klein-Gordon equation,” <i>Mathematische Annalen</i>, vol. 358, no. 1–2. Springer Nature, pp. 289–350, 2014.","ama":"Killip R, Stovall B, Vişan M. Blowup behaviour for the nonlinear Klein-Gordon equation. <i>Mathematische Annalen</i>. 2014;358(1-2):289-350. doi:<a href=\"https://doi.org/10.1007/s00208-013-0960-z\">10.1007/s00208-013-0960-z</a>"},"volume":358,"day":"01","oa":1,"external_id":{"arxiv":["1203.4886"]},"article_type":"original","date_created":"2026-06-19T07:42:09Z","year":"2014","article_processing_charge":"No"},{"publist_id":"4764","month":"04","_id":"2208","oa_version":"Submitted Version","article_number":"043616","day":"23","volume":89,"intvolume":"        89","citation":{"ama":"Lahrz M, Lemeshko M, Sengstock K, Becker C, Mathey L. Detecting quadrupole interactions in ultracold Fermi gases. <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. 2014;89(4). doi:<a href=\"https://doi.org/10.1103/PhysRevA.89.043616\">10.1103/PhysRevA.89.043616</a>","short":"M. Lahrz, M. Lemeshko, K. Sengstock, C. Becker, L. Mathey, Physical Review A - Atomic, Molecular, and Optical Physics 89 (2014).","mla":"Lahrz, Martin, et al. “Detecting Quadrupole Interactions in Ultracold Fermi Gases.” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 89, no. 4, 043616, American Physical Society, 2014, doi:<a href=\"https://doi.org/10.1103/PhysRevA.89.043616\">10.1103/PhysRevA.89.043616</a>.","chicago":"Lahrz, Martin, Mikhail Lemeshko, Klaus Sengstock, Christoph Becker, and Ludwig Mathey. “Detecting Quadrupole Interactions in Ultracold Fermi Gases.” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society, 2014. <a href=\"https://doi.org/10.1103/PhysRevA.89.043616\">https://doi.org/10.1103/PhysRevA.89.043616</a>.","ista":"Lahrz M, Lemeshko M, Sengstock K, Becker C, Mathey L. 2014. Detecting quadrupole interactions in ultracold Fermi gases. Physical Review A - Atomic, Molecular, and Optical Physics. 89(4), 043616.","ieee":"M. Lahrz, M. Lemeshko, K. Sengstock, C. Becker, and L. Mathey, “Detecting quadrupole interactions in ultracold Fermi gases,” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 89, no. 4. American Physical Society, 2014.","apa":"Lahrz, M., Lemeshko, M., Sengstock, K., Becker, C., &#38; Mathey, L. (2014). Detecting quadrupole interactions in ultracold Fermi gases. <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.89.043616\">https://doi.org/10.1103/PhysRevA.89.043616</a>"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","language":[{"iso":"eng"}],"title":"Detecting quadrupole interactions in ultracold Fermi gases","publication":"Physical Review A - Atomic, Molecular, and Optical Physics","extern":"1","main_file_link":[{"url":"http://arxiv.org/abs/1402.0873","open_access":"1"}],"date_updated":"2021-01-12T06:55:59Z","author":[{"full_name":"Lahrz, Martin","first_name":"Martin","last_name":"Lahrz"},{"last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802"},{"full_name":"Sengstock, Klaus","last_name":"Sengstock","first_name":"Klaus"},{"full_name":"Becker, Christoph","last_name":"Becker","first_name":"Christoph"},{"last_name":"Mathey","first_name":"Ludwig","full_name":"Mathey, Ludwig"}],"abstract":[{"text":"We propose to detect quadrupole interactions of neutral ultracold atoms via their induced mean-field shift. We consider a Mott insulator state of spin-polarized atoms in a two-dimensional optical square lattice. The quadrupole moments of the atoms are aligned by an external magnetic field. As the alignment angle is varied, the mean-field shift shows a characteristic angular dependence, which constitutes the defining signature of the quadrupole interaction. For the 3P2 states of Yb and Sr atoms, we find a frequency shift of the order of tens of Hertz, which can be realistically detected in experiment with current technology. We compare our results to the mean-field shift of a spin-polarized quasi-two-dimensional Fermi gas in continuum. ","lang":"eng"}],"type":"journal_article","publisher":"American Physical Society","quality_controlled":"1","doi":"10.1103/PhysRevA.89.043616","fulldoi":"https://doi.org/10.1103/PhysRevA.89.043616","date_created":"2018-12-11T11:56:20Z","year":"2014","date_published":"2014-04-23T00:00:00Z","oa":1,"issue":"4","status":"public"},{"date_updated":"2023-02-23T12:24:50Z","title":"Perfect-information stochastic mean-payoff parity games","abstract":[{"lang":"eng","text":"The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2 1/2-player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other transitions are determined probabilistically. We consider 2 1/2-player games where the objective of the System is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a mean-payoff condition). We establish that the problem of deciding whether the System can ensure that the probability to satisfy the mean-payoff parity objective is at least a given threshold is in NP ∩ coNP, matching the best known bound in the special case of 2-player games (where all transitions are deterministic). We present an algorithm running in time O(d·n2d·MeanGame) to compute the set of almost-sure winning states from which the objective can be ensured with probability 1, where n is the number of states of the game, d the number of priorities of the parity objective, and MeanGame is the complexity to compute the set of almost-sure winning states in 2 1/2-player mean-payoff games. Our results are useful in the synthesis of stochastic reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective). "}],"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"first_name":"Hugo","last_name":"Gimbert","full_name":"Gimbert, Hugo"},{"full_name":"Oualhadj, Youssouf","first_name":"Youssouf","last_name":"Oualhadj"}],"publist_id":"4758","citation":{"ama":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. Perfect-information stochastic mean-payoff parity games. In: Vol 8412. Springer; 2014:210-225. doi:<a href=\"https://doi.org/10.1007/978-3-642-54830-7_14\">10.1007/978-3-642-54830-7_14</a>","short":"K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp. 210–225.","mla":"Chatterjee, Krishnendu, et al. <i>Perfect-Information Stochastic Mean-Payoff Parity Games</i>. Vol. 8412, Springer, 2014, pp. 210–25, doi:<a href=\"https://doi.org/10.1007/978-3-642-54830-7_14\">10.1007/978-3-642-54830-7_14</a>.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. “Perfect-Information Stochastic Mean-Payoff Parity Games,” 8412:210–25. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54830-7_14\">https://doi.org/10.1007/978-3-642-54830-7_14</a>.","ista":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2014. Perfect-information stochastic mean-payoff parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 210–225.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Oualhadj, Y. (2014). Perfect-information stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54830-7_14\">https://doi.org/10.1007/978-3-642-54830-7_14</a>","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225."},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"intvolume":"      8412","volume":8412,"day":"01","alternative_title":["LNCS"],"acknowledgement":"This research was supported by European project Cassting (FP7-601148).\r\nA Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/128.","date_created":"2018-12-11T11:56:21Z","year":"2014","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5405"}]},"language":[{"iso":"eng"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","type":"conference","conference":{"name":"FoSSaCS: Foundations of Software Science and Computation Structures","location":"Grenoble, France","end_date":"2014-04-13","start_date":"2014-04-05"},"scopus_import":1,"_id":"2212","oa_version":"None","month":"04","page":"210 - 225","date_published":"2014-04-01T00:00:00Z","status":"public","doi":"10.1007/978-3-642-54830-7_14","quality_controlled":"1","ec_funded":1,"department":[{"_id":"KrCh"}],"fulldoi":"https://doi.org/10.1007/978-3-642-54830-7_14"},{"status":"public","date_published":"2014-04-01T00:00:00Z","ec_funded":1,"department":[{"_id":"KrCh"}],"fulldoi":"https://doi.org/10.1007/978-3-642-54830-7_16","doi":"10.1007/978-3-642-54830-7_16","quality_controlled":"1","type":"conference","publisher":"Springer","conference":{"location":"Grenoble, France","name":"FoSSaCS: Foundations of Software Science and Computation Structures","start_date":"2014-04-05","end_date":"2014-04-13"},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1401.3289"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5408"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","language":[{"iso":"eng"}],"page":"242 - 257","scopus_import":1,"_id":"2213","oa_version":"Preprint","month":"04","external_id":{"arxiv":["1401.3289"]},"oa":1,"acknowledgement":"This research was supported by European project Cassting (FP7-601148), NSF grants CNS 1049862 and CCF-1139011, by NSF Expe ditions in Computing project “ExCAPE: Expeditions in Computer Augmented Program Engineering”, by BSF grant 9800096, and by gift from Intel.","year":"2014","date_created":"2018-12-11T11:56:21Z","abstract":[{"text":"We consider two-player partial-observation stochastic games on finitestate graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are ε-regular conditions specified as parity objectives. The qualitative-analysis problem given a partial-observation stochastic game and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). These qualitative-analysis problems are known to be undecidable. However in many applications the relevant question is the existence of finite-memory strategies, and the qualitative-analysis problems under finite-memory strategies was recently shown to be decidable in 2EXPTIME.We improve the complexity and show that the qualitative-analysis problems for partial-observation stochastic parity games under finite-memory strategies are EXPTIME-complete; and also establish optimal (exponential) memory bounds for finite-memory strategies required for qualitative analysis.","lang":"eng"}],"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"first_name":"Sumit","last_name":"Nain","full_name":"Nain, Sumit"},{"full_name":"Vardi, Moshe","last_name":"Vardi","first_name":"Moshe"}],"date_updated":"2023-02-23T12:24:58Z","title":"The complexity of partial-observation stochastic parity games with finite-memory strategies","volume":8412,"intvolume":"      8412","citation":{"short":"K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 242–257.","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies</i>. Vol. 8412, Springer, 2014, pp. 242–57, doi:<a href=\"https://doi.org/10.1007/978-3-642-54830-7_16\">10.1007/978-3-642-54830-7_16</a>.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. “The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies,” 8412:242–57. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54830-7_16\">https://doi.org/10.1007/978-3-642-54830-7_16</a>.","ista":"Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 242–257.","apa":"Chatterjee, K., Doyen, L., Nain, S., &#38; Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54830-7_16\">https://doi.org/10.1007/978-3-642-54830-7_16</a>","ieee":"K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.","ama":"Chatterjee K, Doyen L, Nain S, Vardi M. The complexity of partial-observation stochastic parity games with finite-memory strategies. In: Vol 8412. Springer; 2014:242-257. doi:<a href=\"https://doi.org/10.1007/978-3-642-54830-7_16\">10.1007/978-3-642-54830-7_16</a>"},"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"alternative_title":["LNCS"],"day":"01","publist_id":"4757","arxiv":1},{"acknowledgement":"Michael Sixt's research is supported by the European Research Council (ERC Starting grant).","external_id":{"isi":["000330283100061"]},"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"article_processing_charge":"No","year":"2014","date_created":"2018-12-11T11:56:22Z","title":"Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects","date_updated":"2025-09-29T11:30:42Z","author":[{"first_name":"Liat","last_name":"Stoler Barak","full_name":"Stoler Barak, Liat"},{"first_name":"Christine","last_name":"Moussion","id":"3356F664-F248-11E8-B48F-1D18A9856A87","full_name":"Moussion, Christine"},{"full_name":"Shezen, Elias","last_name":"Shezen","first_name":"Elias"},{"first_name":"Miki","last_name":"Hatzav","full_name":"Hatzav, Miki"},{"full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Alon, Ronen","first_name":"Ronen","last_name":"Alon"}],"abstract":[{"text":"A hallmark of immune cell trafficking is directional guidance via gradients of soluble or surface bound chemokines. Vascular endothelial cells produce, transport and deposit either their own chemokines or chemokines produced by the underlying stroma. Endothelial heparan sulfate (HS) was suggested to be a critical scaffold for these chemokine pools, but it is unclear how steep chemokine gradients are sustained between the lumenal and ablumenal aspects of blood vessels. Addressing this question by semi-quantitative immunostaining of HS moieties around blood vessels with a pan anti-HS IgM mAb, we found a striking HS enrichment in the basal lamina of resting and inflamed post capillary skin venules, as well as in high endothelial venules (HEVs) of lymph nodes. Staining of skin vessels with a glycocalyx probe further suggested that their lumenal glycocalyx contains much lower HS density than their basolateral extracellular matrix (ECM). This polarized HS pattern was observed also in isolated resting and inflamed microvascular dermal cells. Notably, progressive skin inflammation resulted in massive ECM deposition and in further HS enrichment around skin post capillary venules and their associated pericytes. Inflammation-dependent HS enrichment was not compromised in mice deficient in the main HS degrading enzyme, heparanase. Our results suggest that the blood vasculature patterns steep gradients of HS scaffolds between their lumenal and basolateral endothelial aspects, and that inflammatory processes can further enrich the HS content nearby inflamed vessels. We propose that chemokine gradients between the lumenal and ablumenal sides of vessels could be favored by these sharp HS scaffold gradients.","lang":"eng"}],"publist_id":"4756","article_number":"e85699","day":"22","volume":9,"intvolume":"         9","citation":{"ista":"Stoler Barak L, Moussion C, Shezen E, Hatzav M, Sixt MK, Alon R. 2014. Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects. PLoS One. 9(1), e85699.","ieee":"L. Stoler Barak, C. Moussion, E. Shezen, M. Hatzav, M. K. Sixt, and R. Alon, “Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects,” <i>PLoS One</i>, vol. 9, no. 1. Public Library of Science, 2014.","apa":"Stoler Barak, L., Moussion, C., Shezen, E., Hatzav, M., Sixt, M. K., &#38; Alon, R. (2014). Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0085699\">https://doi.org/10.1371/journal.pone.0085699</a>","mla":"Stoler Barak, Liat, et al. “Blood Vessels Pattern Heparan Sulfate Gradients between Their Apical and Basolateral Aspects.” <i>PLoS One</i>, vol. 9, no. 1, e85699, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0085699\">10.1371/journal.pone.0085699</a>.","short":"L. Stoler Barak, C. Moussion, E. Shezen, M. Hatzav, M.K. Sixt, R. Alon, PLoS One 9 (2014).","chicago":"Stoler Barak, Liat, Christine Moussion, Elias Shezen, Miki Hatzav, Michael K Sixt, and Ronen Alon. “Blood Vessels Pattern Heparan Sulfate Gradients between Their Apical and Basolateral Aspects.” <i>PLoS One</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0085699\">https://doi.org/10.1371/journal.pone.0085699</a>.","ama":"Stoler Barak L, Moussion C, Shezen E, Hatzav M, Sixt MK, Alon R. Blood vessels pattern heparan sulfate gradients between their apical and basolateral aspects. <i>PLoS One</i>. 2014;9(1). doi:<a href=\"https://doi.org/10.1371/journal.pone.0085699\">10.1371/journal.pone.0085699</a>"},"project":[{"call_identifier":"FP7","name":"Stromal Cell-immune Cell Interactions in Health and Disease","_id":"25A76F58-B435-11E9-9278-68D0E5697425","grant_number":"289720"}],"date_published":"2014-01-22T00:00:00Z","has_accepted_license":"1","issue":"1","file_date_updated":"2020-07-14T12:45:33Z","status":"public","quality_controlled":"1","license":"https://creativecommons.org/licenses/by/4.0/","file":[{"date_created":"2018-12-12T10:07:48Z","content_type":"application/pdf","relation":"main_file","checksum":"84a8033bda2e07e39405f5acc85f4eca","file_size":12634775,"file_name":"IST-2016-433-v1+1_journal.pone.0085699.pdf","creator":"system","date_updated":"2020-07-14T12:45:33Z","access_level":"open_access","file_id":"4646"}],"doi":"10.1371/journal.pone.0085699","fulldoi":"https://doi.org/10.1371/journal.pone.0085699","ec_funded":1,"department":[{"_id":"MiSi"}],"publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"PLoS One","language":[{"iso":"eng"}],"pubrep_id":"433","type":"journal_article","publisher":"Public Library of Science","ddc":["570"],"month":"01","oa_version":"Published Version","_id":"2214","scopus_import":"1","isi":1},{"date_created":"2018-12-11T11:56:22Z","year":"2014","article_processing_charge":"No","external_id":{"isi":["000337245500009"]},"acknowledgement":"J.R. was supported by a Boehringer Ingelheim Fonds PhD stipend.","publist_id":"4755","volume":15,"intvolume":"        15","citation":{"chicago":"Renkawitz, Jörg, Claudio Lademann, and Stefan Jentsch. “Mechanisms and Principles of Homology Search during Recombination.” <i>Nature Reviews Molecular Cell Biology</i>. Nature Publishing Group, 2014. <a href=\"https://doi.org/10.1038/nrm3805\">https://doi.org/10.1038/nrm3805</a>.","short":"J. Renkawitz, C. Lademann, S. Jentsch, Nature Reviews Molecular Cell Biology 15 (2014) 369–383.","mla":"Renkawitz, Jörg, et al. “Mechanisms and Principles of Homology Search during Recombination.” <i>Nature Reviews Molecular Cell Biology</i>, vol. 15, no. 6, Nature Publishing Group, 2014, pp. 369–83, doi:<a href=\"https://doi.org/10.1038/nrm3805\">10.1038/nrm3805</a>.","ieee":"J. Renkawitz, C. Lademann, and S. Jentsch, “Mechanisms and principles of homology search during recombination,” <i>Nature Reviews Molecular Cell Biology</i>, vol. 15, no. 6. Nature Publishing Group, pp. 369–383, 2014.","apa":"Renkawitz, J., Lademann, C., &#38; Jentsch, S. (2014). Mechanisms and principles of homology search during recombination. <i>Nature Reviews Molecular Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nrm3805\">https://doi.org/10.1038/nrm3805</a>","ista":"Renkawitz J, Lademann C, Jentsch S. 2014. Mechanisms and principles of homology search during recombination. Nature Reviews Molecular Cell Biology. 15(6), 369–383.","ama":"Renkawitz J, Lademann C, Jentsch S. Mechanisms and principles of homology search during recombination. <i>Nature Reviews Molecular Cell Biology</i>. 2014;15(6):369-383. doi:<a href=\"https://doi.org/10.1038/nrm3805\">10.1038/nrm3805</a>"},"day":"14","date_updated":"2025-09-29T11:30:10Z","title":"Mechanisms and principles of homology search during recombination","abstract":[{"lang":"eng","text":"Homologous recombination is crucial for genome stability and for genetic exchange. Although our knowledge of the principle steps in recombination and its machinery is well advanced, homology search, the critical step of exploring the genome for homologous sequences to enable recombination, has remained mostly enigmatic. However, recent methodological advances have provided considerable new insights into this fundamental step in recombination that can be integrated into a mechanistic model. These advances emphasize the importance of genomic proximity and nuclear organization for homology search and the critical role of homology search mediators in this process. They also aid our understanding of how homology search might lead to unwanted and potentially disease-promoting recombination events."}],"author":[{"first_name":"Jörg","id":"3F0587C8-F248-11E8-B48F-1D18A9856A87","last_name":"Renkawitz","full_name":"Renkawitz, Jörg","orcid":"0000-0003-2856-3369"},{"full_name":"Lademann, Claudio","last_name":"Lademann","first_name":"Claudio"},{"last_name":"Jentsch","first_name":"Stefan","full_name":"Jentsch, Stefan"}],"doi":"10.1038/nrm3805","quality_controlled":"1","department":[{"_id":"MiSi"}],"fulldoi":"https://doi.org/10.1038/nrm3805","date_published":"2014-05-14T00:00:00Z","status":"public","issue":"6","_id":"2215","scopus_import":"1","oa_version":"None","isi":1,"month":"05","page":"369 - 383","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"publication":"Nature Reviews Molecular Cell Biology","type":"journal_article","publisher":"Nature Publishing Group"},{"_id":"2216","scopus_import":"1","oa_version":"Submitted Version","publist_id":"4752","month":"01","page":"303 - 312","citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Majumdar R. Edit distance for timed automata. In: Springer; 2014:303-312. doi:<a href=\"https://doi.org/10.1145/2562059.2562141\">10.1145/2562059.2562141</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit Distance for Timed Automata,” 303–12. Springer, 2014. <a href=\"https://doi.org/10.1145/2562059.2562141\">https://doi.org/10.1145/2562059.2562141</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.","mla":"Chatterjee, Krishnendu, et al. <i>Edit Distance for Timed Automata</i>. Springer, 2014, pp. 303–12, doi:<a href=\"https://doi.org/10.1145/2562059.2562141\">10.1145/2562059.2562141</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany, 2014, pp. 303–312.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Majumdar, R. (2014). Edit distance for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany: Springer. <a href=\"https://doi.org/10.1145/2562059.2562141\">https://doi.org/10.1145/2562059.2562141</a>","ista":"Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata. HSCC: Hybrid Systems - Computation and Control, 303–312."},"day":"01","main_file_link":[{"url":"https://dl.acm.org/citation.cfm?doid=2562059.2562141","open_access":"1"}],"date_updated":"2024-10-21T06:02:53Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5409"}]},"publication_status":"published","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"title":"Edit distance for timed automata","type":"conference","publisher":"Springer","abstract":[{"text":"The edit distance between two (untimed) traces is the minimum cost of a sequence of edit operations (insertion, deletion, or substitution) needed to transform one trace to the other. Edit distances have been extensively studied in the untimed setting, and form the basis for approximate matching of sequences in different domains such as coding theory, parsing, and speech recognition. In this paper, we lift the study of edit distances from untimed languages to the timed setting. We define an edit distance between timed words which incorporates both the edit distance between the untimed words and the absolute difference in time stamps. Our edit distance between two timed words is computable in polynomial time. Further, we show that the edit distance between a timed word and a timed language generated by a timed automaton, defined as the edit distance between the word and the closest word in the language, is PSPACE-complete. While computing the edit distance between two timed automata is undecidable, we show that the approximate version, where we decide if the edit distance between two timed automata is either less than a given parameter or more than δ away from the parameter, for δ &gt; 0, can be solved in exponential space and is EXPSPACE-hard. Our definitions and techniques can be generalized to the setting of hybrid systems, and analogous decidability results hold for rectangular automata.","lang":"eng"}],"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"}],"conference":{"location":"Berlin, Germany","name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2017-04-15","end_date":"2017-04-17"},"doi":"10.1145/2562059.2562141","quality_controlled":"1","date_created":"2018-12-11T11:56:22Z","year":"2014","department":[{"_id":"KrCh"}],"fulldoi":"https://doi.org/10.1145/2562059.2562141","date_published":"2014-01-01T00:00:00Z","oa":1,"status":"public"},{"author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","full_name":"Otop, Jan"}],"abstract":[{"lang":"eng","text":"As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, rather than qualitative methods. In this paper we adapt a quantitative framework, called model measuring, to the hybrid systems domain. The model-measuring problem asks, given a model M and a specification, what is the maximal distance such that all models within that distance from M satisfy (or violate) the specification. A distance function on models is given as part of the input of the problem. Distances, especially related to continuous behaviors are more natural in the hybrid case than the discrete case. We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values of parameters.\r\n\r\nThe contributions of this paper are twofold. First, we give sufficient conditions under which the model-measuring problem can be solved. Second, we discuss the modeling of distances and applications of the model-measuring problem."}],"date_updated":"2025-06-26T08:32:32Z","title":"Model measuring for hybrid systems","citation":{"mla":"Henzinger, Thomas A., and Jan Otop. “Model Measuring for Hybrid Systems.” <i>Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control</i>, Springer, 2014, pp. 213–22, doi:<a href=\"https://doi.org/10.1145/2562059.2562130\">10.1145/2562059.2562130</a>.","short":"T.A. Henzinger, J. Otop, in:, Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–222.","chicago":"Henzinger, Thomas A, and Jan Otop. “Model Measuring for Hybrid Systems.” In <i>Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control</i>, 213–22. Springer, 2014. <a href=\"https://doi.org/10.1145/2562059.2562130\">https://doi.org/10.1145/2562059.2562130</a>.","ista":"Henzinger TA, Otop J. 2014. Model measuring for hybrid systems. Proceedings of the 17th international conference on Hybrid systems: computation and control. HSCC: Hybrid Systems - Computation and Control, 213–222.","apa":"Henzinger, T. A., &#38; Otop, J. (2014). Model measuring for hybrid systems. In <i>Proceedings of the 17th international conference on Hybrid systems: computation and control</i> (pp. 213–222). Berlin, Germany: Springer. <a href=\"https://doi.org/10.1145/2562059.2562130\">https://doi.org/10.1145/2562059.2562130</a>","ieee":"T. A. Henzinger and J. Otop, “Model measuring for hybrid systems,” in <i>Proceedings of the 17th international conference on Hybrid systems: computation and control</i>, Berlin, Germany, 2014, pp. 213–222.","ama":"Henzinger TA, Otop J. Model measuring for hybrid systems. In: <i>Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control</i>. Springer; 2014:213-222. doi:<a href=\"https://doi.org/10.1145/2562059.2562130\">10.1145/2562059.2562130</a>"},"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"day":"01","publist_id":"4751","oa":1,"acknowledgement":"This  work  was  supported  in  part  by  the  Austrian  Science Fund  NFN  RiSE  (Rigorous  Systems  Engineering)  and  by the ERC Advanced Grant QUAREM (Quantitative Reactive Modeling).\r\nA Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/171","year":"2014","date_created":"2018-12-11T11:56:23Z","article_processing_charge":"No","type":"conference","publisher":"Springer","conference":{"start_date":"2014-04-15","end_date":"2014-04-17","location":"Berlin, Germany","name":"HSCC: Hybrid Systems - Computation and Control"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.15479/AT:IST-2014-171-v1-1"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5416"}]},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication":"Proceedings of the 17th international conference on Hybrid systems: computation and control","page":"213 - 222","scopus_import":"1","_id":"2217","oa_version":"Preprint","month":"04","status":"public","date_published":"2014-04-01T00:00:00Z","ec_funded":1,"department":[{"_id":"ToHe"}],"OA_place":"repository","fulldoi":"https://doi.org/10.1145/2562059.2562130","OA_type":"green","doi":"10.1145/2562059.2562130","quality_controlled":"1"},{"date_created":"2018-12-11T11:56:23Z","year":"2014","oa":1,"day":"22","alternative_title":["LNCS"],"citation":{"ama":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. Regression-free synthesis for concurrency. In: Vol 8559. Springer; 2014:568-584. doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_38\">10.1007/978-3-319-08867-9_38</a>","apa":"Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., &#38; Tarrach, T. (2014). Regression-free synthesis for concurrency (Vol. 8559, pp. 568–584). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_38\">https://doi.org/10.1007/978-3-319-08867-9_38</a>","ieee":"P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Regression-free synthesis for concurrency,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 568–584.","ista":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2014. Regression-free synthesis for concurrency. CAV: Computer Aided Verification, LNCS, vol. 8559, 568–584.","chicago":"Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Regression-Free Synthesis for Concurrency,” 8559:568–84. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_38\">https://doi.org/10.1007/978-3-319-08867-9_38</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2014, pp. 568–584.","mla":"Cerny, Pavol, et al. <i>Regression-Free Synthesis for Concurrency</i>. Vol. 8559, Springer, 2014, pp. 568–84, doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_38\">10.1007/978-3-319-08867-9_38</a>."},"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"}],"intvolume":"      8559","volume":8559,"publist_id":"4749","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","full_name":"Radhakrishna, Arjun"},{"last_name":"Ryzhyk","first_name":"Leonid","full_name":"Ryzhyk, Leonid"},{"id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","last_name":"Tarrach","first_name":"Thorsten","full_name":"Tarrach, Thorsten","orcid":"0000-0003-4409-8487"}],"abstract":[{"text":"While fixing concurrency bugs, program repair algorithms may introduce new concurrency bugs. We present an algorithm that avoids such regressions. The solution space is given by a set of program transformations we consider in the repair process. These include reordering of instructions within a thread and inserting atomic sections. The new algorithm learns a constraint on the space of candidate solutions, from both positive examples (error-free traces) and counterexamples (error traces). From each counterexample, the algorithm learns a constraint necessary to remove the errors. From each positive examples, it learns a constraint that is necessary in order to prevent the repair from turning the trace into an error trace. We implemented the algorithm and evaluated it on simplified Linux device drivers with known bugs.","lang":"eng"}],"title":"Regression-free synthesis for concurrency","date_updated":"2026-04-09T10:54:00Z","fulldoi":"https://doi.org/10.1007/978-3-319-08867-9_38","department":[{"_id":"ToHe"}],"ec_funded":1,"quality_controlled":"1","doi":"10.1007/978-3-319-08867-9_38","publication_identifier":{"isbn":["978-331908866-2"]},"file":[{"file_name":"IST-2014-297-v1+1_cav14-final.pdf","checksum":"a631d3105509f239724644e77a1212e2","file_size":416732,"file_id":"4995","date_updated":"2020-07-14T12:45:33Z","creator":"system","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:13:14Z","relation":"main_file"},{"file_name":"IST-2014-297-v2+1_cav14-final2.pdf","checksum":"f8b0f748cc9fa697ca992cc56c87bc4e","file_size":616293,"file_id":"4996","date_updated":"2020-07-14T12:45:33Z","creator":"system","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:13:15Z","relation":"main_file"}],"file_date_updated":"2020-07-14T12:45:33Z","status":"public","has_accepted_license":"1","date_published":"2014-07-22T00:00:00Z","page":"568 - 584","month":"07","ddc":["000"],"_id":"2218","scopus_import":"1","oa_version":"Submitted Version","conference":{"location":"Vienna, Austria","name":"CAV: Computer Aided Verification","start_date":"2014-07-18","end_date":"2014-07-22"},"pubrep_id":"297","publisher":"Springer","type":"conference","language":[{"iso":"eng"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"1130","relation":"dissertation_contains"}]},"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007%2F978-3-319-08867-9_38","open_access":"1"}]},{"oa":1,"date_created":"2018-12-11T11:56:24Z","year":"2014","date_updated":"2021-01-12T06:56:05Z","title":"Simple chosen-ciphertext security from low noise LPN","abstract":[{"text":"Recently, Döttling et al. (ASIACRYPT 2012) proposed the first chosen-ciphertext (IND-CCA) secure public-key encryption scheme from the learning parity with noise (LPN) assumption. In this work we give an alternative scheme which is conceptually simpler and more efficient. At the core of our construction is a trapdoor technique originally proposed for lattices by Micciancio and Peikert (EUROCRYPT 2012), which we adapt to the LPN setting. The main technical tool is a new double-trapdoor mechanism, together with a trapdoor switching lemma based on a computational variant of the leftover hash lemma.","lang":"eng"}],"author":[{"last_name":"Kiltz","first_name":"Eike","full_name":"Kiltz, Eike"},{"first_name":"Daniel","last_name":"Masny","full_name":"Masny, Daniel"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}],"publist_id":"4748","volume":8383,"intvolume":"      8383","citation":{"apa":"Kiltz, E., Masny, D., &#38; Pietrzak, K. Z. (2014). Simple chosen-ciphertext security from low noise LPN (Vol. 8383, pp. 1–18). Presented at the IACR: International Conference on Practice and Theory in Public-Key Cryptography, Springer. <a href=\"https://doi.org/10.1007/978-3-642-54631-0_1\">https://doi.org/10.1007/978-3-642-54631-0_1</a>","ieee":"E. Kiltz, D. Masny, and K. Z. Pietrzak, “Simple chosen-ciphertext security from low noise LPN,” presented at the IACR: International Conference on Practice and Theory in Public-Key Cryptography, 2014, vol. 8383, pp. 1–18.","ista":"Kiltz E, Masny D, Pietrzak KZ. 2014. Simple chosen-ciphertext security from low noise LPN. IACR: International Conference on Practice and Theory in Public-Key Cryptography, LNCS, vol. 8383, 1–18.","chicago":"Kiltz, Eike, Daniel Masny, and Krzysztof Z Pietrzak. “Simple Chosen-Ciphertext Security from Low Noise LPN,” 8383:1–18. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54631-0_1\">https://doi.org/10.1007/978-3-642-54631-0_1</a>.","short":"E. Kiltz, D. Masny, K.Z. Pietrzak, in:, Springer, 2014, pp. 1–18.","mla":"Kiltz, Eike, et al. <i>Simple Chosen-Ciphertext Security from Low Noise LPN</i>. Vol. 8383, Springer, 2014, pp. 1–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-54631-0_1\">10.1007/978-3-642-54631-0_1</a>.","ama":"Kiltz E, Masny D, Pietrzak KZ. Simple chosen-ciphertext security from low noise LPN. In: Vol 8383. Springer; 2014:1-18. doi:<a href=\"https://doi.org/10.1007/978-3-642-54631-0_1\">10.1007/978-3-642-54631-0_1</a>"},"alternative_title":["LNCS"],"day":"01","date_published":"2014-03-01T00:00:00Z","status":"public","publication_identifier":{"isbn":["978-364254630-3"]},"doi":"10.1007/978-3-642-54631-0_1","quality_controlled":"1","department":[{"_id":"KrPi"}],"fulldoi":"https://doi.org/10.1007/978-3-642-54631-0_1","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2015/401"}],"publication_status":"published","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"type":"conference","publisher":"Springer","conference":{"name":"IACR: International Conference on Practice and Theory in Public-Key Cryptography"},"scopus_import":1,"_id":"2219","oa_version":"Submitted Version","month":"03","page":"1 - 18"},{"type":"journal_article","publisher":"Cell Press","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Chemistry and Biology","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/24766845"}],"page":"439 - 440","month":"04","_id":"2220","oa_version":"Published Version","scopus_import":"1","isi":1,"pmid":1,"status":"public","issue":"4","date_published":"2014-04-24T00:00:00Z","fulldoi":"https://doi.org/10.1016/j.chembiol.2014.04.004","department":[{"_id":"ToBo"}],"quality_controlled":"1","corr_author":"1","publication_identifier":{"issn":["1074-5521"]},"doi":"10.1016/j.chembiol.2014.04.004","abstract":[{"lang":"eng","text":"In this issue of Chemistry & Biology, Cokol and colleagues report a systematic study of drug interactions between antifungal compounds. Suppressive drug interactions occur more frequently than previously realized and come in different flavors with interesting implications."}],"author":[{"full_name":"De Vos, Marjon","last_name":"De Vos","id":"3111FFAC-F248-11E8-B48F-1D18A9856A87","first_name":"Marjon"},{"full_name":"Bollenbach, Mark Tobias","orcid":"0000-0003-4398-476X","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach","first_name":"Mark Tobias"}],"title":"Suppressive drug interactions between antifungals","date_updated":"2025-09-29T11:28:57Z","day":"24","volume":21,"intvolume":"        21","citation":{"ista":"de Vos M, Bollenbach MT. 2014. Suppressive drug interactions between antifungals. Chemistry and Biology. 21(4), 439–440.","ieee":"M. de Vos and M. T. Bollenbach, “Suppressive drug interactions between antifungals,” <i>Chemistry and Biology</i>, vol. 21, no. 4. Cell Press, pp. 439–440, 2014.","apa":"de Vos, M., &#38; Bollenbach, M. T. (2014). Suppressive drug interactions between antifungals. <i>Chemistry and Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.chembiol.2014.04.004\">https://doi.org/10.1016/j.chembiol.2014.04.004</a>","mla":"de Vos, Marjon, and Mark Tobias Bollenbach. “Suppressive Drug Interactions between Antifungals.” <i>Chemistry and Biology</i>, vol. 21, no. 4, Cell Press, 2014, pp. 439–40, doi:<a href=\"https://doi.org/10.1016/j.chembiol.2014.04.004\">10.1016/j.chembiol.2014.04.004</a>.","short":"M. de Vos, M.T. Bollenbach, Chemistry and Biology 21 (2014) 439–440.","chicago":"Vos, Marjon de, and Mark Tobias Bollenbach. “Suppressive Drug Interactions between Antifungals.” <i>Chemistry and Biology</i>. Cell Press, 2014. <a href=\"https://doi.org/10.1016/j.chembiol.2014.04.004\">https://doi.org/10.1016/j.chembiol.2014.04.004</a>.","ama":"de Vos M, Bollenbach MT. Suppressive drug interactions between antifungals. <i>Chemistry and Biology</i>. 2014;21(4):439-440. doi:<a href=\"https://doi.org/10.1016/j.chembiol.2014.04.004\">10.1016/j.chembiol.2014.04.004</a>"},"publist_id":"4747","external_id":{"isi":["000335431300005"],"pmid":["24766845"]},"oa":1,"article_processing_charge":"No","year":"2014","date_created":"2018-12-11T11:56:24Z"},{"abstract":[{"lang":"eng","text":"Leaf venation develops complex patterns in angiosperms, but the mechanism underlying this process is largely unknown. To elucidate the molecular mechanisms governing vein pattern formation, we previously isolated vascular network defective (van) mutants that displayed venation discontinuities. Here, we report the phenotypic analysis of van4 mutants, and we identify and characterize the VAN4 gene. Detailed phenotypic analysis shows that van4 mutants are defective in procambium cell differentiation and subsequent vascular cell differentiation. Reduced shoot and root cell growth is observed in van4 mutants, suggesting that VAN4 function is important for cell growth and the establishment of venation continuity. Consistent with these phenotypes, the VAN4 gene is strongly expressed in vascular and meristematic cells. VAN4 encodes a putative TRS120, which is a known guanine nucleotide exchange factor (GEF) for Rab GTPase involved in regulating vesicle transport, and a known tethering factor that determines the specificity of membrane fusion. VAN4 protein localizes at the trans-Golgi network/early endosome (TGN/EE). Aberrant recycling of the auxin efflux carrier PIN proteins is observed in van4 mutants. These results suggest that VAN4-mediated exocytosis at the TGN plays important roles in plant vascular development and cell growth in shoot and root. Our identification of VAN4 as a putative TRS120 shows that Rab GTPases are crucial (in addition to ARF GTPases) for continuous vascular development, and provides further evidence for the importance of vesicle transport in leaf vascular formation."}],"author":[{"last_name":"Naramoto","first_name":"Satoshi","full_name":"Naramoto, Satoshi"},{"full_name":"Nodzyński, Tomasz","first_name":"Tomasz","last_name":"Nodzyński"},{"full_name":"Dainobu, Tomoko","first_name":"Tomoko","last_name":"Dainobu"},{"first_name":"Hirotomo","last_name":"Takatsuka","full_name":"Takatsuka, Hirotomo"},{"full_name":"Okada, Teruyo","last_name":"Okada","first_name":"Teruyo"},{"first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"},{"first_name":"Hiroo","last_name":"Fukuda","full_name":"Fukuda, Hiroo"}],"date_updated":"2025-09-29T11:28:27Z","title":"VAN4 encodes a putative TRS120 that is required for normal cell growth and vein development in arabidopsis","volume":55,"citation":{"short":"S. Naramoto, T. Nodzyński, T. Dainobu, H. Takatsuka, T. Okada, J. Friml, H. Fukuda, Plant and Cell Physiology 55 (2014) 750–763.","mla":"Naramoto, Satoshi, et al. “VAN4 Encodes a Putative TRS120 That Is Required for Normal Cell Growth and Vein Development in Arabidopsis.” <i>Plant and Cell Physiology</i>, vol. 55, no. 4, Oxford University Press, 2014, pp. 750–63, doi:<a href=\"https://doi.org/10.1093/pcp/pcu012\">10.1093/pcp/pcu012</a>.","chicago":"Naramoto, Satoshi, Tomasz Nodzyński, Tomoko Dainobu, Hirotomo Takatsuka, Teruyo Okada, Jiří Friml, and Hiroo Fukuda. “VAN4 Encodes a Putative TRS120 That Is Required for Normal Cell Growth and Vein Development in Arabidopsis.” <i>Plant and Cell Physiology</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/pcp/pcu012\">https://doi.org/10.1093/pcp/pcu012</a>.","ista":"Naramoto S, Nodzyński T, Dainobu T, Takatsuka H, Okada T, Friml J, Fukuda H. 2014. VAN4 encodes a putative TRS120 that is required for normal cell growth and vein development in arabidopsis. Plant and Cell Physiology. 55(4), 750–763.","ieee":"S. Naramoto <i>et al.</i>, “VAN4 encodes a putative TRS120 that is required for normal cell growth and vein development in arabidopsis,” <i>Plant and Cell Physiology</i>, vol. 55, no. 4. Oxford University Press, pp. 750–763, 2014.","apa":"Naramoto, S., Nodzyński, T., Dainobu, T., Takatsuka, H., Okada, T., Friml, J., &#38; Fukuda, H. (2014). VAN4 encodes a putative TRS120 that is required for normal cell growth and vein development in arabidopsis. <i>Plant and Cell Physiology</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/pcp/pcu012\">https://doi.org/10.1093/pcp/pcu012</a>","ama":"Naramoto S, Nodzyński T, Dainobu T, et al. VAN4 encodes a putative TRS120 that is required for normal cell growth and vein development in arabidopsis. <i>Plant and Cell Physiology</i>. 2014;55(4):750-763. doi:<a href=\"https://doi.org/10.1093/pcp/pcu012\">10.1093/pcp/pcu012</a>"},"project":[{"call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300"}],"intvolume":"        55","day":"01","publist_id":"4742","external_id":{"isi":["000334679500009"]},"date_created":"2018-12-11T11:56:24Z","year":"2014","article_processing_charge":"No","type":"journal_article","publisher":"Oxford University Press","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Plant and Cell Physiology","language":[{"iso":"eng"}],"page":"750 - 763","oa_version":"None","_id":"2222","scopus_import":"1","isi":1,"month":"04","issue":"4","status":"public","date_published":"2014-04-01T00:00:00Z","department":[{"_id":"JiFr"}],"ec_funded":1,"fulldoi":"https://doi.org/10.1093/pcp/pcu012","doi":"10.1093/pcp/pcu012","publication_identifier":{"issn":["0032-0781"]},"quality_controlled":"1"},{"date_updated":"2025-09-29T11:27:52Z","title":"BEX1/ARF1A1C is required for BFA-sensitive recycling of PIN auxin transporters and auxin-mediated development in arabidopsis","author":[{"first_name":"Hirokazu","last_name":"Tanaka","full_name":"Tanaka, Hirokazu"},{"full_name":"Nodzyński, Tomasz","first_name":"Tomasz","last_name":"Nodzyński"},{"first_name":"Saeko","last_name":"Kitakura","full_name":"Kitakura, Saeko"},{"first_name":"Mugurel","last_name":"Feraru","full_name":"Feraru, Mugurel"},{"first_name":"Michiko","last_name":"Sasabe","full_name":"Sasabe, Michiko"},{"first_name":"Tomomi","last_name":"Ishikawa","full_name":"Ishikawa, Tomomi"},{"full_name":"Kleine Vehn, Jürgen","last_name":"Kleine Vehn","first_name":"Jürgen"},{"full_name":"Kakimoto, Tatsuo","last_name":"Kakimoto","first_name":"Tatsuo"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"}],"abstract":[{"lang":"eng","text":"Correct positioning of membrane proteins is an essential process in eukaryotic organisms. The plant hormone auxin is distributed through intercellular transport and triggers various cellular responses. Auxin transporters of the PIN-FORMED (PIN) family localize asymmetrically at the plasma membrane (PM) and mediate the directional transport of auxin between cells. A fungal toxin, brefeldin A (BFA), inhibits a subset of guanine nucleotide exchange factors for ADP-ribosylation factor small GTPases (ARF GEFs) including GNOM, which plays a major role in localization of PIN1 predominantly to the basal side of the PM. The Arabidopsis genome encodes 19 ARF-related putative GTPases. However, ARF components involved in PIN1 localization have been genetically poorly defined. Using a fluorescence imaging-based forward genetic approach, we identified an Arabidopsis mutant, bfa-visualized exocytic trafficking defective1 (bex1), in which PM localization of PIN1-green fluorescent protein (GFP) as well as development is hypersensitive to BFA. We found that in bex1 a member of the ARF1 gene family, ARF1A1C, was mutated. ARF1A1C localizes to the trans-Golgi network/early endosome and Golgi apparatus, acts synergistically to BEN1/MIN7 ARF GEF and is important for PIN recycling to the PM. Consistent with the developmental importance of PIN proteins, functional interference with ARF1 resulted in an impaired auxin response gradient and various developmental defects including embryonic patterning defects and growth arrest. Our results show that ARF1A1C is essential for recycling of PIN auxin transporters and for various auxin-dependent developmental processes."}],"publist_id":"4741","project":[{"grant_number":"282300","name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Innovationsförderung in der Grenzregion Österreich – Tschechische Republik durch die Schaffung von Synergien im Bereich der Forschungsinfrastruktur","_id":"256BDAB0-B435-11E9-9278-68D0E5697425"}],"citation":{"short":"H. Tanaka, T. Nodzyński, S. Kitakura, M. Feraru, M. Sasabe, T. Ishikawa, J. Kleine Vehn, T. Kakimoto, J. Friml, Plant and Cell Physiology 55 (2014) 737–749.","mla":"Tanaka, Hirokazu, et al. “BEX1/ARF1A1C Is Required for BFA-Sensitive Recycling of PIN Auxin Transporters and Auxin-Mediated Development in Arabidopsis.” <i>Plant and Cell Physiology</i>, vol. 55, no. 4, Oxford University Press, 2014, pp. 737–49, doi:<a href=\"https://doi.org/10.1093/pcp/pct196\">10.1093/pcp/pct196</a>.","chicago":"Tanaka, Hirokazu, Tomasz Nodzyński, Saeko Kitakura, Mugurel Feraru, Michiko Sasabe, Tomomi Ishikawa, Jürgen Kleine Vehn, Tatsuo Kakimoto, and Jiří Friml. “BEX1/ARF1A1C Is Required for BFA-Sensitive Recycling of PIN Auxin Transporters and Auxin-Mediated Development in Arabidopsis.” <i>Plant and Cell Physiology</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/pcp/pct196\">https://doi.org/10.1093/pcp/pct196</a>.","ista":"Tanaka H, Nodzyński T, Kitakura S, Feraru M, Sasabe M, Ishikawa T, Kleine Vehn J, Kakimoto T, Friml J. 2014. BEX1/ARF1A1C is required for BFA-sensitive recycling of PIN auxin transporters and auxin-mediated development in arabidopsis. Plant and Cell Physiology. 55(4), 737–749.","ieee":"H. Tanaka <i>et al.</i>, “BEX1/ARF1A1C is required for BFA-sensitive recycling of PIN auxin transporters and auxin-mediated development in arabidopsis,” <i>Plant and Cell Physiology</i>, vol. 55, no. 4. Oxford University Press, pp. 737–749, 2014.","apa":"Tanaka, H., Nodzyński, T., Kitakura, S., Feraru, M., Sasabe, M., Ishikawa, T., … Friml, J. (2014). BEX1/ARF1A1C is required for BFA-sensitive recycling of PIN auxin transporters and auxin-mediated development in arabidopsis. <i>Plant and Cell Physiology</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/pcp/pct196\">https://doi.org/10.1093/pcp/pct196</a>","ama":"Tanaka H, Nodzyński T, Kitakura S, et al. BEX1/ARF1A1C is required for BFA-sensitive recycling of PIN auxin transporters and auxin-mediated development in arabidopsis. <i>Plant and Cell Physiology</i>. 2014;55(4):737-749. doi:<a href=\"https://doi.org/10.1093/pcp/pct196\">10.1093/pcp/pct196</a>"},"intvolume":"        55","volume":55,"day":"01","oa":1,"external_id":{"isi":["000334679500008"],"pmid":["24369434"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"date_created":"2018-12-11T11:56:25Z","year":"2014","article_processing_charge":"No","language":[{"iso":"eng"}],"publication":"Plant and Cell Physiology","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","publisher":"Oxford University Press","type":"journal_article","pubrep_id":"431","isi":1,"_id":"2223","oa_version":"Published Version","scopus_import":"1","ddc":["570"],"month":"04","page":"737 - 749","has_accepted_license":"1","date_published":"2014-04-01T00:00:00Z","issue":"4","file_date_updated":"2020-07-14T12:45:34Z","status":"public","pmid":1,"file":[{"relation":"main_file","date_created":"2018-12-12T10:14:25Z","content_type":"application/pdf","access_level":"open_access","creator":"system","date_updated":"2020-07-14T12:45:34Z","file_id":"5076","file_size":2028111,"checksum":"b781a76b32ac35a520256453c3ba9433","file_name":"IST-2016-431-v1+1_Plant_Cell_Physiol-2014-Tanaka-737-49.pdf"}],"doi":"10.1093/pcp/pct196","publication_identifier":{"issn":["0032-0781"]},"license":"https://creativecommons.org/licenses/by-nc/4.0/","quality_controlled":"1","department":[{"_id":"JiFr"}],"ec_funded":1,"fulldoi":"https://doi.org/10.1093/pcp/pct196"},{"department":[{"_id":"BjHo"}],"fulldoi":"https://doi.org/10.1088/0169-5983/46/2/025503","doi":"10.1088/0169-5983/46/2/025503","publication_identifier":{"issn":["0169-5983"]},"corr_author":"1","quality_controlled":"1","status":"public","issue":"2","date_published":"2014-04-01T00:00:00Z","isi":1,"oa_version":"None","_id":"2224","scopus_import":"1","month":"04","publisher":"IOP Publishing","type":"journal_article","language":[{"iso":"eng"}],"publication":"Fluid Dynamics Research","publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2014","date_created":"2018-12-11T11:56:25Z","article_processing_charge":"No","external_id":{"isi":["000334075800003"]},"intvolume":"        46","citation":{"ieee":"S. Altmeyer, “On secondary instabilities generating footbridges between spiral vortex flow,” <i>Fluid Dynamics Research</i>, vol. 46, no. 2. IOP Publishing, 2014.","apa":"Altmeyer, S. (2014). On secondary instabilities generating footbridges between spiral vortex flow. <i>Fluid Dynamics Research</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/0169-5983/46/2/025503\">https://doi.org/10.1088/0169-5983/46/2/025503</a>","ista":"Altmeyer S. 2014. On secondary instabilities generating footbridges between spiral vortex flow. Fluid Dynamics Research. 46(2), 025503.","chicago":"Altmeyer, Sebastian. “On Secondary Instabilities Generating Footbridges between Spiral Vortex Flow.” <i>Fluid Dynamics Research</i>. IOP Publishing, 2014. <a href=\"https://doi.org/10.1088/0169-5983/46/2/025503\">https://doi.org/10.1088/0169-5983/46/2/025503</a>.","short":"S. Altmeyer, Fluid Dynamics Research 46 (2014).","mla":"Altmeyer, Sebastian. “On Secondary Instabilities Generating Footbridges between Spiral Vortex Flow.” <i>Fluid Dynamics Research</i>, vol. 46, no. 2, 025503, IOP Publishing, 2014, doi:<a href=\"https://doi.org/10.1088/0169-5983/46/2/025503\">10.1088/0169-5983/46/2/025503</a>.","ama":"Altmeyer S. On secondary instabilities generating footbridges between spiral vortex flow. <i>Fluid Dynamics Research</i>. 2014;46(2). doi:<a href=\"https://doi.org/10.1088/0169-5983/46/2/025503\">10.1088/0169-5983/46/2/025503</a>"},"volume":46,"day":"01","article_number":"025503","publist_id":"4740","author":[{"full_name":"Altmeyer, Sebastian","orcid":"0000-0001-5964-0203","first_name":"Sebastian","last_name":"Altmeyer","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"This work investigates the transition between different traveling helical waves (spirals, SPIs) in the setup of differentially independent rotating cylinders. We use direct numerical simulations to consider an infinite long and periodic Taylor-Couette apparatus with fixed axial periodicity length. We find so-called mixed-cross-spirals (MCSs), that can be seen as nonlinear superpositions of SPIs, to establish stable footbridges connecting SPI states. While bridging the bifurcation branches of SPIs, the corresponding contributions within the MCS vary continuously with the control parameters. Here discussed MCSs presenting footbridge solutions start and end in different SPI branches. Therefore they differ significantly from the already known MCSs that present bypass solutions (Altmeyer and Hoffmann 2010 New J. Phys. 12 113035). The latter start and end in the same SPI branch, while they always bifurcate out of those SPI branches with the larger mode amplitude. Meanwhile, these only appear within the coexisting region of both SPIs. In contrast, the footbridge solutions can also bifurcate out of the minor SPI contribution. We also find they exist in regions where only one of the SPIs contributions exists. In addition, MCS as footbridge solution can appear either stable or unstable. The latter detected transient solutions offer similar spatio-temporal characteristics to the flow establishing stable footbridges. Such transition processes are interesting for pattern-forming systems in general because they accomplish transitions between traveling waves of different azimuthal wave numbers and have not been described in the literature yet."}],"date_updated":"2026-04-16T10:07:46Z","title":"On secondary instabilities generating footbridges between spiral vortex flow"},{"date_published":"2014-03-15T00:00:00Z","has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:34Z","status":"public","doi":"10.1214/EJP.v19-3054","publication_identifier":{"issn":["1083-6489"]},"file":[{"file_id":"5055","access_level":"open_access","date_updated":"2020-07-14T12:45:34Z","creator":"system","file_name":"IST-2016-427-v1+1_3054-16624-4-PB.pdf","file_size":810150,"checksum":"7eb297ff367a2ee73b21b6dd1e1948e4","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:14:06Z"}],"quality_controlled":"1","department":[{"_id":"LaEr"}],"ec_funded":1,"fulldoi":"https://doi.org/10.1214/EJP.v19-3054","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","language":[{"iso":"eng"}],"publication":"Electronic Journal of Probability","type":"journal_article","publisher":"Institute of Mathematical Statistics","pubrep_id":"427","oa_version":"Published Version","_id":"2225","scopus_import":"1","isi":1,"ddc":["510"],"month":"03","external_id":{"isi":["000340998500001"]},"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"year":"2014","date_created":"2018-12-11T11:56:25Z","article_processing_charge":"No","date_updated":"2025-09-29T11:26:42Z","title":"Isotropic local laws for sample covariance and generalized Wigner matrices","abstract":[{"text":"We consider sample covariance matrices of the form X∗X, where X is an M×N matrix with independent random entries.  We prove the isotropic local Marchenko-Pastur law, i.e. we prove that the resolvent (X∗X−z)−1 converges to a multiple of the identity in the sense of quadratic forms. More precisely, we establish sharp high-probability bounds on the quantity ⟨v,(X∗X−z)−1w⟩−⟨v,w⟩m(z), where m is the Stieltjes transform of the Marchenko-Pastur law and v,w∈CN. We require the logarithms of the dimensions M and N to be comparable. Our result holds down to scales Iz≥N−1+ε and throughout the entire spectrum away from 0. We also prove analogous results for generalized Wigner matrices.\r\n","lang":"eng"}],"author":[{"first_name":"Alex","last_name":"Bloemendal","full_name":"Bloemendal, Alex"},{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Knowles, Antti","first_name":"Antti","last_name":"Knowles"},{"full_name":"Yau, Horng","last_name":"Yau","first_name":"Horng"},{"last_name":"Yin","first_name":"Jun","full_name":"Yin, Jun"}],"article_number":"33","publist_id":"4739","volume":19,"citation":{"apa":"Bloemendal, A., Erdös, L., Knowles, A., Yau, H., &#38; Yin, J. (2014). Isotropic local laws for sample covariance and generalized Wigner matrices. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/EJP.v19-3054\">https://doi.org/10.1214/EJP.v19-3054</a>","ieee":"A. Bloemendal, L. Erdös, A. Knowles, H. Yau, and J. Yin, “Isotropic local laws for sample covariance and generalized Wigner matrices,” <i>Electronic Journal of Probability</i>, vol. 19. Institute of Mathematical Statistics, 2014.","ista":"Bloemendal A, Erdös L, Knowles A, Yau H, Yin J. 2014. Isotropic local laws for sample covariance and generalized Wigner matrices. Electronic Journal of Probability. 19, 33.","chicago":"Bloemendal, Alex, László Erdös, Antti Knowles, Horng Yau, and Jun Yin. “Isotropic Local Laws for Sample Covariance and Generalized Wigner Matrices.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2014. <a href=\"https://doi.org/10.1214/EJP.v19-3054\">https://doi.org/10.1214/EJP.v19-3054</a>.","mla":"Bloemendal, Alex, et al. “Isotropic Local Laws for Sample Covariance and Generalized Wigner Matrices.” <i>Electronic Journal of Probability</i>, vol. 19, 33, Institute of Mathematical Statistics, 2014, doi:<a href=\"https://doi.org/10.1214/EJP.v19-3054\">10.1214/EJP.v19-3054</a>.","short":"A. Bloemendal, L. Erdös, A. Knowles, H. Yau, J. Yin, Electronic Journal of Probability 19 (2014).","ama":"Bloemendal A, Erdös L, Knowles A, Yau H, Yin J. Isotropic local laws for sample covariance and generalized Wigner matrices. <i>Electronic Journal of Probability</i>. 2014;19. doi:<a href=\"https://doi.org/10.1214/EJP.v19-3054\">10.1214/EJP.v19-3054</a>"},"intvolume":"        19","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","call_identifier":"FP7"}],"day":"15"}]