[{"scopus_import":"1","page":"414 - 423","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/185400"}],"publisher":"IEEE","date_updated":"2022-02-28T15:51:45Z","publist_id":"2069","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","date_published":"1991-12-01T00:00:00Z","month":"12","abstract":[{"lang":"eng","text":"It is shown that a triangulation of a set of n points in the plane that minimizes the maximum edge length can be computed in time O(n2). The algorithm is reasonably easy to implement and is based on the theorem that there is a triangulation with minmax edge length that contains the relative neighborhood graph of the points as a subgraph. With minor modifications the algorithm works for arbitrary normed metrics."}],"conference":{"name":"FOCS: Foundations of Computer Science","location":"San Juan, PR, United States of America","start_date":"1991-10-01","end_date":"1991-10-04"},"author":[{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Tan","first_name":"Tiow","full_name":"Tan, Tiow"}],"_id":"4055","type":"conference","article_processing_charge":"No","extern":"1","publication":"32nd Annual Symposium of Foundations of Computer Science","citation":{"mla":"Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” <i>32nd Annual Symposium of Foundations of Computer Science</i>, IEEE, 1991, pp. 414–23, doi:<a href=\"https://doi.org/10.1109/SFCS.1991.185400\">10.1109/SFCS.1991.185400</a>.","ieee":"H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length triangulation,” in <i>32nd Annual Symposium of Foundations of Computer Science</i>, San Juan, PR, United States of America, 1991, pp. 414–423.","ista":"Edelsbrunner H, Tan T. 1991. A quadratic time algorithm for the minmax length triangulation. 32nd Annual Symposium of Foundations of Computer Science. FOCS: Foundations of Computer Science, 414–423.","short":"H. Edelsbrunner, T. Tan, in:, 32nd Annual Symposium of Foundations of Computer Science, IEEE, 1991, pp. 414–423.","chicago":"Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” In <i>32nd Annual Symposium of Foundations of Computer Science</i>, 414–23. IEEE, 1991. <a href=\"https://doi.org/10.1109/SFCS.1991.185400\">https://doi.org/10.1109/SFCS.1991.185400</a>.","apa":"Edelsbrunner, H., &#38; Tan, T. (1991). A quadratic time algorithm for the minmax length triangulation. In <i>32nd Annual Symposium of Foundations of Computer Science</i> (pp. 414–423). San Juan, PR, United States of America: IEEE. <a href=\"https://doi.org/10.1109/SFCS.1991.185400\">https://doi.org/10.1109/SFCS.1991.185400</a>","ama":"Edelsbrunner H, Tan T. A quadratic time algorithm for the minmax length triangulation. In: <i>32nd Annual Symposium of Foundations of Computer Science</i>. IEEE; 1991:414-423. doi:<a href=\"https://doi.org/10.1109/SFCS.1991.185400\">10.1109/SFCS.1991.185400</a>"},"doi":"10.1109/SFCS.1991.185400","quality_controlled":"1","date_created":"2018-12-11T12:06:40Z","oa_version":"None","status":"public","title":"A quadratic time algorithm for the minmax length triangulation","language":[{"iso":"eng"}],"day":"01","year":"1991"},{"year":"1991","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1096-0899"],"issn":["0097-3165"]},"intvolume":"        56","quality_controlled":"1","citation":{"ama":"Edelsbrunner H, Hajnal P. A lower bound on the number of unit distances between the vertices of a convex polygon. <i>Journal of Combinatorial Theory Series A</i>. 1991;56(2):312-316. doi:<a href=\"https://doi.org/10.1016/0097-3165(91)90042-F\">10.1016/0097-3165(91)90042-F</a>","ista":"Edelsbrunner H, Hajnal P. 1991. A lower bound on the number of unit distances between the vertices of a convex polygon. Journal of Combinatorial Theory Series A. 56(2), 312–316.","ieee":"H. Edelsbrunner and P. Hajnal, “A lower bound on the number of unit distances between the vertices of a convex polygon,” <i>Journal of Combinatorial Theory Series A</i>, vol. 56, no. 2. Elsevier, pp. 312–316, 1991.","mla":"Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon.” <i>Journal of Combinatorial Theory Series A</i>, vol. 56, no. 2, Elsevier, 1991, pp. 312–16, doi:<a href=\"https://doi.org/10.1016/0097-3165(91)90042-F\">10.1016/0097-3165(91)90042-F</a>.","apa":"Edelsbrunner, H., &#38; Hajnal, P. (1991). A lower bound on the number of unit distances between the vertices of a convex polygon. <i>Journal of Combinatorial Theory Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/0097-3165(91)90042-F\">https://doi.org/10.1016/0097-3165(91)90042-F</a>","short":"H. Edelsbrunner, P. Hajnal, Journal of Combinatorial Theory Series A 56 (1991) 312–316.","chicago":"Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon.” <i>Journal of Combinatorial Theory Series A</i>. Elsevier, 1991. <a href=\"https://doi.org/10.1016/0097-3165(91)90042-F\">https://doi.org/10.1016/0097-3165(91)90042-F</a>."},"doi":"10.1016/0097-3165(91)90042-F","extern":"1","acknowledgement":"The first author is pleased to acknowledge partial support by the Amoco Fnd. Fat. Dev. Comput. Sci. i-6-44862 and the National Science Foundation under Grant CCR-8714565.","abstract":[{"lang":"eng","text":"This paper proves that for every n ≥ 4 there is a convex n-gon such that the vertices of 2n - 7 vertex pairs are one unit of distance apart. This improves the previously best lower bound of ⌊ (5n - 5) 3⌋ given by Erdo{combining double acute accent}s and Moser if n ≥ 17."}],"oa":1,"page":"312 - 316","day":"01","volume":56,"title":"A lower bound on the number of unit distances between the vertices of a convex polygon","status":"public","date_created":"2018-12-11T12:06:41Z","oa_version":"Published Version","publication":"Journal of Combinatorial Theory Series A","_id":"4056","article_processing_charge":"No","issue":"2","type":"journal_article","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"first_name":"Péter","last_name":"Hajnal","full_name":"Hajnal, Péter"}],"article_type":"original","month":"03","date_published":"1991-03-01T00:00:00Z","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"2070","date_updated":"2022-03-02T09:56:10Z","publisher":"Elsevier","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/009731659190042F?via%3Dihub","open_access":"1"}],"scopus_import":"1"},{"publisher":"Elsevier","publist_id":"2071","date_updated":"2022-03-02T10:06:55Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","date_published":"1991-04-01T00:00:00Z","month":"04","article_type":"original","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/002200009190013U?via%3Dihub"}],"status":"public","title":"Corrigendum","volume":42,"day":"01","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"}],"_id":"4057","type":"journal_article","issue":"2","article_processing_charge":"No","publication":"Journal of Computer and System Sciences","date_created":"2018-12-11T12:06:41Z","oa_version":"Published Version","oa":1,"page":"249 - 251","intvolume":"        42","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0022-0000"],"eissn":["1090-2724"]},"year":"1991","extern":"1","citation":{"ama":"Edelsbrunner H. Corrigendum. <i>Journal of Computer and System Sciences</i>. 1991;42(2):249-251. doi:<a href=\"https://doi.org/10.1016/0022-0000(91)90013-U\">10.1016/0022-0000(91)90013-U</a>","ista":"Edelsbrunner H. 1991. Corrigendum. Journal of Computer and System Sciences. 42(2), 249–251.","ieee":"H. Edelsbrunner, “Corrigendum,” <i>Journal of Computer and System Sciences</i>, vol. 42, no. 2. Elsevier, pp. 249–251, 1991.","mla":"Edelsbrunner, Herbert. “Corrigendum.” <i>Journal of Computer and System Sciences</i>, vol. 42, no. 2, Elsevier, 1991, pp. 249–51, doi:<a href=\"https://doi.org/10.1016/0022-0000(91)90013-U\">10.1016/0022-0000(91)90013-U</a>.","apa":"Edelsbrunner, H. (1991). Corrigendum. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/0022-0000(91)90013-U\">https://doi.org/10.1016/0022-0000(91)90013-U</a>","short":"H. Edelsbrunner, Journal of Computer and System Sciences 42 (1991) 249–251.","chicago":"Edelsbrunner, Herbert. “Corrigendum.” <i>Journal of Computer and System Sciences</i>. Elsevier, 1991. <a href=\"https://doi.org/10.1016/0022-0000(91)90013-U\">https://doi.org/10.1016/0022-0000(91)90013-U</a>."},"doi":"10.1016/0022-0000(91)90013-U","quality_controlled":"1"},{"publist_id":"2065","date_updated":"2022-02-28T14:41:47Z","publisher":"SIAM","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_published":"1991-01-01T00:00:00Z","month":"01","abstract":[{"text":"We present a randomized incremental algorithm for computing a single face in an arrangement of n line segments in the plane that is fairly simple to implement. The expected running time of the algorithm is O (nα(n) log n). The analysis of the algorithm uses a novel approach that generalizes and extends the Clarkson-Shor analysis technique.","lang":"eng"}],"scopus_import":"1","page":"441 - 448","main_file_link":[{"url":"https://dl.acm.org/doi/10.5555/127787.127864"}],"status":"public","title":"Computing a face in an arrangement of line segments","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-0-89791-376-8"]},"year":"1991","day":"01","acknowledgement":"NSF Grant CC R-89-21421. The authors wish to express their gratitude for the generous support and hospitality of the DEC Palo Alto Systems Research Center. ","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"San Francisco, CA, United States of America","start_date":"1991-01-28","end_date":"1991-01-30"},"author":[{"full_name":"Chazelle, Bernard","first_name":"Bernard","last_name":"Chazelle"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"},{"first_name":"Jack","last_name":"Snoeyink","full_name":"Snoeyink, Jack"}],"publication":"Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms","extern":"1","type":"conference","_id":"4058","article_processing_charge":"No","date_created":"2018-12-11T12:06:41Z","quality_controlled":"1","oa_version":"None","citation":{"ieee":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink, “Computing a face in an arrangement of line segments,” in <i>Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms</i>, San Francisco, CA, United States of America, 1991, pp. 441–448.","ista":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. 1991. Computing a face in an arrangement of line segments. Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms. SODA: Symposium on Discrete Algorithms, 441–448.","mla":"Chazelle, Bernard, et al. “Computing a Face in an Arrangement of Line Segments.” <i>Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, SIAM, 1991, pp. 441–48.","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &#38; Snoeyink, J. (1991). Computing a face in an arrangement of line segments. In <i>Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms</i> (pp. 441–448). San Francisco, CA, United States of America: SIAM.","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jack Snoeyink. “Computing a Face in an Arrangement of Line Segments.” In <i>Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 441–48. SIAM, 1991.","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Snoeyink, in:, Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1991, pp. 441–448.","ama":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. Computing a face in an arrangement of line segments. In: <i>Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>. SIAM; 1991:441-448."}},{"intvolume":"       510","year":"1991","language":[{"iso":"eng"}],"conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"1991-07-08","end_date":"1991-07-12","location":"Madrid, Spain"},"acknowledgement":"Work by Bernard Chazelle has been supported by NSF Grant CCR-87-00917. Work by Herbert Edelsbrunner has been supported by NSF Grant CCR-89-21421. Work by Micha Sharir has been supported by ONR Grants N00014-89-J-3042 and N00014-90-J-1284, by NSF Grant CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation, the Fund for Basic Research administered by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development.","citation":{"mla":"Chazelle, Bernard, et al. “Ray Shooting in Polygons Using Geodesic Triangulations.” <i>18th International Colloquium on Automata, Languages and Programming</i>, vol. 510, Springer, 1991, pp. 661–73, doi:<a href=\"https://doi.org/10.1007/3-540-54233-7_172\">10.1007/3-540-54233-7_172</a>.","ista":"Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1991. Ray shooting in polygons using geodesic triangulations. 18th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 510, 661–673.","ieee":"B. Chazelle <i>et al.</i>, “Ray shooting in polygons using geodesic triangulations,” in <i>18th International Colloquium on Automata, Languages and Programming</i>, Madrid, Spain, 1991, vol. 510, pp. 661–673.","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons Using Geodesic Triangulations.” In <i>18th International Colloquium on Automata, Languages and Programming</i>, 510:661–73. Springer, 1991. <a href=\"https://doi.org/10.1007/3-540-54233-7_172\">https://doi.org/10.1007/3-540-54233-7_172</a>.","short":"B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, J. Snoeyink, in:, 18th International Colloquium on Automata, Languages and Programming, Springer, 1991, pp. 661–673.","apa":"Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Hershberger, J., Sharir, M., &#38; Snoeyink, J. (1991). Ray shooting in polygons using geodesic triangulations. In <i>18th International Colloquium on Automata, Languages and Programming</i> (Vol. 510, pp. 661–673). Madrid, Spain: Springer. <a href=\"https://doi.org/10.1007/3-540-54233-7_172\">https://doi.org/10.1007/3-540-54233-7_172</a>","ama":"Chazelle B, Edelsbrunner H, Grigni M, et al. Ray shooting in polygons using geodesic triangulations. In: <i>18th International Colloquium on Automata, Languages and Programming</i>. Vol 510. Springer; 1991:661-673. doi:<a href=\"https://doi.org/10.1007/3-540-54233-7_172\">10.1007/3-540-54233-7_172</a>"},"doi":"10.1007/3-540-54233-7_172","quality_controlled":"1","extern":"1","abstract":[{"text":"Let P be a simple polygon with n vertices. We present a simple decomposition scheme that partitions the interior of P into O(n) so-called geodesic triangles, so that any line segment interior to P crosses at most 2 log n of these triangles. This decomposition can be used to preprocess P in time O(n log n) and storage O(n), so that any ray-shooting query can be answered in time O(log n).The algorithms are fairly simple and easy to implement. We also extend this technique to the case of ray-shooting amidst k polygonal obstacles with a total of n edges, so that a query can be answered in O(radicklog n) time.","lang":"eng"}],"page":"661 - 673","alternative_title":["LNCS"],"title":"Ray shooting in polygons using geodesic triangulations","volume":510,"status":"public","day":"20","author":[{"last_name":"Chazelle","first_name":"Bernard","full_name":"Chazelle, Bernard"},{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Grigni, Michelangelo","first_name":"Michelangelo","last_name":"Grigni"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"},{"last_name":"Hershberger","first_name":"John","full_name":"Hershberger, John"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"},{"last_name":"Snoeyink","first_name":"Jack","full_name":"Snoeyink, Jack"}],"date_created":"2018-12-11T12:06:42Z","oa_version":"None","article_processing_charge":"No","_id":"4059","type":"conference","publication":"18th International Colloquium on Automata, Languages and Programming","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Springer","publist_id":"2066","date_updated":"2022-02-28T14:53:03Z","month":"06","date_published":"1991-06-20T00:00:00Z","scopus_import":"1","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-54233-7_172"}]},{"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02574698","open_access":"1"}],"scopus_import":"1","article_type":"original","month":"12","date_published":"1991-12-01T00:00:00Z","publist_id":"2062","date_updated":"2022-02-24T15:06:41Z","publisher":"Springer","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"Discrete & Computational Geometry","_id":"4061","article_processing_charge":"No","type":"journal_article","issue":"1","oa_version":"Published Version","date_created":"2018-12-11T12:06:42Z","author":[{"first_name":"Pankaj","last_name":"Agarwal","full_name":"Agarwal, Pankaj"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"full_name":"Schwarzkopf, Otfried","last_name":"Schwarzkopf","first_name":"Otfried"},{"full_name":"Welzl, Emo","first_name":"Emo","last_name":"Welzl"}],"day":"01","status":"public","title":"Euclidean minimum spanning trees and bichromatic closest pairs","volume":6,"page":"407 - 422","abstract":[{"text":"We present an algorithm to compute a Euclidean minimum spanning tree of a given set S of N points in Ed in time O(Fd (N,N) logd N), where Fd (n,m) is the time required to compute a bichromatic closest pair among n red and m green points in Ed . If Fd (N,N)=Ω(N1+ε), for some fixed e{open}&gt;0, then the running time improves to O(Fd (N,N)). Furthermore, we describe a randomized algorithm to compute a bichromatic closest pair in expected time O((nm log n log m)2/3+m log2 n+n log2 m) in E3, which yields an O(N4/3 log4/3 N) expected time, algorithm for computing a Euclidean minimum spanning tree of N points in E3. In d≥4 dimensions we obtain expected time O((nm)1-1/([d/2]+1)+ε+m log n+n log m) for the bichromatic closest pair problem and O(N2-2/([d/2]+1)ε) for the Euclidean minimum spanning tree problem, for any positive e{open}.","lang":"eng"}],"oa":1,"extern":"1","quality_controlled":"1","citation":{"ama":"Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs. <i>Discrete &#38; Computational Geometry</i>. 1991;6(1):407-422. doi:<a href=\"https://doi.org/10.1007/BF02574698\">10.1007/BF02574698</a>","mla":"Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” <i>Discrete &#38; Computational Geometry</i>, vol. 6, no. 1, Springer, 1991, pp. 407–22, doi:<a href=\"https://doi.org/10.1007/BF02574698\">10.1007/BF02574698</a>.","ista":"Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &#38; Computational Geometry. 6(1), 407–422.","ieee":"P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “Euclidean minimum spanning trees and bichromatic closest pairs,” <i>Discrete &#38; Computational Geometry</i>, vol. 6, no. 1. Springer, pp. 407–422, 1991.","short":"P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete &#38; Computational Geometry 6 (1991) 407–422.","chicago":"Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1991. <a href=\"https://doi.org/10.1007/BF02574698\">https://doi.org/10.1007/BF02574698</a>.","apa":"Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., &#38; Welzl, E. (1991). Euclidean minimum spanning trees and bichromatic closest pairs. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02574698\">https://doi.org/10.1007/BF02574698</a>"},"doi":"10.1007/BF02574698","acknowledgement":"The first, second, and fourth authors acknowledge support from the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), a National Science Foundation Science and Technology Center under NSF Grant STC 88-09648. The second author's work was supported by the National Science Foundation under Grant CCR-8714565. The third author's work was supported by the Deutsche Forschungsgemeinschaft under Grant A1 253/1-3, Schwerpunktprogramm \"Datenstrukturen und effiziente Algorithmen.\" The last two authors' work was also partially supported by the ESPRIT II Basic Research Action of the EC under Contract No. 3075 (project ALCOM).","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"year":"1991","intvolume":"         6"},{"page":"435 - 442","abstract":[{"lang":"eng","text":"We prove that for any set S of n points in the plane and n3-α triangles spanned by the points in S there exists a point (not necessarily in S) contained in at least n3-3α/(c log5 n) of the triangles. This implies that any set of n points in three-dimensional space defines at most {Mathematical expression} halving planes."}],"oa":1,"acknowledgement":"Work on this paper by Boris Aronov and Rephael Wenger has been supported by DIMACS under NSF Grant STC-88-09648. Work on this paper by Bernard Chazelle has been supported by NSF Grant CCR-87-00917. Work by Herbert Edelsbrunner has been supported by NSF Grant CCR-87-14565. Micha Sharir has been supported by ONR Grant N00014-87-K-0129, by NSF Grant CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation, the Israeli National Council for Research and Development, and the Fund for Basic Research administered by the Israeli\r\nAcademy of Sciences","extern":"1","quality_controlled":"1","citation":{"mla":"Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.” <i>Discrete &#38; Computational Geometry</i>, vol. 6, no. 1, Springer, 1991, pp. 435–42, doi:<a href=\"https://doi.org/10.1007/BF02574700\">10.1007/BF02574700</a>.","ista":"Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1991. Points and triangles in the plane and halving planes in space. Discrete &#38; Computational Geometry. 6(1), 435–442.","ieee":"B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” <i>Discrete &#38; Computational Geometry</i>, vol. 6, no. 1. Springer, pp. 435–442, 1991.","chicago":"Aronov, Boris, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Rephael Wenger. “Points and Triangles in the Plane and Halving Planes in Space.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1991. <a href=\"https://doi.org/10.1007/BF02574700\">https://doi.org/10.1007/BF02574700</a>.","short":"B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, Discrete &#38; Computational Geometry 6 (1991) 435–442.","apa":"Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &#38; Wenger, R. (1991). Points and triangles in the plane and halving planes in space. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02574700\">https://doi.org/10.1007/BF02574700</a>","ama":"Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. Points and triangles in the plane and halving planes in space. <i>Discrete &#38; Computational Geometry</i>. 1991;6(1):435-442. doi:<a href=\"https://doi.org/10.1007/BF02574700\">10.1007/BF02574700</a>"},"doi":"10.1007/BF02574700","intvolume":"         6","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"year":"1991","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://link.springer.com/article/10.1007/BF02574700"}],"date_updated":"2022-02-24T15:39:25Z","publist_id":"2063","publisher":"Springer","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_type":"original","date_published":"1991-12-01T00:00:00Z","month":"12","author":[{"full_name":"Aronov, Boris","first_name":"Boris","last_name":"Aronov"},{"first_name":"Bernard","last_name":"Chazelle","full_name":"Chazelle, Bernard"},{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"},{"full_name":"Wenger, Rephael","first_name":"Rephael","last_name":"Wenger"}],"publication":"Discrete & Computational Geometry","_id":"4062","article_processing_charge":"No","issue":"1","type":"journal_article","date_created":"2018-12-11T12:06:43Z","oa_version":"Published Version","status":"public","volume":6,"title":"Points and triangles in the plane and halving planes in space","day":"01"},{"publication_identifier":{"isbn":["978-0-89791-419-2"]},"language":[{"iso":"eng"}],"day":"01","year":"1991","status":"public","title":"Temporal proof methodologies for real-time systems","type":"conference","_id":"4508","article_processing_charge":"No","publication":"Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","extern":"1","citation":{"apa":"Henzinger, T. A., Manna, Z., &#38; Pnueli, A. (1991). Temporal proof methodologies for real-time systems. In <i>Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages</i> (pp. 353–366). Orlando, FL, United States of America: ACM. <a href=\"https://doi.org/10.1145/99583.99629\">https://doi.org/10.1145/99583.99629</a>","chicago":"Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “Temporal Proof Methodologies for Real-Time Systems.” In <i>Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</i>, 353–66. ACM, 1991. <a href=\"https://doi.org/10.1145/99583.99629\">https://doi.org/10.1145/99583.99629</a>.","short":"T.A. Henzinger, Z. Manna, A. Pnueli, in:, Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, 1991, pp. 353–366.","ista":"Henzinger TA, Manna Z, Pnueli A. 1991. Temporal proof methodologies for real-time systems. Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. POPL: Principles of Programming Languages, 353–366.","ieee":"T. A. Henzinger, Z. Manna, and A. Pnueli, “Temporal proof methodologies for real-time systems,” in <i>Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages</i>, Orlando, FL, United States of America, 1991, pp. 353–366.","mla":"Henzinger, Thomas A., et al. “Temporal Proof Methodologies for Real-Time Systems.” <i>Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</i>, ACM, 1991, pp. 353–66, doi:<a href=\"https://doi.org/10.1145/99583.99629\">10.1145/99583.99629</a>.","ama":"Henzinger TA, Manna Z, Pnueli A. Temporal proof methodologies for real-time systems. In: <i>Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</i>. ACM; 1991:353-366. doi:<a href=\"https://doi.org/10.1145/99583.99629\">10.1145/99583.99629</a>"},"doi":"10.1145/99583.99629","date_created":"2018-12-11T12:09:13Z","quality_controlled":"1","oa_version":"None","conference":{"start_date":"1991-01-21","end_date":"1991-01-23","location":"Orlando, FL, United States of America","name":"POPL: Principles of Programming Languages"},"acknowledgement":"This research was supported in part by an IBM graduate fellowship, by the National Science Foundation grants CCR-89-11512 and CC R-89-13641, by the Defense Advanced Re-search Projects Agency under contract NOO03%84C-0211, by the United States Air Force Office of Scientific Research un-der contract AFOSR-W-0057, and by the European Community ESPRIT Basic Research Action project 3096 (SPEC). We thank Rajeev Alur for many helpful discussions. ","author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Zohar","last_name":"Manna","full_name":"Manna, Zohar"},{"full_name":"Pnueli, Amir","last_name":"Pnueli","first_name":"Amir"}],"date_published":"1991-01-01T00:00:00Z","month":"01","abstract":[{"text":"We extend the specification language of temporal logic, the corresponding verification framework, and the underlying computational model to deal with real-time properties of concurrent and reactive systems. A global, discrete, and asynchronous clock is incorporated into the model by defining the abstract notion of a real-time transition system as a conservative extension of traditional transition systems: qualitative fairness requirements are replaced (and superseded) by quantitative lower-bound and upperbound real-time requirements for transitions. We show how to model real-time systems that communicate either through shared variables or by message passing, and how to represent the important real-time constructs of priorities (interrupts), scheduling, and timeouts in this framework. Two styles for the specification of real-time properties are presented. The first style uses bounded versions of the temporal operators; the real-time requirements expressed in this style are classified ...","lang":"eng"}],"publisher":"ACM","date_updated":"2022-02-24T14:44:39Z","publist_id":"221","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/99583.99629"}],"scopus_import":"1","page":"353 - 366"},{"abstract":[{"text":"We extend the specification language of temporal logic, the corresponding verification framework, and the underlying computational model to deal with real-time properties of reactive systems. Semantics We introduce the abstract computational model of timed transition systems as a conservative extension of traditional transition systems qualitative fairness requirements are superseded by quantitative real-time constraints on the transitions. Digital clocks are introduced as observers of continuous real-time behavior. We justify our semantical abstractions by demonstrating that a wide variety of concrete real-time systems can be modeled adequately. Specification We present two conservative extensions of temporal logic that allow for the specification of timing constraints while timed temporal logic provides access to time through a novel kind of time quantifier, metric temporal logic refers to time through time-bounded versions of the temporal operators. We justify our choice of specification languages by developing a general framework for the classification of real-time logics according to their complexity and expressive power. Verification We develop tools for determining if a real-time system that is modeled as a timed transition system meets a specification that is given in timed temporal logic or in metric temporal logic. We present both model-checking algorithms for the automatic verification of finite-state real-time systems and proof methods for the deductive verification of real-time systems.","lang":"eng"}],"degree_awarded":"PhD","month":"08","date_published":"1991-08-30T00:00:00Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Stanford University","publist_id":"210","date_updated":"2022-02-24T14:12:36Z","main_file_link":[{"url":"http://pub.ist.ac.at/~tah/Publications/the_temporal_specification_and_verification_of_real-time_systems.pdf"}],"page":"295","year":"1991","day":"30","language":[{"iso":"eng"}],"title":"The temporal specification and verification of real-time systems ","status":"public","citation":{"ama":"Henzinger TA. The temporal specification and verification of real-time systems . 1991.","short":"T.A. Henzinger, The Temporal Specification and Verification of Real-Time Systems , Stanford University, 1991.","chicago":"Henzinger, Thomas A. “The Temporal Specification and Verification of Real-Time Systems .” Stanford University, 1991.","apa":"Henzinger, T. A. (1991). <i>The temporal specification and verification of real-time systems </i>. Stanford University.","mla":"Henzinger, Thomas A. <i>The Temporal Specification and Verification of Real-Time Systems </i>. Stanford University, 1991.","ista":"Henzinger TA. 1991. The temporal specification and verification of real-time systems . Stanford University.","ieee":"T. A. Henzinger, “The temporal specification and verification of real-time systems ,” Stanford University, 1991."},"oa_version":"None","date_created":"2018-12-11T12:09:15Z","_id":"4516","type":"dissertation","article_processing_charge":"No","extern":"1","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}]},{"date_updated":"2022-02-24T13:54:10Z","publist_id":"113","publisher":"ACM","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_type":"letter_note","month":"01","date_published":"1991-01-01T00:00:00Z","page":"6 - 12","main_file_link":[{"url":"https://dl.acm.org/toc/sigact/1991/22/1"}],"intvolume":"        22","status":"public","title":"Time for logic","volume":22,"publication_identifier":{"issn":["0163-5700"]},"language":[{"iso":"eng"}],"day":"01","year":"1991","author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"publication":"SIGACT News","extern":"1","type":"journal_article","_id":"4592","article_processing_charge":"No","issue":"3","quality_controlled":"1","oa_version":"None","date_created":"2018-12-11T12:09:39Z","citation":{"apa":"Alur, R., &#38; Henzinger, T. A. (1991). Time for logic. <i>SIGACT News</i>. ACM.","short":"R. Alur, T.A. Henzinger, SIGACT News 22 (1991) 6–12.","chicago":"Alur, Rajeev, and Thomas A Henzinger. “Time for Logic.” <i>SIGACT News</i>. ACM, 1991.","ista":"Alur R, Henzinger TA. 1991. Time for logic. SIGACT News. 22(3), 6–12.","ieee":"R. Alur and T. A. Henzinger, “Time for logic,” <i>SIGACT News</i>, vol. 22, no. 3. ACM, pp. 6–12, 1991.","mla":"Alur, Rajeev, and Thomas A. Henzinger. “Time for Logic.” <i>SIGACT News</i>, vol. 22, no. 3, ACM, 1991, pp. 6–12.","ama":"Alur R, Henzinger TA. Time for logic. <i>SIGACT News</i>. 1991;22(3):6-12."}},{"page":"139 - 152","scopus_import":"1","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/227595.227602"}],"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"86","date_updated":"2022-02-24T13:27:20Z","publisher":"ACM","abstract":[{"lang":"eng","text":"The  most  natural,  compositional,  way  of  modeling  real-time  systems  uses  a  dense domain  for  time.  The  satisfiability  of  timing  constraints  that  are  capable  of  expressing  punctuality in  this  model,  however,  is  known  to  be  undecidable.  We  introduce  a  temporal  language  that  can constrain  the  time  difference  between  events  only  with  finite,  yet  arbitrary,  precision  and  show  the resulting  logic  to  be  EXPSPACE-complete.  This  result  allows  us  to  develop  an  algorithm  for  the verification  of  timing  properties  of  real-time  systems  with  a  dense  semantics."}],"month":"01","date_published":"1991-01-01T00:00:00Z","author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"full_name":"Feder, Tomás","last_name":"Feder","first_name":"Tomás"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"We  wish  to  thank  an  anonymous  referee  for  pointing  out the  PSPACE-fragment  of  Section  4.5.  T. A. Henzinger was supported in part by the Office of Naval Research Young Investigator award NOOO14-95-l-0520, by the National Science Foundation CAREER award CCR 9501708, by the National Science Foundation grants CCR 92-00794 and CCR 9504469, by the Air Force Office of Scientific Research contract F49620-93-l-0056, and by the Advanced Research Projects Agency grant NAG2-892. ","conference":{"name":"PODC: Principles of Distributed Computing","location":"Montreal, Canada","start_date":"1991-08-19","end_date":"1991-08-21"},"date_created":"2018-12-11T12:09:48Z","quality_controlled":"1","oa_version":"None","citation":{"ieee":"R. Alur, T. Feder, and T. A. Henzinger, “The benefits of relaxing punctuality,” in <i>Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing</i>, Montreal, Canada, 1991, pp. 139–152.","ista":"Alur R, Feder T, Henzinger TA. 1991. The benefits of relaxing punctuality. Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 139–152.","mla":"Alur, Rajeev, et al. “The Benefits of Relaxing Punctuality.” <i>Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing</i>, ACM, 1991, pp. 139–52, doi:<a href=\"https://doi.org/10.1145/227595.227602\">10.1145/227595.227602</a>.","apa":"Alur, R., Feder, T., &#38; Henzinger, T. A. (1991). The benefits of relaxing punctuality. In <i>Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing</i> (pp. 139–152). Montreal, Canada: ACM. <a href=\"https://doi.org/10.1145/227595.227602\">https://doi.org/10.1145/227595.227602</a>","chicago":"Alur, Rajeev, Tomás Feder, and Thomas A Henzinger. “The Benefits of Relaxing Punctuality.” In <i>Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing</i>, 139–52. ACM, 1991. <a href=\"https://doi.org/10.1145/227595.227602\">https://doi.org/10.1145/227595.227602</a>.","short":"R. Alur, T. Feder, T.A. Henzinger, in:, Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1991, pp. 139–152.","ama":"Alur R, Feder T, Henzinger TA. The benefits of relaxing punctuality. In: <i>Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing</i>. ACM; 1991:139-152. doi:<a href=\"https://doi.org/10.1145/227595.227602\">10.1145/227595.227602</a>"},"doi":"10.1145/227595.227602","extern":"1","publication":"Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing","_id":"4621","article_processing_charge":"No","type":"conference","title":"The benefits of relaxing punctuality","status":"public","day":"01","year":"1991","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-0-89791-439-0"]}},{"intvolume":"       349","pmid":1,"year":"1991","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"quality_controlled":"1","citation":{"ista":"Masu M, Tanabe Y, Tsuchida K, Shigemoto R, Nakanishi S. 1991. Sequence and expression of a metabotropic glutamate receptor. Nature. 349(6312), 760–765.","ieee":"M. Masu, Y. Tanabe, K. Tsuchida, R. Shigemoto, and S. Nakanishi, “Sequence and expression of a metabotropic glutamate receptor,” <i>Nature</i>, vol. 349, no. 6312. Nature Publishing Group, pp. 760–765, 1991.","mla":"Masu, Masayuki, et al. “Sequence and Expression of a Metabotropic Glutamate Receptor.” <i>Nature</i>, vol. 349, no. 6312, Nature Publishing Group, 1991, pp. 760–65, doi:<a href=\"https://doi.org/10.1038/349760a0\">10.1038/349760a0</a>.","apa":"Masu, M., Tanabe, Y., Tsuchida, K., Shigemoto, R., &#38; Nakanishi, S. (1991). Sequence and expression of a metabotropic glutamate receptor. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/349760a0\">https://doi.org/10.1038/349760a0</a>","short":"M. Masu, Y. Tanabe, K. Tsuchida, R. Shigemoto, S. Nakanishi, Nature 349 (1991) 760–765.","chicago":"Masu, Masayuki, Yasuto Tanabe, Kunihiro Tsuchida, Ryuichi Shigemoto, and Shigetada Nakanishi. “Sequence and Expression of a Metabotropic Glutamate Receptor.” <i>Nature</i>. Nature Publishing Group, 1991. <a href=\"https://doi.org/10.1038/349760a0\">https://doi.org/10.1038/349760a0</a>.","ama":"Masu M, Tanabe Y, Tsuchida K, Shigemoto R, Nakanishi S. Sequence and expression of a metabotropic glutamate receptor. <i>Nature</i>. 1991;349(6312):760-765. doi:<a href=\"https://doi.org/10.1038/349760a0\">10.1038/349760a0</a>"},"doi":"10.1038/349760a0","extern":"1","abstract":[{"text":"The complementary DNA of a metabotropic glutamate receptor coupled to inositol phosphate/Ca2+ signal transduction has been cloned and characterized. This receptor shows no sequence similarity to conventional G protein-coupled receptors and has a unique structure with large hydrophilic sequences at both sides of seven putative membrane-spanning domains. Abundant expression of this messenger RNA is observed in neuronal cells in hippocampal dentate gyrus and CA2-3 and in cerebellar Purkinje cells, suggesting the importance of this receptor in specific hippocampal and cerebellar functions.","lang":"eng"}],"page":"760 - 765","external_id":{"pmid":["1847995 "]},"title":"Sequence and expression of a metabotropic glutamate receptor","volume":349,"status":"public","day":"28","author":[{"full_name":"Masu, Masayuki","first_name":"Masayuki","last_name":"Masu"},{"full_name":"Tanabe, Yasuto","last_name":"Tanabe","first_name":"Yasuto"},{"first_name":"Kunihiro","last_name":"Tsuchida","full_name":"Tsuchida, Kunihiro"},{"last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi"},{"full_name":"Nakanishi, Shigetada","first_name":"Shigetada","last_name":"Nakanishi"}],"date_created":"2018-12-11T11:57:55Z","oa_version":"None","publication":"Nature","_id":"2482","type":"journal_article","article_processing_charge":"No","issue":"6312","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"4419","date_updated":"2022-03-03T15:37:36Z","publisher":"Nature Publishing Group","article_type":"original","month":"02","date_published":"1991-02-28T00:00:00Z","scopus_import":"1","main_file_link":[{"url":"https://www.nature.com/articles/349760a0"}]},{"pmid":1,"intvolume":"       353","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"year":"1991","extern":"1","doi":"10.1038/354031a0","citation":{"ama":"Moriyoshi K, Masu M, Ishii T, Shigemoto R, Mizuno N, Nakanishi S. Molecular cloning and characterization of the rat NMDA receptor. <i>Nature</i>. 1991;353(6348):31-37. doi:<a href=\"https://doi.org/10.1038/354031a0\">10.1038/354031a0</a>","apa":"Moriyoshi, K., Masu, M., Ishii, T., Shigemoto, R., Mizuno, N., &#38; Nakanishi, S. (1991). Molecular cloning and characterization of the rat NMDA receptor. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/354031a0\">https://doi.org/10.1038/354031a0</a>","chicago":"Moriyoshi, Koki, Masayuki Masu, Takahiro Ishii, Ryuichi Shigemoto, Noboru Mizuno, and Shigetada Nakanishi. “Molecular Cloning and Characterization of the Rat NMDA Receptor.” <i>Nature</i>. Nature Publishing Group, 1991. <a href=\"https://doi.org/10.1038/354031a0\">https://doi.org/10.1038/354031a0</a>.","short":"K. Moriyoshi, M. Masu, T. Ishii, R. Shigemoto, N. Mizuno, S. Nakanishi, Nature 353 (1991) 31–37.","ieee":"K. Moriyoshi, M. Masu, T. Ishii, R. Shigemoto, N. Mizuno, and S. Nakanishi, “Molecular cloning and characterization of the rat NMDA receptor,” <i>Nature</i>, vol. 353, no. 6348. Nature Publishing Group, pp. 31–37, 1991.","ista":"Moriyoshi K, Masu M, Ishii T, Shigemoto R, Mizuno N, Nakanishi S. 1991. Molecular cloning and characterization of the rat NMDA receptor. Nature. 353(6348), 31–37.","mla":"Moriyoshi, Koki, et al. “Molecular Cloning and Characterization of the Rat NMDA Receptor.” <i>Nature</i>, vol. 353, no. 6348, Nature Publishing Group, 1991, pp. 31–37, doi:<a href=\"https://doi.org/10.1038/354031a0\">10.1038/354031a0</a>."},"quality_controlled":"1","abstract":[{"text":"A complementary DNA encoding the rat NMDA receptor has been cloned and characterized. The single protein encoded by the cDNA forms a receptor-channel complex that has electrophysiological and pharmacological properties characteristic of the NMDA receptor. This protein has a significant sequence similarity to the AMPA/kainate receptors and contains four putative transmembrane segments following a large extracellular domain. The NMDA receptor messenger RNA is expressed in neuronal cells throughout the brain regions, particularly in the hippocampus, cerebral cortex and cerebellum.","lang":"eng"}],"external_id":{"pmid":["1834949"]},"page":"31 - 37","status":"public","volume":353,"title":"Molecular cloning and characterization of the rat NMDA receptor","day":"07","author":[{"full_name":"Moriyoshi, Koki","first_name":"Koki","last_name":"Moriyoshi"},{"last_name":"Masu","first_name":"Masayuki","full_name":"Masu, Masayuki"},{"first_name":"Takahiro","last_name":"Ishii","full_name":"Ishii, Takahiro"},{"last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444"},{"last_name":"Mizuno","first_name":"Noboru","full_name":"Mizuno, Noboru"},{"full_name":"Nakanishi, Shigetada","first_name":"Shigetada","last_name":"Nakanishi"}],"type":"journal_article","_id":"2483","article_processing_charge":"No","issue":"6348","publication":"Nature","oa_version":"None","date_created":"2018-12-11T11:57:56Z","publisher":"Nature Publishing Group","date_updated":"2022-03-03T15:25:04Z","publist_id":"4418","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","month":"11","date_published":"1991-11-07T00:00:00Z","article_type":"original","scopus_import":"1","main_file_link":[{"url":"https://www.nature.com/articles/354031a0"}]},{"month":"05","date_published":"1991-05-01T00:00:00Z","article_type":"original","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Springer","publist_id":"4370","date_updated":"2022-03-03T15:16:05Z","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF00229988"}],"scopus_import":"1","day":"01","volume":85,"title":"Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat","status":"public","oa_version":"None","date_created":"2018-12-11T11:58:12Z","_id":"2529","type":"journal_article","issue":"1","article_processing_charge":"No","publication":"Experimental Brain Research","author":[{"first_name":"Yukihiko","last_name":"Yasui","full_name":"Yasui, Yukihiko"},{"last_name":"Itoh","first_name":"Kazuo","full_name":"Itoh, Kazuo"},{"full_name":"Kaneko, Takeshi","first_name":"Takeshi","last_name":"Kaneko"},{"last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444"},{"first_name":"Noboru","last_name":"Mizuno","full_name":"Mizuno, Noboru"}],"abstract":[{"lang":"eng","text":"The distribution of cerebral cortical neurons sending projection fibers to the nucleus of the solitary tract (NST), and the topographical distribution of axon terminals of cortico-NST fibers within the NST were examined in the cat by two sets of experiments with horseradish peroxidase (HRP) and HRP conjugated with wheat germ agglutinin (WGA-HRP). First, HRP was injected into the NST. In the cerebral cortex of these cats, neuronal cell bodies were labeled retrogradely in the deep pyramidal cell layer (layer V): After HRP injection centered on the rostral or middle part of the NST, HRP-labeled neuronal cell bodies were distributed mainly in the orbital gyrus and caudal part of the intralimbic cortex, and additionally in the rostral part of the anterior sylvian gyrus. After HRP injection centered on the caudal part of the NST, labeled neuronal cell bodies were seen mainly in the caudoventral part of the intralimbic cortex, and additionally in the orbital gyrus, posterior sigmoid gyrus and rostral part of the anterior sylvian gyrus. The labeling in the intralimbic cortex, orbital gyrus and anterior sylvian gyrus was bilateral with a predominantly ipsilateral distribution, while that in the posterior sigmoid gyrus was bilateral with a clear-cut contralateral dominance. In the second set of experiments, WGA-HRP was injected into the cerebral cortical regions where neuronal cell bodies had been retrogradely labeled with HRP injected into the NST: after WGA-HRP injection into the orbital gyrus, presumed axon terminals in the NST were labeled in the rostral two thirds of the nucleus bilaterally with an ipsilateral predominance. After WGA-HRP injection into the rostral part of the anterior sylvian gyrus, a moderate number of presumed axon terminals were labeled throughout the whole rostrocaudal extent of the NST bilaterally with a slight ipsilateral dominance. After WGA-HRP injection into the middle and caudal parts of the anterior sylvian gyrus, no labeling was found in the NST. After WGA-HRP injection into the caudal part of the intralimbic cortex, presumed terminal labeling in the NST was seen throughout the whole rostrocaudal extent of the nucleus bilaterally with a dominant ipsilateral distribution. After WGA-HRP injection into the posterior sigmoid gyrus, however, no terminal labeling was found in the NST. The results indicate that cortico-NST fibers from the orbital gyrus terminate in the rostral two thirds of the NST, while those from the intralimbic cortex and the rostral part of the anterior sylvian gyrus project to the whole rostrocaudal extent of the NST."}],"page":"75 - 84","external_id":{"pmid":["1715827"]},"year":"1991","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0014-4819"],"eissn":["1432-1106"]},"pmid":1,"intvolume":"        85","citation":{"apa":"Yasui, Y., Itoh, K., Kaneko, T., Shigemoto, R., &#38; Mizuno, N. (1991). Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat. <i>Experimental Brain Research</i>. Springer. <a href=\"https://doi.org/10.1007/BF00229988\">https://doi.org/10.1007/BF00229988</a>","short":"Y. Yasui, K. Itoh, T. Kaneko, R. Shigemoto, N. Mizuno, Experimental Brain Research 85 (1991) 75–84.","chicago":"Yasui, Yukihiko, Kazuo Itoh, Takeshi Kaneko, Ryuichi Shigemoto, and Noboru Mizuno. “Topographical Projections from the Cerebral Cortex to the Nucleus of the Solitary Tract in the Cat.” <i>Experimental Brain Research</i>. Springer, 1991. <a href=\"https://doi.org/10.1007/BF00229988\">https://doi.org/10.1007/BF00229988</a>.","ista":"Yasui Y, Itoh K, Kaneko T, Shigemoto R, Mizuno N. 1991. Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat. Experimental Brain Research. 85(1), 75–84.","ieee":"Y. Yasui, K. Itoh, T. Kaneko, R. Shigemoto, and N. Mizuno, “Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat,” <i>Experimental Brain Research</i>, vol. 85, no. 1. Springer, pp. 75–84, 1991.","mla":"Yasui, Yukihiko, et al. “Topographical Projections from the Cerebral Cortex to the Nucleus of the Solitary Tract in the Cat.” <i>Experimental Brain Research</i>, vol. 85, no. 1, Springer, 1991, pp. 75–84, doi:<a href=\"https://doi.org/10.1007/BF00229988\">10.1007/BF00229988</a>.","ama":"Yasui Y, Itoh K, Kaneko T, Shigemoto R, Mizuno N. Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat. <i>Experimental Brain Research</i>. 1991;85(1):75-84. doi:<a href=\"https://doi.org/10.1007/BF00229988\">10.1007/BF00229988</a>"},"doi":"10.1007/BF00229988","quality_controlled":"1","extern":"1"},{"publication_identifier":{"isbn":["978-0-12-571148-7"]},"language":[{"iso":"eng"}],"year":"1991","pmid":1,"intvolume":"        46","extern":"1","doi":"10.1016/b978-0-12-571146-3.50007-9","citation":{"ama":"Nakanishi S, Ohkubo H, Kakizuka A, et al. Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel. In: <i>Recent Progress in Hormone Research</i>. Vol 46. The Endocrine Society; 1991:59-83. doi:<a href=\"https://doi.org/10.1016/b978-0-12-571146-3.50007-9\">10.1016/b978-0-12-571146-3.50007-9</a>","ista":"Nakanishi S, Ohkubo H, Kakizuka A, Yokota Y, Shigemoto R, Sasai Y, Takumi T. 1991.Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel. In: Recent Progress in Hormone Research. vol. 46, 59–83.","ieee":"S. Nakanishi <i>et al.</i>, “Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel,” in <i>Recent Progress in Hormone Research</i>, vol. 46, The Endocrine Society, 1991, pp. 59–83.","mla":"Nakanishi, Shigetada, et al. “Molecular Characterization of Mammalian Tachykinin Receptors and a Possible Epithelial Potassium Channel.” <i>Recent Progress in Hormone Research</i>, vol. 46, The Endocrine Society, 1991, pp. 59–83, doi:<a href=\"https://doi.org/10.1016/b978-0-12-571146-3.50007-9\">10.1016/b978-0-12-571146-3.50007-9</a>.","apa":"Nakanishi, S., Ohkubo, H., Kakizuka, A., Yokota, Y., Shigemoto, R., Sasai, Y., &#38; Takumi, T. (1991). Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel. In <i>Recent Progress in Hormone Research</i> (Vol. 46, pp. 59–83). The Endocrine Society. <a href=\"https://doi.org/10.1016/b978-0-12-571146-3.50007-9\">https://doi.org/10.1016/b978-0-12-571146-3.50007-9</a>","short":"S. Nakanishi, H. Ohkubo, A. Kakizuka, Y. Yokota, R. Shigemoto, Y. Sasai, T. Takumi, in:, Recent Progress in Hormone Research, The Endocrine Society, 1991, pp. 59–83.","chicago":"Nakanishi, Shigetada, Hiroaki Ohkubo, Akira Kakizuka, Yoshifumi Yokota, Ryuichi Shigemoto, Yoshiki Sasai, and Toru Takumi. “Molecular Characterization of Mammalian Tachykinin Receptors and a Possible Epithelial Potassium Channel.” In <i>Recent Progress in Hormone Research</i>, 46:59–83. The Endocrine Society, 1991. <a href=\"https://doi.org/10.1016/b978-0-12-571146-3.50007-9\">https://doi.org/10.1016/b978-0-12-571146-3.50007-9</a>."},"quality_controlled":"1","external_id":{"pmid":["2177908 "]},"page":"59 - 83","day":"01","status":"public","volume":46,"title":"Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel","_id":"2530","type":"book_chapter","article_processing_charge":"No","publication":"Recent Progress in Hormone Research","date_created":"2018-12-11T11:58:13Z","oa_version":"None","author":[{"full_name":"Nakanishi, Shigetada","first_name":"Shigetada","last_name":"Nakanishi"},{"first_name":"Hiroaki","last_name":"Ohkubo","full_name":"Ohkubo, Hiroaki"},{"last_name":"Kakizuka","first_name":"Akira","full_name":"Kakizuka, Akira"},{"full_name":"Yokota, Yoshifumi","first_name":"Yoshifumi","last_name":"Yokota"},{"orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"last_name":"Sasai","first_name":"Yoshiki","full_name":"Sasai, Yoshiki"},{"first_name":"Toru","last_name":"Takumi","full_name":"Takumi, Toru"}],"month":"01","date_published":"1991-01-01T00:00:00Z","publisher":"The Endocrine Society","date_updated":"2022-03-03T14:59:24Z","publist_id":"4369","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/B9780125711463500079"}],"scopus_import":"1"},{"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-02-23T16:10:03Z","publist_id":"2920","publisher":"Wiley-Blackwell","article_type":"original","date_published":"1990-01-01T00:00:00Z","month":"01","scopus_import":"1","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1190055/","open_access":"1"}],"volume":420,"title":"A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments","status":"public","day":"01","author":[{"last_name":"Bräu","first_name":"Michael","full_name":"Bräu, Michael"},{"full_name":"Dreyer, Florian","first_name":"Florian","last_name":"Dreyer"},{"last_name":"Jonas","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804"},{"full_name":"Repp, Holger","first_name":"Holger","last_name":"Repp"},{"last_name":"Vogel","first_name":"Werner","full_name":"Vogel, Werner"}],"date_created":"2018-12-11T12:03:29Z","oa_version":"None","publication":"Journal of Physiology","type":"journal_article","_id":"3467","article_processing_charge":"No","abstract":[{"text":"The effects of mast cell degranulating peptide (MCDP), a toxin from the honey bee, and of dendrotoxin (DTX), a toxin from the green mamba snake, were studied in voltage-clamped experiments with myelinated nerve fibres of Xenopus. MCDP and DTX blocked part of the K+ current. About 20% of the K+ current, however, was resistant to the toxins even in high concentrations. In Ringer solution half-maximal block was reached with concentrations of 33 nM MCDP and 11 nM DTX. In high-K+ solution the potency of both toxins was lower. β-Bungarotoxin (β-BuTX), another snake toxin, also blocked part of the K+ current, but was less potent than MCDP and DTX. Tail currents in high-K+ solution were analysed and three K+ current components were separated according to Dubois (1981b). Both MCDP and DTX selectively blocked a fast deactivating, slowly inactivating K+ current component which steeply activates between E = -60 mV and E = -40 mV (component f1). In concentrations around 100 nM, MCDP and DTX blocked neither the slow K+ current (component s) nor the fast deactivating, rapidly inactivating K+ current which activates between E = -40 mV and E = 20 mV (component f2). Similar results could be derived from K+ outward currents in Ringer solution. In high-K+, IC50 of MCDP for component f1 was 99 nM, whereas it was 7.6 μM for f2. Corresponding values for DTX are 68 nM and 1.8 μM. Binding studies with nerve fibre membranes of Xenopus reveal high-affinity binding sites for 125I-labelled DTX )K(D) = 22 pM in Ringer solution and 81 pM in high-K+ solution). 125I-labelled DTX can be displaced from its sites completely by unlabelled DTX, toxin I (black mamba toxin), MCDP, and partially by β-BuTX. Immunocytochemical staining demonstrates that binding sites for DTX are present in nodal and paranodal regions of the axonal membrane. The axonal membrane of motor and sensory nerve fibres is equipped with three types of well-characterized K+ channels and constitutes so far the best preparation to study MCDP- and DTX-sensitive K+ channels with electrophysiological and biochemical methods.","lang":"eng"}],"oa":1,"page":"365 - 385","external_id":{"pmid":["2324990"]},"intvolume":"       420","pmid":1,"year":"1990","publication_identifier":{"issn":["0022-3751"],"eissn":["1469-7793"]},"language":[{"iso":"eng"}],"acknowledgement":"We thank Professor E. Habermann for critical reading of the manuscript and E. Schmidt and J. Schafer for technical assistance. Financial support by the Deutsche Forschungsgemeinschaft (Vo 188/13-1 and SFB 249) is gratefully acknowledged.\r\n","quality_controlled":"1","doi":"10.1113/jphysiol.1990.sp017918","citation":{"apa":"Bräu, M., Dreyer, F., Jonas, P. M., Repp, H., &#38; Vogel, W. (1990). A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. <i>Journal of Physiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1113/jphysiol.1990.sp017918\">https://doi.org/10.1113/jphysiol.1990.sp017918</a>","short":"M. Bräu, F. Dreyer, P.M. Jonas, H. Repp, W. Vogel, Journal of Physiology 420 (1990) 365–385.","chicago":"Bräu, Michael, Florian Dreyer, Peter M Jonas, Holger Repp, and Werner Vogel. “A K+ Channel in Xenopus Nerve Fibres Selectively Blocked by Bee and Snake Toxins: Binding and Voltage-Clamp Experiments.” <i>Journal of Physiology</i>. Wiley-Blackwell, 1990. <a href=\"https://doi.org/10.1113/jphysiol.1990.sp017918\">https://doi.org/10.1113/jphysiol.1990.sp017918</a>.","ieee":"M. Bräu, F. Dreyer, P. M. Jonas, H. Repp, and W. Vogel, “A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments,” <i>Journal of Physiology</i>, vol. 420. Wiley-Blackwell, pp. 365–385, 1990.","ista":"Bräu M, Dreyer F, Jonas PM, Repp H, Vogel W. 1990. A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. Journal of Physiology. 420, 365–385.","mla":"Bräu, Michael, et al. “A K+ Channel in Xenopus Nerve Fibres Selectively Blocked by Bee and Snake Toxins: Binding and Voltage-Clamp Experiments.” <i>Journal of Physiology</i>, vol. 420, Wiley-Blackwell, 1990, pp. 365–85, doi:<a href=\"https://doi.org/10.1113/jphysiol.1990.sp017918\">10.1113/jphysiol.1990.sp017918</a>.","ama":"Bräu M, Dreyer F, Jonas PM, Repp H, Vogel W. A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. <i>Journal of Physiology</i>. 1990;420:365-385. doi:<a href=\"https://doi.org/10.1113/jphysiol.1990.sp017918\">10.1113/jphysiol.1990.sp017918</a>"},"extern":"1"},{"month":"01","date_published":"1990-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"We investigate the complexity of determining the shape and presentation (i.e. position with orientation) of convex polytopes in multi-dimensional Euclidean space using a variety of probe models."}],"date_updated":"2022-02-23T15:41:07Z","publist_id":"2820","publisher":"Springer","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","editor":[{"full_name":"Cox, Ingemar","first_name":"Ingemar","last_name":"Cox"},{"last_name":"Wilfong","first_name":"Gordon","full_name":"Wilfong, Gordon"}],"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-1-4613-8997-2_25"}],"page":"328 - 341","publication_identifier":{"isbn":["978-1-4613-8997-2"]},"language":[{"iso":"eng"}],"year":"1990","day":"01","status":"public","title":"Probing convex polytopes","publication":"Autonomous Robot Vehicles","extern":"1","type":"book_chapter","_id":"3565","article_processing_charge":"No","date_created":"2018-12-11T12:03:59Z","oa_version":"None","quality_controlled":"1","doi":"10.1007/978-1-4613-8997-2_25","citation":{"ama":"Dobkin D, Edelsbrunner H, Yap C. Probing convex polytopes. In: Cox I, Wilfong G, eds. <i>Autonomous Robot Vehicles</i>. Springer; 1990:328-341. doi:<a href=\"https://doi.org/10.1007/978-1-4613-8997-2_25\">10.1007/978-1-4613-8997-2_25</a>","chicago":"Dobkin, David, Herbert Edelsbrunner, and Chee Yap. “Probing Convex Polytopes.” In <i>Autonomous Robot Vehicles</i>, edited by Ingemar Cox and Gordon Wilfong, 328–41. Springer, 1990. <a href=\"https://doi.org/10.1007/978-1-4613-8997-2_25\">https://doi.org/10.1007/978-1-4613-8997-2_25</a>.","short":"D. Dobkin, H. Edelsbrunner, C. Yap, in:, I. Cox, G. Wilfong (Eds.), Autonomous Robot Vehicles, Springer, 1990, pp. 328–341.","apa":"Dobkin, D., Edelsbrunner, H., &#38; Yap, C. (1990). Probing convex polytopes. In I. Cox &#38; G. Wilfong (Eds.), <i>Autonomous Robot Vehicles</i> (pp. 328–341). Springer. <a href=\"https://doi.org/10.1007/978-1-4613-8997-2_25\">https://doi.org/10.1007/978-1-4613-8997-2_25</a>","mla":"Dobkin, David, et al. “Probing Convex Polytopes.” <i>Autonomous Robot Vehicles</i>, edited by Ingemar Cox and Gordon Wilfong, Springer, 1990, pp. 328–41, doi:<a href=\"https://doi.org/10.1007/978-1-4613-8997-2_25\">10.1007/978-1-4613-8997-2_25</a>.","ieee":"D. Dobkin, H. Edelsbrunner, and C. Yap, “Probing convex polytopes,” in <i>Autonomous Robot Vehicles</i>, I. Cox and G. Wilfong, Eds. Springer, 1990, pp. 328–341.","ista":"Dobkin D, Edelsbrunner H, Yap C. 1990.Probing convex polytopes. In: Autonomous Robot Vehicles. , 328–341."},"acknowledgement":"NSF Grant MCS-83-03926 and DCR-85-05517\r\nAmoco Foundation Faculty Development in Computer Science\r\nNSF Grant DCR-84-01633 and DCR-84-01898","author":[{"full_name":"Dobkin, David","first_name":"David","last_name":"Dobkin"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"first_name":"Chee","last_name":"Yap","full_name":"Yap, Chee"}]},{"acknowledgement":"We thank R. Burger, J. A. Coyne, W. G. Hill, A. A. Hoffmann, J. H. Gillespie, M. Slatkin, T. Nagylaki and Z.-B. Zeng for helpful discussions and comments on earlier drafts. Our research is supported by grants from the National Science Foundation (BSR-8866548), the Science and Engineering Research Council, and the Institute of Theoretical Dynamics at UCD. ","citation":{"ama":"Turelli M, Barton NH. Dynamics of polygenic characters under selection. <i>Theoretical Population Biology</i>. 1990;38(1):1-57. doi:<a href=\"https://doi.org/10.1016/0040-5809(90)90002-D\">10.1016/0040-5809(90)90002-D</a>","mla":"Turelli, Michael, and Nicholas H. Barton. “Dynamics of Polygenic Characters under Selection.” <i>Theoretical Population Biology</i>, vol. 38, no. 1, Academic Press, 1990, pp. 1–57, doi:<a href=\"https://doi.org/10.1016/0040-5809(90)90002-D\">10.1016/0040-5809(90)90002-D</a>.","ista":"Turelli M, Barton NH. 1990. Dynamics of polygenic characters under selection. Theoretical Population Biology. 38(1), 1–57.","ieee":"M. Turelli and N. H. Barton, “Dynamics of polygenic characters under selection,” <i>Theoretical Population Biology</i>, vol. 38, no. 1. Academic Press, pp. 1–57, 1990.","short":"M. Turelli, N.H. Barton, Theoretical Population Biology 38 (1990) 1–57.","chicago":"Turelli, Michael, and Nicholas H Barton. “Dynamics of Polygenic Characters under Selection.” <i>Theoretical Population Biology</i>. Academic Press, 1990. <a href=\"https://doi.org/10.1016/0040-5809(90)90002-D\">https://doi.org/10.1016/0040-5809(90)90002-D</a>.","apa":"Turelli, M., &#38; Barton, N. H. (1990). Dynamics of polygenic characters under selection. <i>Theoretical Population Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/0040-5809(90)90002-D\">https://doi.org/10.1016/0040-5809(90)90002-D</a>"},"doi":"10.1016/0040-5809(90)90002-D","quality_controlled":"1","extern":"1","intvolume":"        38","year":"1990","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0040-5809"]},"page":"1 - 57","abstract":[{"lang":"eng","text":"Selection on polygenic characters is generally analyzed by statistical methods that assume a Gaussian (normal) distribution of breeding values. We present an alternative analysis based on multilocus population genetics. We use a general representation of selection, recombination, and drift to analyze an idealized polygenic system in which all genetic effects are additive (i.e., both dominance and epistasis are absent), but no assumptions are made about the distribution of breeding values or the numbers of loci or alleles. Our analysis produces three results. First, our equations reproduce the standard recursions for the mean and additive variance if breeding values are Gaussian; but they also reveal how non-Gaussian distributions of breeding values will alter these dynamics. Second, an approximation valid for weak selection shows that even if genetic variance is attributable to an effectively infinite number of loci with only additive effects, selection will generally drive the distribution of breeding values away from a Gaussian distribution by creating multilocus linkage disequilibria. Long-term dynamics of means can depart substantially from the predictions of the standard selection recursions, but the discrepancy may often be negligible for short-term selection. Third, by including mutation, we show that, for realistic parameter values, linkage disequilibrium has little effect on the amount of additive variance maintained at an equilibrium between stabilizing selection and mutation. Each of these analytical results is supported by numerical calculations."}],"author":[{"last_name":"Turelli","first_name":"Michael","full_name":"Turelli, Michael"},{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton"}],"oa_version":"None","date_created":"2018-12-11T12:04:26Z","_id":"3649","issue":"1","type":"journal_article","article_processing_charge":"No","publication":"Theoretical Population Biology","title":"Dynamics of polygenic characters under selection","volume":38,"status":"public","day":"01","scopus_import":"1","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/004058099090002D?via%3Dihub"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Academic Press","publist_id":"2734","date_updated":"2022-02-23T14:48:49Z","date_published":"1990-01-01T00:00:00Z","month":"01","article_type":"original"},{"article_type":"original","date_published":"1990-04-01T00:00:00Z","month":"04","publist_id":"2733","date_updated":"2022-02-23T11:04:17Z","publisher":"Genetics Society of America","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1203983/","open_access":"1"}],"scopus_import":"1","day":"01","status":"public","volume":124,"title":"Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones","publication":"Genetics","issue":"4","_id":"3650","type":"journal_article","article_processing_charge":"No","date_created":"2018-12-11T12:04:26Z","oa_version":"Published Version","author":[{"full_name":"Mallet, James","first_name":"James","last_name":"Mallet"},{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton"},{"full_name":"Lamas, Gerado","last_name":"Lamas","first_name":"Gerado"},{"full_name":"Santisteban, José","first_name":"José","last_name":"Santisteban"},{"last_name":"Muedas","first_name":"Manuel","full_name":"Muedas, Manuel"},{"last_name":"Eeley","first_name":"Harriet","full_name":"Eeley, Harriet"}],"abstract":[{"text":"Hybrid zones can yield estimates of natural selection and gene flow. The width of a cline in gene frequency is approximately proportional to gene flow (σ) divided by the square root of per-locus selection ( &amp;s). Gene flow also causes gametic correlations (linkage disequilibria) between genes that differ across hybrid zones. Correlations are stronger when the hybrid zone is narrow, and rise to a maximum roughly equal to s. Thus cline width and gametic correlations combine to give estimates of gene flow and selection. These indirect measures of σ and s are especially useful because they can be made from collections, and require no field experiments. The method was applied to hybrid zones between color pattern races in a pair of Peruvian Heliconius butterfly species. The species are Mullerian mimics of one another, and both show the same changes in warning color pattern across their respective hybrid zones. The expectations of cline width and gametic correlation were generated using simulations of clines stabilized by strong frequency-dependent selection. In the hybrid zone in Heliconius erato, clines at three major color pattern loci were between 8.5 and 10.2 km wide, and the pairwise gametic correlations peaked at R &amp; 0.35. These measures suggest that s &amp; 0.23 per locus, and that σ &amp; 2.6 km. In erato, the shapes of the clines agreed with that expected on the basis of dominance. Heliconius melpomene has a nearly coincident hybrid zone. In this species, cline widths at four major color pattern loci varied between 11.7 and 13.4 km. Pairwise gametic correlations peaked near R &amp; 1.00 for tightly linked genes, and at R &amp; 0.40 for unlinked genes, giving s &amp; 0.25 per locus and σ &amp; 3.7 km. In melpomene, cline shapes did not perfectly fit theoretical shapes based on dominance; this deviation might be explained by long-distance migration and/or strong epistasis. Compared with erato, sample sizes in melpomene are lower and the genetics of its color patterns are less well understood. In spite of these problems, selection and gene flow are clearly of the same order of magnitude in the two species. The relatively high per locus selection coefficients agree with ``major gene'' theories for the evolution of Mullerian mimicry, but the genetic architecture of the color patterns does not. These results show that the genetics and evolution of mimicry are still only sketchily understood.","lang":"eng"}],"oa":1,"external_id":{"pmid":["2323556"]},"page":"921 - 936","publication_identifier":{"issn":["0016-6731"]},"language":[{"iso":"eng"}],"year":"1990","intvolume":"       124","pmid":1,"extern":"1","quality_controlled":"1","doi":"10.1093/genetics/124.4.921","citation":{"ama":"Mallet J, Barton NH, Lamas G, Santisteban J, Muedas M, Eeley H. Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones. <i>Genetics</i>. 1990;124(4):921-936. doi:<a href=\"https://doi.org/10.1093/genetics/124.4.921\">10.1093/genetics/124.4.921</a>","apa":"Mallet, J., Barton, N. H., Lamas, G., Santisteban, J., Muedas, M., &#38; Eeley, H. (1990). Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1093/genetics/124.4.921\">https://doi.org/10.1093/genetics/124.4.921</a>","chicago":"Mallet, James, Nicholas H Barton, Gerado Lamas, José Santisteban, Manuel Muedas, and Harriet Eeley. “Estimates of Selection and Gene Flow from Measures of Cline Width and Linkage Disequilibrium in Heliconius Hybrid Zones.” <i>Genetics</i>. Genetics Society of America, 1990. <a href=\"https://doi.org/10.1093/genetics/124.4.921\">https://doi.org/10.1093/genetics/124.4.921</a>.","short":"J. Mallet, N.H. Barton, G. Lamas, J. Santisteban, M. Muedas, H. Eeley, Genetics 124 (1990) 921–936.","ista":"Mallet J, Barton NH, Lamas G, Santisteban J, Muedas M, Eeley H. 1990. Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones. Genetics. 124(4), 921–936.","ieee":"J. Mallet, N. H. Barton, G. Lamas, J. Santisteban, M. Muedas, and H. Eeley, “Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones,” <i>Genetics</i>, vol. 124, no. 4. Genetics Society of America, pp. 921–936, 1990.","mla":"Mallet, James, et al. “Estimates of Selection and Gene Flow from Measures of Cline Width and Linkage Disequilibrium in Heliconius Hybrid Zones.” <i>Genetics</i>, vol. 124, no. 4, Genetics Society of America, 1990, pp. 921–36, doi:<a href=\"https://doi.org/10.1093/genetics/124.4.921\">10.1093/genetics/124.4.921</a>."},"acknowledgement":"We thank the Natural Environmental Research Council, the Royal Society, the Nuffield Foundation, CONCYTEC, and Mrs. G. W. BORLASE for financial support, and the people of San Martin for their generous hospitality. We are very grateful to S. D. KNAPP, who helped by maintaining our sanity and rearing larvae. We are also grateful to an anonymous reviewer, A. W. PORTER, J. C. SCHNEIDER, M. TURELLI and C. E. WATSON for helpful comments on the manuscript. This paper was approved for publication as journal article no. 5-7255 of the Mississippi Agricultural and Forestry Experiment Station, Mississippi State University, project no. MIS-2 122. "},{"citation":{"mla":"Barton, Nicholas H. “Pleiotropic Models of Quantitative Variation.” <i>Genetics</i>, vol. 124, no. 3, Genetics Society of America, 1990, pp. 773–82, doi:<a href=\"https://doi.org/10.1093/genetics/124.3.773 \">10.1093/genetics/124.3.773 </a>.","ieee":"N. H. Barton, “Pleiotropic models of quantitative variation,” <i>Genetics</i>, vol. 124, no. 3. Genetics Society of America, pp. 773–782, 1990.","ista":"Barton NH. 1990. Pleiotropic models of quantitative variation. Genetics. 124(3), 773–782.","short":"N.H. Barton, Genetics 124 (1990) 773–782.","chicago":"Barton, Nicholas H. “Pleiotropic Models of Quantitative Variation.” <i>Genetics</i>. Genetics Society of America, 1990. <a href=\"https://doi.org/10.1093/genetics/124.3.773 \">https://doi.org/10.1093/genetics/124.3.773 </a>.","apa":"Barton, N. H. (1990). Pleiotropic models of quantitative variation. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1093/genetics/124.3.773 \">https://doi.org/10.1093/genetics/124.3.773 </a>","ama":"Barton NH. Pleiotropic models of quantitative variation. <i>Genetics</i>. 1990;124(3):773-782. doi:<a href=\"https://doi.org/10.1093/genetics/124.3.773 \">10.1093/genetics/124.3.773 </a>"},"doi":"10.1093/genetics/124.3.773 ","quality_controlled":"1","extern":"1","acknowledgement":"Thanks to JERRY COYNE, BILL HILL, LINDA PARTRIDGE, MICHAEL TURELLI, and two anonymous reviewers for their critical comments. This work was supported by grants from the National Science Foundation (BSR-8866548) the Science and Engineering Research Council (GR/E/08507), and by the Institute of Theoretical Dynamics, University of California, Davis.","year":"1990","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0016-6731"]},"pmid":1,"intvolume":"       124","page":"773 - 782","external_id":{"pmid":["2311921"]},"oa":1,"abstract":[{"lang":"eng","text":"It is widely held that each gene typically affects many characters, and that each character is affected by many genes. Moreover, strong stabilizing selection cannot act on an indefinitely large number of independent traits. This makes it likely that heritable variation in any one trait is maintained as a side effect of polymorphisms which have nothing to do with selection on that trait. This paper examines the idea that variation is maintained as the pleiotropic side effect of either deleterious mutation, or balancing selection. If mutation is responsible, it must produce alleles which are only mildly deleterious (s &amp; 10(-3)), but nevertheless have significant effects on the trait. Balancing selection can readily maintain high heritabilities; however, selection must be spread over many weakly selected polymorphisms if large responses to artificial selection are to be possible. In both classes of pleiotropic model, extreme phenotypes are less fit, giving the appearance of stabilizing selection on the trait. However, it is shown that this effect is weak (of the same order as the selection on each gene): the strong stabilizing selection which is often observed is likely to be caused by correlations with a limited number of directly selected traits. Possible experiments for distinguishing the alternatives are discussed."}],"oa_version":"Published Version","date_created":"2018-12-11T12:04:26Z","_id":"3651","type":"journal_article","issue":"3","article_processing_charge":"No","publication":"Genetics","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"}],"day":"01","title":"Pleiotropic models of quantitative variation","volume":124,"status":"public","main_file_link":[{"url":"https://academic.oup.com/genetics/article/124/3/773/5999956?login=true","open_access":"1"}],"scopus_import":"1","month":"03","date_published":"1990-03-01T00:00:00Z","article_type":"original","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Genetics Society of America","publist_id":"2732","date_updated":"2022-02-23T10:41:43Z"}]