[{"intvolume":"         5","title":"The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2","date_created":"2018-12-11T12:06:45Z","article_processing_charge":"No","publication_status":"published","issue":"1","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Sharir","first_name":"Micha","full_name":"Sharir, Micha"}],"_id":"4068","article_type":"original","publisher":"Springer","quality_controlled":"1","page":"35 - 42","abstract":[{"text":"LetS be a collection ofn convex, closed, and pairwise nonintersecting sets in the Euclidean plane labeled from 1 ton. A pair of permutations\r\n(i1i2in−1in)(inin−1i2i1) \r\nis called ageometric permutation of S if there is a line that intersects all sets ofS in this order. We prove thatS can realize at most 2n–2 geometric permutations. This upper bound is tight.","lang":"eng"}],"day":"01","doi":"10.1007/BF02187778","year":"1990","citation":{"apa":"Edelsbrunner, H., &#38; Sharir, M. (1990). The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187778\">https://doi.org/10.1007/BF02187778</a>","ama":"Edelsbrunner H, Sharir M. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. <i>Discrete &#38; Computational Geometry</i>. 1990;5(1):35-42. doi:<a href=\"https://doi.org/10.1007/BF02187778\">10.1007/BF02187778</a>","ieee":"H. Edelsbrunner and M. Sharir, “The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2,” <i>Discrete &#38; Computational Geometry</i>, vol. 5, no. 1. Springer, pp. 35–42, 1990.","chicago":"Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1990. <a href=\"https://doi.org/10.1007/BF02187778\">https://doi.org/10.1007/BF02187778</a>.","short":"H. Edelsbrunner, M. Sharir, Discrete &#38; Computational Geometry 5 (1990) 35–42.","mla":"Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” <i>Discrete &#38; Computational Geometry</i>, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi:<a href=\"https://doi.org/10.1007/BF02187778\">10.1007/BF02187778</a>.","ista":"Edelsbrunner H, Sharir M. 1990. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete &#38; Computational Geometry. 5(1), 35–42."},"date_updated":"2022-02-22T14:50:34Z","extern":"1","volume":5,"acknowledgement":"Research of the first author was supported by Amoco Foundation for Faculty Development in Computer Science Grant No. 1-6-44862. Work on this paper by the second author was supported by Office of Naval Research Grant No. N00014-82-K-0381, National Science Foundation Grant No. NSF-DCR-83-20085, and by grants from the Digital Equipment Corporation and the IBM Corporation.","month":"01","oa_version":"None","publication":"Discrete & Computational Geometry","language":[{"iso":"eng"}],"publist_id":"2057","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"type":"journal_article","date_published":"1990-01-01T00:00:00Z","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187778"}]},{"volume":10,"acknowledgement":"Research reported in this paper was supported by the National Science Foundation under grant CCR-8714565.","extern":"1","day":"01","doi":"10.1007/BF02122779","abstract":[{"text":"Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry.","lang":"eng"}],"year":"1990","citation":{"apa":"Edelsbrunner, H. (1990). An acyclicity theorem for cell complexes in d dimension. <i>Combinatorica</i>. Springer. <a href=\"https://doi.org/10.1007/BF02122779\">https://doi.org/10.1007/BF02122779</a>","ama":"Edelsbrunner H. An acyclicity theorem for cell complexes in d dimension. <i>Combinatorica</i>. 1990;10(3):251-260. doi:<a href=\"https://doi.org/10.1007/BF02122779\">10.1007/BF02122779</a>","chicago":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” <i>Combinatorica</i>. Springer, 1990. <a href=\"https://doi.org/10.1007/BF02122779\">https://doi.org/10.1007/BF02122779</a>.","ieee":"H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” <i>Combinatorica</i>, vol. 10, no. 3. Springer, pp. 251–260, 1990.","mla":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” <i>Combinatorica</i>, vol. 10, no. 3, Springer, 1990, pp. 251–60, doi:<a href=\"https://doi.org/10.1007/BF02122779\">10.1007/BF02122779</a>.","short":"H. Edelsbrunner, Combinatorica 10 (1990) 251–260.","ista":"Edelsbrunner H. 1990. An acyclicity theorem for cell complexes in d dimension. Combinatorica. 10(3), 251–260."},"date_updated":"2022-02-21T11:08:30Z","publisher":"Springer","article_type":"original","quality_controlled":"1","page":"251 - 260","date_created":"2018-12-11T12:06:45Z","article_processing_charge":"No","publication_status":"published","intvolume":"        10","title":"An acyclicity theorem for cell complexes in d dimension","scopus_import":"1","_id":"4069","issue":"3","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"}],"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02122779"}],"status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"eissn":["1439-6912"],"issn":["0209-9683"]},"publist_id":"2050","type":"journal_article","date_published":"1990-09-01T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"None","month":"09","publication":"Combinatorica"},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","main_file_link":[{"url":"https://www.tandfonline.com/doi/abs/10.1080/00207169008803871"}],"publist_id":"2051","publication_identifier":{"eissn":["1029-0265"],"issn":["0020-7160"]},"date_published":"1990-01-01T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"month":"01","oa_version":"None","publication":"International Journal of Computer Mathematics","extern":"1","volume":34,"abstract":[{"text":"Let S be a set of n closed intervals on the x-axis. A ranking assigns to each interval, s, a distinct rank, p(s)∊ [1, 2,…,n]. We say that s can see t if p(s)<p(t) and there is a point p∊s∩t so that p∉u for all u with p(s)<p(u)<p(t). It is shown that a ranking can be found in time O(n log n) such that each interval sees at most three other intervals. It is also shown that a ranking that minimizes the average number of endpoints visible from an interval can be computed in time O(n 5/2). The results have applications to intersection problems for intervals, as well as to channel routing problems which arise in layouts of VLSI circuits.","lang":"eng"}],"doi":"10.1080/00207169008803871","day":"01","date_updated":"2022-02-21T13:19:52Z","citation":{"ama":"Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. Ranking intervals under visibility constraints. <i>International Journal of Computer Mathematics</i>. 1990;34(3-4):129-144. doi:<a href=\"https://doi.org/10.1080/00207169008803871\">10.1080/00207169008803871</a>","apa":"Edelsbrunner, H., Overmars, M., Welzl, E., Hartman, I., &#38; Feldman, J. (1990). Ranking intervals under visibility constraints. <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00207169008803871\">https://doi.org/10.1080/00207169008803871</a>","chicago":"Edelsbrunner, Herbert, Mark Overmars, Emo Welzl, Irith Hartman, and Jack Feldman. “Ranking Intervals under Visibility Constraints.” <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis, 1990. <a href=\"https://doi.org/10.1080/00207169008803871\">https://doi.org/10.1080/00207169008803871</a>.","ieee":"H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, and J. Feldman, “Ranking intervals under visibility constraints,” <i>International Journal of Computer Mathematics</i>, vol. 34, no. 3–4. Taylor &#38; Francis, pp. 129–144, 1990.","mla":"Edelsbrunner, Herbert, et al. “Ranking Intervals under Visibility Constraints.” <i>International Journal of Computer Mathematics</i>, vol. 34, no. 3–4, Taylor &#38; Francis, 1990, pp. 129–44, doi:<a href=\"https://doi.org/10.1080/00207169008803871\">10.1080/00207169008803871</a>.","short":"H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, J. Feldman, International Journal of Computer Mathematics 34 (1990) 129–144.","ista":"Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. 1990. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 34(3–4), 129–144."},"year":"1990","publisher":"Taylor & Francis","page":"129 - 144","quality_controlled":"1","title":"Ranking intervals under visibility constraints","intvolume":"        34","publication_status":"published","date_created":"2018-12-11T12:06:46Z","article_processing_charge":"No","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"last_name":"Overmars","first_name":"Mark","full_name":"Overmars, Mark"},{"first_name":"Emo","last_name":"Welzl","full_name":"Welzl, Emo"},{"last_name":"Hartman","first_name":"Irith","full_name":"Hartman, Irith"},{"full_name":"Feldman, Jack","last_name":"Feldman","first_name":"Jack"}],"issue":"3-4","_id":"4070","scopus_import":"1"},{"publication":"Proceedings of the 6th annual symposium on Computational geometry","_id":"4071","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tan, Tiow","last_name":"Tan","first_name":"Tiow"},{"last_name":"Waupotitsch","first_name":"Roman","full_name":"Waupotitsch, Roman"}],"oa_version":"None","publication_status":"published","article_processing_charge":"No","date_created":"2018-12-11T12:06:46Z","month":"01","title":"An O(n^2log n) time algorithm for the MinMax angle triangulation","page":"44 - 52","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"ACM","conference":{"start_date":"1990-06-07","name":"SCG: Symposium on Computational Geometry","location":"Berkley, CA, United States","end_date":"1990-06-09"},"date_updated":"2022-02-22T08:56:42Z","citation":{"ista":"Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm for the MinMax angle triangulation. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 44–52.","mla":"Edelsbrunner, Herbert, et al. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.” <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>, ACM, 1990, pp. 44–52, doi:<a href=\"https://doi.org/10.1145/98524.98535\">10.1145/98524.98535</a>.","short":"H. Edelsbrunner, T. Tan, R. Waupotitsch, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52.","chicago":"Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.” In <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>, 44–52. ACM, 1990. <a href=\"https://doi.org/10.1145/98524.98535\">https://doi.org/10.1145/98524.98535</a>.","ieee":"H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2log n) time algorithm for the MinMax angle triangulation,” in <i>Proceedings of the 6th annual symposium on Computational geometry</i>, Berkley, CA, United States, 1990, pp. 44–52.","apa":"Edelsbrunner, H., Tan, T., &#38; Waupotitsch, R. (1990). An O(n^2log n) time algorithm for the MinMax angle triangulation. In <i>Proceedings of the 6th annual symposium on Computational geometry</i> (pp. 44–52). Berkley, CA, United States: ACM. <a href=\"https://doi.org/10.1145/98524.98535\">https://doi.org/10.1145/98524.98535</a>","ama":"Edelsbrunner H, Tan T, Waupotitsch R. An O(n^2log n) time algorithm for the MinMax angle triangulation. In: <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>. ACM; 1990:44-52. doi:<a href=\"https://doi.org/10.1145/98524.98535\">10.1145/98524.98535</a>"},"year":"1990","date_published":"1990-01-01T00:00:00Z","type":"conference","doi":"10.1145/98524.98535","publication_identifier":{"isbn":["978-0-89791-362-1"]},"day":"01","abstract":[{"lang":"eng","text":"We show that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). In the same amount of time and space we can also handle the constrained case where edges are prescribed. The algorithm iteratively improves an arbitrary initial triangulation and is fairly easy to implement."}],"publist_id":"2052","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/98524.98535"}],"extern":"1","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"volume":5,"acknowledgement":"The first author is pleased to acknowledge partial support by the Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and the National Science Foundation under Grant CCR-8714565. Work on this paper by the third author has been supported by Office of Naval Research Grant N00014-82-K-0381, by National Science Foundation Grant DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD-the Israeli National Council for Research and Development. A preliminary version of this paper has appeared in theProceedings of the 4th ACM Symposium on Computational Geometry, 1988, pp. 44–55.","extern":"1","date_updated":"2022-02-22T09:27:30Z","citation":{"ama":"Edelsbrunner H, Guibas L, Sharir M. The complexity and construction of many faces in arrangements of lines and of segments. <i>Discrete &#38; Computational Geometry</i>. 1990;5(1):161-196. doi:<a href=\"https://doi.org/10.1007/BF02187784\">10.1007/BF02187784</a>","apa":"Edelsbrunner, H., Guibas, L., &#38; Sharir, M. (1990). The complexity and construction of many faces in arrangements of lines and of segments. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187784\">https://doi.org/10.1007/BF02187784</a>","ieee":"H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity and construction of many faces in arrangements of lines and of segments,” <i>Discrete &#38; Computational Geometry</i>, vol. 5, no. 1. Springer, pp. 161–196, 1990.","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1990. <a href=\"https://doi.org/10.1007/BF02187784\">https://doi.org/10.1007/BF02187784</a>.","short":"H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &#38; Computational Geometry 5 (1990) 161–196.","mla":"Edelsbrunner, Herbert, et al. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.” <i>Discrete &#38; Computational Geometry</i>, vol. 5, no. 1, Springer, 1990, pp. 161–96, doi:<a href=\"https://doi.org/10.1007/BF02187784\">10.1007/BF02187784</a>.","ista":"Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity and construction of many faces in arrangements of lines and of segments. Discrete &#38; Computational Geometry. 5(1), 161–196."},"year":"1990","doi":"10.1007/BF02187784","day":"01","abstract":[{"text":"We show that the total number of edges ofm faces of an arrangement ofn lines in the plane isO(m 2/3– n 2/3+2 +n) for any&gt;0. The proof takes an algorithmic approach, that is, we describe an algorithm for the calculation of thesem faces and derive the upper bound from the analysis of the algorithm. The algorithm uses randomization and its expected time complexity isO(m 2/3– n 2/3+2 logn+n logn logm). If instead of lines we have an arrangement ofn line segments, then the maximum number of edges ofm faces isO(m 2/3– n 2/3+2 +n (n) logm) for any&gt;0, where(n) is the functional inverse of Ackermann's function. We give a (randomized) algorithm that produces these faces and takes expected timeO(m 2/3– n 2/3+2 log+n(n) log2 n logm).","lang":"eng"}],"page":"161 - 196","quality_controlled":"1","publisher":"Springer","article_type":"original","_id":"4072","scopus_import":"1","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Leonidas","last_name":"Guibas","full_name":"Guibas, Leonidas"},{"last_name":"Sharir","first_name":"Micha","full_name":"Sharir, Micha"}],"issue":"1","publication_status":"published","article_processing_charge":"No","date_created":"2018-12-11T12:06:46Z","title":"The complexity and construction of many faces in arrangements of lines and of segments","intvolume":"         5","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187784"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","date_published":"1990-01-01T00:00:00Z","type":"journal_article","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"publist_id":"2053","language":[{"iso":"eng"}],"publication":"Discrete & Computational Geometry","oa_version":"None","month":"01"},{"status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/89543"}],"type":"conference","date_published":"1990-01-01T00:00:00Z","year":"1990","citation":{"short":"B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, in:, 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 242–251.","mla":"Chazelle, Bernard, et al. “Counting and Cutting Cycles of Lines and Rods in Space.” <i>31st Annual Symposium on Foundations of Computer Science</i>, IEEE, 1990, pp. 242–51, doi:<a href=\"https://doi.org/10.1109/FSCS.1990.89543\">10.1109/FSCS.1990.89543</a>.","ista":"Chazelle B, Edelsbrunner H, Guibas L, Pollack R, Seidel R, Sharir M, Snoeyink J. 1990. Counting and cutting cycles of lines and rods in space. 31st Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 242–251.","ama":"Chazelle B, Edelsbrunner H, Guibas L, et al. Counting and cutting cycles of lines and rods in space. In: <i>31st Annual Symposium on Foundations of Computer Science</i>. IEEE; 1990:242-251. doi:<a href=\"https://doi.org/10.1109/FSCS.1990.89543\">10.1109/FSCS.1990.89543</a>","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., Pollack, R., Seidel, R., Sharir, M., &#38; Snoeyink, J. (1990). Counting and cutting cycles of lines and rods in space. In <i>31st Annual Symposium on Foundations of Computer Science</i> (pp. 242–251). St. Louis, MO, United States of America: IEEE. <a href=\"https://doi.org/10.1109/FSCS.1990.89543\">https://doi.org/10.1109/FSCS.1990.89543</a>","ieee":"B. Chazelle <i>et al.</i>, “Counting and cutting cycles of lines and rods in space,” in <i>31st Annual Symposium on Foundations of Computer Science</i>, St. Louis, MO, United States of America, 1990, pp. 242–251.","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “Counting and Cutting Cycles of Lines and Rods in Space.” In <i>31st Annual Symposium on Foundations of Computer Science</i>, 242–51. IEEE, 1990. <a href=\"https://doi.org/10.1109/FSCS.1990.89543\">https://doi.org/10.1109/FSCS.1990.89543</a>."},"date_updated":"2022-02-17T11:07:07Z","publist_id":"2047","abstract":[{"text":"A number of rendering algorithms in computer graphics sort three-dimensional objects by depth and assume that there is no cycle that makes the sorting impossible. One way to resolve the problem caused by cycles is to cut the objects into smaller pieces. The problem of estimating how many such cuts are always sufficient is addressed. A few related algorithmic and combinatorial geometry problems are considered.","lang":"eng"}],"publication_identifier":{"isbn":["0-8186-2082-X"]},"day":"01","doi":"10.1109/FSCS.1990.89543","language":[{"iso":"eng"}],"quality_controlled":"1","page":"242 - 251","conference":{"end_date":"1990-10-24","location":"St. Louis, MO, United States of America","start_date":"1990-10-22","name":"FOCS: Foundations of Computer Science"},"publisher":"IEEE","author":[{"last_name":"Chazelle","first_name":"Bernard","full_name":"Chazelle, Bernard"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"first_name":"Leonidas","last_name":"Guibas","full_name":"Guibas, Leonidas"},{"full_name":"Pollack, Richard","first_name":"Richard","last_name":"Pollack"},{"full_name":"Seidel, Raimund","first_name":"Raimund","last_name":"Seidel"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"},{"last_name":"Snoeyink","first_name":"Jack","full_name":"Snoeyink, Jack"}],"scopus_import":"1","publication":"31st Annual Symposium on Foundations of Computer Science","_id":"4073","month":"01","title":"Counting and cutting cycles of lines and rods in space","article_processing_charge":"No","date_created":"2018-12-11T12:06:47Z","publication_status":"published","oa_version":"None"},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187783"}],"date_published":"1990-03-01T00:00:00Z","type":"journal_article","publist_id":"2048","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"language":[{"iso":"eng"}],"publication":"Discrete & Computational Geometry","month":"03","oa_version":"None","extern":"1","acknowledgement":"The research of the second author was supported by the National Science Foundation under Grant CCR-8714565. Work by the fourth author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant No. NSF-DCR-83-20085, by grants from the Digital Equipment Corporation and the IBM Corporation, and by a research grant from the NCRD, the Israeli National Council for Research and Development. A preliminary version of this paper has appeared in theProceedings of the 29th IEEE Symposium on Foundations of Computer Science, 1988.","volume":5,"date_updated":"2022-02-17T15:41:04Z","citation":{"chicago":"Clarkson, Kenneth, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Emo Welzl. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1990. <a href=\"https://doi.org/10.1007/BF02187783\">https://doi.org/10.1007/BF02187783</a>.","ieee":"K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, “Combinatorial complexity bounds for arrangements of curves and spheres,” <i>Discrete &#38; Computational Geometry</i>, vol. 5, no. 1. Springer, pp. 99–160, 1990.","apa":"Clarkson, K., Edelsbrunner, H., Guibas, L., Sharir, M., &#38; Welzl, E. (1990). Combinatorial complexity bounds for arrangements of curves and spheres. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187783\">https://doi.org/10.1007/BF02187783</a>","ama":"Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. Combinatorial complexity bounds for arrangements of curves and spheres. <i>Discrete &#38; Computational Geometry</i>. 1990;5(1):99-160. doi:<a href=\"https://doi.org/10.1007/BF02187783\">10.1007/BF02187783</a>","ista":"Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. 1990. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete &#38; Computational Geometry. 5(1), 99–160.","short":"K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete &#38; Computational Geometry 5 (1990) 99–160.","mla":"Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.” <i>Discrete &#38; Computational Geometry</i>, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:<a href=\"https://doi.org/10.1007/BF02187783\">10.1007/BF02187783</a>."},"year":"1990","abstract":[{"text":"We present upper and lower bounds for extremal problems defined for arrangements of lines, circles, spheres, and alike. For example, we prove that the maximum number of edges boundingm cells in an arrangement ofn lines is Θ(m 2/3 n 2/3 +n), and that it isO(m 2/3 n 2/3 β(n) +n) forn unit-circles, whereβ(n) (and laterβ(m, n)) is a function that depends on the inverse of Ackermann's function and grows extremely slowly. If we replace unit-circles by circles of arbitrary radii the upper bound goes up toO(m 3/5 n 4/5 β(n) +n). The same bounds (without theβ(n)-terms) hold for the maximum sum of degrees ofm vertices. In the case of vertex degrees in arrangements of lines and of unit-circles our bounds match previous results, but our proofs are considerably simpler than the previous ones. The maximum sum of degrees ofm vertices in an arrangement ofn spheres in three dimensions isO(m 4/7 n 9/7 β(m, n) +n 2), in general, andO(m 3/4 n 3/4 β(m, n) +n) if no three spheres intersect in a common circle. The latter bound implies that the maximum number of unit-distances amongm points in three dimensions isO(m 3/2 β(m)) which improves the best previous upper bound on this problem. Applications of our results to other distance problems are also given.","lang":"eng"}],"doi":"10.1007/BF02187783","day":"01","page":"99 - 160","quality_controlled":"1","article_type":"original","publisher":"Springer","author":[{"first_name":"Kenneth","last_name":"Clarkson","full_name":"Clarkson, Kenneth"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"first_name":"Leonidas","last_name":"Guibas","full_name":"Guibas, Leonidas"},{"last_name":"Sharir","first_name":"Micha","full_name":"Sharir, Micha"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"}],"issue":"1","_id":"4074","title":"Combinatorial complexity bounds for arrangements of curves and spheres","intvolume":"         5","publication_status":"published","date_created":"2018-12-11T12:06:47Z","article_processing_charge":"No"},{"volume":5,"acknowledgement":"The first author is pleased to acknowledge support by the National Science Foundation under Grant CCR-8700917. The research of the second author was supported by Amoco Foundation Faculty Development Grant CS 1-6-44862 and by the National Science Foundatio","extern":"1","doi":"10.1007/BF01840404","day":"01","abstract":[{"text":"A key problem in computational geometry is the identification of subsets of a point set having particular properties. We study this problem for the properties of convexity and emptiness. We show that finding empty triangles is related to the problem of determining pairs of vertices that see each other in a star-shaped polygon. A linear-time algorithm for this problem which is of independent interest yields an optimal algorithm for finding all empty triangles. This result is then extended to an algorithm for finding empty convex r-gons (r&gt; 3) and for determining a largest empty convex subset. Finally, extensions to higher dimensions are mentioned.","lang":"eng"}],"date_updated":"2022-02-21T10:55:13Z","citation":{"mla":"Dobkin, David, et al. “Searching for Empty Convex Polygons.” <i>Algorithmica</i>, vol. 5, no. 4, Springer, 1990, pp. 561–71, doi:<a href=\"https://doi.org/10.1007/BF01840404\">10.1007/BF01840404</a>.","short":"D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.","ista":"Dobkin D, Edelsbrunner H, Overmars M. 1990. Searching for empty convex polygons. Algorithmica. 5(4), 561–571.","ama":"Dobkin D, Edelsbrunner H, Overmars M. Searching for empty convex polygons. <i>Algorithmica</i>. 1990;5(4):561-571. doi:<a href=\"https://doi.org/10.1007/BF01840404\">10.1007/BF01840404</a>","apa":"Dobkin, D., Edelsbrunner, H., &#38; Overmars, M. (1990). Searching for empty convex polygons. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/BF01840404\">https://doi.org/10.1007/BF01840404</a>","ieee":"D. Dobkin, H. Edelsbrunner, and M. Overmars, “Searching for empty convex polygons,” <i>Algorithmica</i>, vol. 5, no. 4. Springer, pp. 561–571, 1990.","chicago":"Dobkin, David, Herbert Edelsbrunner, and Mark Overmars. “Searching for Empty Convex Polygons.” <i>Algorithmica</i>. Springer, 1990. <a href=\"https://doi.org/10.1007/BF01840404\">https://doi.org/10.1007/BF01840404</a>."},"year":"1990","publisher":"Springer","article_type":"original","page":"561 - 571","quality_controlled":"1","publication_status":"published","article_processing_charge":"No","date_created":"2018-12-11T12:06:47Z","title":"Searching for empty convex polygons","intvolume":"         5","_id":"4075","scopus_import":"1","author":[{"last_name":"Dobkin","first_name":"David","full_name":"Dobkin, David"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"last_name":"Overmars","first_name":"Mark","full_name":"Overmars, Mark"}],"issue":"4","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01840404"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","publication_identifier":{"eissn":["1432-0541"],"issn":["0178-4617"]},"publist_id":"2049","date_published":"1990-06-01T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"oa_version":"None","month":"06","publication":"Algorithmica"},{"publication":"Proceedings of the 6th annual symposium on Computational geometry","_id":"4076","scopus_import":"1","author":[{"first_name":"Pankaj","last_name":"Agarwal","full_name":"Agarwal, Pankaj"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Otfried","last_name":"Schwarzkopf","full_name":"Schwarzkopf, Otfried"},{"first_name":"Emo","last_name":"Welzl","full_name":"Welzl, Emo"}],"publication_status":"published","oa_version":"None","article_processing_charge":"No","date_created":"2018-12-11T12:06:48Z","title":" Euclidean minimum spanning trees and bichromatic closest pairs","month":"01","page":"203 - 210","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"ACM","conference":{"start_date":"1990-06-07","name":"SCG: Symposium on Computational Geometry","end_date":"1990-06-09","location":"Berkeley, CA, United States"},"date_updated":"2022-02-16T15:30:22Z","year":"1990","citation":{"ista":"Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1990.  Euclidean minimum spanning trees and bichromatic closest pairs. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 203–210.","short":"P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210.","mla":"Agarwal, Pankaj, et al. “ Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>, ACM, 1990, pp. 203–10, doi:<a href=\"https://doi.org/10.1145/98524.98567\">10.1145/98524.98567</a>.","chicago":"Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “ Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” In <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>, 203–10. ACM, 1990. <a href=\"https://doi.org/10.1145/98524.98567\">https://doi.org/10.1145/98524.98567</a>.","ieee":"P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “ Euclidean minimum spanning trees and bichromatic closest pairs,” in <i>Proceedings of the 6th annual symposium on Computational geometry</i>, Berkeley, CA, United States, 1990, pp. 203–210.","apa":"Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., &#38; Welzl, E. (1990).  Euclidean minimum spanning trees and bichromatic closest pairs. In <i>Proceedings of the 6th annual symposium on Computational geometry</i> (pp. 203–210). Berkeley, CA, United States: ACM. <a href=\"https://doi.org/10.1145/98524.98567\">https://doi.org/10.1145/98524.98567</a>","ama":"Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E.  Euclidean minimum spanning trees and bichromatic closest pairs. In: <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>. ACM; 1990:203-210. doi:<a href=\"https://doi.org/10.1145/98524.98567\">10.1145/98524.98567</a>"},"date_published":"1990-01-01T00:00:00Z","type":"conference","doi":"10.1145/98524.98567","day":"01","publication_identifier":{"isbn":["978-0-89791-362-1"]},"abstract":[{"lang":"eng","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(Td(N, N) logd N), where Td(n, m) is the time required to compute a bichromatic closest pair among n red and m blue points in Ed. If Td(N, N) = Ω(N1+ε), for some fixed ε &gt; 0, then the running time improves to O(Td(N, N)). Furthermore, we describe a randomized algorithm to compute a bichromatic closets 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/3log4/3 N) expected time algorithm for computing a Euclidean minimum spanning tree of N points in E3."}],"publist_id":"2044","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/98524.98567"}],"extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public"},{"quality_controlled":"1","page":"112 - 115","language":[{"iso":"eng"}],"publisher":"ACM","conference":{"name":"SCG: Symposium on Computational Geometry","start_date":"1990-06-07","end_date":"1990-06-09","location":"Berkley, CA, United States"},"scopus_import":"1","publication":"Proceedings of the 6th annual symposium on Computational geometry","_id":"4077","author":[{"full_name":"Aronov, Boris","last_name":"Aronov","first_name":"Boris"},{"full_name":"Chazelle, Bernard","last_name":"Chazelle","first_name":"Bernard"},{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Leonidas","last_name":"Guibas","full_name":"Guibas, Leonidas"},{"last_name":"Sharir","first_name":"Micha","full_name":"Sharir, Micha"},{"last_name":"Wenger","first_name":"Rephael","full_name":"Wenger, Rephael"}],"article_processing_charge":"No","date_created":"2018-12-11T12:06:48Z","publication_status":"published","oa_version":"None","title":"Points and triangles in the plane and halving planes in space","month":"01","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/98524.98548"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","extern":"1","year":"1990","citation":{"mla":"Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.” <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>, ACM, 1990, pp. 112–15, doi:<a href=\"https://doi.org/10.1145/98524.98548\">10.1145/98524.98548</a>.","short":"B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–115.","ista":"Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1990. Points and triangles in the plane and halving planes in space. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 112–115.","ama":"Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. Points and triangles in the plane and halving planes in space. In: <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>. ACM; 1990:112-115. doi:<a href=\"https://doi.org/10.1145/98524.98548\">10.1145/98524.98548</a>","apa":"Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &#38; Wenger, R. (1990). Points and triangles in the plane and halving planes in space. In <i>Proceedings of the 6th annual symposium on Computational geometry</i> (pp. 112–115). Berkley, CA, United States: ACM. <a href=\"https://doi.org/10.1145/98524.98548\">https://doi.org/10.1145/98524.98548</a>","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,” in <i>Proceedings of the 6th annual symposium on Computational geometry</i>, Berkley, CA, United States, 1990, pp. 112–115.","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.” In <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>, 112–15. ACM, 1990. <a href=\"https://doi.org/10.1145/98524.98548\">https://doi.org/10.1145/98524.98548</a>."},"date_updated":"2022-02-17T09:42:27Z","type":"conference","date_published":"1990-01-01T00:00:00Z","publication_identifier":{"isbn":["978-0-89791-362-1"]},"day":"01","doi":"10.1145/98524.98548","publist_id":"2045","abstract":[{"text":"We prove that for any set S of n points in the plane and n3-α triangles spanned by the points of S there exists a point (not necessarily of S) contained in at least n3-3α/(512 log25 n) of the triangles. This implies that any set of n points in three - dimensional space defines at most 6.4n8/3 log5/3 n halving planes.","lang":"eng"}]},{"abstract":[{"text":"In this paper we derived combinatorial point selection results for geometric objects defined by pairs of points. In a nutshell, the results say that if many pairs of a set of n points in some fixed dimension each define a geometric object of some type, then there is a point covered by many of these objects. Based on such a result for three-dimensional spheres we show that the combinatorial size of the Delaunay triangulation of a point set in space can be reduced by adding new points. We believe that from a practical point of view this is the most important result of this paper.","lang":"eng"}],"publist_id":"2046","doi":"10.1145/98524.98551","day":"01","publication_identifier":{"isbn":["978-0-89791-362-1"]},"date_published":"1990-01-01T00:00:00Z","type":"conference","date_updated":"2022-02-17T10:09:54Z","year":"1990","citation":{"apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., &#38; Sharir, M. (1990). Slimming down by adding; selecting heavily covered points. In <i>Proceedings of the 6th annual symposium on computational geometry</i> (pp. 116–127). Berkley, CA, United States: ACM. <a href=\"https://doi.org/10.1145/98524.98551\">https://doi.org/10.1145/98524.98551</a>","ama":"Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. Slimming down by adding; selecting heavily covered points. In: <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>. ACM; 1990:116-127. doi:<a href=\"https://doi.org/10.1145/98524.98551\">10.1145/98524.98551</a>","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, John Hershberger, Raimund Seidel, and Micha Sharir. “Slimming down by Adding; Selecting Heavily Covered Points.” In <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>, 116–27. ACM, 1990. <a href=\"https://doi.org/10.1145/98524.98551\">https://doi.org/10.1145/98524.98551</a>.","ieee":"B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, and M. Sharir, “Slimming down by adding; selecting heavily covered points,” in <i>Proceedings of the 6th annual symposium on computational geometry</i>, Berkley, CA, United States, 1990, pp. 116–127.","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 116–127.","mla":"Chazelle, Bernard, et al. “Slimming down by Adding; Selecting Heavily Covered Points.” <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>, ACM, 1990, pp. 116–27, doi:<a href=\"https://doi.org/10.1145/98524.98551\">10.1145/98524.98551</a>.","ista":"Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. 1990. Slimming down by adding; selecting heavily covered points. Proceedings of the 6th annual symposium on computational geometry. SCG: Symposium on Computational Geometry, 116–127."},"extern":"1","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/98524.98551"}],"month":"01","title":"Slimming down by adding; selecting heavily covered points","oa_version":"None","publication_status":"published","date_created":"2018-12-11T12:06:48Z","article_processing_charge":"No","author":[{"full_name":"Chazelle, Bernard","first_name":"Bernard","last_name":"Chazelle"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Guibas, Leonidas","last_name":"Guibas","first_name":"Leonidas"},{"first_name":"John","last_name":"Hershberger","full_name":"Hershberger, John"},{"last_name":"Seidel","first_name":"Raimund","full_name":"Seidel, Raimund"},{"first_name":"Micha","last_name":"Sharir","full_name":"Sharir, Micha"}],"_id":"4078","publication":"Proceedings of the 6th annual symposium on computational geometry","scopus_import":"1","conference":{"name":"SCG: Symposium on Computational Geometry","start_date":"1990-06-07","end_date":"1990-06-09","location":"Berkley, CA, United States"},"publisher":"ACM","language":[{"iso":"eng"}],"page":"116 - 127","quality_controlled":"1"},{"author":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jones","first_name":"Steve","full_name":"Jones, Steve"}],"scopus_import":"1","publication":"Nature","_id":"4310","intvolume":"       346","title":"The language of the genes","month":"08","article_processing_charge":"No","date_created":"2018-12-11T12:08:11Z","publication_status":"published","oa_version":"None","language":[{"iso":"eng"}],"quality_controlled":"1","page":"415 - 416","article_type":"original","publisher":"Nature Publishing Group","type":"journal_article","date_published":"1990-08-02T00:00:00Z","year":"1990","citation":{"chicago":"Barton, Nicholas H, and Steve Jones. “The Language of the Genes.” <i>Nature</i>. Nature Publishing Group, 1990. <a href=\"https://doi.org/10.1038/346415a0\">https://doi.org/10.1038/346415a0</a>.","ieee":"N. H. Barton and S. Jones, “The language of the genes,” <i>Nature</i>, vol. 346. Nature Publishing Group, pp. 415–416, 1990.","apa":"Barton, N. H., &#38; Jones, S. (1990). The language of the genes. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/346415a0\">https://doi.org/10.1038/346415a0</a>","ama":"Barton NH, Jones S. The language of the genes. <i>Nature</i>. 1990;346:415-416. doi:<a href=\"https://doi.org/10.1038/346415a0\">10.1038/346415a0</a>","ista":"Barton NH, Jones S. 1990. The language of the genes. Nature. 346, 415–416.","mla":"Barton, Nicholas H., and Steve Jones. “The Language of the Genes.” <i>Nature</i>, vol. 346, Nature Publishing Group, 1990, pp. 415–16, doi:<a href=\"https://doi.org/10.1038/346415a0\">10.1038/346415a0</a>.","short":"N.H. Barton, S. Jones, Nature 346 (1990) 415–416."},"date_updated":"2022-02-16T10:51:50Z","publist_id":"1749","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"day":"02","doi":"10.1038/346415a0","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","main_file_link":[{"url":"https://www.nature.com/articles/346415a0"}],"volume":346},{"date_updated":"2022-02-16T10:49:05Z","citation":{"apa":"Barton, N. H., &#38; Clark, A. (1990). Population structure and processes in evolution. In K. Wöhrmann &#38; S. Jain (Eds.), <i>Population biology: Ecological and evolutionary viewpoints</i> (pp. 115–174). Springer. <a href=\"https://doi.org/10.1007/978-3-642-74474-7_5\">https://doi.org/10.1007/978-3-642-74474-7_5</a>","ama":"Barton NH, Clark A. Population structure and processes in evolution. In: Wöhrmann K, Jain S, eds. <i>Population Biology: Ecological and Evolutionary Viewpoints</i>. Springer; 1990:115-174. doi:<a href=\"https://doi.org/10.1007/978-3-642-74474-7_5\">10.1007/978-3-642-74474-7_5</a>","ieee":"N. H. Barton and A. Clark, “Population structure and processes in evolution,” in <i>Population biology: Ecological and evolutionary viewpoints</i>, K. Wöhrmann and S. Jain, Eds. Springer, 1990, pp. 115–174.","chicago":"Barton, Nicholas H, and A. Clark. “Population Structure and Processes in Evolution.” In <i>Population Biology: Ecological and Evolutionary Viewpoints</i>, edited by Klaus Wöhrmann and Subodh Jain, 115–74. Springer, 1990. <a href=\"https://doi.org/10.1007/978-3-642-74474-7_5\">https://doi.org/10.1007/978-3-642-74474-7_5</a>.","mla":"Barton, Nicholas H., and A. Clark. “Population Structure and Processes in Evolution.” <i>Population Biology: Ecological and Evolutionary Viewpoints</i>, edited by Klaus Wöhrmann and Subodh Jain, Springer, 1990, pp. 115–74, doi:<a href=\"https://doi.org/10.1007/978-3-642-74474-7_5\">10.1007/978-3-642-74474-7_5</a>.","short":"N.H. Barton, A. Clark, in:, K. Wöhrmann, S. Jain (Eds.), Population Biology: Ecological and Evolutionary Viewpoints, Springer, 1990, pp. 115–174.","ista":"Barton NH, Clark A. 1990.Population structure and processes in evolution. In: Population biology: Ecological and evolutionary viewpoints. , 115–174."},"year":"1990","date_published":"1990-01-01T00:00:00Z","type":"book_chapter","doi":"10.1007/978-3-642-74474-7_5","day":"01","publication_identifier":{"isbn":[" 978-3642744761"]},"publist_id":"1748","main_file_link":[{"url":"https://link.springer.com/book/10.1007/978-3-642-74474-7"}],"extern":"1","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4311","publication":"Population biology: Ecological and evolutionary viewpoints","author":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Clark, A.","first_name":"A.","last_name":"Clark"}],"oa_version":"None","publication_status":"published","date_created":"2018-12-11T12:08:11Z","article_processing_charge":"No","title":"Population structure and processes in evolution","month":"01","page":"115 - 174","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Springer","editor":[{"last_name":"Wöhrmann","first_name":"Klaus","full_name":"Wöhrmann, Klaus"},{"full_name":"Jain, Subodh","first_name":"Subodh","last_name":"Jain"}]},{"status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/128356"}],"acknowledgement":"Sponsors: IBM graduate fellowship,  National Science Foundation grant CCR-89-11512,  National Science Foundation CCR-89-13641, Defense Advanced Research Projects Agency under contract N00039-84-C-0211,  United States Air Force Office of Scientific Research under contract AFOSR-90-0057,  European Community ESPRIT Basic Research Action project 3096 (SPEC).","publist_id":"220","abstract":[{"lang":"eng","text":"The interleaving model is both adequate and sufficiently abstract to allow for the practical specification and verification of many properties of concurrent systems. We incorporate real time into this 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 upper-bound real-time requirements for transitions.\r\nWe present proof rules to establish lower and upper real-time bounds for response properties of real-time transition systems. This proof system can be used to verify bounded-invariance and bounded-response properties, such as timely termination of shared-variables multi-process systems, whose semantics is defined in terms of real-time transition systems."}],"publication_identifier":{"isbn":["0-8186-2078-1"]},"day":"01","doi":"10.1109/JCIT.1990.128356","type":"conference","date_published":"1990-01-01T00:00:00Z","citation":{"mla":"Henzinger, Thomas A., et al. “An Interleaving Model for Real Time.” <i> Proceedings of the 5th Jerusalem Conference on Information Technology</i>, IEEE, 1990, pp. 717–30, doi:<a href=\"https://doi.org/10.1109/JCIT.1990.128356\">10.1109/JCIT.1990.128356</a>.","short":"T.A. Henzinger, Z. Manna, A. Pnueli, in:,  Proceedings of the 5th Jerusalem Conference on Information Technology, IEEE, 1990, pp. 717–730.","ista":"Henzinger TA, Manna Z, Pnueli A. 1990. An interleaving model for real time.  Proceedings of the 5th Jerusalem Conference on Information Technology. JCIT: Jerusalem Conference on Information Technology, 717–730.","ama":"Henzinger TA, Manna Z, Pnueli A. An interleaving model for real time. In: <i> Proceedings of the 5th Jerusalem Conference on Information Technology</i>. IEEE; 1990:717-730. doi:<a href=\"https://doi.org/10.1109/JCIT.1990.128356\">10.1109/JCIT.1990.128356</a>","apa":"Henzinger, T. A., Manna, Z., &#38; Pnueli, A. (1990). An interleaving model for real time. In <i> Proceedings of the 5th Jerusalem Conference on Information Technology</i> (pp. 717–730). Jerusalem, Israel: IEEE. <a href=\"https://doi.org/10.1109/JCIT.1990.128356\">https://doi.org/10.1109/JCIT.1990.128356</a>","ieee":"T. A. Henzinger, Z. Manna, and A. Pnueli, “An interleaving model for real time,” in <i> Proceedings of the 5th Jerusalem Conference on Information Technology</i>, Jerusalem, Israel, 1990, pp. 717–730.","chicago":"Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “An Interleaving Model for Real Time.” In <i> Proceedings of the 5th Jerusalem Conference on Information Technology</i>, 717–30. IEEE, 1990. <a href=\"https://doi.org/10.1109/JCIT.1990.128356\">https://doi.org/10.1109/JCIT.1990.128356</a>."},"year":"1990","date_updated":"2022-02-15T15:51:25Z","conference":{"end_date":"1990-10-25","location":"Jerusalem, Israel","name":"JCIT: Jerusalem Conference on Information Technology","start_date":"1990-10-22"},"publisher":"IEEE","language":[{"iso":"eng"}],"quality_controlled":"1","page":"717 - 730","month":"01","title":"An interleaving model for real time","date_created":"2018-12-11T12:09:14Z","article_processing_charge":"No","oa_version":"None","publication_status":"published","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Manna","first_name":"Zohar","full_name":"Manna, Zohar"},{"full_name":"Pnueli, Amir","last_name":"Pnueli","first_name":"Amir"}],"scopus_import":"1","_id":"4510","publication":" Proceedings of the 5th Jerusalem Conference on Information Technology"},{"date_updated":"2022-02-15T15:11:03Z","year":"1990","citation":{"short":"T.A. Henzinger, in:, Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1990, pp. 281–296.","mla":"Henzinger, Thomas A. “Half-Order Modal Logic: How to Prove Real-Time Properties.” <i>Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing</i>, ACM, 1990, pp. 281–96, doi:<a href=\"https://doi.org/10.1145/93385.93429\">10.1145/93385.93429</a>.","ista":"Henzinger TA. 1990. Half-order modal logic: How to prove real-time properties. Proceedings of the 9th annual ACM symposium on Principles of distributed computing. PODC: Principles of Distributed Computing, 281–296.","apa":"Henzinger, T. A. (1990). Half-order modal logic: How to prove real-time properties. In <i>Proceedings of the 9th annual ACM symposium on Principles of distributed computing</i> (pp. 281–296). Quebec City, Canada: ACM. <a href=\"https://doi.org/10.1145/93385.93429\">https://doi.org/10.1145/93385.93429</a>","ama":"Henzinger TA. Half-order modal logic: How to prove real-time properties. In: <i>Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing</i>. ACM; 1990:281-296. doi:<a href=\"https://doi.org/10.1145/93385.93429\">10.1145/93385.93429</a>","chicago":"Henzinger, Thomas A. “Half-Order Modal Logic: How to Prove Real-Time Properties.” In <i>Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing</i>, 281–96. ACM, 1990. <a href=\"https://doi.org/10.1145/93385.93429\">https://doi.org/10.1145/93385.93429</a>.","ieee":"T. A. Henzinger, “Half-order modal logic: How to prove real-time properties,” in <i>Proceedings of the 9th annual ACM symposium on Principles of distributed computing</i>, Quebec City, Canada, 1990, pp. 281–296."},"date_published":"1990-01-01T00:00:00Z","type":"conference","doi":"10.1145/93385.93429","publication_identifier":{"isbn":["978-0-89791-404-8"]},"day":"01","abstract":[{"text":"We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These values are. however, not treated as full first-order objects: they can be accessed only by a very restricted form of quantification: the \"freeze\" quantifier binds a variable to the value of the current world. We present a complete proof system for this (\"half-order\") modal logic. As a special case, we obtain the real-time temporal logic TPTL of [AH891: the models are restricted to infinite sequences of states, whose values are monotonically increasing natural numbers. The ordering relation between states is interpreted as temporal precedence. while the value associated with a state is interpreted as its \"rear time. We extend our proof system to be complete for TPTL. and demonstrate how it can be used to derive real-time properties. ","lang":"eng"}],"publist_id":"209","acknowledgement":"Many thanks to Rajeev Alur, Adam Grove, Zohar Manna, and Amir Pnueli for their continuous discussions and support.","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/93385.93429"}],"extern":"1","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4522","publication":"Proceedings of the 9th annual ACM symposium on Principles of distributed computing","scopus_import":"1","author":[{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","oa_version":"None","date_created":"2018-12-11T12:09:17Z","article_processing_charge":"No","title":"Half-order modal logic: How to prove real-time properties","month":"01","page":"281 - 296","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"ACM","conference":{"name":"PODC: Principles of Distributed Computing","start_date":"1990-08-22","location":"Quebec City, Canada","end_date":"1990-08-24"}},{"publication_identifier":{"eissn":["1873-7544"],"issn":["0306-4522"]},"publist_id":"4422","type":"journal_article","date_published":"1989-01-01T00:00:00Z","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0306452289901097?via%3Dihub"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","oa_version":"None","month":"01","publication":"Neuroscience","language":[{"iso":"eng"}],"day":"01","doi":"10.1016/0306-4522(89)90109-7","abstract":[{"lang":"eng","text":"Distribution of putative glutamatergic neurons in the lower brainstem and cerebellum of the rat was examined immunocytochemically by using a monoclonal antibody against phosphate-activated glutaminase, which has been proposed to be a major synthetic enzyme of transmitter glutamate and so may serve as a marker for glutamatergic neurons in the central nervous system. Intensely-immunolabeled neuronal cell bodies were densely distributed in the main precerebellar nuclei sending mossy fibers to the cerebellum; in the pontine nuclei, pontine tegmental reticular nucleus of Bechterew, external cuneate nucleus, and lateral reticular nucleus of the medulla oblongata. Phosphate-activated glutaminase-immunoreactive granular deposits were densely seen in the brachium pontis and restiform body, suggesting the immunolabeling of mossy fibers of passage. In the cerebellum, neuropil within the granule cell layer of the cerebellar cortex displayed intense phosphate-activated glutaminase-immunoreactivity, and that within the deep cerebellar nuclei showed moderate immunoreactivity. These results indicate that many mossy fiber terminals originate from phosphate-activated glutaminase-containing neurons and utilize phosphate-activated glutaminase for the synthesis of transmitter glutamate. Intensely-immunostained neuronal cell bodies were further observed in other regions which have been reported to contain neurons sending mossy fibers to the cerebellum; in the dorsal part of the principal sensory trigeminal nucleus, dorsomedial part of the oral subnucleus of the spinal trigeminal nucleus, interpolar subnucleus of the spinal trigeminal nucleus, paratrigeminal nucleus, supragenual nucleus, regions dorsal to the abducens nucleus and genu of the facial nerve, superior and medial vestibular nuclei, cell groups f, x and y, hypoglossal prepositus nucleus, intercalated nucleus, nucleus of Roller, reticular regions intercalated between the motor trigeminal and principal sensory trigeminal nuclei, linear nucleus, and gigantocellular and paramedian reticular formation. Neuronal cell bodies with intense phosphate-activated glutaminase-immunoreactivity were also found in other brainstem regions, such as the paracochlear glial substance, posterior ventral cochlear nucleus, and cell group e. Although it is still controversial whether all glutamatergic neurons use phosphate-activated glutaminase in a transmitter-related process and whether phosphate-activated glutaminase is involved in other metabolism-related processes, the neurons showing intense phosphate-activated glutaminase-immuno-reactivity in the present study were suggested to be putative glutamatergic neurons."}],"year":"1989","citation":{"ista":"Kaneko T, Itoh K, Shigemoto R, Mizuno N. 1989. Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat. Neuroscience. 32(1), 79–98.","mla":"Kaneko, Takeshi, et al. “Glutaminase-like Immunoreactivity in the Lower Brainstem and Cerebellum of the Adult Rat.” <i>Neuroscience</i>, vol. 32, no. 1, Elsevier, 1989, pp. 79–98, doi:<a href=\"https://doi.org/10.1016/0306-4522(89)90109-7\">10.1016/0306-4522(89)90109-7</a>.","short":"T. Kaneko, K. Itoh, R. Shigemoto, N. Mizuno, Neuroscience 32 (1989) 79–98.","ieee":"T. Kaneko, K. Itoh, R. Shigemoto, and N. Mizuno, “Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat,” <i>Neuroscience</i>, vol. 32, no. 1. Elsevier, pp. 79–98, 1989.","chicago":"Kaneko, Takeshi, Kazuo Itoh, Ryuichi Shigemoto, and Noboru Mizuno. “Glutaminase-like Immunoreactivity in the Lower Brainstem and Cerebellum of the Adult Rat.” <i>Neuroscience</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0306-4522(89)90109-7\">https://doi.org/10.1016/0306-4522(89)90109-7</a>.","apa":"Kaneko, T., Itoh, K., Shigemoto, R., &#38; Mizuno, N. (1989). Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat. <i>Neuroscience</i>. Elsevier. <a href=\"https://doi.org/10.1016/0306-4522(89)90109-7\">https://doi.org/10.1016/0306-4522(89)90109-7</a>","ama":"Kaneko T, Itoh K, Shigemoto R, Mizuno N. Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat. <i>Neuroscience</i>. 1989;32(1):79-98. doi:<a href=\"https://doi.org/10.1016/0306-4522(89)90109-7\">10.1016/0306-4522(89)90109-7</a>"},"date_updated":"2022-02-15T09:47:08Z","external_id":{"pmid":["2586753"]},"volume":32,"acknowledgement":"The authors wish to thank Mr. Akira Uesugi and Mr. Ken’ichi Uesugi for their photographic help. This work was partly supported by grants-in-aid from the Ministry of Education, science and Culture of Japan for Special Project Research 63112003. Special Research Project on Priority-Areas 63623505, Special Research 62480098 and Encouragement of Young Scientist 63770043. The support of the Niwa Medical Research Foundation, Dr. Satoru Fukuchi, Dr. Toshio Fukuda, Dr. Ritsu Hayashi, Dr. Yutaka Kitani, Dr. Hiroshi Matsushima, Dr. Gonpei Niwa, Dr. Hiroyasu Ohtsuka, Dr. Shigeo Tamaki, and Dr. Eizo Watanabe are gratefully acknowledged. ","extern":"1","article_processing_charge":"No","date_created":"2018-12-11T11:57:54Z","publication_status":"published","intvolume":"        32","title":"Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat","scopus_import":"1","pmid":1,"_id":"2479","issue":"1","author":[{"full_name":"Kaneko, Takeshi","first_name":"Takeshi","last_name":"Kaneko"},{"full_name":"Itoh, Kazuo","first_name":"Kazuo","last_name":"Itoh"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444"},{"full_name":"Mizuno, Noboru","first_name":"Noboru","last_name":"Mizuno"}],"publisher":"Elsevier","article_type":"original","quality_controlled":"1","page":"79 - 98"},{"oa_version":"Published Version","month":"10","publication":"Journal of Biological Chemistry","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1083-351X"],"issn":["0021-9258"]},"oa":1,"publist_id":"4374","type":"journal_article","date_published":"1989-10-25T00:00:00Z","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S0021925819846197","open_access":"1"}],"status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_created":"2018-12-11T11:58:11Z","article_processing_charge":"No","publication_status":"published","intvolume":"       264","title":"Molecular characterization of a functional cDNA for rat substance P receptor","scopus_import":"1","pmid":1,"_id":"2525","issue":"30","author":[{"full_name":"Yokota, Yoshifumi","last_name":"Yokota","first_name":"Yoshifumi"},{"full_name":"Sasai, Yoshiki","first_name":"Yoshiki","last_name":"Sasai"},{"first_name":"Kohichi","last_name":"Tanaka","full_name":"Tanaka, Kohichi"},{"first_name":"Tsutomu","last_name":"Fujiwara","full_name":"Fujiwara, Tsutomu"},{"full_name":"Tsuchida, Kunihiro","last_name":"Tsuchida","first_name":"Kunihiro"},{"last_name":"Shigemoto","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kakizuka, Akira","first_name":"Akira","last_name":"Kakizuka"},{"last_name":"Ohkubo","first_name":"Hiroaki","full_name":"Ohkubo, Hiroaki"},{"first_name":"Shigetada","last_name":"Nakanishi","full_name":"Nakanishi, Shigetada"}],"publisher":"American Society for Biochemistry and Molecular Biology","article_type":"original","quality_controlled":"1","page":"17649 - 17652","day":"25","doi":"doi.org/10.1016/S0021-9258(19)84619-7","abstract":[{"text":"This paper describes the amino acid sequence of the rat substance P receptor and its comparison with that of the rat substance K receptor on the basis of molecular cloning and sequence analysis. From a rat brain cDNA library constructed with an RNA expression vector, we identified a cDNA mixture containing a functional substance P receptor cDNA by examining electrophysiologically a receptor expression following injection of the mRNAs synthesized in vitro into Xenopus oocytes. A receptor cDNA clone was then isolated by cross-hybridization with the bovine substance K receptor DNA. The clone was confirmed by selective binding of substance P to the cloned receptor expressed in mammalian COS cells. The deduced amino acid sequence (407 amino acid residues) possesses seven putative membrane spanning domains and shows a sequence similarity to the members of G-protein-coupled receptors. The rat substance P and substance K receptor are very similar in both size and amino acid sequences, particularly in the putative transmembrane similarity is in marked contrast to the sequence divergence in the amino- and carboxyl-terminal regions and the third cytoplasmic loop. The observed sequence similarytity and divergence would thus contribute to the expression of similar but pharmacological regions and the first and second cytoplasmic loops. This distinguishable activities of the two tachykinin receptors.","lang":"eng"}],"year":"1989","citation":{"ama":"Yokota Y, Sasai Y, Tanaka K, et al. Molecular characterization of a functional cDNA for rat substance P receptor. <i>Journal of Biological Chemistry</i>. 1989;264(30):17649-17652. doi:<a href=\"https://doi.org/doi.org/10.1016/S0021-9258(19)84619-7\">doi.org/10.1016/S0021-9258(19)84619-7</a>","apa":"Yokota, Y., Sasai, Y., Tanaka, K., Fujiwara, T., Tsuchida, K., Shigemoto, R., … Nakanishi, S. (1989). Molecular characterization of a functional cDNA for rat substance P receptor. <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/doi.org/10.1016/S0021-9258(19)84619-7\">https://doi.org/doi.org/10.1016/S0021-9258(19)84619-7</a>","ieee":"Y. Yokota <i>et al.</i>, “Molecular characterization of a functional cDNA for rat substance P receptor,” <i>Journal of Biological Chemistry</i>, vol. 264, no. 30. American Society for Biochemistry and Molecular Biology, pp. 17649–17652, 1989.","chicago":"Yokota, Yoshifumi, Yoshiki Sasai, Kohichi Tanaka, Tsutomu Fujiwara, Kunihiro Tsuchida, Ryuichi Shigemoto, Akira Kakizuka, Hiroaki Ohkubo, and Shigetada Nakanishi. “Molecular Characterization of a Functional CDNA for Rat Substance P Receptor.” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 1989. <a href=\"https://doi.org/doi.org/10.1016/S0021-9258(19)84619-7\">https://doi.org/doi.org/10.1016/S0021-9258(19)84619-7</a>.","mla":"Yokota, Yoshifumi, et al. “Molecular Characterization of a Functional CDNA for Rat Substance P Receptor.” <i>Journal of Biological Chemistry</i>, vol. 264, no. 30, American Society for Biochemistry and Molecular Biology, 1989, pp. 17649–52, doi:<a href=\"https://doi.org/doi.org/10.1016/S0021-9258(19)84619-7\">doi.org/10.1016/S0021-9258(19)84619-7</a>.","short":"Y. Yokota, Y. Sasai, K. Tanaka, T. Fujiwara, K. Tsuchida, R. Shigemoto, A. Kakizuka, H. Ohkubo, S. Nakanishi, Journal of Biological Chemistry 264 (1989) 17649–17652.","ista":"Yokota Y, Sasai Y, Tanaka K, Fujiwara T, Tsuchida K, Shigemoto R, Kakizuka A, Ohkubo H, Nakanishi S. 1989. Molecular characterization of a functional cDNA for rat substance P receptor. Journal of Biological Chemistry. 264(30), 17649–17652."},"date_updated":"2022-02-15T09:29:36Z","external_id":{"pmid":["2478537"]},"acknowledgement":"This work was supported in part by research grants from the Ministry of Education, Science and Culture of Japan, the Institute of Physical and Chemical Research, and the Science and Technology Agency of Japan. The costs of publication of this article were defrayed in part by the payment of page charges. This article must therefore be hereby marked “advertisement” in accordance with 18 U.S.C. Section 1734 solely to indicate this fact. ","volume":264,"extern":"1"},{"publication_status":"published","article_processing_charge":"No","date_created":"2018-12-11T11:58:11Z","title":"Direct projections from Ammon's horn to the rostral raphe regions in the brainstem of the cat","intvolume":"       479","pmid":1,"_id":"2526","scopus_import":"1","author":[{"full_name":"Ino, Tadashi","last_name":"Ino","first_name":"Tadashi"},{"last_name":"Itoh","first_name":"Kazuo","full_name":"Itoh, Kazuo"},{"full_name":"Kamiya, Hiroto","first_name":"Hiroto","last_name":"Kamiya"},{"full_name":"Kaneko, Takeshi","first_name":"Takeshi","last_name":"Kaneko"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi"},{"full_name":"Akiguchi, Ichiro","first_name":"Ichiro","last_name":"Akiguchi"},{"full_name":"Mizuno, Noboru","last_name":"Mizuno","first_name":"Noboru"}],"issue":"1","publisher":"Elsevier","article_type":"original","page":"157 - 161","quality_controlled":"1","doi":"10.1016/0006-8993(89)91346-2","day":"06","abstract":[{"text":"When WGA-HRP (wheat germ agglutinin-horseradish peroxidase conjugate) or HRP was injected into the regions around the superior central and/or the dorsal raphe nuclei in the cat, cell bodies of a number of non-pyramidal neurons were labeled in Ammon's horn. Thus the existence of direct projections from non-pyramidal neurons in Ammon's horn to the rostral raphe regions in the brainstem was suggested in the cat.","lang":"eng"}],"date_updated":"2022-02-15T09:14:43Z","year":"1989","citation":{"chicago":"Ino, Tadashi, Kazuo Itoh, Hiroto Kamiya, Takeshi Kaneko, Ryuichi Shigemoto, Ichiro Akiguchi, and Noboru Mizuno. “Direct Projections from Ammon’s Horn to the Rostral Raphe Regions in the Brainstem of the Cat.” <i>Brain Research</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0006-8993(89)91346-2\">https://doi.org/10.1016/0006-8993(89)91346-2</a>.","ieee":"T. Ino <i>et al.</i>, “Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat,” <i>Brain Research</i>, vol. 479, no. 1. Elsevier, pp. 157–161, 1989.","ama":"Ino T, Itoh K, Kamiya H, et al. Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat. <i>Brain Research</i>. 1989;479(1):157-161. doi:<a href=\"https://doi.org/10.1016/0006-8993(89)91346-2\">10.1016/0006-8993(89)91346-2</a>","apa":"Ino, T., Itoh, K., Kamiya, H., Kaneko, T., Shigemoto, R., Akiguchi, I., &#38; Mizuno, N. (1989). Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat. <i>Brain Research</i>. Elsevier. <a href=\"https://doi.org/10.1016/0006-8993(89)91346-2\">https://doi.org/10.1016/0006-8993(89)91346-2</a>","ista":"Ino T, Itoh K, Kamiya H, Kaneko T, Shigemoto R, Akiguchi I, Mizuno N. 1989. Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat. Brain Research. 479(1), 157–161.","short":"T. Ino, K. Itoh, H. Kamiya, T. Kaneko, R. Shigemoto, I. Akiguchi, N. Mizuno, Brain Research 479 (1989) 157–161.","mla":"Ino, Tadashi, et al. “Direct Projections from Ammon’s Horn to the Rostral Raphe Regions in the Brainstem of the Cat.” <i>Brain Research</i>, vol. 479, no. 1, Elsevier, 1989, pp. 157–61, doi:<a href=\"https://doi.org/10.1016/0006-8993(89)91346-2\">10.1016/0006-8993(89)91346-2</a>."},"external_id":{"pmid":["2466535 "]},"volume":479,"acknowledgement":"The photographic help of Mr. Akira Uesugi, and the support of Niwa Medical Research Foundation are gratefully acknowledged. This work has been supported in part by Grant-in-Aid for Special Project Research (No. 63112003) and Grant-in-Aid for Scientific Research (No. 62480098) from the Ministry of Education, Science and Culture of Japan.","extern":"1","oa_version":"None","month":"02","publication":"Brain Research","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0006-8993"],"eissn":["1872-6240"]},"publist_id":"4373","date_published":"1989-02-06T00:00:00Z","type":"journal_article","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0006899389913462?via%3Dihub"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public"},{"date_updated":"2022-02-15T09:06:39Z","year":"1989","citation":{"mla":"Akimoto Masumi, et al. “Effect of endothelin on gastric mucosal blood flow in rat.” <i>Japanese Journal of Gastroenterology</i>, vol. 86, no. 11, Japanese Society of Gastroenterology, 1989, p. 2627, doi:<a href=\"https://doi.org/10.11405/nisshoshi1964.86.2627\">10.11405/nisshoshi1964.86.2627</a>.","short":"Akimoto M., Shigemoto R., Kawamura M., Yamagata H., Kurihara T., Takata S., Miwa Y., Akagami N., Katsu K., Yamauchi D., Japanese Journal of Gastroenterology 86 (1989) 2627.","ista":"Akimoto M, Shigemoto R, Kawamura M, Yamagata H, Kurihara T, Takata S, Miwa Y, Akagami N, Katsu K, Yamauchi D. 1989. Effect of endothelin on gastric mucosal blood flow in rat. Japanese Journal of Gastroenterology. 86(11), 2627.","apa":"Akimoto M., Shigemoto R., Kawamura M., Yamagata H., Kurihara T., Takata S., … Yamauchi D. (1989). Effect of endothelin on gastric mucosal blood flow in rat. <i>Japanese Journal of Gastroenterology</i>. Japanese Society of Gastroenterology. <a href=\"https://doi.org/10.11405/nisshoshi1964.86.2627\">https://doi.org/10.11405/nisshoshi1964.86.2627</a>","ama":"Akimoto M, Shigemoto R, Kawamura M, et al. Effect of endothelin on gastric mucosal blood flow in rat. <i>Japanese Journal of Gastroenterology</i>. 1989;86(11):2627. doi:<a href=\"https://doi.org/10.11405/nisshoshi1964.86.2627\">10.11405/nisshoshi1964.86.2627</a>","chicago":"Akimoto Masumi, Shigemoto Ryuichi, Kawamura Makiko, Yamagata Hideharu, Kurihara Takeshi, Takata S, Miwa Yoko, Akagami N, Katsu Kenichi, and Yamauchi D. “Effect of endothelin on gastric mucosal blood flow in rat.” <i>Japanese Journal of Gastroenterology</i>. Japanese Society of Gastroenterology, 1989. <a href=\"https://doi.org/10.11405/nisshoshi1964.86.2627\">https://doi.org/10.11405/nisshoshi1964.86.2627</a>.","ieee":"Akimoto M. <i>et al.</i>, “Effect of endothelin on gastric mucosal blood flow in rat,” <i>Japanese Journal of Gastroenterology</i>, vol. 86, no. 11. Japanese Society of Gastroenterology, p. 2627, 1989."},"date_published":"1989-11-01T00:00:00Z","type":"journal_article","doi":"10.11405/nisshoshi1964.86.2627","day":"01","publist_id":"4372","volume":86,"main_file_link":[{"url":"https://www.jstage.jst.go.jp/article/nisshoshi1964/86/11/86_11_2627/_article/-char/ja/"}],"extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","_id":"2527","publication":"Japanese Journal of Gastroenterology","scopus_import":"1","author":[{"full_name":"Akimoto, Masumi","last_name":"Akimoto","first_name":"Masumi"},{"last_name":"Shigemoto","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kawamura, Makiko","last_name":"Kawamura","first_name":"Makiko"},{"last_name":"Yamagata","first_name":"Hideharu","full_name":"Yamagata, Hideharu"},{"full_name":"Kurihara, Takeshi","first_name":"Takeshi","last_name":"Kurihara"},{"full_name":"Takata, S","first_name":"S","last_name":"Takata"},{"full_name":"Miwa, Yoko","first_name":"Yoko","last_name":"Miwa"},{"first_name":"N","last_name":"Akagami","full_name":"Akagami, N"},{"full_name":"Katsu, Kenichi","first_name":"Kenichi","last_name":"Katsu"},{"full_name":"Yamauchi, D","first_name":"D","last_name":"Yamauchi"}],"issue":"11","oa_version":"None","publication_status":"published","date_created":"2018-12-11T11:58:12Z","article_processing_charge":"No","title":"Effect of endothelin on gastric mucosal blood flow in rat","month":"11","intvolume":"        86","page":"2627","quality_controlled":"1","language":[{"iso":"jpn"}],"publisher":"Japanese Society of Gastroenterology","article_type":"original"},{"conference":{"location":"Research Triangle Park, NC, USA","end_date":"1989-11-01","start_date":"1989-10-30","name":"FOCS: Foundations of Computer Science"},"publisher":"IEEE","language":[{"iso":"eng"}],"page":"164 - 169","series_title":"FCOS","quality_controlled":"1","month":"01","title":"A really temporal logic","oa_version":"None","publication_status":"published","date_created":"2018-12-11T12:09:40Z","article_processing_charge":"No","author":[{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"_id":"4596","publication":"30th Annual Symposium on Foundations of Computer Science","extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","acknowledgement":"We thank Zohar Manna, Amir Pnueli, and David Dill for their guidance. Moshe Vardi and Joe Halpern gave us very helpful advice for refilling our undecidability results. ","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/63473"}],"abstract":[{"text":"A real-time temporal logic for the specification of reactive systems is introduced. The novel feature of the logic, TPTL, is the adoption of temporal operators as quantifiers over time variables; every modality binds a variable to the time(s) it refers to. TPTL is demonstrated to be both a natural specification language and a suitable formalism for verification and synthesis. A tableau-based decision procedure and model-checking algorithm for TPTL are presented. Several generalizations of TPTL are shown to be highly undecidable.","lang":"eng"}],"publist_id":"111","doi":"10.1109/SFCS.1989.63473","day":"01","publication_identifier":{"isbn":["0-8186-1982-1"],"issn":["0018-9162"],"eissn":["1558-0814"]},"date_published":"1989-01-01T00:00:00Z","type":"conference","date_updated":"2022-02-09T10:40:13Z","citation":{"ista":"Alur R, Henzinger TA. 1989. A really temporal logic. 30th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer ScienceFCOS, 164–169.","mla":"Alur, Rajeev, and Thomas A. Henzinger. “A Really Temporal Logic.” <i>30th Annual Symposium on Foundations of Computer Science</i>, IEEE, 1989, pp. 164–69, doi:<a href=\"https://doi.org/10.1109/SFCS.1989.63473\">10.1109/SFCS.1989.63473</a>.","short":"R. Alur, T.A. Henzinger, in:, 30th Annual Symposium on Foundations of Computer Science, IEEE, 1989, pp. 164–169.","ieee":"R. Alur and T. A. Henzinger, “A really temporal logic,” in <i>30th Annual Symposium on Foundations of Computer Science</i>, Research Triangle Park, NC, USA, 1989, pp. 164–169.","chicago":"Alur, Rajeev, and Thomas A Henzinger. “A Really Temporal Logic.” In <i>30th Annual Symposium on Foundations of Computer Science</i>, 164–69. FCOS. IEEE, 1989. <a href=\"https://doi.org/10.1109/SFCS.1989.63473\">https://doi.org/10.1109/SFCS.1989.63473</a>.","apa":"Alur, R., &#38; Henzinger, T. A. (1989). A really temporal logic. In <i>30th Annual Symposium on Foundations of Computer Science</i> (pp. 164–169). Research Triangle Park, NC, USA: IEEE. <a href=\"https://doi.org/10.1109/SFCS.1989.63473\">https://doi.org/10.1109/SFCS.1989.63473</a>","ama":"Alur R, Henzinger TA. A really temporal logic. In: <i>30th Annual Symposium on Foundations of Computer Science</i>. FCOS. IEEE; 1989:164-169. doi:<a href=\"https://doi.org/10.1109/SFCS.1989.63473\">10.1109/SFCS.1989.63473</a>"},"year":"1989"}]