[{"article_type":"original","issue":"11","scopus_import":"1","quality_controlled":"1","intvolume":"        16","date_created":"2026-03-30T12:22:47Z","OA_type":"closed access","doi":"10.1021/acs.nanolett.6b03626","date_published":"2016-10-24T00:00:00Z","extern":"1","abstract":[{"lang":"eng","text":"In this Letter, we demonstrate highly efficient, polarization-insensitive planar lenses (metalenses) at red, green, and blue wavelengths (λ = 660, 532, and 405 nm). Metalenses with numerical apertures (NA) of 0.85 and 0.6 and corresponding efficiencies as high as 60% and 90% are achieved. These metalenses are less than 600 nm-thick and can focus incident light down to diffraction-limited spots as small as ∼0.64λ and provide high-resolution imaging. In addition, the focal spots are very symmetric with high Strehl ratios. The single step lithography and compatibility with large-scale fabrication processes make metalenses highly promising for widespread applications in imaging and spectroscopy."}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]},"article_processing_charge":"No","year":"2016","citation":{"ama":"Khorasaninejad M, Zhu AY, Roques-Carmes C, et al. Polarization-insensitive metalenses at visible wavelengths. <i>Nano Letters</i>. 2016;16(11):7229-7234. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.6b03626\">10.1021/acs.nanolett.6b03626</a>","ieee":"M. Khorasaninejad <i>et al.</i>, “Polarization-insensitive metalenses at visible wavelengths,” <i>Nano Letters</i>, vol. 16, no. 11. American Chemical Society, pp. 7229–7234, 2016.","apa":"Khorasaninejad, M., Zhu, A. Y., Roques-Carmes, C., Chen, W. T., Oh, J., Mishra, I., … Capasso, F. (2016). Polarization-insensitive metalenses at visible wavelengths. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.nanolett.6b03626\">https://doi.org/10.1021/acs.nanolett.6b03626</a>","chicago":"Khorasaninejad, M., A. Y. Zhu, Charles Roques-Carmes, W. T. Chen, J. Oh, I. Mishra, R. C. Devlin, and F. Capasso. “Polarization-Insensitive Metalenses at Visible Wavelengths.” <i>Nano Letters</i>. American Chemical Society, 2016. <a href=\"https://doi.org/10.1021/acs.nanolett.6b03626\">https://doi.org/10.1021/acs.nanolett.6b03626</a>.","ista":"Khorasaninejad M, Zhu AY, Roques-Carmes C, Chen WT, Oh J, Mishra I, Devlin RC, Capasso F. 2016. Polarization-insensitive metalenses at visible wavelengths. Nano Letters. 16(11), 7229–7234.","short":"M. Khorasaninejad, A.Y. Zhu, C. Roques-Carmes, W.T. Chen, J. Oh, I. Mishra, R.C. Devlin, F. Capasso, Nano Letters 16 (2016) 7229–7234.","mla":"Khorasaninejad, M., et al. “Polarization-Insensitive Metalenses at Visible Wavelengths.” <i>Nano Letters</i>, vol. 16, no. 11, American Chemical Society, 2016, pp. 7229–34, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.6b03626\">10.1021/acs.nanolett.6b03626</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Khorasaninejad, M.","last_name":"Khorasaninejad","first_name":"M."},{"full_name":"Zhu, A. Y.","last_name":"Zhu","first_name":"A. Y."},{"full_name":"Roques-Carmes, Charles","last_name":"Roques-Carmes","first_name":"Charles","id":"e2e68fc9-6505-11ef-a541-eb4e72cc3e82"},{"first_name":"W. T.","last_name":"Chen","full_name":"Chen, W. T."},{"last_name":"Oh","full_name":"Oh, J.","first_name":"J."},{"full_name":"Mishra, I.","last_name":"Mishra","first_name":"I."},{"first_name":"R. C.","last_name":"Devlin","full_name":"Devlin, R. C."},{"full_name":"Capasso, F.","last_name":"Capasso","first_name":"F."}],"title":"Polarization-insensitive metalenses at visible wavelengths","date_updated":"2026-04-15T11:53:17Z","external_id":{"pmid":["27791380"]},"publisher":"American Chemical Society","publication":"Nano Letters","day":"24","_id":"21522","oa_version":"None","pmid":1,"volume":16,"month":"10","keyword":["Metasurface","polarization-insensitive metalenses","visible wavelength","titanium dioxide"],"type":"journal_article","publication_status":"published","page":"7229-7234","status":"public","ddc":["530"]},{"conference":{"location":"Liverpool, United Kingdom","name":"SAGT: Symposium on Algorithmic Game Theory","end_date":"2016-09-21","start_date":"2016-09-19"},"alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability."}],"date_published":"2016-09-01T00:00:00Z","scopus_import":"1","quality_controlled":"1","pubrep_id":"645","file_date_updated":"2020-07-14T12:44:45Z","doi":"10.1007/978-3-662-53354-3_13","date_created":"2018-12-11T11:51:28Z","intvolume":"      9928","author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","first_name":"Guy","last_name":"Avni","full_name":"Avni, Guy"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"title":"Dynamic resource allocation games","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"relation":"later_version","id":"6761","status":"public"}]},"date_updated":"2026-04-16T09:35:14Z","isi":1,"article_processing_charge":"No","publist_id":"5926","language":[{"iso":"eng"}],"citation":{"ama":"Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. In: Vol 9928. Springer; 2016:153-166. doi:<a href=\"https://doi.org/10.1007/978-3-662-53354-3_13\">10.1007/978-3-662-53354-3_13</a>","ieee":"G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom, 2016, vol. 9928, pp. 153–166.","apa":"Avni, G., Henzinger, T. A., &#38; Kupferman, O. (2016). Dynamic resource allocation games (Vol. 9928, pp. 153–166). Presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-662-53354-3_13\">https://doi.org/10.1007/978-3-662-53354-3_13</a>","short":"G. Avni, T.A. Henzinger, O. Kupferman, in:, Springer, 2016, pp. 153–166.","ista":"Avni G, Henzinger TA, Kupferman O. 2016. Dynamic resource allocation games. SAGT: Symposium on Algorithmic Game Theory, LNCS, vol. 9928, 153–166.","chicago":"Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation Games,” 9928:153–66. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53354-3_13\">https://doi.org/10.1007/978-3-662-53354-3_13</a>.","mla":"Avni, Guy, et al. <i>Dynamic Resource Allocation Games</i>. Vol. 9928, Springer, 2016, pp. 153–66, doi:<a href=\"https://doi.org/10.1007/978-3-662-53354-3_13\">10.1007/978-3-662-53354-3_13</a>."},"year":"2016","ec_funded":1,"_id":"1341","day":"01","oa_version":"Preprint","has_accepted_license":"1","publisher":"Springer","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000389020400013"]},"page":"153 - 166","acknowledgement":"This research was supported in part by the European Research Council (ERC) under grants 267989 (QUAREM) and 278410 (QUALITY), and by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award).","status":"public","oa":1,"ddc":["000"],"month":"09","file":[{"date_updated":"2020-07-14T12:44:45Z","content_type":"application/pdf","creator":"system","relation":"main_file","access_level":"open_access","file_name":"IST-2016-645-v1+1_sagt-cr.pdf","checksum":"0825eefd4e22774f6f62cb7d7389b05a","date_created":"2018-12-12T10:14:22Z","file_size":243458,"file_id":"5073"}],"corr_author":"1","volume":9928,"publication_status":"published","type":"conference"},{"external_id":{"isi":["000387165600018"]},"project":[{"name":"Cytoskeletal force generation and force transduction of migrating leukocytes","grant_number":"281556","call_identifier":"FP7","_id":"25A603A2-B435-11E9-9278-68D0E5697425"}],"publisher":"Nature Publishing Group","acknowledged_ssus":[{"_id":"SSU"}],"has_accepted_license":"1","oa_version":"Submitted Version","tmp":{"short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"publication":"Nature Cell Biology","day":"24","_id":"1321","ec_funded":1,"publication_status":"published","type":"journal_article","volume":18,"corr_author":"1","month":"10","file":[{"creator":"dernst","date_updated":"2020-07-14T12:44:43Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"2018_NatureCell_Leithner.pdf","file_size":4433280,"checksum":"e1411cb7c99a2d9089c178a6abef25e7","date_created":"2020-05-14T16:33:46Z","file_id":"7844"}],"oa":1,"ddc":["570"],"status":"public","acknowledgement":"This work was supported by the German Research Foundation (DFG) Priority Program SP 1464 to T.E.B.S. and M.S., and European Research Council (ERC GA 281556) and Human Frontiers Program grants to M.S.\r\nService Units of IST Austria for excellent technical support.","page":"1253 - 1259","intvolume":"        18","date_created":"2018-12-11T11:51:21Z","doi":"10.1038/ncb3426","file_date_updated":"2020-07-14T12:44:43Z","article_type":"original","quality_controlled":"1","scopus_import":"1","date_published":"2016-10-24T00:00:00Z","abstract":[{"text":"Most migrating cells extrude their front by the force of actin polymerization. Polymerization requires an initial nucleation step, which is mediated by factors establishing either parallel filaments in the case of filopodia or branched filaments that form the branched lamellipodial network. Branches are considered essential for regular cell motility and are initiated by the Arp2/3 complex, which in turn is activated by nucleation-promoting factors of the WASP and WAVE families. Here we employed rapid amoeboid crawling leukocytes and found that deletion of the WAVE complex eliminated actin branching and thus lamellipodia formation. The cells were left with parallel filaments at the leading edge, which translated, depending on the differentiation status of the cell, into a unipolar pointed cell shape or cells with multiple filopodia. Remarkably, unipolar cells migrated with increased speed and enormous directional persistence, while they were unable to turn towards chemotactic gradients. Cells with multiple filopodia retained chemotactic activity but their migration was progressively impaired with increasing geometrical complexity of the extracellular environment. These findings establish that diversified leading edge protrusions serve as explorative structures while they slow down actual locomotion.","lang":"eng"}],"department":[{"_id":"MiSi"},{"_id":"NanoFab"},{"_id":"Bio"}],"year":"2016","citation":{"mla":"Leithner, Alexander F., et al. “Diversified Actin Protrusions Promote Environmental Exploration but Are Dispensable for Locomotion of Leukocytes.” <i>Nature Cell Biology</i>, vol. 18, Nature Publishing Group, 2016, pp. 1253–59, doi:<a href=\"https://doi.org/10.1038/ncb3426\">10.1038/ncb3426</a>.","chicago":"Leithner, Alexander F, Alexander Eichner, Jan Müller, Anne Reversat, Markus Brown, Jan Schwarz, Jack Merrin, et al. “Diversified Actin Protrusions Promote Environmental Exploration but Are Dispensable for Locomotion of Leukocytes.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/ncb3426\">https://doi.org/10.1038/ncb3426</a>.","short":"A.F. Leithner, A. Eichner, J. Müller, A. Reversat, M. Brown, J. Schwarz, J. Merrin, D. De Gorter, F.K. Schur, J. Bayerl, I. de Vries, S. Wieser, R. Hauschild, F. Lai, M. Moser, D. Kerjaschki, K. Rottner, V. Small, T. Stradal, M.K. Sixt, Nature Cell Biology 18 (2016) 1253–1259.","ista":"Leithner AF, Eichner A, Müller J, Reversat A, Brown M, Schwarz J, Merrin J, De Gorter D, Schur FK, Bayerl J, de Vries I, Wieser S, Hauschild R, Lai F, Moser M, Kerjaschki D, Rottner K, Small V, Stradal T, Sixt MK. 2016. Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes. Nature Cell Biology. 18, 1253–1259.","apa":"Leithner, A. F., Eichner, A., Müller, J., Reversat, A., Brown, M., Schwarz, J., … Sixt, M. K. (2016). Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes. <i>Nature Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncb3426\">https://doi.org/10.1038/ncb3426</a>","ieee":"A. F. Leithner <i>et al.</i>, “Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes,” <i>Nature Cell Biology</i>, vol. 18. Nature Publishing Group, pp. 1253–1259, 2016.","ama":"Leithner AF, Eichner A, Müller J, et al. Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes. <i>Nature Cell Biology</i>. 2016;18:1253-1259. doi:<a href=\"https://doi.org/10.1038/ncb3426\">10.1038/ncb3426</a>"},"language":[{"iso":"eng"}],"publist_id":"5949","article_processing_charge":"No","date_updated":"2026-04-21T22:30:04Z","isi":1,"related_material":{"record":[{"status":"public","id":"323","relation":"dissertation_contains"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes","author":[{"id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1073-744X","first_name":"Alexander F","last_name":"Leithner","full_name":"Leithner, Alexander F"},{"id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander","last_name":"Eichner","full_name":"Eichner, Alexander"},{"id":"AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D","first_name":"Jan","last_name":"Müller","full_name":"Müller, Jan"},{"full_name":"Reversat, Anne","last_name":"Reversat","orcid":"0000-0003-0666-8928","first_name":"Anne","id":"35B76592-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Markus","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Markus","last_name":"Brown"},{"first_name":"Jan","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87","full_name":"Schwarz, Jan","last_name":"Schwarz"},{"orcid":"0000-0001-5145-4609","first_name":"Jack","id":"4515C308-F248-11E8-B48F-1D18A9856A87","full_name":"Merrin, Jack","last_name":"Merrin"},{"first_name":"David","full_name":"De Gorter, David","last_name":"De Gorter"},{"last_name":"Schur","full_name":"Schur, Florian","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","orcid":"0000-0003-4790-8078"},{"last_name":"Bayerl","full_name":"Bayerl, Jonathan","first_name":"Jonathan"},{"last_name":"De Vries","full_name":"De Vries, Ingrid","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","first_name":"Ingrid"},{"orcid":"0000-0002-2670-2217","first_name":"Stefan","id":"355AA5A0-F248-11E8-B48F-1D18A9856A87","full_name":"Wieser, Stefan","last_name":"Wieser"},{"full_name":"Hauschild, Robert","last_name":"Hauschild","first_name":"Robert","orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Frank","full_name":"Lai, Frank","last_name":"Lai"},{"first_name":"Markus","full_name":"Moser, Markus","last_name":"Moser"},{"first_name":"Dontscho","last_name":"Kerjaschki","full_name":"Kerjaschki, Dontscho"},{"first_name":"Klemens","last_name":"Rottner","full_name":"Rottner, Klemens"},{"first_name":"Victor","full_name":"Small, Victor","last_name":"Small"},{"first_name":"Theresia","last_name":"Stradal","full_name":"Stradal, Theresia"},{"last_name":"Sixt","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K"}]},{"type":"journal_article","publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:44:37Z","creator":"system","file_id":"5030","date_created":"2018-12-12T10:13:44Z","checksum":"7fe01ab12a6610d3db421e0136db2f77","file_size":73907957,"file_name":"IST-2017-771-v1+1_Tarlungeanu_et_al._Final_edited.pdf"}],"month":"12","volume":167,"oa":1,"status":"public","ddc":["576","616"],"page":"1481 - 1494","acknowledgement":"This work was supported by NICHD (P01HD070494) and SFARI (grant 275275) to J.G.G., and FWF (SFB35_3523) to G.N.\r\nWe thank A.C. Manzano, Mike Liu, and F. Marr for technical assistance, and R. Shigemoto and the IST Austria Electron Microscopy (EM) Facility for assistance. We acknowledge support from CIDR for genome-wide SNP analysis (X01HG008823) and Broad Institute Center for Mendelian Disorders (UM1HG008900 to D. MacArthur), the Yale Center for Mendelian Disorders (U54HG006504 to M.G.), the Gregory M. Kiez and Mehmet Kutman Foundation (M.G.), Italian Ministry of Instruction University and Research (PON01_00937 to C.I.), and NIH (R01-GM108911 to A.S.). This work was supported by NICHD (P01HD070494) and SFARI (grant 275275) to J.G.G., and FWF (SFB35_3523) to G.N.\r\n\r\n#EMFacility","external_id":{"isi":["000389470500012"]},"project":[{"call_identifier":"FWF","grant_number":"F03523","_id":"25473368-B435-11E9-9278-68D0E5697425","name":"Transmembrane Transporters in Health and Disease"}],"publisher":"Cell Press","has_accepted_license":"1","oa_version":"Submitted Version","_id":"1183","day":"01","publication":"Cell","citation":{"ama":"Tarlungeanu D-C, Deliu E, Dotter C, et al. Impaired amino acid transport at the blood brain barrier is a cause of autism spectrum disorder. <i>Cell</i>. 2016;167(6):1481-1494. doi:<a href=\"https://doi.org/10.1016/j.cell.2016.11.013\">10.1016/j.cell.2016.11.013</a>","ieee":"D.-C. Tarlungeanu <i>et al.</i>, “Impaired amino acid transport at the blood brain barrier is a cause of autism spectrum disorder,” <i>Cell</i>, vol. 167, no. 6. Cell Press, pp. 1481–1494, 2016.","apa":"Tarlungeanu, D.-C., Deliu, E., Dotter, C., Kara, M., Janiesch, P., Scalise, M., … Novarino, G. (2016). Impaired amino acid transport at the blood brain barrier is a cause of autism spectrum disorder. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2016.11.013\">https://doi.org/10.1016/j.cell.2016.11.013</a>","short":"D.-C. Tarlungeanu, E. Deliu, C. Dotter, M. Kara, P. Janiesch, M. Scalise, M. Galluccio, M. Tesulov, E. Morelli, F. Sönmez, K. Bilgüvar, R. Ohgaki, Y. Kanai, A. Johansen, S. Esharif, T. Ben Omran, M. Topcu, A. Schlessinger, C. Indiveri, K. Duncan, A. Caglayan, M. Günel, J. Gleeson, G. Novarino, Cell 167 (2016) 1481–1494.","ista":"Tarlungeanu D-C, Deliu E, Dotter C, Kara M, Janiesch P, Scalise M, Galluccio M, Tesulov M, Morelli E, Sönmez F, Bilgüvar K, Ohgaki R, Kanai Y, Johansen A, Esharif S, Ben Omran T, Topcu M, Schlessinger A, Indiveri C, Duncan K, Caglayan A, Günel M, Gleeson J, Novarino G. 2016. Impaired amino acid transport at the blood brain barrier is a cause of autism spectrum disorder. Cell. 167(6), 1481–1494.","chicago":"Tarlungeanu, Dora-Clara, Elena Deliu, Christoph Dotter, Majdi Kara, Philipp Janiesch, Mariafrancesca Scalise, Michele Galluccio, et al. “Impaired Amino Acid Transport at the Blood Brain Barrier Is a Cause of Autism Spectrum Disorder.” <i>Cell</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.cell.2016.11.013\">https://doi.org/10.1016/j.cell.2016.11.013</a>.","mla":"Tarlungeanu, Dora-Clara, et al. “Impaired Amino Acid Transport at the Blood Brain Barrier Is a Cause of Autism Spectrum Disorder.” <i>Cell</i>, vol. 167, no. 6, Cell Press, 2016, pp. 1481–94, doi:<a href=\"https://doi.org/10.1016/j.cell.2016.11.013\">10.1016/j.cell.2016.11.013</a>."},"year":"2016","article_processing_charge":"No","language":[{"iso":"eng"}],"publist_id":"6170","related_material":{"record":[{"status":"public","id":"395","relation":"dissertation_contains"}]},"isi":1,"date_updated":"2026-04-21T22:30:53Z","author":[{"last_name":"Tarlungeanu","full_name":"Tarlungeanu, Dora-Clara","id":"2ABCE612-F248-11E8-B48F-1D18A9856A87","first_name":"Dora-Clara"},{"full_name":"Deliu, Elena","last_name":"Deliu","first_name":"Elena","orcid":"0000-0002-7370-5293","id":"37A40D7E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christoph","orcid":"0000-0002-9033-9096","id":"4C66542E-F248-11E8-B48F-1D18A9856A87","full_name":"Dotter, Christoph","last_name":"Dotter"},{"last_name":"Kara","full_name":"Kara, Majdi","first_name":"Majdi"},{"first_name":"Philipp","full_name":"Janiesch, Philipp","last_name":"Janiesch"},{"first_name":"Mariafrancesca","full_name":"Scalise, Mariafrancesca","last_name":"Scalise"},{"first_name":"Michele","last_name":"Galluccio","full_name":"Galluccio, Michele"},{"first_name":"Mateja","last_name":"Tesulov","full_name":"Tesulov, Mateja"},{"first_name":"Emanuela","id":"3F4D1282-F248-11E8-B48F-1D18A9856A87","full_name":"Morelli, Emanuela","last_name":"Morelli"},{"last_name":"Sönmez","full_name":"Sönmez, Fatma","first_name":"Fatma"},{"last_name":"Bilgüvar","full_name":"Bilgüvar, Kaya","first_name":"Kaya"},{"full_name":"Ohgaki, Ryuichi","last_name":"Ohgaki","first_name":"Ryuichi"},{"first_name":"Yoshikatsu","full_name":"Kanai, Yoshikatsu","last_name":"Kanai"},{"full_name":"Johansen, Anide","last_name":"Johansen","first_name":"Anide"},{"first_name":"Seham","last_name":"Esharif","full_name":"Esharif, Seham"},{"first_name":"Tawfeg","last_name":"Ben Omran","full_name":"Ben Omran, Tawfeg"},{"last_name":"Topcu","full_name":"Topcu, Meral","first_name":"Meral"},{"last_name":"Schlessinger","full_name":"Schlessinger, Avner","first_name":"Avner"},{"first_name":"Cesare","full_name":"Indiveri, Cesare","last_name":"Indiveri"},{"first_name":"Kent","last_name":"Duncan","full_name":"Duncan, Kent"},{"first_name":"Ahmet","last_name":"Caglayan","full_name":"Caglayan, Ahmet"},{"first_name":"Murat","full_name":"Günel, Murat","last_name":"Günel"},{"first_name":"Joseph","full_name":"Gleeson, Joseph","last_name":"Gleeson"},{"full_name":"Novarino, Gaia","last_name":"Novarino","first_name":"Gaia","orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Impaired amino acid transport at the blood brain barrier is a cause of autism spectrum disorder","doi":"10.1016/j.cell.2016.11.013","intvolume":"       167","date_created":"2018-12-11T11:50:35Z","scopus_import":"1","quality_controlled":"1","file_date_updated":"2020-07-14T12:44:37Z","pubrep_id":"771","article_type":"original","issue":"6","abstract":[{"text":"Autism spectrum disorders (ASD) are a group of genetic disorders often overlapping with other neurological conditions. We previously described abnormalities in the branched-chain amino acid (BCAA) catabolic pathway as a cause of ASD. Here, we show that the solute carrier transporter 7a5 (SLC7A5), a large neutral amino acid transporter localized at the blood brain barrier (BBB), has an essential role in maintaining normal levels of brain BCAAs. In mice, deletion of Slc7a5 from the endothelial cells of the BBB leads to atypical brain amino acid profile, abnormal mRNA translation, and severe neurological abnormalities. Furthermore, we identified several patients with autistic traits and motor delay carrying deleterious homozygous mutations in the SLC7A5 gene. Finally, we demonstrate that BCAA intracerebroventricular administration ameliorates abnormal behaviors in adult mutant mice. Our data elucidate a neurological syndrome defined by SLC7A5 mutations and support an essential role for the BCAA in human brain function.","lang":"eng"}],"date_published":"2016-12-01T00:00:00Z","department":[{"_id":"GaNo"}]},{"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"ec_funded":1,"_id":"1100","day":"19","publication":"Cell Reports","acknowledged_ssus":[{"_id":"SSU"}],"project":[{"_id":"2529486C-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"T 560-B17","name":"Cell- and Tissue Mechanics in Zebrafish Germ Layer Formation"},{"_id":"2527D5CC-B435-11E9-9278-68D0E5697425","grant_number":"I812-B12","call_identifier":"FWF","name":"Cell Cortex and Germ Layer Formation in Zebrafish Gastrulation"},{"_id":"25548C20-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"303564","name":"Microbial Ion Channels for Synthetic Neurobiology"}],"external_id":{"isi":["000380264200024"]},"publisher":"Cell Press","has_accepted_license":"1","status":"public","oa":1,"ddc":["570","576"],"page":"866 - 877","acknowledgement":"We are grateful to members of the C.-P.H. and H.J. labs for discussions, R. Hauschild and the different Scientific Service Units at IST Austria for technical help, M. Dravecka for performing initial experiments, A. Schier for reading an earlier version of the manuscript, K.W. Rogers for technical help, and C. Hill, A. Bruce, and L. Solnica-Krezel for sending plasmids. This work was supported by grants from the Austrian Science Foundation (FWF): (T560-B17) and (I 812-B12) to V.R. and C.-P.H., and from the European Union (EU FP7): (6275) to H.J. A.I.-P. is supported by a Ramon Areces fellowship.","type":"journal_article","publication_status":"published","month":"07","file":[{"file_id":"4857","file_name":"IST-2017-754-v1+1_1-s2.0-S2211124716307768-main.pdf","file_size":3921947,"date_created":"2018-12-12T10:11:04Z","access_level":"open_access","relation":"main_file","creator":"system","date_updated":"2018-12-12T10:11:04Z","content_type":"application/pdf"}],"volume":16,"abstract":[{"lang":"eng","text":"During metazoan development, the temporal pattern of morphogen signaling is critical for organizing cell fates in space and time. Yet, tools for temporally controlling morphogen signaling within the embryo are still scarce. Here, we developed a photoactivatable Nodal receptor to determine how the temporal pattern of Nodal signaling affects cell fate specification during zebrafish gastrulation. By using this receptor to manipulate the duration of Nodal signaling in vivo by light, we show that extended Nodal signaling within the organizer promotes prechordal plate specification and suppresses endoderm differentiation. Endoderm differentiation is suppressed by extended Nodal signaling inducing expression of the transcriptional repressor goosecoid (gsc) in prechordal plate progenitors, which in turn restrains Nodal signaling from upregulating the endoderm differentiation gene sox17 within these cells. Thus, optogenetic manipulation of Nodal signaling identifies a critical role of Nodal signaling duration for organizer cell fate specification during gastrulation."}],"date_published":"2016-07-19T00:00:00Z","department":[{"_id":"CaHe"},{"_id":"HaJa"}],"doi":"10.1016/j.celrep.2016.06.036","intvolume":"        16","date_created":"2018-12-11T11:50:08Z","scopus_import":"1","quality_controlled":"1","file_date_updated":"2018-12-12T10:11:04Z","pubrep_id":"754","issue":"3","related_material":{"record":[{"relation":"dissertation_contains","id":"961","status":"public"},{"id":"50","relation":"dissertation_contains","status":"public"}]},"date_updated":"2026-04-21T22:31:00Z","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"first_name":"Keisuke","orcid":"0000-0002-6453-8075","id":"3BED66BE-F248-11E8-B48F-1D18A9856A87","full_name":"Sako, Keisuke","last_name":"Sako"},{"last_name":"Pradhan","full_name":"Pradhan, Saurabh","first_name":"Saurabh"},{"last_name":"Barone","full_name":"Barone, Vanessa","id":"419EECCC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2676-3367","first_name":"Vanessa"},{"orcid":"0000-0002-5409-8571","first_name":"Álvaro","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","full_name":"Inglés Prieto, Álvaro","last_name":"Inglés Prieto"},{"first_name":"Patrick","full_name":"Mueller, Patrick","last_name":"Mueller"},{"full_name":"Ruprecht, Verena","last_name":"Ruprecht","orcid":"0000-0003-4088-8633","first_name":"Verena","id":"4D71A03A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniel","orcid":"0000-0001-5199-9940","id":"31C42484-F248-11E8-B48F-1D18A9856A87","full_name":"Capek, Daniel","last_name":"Capek"},{"last_name":"Galande","full_name":"Galande, Sanjeev","first_name":"Sanjeev"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","first_name":"Harald L","orcid":"0000-0002-8023-9315","last_name":"Janovjak","full_name":"Janovjak, Harald L"},{"last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J"}],"title":"Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation","citation":{"ieee":"K. Sako <i>et al.</i>, “Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation,” <i>Cell Reports</i>, vol. 16, no. 3. Cell Press, pp. 866–877, 2016.","ama":"Sako K, Pradhan S, Barone V, et al. Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation. <i>Cell Reports</i>. 2016;16(3):866-877. doi:<a href=\"https://doi.org/10.1016/j.celrep.2016.06.036\">10.1016/j.celrep.2016.06.036</a>","mla":"Sako, Keisuke, et al. “Optogenetic Control of Nodal Signaling Reveals a Temporal Pattern of Nodal Signaling Regulating Cell Fate Specification during Gastrulation.” <i>Cell Reports</i>, vol. 16, no. 3, Cell Press, 2016, pp. 866–77, doi:<a href=\"https://doi.org/10.1016/j.celrep.2016.06.036\">10.1016/j.celrep.2016.06.036</a>.","short":"K. Sako, S. Pradhan, V. Barone, Á. Inglés Prieto, P. Mueller, V. Ruprecht, D. Capek, S. Galande, H.L. Janovjak, C.-P.J. Heisenberg, Cell Reports 16 (2016) 866–877.","ista":"Sako K, Pradhan S, Barone V, Inglés Prieto Á, Mueller P, Ruprecht V, Capek D, Galande S, Janovjak HL, Heisenberg C-PJ. 2016. Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation. Cell Reports. 16(3), 866–877.","chicago":"Sako, Keisuke, Saurabh Pradhan, Vanessa Barone, Álvaro Inglés Prieto, Patrick Mueller, Verena Ruprecht, Daniel Capek, Sanjeev Galande, Harald L Janovjak, and Carl-Philipp J Heisenberg. “Optogenetic Control of Nodal Signaling Reveals a Temporal Pattern of Nodal Signaling Regulating Cell Fate Specification during Gastrulation.” <i>Cell Reports</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.celrep.2016.06.036\">https://doi.org/10.1016/j.celrep.2016.06.036</a>.","apa":"Sako, K., Pradhan, S., Barone, V., Inglés Prieto, Á., Mueller, P., Ruprecht, V., … Heisenberg, C.-P. J. (2016). Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation. <i>Cell Reports</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.celrep.2016.06.036\">https://doi.org/10.1016/j.celrep.2016.06.036</a>"},"year":"2016","article_processing_charge":"No","language":[{"iso":"eng"}],"publist_id":"6275"},{"ec_funded":1,"_id":"1437","day":"11","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1510.07565"}],"publisher":"ACM","external_id":{"arxiv":["1510.07565"]},"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"page":"733 - 747","status":"public","oa":1,"month":"01","corr_author":"1","volume":"20-22","publication_status":"published","type":"conference","conference":{"end_date":"2016-01-22","location":"St. Petersburg, FL, USA","name":"POPL: Principles of Programming Languages","start_date":"2016-01-20"},"department":[{"_id":"KrCh"}],"alternative_title":["POPL"],"abstract":[{"text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time. Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.","lang":"eng"}],"arxiv":1,"date_published":"2016-01-11T00:00:00Z","scopus_import":1,"quality_controlled":"1","doi":"10.1145/2837614.2837624","date_created":"2018-12-11T11:52:01Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Goharshady, Amir","last_name":"Goharshady","orcid":"0000-0003-1702-6584","first_name":"Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","orcid":"0000-0003-4783-0389"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","orcid":"0000-0002-8943-0722"}],"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","related_material":{"record":[{"status":"public","id":"5441","relation":"earlier_version"},{"status":"public","relation":"earlier_version","id":"5442"},{"status":"public","id":"6009","relation":"later_version"},{"status":"public","id":"821","relation":"dissertation_contains"},{"relation":"dissertation_contains","id":"8934","status":"public"}]},"date_updated":"2026-04-21T22:31:02Z","publist_id":"5761","language":[{"iso":"eng"}],"citation":{"apa":"Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. <a href=\"https://doi.org/10.1145/2837614.2837624\">https://doi.org/10.1145/2837614.2837624</a>","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. <a href=\"https://doi.org/10.1145/2837614.2837624\">https://doi.org/10.1145/2837614.2837624</a>.","short":"K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.","ista":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL: Principles of Programming Languages, POPL, vol. 20–22, 733–747.","mla":"Chatterjee, Krishnendu, et al. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. Vol. 20–22, ACM, 2016, pp. 733–47, doi:<a href=\"https://doi.org/10.1145/2837614.2837624\">10.1145/2837614.2837624</a>.","ama":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. In: Vol 20-22. ACM; 2016:733-747. doi:<a href=\"https://doi.org/10.1145/2837614.2837624\">10.1145/2837614.2837624</a>","ieee":"K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747."},"year":"2016"},{"year":"2016","citation":{"apa":"Chatterjee, K., Fu, H., &#38; Goharshady, A. K. (2016). Termination analysis of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-41528-4_1\">https://doi.org/10.1007/978-3-319-41528-4_1</a>","mla":"Chatterjee, Krishnendu, et al. <i>Termination Analysis of Probabilistic Programs through Positivstellensatz’s</i>. Vol. 9779, Springer, 2016, pp. 3–22, doi:<a href=\"https://doi.org/10.1007/978-3-319-41528-4_1\">10.1007/978-3-319-41528-4_1</a>.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Termination Analysis of Probabilistic Programs through Positivstellensatz’s,” 9779:3–22. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-41528-4_1\">https://doi.org/10.1007/978-3-319-41528-4_1</a>.","ista":"Chatterjee K, Fu H, Goharshady AK. 2016. Termination analysis of probabilistic programs through Positivstellensatz’s. CAV: Computer Aided Verification, LNCS, vol. 9779, 3–22.","short":"K. Chatterjee, H. Fu, A.K. Goharshady, in:, Springer, 2016, pp. 3–22.","ieee":"K. Chatterjee, H. Fu, and A. K. Goharshady, “Termination analysis of probabilistic programs through Positivstellensatz’s,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9779, pp. 3–22.","ama":"Chatterjee K, Fu H, Goharshady AK. Termination analysis of probabilistic programs through Positivstellensatz’s. In: Vol 9779. Springer; 2016:3-22. doi:<a href=\"https://doi.org/10.1007/978-3-319-41528-4_1\">10.1007/978-3-319-41528-4_1</a>"},"language":[{"iso":"eng"}],"publist_id":"5824","article_processing_charge":"No","isi":1,"date_updated":"2026-04-21T22:31:03Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8934"}]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"orcid":"0000-0003-1702-6584","first_name":"Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir","last_name":"Goharshady"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Termination analysis of probabilistic programs through Positivstellensatz's","intvolume":"      9779","date_created":"2018-12-11T11:51:43Z","doi":"10.1007/978-3-319-41528-4_1","scopus_import":"1","quality_controlled":"1","date_published":"2016-07-01T00:00:00Z","arxiv":1,"abstract":[{"text":"We consider nondeterministic probabilistic programs with the most basic liveness property of termination. We present efficient methods for termination analysis of nondeterministic probabilistic programs with polynomial guards and assignments. Our approach is through synthesis of polynomial ranking supermartingales, that on one hand significantly generalizes linear ranking supermartingales and on the other hand is a counterpart of polynomial ranking-functions for proving termination of nonprobabilistic programs. The approach synthesizes polynomial ranking-supermartingales through Positivstellensatz's, yielding an efficient method which is not only sound, but also semi-complete over a large subclass of programs. We show experimental results to demonstrate that our approach can handle several classical programs with complex polynomial guards and assignments, and can synthesize efficient quadratic ranking-supermartingales when a linear one does not exist even for simple affine programs.","lang":"eng"}],"alternative_title":["LNCS"],"department":[{"_id":"KrCh"}],"conference":{"location":"Toronto, Canada","name":"CAV: Computer Aided Verification","end_date":"2016-07-23","start_date":"2016-07-17"},"publication_status":"published","type":"conference","volume":9779,"corr_author":"1","month":"07","status":"public","oa":1,"page":"3 - 22","external_id":{"isi":["000387731200001"],"arxiv":["1604.07169"]},"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"}],"publisher":"Springer","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1604.07169"}],"oa_version":"Preprint","day":"01","ec_funded":1,"_id":"1386"}]