[{"status":"public","intvolume":"         5","citation":{"short":"H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &#38; Computational Geometry 5 (1990) 161–196.","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.","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>","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.","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>.","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>.","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>"},"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187784"}],"title":"The complexity and construction of many faces in arrangements of lines and of segments","_id":"4072","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","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"}],"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.","issue":"1","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"scopus_import":"1","type":"journal_article","date_published":"1990-01-01T00:00:00Z","volume":5,"oa_version":"None","article_type":"original","publisher":"Springer","date_updated":"2022-02-22T09:27:30Z","doi":"10.1007/BF02187784","publication":"Discrete & Computational Geometry","article_processing_charge":"No","quality_controlled":"1","extern":"1","month":"01","page":"161 - 196","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"first_name":"Leonidas","full_name":"Guibas, Leonidas","last_name":"Guibas"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"day":"01","publist_id":"2053","publication_status":"published","date_created":"2018-12-11T12:06:46Z","year":"1990","language":[{"iso":"eng"}]},{"author":[{"last_name":"Chazelle","full_name":"Chazelle, Bernard","first_name":"Bernard"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"last_name":"Guibas","full_name":"Guibas, Leonidas","first_name":"Leonidas"},{"full_name":"Pollack, Richard","first_name":"Richard","last_name":"Pollack"},{"full_name":"Seidel, Raimund","first_name":"Raimund","last_name":"Seidel"},{"first_name":"Micha","full_name":"Sharir, Micha","last_name":"Sharir"},{"last_name":"Snoeyink","full_name":"Snoeyink, Jack","first_name":"Jack"}],"conference":{"location":"St. Louis, MO, United States of America","end_date":"1990-10-24","start_date":"1990-10-22","name":"FOCS: Foundations of Computer Science"},"page":"242 - 251","publication_identifier":{"isbn":["0-8186-2082-X"]},"date_created":"2018-12-11T12:06:47Z","day":"01","publication_status":"published","publist_id":"2047","scopus_import":"1","year":"1990","language":[{"iso":"eng"}],"type":"conference","date_published":"1990-01-01T00:00:00Z","status":"public","oa_version":"None","citation":{"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>.","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>","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>.","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.","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.","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.","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>"},"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/89543"}],"article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","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."}],"publisher":"IEEE","title":"Counting and cutting cycles of lines and rods in space","doi":"10.1109/FSCS.1990.89543","date_updated":"2022-02-17T11:07:07Z","publication":"31st Annual Symposium on Foundations of Computer Science","_id":"4073","month":"01","quality_controlled":"1","extern":"1"},{"page":"99 - 160","author":[{"full_name":"Clarkson, Kenneth","first_name":"Kenneth","last_name":"Clarkson"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Guibas","full_name":"Guibas, Leonidas","first_name":"Leonidas"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"},{"first_name":"Emo","full_name":"Welzl, Emo","last_name":"Welzl"}],"day":"01","publist_id":"2048","publication_status":"published","date_created":"2018-12-11T12:06:47Z","language":[{"iso":"eng"}],"year":"1990","type":"journal_article","date_published":"1990-03-01T00:00:00Z","volume":5,"oa_version":"None","article_type":"original","publisher":"Springer","doi":"10.1007/BF02187783","date_updated":"2022-02-17T15:41:04Z","publication":"Discrete & Computational Geometry","article_processing_charge":"No","quality_controlled":"1","extern":"1","month":"03","issue":"1","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"status":"public","citation":{"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>","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>.","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>.","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.","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>","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.","short":"K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete &#38; Computational Geometry 5 (1990) 99–160."},"intvolume":"         5","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187783"}],"title":"Combinatorial complexity bounds for arrangements of curves and spheres","_id":"4074","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","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"}],"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_published":"1990-06-01T00:00:00Z","type":"journal_article","article_type":"original","oa_version":"None","article_processing_charge":"No","publication":"Algorithmica","doi":"10.1007/BF01840404","date_updated":"2022-02-21T10:55:13Z","publisher":"Springer","month":"06","extern":"1","quality_controlled":"1","author":[{"last_name":"Dobkin","full_name":"Dobkin, David","first_name":"David"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"last_name":"Overmars","full_name":"Overmars, Mark","first_name":"Mark"}],"page":"561 - 571","date_created":"2018-12-11T12:06:47Z","publication_status":"published","publist_id":"2049","day":"01","year":"1990","language":[{"iso":"eng"}],"status":"public","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01840404"}],"intvolume":"         5","citation":{"ista":"Dobkin D, Edelsbrunner H, Overmars M. 1990. Searching for empty convex polygons. Algorithmica. 5(4), 561–571.","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.","short":"D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 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>","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>.","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>."},"abstract":[{"lang":"eng","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."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4075","title":"Searching for empty convex polygons","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","issue":"4","publication_identifier":{"eissn":["1432-0541"],"issn":["0178-4617"]},"scopus_import":"1"},{"quality_controlled":"1","extern":"1","month":"01","publisher":"ACM","doi":"10.1145/98524.98567","title":" Euclidean minimum spanning trees and bichromatic closest pairs","date_updated":"2022-02-16T15:30:22Z","publication":"Proceedings of the 6th annual symposium on Computational geometry","_id":"4076","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","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."}],"citation":{"short":"P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210.","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>","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.","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>.","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>.","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>"},"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/98524.98567"}],"oa_version":"None","status":"public","type":"conference","date_published":"1990-01-01T00:00:00Z","year":"1990","language":[{"iso":"eng"}],"scopus_import":"1","day":"01","publist_id":"2044","publication_status":"published","date_created":"2018-12-11T12:06:48Z","publication_identifier":{"isbn":["978-0-89791-362-1"]},"conference":{"name":"SCG: Symposium on Computational Geometry","start_date":"1990-06-07","end_date":"1990-06-09","location":"Berkeley, CA, United States"},"page":"203 - 210","author":[{"full_name":"Agarwal, Pankaj","first_name":"Pankaj","last_name":"Agarwal"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"first_name":"Otfried","full_name":"Schwarzkopf, Otfried","last_name":"Schwarzkopf"},{"last_name":"Welzl","full_name":"Welzl, Emo","first_name":"Emo"}]},{"scopus_import":"1","year":"1990","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:06:48Z","publication_identifier":{"isbn":["978-0-89791-362-1"]},"publication_status":"published","publist_id":"2045","day":"01","author":[{"last_name":"Aronov","full_name":"Aronov, Boris","first_name":"Boris"},{"last_name":"Chazelle","full_name":"Chazelle, Bernard","first_name":"Bernard"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"},{"first_name":"Rephael","full_name":"Wenger, Rephael","last_name":"Wenger"}],"page":"112 - 115","conference":{"start_date":"1990-06-07","name":"SCG: Symposium on Computational Geometry","location":"Berkley, CA, United States","end_date":"1990-06-09"},"month":"01","extern":"1","quality_controlled":"1","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"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","_id":"4077","publication":"Proceedings of the 6th annual symposium on Computational geometry","publisher":"ACM","title":"Points and triangles in the plane and halving planes in space","date_updated":"2022-02-17T09:42:27Z","doi":"10.1145/98524.98548","oa_version":"None","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/98524.98548"}],"citation":{"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.","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.","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>","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.","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>.","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>.","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>"},"type":"conference","date_published":"1990-01-01T00:00:00Z","status":"public"},{"abstract":[{"lang":"eng","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."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","_id":"4078","publication":"Proceedings of the 6th annual symposium on computational geometry","title":"Slimming down by adding; selecting heavily covered points","doi":"10.1145/98524.98551","date_updated":"2022-02-17T10:09:54Z","publisher":"ACM","month":"01","extern":"1","quality_controlled":"1","type":"conference","date_published":"1990-01-01T00:00:00Z","status":"public","oa_version":"None","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/98524.98551"}],"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>","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.","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>.","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>."},"scopus_import":"1","year":"1990","language":[{"iso":"eng"}],"author":[{"first_name":"Bernard","full_name":"Chazelle, Bernard","last_name":"Chazelle"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"full_name":"Hershberger, John","first_name":"John","last_name":"Hershberger"},{"last_name":"Seidel","first_name":"Raimund","full_name":"Seidel, Raimund"},{"first_name":"Micha","full_name":"Sharir, Micha","last_name":"Sharir"}],"page":"116 - 127","conference":{"end_date":"1990-06-09","location":"Berkley, CA, United States","name":"SCG: Symposium on Computational Geometry","start_date":"1990-06-07"},"date_created":"2018-12-11T12:06:48Z","publication_identifier":{"isbn":["978-0-89791-362-1"]},"publication_status":"published","publist_id":"2046","day":"01"},{"year":"1990","language":[{"iso":"eng"}],"scopus_import":"1","page":"415 - 416","author":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"},{"first_name":"Steve","full_name":"Jones, Steve","last_name":"Jones"}],"day":"02","publication_status":"published","publist_id":"1749","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"date_created":"2018-12-11T12:08:11Z","title":"The language of the genes","publisher":"Nature Publishing Group","doi":"10.1038/346415a0","date_updated":"2022-02-16T10:51:50Z","_id":"4310","publication":"Nature","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","quality_controlled":"1","extern":"1","month":"08","status":"public","date_published":"1990-08-02T00:00:00Z","type":"journal_article","volume":346,"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>.","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>.","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>","short":"N.H. Barton, S. Jones, Nature 346 (1990) 415–416.","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>","ista":"Barton NH, Jones S. 1990. The language of the genes. Nature. 346, 415–416."},"intvolume":"       346","main_file_link":[{"url":"https://www.nature.com/articles/346415a0"}],"article_type":"original","oa_version":"None"},{"month":"01","quality_controlled":"1","extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","doi":"10.1007/978-3-642-74474-7_5","title":"Population structure and processes in evolution","date_updated":"2022-02-16T10:49:05Z","publisher":"Springer","_id":"4311","publication":"Population biology: Ecological and evolutionary viewpoints","oa_version":"None","citation":{"short":"N.H. Barton, A. Clark, in:, K. Wöhrmann, S. Jain (Eds.), Population Biology: Ecological and Evolutionary Viewpoints, Springer, 1990, pp. 115–174.","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.","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>","ista":"Barton NH, Clark A. 1990.Population structure and processes in evolution. In: Population biology: Ecological and evolutionary viewpoints. , 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>.","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>"},"editor":[{"first_name":"Klaus","full_name":"Wöhrmann, Klaus","last_name":"Wöhrmann"},{"last_name":"Jain","first_name":"Subodh","full_name":"Jain, Subodh"}],"main_file_link":[{"url":"https://link.springer.com/book/10.1007/978-3-642-74474-7"}],"date_published":"1990-01-01T00:00:00Z","type":"book_chapter","status":"public","language":[{"iso":"eng"}],"year":"1990","publication_identifier":{"isbn":[" 978-3642744761"]},"date_created":"2018-12-11T12:08:11Z","day":"01","publist_id":"1748","publication_status":"published","author":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"},{"full_name":"Clark, A.","first_name":"A.","last_name":"Clark"}],"page":"115 - 174"},{"scopus_import":"1","language":[{"iso":"eng"}],"year":"1990","publication_identifier":{"isbn":["0-8186-2078-1"]},"date_created":"2018-12-11T12:09:14Z","publication_status":"published","publist_id":"220","day":"01","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Manna","first_name":"Zohar","full_name":"Manna, Zohar"},{"last_name":"Pnueli","full_name":"Pnueli, Amir","first_name":"Amir"}],"page":"717 - 730","conference":{"start_date":"1990-10-22","name":"JCIT: Jerusalem Conference on Information Technology","location":"Jerusalem, Israel","end_date":"1990-10-25"},"month":"01","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).","extern":"1","quality_controlled":"1","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."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","_id":"4510","publication":" Proceedings of the 5th Jerusalem Conference on Information Technology","publisher":"IEEE","doi":"10.1109/JCIT.1990.128356","date_updated":"2022-02-15T15:51:25Z","title":"An interleaving model for real time","oa_version":"None","main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/128356"}],"citation":{"short":"T.A. Henzinger, Z. Manna, A. Pnueli, in:,  Proceedings of the 5th Jerusalem Conference on Information Technology, IEEE, 1990, pp. 717–730.","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.","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.","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>","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>.","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>","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>."},"date_published":"1990-01-01T00:00:00Z","type":"conference","status":"public"},{"acknowledgement":"Many thanks to Rajeev Alur, Adam Grove, Zohar Manna, and Amir Pnueli for their continuous discussions and support.","extern":"1","quality_controlled":"1","month":"01","publication":"Proceedings of the 9th annual ACM symposium on Principles of distributed computing","_id":"4522","doi":"10.1145/93385.93429","publisher":"ACM","date_updated":"2022-02-15T15:11:03Z","title":"Half-order modal logic: How to prove real-time properties","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"}],"article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/93385.93429"}],"citation":{"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>","short":"T.A. Henzinger, in:, Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1990, pp. 281–296.","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.","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>","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>.","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>."},"oa_version":"None","status":"public","type":"conference","date_published":"1990-01-01T00:00:00Z","language":[{"iso":"eng"}],"year":"1990","scopus_import":"1","publication_status":"published","publist_id":"209","day":"01","date_created":"2018-12-11T12:09:17Z","publication_identifier":{"isbn":["978-0-89791-404-8"]},"page":"281 - 296","conference":{"end_date":"1990-08-24","location":"Quebec City, Canada","name":"PODC: Principles of Distributed Computing","start_date":"1990-08-22"},"author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}]},{"scopus_import":"1","year":"1990","language":[{"iso":"eng"}],"author":[{"first_name":"Rajeev","full_name":"Alur, Rajeev","last_name":"Alur"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"conference":{"end_date":"1990-06-07","location":"Philadelphia, PA, USA","name":"LICS: Logic in Computer Science","start_date":"1990-06-04"},"page":"390 - 401","publication_identifier":{"isbn":["0-8186-2073-0"]},"date_created":"2018-12-11T12:09:40Z","day":"06","publist_id":"112","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","abstract":[{"lang":"eng","text":"A unifying framework for the study of real-time logics is developed. In analogy to the untimed case, the underlying classical theory of timed state sequences is identified, it is shown to be nonelementarily decidable, and its complexity and expressiveness are used as a point of reference. Two orthogonal extensions of PTL (timed propositional temporal logic and metric temporal logic) that inherit its appeal are defined: they capture elementary, yet expressively complete, fragments of the theory of timed state sequences, and thus are excellent candidates for practical real-time specification languages"}],"publisher":"IEEE","doi":"10.1109/LICS.1990.113764","title":"Real-time logics: Complexity and expressiveness","date_updated":"2022-02-15T14:35:30Z","_id":"4597","publication":" 5th Annual IEEE Symposium on Logic in Computer Science","month":"08","quality_controlled":"1","extern":"1","date_published":"1990-08-06T00:00:00Z","type":"conference","status":"public","oa_version":"None","citation":{"apa":"Alur, R., &#38; Henzinger, T. A. (1990). Real-time logics: Complexity and expressiveness. In <i> 5th Annual IEEE Symposium on Logic in Computer Science</i> (pp. 390–401). Philadelphia, PA, USA: IEEE. <a href=\"https://doi.org/10.1109/LICS.1990.113764\">https://doi.org/10.1109/LICS.1990.113764</a>","ista":"Alur R, Henzinger TA. 1990. Real-time logics: Complexity and expressiveness.  5th Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 390–401.","ieee":"R. Alur and T. A. Henzinger, “Real-time logics: Complexity and expressiveness,” in <i> 5th Annual IEEE Symposium on Logic in Computer Science</i>, Philadelphia, PA, USA, 1990, pp. 390–401.","short":"R. Alur, T.A. Henzinger, in:,  5th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1990, pp. 390–401.","mla":"Alur, Rajeev, and Thomas A. Henzinger. “Real-Time Logics: Complexity and Expressiveness.” <i> 5th Annual IEEE Symposium on Logic in Computer Science</i>, IEEE, 1990, pp. 390–401, doi:<a href=\"https://doi.org/10.1109/LICS.1990.113764\">10.1109/LICS.1990.113764</a>.","ama":"Alur R, Henzinger TA. Real-time logics: Complexity and expressiveness. In: <i> 5th Annual IEEE Symposium on Logic in Computer Science</i>. IEEE; 1990:390-401. doi:<a href=\"https://doi.org/10.1109/LICS.1990.113764\">10.1109/LICS.1990.113764</a>","chicago":"Alur, Rajeev, and Thomas A Henzinger. “Real-Time Logics: Complexity and Expressiveness.” In <i> 5th Annual IEEE Symposium on Logic in Computer Science</i>, 390–401. IEEE, 1990. <a href=\"https://doi.org/10.1109/LICS.1990.113764\">https://doi.org/10.1109/LICS.1990.113764</a>."},"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/113764"}]},{"language":[{"iso":"eng"}],"year":"1990","author":[{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"},{"last_name":"Yokota","full_name":"Yokota, Yoshifumi","first_name":"Yoshifumi"},{"full_name":"Tsuchida, Kunihiro","first_name":"Kunihiro","last_name":"Tsuchida"},{"last_name":"Nakanishi","first_name":"Shigetada","full_name":"Nakanishi, Shigetada"}],"page":"623 - 628","date_created":"2018-12-11T11:57:55Z","day":"15","publist_id":"4421","publication_status":"published","article_processing_charge":"No","publisher":"American Society for Biochemistry and Molecular Biology","doi":"10.1016/s0021-9258(19)40095-1 ","date_updated":"2022-02-24T11:07:05Z","publication":"Journal of Biological Chemistry","month":"01","oa":1,"quality_controlled":"1","extern":"1","type":"journal_article","date_published":"1990-01-15T00:00:00Z","volume":265,"article_type":"original","oa_version":"Published Version","external_id":{"pmid":["2153106 "]},"scopus_import":"1","issue":"2","publication_identifier":{"eissn":["1083-351X"],"issn":["0021-9258"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"Functional cDNA clones for rat neuromedin K receptor were isolated from a rat brain cDNA library by cross-hybridization with the bovine substance K recepor cDNA. Injection of the mRNA synthesized in vitro from the cloned cDNA into Xenopus oocytes elicited electrophysiological responses to tachykinins, with the most potent sensitivity being to neuromedin K. Ligand-binding displacement in membranes of mammalian COS cells transfected with the cDNA indicated the rank order of affinity of the receptor to tachykinins; neuromedin K &gt; substance K &gt; substance P. The hybridization analysis showed that the neuromedin K receptor mRNA is expressed in both the brain and the peripheral tissues at different levels. The rat neuromedin K receptor consists of 452 amino acid residues and belongs to the family of G protein-coupled receptors, which are thought to have seven transmembrane domains. The sequence comparison of the rat neuromedin K, substance P, and substance K receptors revealed that these receptors are highly conserved in the seven transmembrane domains and the cytoplasmic sides of the receptors. They also show some structural characteristics, including the common presence of histidine residues in transmembrane segments V and VI and the difference in the numbers and distributions of serine and threonine residues as possible phosphorylation sites in the cytoplasmic regions. This paper thus presents the first comprehensive analysis of the molecular nature of the multiple peptide receptors that exhibit similar but pharmacologically distinguishable activities.","lang":"eng"}],"title":"Cloning and expression of a rat neuromedin K receptor cDNA","_id":"2480","pmid":1,"acknowledgement":"This work was supported in part by research grants from the Ministry 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 USC. Section 1734 solely to indicate this fact.","status":"public","intvolume":"       265","citation":{"ista":"Shigemoto R, Yokota Y, Tsuchida K, Nakanishi S. 1990. Cloning and expression of a rat neuromedin K receptor cDNA. Journal of Biological Chemistry. 265(2), 623–628.","apa":"Shigemoto, R., Yokota, Y., Tsuchida, K., &#38; Nakanishi, S. (1990). Cloning and expression of a rat neuromedin K receptor cDNA. <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/10.1016/s0021-9258(19)40095-1 \">https://doi.org/10.1016/s0021-9258(19)40095-1 </a>","short":"R. Shigemoto, Y. Yokota, K. Tsuchida, S. Nakanishi, Journal of Biological Chemistry 265 (1990) 623–628.","ieee":"R. Shigemoto, Y. Yokota, K. Tsuchida, and S. Nakanishi, “Cloning and expression of a rat neuromedin K receptor cDNA,” <i>Journal of Biological Chemistry</i>, vol. 265, no. 2. American Society for Biochemistry and Molecular Biology, pp. 623–628, 1990.","ama":"Shigemoto R, Yokota Y, Tsuchida K, Nakanishi S. Cloning and expression of a rat neuromedin K receptor cDNA. <i>Journal of Biological Chemistry</i>. 1990;265(2):623-628. doi:<a href=\"https://doi.org/10.1016/s0021-9258(19)40095-1 \">10.1016/s0021-9258(19)40095-1 </a>","mla":"Shigemoto, Ryuichi, et al. “Cloning and Expression of a Rat Neuromedin K Receptor CDNA.” <i>Journal of Biological Chemistry</i>, vol. 265, no. 2, American Society for Biochemistry and Molecular Biology, 1990, pp. 623–28, doi:<a href=\"https://doi.org/10.1016/s0021-9258(19)40095-1 \">10.1016/s0021-9258(19)40095-1 </a>.","chicago":"Shigemoto, Ryuichi, Yoshifumi Yokota, Kunihiro Tsuchida, and Shigetada Nakanishi. “Cloning and Expression of a Rat Neuromedin K Receptor CDNA.” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 1990. <a href=\"https://doi.org/10.1016/s0021-9258(19)40095-1 \">https://doi.org/10.1016/s0021-9258(19)40095-1 </a>."},"main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0021925819400951"}]},{"type":"journal_article","date_published":"1990-03-03T00:00:00Z","volume":193,"oa_version":"Published Version","article_type":"original","external_id":{"pmid":["1701145"]},"article_processing_charge":"No","date_updated":"2022-02-24T10:20:14Z","doi":"10.1111/j.1432-1033.1990.tb19396.x","publisher":"Wiley-Blackwell","publication":"European Journal of Biochemistry","month":"03","oa":1,"quality_controlled":"1","extern":"1","author":[{"last_name":"Tsuchida","first_name":"Kunihiro","full_name":"Tsuchida, Kunihiro"},{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Yokota","first_name":"Yoshifumi","full_name":"Yokota, Yoshifumi"},{"first_name":"Shigetada","full_name":"Nakanishi, Shigetada","last_name":"Nakanishi"}],"page":"751 - 757","date_created":"2018-12-11T11:57:55Z","day":"03","publication_status":"published","publist_id":"4420","language":[{"iso":"eng"}],"year":"1990","status":"public","citation":{"apa":"Tsuchida, K., Shigemoto, R., Yokota, Y., &#38; Nakanishi, S. (1990). Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors. <i>European Journal of Biochemistry</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1432-1033.1990.tb19396.x\">https://doi.org/10.1111/j.1432-1033.1990.tb19396.x</a>","ista":"Tsuchida K, Shigemoto R, Yokota Y, Nakanishi S. 1990. Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors. European Journal of Biochemistry. 193(3), 751–757.","ieee":"K. Tsuchida, R. Shigemoto, Y. Yokota, and S. Nakanishi, “Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors,” <i>European Journal of Biochemistry</i>, vol. 193, no. 3. Wiley-Blackwell, pp. 751–757, 1990.","short":"K. Tsuchida, R. Shigemoto, Y. Yokota, S. Nakanishi, European Journal of Biochemistry 193 (1990) 751–757.","mla":"Tsuchida, Kunihiro, et al. “Tissue Distribution and Quantitation of the MRNAs for Three Rat Tachykinin Receptors.” <i>European Journal of Biochemistry</i>, vol. 193, no. 3, Wiley-Blackwell, 1990, pp. 751–57, doi:<a href=\"https://doi.org/10.1111/j.1432-1033.1990.tb19396.x\">10.1111/j.1432-1033.1990.tb19396.x</a>.","ama":"Tsuchida K, Shigemoto R, Yokota Y, Nakanishi S. Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors. <i>European Journal of Biochemistry</i>. 1990;193(3):751-757. doi:<a href=\"https://doi.org/10.1111/j.1432-1033.1990.tb19396.x\">10.1111/j.1432-1033.1990.tb19396.x</a>","chicago":"Tsuchida, Kunihiro, Ryuichi Shigemoto, Yoshifumi Yokota, and Shigetada Nakanishi. “Tissue Distribution and Quantitation of the MRNAs for Three Rat Tachykinin Receptors.” <i>European Journal of Biochemistry</i>. Wiley-Blackwell, 1990. <a href=\"https://doi.org/10.1111/j.1432-1033.1990.tb19396.x\">https://doi.org/10.1111/j.1432-1033.1990.tb19396.x</a>."},"intvolume":"       193","main_file_link":[{"url":"https://febs.onlinelibrary.wiley.com/doi/10.1111/j.1432-1033.1990.tb19396.x","open_access":"1"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"The family of mammalian tachykinin receptors consists of substance P receptor (SPR), neuromedin K receptor (NKR) and substance K receptor (SKR). In this investigation, tissue and regional distributions of the mRNAs for the three rat tachykinin receptors were investigated by blot-hybridization and RNase-protection analyses using the previously cloned receptor cDNAs. SPR mRNA is widely distributed in both the nervous system and peripheral tissues and is expressed abundantly in the hypothalamus and olfactory buld, as well as in the urinary bladder, salivary glands and small and large intestines. In contrast, NKR mRNA is predominantly expressed in the nervous system, particularly in the cortex, hypothalamus and cerebellum, whereas SKR mRNA expression is restricted to the peripheral tissues, being abundant in the urinary bladder, large intestine, stomach and adenal glands. Thus, the mRNAs for the three tachykinin receptors show distinct patterns of expression between the nervous system and peripheral tissues. Blot-hybridization analysis in combination with S1 nuclease protection and primer-extension analyses revealed that there are two large forms of SKR mRNA expressed commonly in the peripheral tissues, and two additional small forms of the mRNA expressed specifically in the adrenal gland and eye. These analyses also showed that the multiple forms of SKR mRNA differ in the lengths of the 5' mRNA portions, and that the two small forms of the mRNA, if translated, encode a truncated SKR polypeptide lacking the first two transmembrane domains. This investigation thus provides the comprehensive analysis of the distribution and mode of expression of the mRNAs for the multiple peptide receptors and offers a new basis on which to interpret the diverse functions of multiple tachykinin peptides in the CNS and peripheral tissues."}],"title":"Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors","_id":"2481","pmid":1,"acknowledgement":"This work was supported in part by research grants from  the Ministry of Education, Science and Culture of Japan, the Ministry of Health  and Welfare of Japan, and the Yamanouchi Foundation for Research on Metabolic Disorders","issue":"3","publication_identifier":{"eissn":["1432-1033"],"issn":["0014-2956"]},"scopus_import":"1"},{"citation":{"short":"T. Sugimoto, Y. Tanabe, R. Shigemoto, M. Iwai, T. Takumi, H. Ohkubo, S. Nakanishi, Journal of Membrane Biology 113 (1990) 39–47.","ieee":"T. Sugimoto <i>et al.</i>, “Immunohistochemical study of a rat membrane protein which induces a selective potassium permeation: Its localization in the apical membrane portion of epithelial cells,” <i>Journal of Membrane Biology</i>, vol. 113, no. 1. Springer, pp. 39–47, 1990.","ista":"Sugimoto T, Tanabe Y, Shigemoto R, Iwai M, Takumi T, Ohkubo H, Nakanishi S. 1990. Immunohistochemical study of a rat membrane protein which induces a selective potassium permeation: Its localization in the apical membrane portion of epithelial cells. Journal of Membrane Biology. 113(1), 39–47.","apa":"Sugimoto, T., Tanabe, Y., Shigemoto, R., Iwai, M., Takumi, T., Ohkubo, H., &#38; Nakanishi, S. (1990). Immunohistochemical study of a rat membrane protein which induces a selective potassium permeation: Its localization in the apical membrane portion of epithelial cells. <i>Journal of Membrane Biology</i>. Springer. <a href=\"https://doi.org/10.1007/BF01869604\">https://doi.org/10.1007/BF01869604</a>","chicago":"Sugimoto, Tetsuo, Yasuto Tanabe, Ryuichi Shigemoto, Masazumi Iwai, Toru Takumi, Hiroaki Ohkubo, and Shigetada Nakanishi. “Immunohistochemical Study of a Rat Membrane Protein Which Induces a Selective Potassium Permeation: Its Localization in the Apical Membrane Portion of Epithelial Cells.” <i>Journal of Membrane Biology</i>. Springer, 1990. <a href=\"https://doi.org/10.1007/BF01869604\">https://doi.org/10.1007/BF01869604</a>.","ama":"Sugimoto T, Tanabe Y, Shigemoto R, et al. Immunohistochemical study of a rat membrane protein which induces a selective potassium permeation: Its localization in the apical membrane portion of epithelial cells. <i>Journal of Membrane Biology</i>. 1990;113(1):39-47. doi:<a href=\"https://doi.org/10.1007/BF01869604\">10.1007/BF01869604</a>","mla":"Sugimoto, Tetsuo, et al. “Immunohistochemical Study of a Rat Membrane Protein Which Induces a Selective Potassium Permeation: Its Localization in the Apical Membrane Portion of Epithelial Cells.” <i>Journal of Membrane Biology</i>, vol. 113, no. 1, Springer, 1990, pp. 39–47, doi:<a href=\"https://doi.org/10.1007/BF01869604\">10.1007/BF01869604</a>."},"intvolume":"       113","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01869604"}],"status":"public","pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"We previously reported a novel rat membrane protein that exhibits a voltage-dependent potassium channel activity on the basis of molecular cloning combined with an electrophysiological assay. This protein, termed I(sK) protein, is small and different from the conventional potassium channel proteins but induces selective permeation of potassium ions on its expression in Xenopus oocytes. In this investigation, we examined cellular localization of rat I(sK) protein by preparing three different types of antibody that specifically reacts with a distinct part of rat I(sK) protein. Immunohistochemical analysis using these antibody preparations demonstrated that rat I(sK) protein is confined to the apical membrane portion of epithelial cells in the proximal tubule of the kidney, the submandibular duct and the uterine endometrium. The observed tissue distribution of rat I(sK) protein was consistent with that of the I(sK) protein mRNA determined by blot hybridization analysis. In epithelial cells, the sodium, potassium-ATPase pump in the basolateral membrane generates a sodium gradient across the epithelial cell and allows sodium ions to enter the cell through the apical membrane. Thus, taking into account the cellular localization of the I(sK) protein, together with its electrophysiological properties, we discussed a possible function of the I(sK) protein, namely that this protein is involved in potassium permeation in the apical membrane of epithelial cells through the depolarizing effect of sodium entry.","lang":"eng"}],"title":"Immunohistochemical study of a rat membrane protein which induces a selective potassium permeation: Its localization in the apical membrane portion of epithelial cells","_id":"2528","publication_identifier":{"issn":["0022-2631"],"eissn":["1432-1424"]},"issue":"1","scopus_import":"1","oa_version":"None","article_type":"original","external_id":{"pmid":["2154581"]},"type":"journal_article","date_published":"1990-01-01T00:00:00Z","volume":113,"month":"01","quality_controlled":"1","extern":"1","article_processing_charge":"No","doi":"10.1007/BF01869604","publisher":"Springer","date_updated":"2022-02-24T09:55:39Z","publication":"Journal of Membrane Biology","date_created":"2018-12-11T11:58:12Z","day":"01","publist_id":"4371","publication_status":"published","author":[{"first_name":"Tetsuo","full_name":"Sugimoto, Tetsuo","last_name":"Sugimoto"},{"first_name":"Yasuto","full_name":"Tanabe, Yasuto","last_name":"Tanabe"},{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"},{"last_name":"Iwai","full_name":"Iwai, Masazumi","first_name":"Masazumi"},{"full_name":"Takumi, Toru","first_name":"Toru","last_name":"Takumi"},{"last_name":"Ohkubo","full_name":"Ohkubo, Hiroaki","first_name":"Hiroaki"},{"first_name":"Shigetada","full_name":"Nakanishi, Shigetada","last_name":"Nakanishi"}],"page":"39 - 47","year":"1990","language":[{"iso":"eng"}]},{"status":"public","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01334766"}],"citation":{"apa":"Erdös, L., &#38; Tuyen, D. (1990). Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier. <i>Journal of Statistical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/BF01334766\">https://doi.org/10.1007/BF01334766</a>","ista":"Erdös L, Tuyen D. 1990. Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier. Journal of Statistical Physics. 59(5–6), 1589–1602.","short":"L. Erdös, D. Tuyen, Journal of Statistical Physics 59 (1990) 1589–1602.","ieee":"L. Erdös and D. Tuyen, “Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier,” <i>Journal of Statistical Physics</i>, vol. 59, no. 5–6. Springer, pp. 1589–1602, 1990.","mla":"Erdös, László, and Dao Tuyen. “Ergodic Properties of the Multidimensional Rayleigh Gas with a Semipermeable Barrier.” <i>Journal of Statistical Physics</i>, vol. 59, no. 5–6, Springer, 1990, pp. 1589–602, doi:<a href=\"https://doi.org/10.1007/BF01334766\">10.1007/BF01334766</a>.","ama":"Erdös L, Tuyen D. Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier. <i>Journal of Statistical Physics</i>. 1990;59(5-6):1589-1602. doi:<a href=\"https://doi.org/10.1007/BF01334766\">10.1007/BF01334766</a>","chicago":"Erdös, László, and Dao Tuyen. “Ergodic Properties of the Multidimensional Rayleigh Gas with a Semipermeable Barrier.” <i>Journal of Statistical Physics</i>. Springer, 1990. <a href=\"https://doi.org/10.1007/BF01334766\">https://doi.org/10.1007/BF01334766</a>."},"intvolume":"        59","abstract":[{"lang":"eng","text":"We consider a multidimensional system consisting of a particle of mass M and radius r (molecule), surrounded by an infinite ideal gas of point particles of mass m (atoms). The molecule is confined to the unit ball and interacts with its boundary (barrier) via elastic collision, while the atoms are not affected by the boundary. We obtain convergence to equilibrium for the molecule from almost every initial distribution on its position and velocity. Furthermore, we prove that the infinite composite system of the molecule and the atoms is Bernoulli."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"2721","title":"Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier","issue":"5-6","publication_identifier":{"eissn":["1572-9613"],"issn":["0022-4715"]},"scopus_import":"1","volume":59,"date_published":"1990-06-01T00:00:00Z","type":"journal_article","article_type":"original","oa_version":"None","article_processing_charge":"No","publication":"Journal of Statistical Physics","doi":"10.1007/BF01334766","publisher":"Springer","date_updated":"2022-02-24T09:39:29Z","month":"06","extern":"1","quality_controlled":"1","author":[{"orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"Erdös, László","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tuyen","full_name":"Tuyen, Dao","first_name":"Dao"}],"page":"1589 - 1602","date_created":"2018-12-11T11:59:15Z","publist_id":"4171","publication_status":"published","day":"01","language":[{"iso":"eng"}],"year":"1990"},{"volume":112,"date_published":"1989-12-01T00:00:00Z","type":"journal_article","oa_version":"None","article_type":"original","external_id":{"pmid":["2559205 "]},"article_processing_charge":"No","publication":"Journal of Membrane Biology","publisher":"Springer","date_updated":"2022-02-15T08:59:02Z","doi":"10.1007/BF01870958","month":"12","extern":"1","quality_controlled":"1","author":[{"last_name":"Jonas","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","full_name":"Jonas, Peter M"}],"page":"277 - 289","date_created":"2018-12-11T12:03:28Z","publication_status":"published","publist_id":"2922","day":"01","language":[{"iso":"eng"}],"year":"1989","status":"public","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01870958"}],"citation":{"ista":"Jonas PM. 1989. Temperature dependence of gating current in myelinated nerve fibers. Journal of Membrane Biology. 112(3), 277–289.","apa":"Jonas, P. M. (1989). Temperature dependence of gating current in myelinated nerve fibers. <i>Journal of Membrane Biology</i>. Springer. <a href=\"https://doi.org/10.1007/BF01870958\">https://doi.org/10.1007/BF01870958</a>","short":"P.M. Jonas, Journal of Membrane Biology 112 (1989) 277–289.","ieee":"P. M. Jonas, “Temperature dependence of gating current in myelinated nerve fibers,” <i>Journal of Membrane Biology</i>, vol. 112, no. 3. Springer, pp. 277–289, 1989.","ama":"Jonas PM. Temperature dependence of gating current in myelinated nerve fibers. <i>Journal of Membrane Biology</i>. 1989;112(3):277-289. doi:<a href=\"https://doi.org/10.1007/BF01870958\">10.1007/BF01870958</a>","mla":"Jonas, Peter M. “Temperature Dependence of Gating Current in Myelinated Nerve Fibers.” <i>Journal of Membrane Biology</i>, vol. 112, no. 3, Springer, 1989, pp. 277–89, doi:<a href=\"https://doi.org/10.1007/BF01870958\">10.1007/BF01870958</a>.","chicago":"Jonas, Peter M. “Temperature Dependence of Gating Current in Myelinated Nerve Fibers.” <i>Journal of Membrane Biology</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF01870958\">https://doi.org/10.1007/BF01870958</a>."},"intvolume":"       112","abstract":[{"lang":"eng","text":"Asymmetrical displacement currents and Na currents of single myelinated nerve fibers of Xenopus laevis were studied in the temperature range from 5 to 24 degrees C. The time constant of the on-response at E = 4 mV, tau on, was strongly temperature dependent, whereas the amount of displaced charge at E = 39 mV, Qon, was only slightly temperature dependent. The mean Q10 for tau on-1 was 2.54, the mean Q10 for Qon was 1.07. The time constant of charge immobilization, tau i, at E = 4 mV varied significantly (alpha = 0.001) with temperature. The mean Q10 for tau i-1 was 2.71 +/- 0.38. The time constants of immobilization of gating charge and of fast inactivation of Na permeability were similar in the temperature range from 6 to 22 degrees C. The Qoff/Qon ratio for E = 4 mV pulses of 0.5 msec duration decreased with increasing temperature. The temperature dependence of the time constant of the off-response could not be described by a single Q10 value, since the Q10 depended on the duration of the test pulse. Increasing temperature shifted Qon (E) curves to more negative potentials by 0.51 mV K-1, but shifted PNa (E) curves and h infinity (E) curves to more positive potentials by 0.43 and 0.57 mV K-1, respectively. h infinity (E = -70 mV) increased monotonously with increasing temperature. The present data indicate that considerable entropy changes may occur when the Na channel molecule passes from closed through open to inactivated states."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"3465","title":"Temperature dependence of gating current in myelinated nerve fibers","pmid":1,"issue":"3","publication_identifier":{"eissn":["1432-1424"],"issn":["0022-2631"]},"scopus_import":"1"},{"issue":"18","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"status":"public","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC298032/?tool=pubmed"}],"citation":{"ista":"Jonas PM, Bräu M, Hermsteiner M, Vogel W. 1989. Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels. PNAS. 86(18), 7238–7242.","apa":"Jonas, P. M., Bräu, M., Hermsteiner, M., &#38; Vogel, W. (1989). Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.86.18.7238\">https://doi.org/10.1073/pnas.86.18.7238</a>","short":"P.M. Jonas, M. Bräu, M. Hermsteiner, W. Vogel, PNAS 86 (1989) 7238–7242.","ieee":"P. M. Jonas, M. Bräu, M. Hermsteiner, and W. Vogel, “Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels,” <i>PNAS</i>, vol. 86, no. 18. National Academy of Sciences, pp. 7238–7242, 1989.","ama":"Jonas PM, Bräu M, Hermsteiner M, Vogel W. Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels. <i>PNAS</i>. 1989;86(18):7238-7242. doi:<a href=\"https://doi.org/10.1073/pnas.86.18.7238\">10.1073/pnas.86.18.7238</a>","mla":"Jonas, Peter M., et al. “Single-Channel Recording in Myelinated Nerve Fibers Reveals One Type of Na Channel but Different K Channels.” <i>PNAS</i>, vol. 86, no. 18, National Academy of Sciences, 1989, pp. 7238–42, doi:<a href=\"https://doi.org/10.1073/pnas.86.18.7238\">10.1073/pnas.86.18.7238</a>.","chicago":"Jonas, Peter M, Michael Bräu, Markus Hermsteiner, and Werner Vogel. “Single-Channel Recording in Myelinated Nerve Fibers Reveals One Type of Na Channel but Different K Channels.” <i>PNAS</i>. National Academy of Sciences, 1989. <a href=\"https://doi.org/10.1073/pnas.86.18.7238\">https://doi.org/10.1073/pnas.86.18.7238</a>."},"intvolume":"        86","abstract":[{"lang":"eng","text":"Amphibian myelinated nerve fibers were treated with collagenase and protease. Axons with retraction of the myelin sheath were patch-clamped in the nodal and paranodal region. One type of Na channel was found. It has a single-channel conductance of 11 pS (15 degrees C) and is blocked by tetrodotoxin. Averaged events show the typical activation and inactivation kinetics of macroscopic Na current. Three potential-dependent K channels were identified (I, F, and S channel). The I channel, being the most frequent type, has a single-channel conductance of 23 pS (inward current, 105 mM K on both sides of the membrane), activates between -60 and -30 mV, deactivates with intermediate kinetics, and is sensitive to dendrotoxin. The F channel has a conductance of 30 pS, activates between -40 and 60 mV, and deactivates with fast kinetics. The former inactivates within tens of seconds; the latter inactivates within seconds. The third type, the S channel, has a conductance of 7 pS and deactivates slowly. All three channels can be blocked by external tetraethylammonium chloride. We suggest that these distinct K channel types form the basis for the different components of macroscopic K current described previously."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"3466","title":"Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels","pmid":1,"acknowledgement":"We thank Drs. C. Baumann, D. Siemen, and W. Stuhmer for reading the manuscript and Dr. F. Dreyer for the generous gift of DTX. The study was supported by the Deutsche Forschungsgemeinschaft.","author":[{"full_name":"Jonas, Peter M","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","orcid":"0000-0001-5001-4804"},{"full_name":"Bräu, Michael","first_name":"Michael","last_name":"Bräu"},{"first_name":"Markus","full_name":"Hermsteiner, Markus","last_name":"Hermsteiner"},{"last_name":"Vogel","full_name":"Vogel, Werner","first_name":"Werner"}],"page":"7238 - 7242","date_created":"2018-12-11T12:03:28Z","publication_status":"published","publist_id":"2921","day":"01","year":"1989","language":[{"iso":"eng"}],"volume":86,"date_published":"1989-09-01T00:00:00Z","type":"journal_article","oa_version":"Published Version","external_id":{"pmid":["2550937 "]},"article_type":"original","article_processing_charge":"No","publication":"PNAS","date_updated":"2022-02-14T16:12:33Z","doi":"10.1073/pnas.86.18.7238","publisher":"National Academy of Sciences","month":"09","extern":"1","oa":1,"quality_controlled":"1"},{"language":[{"iso":"eng"}],"year":"1989","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"conference":{"name":"International Workshop on Discrete Algorithms and Complexity"},"page":"83 - 89","date_created":"2018-12-11T12:03:54Z","day":"01","publication_status":"published","publist_id":"2836","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We study three types of spatial triangulations: Delaunay triangulations, triangulations with non-obtuse dihedral angles, and KJ-triangulations. The latter satisfy a certain angle condition useful for finite element approximation. We show that the condition for Delaunay triangulations is incomparable with the other two conditions, and that triangulations with non-obtuse dihedral angles are necessarily also KJ-triangulations. These relationships are in sharp contrast to the ones in the planar case. "}],"publisher":"Institute of the Electronics, Information and Communication Enginneers","date_updated":"2022-02-14T14:34:06Z","title":"Spatial triangulations with dihedral angle conditions","_id":"3549","month":"01","quality_controlled":"1","acknowledgement":"Research was supported by the National Science Foundation under grant CCR-8714565.  The author thanks Thomas Kerkhoven, Raimund Seidel, and Peter Shor for helpful discussions on the material of this paper. ","extern":"1","date_published":"1989-01-01T00:00:00Z","type":"conference","status":"public","oa_version":"None","citation":{"ieee":"H. Edelsbrunner, “Spatial triangulations with dihedral angle conditions,” presented at the International Workshop on Discrete Algorithms and Complexity, 1989, pp. 83–89.","short":"H. Edelsbrunner, in:, Institute of the Electronics, Information and Communication Enginneers, 1989, pp. 83–89.","apa":"Edelsbrunner, H. (1989). Spatial triangulations with dihedral angle conditions (pp. 83–89). Presented at the International Workshop on Discrete Algorithms and Complexity, Institute of the Electronics, Information and Communication Enginneers.","ista":"Edelsbrunner H. 1989. Spatial triangulations with dihedral angle conditions. International Workshop on Discrete Algorithms and Complexity, 83–89.","chicago":"Edelsbrunner, Herbert. “Spatial Triangulations with Dihedral Angle Conditions,” 83–89. Institute of the Electronics, Information and Communication Enginneers, 1989.","mla":"Edelsbrunner, Herbert. <i>Spatial Triangulations with Dihedral Angle Conditions</i>. Institute of the Electronics, Information and Communication Enginneers, 1989, pp. 83–89.","ama":"Edelsbrunner H. Spatial triangulations with dihedral angle conditions. In: Institute of the Electronics, Information and Communication Enginneers; 1989:83-89."},"main_file_link":[{"url":"https://ipsj.ixsq.nii.ac.jp/ej/?action=pages_view_main&active_action=repository_view_main_item_detail&item_id=32670&item_no=1&page_id=13&block_id=8"}]},{"language":[{"iso":"eng"}],"year":"1989","author":[{"full_name":"Mallet, James","first_name":"James","last_name":"Mallet"},{"last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"page":"967 - 976","date_created":"2018-12-11T12:04:27Z","day":"01","publication_status":"published","publist_id":"2731","article_processing_charge":"No","date_updated":"2022-02-14T14:07:12Z","doi":"10.1093/genetics/122.4.967","publisher":"Genetics Society of America","publication":"Genetics","month":"08","oa":1,"quality_controlled":"1","extern":"1","date_published":"1989-08-01T00:00:00Z","type":"journal_article","volume":122,"external_id":{"pmid":["2759433"]},"oa_version":"None","article_type":"original","scopus_import":"1","issue":"4","publication_identifier":{"issn":["0016-6731"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Frequency-dependent selection against rare forms can maintain clines. For weak selection, s, in simple linear models of frequency-dependence, single locus clines are stabilized with a maximum slope of between square root of s/square root of 8 sigma and square root of s/square root of 12 delta, where sigma is the dispersal distance. These clines are similar to those maintained by heterozygote disadvantage. Using computer simulations, the weak-selection analytical results are extended to higher selection pressures with up to three unlinked genes. Graphs are used to display the effect of selection, migration, dominance, and number of loci on cline widths, speeds of cline movements, two-way gametic correlations (\"linkage disequilibria\"), and heterozygote deficits. The effects of changing the order of reproduction, migration, and selection, are also briefly explored. Epistasis can also maintain tension zones. We show that epistatic selection is similar in its effects to frequency-dependent selection, except that the disequilibria produced in the zone will be higher for a given level of selection. If selection consists of a mixture of frequency-dependence and epistasis, as is likely in nature, the error made in estimating selection is usually less than twofold. From the graphs, selection and migration can be estimated using knowledge of the dominance and number of genes, of gene frequencies and of gametic correlations from a hybrid zone."}],"title":"Inference from clines stabilized by frequency-dependent selection","_id":"3652","pmid":1,"acknowledgement":"The publication costs of this article were partly defrayed by the payment of page charges. This article must therefore be hereby marked “advertisment” in accordance with 18 U.S.C. §1734 solely to indicate this fact. \r\n\r\nWe thank the Natural Environmental Research Council for financial support, and N. SANDERSON, M. SLATKIN and an anonymous reviewer for comments on the manuscript.","status":"public","intvolume":"       122","citation":{"ista":"Mallet J, Barton NH. 1989. Inference from clines stabilized by frequency-dependent selection. Genetics. 122(4), 967–976.","apa":"Mallet, J., &#38; Barton, N. H. (1989). Inference from clines stabilized by frequency-dependent selection. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1093/genetics/122.4.967\">https://doi.org/10.1093/genetics/122.4.967</a>","short":"J. Mallet, N.H. Barton, Genetics 122 (1989) 967–976.","ieee":"J. Mallet and N. H. Barton, “Inference from clines stabilized by frequency-dependent selection,” <i>Genetics</i>, vol. 122, no. 4. Genetics Society of America, pp. 967–976, 1989.","ama":"Mallet J, Barton NH. Inference from clines stabilized by frequency-dependent selection. <i>Genetics</i>. 1989;122(4):967-976. doi:<a href=\"https://doi.org/10.1093/genetics/122.4.967\">10.1093/genetics/122.4.967</a>","mla":"Mallet, James, and Nicholas H. Barton. “Inference from Clines Stabilized by Frequency-Dependent Selection.” <i>Genetics</i>, vol. 122, no. 4, Genetics Society of America, 1989, pp. 967–76, doi:<a href=\"https://doi.org/10.1093/genetics/122.4.967\">10.1093/genetics/122.4.967</a>.","chicago":"Mallet, James, and Nicholas H Barton. “Inference from Clines Stabilized by Frequency-Dependent Selection.” <i>Genetics</i>. Genetics Society of America, 1989. <a href=\"https://doi.org/10.1093/genetics/122.4.967\">https://doi.org/10.1093/genetics/122.4.967</a>."},"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1203771"}]}]