[{"oa_version":"Published Version","date_created":"2022-04-07T07:57:10Z","extern":"1","scopus_import":"1","status":"public","date_published":"2003-04-17T00:00:00Z","publication":"Cell","abstract":[{"text":"Nuclear pore complexes (NPCs) are large multiprotein assemblies that allow traffic between the cytoplasm and the nucleus. During mitosis in higher eukaryotes, the Nuclear Envelope (NE) breaks down and NPCs disassemble. How NPCs reassemble and incorporate into the NE upon mitotic exit is poorly understood. We demonstrate a function for the conserved Nup107-160 complex in this process. Partial in vivo depletion of Nup133 or Nup107 via RNAi in HeLa cells resulted in reduced levels of multiple nucleoporins and decreased NPC density in the NE. Immunodepletion of the entire Nup107-160 complex from in vitro nuclear assembly reactions produced nuclei with a continuous NE but no NPCs. This phenotype was reversible only if Nup107-160 complex was readded before closed NE formation. Depletion also prevented association of FG-repeat nucleoporins with chromatin. We propose a stepwise model in which postmitotic NPC assembly initiates on chromatin via early recruitment of the Nup107-160 complex.","lang":"eng"}],"intvolume":"       113","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","pmid":1,"quality_controlled":"1","publisher":"Elsevier","publication_status":"published","volume":113,"type":"journal_article","month":"04","author":[{"first_name":"Tobias C.","last_name":"Walther","full_name":"Walther, Tobias C."},{"first_name":"Annabelle","last_name":"Alves","full_name":"Alves, Annabelle"},{"first_name":"Helen","last_name":"Pickersgill","full_name":"Pickersgill, Helen"},{"last_name":"Loı̈odice","first_name":"Isabelle","full_name":"Loı̈odice, Isabelle"},{"id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","last_name":"HETZER","first_name":"Martin W","orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W"},{"full_name":"Galy, Vincent","first_name":"Vincent","last_name":"Galy"},{"first_name":"Bastian B.","last_name":"Hülsmann","full_name":"Hülsmann, Bastian B."},{"first_name":"Thomas","last_name":"Köcher","full_name":"Köcher, Thomas"},{"full_name":"Wilm, Matthias","last_name":"Wilm","first_name":"Matthias"},{"full_name":"Allen, Terry","last_name":"Allen","first_name":"Terry"},{"last_name":"Mattaj","first_name":"Iain W.","full_name":"Mattaj, Iain W."},{"full_name":"Doye, Valérie","first_name":"Valérie","last_name":"Doye"}],"keyword":["General Biochemistry","Genetics and Molecular Biology"],"citation":{"ama":"Walther TC, Alves A, Pickersgill H, et al. The conserved Nup107-160 complex is critical for nuclear pore complex assembly. <i>Cell</i>. 2003;113(2):195-206. doi:<a href=\"https://doi.org/10.1016/s0092-8674(03)00235-6\">10.1016/s0092-8674(03)00235-6</a>","apa":"Walther, T. C., Alves, A., Pickersgill, H., Loı̈odice, I., Hetzer, M., Galy, V., … Doye, V. (2003). The conserved Nup107-160 complex is critical for nuclear pore complex assembly. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/s0092-8674(03)00235-6\">https://doi.org/10.1016/s0092-8674(03)00235-6</a>","ista":"Walther TC, Alves A, Pickersgill H, Loı̈odice I, Hetzer M, Galy V, Hülsmann BB, Köcher T, Wilm M, Allen T, Mattaj IW, Doye V. 2003. The conserved Nup107-160 complex is critical for nuclear pore complex assembly. Cell. 113(2), 195–206.","ieee":"T. C. Walther <i>et al.</i>, “The conserved Nup107-160 complex is critical for nuclear pore complex assembly,” <i>Cell</i>, vol. 113, no. 2. Elsevier, pp. 195–206, 2003.","chicago":"Walther, Tobias C., Annabelle Alves, Helen Pickersgill, Isabelle Loı̈odice, Martin Hetzer, Vincent Galy, Bastian B. Hülsmann, et al. “The Conserved Nup107-160 Complex Is Critical for Nuclear Pore Complex Assembly.” <i>Cell</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/s0092-8674(03)00235-6\">https://doi.org/10.1016/s0092-8674(03)00235-6</a>.","short":"T.C. Walther, A. Alves, H. Pickersgill, I. Loı̈odice, M. Hetzer, V. Galy, B.B. Hülsmann, T. Köcher, M. Wilm, T. Allen, I.W. Mattaj, V. Doye, Cell 113 (2003) 195–206.","mla":"Walther, Tobias C., et al. “The Conserved Nup107-160 Complex Is Critical for Nuclear Pore Complex Assembly.” <i>Cell</i>, vol. 113, no. 2, Elsevier, 2003, pp. 195–206, doi:<a href=\"https://doi.org/10.1016/s0092-8674(03)00235-6\">10.1016/s0092-8674(03)00235-6</a>."},"article_type":"original","issue":"2","page":"195-206","_id":"11122","language":[{"iso":"eng"}],"external_id":{"pmid":["12705868"]},"title":"The conserved Nup107-160 complex is critical for nuclear pore complex assembly","doi":"10.1016/s0092-8674(03)00235-6","date_updated":"2022-07-18T08:57:42Z","publication_identifier":{"issn":["0092-8674"]},"day":"17","year":"2003","article_processing_charge":"No"},{"year":"2003","article_processing_charge":"No","volume":48,"type":"journal_article","quality_controlled":"1","title":"Scheduling data transfers in a network and the set scheduling problem","doi":"10.1016/s0196-6774(03)00054-3","publisher":"Elsevier","date_updated":"2022-09-12T09:45:06Z","publication_identifier":{"issn":["0196-6774"]},"publication_status":"published","day":"01","date_published":"2003-09-01T00:00:00Z","status":"public","publication":"Journal of Algorithms","issue":"2","abstract":[{"lang":"eng","text":"In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum."}],"page":"314-332","language":[{"iso":"eng"}],"_id":"11764","intvolume":"        48","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"09","oa_version":"None","author":[{"last_name":"Goel","first_name":"Ashish","full_name":"Goel, Ashish"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"first_name":"Serge","last_name":"Plotkin","full_name":"Plotkin, Serge"},{"full_name":"Tardos, Eva","first_name":"Eva","last_name":"Tardos"}],"citation":{"chicago":"Goel, Ashish, Monika H Henzinger, Serge Plotkin, and Eva Tardos. “Scheduling Data Transfers in a Network and the Set Scheduling Problem.” <i>Journal of Algorithms</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/s0196-6774(03)00054-3\">https://doi.org/10.1016/s0196-6774(03)00054-3</a>.","ieee":"A. Goel, M. H. Henzinger, S. Plotkin, and E. Tardos, “Scheduling data transfers in a network and the set scheduling problem,” <i>Journal of Algorithms</i>, vol. 48, no. 2. Elsevier, pp. 314–332, 2003.","short":"A. Goel, M.H. Henzinger, S. Plotkin, E. Tardos, Journal of Algorithms 48 (2003) 314–332.","mla":"Goel, Ashish, et al. “Scheduling Data Transfers in a Network and the Set Scheduling Problem.” <i>Journal of Algorithms</i>, vol. 48, no. 2, Elsevier, 2003, pp. 314–32, doi:<a href=\"https://doi.org/10.1016/s0196-6774(03)00054-3\">10.1016/s0196-6774(03)00054-3</a>.","ama":"Goel A, Henzinger MH, Plotkin S, Tardos E. Scheduling data transfers in a network and the set scheduling problem. <i>Journal of Algorithms</i>. 2003;48(2):314-332. doi:<a href=\"https://doi.org/10.1016/s0196-6774(03)00054-3\">10.1016/s0196-6774(03)00054-3</a>","ista":"Goel A, Henzinger MH, Plotkin S, Tardos E. 2003. Scheduling data transfers in a network and the set scheduling problem. Journal of Algorithms. 48(2), 314–332.","apa":"Goel, A., Henzinger, M. H., Plotkin, S., &#38; Tardos, E. (2003). Scheduling data transfers in a network and the set scheduling problem. <i>Journal of Algorithms</i>. Elsevier. <a href=\"https://doi.org/10.1016/s0196-6774(03)00054-3\">https://doi.org/10.1016/s0196-6774(03)00054-3</a>"},"date_created":"2022-08-08T12:09:32Z","article_type":"original","extern":"1","scopus_import":"1"},{"abstract":[{"text":"This paper studies the multicast routing and admission control problem on unit-capacity tree and mesh topologies in the throughput model. The problem is a generalization of the edge-disjoint paths problem and is NP-hard both on trees and meshes. We study both the offline and the online version of the problem: In the offline setting, we give the first constant-factor approximation algorithm for trees, and an -factor approximation algorithm for meshes. In the online setting, we give the first polylogarithmic competitive online algorithm for tree and mesh topologies. No polylogarithmic-competitive algorithm is possible on general network topologies (Lower bounds for on-line graph problems with application to on-line circuits and optical routing, in: Proceedings of the 28th ACM Symposium on Theory of Computing, 1996, pp. 531–540) and there exists a polylogarithmic lower bound on the competitive ratio of any online algorithm on tree topologies (Making commitments in the face of uncertainity: how to pick a winner almost every time, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 519–530). We prove the same lower bound for meshes.","lang":"eng"}],"publication":"Journal of Computer and System Sciences","date_published":"2003-05-01T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        66","oa_version":"Published Version","extern":"1","scopus_import":"1","date_created":"2022-08-08T12:24:35Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/S0022-0000(03)00043-6"}],"type":"journal_article","volume":66,"quality_controlled":"1","publication_status":"published","publisher":"Elsevier","page":"567-611","issue":"3","_id":"11766","language":[{"iso":"eng"}],"author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Leonardi, Stefano","first_name":"Stefano","last_name":"Leonardi"}],"month":"05","article_type":"original","citation":{"chicago":"Henzinger, Monika H, and Stefano Leonardi. “Scheduling Multicasts on Unit-Capacity Trees and Meshes.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/s0022-0000(03)00043-6\">https://doi.org/10.1016/s0022-0000(03)00043-6</a>.","ieee":"M. H. Henzinger and S. Leonardi, “Scheduling multicasts on unit-capacity trees and meshes,” <i>Journal of Computer and System Sciences</i>, vol. 66, no. 3. Elsevier, pp. 567–611, 2003.","short":"M.H. Henzinger, S. Leonardi, Journal of Computer and System Sciences 66 (2003) 567–611.","mla":"Henzinger, Monika H., and Stefano Leonardi. “Scheduling Multicasts on Unit-Capacity Trees and Meshes.” <i>Journal of Computer and System Sciences</i>, vol. 66, no. 3, Elsevier, 2003, pp. 567–611, doi:<a href=\"https://doi.org/10.1016/s0022-0000(03)00043-6\">10.1016/s0022-0000(03)00043-6</a>.","ama":"Henzinger MH, Leonardi S. Scheduling multicasts on unit-capacity trees and meshes. <i>Journal of Computer and System Sciences</i>. 2003;66(3):567-611. doi:<a href=\"https://doi.org/10.1016/s0022-0000(03)00043-6\">10.1016/s0022-0000(03)00043-6</a>","ista":"Henzinger MH, Leonardi S. 2003. Scheduling multicasts on unit-capacity trees and meshes. Journal of Computer and System Sciences. 66(3), 567–611.","apa":"Henzinger, M. H., &#38; Leonardi, S. (2003). Scheduling multicasts on unit-capacity trees and meshes. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/s0022-0000(03)00043-6\">https://doi.org/10.1016/s0022-0000(03)00043-6</a>"},"year":"2003","article_processing_charge":"No","oa":1,"doi":"10.1016/s0022-0000(03)00043-6","title":"Scheduling multicasts on unit-capacity trees and meshes","day":"01","publication_identifier":{"issn":["0022-0000"]},"date_updated":"2023-02-10T08:03:31Z"},{"abstract":[{"text":"Many daily activities present information in the form of a stream of text, and often people can benefit from additional information on the topic discussed. TV broadcast news can be treated as one such stream of text; in this paper we discuss finding news articles on the web that are relevant to news currently being broadcast.We evaluated a variety of algorithms for this problem, looking at the impact of inverse document frequency, stemming, compounds, history, and query length on the relevance and coverage of news articles returned in real time during a broadcast. We also evaluated several postprocessing techniques for improving the precision, including reranking using additional terms, reranking by document similarity, and filtering on document similarity. For the best algorithm, 84%-91% of the articles found were relevant, with at least 64% of the articles being on the exact topic of the broadcast. In addition, a relevant article was found for at least 70% of the topics.","lang":"eng"}],"publication":"Proceedings of the 12th international conference on World Wide Web","date_published":"2003-05-01T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11860","language":[{"iso":"eng"}],"author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"first_name":"Bay-Wei","last_name":"Chang","full_name":"Chang, Bay-Wei"},{"last_name":"Milch","first_name":"Brian","full_name":"Milch, Brian"},{"full_name":"Brin, Sergey","first_name":"Sergey","last_name":"Brin"}],"oa_version":"None","article_number":"1-10","month":"05","extern":"1","scopus_import":"1","date_created":"2022-08-16T08:55:05Z","citation":{"short":"M.H. Henzinger, B.-W. Chang, B. Milch, S. Brin, in:, Proceedings of the 12th International Conference on World Wide Web, Association for Computing Machinery, 2003.","mla":"Henzinger, Monika H., et al. “Query-Free News Search.” <i>Proceedings of the 12th International Conference on World Wide Web</i>, 1–10, Association for Computing Machinery, 2003, doi:<a href=\"https://doi.org/10.1145/775152.775154\">10.1145/775152.775154</a>.","ieee":"M. H. Henzinger, B.-W. Chang, B. Milch, and S. Brin, “Query-free news search,” in <i>Proceedings of the 12th international conference on World Wide Web</i>, Budapest, Hungary, 2003.","chicago":"Henzinger, Monika H, Bay-Wei Chang, Brian Milch, and Sergey Brin. “Query-Free News Search.” In <i>Proceedings of the 12th International Conference on World Wide Web</i>. Association for Computing Machinery, 2003. <a href=\"https://doi.org/10.1145/775152.775154\">https://doi.org/10.1145/775152.775154</a>.","apa":"Henzinger, M. H., Chang, B.-W., Milch, B., &#38; Brin, S. (2003). Query-free news search. In <i>Proceedings of the 12th international conference on World Wide Web</i>. Budapest, Hungary: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/775152.775154\">https://doi.org/10.1145/775152.775154</a>","ista":"Henzinger MH, Chang B-W, Milch B, Brin S. 2003. Query-free news search. Proceedings of the 12th international conference on World Wide Web. WWW: International Conference on World Wide Web, 1–10.","ama":"Henzinger MH, Chang B-W, Milch B, Brin S. Query-free news search. In: <i>Proceedings of the 12th International Conference on World Wide Web</i>. Association for Computing Machinery; 2003. doi:<a href=\"https://doi.org/10.1145/775152.775154\">10.1145/775152.775154</a>"},"conference":{"start_date":"2003-05-20","end_date":"2003-05-24","location":"Budapest, Hungary","name":"WWW: International Conference on World Wide Web"},"related_material":{"record":[{"relation":"later_version","id":"11904","status":"public"}]},"year":"2003","type":"conference","article_processing_charge":"No","doi":"10.1145/775152.775154","title":"Query-free news search","quality_controlled":"1","day":"01","publication_identifier":{"isbn":["978-158113680-7"]},"publication_status":"published","date_updated":"2023-02-21T16:32:40Z","publisher":"Association for Computing Machinery"},{"_id":"11897","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_published":"2003-08-01T00:00:00Z","publication":"21st annual international ACM SIGIR conference on Research and development in information retrieval","abstract":[{"lang":"eng","text":"This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic. Connectivity analysis has been shown to be useful in identifying high quality pages within a topic specific graph of hyperlinked documents. The essence of our approach is to augment a previous connectivity analysis based algorithm with content analysis. We identify three problems with the existing approach and devise algorithms to tackle them. The results of a user evaluation are reported that show an improvement of precision at 10\r\ndocuments by at least 45% over pure connectivity analysis. "}],"page":"104–111","date_created":"2022-08-17T08:56:18Z","citation":{"ama":"Bharat K, Henzinger MH. Improved algorithms for topic distillation in a hyperlinked environment. In: <i>21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</i>. Association for Computing Machinery; 2003:104–111. doi:<a href=\"https://doi.org/10.1145/290941.290972\">10.1145/290941.290972</a>","apa":"Bharat, K., &#38; Henzinger, M. H. (2003). Improved algorithms for topic distillation in a hyperlinked environment. In <i>21st annual international ACM SIGIR conference on Research and development in information retrieval</i> (pp. 104–111). Melbourne, Australia: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/290941.290972\">https://doi.org/10.1145/290941.290972</a>","ista":"Bharat K, Henzinger MH. 2003. Improved algorithms for topic distillation in a hyperlinked environment. 21st annual international ACM SIGIR conference on Research and development in information retrieval. SIGIR: International Conference on Research and Development in Information Retrieval, 104–111.","ieee":"K. Bharat and M. H. Henzinger, “Improved algorithms for topic distillation in a hyperlinked environment,” in <i>21st annual international ACM SIGIR conference on Research and development in information retrieval</i>, Melbourne, Australia, 2003, pp. 104–111.","chicago":"Bharat, Krishna, and Monika H Henzinger. “Improved Algorithms for Topic Distillation in a Hyperlinked Environment.” In <i>21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</i>, 104–111. Association for Computing Machinery, 2003. <a href=\"https://doi.org/10.1145/290941.290972\">https://doi.org/10.1145/290941.290972</a>.","mla":"Bharat, Krishna, and Monika H. Henzinger. “Improved Algorithms for Topic Distillation in a Hyperlinked Environment.” <i>21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</i>, Association for Computing Machinery, 2003, pp. 104–111, doi:<a href=\"https://doi.org/10.1145/290941.290972\">10.1145/290941.290972</a>.","short":"K. Bharat, M.H. Henzinger, in:, 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Association for Computing Machinery, 2003, pp. 104–111."},"scopus_import":"1","extern":"1","month":"08","author":[{"full_name":"Bharat, Krishna","last_name":"Bharat","first_name":"Krishna"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"}],"oa_version":"None","article_processing_charge":"No","type":"conference","year":"2003","conference":{"location":"Melbourne, Australia","name":"SIGIR: International Conference on Research and Development in Information Retrieval","start_date":"1998-08-24","end_date":"1998-08-28"},"publisher":"Association for Computing Machinery","date_updated":"2023-02-17T14:47:44Z","publication_identifier":{"isbn":["978-1-58113-015-7"],"issn":["01635840"]},"publication_status":"published","day":"01","quality_controlled":"1","title":"Improved algorithms for topic distillation in a hyperlinked environment","doi":"10.1145/290941.290972"},{"conference":{"location":"Acapulco, Mexico","name":"IJCAI: International Joint Conference on Artificial Intelligence","start_date":"2003-08-09","end_date":"2003-08-15"},"year":"2003","main_file_link":[{"open_access":"1","url":"https://www.ijcai.org/Proceedings/03/Papers/278.pdf"}],"type":"conference","article_processing_charge":"No","oa":1,"title":"Challenges in web search engines","quality_controlled":"1","publication_status":"published","publication_identifier":{"issn":["1045-0823"]},"day":"01","publisher":"Association for Computing Machinery","date_updated":"2023-02-09T12:05:25Z","abstract":[{"lang":"eng","text":"This article presents a high-level discussion of some problems that are unique to web search engines. The goal is to raise awareness and stimulate research in these areas."}],"page":"1573-1579","status":"public","date_published":"2003-08-01T00:00:00Z","publication":"18th International Joint Conference on Artificial Intelligence","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11909","language":[{"iso":"eng"}],"month":"08","author":[{"last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Motwani","first_name":"Rajeev","full_name":"Motwani, Rajeev"},{"first_name":"Craig","last_name":"Silverstein","full_name":"Silverstein, Craig"}],"oa_version":"Published Version","extern":"1","scopus_import":"1","date_created":"2022-08-18T06:40:02Z","citation":{"ama":"Henzinger MH, Motwani R, Silverstein C. Challenges in web search engines. In: <i>18th International Joint Conference on Artificial Intelligence</i>. Association for Computing Machinery; 2003:1573-1579.","apa":"Henzinger, M. H., Motwani, R., &#38; Silverstein, C. (2003). Challenges in web search engines. In <i>18th International Joint Conference on Artificial Intelligence</i> (pp. 1573–1579). Acapulco, Mexico: Association for Computing Machinery.","ista":"Henzinger MH, Motwani R, Silverstein C. 2003. Challenges in web search engines. 18th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 1573–1579.","ieee":"M. H. Henzinger, R. Motwani, and C. Silverstein, “Challenges in web search engines,” in <i>18th International Joint Conference on Artificial Intelligence</i>, Acapulco, Mexico, 2003, pp. 1573–1579.","chicago":"Henzinger, Monika H, Rajeev Motwani, and Craig Silverstein. “Challenges in Web Search Engines.” In <i>18th International Joint Conference on Artificial Intelligence</i>, 1573–79. Association for Computing Machinery, 2003.","mla":"Henzinger, Monika H., et al. “Challenges in Web Search Engines.” <i>18th International Joint Conference on Artificial Intelligence</i>, Association for Computing Machinery, 2003, pp. 1573–79.","short":"M.H. Henzinger, R. Motwani, C. Silverstein, in:, 18th International Joint Conference on Artificial Intelligence, Association for Computing Machinery, 2003, pp. 1573–1579."}},{"type":"journal_article","volume":134,"year":"2003","day":"01","publication_status":"published","date_updated":"2021-01-12T06:55:07Z","publisher":"Cambridge University Press","doi":"10.1017/S0305004102006382","title":"Sums of four biquadrates","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"       134","_id":"207","language":[{"iso":"eng"}],"page":"385 - 395","issue":"3","publication":"Mathematical Proceedings of the Cambridge Philosophical Society","publist_id":"7704","date_published":"2003-05-01T00:00:00Z","status":"public","extern":"1","citation":{"ama":"Browning TD. Sums of four biquadrates. <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>. 2003;134(3):385-395. doi:<a href=\"https://doi.org/10.1017/S0305004102006382\">10.1017/S0305004102006382</a>","apa":"Browning, T. D. (2003). Sums of four biquadrates. <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0305004102006382\">https://doi.org/10.1017/S0305004102006382</a>","ista":"Browning TD. 2003. Sums of four biquadrates. Mathematical Proceedings of the Cambridge Philosophical Society. 134(3), 385–395.","ieee":"T. D. Browning, “Sums of four biquadrates,” <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>, vol. 134, no. 3. Cambridge University Press, pp. 385–395, 2003.","chicago":"Browning, Timothy D. “Sums of Four Biquadrates.” <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>. Cambridge University Press, 2003. <a href=\"https://doi.org/10.1017/S0305004102006382\">https://doi.org/10.1017/S0305004102006382</a>.","short":"T.D. Browning, Mathematical Proceedings of the Cambridge Philosophical Society 134 (2003) 385–395.","mla":"Browning, Timothy D. “Sums of Four Biquadrates.” <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>, vol. 134, no. 3, Cambridge University Press, 2003, pp. 385–95, doi:<a href=\"https://doi.org/10.1017/S0305004102006382\">10.1017/S0305004102006382</a>."},"date_created":"2018-12-11T11:45:12Z","oa_version":"None","author":[{"last_name":"Browning","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D"}],"month":"05"},{"date_updated":"2021-01-12T06:55:10Z","publisher":"Oxford University Press","day":"01","publication_status":"published","quality_controlled":0,"doi":"10.1093/qjmath/54.1.11","title":"Counting rational points on diagonal quadratic surfaces","type":"journal_article","volume":54,"year":"2003","date_created":"2018-12-11T11:45:13Z","citation":{"ama":"Browning TD. Counting rational points on diagonal quadratic surfaces. <i>Quarterly Journal of Mathematics</i>. 2003;54(1):11-31. doi:<a href=\"https://doi.org/10.1093/qjmath/54.1.11\">10.1093/qjmath/54.1.11</a>","apa":"Browning, T. D. (2003). Counting rational points on diagonal quadratic surfaces. <i>Quarterly Journal of Mathematics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/qjmath/54.1.11\">https://doi.org/10.1093/qjmath/54.1.11</a>","ista":"Browning TD. 2003. Counting rational points on diagonal quadratic surfaces. Quarterly Journal of Mathematics. 54(1), 11–31.","ieee":"T. D. Browning, “Counting rational points on diagonal quadratic surfaces,” <i>Quarterly Journal of Mathematics</i>, vol. 54, no. 1. Oxford University Press, pp. 11–31, 2003.","chicago":"Browning, Timothy D. “Counting Rational Points on Diagonal Quadratic Surfaces.” <i>Quarterly Journal of Mathematics</i>. Oxford University Press, 2003. <a href=\"https://doi.org/10.1093/qjmath/54.1.11\">https://doi.org/10.1093/qjmath/54.1.11</a>.","short":"T.D. Browning, Quarterly Journal of Mathematics 54 (2003) 11–31.","mla":"Browning, Timothy D. “Counting Rational Points on Diagonal Quadratic Surfaces.” <i>Quarterly Journal of Mathematics</i>, vol. 54, no. 1, Oxford University Press, 2003, pp. 11–31, doi:<a href=\"https://doi.org/10.1093/qjmath/54.1.11\">10.1093/qjmath/54.1.11</a>."},"extern":1,"author":[{"first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","full_name":"Timothy Browning"}],"month":"03","intvolume":"        54","_id":"208","publist_id":"7705","publication":"Quarterly Journal of Mathematics","issue":"1","status":"public","date_published":"2003-03-01T00:00:00Z","page":"11 - 31","abstract":[{"text":"For any ε &gt; 0 and any diagonal quadratic form Q ∈ ℤ[x 1, x 2, x 3, x 4] with a square-free discriminant of modulus Δ Q ≠ 0, we establish the uniform estimate ≪ε B 3/2+ε + B 2+ε/Δ Q 1/6 for the number of rational points of height at most B lying in the projective surface Q = 0.","lang":"eng"}]},{"date_created":"2018-12-11T11:57:04Z","citation":{"mla":"Lieb, Élliott, and Robert Seiringer. <i>Bose-Einstein Condensation of Dilute Gases in Traps </i>. Edited by Yulia Karpeshina et al., vol. 327, American Mathematical Society, 2003, pp. 239–50, doi:<a href=\"https://doi.org/10.1090/conm/327/05818\">10.1090/conm/327/05818</a>.","short":"É. Lieb, R. Seiringer, in:, Y. Karpeshina, R. Weikard, Y. Zeng (Eds.), American Mathematical Society, 2003, pp. 239–250.","chicago":"Lieb, Élliott, and Robert Seiringer. “Bose-Einstein Condensation of Dilute Gases in Traps .” edited by Yulia Karpeshina, Rudi Weikard, and Yanni Zeng, 327:239–50. American Mathematical Society, 2003. <a href=\"https://doi.org/10.1090/conm/327/05818\">https://doi.org/10.1090/conm/327/05818</a>.","ieee":"É. Lieb and R. Seiringer, “Bose-Einstein condensation of dilute gases in traps ,” presented at the Differential Equations and Mathematical Physics, 2003, vol. 327, pp. 239–250.","ista":"Lieb É, Seiringer R. 2003. Bose-Einstein condensation of dilute gases in traps . Differential Equations and Mathematical Physics, Contemporary Mathematics, vol. 327, 239–250.","apa":"Lieb, É., &#38; Seiringer, R. (2003). Bose-Einstein condensation of dilute gases in traps . In Y. Karpeshina, R. Weikard, &#38; Y. Zeng (Eds.) (Vol. 327, pp. 239–250). Presented at the Differential Equations and Mathematical Physics, American Mathematical Society. <a href=\"https://doi.org/10.1090/conm/327/05818\">https://doi.org/10.1090/conm/327/05818</a>","ama":"Lieb É, Seiringer R. Bose-Einstein condensation of dilute gases in traps . In: Karpeshina Y, Weikard R, Zeng Y, eds. Vol 327. American Mathematical Society; 2003:239-250. doi:<a href=\"https://doi.org/10.1090/conm/327/05818\">10.1090/conm/327/05818</a>"},"alternative_title":["Contemporary Mathematics"],"extern":1,"month":"01","author":[{"full_name":"Lieb, Élliott H","last_name":"Lieb","first_name":"Élliott"},{"orcid":"0000-0002-6781-0521","full_name":"Robert Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert"}],"intvolume":"       327","_id":"2337","date_published":"2003-01-01T00:00:00Z","status":"public","publist_id":"4589","page":"239 - 250","publisher":"American Mathematical Society","date_updated":"2021-01-12T06:56:52Z","publication_status":"published","day":"01","quality_controlled":0,"title":"Bose-Einstein condensation of dilute gases in traps ","editor":[{"full_name":"Karpeshina, Yulia","first_name":"Yulia","last_name":"Karpeshina"},{"full_name":"Weikard, Rudi","last_name":"Weikard","first_name":"Rudi"},{"last_name":"Zeng","first_name":"Yanni","full_name":"Zeng, Yanni"}],"doi":"10.1090/conm/327/05818","oa":1,"volume":327,"type":"conference","year":"2003","main_file_link":[{"url":"http://arxiv.org/abs/math-ph/0210028","open_access":"1"}],"conference":{"name":"Differential Equations and Mathematical Physics"}},{"page":"9755 - 9778","abstract":[{"text":"We investigate the ground state properties of a gas of interacting particles confined in an external potential in three dimensions and subject to rotation around an axis of symmetry. We consider the Gross-Pitaevskii (GP) limit of a dilute gas. Analysing both the absolute and the bosonic ground states of the system, we show, in particular, their different behaviour for a certain range of parameters. This parameter range is determined by the question whether the rotational symmetry in the minimizer of the GP functional is broken or not. For the absolute ground state, we prove that in the GP limit a modified GP functional depending on density matrices correctly describes the energy and reduced density matrices, independent of symmetry breaking. For the bosonic ground state this holds true if and only if the symmetry is unbroken.","lang":"eng"}],"publication":"Journal of Physics A: Mathematical and Theoretical","issue":"37","publist_id":"4572","date_published":"2003-09-19T00:00:00Z","status":"public","_id":"2354","intvolume":"        36","author":[{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","last_name":"Seiringer","full_name":"Robert Seiringer","orcid":"0000-0002-6781-0521"}],"month":"09","extern":1,"date_created":"2018-12-11T11:57:10Z","citation":{"mla":"Seiringer, Robert. “Ground State Asymptotics of a Dilute, Rotating Gas.” <i>Journal of Physics A: Mathematical and Theoretical</i>, vol. 36, no. 37, IOP Publishing Ltd., 2003, pp. 9755–78, doi:<a href=\"https://doi.org/10.1088/0305-4470/36/37/312\">10.1088/0305-4470/36/37/312</a>.","short":"R. Seiringer, Journal of Physics A: Mathematical and Theoretical 36 (2003) 9755–9778.","chicago":"Seiringer, Robert. “Ground State Asymptotics of a Dilute, Rotating Gas.” <i>Journal of Physics A: Mathematical and Theoretical</i>. IOP Publishing Ltd., 2003. <a href=\"https://doi.org/10.1088/0305-4470/36/37/312\">https://doi.org/10.1088/0305-4470/36/37/312</a>.","ieee":"R. Seiringer, “Ground state asymptotics of a dilute, rotating gas,” <i>Journal of Physics A: Mathematical and Theoretical</i>, vol. 36, no. 37. IOP Publishing Ltd., pp. 9755–9778, 2003.","ista":"Seiringer R. 2003. Ground state asymptotics of a dilute, rotating gas. Journal of Physics A: Mathematical and Theoretical. 36(37), 9755–9778.","apa":"Seiringer, R. (2003). Ground state asymptotics of a dilute, rotating gas. <i>Journal of Physics A: Mathematical and Theoretical</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/0305-4470/36/37/312\">https://doi.org/10.1088/0305-4470/36/37/312</a>","ama":"Seiringer R. Ground state asymptotics of a dilute, rotating gas. <i>Journal of Physics A: Mathematical and Theoretical</i>. 2003;36(37):9755-9778. doi:<a href=\"https://doi.org/10.1088/0305-4470/36/37/312\">10.1088/0305-4470/36/37/312</a>"},"year":"2003","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/math-ph/0306022"}],"type":"journal_article","volume":36,"oa":1,"doi":"10.1088/0305-4470/36/37/312","title":"Ground state asymptotics of a dilute, rotating gas","quality_controlled":0,"day":"19","publication_status":"published","date_updated":"2021-01-12T06:56:59Z","publisher":"IOP Publishing Ltd."},{"oa":1,"type":"journal_article","volume":158,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/math/0205088"}],"year":"2003","date_updated":"2021-01-12T06:57:00Z","publisher":"Princeton University Press","day":"01","publication_status":"published","quality_controlled":0,"doi":"10.4007/annals.2003.158.1067 ","title":"Poincaré inequalities in punctured domains","_id":"2357","intvolume":"       158","issue":"3","publist_id":"4570","publication":"Annals of Mathematics","date_published":"2003-11-01T00:00:00Z","status":"public","page":"1067 - 1080","abstract":[{"text":"The classic Poincaré inequality bounds the L q-norm of a function f in a bounded domain Ω ⊂ ℝ n in terms of some L p-norm of its gradient in Ω. We generalize this in two ways: In the first generalization we remove a set Τ from Ω and concentrate our attention on Λ = Ω \\ Τ. This new domain might not even be connected and hence no Poincaré inequality can generally hold for it, or if it does hold it might have a very bad constant. This is so even if the volume of Τ is arbitrarily small. A Poincaré inequality does hold, however, if one makes the additional assumption that f has a finite L p gradient norm on the whole of Ω, not just on Λ. The important point is that the Poincaré inequality thus obtained bounds the L q-norm of f in terms of the L p gradient norm on Λ (not Ω) plus an additional term that goes to zero as the volume of Τ goes to zero. This error term depends on Τ only through its volume. Apart from this additive error term, the constant in the inequality remains that of the 'nice' domain Ω. In the second generalization we are given a vector field A and replace ∇ by ∇ + iA(x) (geometrically, a connection on a U(1) bundle). Unlike the A = 0 case, the infimum of ∥(∇ + iA)f∥ p over all f with a given ∥f∥ q is in general not zero. This permits an improvement of the inequality by the addition of a term whose sharp value we derive. We describe some open problems that arise from these generalizations.","lang":"eng"}],"citation":{"mla":"Lieb, Élliott, et al. “Poincaré Inequalities in Punctured Domains.” <i>Annals of Mathematics</i>, vol. 158, no. 3, Princeton University Press, 2003, pp. 1067–80, doi:<a href=\"https://doi.org/10.4007/annals.2003.158.1067 \">10.4007/annals.2003.158.1067 </a>.","short":"É. Lieb, R. Seiringer, J. Yngvason, Annals of Mathematics 158 (2003) 1067–1080.","chicago":"Lieb, Élliott, Robert Seiringer, and Jakob Yngvason. “Poincaré Inequalities in Punctured Domains.” <i>Annals of Mathematics</i>. Princeton University Press, 2003. <a href=\"https://doi.org/10.4007/annals.2003.158.1067 \">https://doi.org/10.4007/annals.2003.158.1067 </a>.","ieee":"É. Lieb, R. Seiringer, and J. Yngvason, “Poincaré inequalities in punctured domains,” <i>Annals of Mathematics</i>, vol. 158, no. 3. Princeton University Press, pp. 1067–1080, 2003.","ista":"Lieb É, Seiringer R, Yngvason J. 2003. Poincaré inequalities in punctured domains. Annals of Mathematics. 158(3), 1067–1080.","apa":"Lieb, É., Seiringer, R., &#38; Yngvason, J. (2003). Poincaré inequalities in punctured domains. <i>Annals of Mathematics</i>. Princeton University Press. <a href=\"https://doi.org/10.4007/annals.2003.158.1067 \">https://doi.org/10.4007/annals.2003.158.1067 </a>","ama":"Lieb É, Seiringer R, Yngvason J. Poincaré inequalities in punctured domains. <i>Annals of Mathematics</i>. 2003;158(3):1067-1080. doi:<a href=\"https://doi.org/10.4007/annals.2003.158.1067 \">10.4007/annals.2003.158.1067 </a>"},"date_created":"2018-12-11T11:57:11Z","extern":1,"author":[{"full_name":"Lieb, Élliott H","last_name":"Lieb","first_name":"Élliott"},{"orcid":"0000-0002-6781-0521","full_name":"Robert Seiringer","last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Yngvason","first_name":"Jakob","full_name":"Yngvason, Jakob"}],"month":"11"},{"main_file_link":[{"url":"http://arxiv.org/abs/cond-mat/0304071","open_access":"1"}],"year":"2003","oa":1,"type":"journal_article","volume":91,"quality_controlled":0,"doi":"10.1103/PhysRevLett.91.150401","title":"One-dimensional Bosons in three-dimensional traps","date_updated":"2021-01-12T06:57:00Z","publisher":"American Physical Society","day":"10","publication_status":"published","publication":"Physical Review Letters","issue":"15","publist_id":"4571","date_published":"2003-10-10T00:00:00Z","status":"public","page":"1504011 - 1504014","abstract":[{"text":"A study was conducted on the one-dimensional (1D) bosons in three-dimensional (3D) traps. A rigorous analysis was carried out on the parameter regions in which various types of 1D or 3D behavior occurred in the ground state. The four parameter regions include density, transverse, longitudinal dimensions and scattering length.","lang":"eng"}],"intvolume":"        91","_id":"2358","author":[{"full_name":"Lieb, Élliott H","last_name":"Lieb","first_name":"Élliott"},{"full_name":"Robert Seiringer","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert"},{"full_name":"Yngvason, Jakob","last_name":"Yngvason","first_name":"Jakob"}],"month":"10","date_created":"2018-12-11T11:57:12Z","citation":{"chicago":"Lieb, Élliott, Robert Seiringer, and Jakob Yngvason. “One-Dimensional Bosons in Three-Dimensional Traps.” <i>Physical Review Letters</i>. American Physical Society, 2003. <a href=\"https://doi.org/10.1103/PhysRevLett.91.150401\">https://doi.org/10.1103/PhysRevLett.91.150401</a>.","ieee":"É. Lieb, R. Seiringer, and J. Yngvason, “One-dimensional Bosons in three-dimensional traps,” <i>Physical Review Letters</i>, vol. 91, no. 15. American Physical Society, pp. 1504011–1504014, 2003.","short":"É. Lieb, R. Seiringer, J. Yngvason, Physical Review Letters 91 (2003) 1504011–1504014.","mla":"Lieb, Élliott, et al. “One-Dimensional Bosons in Three-Dimensional Traps.” <i>Physical Review Letters</i>, vol. 91, no. 15, American Physical Society, 2003, pp. 1504011–14, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.91.150401\">10.1103/PhysRevLett.91.150401</a>.","ama":"Lieb É, Seiringer R, Yngvason J. One-dimensional Bosons in three-dimensional traps. <i>Physical Review Letters</i>. 2003;91(15):1504011-1504014. doi:<a href=\"https://doi.org/10.1103/PhysRevLett.91.150401\">10.1103/PhysRevLett.91.150401</a>","ista":"Lieb É, Seiringer R, Yngvason J. 2003. One-dimensional Bosons in three-dimensional traps. Physical Review Letters. 91(15), 1504011–1504014.","apa":"Lieb, É., Seiringer, R., &#38; Yngvason, J. (2003). One-dimensional Bosons in three-dimensional traps. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.91.150401\">https://doi.org/10.1103/PhysRevLett.91.150401</a>"},"extern":1},{"date_created":"2018-12-11T11:57:31Z","citation":{"chicago":"Wagner, Uli. “On K-Sets and Their Applications.” ETH Zurich, 2003. <a href=\"https://doi.org/10.3929/ethz-a-004708408\">https://doi.org/10.3929/ethz-a-004708408</a>.","ieee":"U. Wagner, “On k-Sets and Their Applications,” ETH Zurich, 2003.","short":"U. Wagner, On K-Sets and Their Applications, ETH Zurich, 2003.","mla":"Wagner, Uli. <i>On K-Sets and Their Applications</i>. ETH Zurich, 2003, doi:<a href=\"https://doi.org/10.3929/ethz-a-004708408\">10.3929/ethz-a-004708408</a>.","ama":"Wagner U. On k-Sets and Their Applications. 2003. doi:<a href=\"https://doi.org/10.3929/ethz-a-004708408\">10.3929/ethz-a-004708408</a>","ista":"Wagner U. 2003. On k-Sets and Their Applications. ETH Zurich.","apa":"Wagner, U. (2003). <i>On k-Sets and Their Applications</i>. ETH Zurich. <a href=\"https://doi.org/10.3929/ethz-a-004708408\">https://doi.org/10.3929/ethz-a-004708408</a>"},"extern":1,"month":"01","author":[{"full_name":"Uli Wagner","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli"}],"_id":"2414","date_published":"2003-01-01T00:00:00Z","status":"public","publist_id":"4511","publisher":"ETH Zurich","date_updated":"2021-01-12T06:57:20Z","publication_status":"published","day":"01","quality_controlled":0,"title":"On k-Sets and Their Applications","doi":"10.3929/ethz-a-004708408","type":"dissertation","year":"2003"},{"type":"conference","conference":{"name":"SODA: Symposium on Discrete Algorithms"},"year":"2003","main_file_link":[{"open_access":"0","url":"http://dl.acm.org/citation.cfm?id=644206"}],"day":"01","publication_status":"published","date_updated":"2021-01-12T06:57:24Z","publisher":"SIAM","title":"On the rectilinear crossing number of complete graphs","quality_controlled":0,"_id":"2422","page":"583 - 588","abstract":[{"lang":"eng","text":"We prove a lower bound of 0.3288(4 n) for the rectilinear crossing number cr̄(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadrilaterals in any set of n points in general position in the Euclidean plane. As we see it, the main contribution of this paper is not so much the concrete numerical improvement over earlier bounds, as the novel method of proof, which is not based on bounding cr̄(Kn) for some small n."}],"publist_id":"4503","date_published":"2003-01-01T00:00:00Z","status":"public","extern":1,"date_created":"2018-12-11T11:57:34Z","citation":{"ama":"Wagner U. On the rectilinear crossing number of complete graphs. In: SIAM; 2003:583-588.","ista":"Wagner U. 2003. On the rectilinear crossing number of complete graphs. SODA: Symposium on Discrete Algorithms, 583–588.","apa":"Wagner, U. (2003). On the rectilinear crossing number of complete graphs (pp. 583–588). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.","chicago":"Wagner, Uli. “On the Rectilinear Crossing Number of Complete Graphs,” 583–88. SIAM, 2003.","ieee":"U. Wagner, “On the rectilinear crossing number of complete graphs,” presented at the SODA: Symposium on Discrete Algorithms, 2003, pp. 583–588.","short":"U. Wagner, in:, SIAM, 2003, pp. 583–588.","mla":"Wagner, Uli. <i>On the Rectilinear Crossing Number of Complete Graphs</i>. SIAM, 2003, pp. 583–88."},"author":[{"orcid":"0000-0002-1494-0568","full_name":"Uli Wagner","last_name":"Wagner","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"month":"01"},{"_id":"2423","date_published":"2003-06-01T00:00:00Z","status":"public","publist_id":"4502","abstract":[{"text":"A finite set N ⊃ Rd is a weak ε-net for an n-point set X ⊃ Rd (with respect to convex sets) if N intersects every convex set K with |K ∩ X| ≥ εn. We give an alternative, and arguably simpler, proof of the fact, first shown by Chazelle et al. [7], that every point set X in Rd admits a weak ε-net of cardinality O(ε-d polylog(1/ε)). Moreover, for a number of special point sets (e.g., for points on the moment curve), our method gives substantially better bounds. The construction yields an algorithm to construct such weak ε-nets in time O(n ln(1/ε)). We also prove, by a different method, a near-linear upper bound for points uniformly distributed on the (d - 1)-dimensional sphere.","lang":"eng"}],"page":"129 - 135","citation":{"ista":"Matoušek J, Wagner U. 2003. New constructions of weak epsilon-nets. SoCG: Symposium on Computational Geometry, 129–135.","apa":"Matoušek, J., &#38; Wagner, U. (2003). New constructions of weak epsilon-nets (pp. 129–135). Presented at the SoCG: Symposium on Computational Geometry, ACM. <a href=\"https://doi.org/10.1145/777792.777813\">https://doi.org/10.1145/777792.777813</a>","ama":"Matoušek J, Wagner U. New constructions of weak epsilon-nets. In: ACM; 2003:129-135. doi:<a href=\"https://doi.org/10.1145/777792.777813\">10.1145/777792.777813</a>","mla":"Matoušek, Jiří, and Uli Wagner. <i>New Constructions of Weak Epsilon-Nets</i>. ACM, 2003, pp. 129–35, doi:<a href=\"https://doi.org/10.1145/777792.777813\">10.1145/777792.777813</a>.","short":"J. Matoušek, U. Wagner, in:, ACM, 2003, pp. 129–135.","chicago":"Matoušek, Jiří, and Uli Wagner. “New Constructions of Weak Epsilon-Nets,” 129–35. ACM, 2003. <a href=\"https://doi.org/10.1145/777792.777813\">https://doi.org/10.1145/777792.777813</a>.","ieee":"J. Matoušek and U. Wagner, “New constructions of weak epsilon-nets,” presented at the SoCG: Symposium on Computational Geometry, 2003, pp. 129–135."},"date_created":"2018-12-11T11:57:34Z","extern":1,"month":"06","author":[{"last_name":"Matoušek","first_name":"Jiří","full_name":"Matoušek, Jiří"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli","orcid":"0000-0002-1494-0568","full_name":"Uli Wagner"}],"type":"conference","year":"2003","conference":{"name":"SoCG: Symposium on Computational Geometry"},"publisher":"ACM","date_updated":"2021-01-12T06:57:24Z","publication_status":"published","day":"01","quality_controlled":0,"title":"New constructions of weak epsilon-nets","doi":"10.1145/777792.777813"},{"date_published":"2003-06-01T00:00:00Z","status":"public","publist_id":"4501","abstract":[{"lang":"eng","text":"We introduce the adaptive neighborhood graph as a data structure for modeling a smooth manifold M embedded in some (potentially very high-dimensional) Euclidean space ℝd. We assume that M is known to us only through a finite sample P ⊂ M, as it is often the case in applications. The adaptive neighborhood graph is a geometric graph on P. Its complexity is at most min{2O(k)(n, n2}, where n = |P| and k = dim M, as opposed to the n⌈d/2⌉ complexity of the Delaunay triangulation, which is often used to model manifolds. We show that we can provably correctly infer the connectivity of M and the dimension of M from the adaptive neighborhood graph provided a certain standard sampling condition is fulfilled. The running time of the dimension detection algorithm is d2O(k7 log k) for each connected component of M. If the dimension is considered constant, this is a constant-time operation, and the adaptive neighborhood graph is of linear size. Moreover, the exponential dependence of the constants is only on the intrinsic dimension k, not on the ambient dimension d. This is of particular interest if the co-dimension is high, i.e., if k is much smaller than d, as is the case in many applications. The adaptive neighborhood graph also allows us to approximate the geodesic distances between the points in P."}],"page":"329 - 337","_id":"2424","month":"06","author":[{"full_name":"Giesen, Joachim","last_name":"Giesen","first_name":"Joachim"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli","orcid":"0000-0002-1494-0568","full_name":"Uli Wagner"}],"citation":{"chicago":"Giesen, Joachim, and Uli Wagner. “Shape Dimension and Intrinsic Metric from Samples of Manifolds with High Co-Dimension,” 329–37. ACM, 2003. <a href=\"https://doi.org/10.1145/777792.777841\">https://doi.org/10.1145/777792.777841</a>.","ieee":"J. Giesen and U. Wagner, “Shape dimension and intrinsic metric from samples of manifolds with high co-dimension,” presented at the SoCG: Symposium on Computational Geometry, 2003, pp. 329–337.","mla":"Giesen, Joachim, and Uli Wagner. <i>Shape Dimension and Intrinsic Metric from Samples of Manifolds with High Co-Dimension</i>. ACM, 2003, pp. 329–37, doi:<a href=\"https://doi.org/10.1145/777792.777841\">10.1145/777792.777841</a>.","short":"J. Giesen, U. Wagner, in:, ACM, 2003, pp. 329–337.","ama":"Giesen J, Wagner U. Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. In: ACM; 2003:329-337. doi:<a href=\"https://doi.org/10.1145/777792.777841\">10.1145/777792.777841</a>","ista":"Giesen J, Wagner U. 2003. Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. SoCG: Symposium on Computational Geometry, 329–337.","apa":"Giesen, J., &#38; Wagner, U. (2003). Shape dimension and intrinsic metric from samples of manifolds with high co-dimension (pp. 329–337). Presented at the SoCG: Symposium on Computational Geometry, ACM. <a href=\"https://doi.org/10.1145/777792.777841\">https://doi.org/10.1145/777792.777841</a>"},"date_created":"2018-12-11T11:57:35Z","extern":1,"year":"2003","conference":{"name":"SoCG: Symposium on Computational Geometry"},"type":"conference","quality_controlled":0,"title":"Shape dimension and intrinsic metric from samples of manifolds with high co-dimension","doi":"10.1145/777792.777841","publisher":"ACM","date_updated":"2021-01-12T06:57:24Z","publication_status":"published","day":"01"},{"type":"journal_article","volume":53,"year":"2003","day":"01","publication_status":"published","date_updated":"2021-01-12T06:58:39Z","publisher":"Wiley-Blackwell","doi":"10.1002/ana.10451","title":"Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies","quality_controlled":0,"intvolume":"        53","_id":"2623","page":"325 - 336","abstract":[{"lang":"eng","text":"Patients with Hodgkin's disease can develop paraneoplastic cerebellar ataxia because of the generation of autoantibodies against mGluR1 (mGluR1-Abs). Yet, the pathophysiological mechanisms underlying their motor coordination deficits remain to be elucidated. Here, we show that application of IgG purified from the patients' serum to cerebellar slices of mice acutely reduces the basal activity of Purkinje cells, whereas application to the flocculus of mice in vivo evokes acute disturbances in the performance of their compensatory eye movements. In addition, the mGluR1-Abs block induction of long-term depression in cultured mouse Purkinje cells, whereas the cerebellar motor learning behavior of the patients is affected in that they show impaired adaptation of their saccadic eye movements. Finally, postmortem analysis of the cerebellum of a paraneoplastic cerebellar ataxia patient showed that the number of Purkinje cells was significantly reduced by approximately two thirds compared with three controls. We conclude that autoantibodies against mGluR1 can cause cerebellar motor coordination deficits caused by a combination of rapid effects on both acute and plastic responses of Purkinje cells and chronic degenerative effects."}],"publist_id":"4274","publication":"Annals of Neurology","issue":"3","date_published":"2003-03-01T00:00:00Z","status":"public","extern":1,"citation":{"ieee":"M. Coesmans <i>et al.</i>, “Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies,” <i>Annals of Neurology</i>, vol. 53, no. 3. Wiley-Blackwell, pp. 325–336, 2003.","chicago":"Coesmans, Michiel, Peter Sillevis Smitt, David Linden, Ryuichi Shigemoto, Tomoo Hirano, Yoshinori Yamakawa, Adriaan Van Alphen, et al. “Mechanisms Underlying Cerebellar Motor Deficits Due to MGluR1-Autoantibodies.” <i>Annals of Neurology</i>. Wiley-Blackwell, 2003. <a href=\"https://doi.org/10.1002/ana.10451\">https://doi.org/10.1002/ana.10451</a>.","mla":"Coesmans, Michiel, et al. “Mechanisms Underlying Cerebellar Motor Deficits Due to MGluR1-Autoantibodies.” <i>Annals of Neurology</i>, vol. 53, no. 3, Wiley-Blackwell, 2003, pp. 325–36, doi:<a href=\"https://doi.org/10.1002/ana.10451\">10.1002/ana.10451</a>.","short":"M. Coesmans, P. Sillevis Smitt, D. Linden, R. Shigemoto, T. Hirano, Y. Yamakawa, A. Van Alphen, C. Luo, J. Van Der Geest, J. Kros, C. Gaillard, M. Frens, C. De Zeeuw, Annals of Neurology 53 (2003) 325–336.","ama":"Coesmans M, Sillevis Smitt P, Linden D, et al. Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies. <i>Annals of Neurology</i>. 2003;53(3):325-336. doi:<a href=\"https://doi.org/10.1002/ana.10451\">10.1002/ana.10451</a>","apa":"Coesmans, M., Sillevis Smitt, P., Linden, D., Shigemoto, R., Hirano, T., Yamakawa, Y., … De Zeeuw, C. (2003). Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies. <i>Annals of Neurology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/ana.10451\">https://doi.org/10.1002/ana.10451</a>","ista":"Coesmans M, Sillevis Smitt P, Linden D, Shigemoto R, Hirano T, Yamakawa Y, Van Alphen A, Luo C, Van Der Geest J, Kros J, Gaillard C, Frens M, De Zeeuw C. 2003. Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies. Annals of Neurology. 53(3), 325–336."},"date_created":"2018-12-11T11:58:44Z","author":[{"full_name":"Coesmans, Michiel P","first_name":"Michiel","last_name":"Coesmans"},{"last_name":"Sillevis Smitt","first_name":"Peter","full_name":"Sillevis-Smitt, Peter A"},{"full_name":"Linden, David J","last_name":"Linden","first_name":"David"},{"first_name":"Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444"},{"first_name":"Tomoo","last_name":"Hirano","full_name":"Hirano, Tomoo"},{"last_name":"Yamakawa","first_name":"Yoshinori","full_name":"Yamakawa, Yoshinori"},{"last_name":"Van Alphen","first_name":"Adriaan","full_name":"Van Alphen, Adriaan M"},{"full_name":"Luo, Chongde","last_name":"Luo","first_name":"Chongde"},{"last_name":"Van Der Geest","first_name":"Jos","full_name":"Van Der Geest, Jos N"},{"full_name":"Kros, Johan M","first_name":"Johan","last_name":"Kros"},{"first_name":"Carlo","last_name":"Gaillard","full_name":"Gaillard, Carlo A"},{"full_name":"Frens, Maarten A","last_name":"Frens","first_name":"Maarten"},{"full_name":"De Zeeuw, Chris I","first_name":"Chris","last_name":"De Zeeuw"}],"month":"03"},{"publisher":"Wiley-Blackwell","date_updated":"2021-01-12T06:58:39Z","publication_status":"published","day":"01","quality_controlled":0,"title":"Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons","doi":"10.1046/j.1460-9568.2003.02499.x","volume":17,"type":"journal_article","year":"2003","citation":{"ista":"Minami I, Kengaku M, Smitt S, Shigemoto R, Hirano T. 2003. Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons. European Journal of Neuroscience. 17(5), 1023–1032.","apa":"Minami, I., Kengaku, M., Smitt, S., Shigemoto, R., &#38; Hirano, T. (2003). Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons. <i>European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1046/j.1460-9568.2003.02499.x\">https://doi.org/10.1046/j.1460-9568.2003.02499.x</a>","ama":"Minami I, Kengaku M, Smitt S, Shigemoto R, Hirano T. Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons. <i>European Journal of Neuroscience</i>. 2003;17(5):1023-1032. doi:<a href=\"https://doi.org/10.1046/j.1460-9568.2003.02499.x\">10.1046/j.1460-9568.2003.02499.x</a>","mla":"Minami, Itsunari, et al. “Long-Term Potentiation of MGluR1 Activity by Depolarization-Induced Homer1a in Mouse Cerebellar Purkinje Neurons.” <i>European Journal of Neuroscience</i>, vol. 17, no. 5, Wiley-Blackwell, 2003, pp. 1023–32, doi:<a href=\"https://doi.org/10.1046/j.1460-9568.2003.02499.x\">10.1046/j.1460-9568.2003.02499.x</a>.","short":"I. Minami, M. Kengaku, S. Smitt, R. Shigemoto, T. Hirano, European Journal of Neuroscience 17 (2003) 1023–1032.","chicago":"Minami, Itsunari, Mineko Kengaku, Sillevis Smitt, Ryuichi Shigemoto, and Tomoo Hirano. “Long-Term Potentiation of MGluR1 Activity by Depolarization-Induced Homer1a in Mouse Cerebellar Purkinje Neurons.” <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 2003. <a href=\"https://doi.org/10.1046/j.1460-9568.2003.02499.x\">https://doi.org/10.1046/j.1460-9568.2003.02499.x</a>.","ieee":"I. Minami, M. Kengaku, S. Smitt, R. Shigemoto, and T. Hirano, “Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons,” <i>European Journal of Neuroscience</i>, vol. 17, no. 5. Wiley-Blackwell, pp. 1023–1032, 2003."},"date_created":"2018-12-11T11:58:44Z","extern":1,"month":"03","author":[{"first_name":"Itsunari","last_name":"Minami","full_name":"Minami, Itsunari"},{"last_name":"Kengaku","first_name":"Mineko","full_name":"Kengaku, Mineko"},{"last_name":"Smitt","first_name":"Sillevis","full_name":"Smitt, Sillevis P"},{"orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","last_name":"Shigemoto"},{"first_name":"Tomoo","last_name":"Hirano","full_name":"Hirano, Tomoo"}],"intvolume":"        17","_id":"2625","status":"public","date_published":"2003-03-01T00:00:00Z","publist_id":"4273","publication":"European Journal of Neuroscience","issue":"5","abstract":[{"lang":"eng","text":"Metabotropic glutamate receptor 1 (mGluR1) plays a crucial role in synaptic plasticity and motor learning in the cerebellum. We have studied activity-dependent changes in mGluR1 function in mouse cultured Purkinje neurons. Depolarizing stimulation potentiated Ca2+ and current responses to an mGluR1 agonist for several hours in the cultured Purkinje neurons. It also blocked internalization of mGluR1 and increased the number of mGluR1s on the cell membrane. We found that depolarization simultaneously increased transcription of Homer1a in Purkinje neurons. Homer1a inhibited internalization and increased cell-surface expression of mGluR1 when coexpressed in human embryonic kidney (HEK)-293 cells. Depolarization-induced Homer1a expression in Purkinje neurons was blocked by a mitogen-activated protein kinase (MAPK) inhibitor. Changes in internalization and mGluR1-mediated Ca2+ response were also blocked by inhibition of MAPK activity, suggesting that localization and activity of mGluR1 were regulated in the same signalling pathway as Homer1a expression. It is thus suggested that depolarization of the Purkinje neuron leads to the increment in mGluR1 responsiveness through MAPK activity and induction of Homer1a expression, which increases active mGluR1 on the cell surface by blocking internalization of mGluR1."}],"page":"1023 - 1032"},{"month":"05","author":[{"first_name":"Katsuyuki","last_name":"Kaneda","full_name":"Kaneda, Katsuyuki"},{"full_name":"Imanishi, Michiko","last_name":"Imanishi","first_name":"Michiko"},{"first_name":"Atsushi","last_name":"Nambu","full_name":"Nambu, Atsushi"},{"full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","last_name":"Shigemoto"},{"full_name":"Takada, Masahiko","first_name":"Masahiko","last_name":"Takada"}],"citation":{"ista":"Kaneda K, Imanishi M, Nambu A, Shigemoto R, Takada M. 2003. Differential expression patterns of mGluR1α in monkey nigral dopamine neurons. Neuroreport. 14(7), 947–950.","apa":"Kaneda, K., Imanishi, M., Nambu, A., Shigemoto, R., &#38; Takada, M. (2003). Differential expression patterns of mGluR1α in monkey nigral dopamine neurons. <i>Neuroreport</i>. Lippincott, Williams &#38; Wilkins. <a href=\"https://doi.org/10.1097/01.wnr.0000074344.81633.e4\">https://doi.org/10.1097/01.wnr.0000074344.81633.e4</a>","ama":"Kaneda K, Imanishi M, Nambu A, Shigemoto R, Takada M. Differential expression patterns of mGluR1α in monkey nigral dopamine neurons. <i>Neuroreport</i>. 2003;14(7):947-950. doi:<a href=\"https://doi.org/10.1097/01.wnr.0000074344.81633.e4\">10.1097/01.wnr.0000074344.81633.e4</a>","short":"K. Kaneda, M. Imanishi, A. Nambu, R. Shigemoto, M. Takada, Neuroreport 14 (2003) 947–950.","mla":"Kaneda, Katsuyuki, et al. “Differential Expression Patterns of MGluR1α in Monkey Nigral Dopamine Neurons.” <i>Neuroreport</i>, vol. 14, no. 7, Lippincott, Williams &#38; Wilkins, 2003, pp. 947–50, doi:<a href=\"https://doi.org/10.1097/01.wnr.0000074344.81633.e4\">10.1097/01.wnr.0000074344.81633.e4</a>.","chicago":"Kaneda, Katsuyuki, Michiko Imanishi, Atsushi Nambu, Ryuichi Shigemoto, and Masahiko Takada. “Differential Expression Patterns of MGluR1α in Monkey Nigral Dopamine Neurons.” <i>Neuroreport</i>. Lippincott, Williams &#38; Wilkins, 2003. <a href=\"https://doi.org/10.1097/01.wnr.0000074344.81633.e4\">https://doi.org/10.1097/01.wnr.0000074344.81633.e4</a>.","ieee":"K. Kaneda, M. Imanishi, A. Nambu, R. Shigemoto, and M. Takada, “Differential expression patterns of mGluR1α in monkey nigral dopamine neurons,” <i>Neuroreport</i>, vol. 14, no. 7. Lippincott, Williams &#38; Wilkins, pp. 947–950, 2003."},"date_created":"2018-12-11T11:58:45Z","extern":1,"status":"public","date_published":"2003-05-01T00:00:00Z","publication":"Neuroreport","issue":"7","publist_id":"4272","abstract":[{"text":"The expression pattern of metabotropic glutamate receptor Iα (mGluR1α) was immunohistochemically investigated in substantia nigra dopaminergic neurons of the macaque monkey. In normal monkeys, mGluR1α immunoreactivity was weakly observed in the dorsal tier of the substantia nigra pars compacta (SNc-d) where calbindin-D28k-containing dopaminergic neurons invulnerable to parkinsonian degeneration are specifically located. On the other hand, mGluR1α was strongly expressed in the ventral tier of the substantia nigra pars cornpacta (SNc-v). In monkeys treated with the parkinsonism-inducing drug, I-methyl-4-phenyl-1,2,3,6-tetrahydropyridine (MPTP), mGluR1α expression was decreased in dopaminergic neurons in the SNc-v that were spared its toxic action. These results suggest that mGluR1α expression may be involved at least partly in the vulnerability of dopaminergic neurons to parkinsonian insults.","lang":"eng"}],"page":"947 - 950","_id":"2626","intvolume":"        14","quality_controlled":0,"title":"Differential expression patterns of mGluR1α in monkey nigral dopamine neurons","doi":"10.1097/01.wnr.0000074344.81633.e4","publisher":"Lippincott, Williams & Wilkins","date_updated":"2021-01-12T06:58:40Z","publication_status":"published","day":"01","year":"2003","volume":14,"type":"journal_article"},{"month":"05","author":[{"full_name":"Kawakami, Ryosuke","first_name":"Ryosuke","last_name":"Kawakami"},{"full_name":"Shinohara, Yoshiaki","first_name":"Yoshiaki","last_name":"Shinohara"},{"last_name":"Kato","first_name":"Yuichiro","full_name":"Kato, Yuichiro"},{"first_name":"Hiroyuki","last_name":"Sugiyama","full_name":"Sugiyama, Hiroyuki"},{"full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ito, Isao","first_name":"Isao","last_name":"Ito"}],"citation":{"short":"R. Kawakami, Y. Shinohara, Y. Kato, H. Sugiyama, R. Shigemoto, I. Ito, Science 300 (2003) 990–994.","mla":"Kawakami, Ryosuke, et al. “Asymmetrical Allocation of NMDA Receptor Ε2 Subunits in Hippocampal Circuitry.” <i>Science</i>, vol. 300, no. 5621, American Association for the Advancement of Science, 2003, pp. 990–94, doi:<a href=\"https://doi.org/10.1126/science.1082609\">10.1126/science.1082609</a>.","ieee":"R. Kawakami, Y. Shinohara, Y. Kato, H. Sugiyama, R. Shigemoto, and I. Ito, “Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry,” <i>Science</i>, vol. 300, no. 5621. American Association for the Advancement of Science, pp. 990–994, 2003.","chicago":"Kawakami, Ryosuke, Yoshiaki Shinohara, Yuichiro Kato, Hiroyuki Sugiyama, Ryuichi Shigemoto, and Isao Ito. “Asymmetrical Allocation of NMDA Receptor Ε2 Subunits in Hippocampal Circuitry.” <i>Science</i>. American Association for the Advancement of Science, 2003. <a href=\"https://doi.org/10.1126/science.1082609\">https://doi.org/10.1126/science.1082609</a>.","apa":"Kawakami, R., Shinohara, Y., Kato, Y., Sugiyama, H., Shigemoto, R., &#38; Ito, I. (2003). Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1082609\">https://doi.org/10.1126/science.1082609</a>","ista":"Kawakami R, Shinohara Y, Kato Y, Sugiyama H, Shigemoto R, Ito I. 2003. Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry. Science. 300(5621), 990–994.","ama":"Kawakami R, Shinohara Y, Kato Y, Sugiyama H, Shigemoto R, Ito I. Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry. <i>Science</i>. 2003;300(5621):990-994. doi:<a href=\"https://doi.org/10.1126/science.1082609\">10.1126/science.1082609</a>"},"date_created":"2018-12-11T11:58:45Z","extern":1,"status":"public","date_published":"2003-05-09T00:00:00Z","publication":"Science","issue":"5621","publist_id":"4271","abstract":[{"lang":"eng","text":"Despite its implications for higher order functions of the brain, little is currently known about the molecular basis of left-right asymmetry of the brain. Here we report that synaptic distribution of N-methyl-D-aspartate (NMDA) receptor GluRε2 (NR2B) subunits in the adult mouse hippocampus is asymmetrical between the left and right and between the apical and basal dendrites of single neurons. These asymmetrical allocations of ε2 subunits differentiate the properties of NMDA receptors and synaptic plasticity between the left and right hippocampus. These results provide a molecular basis for the structural and functional asymmetry of the mature brain."}],"page":"990 - 994","_id":"2627","intvolume":"       300","quality_controlled":0,"title":"Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry","doi":"10.1126/science.1082609","publisher":"American Association for the Advancement of Science","date_updated":"2021-01-12T06:58:40Z","publication_status":"published","day":"09","year":"2003","volume":300,"type":"journal_article"}]