[{"extern":"1","abstract":[{"text":"A method is developed that describes the effects on an arbitrary number of autosomal loci of selection on haploid and diploid stages, of nonrandom mating between haploid individuals, and of recombination. We provide exact recursions for the dynamics of allele frequencies and linkage disequilibria (nonrandom associations of alleles across loci). When selection is weak relative to recombination, our recursions provide simple approximations for the linkage disequilibria among arbitrary combinations of loci. We show how previous models of sex-independent natural selection on diploids, assortative mating between haploids, and sexual selection on haploids can be analyzed in this framework. Using our weak-selection approximations, we derive new results concerning the coevolution of male traits and female preferences under natural and sexual selection. In particular, we provide general expressions for the intensity of linkage-disequilibrium induced selection experienced by loci that contribute to female preferences for specific male traits. Our general results support the previous observation that these indirect selection forces are so weak that they are unlikely to dominate the evolution of preference-producing loci.","lang":"eng"}],"publist_id":"2736","date_created":"2018-12-11T12:04:25Z","oa_version":"None","publisher":"Genetics Society of America","publication":"Genetics","title":"Natural and sexual selection on many loci","publication_identifier":{"issn":["0016-6731"]},"citation":{"chicago":"Barton, Nicholas H, and Michael Turelli. “Natural and Sexual Selection on Many Loci.” <i>Genetics</i>. Genetics Society of America, 1991. <a href=\"https://doi.org/10.1093/genetics/127.1.229\">https://doi.org/10.1093/genetics/127.1.229</a>.","ieee":"N. H. Barton and M. Turelli, “Natural and sexual selection on many loci,” <i>Genetics</i>, vol. 127, no. 1. Genetics Society of America, pp. 229–255, 1991.","apa":"Barton, N. H., &#38; Turelli, M. (1991). Natural and sexual selection on many loci. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1093/genetics/127.1.229\">https://doi.org/10.1093/genetics/127.1.229</a>","ama":"Barton NH, Turelli M. Natural and sexual selection on many loci. <i>Genetics</i>. 1991;127(1):229-255. doi:<a href=\"https://doi.org/10.1093/genetics/127.1.229\">10.1093/genetics/127.1.229</a>","short":"N.H. Barton, M. Turelli, Genetics 127 (1991) 229–255.","ista":"Barton NH, Turelli M. 1991. Natural and sexual selection on many loci. Genetics. 127(1), 229–255.","mla":"Barton, Nicholas H., and Michael Turelli. “Natural and Sexual Selection on Many Loci.” <i>Genetics</i>, vol. 127, no. 1, Genetics Society of America, 1991, pp. 229–55, doi:<a href=\"https://doi.org/10.1093/genetics/127.1.229\">10.1093/genetics/127.1.229</a>."},"issue":"1","external_id":{"pmid":["2016044"]},"article_type":"original","acknowledgement":"BENGT OLLE BENGTSSON, JERRY COYNE, RICHARD GOMULKIEWICZ, CHUCK LANGLEY, LINDA PARTRIDGE, MONTY SLATKIN, and NEAL TAYLOR gave helpful comments on preliminary versions, which are gratefully acknowledged. We are particularly indebted to DICK HUDSON, MARK KIRKPATRICK and TOM NAGYLAKI for\r\nhelping to eliminate many obscurities. This work was supported by the Science and Engineering Research Council (GR/C/91529, GR/E/08507), the National Science Foundation (BSR-8866548), the Institute of Theoretical Dynamics and the Center for Population Biology at the University of California, Davis, and by the Swedish Natural Science Research Council. ","status":"public","year":"1991","_id":"3647","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":127,"page":"229 - 255","quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","date_updated":"2022-03-02T15:23:02Z","doi":"10.1093/genetics/127.1.229","date_published":"1991-01-01T00:00:00Z","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"},{"first_name":"Michael","last_name":"Turelli","full_name":"Turelli, Michael"}],"month":"01","language":[{"iso":"eng"}],"day":"01","pmid":1,"publication_status":"published","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1204308/"}],"intvolume":"       127"},{"date_published":"1991-05-01T00:00:00Z","author":[{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton"},{"last_name":"Rouhani","first_name":"Shahin","full_name":"Rouhani, Shahin"}],"date_updated":"2022-03-02T10:37:19Z","doi":"10.1111/j.1558-5646.1991.tb04326.x","article_processing_charge":"No","quality_controlled":"1","pmid":1,"day":"01","language":[{"iso":"eng"}],"month":"05","intvolume":"        45","main_file_link":[{"url":"http://www.jstor.org/stable/2409908"}],"publication_status":"published","abstract":[{"text":"We investigate the probability of fixation of a chromosome rearrangement in a subdivided population, concentrating on the limit where migration is so large relative to selection (m ≫ s) that the population can be thought of as being continuously distributed. We study two demes, and one- and two-dimensional populations. For two demes, the probability of fixation in the limit of high migration approximates that of a population with twice the size of a single deme: migration therefore greatly reduces the fixation probability. However, this behavior does not extend to a large array of demes. Then, the fixation probability depends primarily on neighborhood size (Nb), and may be appreciable even with strong selection and free gene flow (≈exp(-B·Nb) in one dimension, ≈exp(-B\\cdotNb) in two dimensions). Our results are close to those for the more tractable case of a polygenic character under disruptive selection.","lang":"eng"}],"extern":"1","title":"The probability of fixation of a new karyotype in a continuous population","publication":"Evolution","publisher":"Wiley-Blackwell","oa_version":"None","date_created":"2018-12-11T12:04:25Z","publist_id":"2735","status":"public","external_id":{"pmid":["28568824"]},"article_type":"original","issue":"3","citation":{"ieee":"N. H. Barton and S. Rouhani, “The probability of fixation of a new karyotype in a continuous population,” <i>Evolution</i>, vol. 45, no. 3. Wiley-Blackwell, pp. 499–517, 1991.","chicago":"Barton, Nicholas H, and Shahin Rouhani. “The Probability of Fixation of a New Karyotype in a Continuous Population.” <i>Evolution</i>. Wiley-Blackwell, 1991. <a href=\"https://doi.org/10.1111/j.1558-5646.1991.tb04326.x\">https://doi.org/10.1111/j.1558-5646.1991.tb04326.x</a>.","apa":"Barton, N. H., &#38; Rouhani, S. (1991). The probability of fixation of a new karyotype in a continuous population. <i>Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.1991.tb04326.x\">https://doi.org/10.1111/j.1558-5646.1991.tb04326.x</a>","ama":"Barton NH, Rouhani S. The probability of fixation of a new karyotype in a continuous population. <i>Evolution</i>. 1991;45(3):499-517. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1991.tb04326.x\">10.1111/j.1558-5646.1991.tb04326.x</a>","short":"N.H. Barton, S. Rouhani, Evolution 45 (1991) 499–517.","ista":"Barton NH, Rouhani S. 1991. The probability of fixation of a new karyotype in a continuous population. Evolution. 45(3), 499–517.","mla":"Barton, Nicholas H., and Shahin Rouhani. “The Probability of Fixation of a New Karyotype in a Continuous Population.” <i>Evolution</i>, vol. 45, no. 3, Wiley-Blackwell, 1991, pp. 499–517, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1991.tb04326.x\">10.1111/j.1558-5646.1991.tb04326.x</a>."},"publication_identifier":{"eissn":["1558-5646"],"issn":["0014-3820"]},"page":"499 - 517","volume":45,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"3648","year":"1991"},{"article_processing_charge":"No","date_updated":"2022-03-02T10:18:31Z","doi":"10.1137/0220016 ","date_published":"1991-04-01T00:00:00Z","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Weiping","last_name":"Shi","full_name":"Shi, Weiping"}],"quality_controlled":"1","day":"01","month":"04","language":[{"iso":"eng"}],"publication_status":"published","main_file_link":[{"url":"https://epubs.siam.org/doi/10.1137/0220016"}],"intvolume":"        20","extern":"1","abstract":[{"lang":"eng","text":"An algorithm is presented that constructs the convex hull of a set of n points in three dimensions in worst-case time O(n log2h) and storage O(n), where h is the number of extreme points. This is an improvement of the O(nh) time gift-wrapping algorithm and, for certain values of h, of the O(n log n) time divide-and-conquer algorithm."}],"publisher":"SIAM","publication":"SIAM Journal on Computing","title":"An O(n log^2 h) time algorithm for the three-dimensional convex hull problem","publist_id":"2072","date_created":"2018-12-11T12:06:39Z","oa_version":"None","issue":"2","article_type":"original","status":"public","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"citation":{"chicago":"Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.” <i>SIAM Journal on Computing</i>. SIAM, 1991. <a href=\"https://doi.org/10.1137/0220016 \">https://doi.org/10.1137/0220016 </a>.","ieee":"H. Edelsbrunner and W. Shi, “An O(n log^2 h) time algorithm for the three-dimensional convex hull problem,” <i>SIAM Journal on Computing</i>, vol. 20, no. 2. SIAM, pp. 259–269, 1991.","apa":"Edelsbrunner, H., &#38; Shi, W. (1991). An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0220016 \">https://doi.org/10.1137/0220016 </a>","ama":"Edelsbrunner H, Shi W. An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. <i>SIAM Journal on Computing</i>. 1991;20(2):259-269. doi:<a href=\"https://doi.org/10.1137/0220016 \">10.1137/0220016 </a>","short":"H. Edelsbrunner, W. Shi, SIAM Journal on Computing 20 (1991) 259–269.","ista":"Edelsbrunner H, Shi W. 1991. An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing. 20(2), 259–269.","mla":"Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.” <i>SIAM Journal on Computing</i>, vol. 20, no. 2, SIAM, 1991, pp. 259–69, doi:<a href=\"https://doi.org/10.1137/0220016 \">10.1137/0220016 </a>."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":20,"page":"259 - 269","year":"1991","_id":"4051"},{"article_processing_charge":"No","doi":"10.1016/0304-3975(91)90261-Y","date_updated":"2022-03-02T10:23:58Z","date_published":"1991-07-22T00:00:00Z","author":[{"last_name":"Chazelle","first_name":"Bernard","full_name":"Chazelle, Bernard"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","last_name":"Guibas","first_name":"Leonidas"},{"full_name":"Sharir, Micha","last_name":"Sharir","first_name":"Micha"}],"quality_controlled":"1","scopus_import":"1","publication_status":"published","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/030439759190261Y?via%3Dihub","open_access":"1"}],"intvolume":"        84","day":"22","month":"07","language":[{"iso":"eng"}],"publisher":"Elsevier","publication":"Theoretical Computer Science","title":"A singly exponential stratification scheme for real semi-algebraic varieties and its applications","publist_id":"2073","date_created":"2018-12-11T12:06:39Z","oa_version":"Published Version","extern":"1","abstract":[{"lang":"eng","text":"This paper describes an effective procedure for stratifying a real semi-algebraic set into cells of constant description size. The attractive feature of our method is that the number of cells produced is singly exponential in the number of input variables. This compares favorably with the doubly exponential size of Collins' decomposition. Unlike Collins' construction, however, our scheme does not produce a cell complex but only a smooth stratification. Nevertheless, we are able to apply our results in interesting ways to problems of point location and geometric optimization."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":84,"page":"77 - 105","year":"1991","_id":"4052","issue":"1","article_type":"original","status":"public","acknowledgement":"The authors wish to thank DEC/Systems Research Center and DEC/Paris Research Laboratory, where part of this research was conducted. For individual support, Bernard Chazelle acknowledges the National Science Foundation for supporting this research in part under Grant CCR-8700917. Herbert Edelsbrunner acknowledges the support of the National Science Foundation under Grant CCR-8714565. Micha Sharir acknowledges the Office of Naval Research under Grant N00014-87-K-0129, the National Science Foundation under Grant No. NSF-DCR-83-20085, grants from the Digital Equipment Corporation and the IBM Corporation, and a research grant from the US-Israeli Binational Science Foundation.","oa":1,"publication_identifier":{"issn":["0304-3975"],"eissn":["1879-2294"]},"citation":{"chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” <i>Theoretical Computer Science</i>. Elsevier, 1991. <a href=\"https://doi.org/10.1016/0304-3975(91)90261-Y\">https://doi.org/10.1016/0304-3975(91)90261-Y</a>.","ieee":"B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “A singly exponential stratification scheme for real semi-algebraic varieties and its applications,” <i>Theoretical Computer Science</i>, vol. 84, no. 1. Elsevier, pp. 77–105, 1991.","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., &#38; Sharir, M. (1991). A singly exponential stratification scheme for real semi-algebraic varieties and its applications. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3975(91)90261-Y\">https://doi.org/10.1016/0304-3975(91)90261-Y</a>","ama":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. <i>Theoretical Computer Science</i>. 1991;84(1):77-105. doi:<a href=\"https://doi.org/10.1016/0304-3975(91)90261-Y\">10.1016/0304-3975(91)90261-Y</a>","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Theoretical Computer Science 84 (1991) 77–105.","mla":"Chazelle, Bernard, et al. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” <i>Theoretical Computer Science</i>, vol. 84, no. 1, Elsevier, 1991, pp. 77–105, doi:<a href=\"https://doi.org/10.1016/0304-3975(91)90261-Y\">10.1016/0304-3975(91)90261-Y</a>.","ista":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1991. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. Theoretical Computer Science. 84(1), 77–105."}},{"author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Seidel","first_name":"Raimund","full_name":"Seidel, Raimund"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"date_published":"1991-11-13T00:00:00Z","article_processing_charge":"No","date_updated":"2022-02-28T15:13:37Z","doi":"10.1007/BFb0038185","alternative_title":["LNCS"],"abstract":[{"text":"The zone theorem for an arrangement of n hyperplanes in d-dimensional real space says that the total number of faces bounding the cells intersected by another hyperplane is O(n d–1). This result is the basis of a time-optimal incremental algorithm that constructs a hyperplane arrangement and has a host of other algorithmic and combinatorial applications. Unfortunately, the original proof of the zone theorem, for d ge 3, turned out to contain a serious and irreparable error. This paper presents a new proof of the theorem. Our proof is based on an inductive argument, which also applies in the case of pseudo-hyperplane arrangements. We also briefly discuss the fallacies of the old proof along with some ways of partially saving that approach.","lang":"eng"}],"extern":"1","quality_controlled":"1","title":"On the zone theorem for hyperplane arrangements","publisher":"Springer","conference":{"name":"New Results and New Trends in Computer Science "},"date_created":"2018-12-11T12:06:40Z","oa_version":"None","publist_id":"2068","acknowledgement":"Research of Herbert Edelsbrunner was supported by the National Science Foundation under grant CCR-89-21421. Raimund Seidel acknowledges support by an NSF Presidential Young Investigator Grant CCR-90-58440. Micha Sharir has been supported by ONR Grant N00014-90-J-1284, by NSF Grant CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation, the German-Israeli Foundation for Scientific Research and Development, and the Fund for Basic Research of the Israeli Academy of Sciences.","status":"public","day":"13","citation":{"apa":"Edelsbrunner, H., Seidel, R., &#38; Sharir, M. (1991). On the zone theorem for hyperplane arrangements (Vol. 555, pp. 108–123). Presented at the New Results and New Trends in Computer Science , Springer. <a href=\"https://doi.org/10.1007/BFb0038185\">https://doi.org/10.1007/BFb0038185</a>","ieee":"H. Edelsbrunner, R. Seidel, and M. Sharir, “On the zone theorem for hyperplane arrangements,” presented at the New Results and New Trends in Computer Science , 1991, vol. 555, pp. 108–123.","chicago":"Edelsbrunner, Herbert, Raimund Seidel, and Micha Sharir. “On the Zone Theorem for Hyperplane Arrangements,” 555:108–23. Springer, 1991. <a href=\"https://doi.org/10.1007/BFb0038185\">https://doi.org/10.1007/BFb0038185</a>.","ista":"Edelsbrunner H, Seidel R, Sharir M. 1991. On the zone theorem for hyperplane arrangements. New Results and New Trends in Computer Science , LNCS, vol. 555, 108–123.","short":"H. Edelsbrunner, R. Seidel, M. Sharir, in:, Springer, 1991, pp. 108–123.","mla":"Edelsbrunner, Herbert, et al. <i>On the Zone Theorem for Hyperplane Arrangements</i>. Vol. 555, Springer, 1991, pp. 108–23, doi:<a href=\"https://doi.org/10.1007/BFb0038185\">10.1007/BFb0038185</a>.","ama":"Edelsbrunner H, Seidel R, Sharir M. On the zone theorem for hyperplane arrangements. In: Vol 555. Springer; 1991:108-123. doi:<a href=\"https://doi.org/10.1007/BFb0038185\">10.1007/BFb0038185</a>"},"month":"11","language":[{"iso":"eng"}],"volume":555,"page":"108 - 123","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/BFb0038185"}],"_id":"4054","intvolume":"       555","year":"1991","publication_status":"published"},{"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/185400"}],"_id":"4055","year":"1991","publication_status":"published","page":"414 - 423","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","citation":{"ieee":"H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length triangulation,” in <i>32nd Annual Symposium of Foundations of Computer Science</i>, San Juan, PR, United States of America, 1991, pp. 414–423.","chicago":"Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” In <i>32nd Annual Symposium of Foundations of Computer Science</i>, 414–23. IEEE, 1991. <a href=\"https://doi.org/10.1109/SFCS.1991.185400\">https://doi.org/10.1109/SFCS.1991.185400</a>.","apa":"Edelsbrunner, H., &#38; Tan, T. (1991). A quadratic time algorithm for the minmax length triangulation. In <i>32nd Annual Symposium of Foundations of Computer Science</i> (pp. 414–423). San Juan, PR, United States of America: IEEE. <a href=\"https://doi.org/10.1109/SFCS.1991.185400\">https://doi.org/10.1109/SFCS.1991.185400</a>","ama":"Edelsbrunner H, Tan T. A quadratic time algorithm for the minmax length triangulation. In: <i>32nd Annual Symposium of Foundations of Computer Science</i>. IEEE; 1991:414-423. doi:<a href=\"https://doi.org/10.1109/SFCS.1991.185400\">10.1109/SFCS.1991.185400</a>","short":"H. Edelsbrunner, T. Tan, in:, 32nd Annual Symposium of Foundations of Computer Science, IEEE, 1991, pp. 414–423.","mla":"Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” <i>32nd Annual Symposium of Foundations of Computer Science</i>, IEEE, 1991, pp. 414–23, doi:<a href=\"https://doi.org/10.1109/SFCS.1991.185400\">10.1109/SFCS.1991.185400</a>.","ista":"Edelsbrunner H, Tan T. 1991. A quadratic time algorithm for the minmax length triangulation. 32nd Annual Symposium of Foundations of Computer Science. FOCS: Foundations of Computer Science, 414–423."},"month":"12","language":[{"iso":"eng"}],"status":"public","day":"01","date_created":"2018-12-11T12:06:40Z","conference":{"start_date":"1991-10-01","location":"San Juan, PR, United States of America","end_date":"1991-10-04","name":"FOCS: Foundations of Computer Science"},"oa_version":"None","publist_id":"2069","publication":"32nd Annual Symposium of Foundations of Computer Science","title":"A quadratic time algorithm for the minmax length triangulation","publisher":"IEEE","scopus_import":"1","abstract":[{"lang":"eng","text":"It is shown that a triangulation of a set of n points in the plane that minimizes the maximum edge length can be computed in time O(n2). The algorithm is reasonably easy to implement and is based on the theorem that there is a triangulation with minmax edge length that contains the relative neighborhood graph of the points as a subgraph. With minor modifications the algorithm works for arbitrary normed metrics."}],"quality_controlled":"1","extern":"1","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tan, Tiow","first_name":"Tiow","last_name":"Tan"}],"date_published":"1991-12-01T00:00:00Z","article_processing_charge":"No","date_updated":"2022-02-28T15:51:45Z","doi":"10.1109/SFCS.1991.185400"},{"quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","date_updated":"2022-03-02T09:56:10Z","doi":"10.1016/0097-3165(91)90042-F","date_published":"1991-03-01T00:00:00Z","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"full_name":"Hajnal, Péter","first_name":"Péter","last_name":"Hajnal"}],"month":"03","language":[{"iso":"eng"}],"day":"01","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/009731659190042F?via%3Dihub"}],"intvolume":"        56","extern":"1","abstract":[{"lang":"eng","text":"This paper proves that for every n ≥ 4 there is a convex n-gon such that the vertices of 2n - 7 vertex pairs are one unit of distance apart. This improves the previously best lower bound of ⌊ (5n - 5) 3⌋ given by Erdo{combining double acute accent}s and Moser if n ≥ 17."}],"publist_id":"2070","date_created":"2018-12-11T12:06:41Z","oa_version":"Published Version","publisher":"Elsevier","publication":"Journal of Combinatorial Theory Series A","title":"A lower bound on the number of unit distances between the vertices of a convex polygon","publication_identifier":{"eissn":["1096-0899"],"issn":["0097-3165"]},"citation":{"apa":"Edelsbrunner, H., &#38; Hajnal, P. (1991). A lower bound on the number of unit distances between the vertices of a convex polygon. <i>Journal of Combinatorial Theory Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/0097-3165(91)90042-F\">https://doi.org/10.1016/0097-3165(91)90042-F</a>","chicago":"Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon.” <i>Journal of Combinatorial Theory Series A</i>. Elsevier, 1991. <a href=\"https://doi.org/10.1016/0097-3165(91)90042-F\">https://doi.org/10.1016/0097-3165(91)90042-F</a>.","ieee":"H. Edelsbrunner and P. Hajnal, “A lower bound on the number of unit distances between the vertices of a convex polygon,” <i>Journal of Combinatorial Theory Series A</i>, vol. 56, no. 2. Elsevier, pp. 312–316, 1991.","short":"H. Edelsbrunner, P. Hajnal, Journal of Combinatorial Theory Series A 56 (1991) 312–316.","mla":"Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon.” <i>Journal of Combinatorial Theory Series A</i>, vol. 56, no. 2, Elsevier, 1991, pp. 312–16, doi:<a href=\"https://doi.org/10.1016/0097-3165(91)90042-F\">10.1016/0097-3165(91)90042-F</a>.","ista":"Edelsbrunner H, Hajnal P. 1991. A lower bound on the number of unit distances between the vertices of a convex polygon. Journal of Combinatorial Theory Series A. 56(2), 312–316.","ama":"Edelsbrunner H, Hajnal P. A lower bound on the number of unit distances between the vertices of a convex polygon. <i>Journal of Combinatorial Theory Series A</i>. 1991;56(2):312-316. doi:<a href=\"https://doi.org/10.1016/0097-3165(91)90042-F\">10.1016/0097-3165(91)90042-F</a>"},"issue":"2","article_type":"original","status":"public","oa":1,"acknowledgement":"The first author is pleased to acknowledge partial support by the Amoco Fnd. Fat. Dev. Comput. Sci. i-6-44862 and the National Science Foundation under Grant CCR-8714565.","year":"1991","_id":"4056","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":56,"page":"312 - 316"},{"publisher":"Elsevier","publication":"Journal of Computer and System Sciences","title":"Corrigendum","publist_id":"2071","date_created":"2018-12-11T12:06:41Z","oa_version":"Published Version","extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":42,"page":"249 - 251","year":"1991","_id":"4057","issue":"2","article_type":"original","status":"public","oa":1,"publication_identifier":{"issn":["0022-0000"],"eissn":["1090-2724"]},"citation":{"apa":"Edelsbrunner, H. (1991). Corrigendum. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/0022-0000(91)90013-U\">https://doi.org/10.1016/0022-0000(91)90013-U</a>","ieee":"H. Edelsbrunner, “Corrigendum,” <i>Journal of Computer and System Sciences</i>, vol. 42, no. 2. Elsevier, pp. 249–251, 1991.","chicago":"Edelsbrunner, Herbert. “Corrigendum.” <i>Journal of Computer and System Sciences</i>. Elsevier, 1991. <a href=\"https://doi.org/10.1016/0022-0000(91)90013-U\">https://doi.org/10.1016/0022-0000(91)90013-U</a>.","ista":"Edelsbrunner H. 1991. Corrigendum. Journal of Computer and System Sciences. 42(2), 249–251.","mla":"Edelsbrunner, Herbert. “Corrigendum.” <i>Journal of Computer and System Sciences</i>, vol. 42, no. 2, Elsevier, 1991, pp. 249–51, doi:<a href=\"https://doi.org/10.1016/0022-0000(91)90013-U\">10.1016/0022-0000(91)90013-U</a>.","short":"H. Edelsbrunner, Journal of Computer and System Sciences 42 (1991) 249–251.","ama":"Edelsbrunner H. Corrigendum. <i>Journal of Computer and System Sciences</i>. 1991;42(2):249-251. doi:<a href=\"https://doi.org/10.1016/0022-0000(91)90013-U\">10.1016/0022-0000(91)90013-U</a>"},"article_processing_charge":"No","date_updated":"2022-03-02T10:06:55Z","doi":"10.1016/0022-0000(91)90013-U","date_published":"1991-04-01T00:00:00Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"}],"quality_controlled":"1","publication_status":"published","intvolume":"        42","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/002200009190013U?via%3Dihub","open_access":"1"}],"day":"01","month":"04","language":[{"iso":"eng"}]},{"main_file_link":[{"url":"https://dl.acm.org/doi/10.5555/127787.127864"}],"_id":"4058","publication_status":"published","year":"1991","page":"441 - 448","type":"conference","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"ama":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. Computing a face in an arrangement of line segments. In: <i>Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>. SIAM; 1991:441-448.","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Snoeyink, in:, Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1991, pp. 441–448.","ista":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. 1991. Computing a face in an arrangement of line segments. Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms. SODA: Symposium on Discrete Algorithms, 441–448.","mla":"Chazelle, Bernard, et al. “Computing a Face in an Arrangement of Line Segments.” <i>Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, SIAM, 1991, pp. 441–48.","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jack Snoeyink. “Computing a Face in an Arrangement of Line Segments.” In <i>Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 441–48. SIAM, 1991.","ieee":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink, “Computing a face in an arrangement of line segments,” in <i>Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms</i>, San Francisco, CA, United States of America, 1991, pp. 441–448.","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &#38; Snoeyink, J. (1991). Computing a face in an arrangement of line segments. In <i>Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms</i> (pp. 441–448). San Francisco, CA, United States of America: SIAM."},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-0-89791-376-8"]},"month":"01","status":"public","acknowledgement":"NSF Grant CC R-89-21421. The authors wish to express their gratitude for the generous support and hospitality of the DEC Palo Alto Systems Research Center. ","day":"01","oa_version":"None","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"1991-01-30","location":"San Francisco, CA, United States of America","start_date":"1991-01-28"},"date_created":"2018-12-11T12:06:41Z","publist_id":"2065","title":"Computing a face in an arrangement of line segments","publication":"Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms","publisher":"SIAM","abstract":[{"lang":"eng","text":"We present a randomized incremental algorithm for computing a single face in an arrangement of n line segments in the plane that is fairly simple to implement. The expected running time of the algorithm is O (nα(n) log n). The analysis of the algorithm uses a novel approach that generalizes and extends the Clarkson-Shor analysis technique."}],"scopus_import":"1","quality_controlled":"1","extern":"1","date_published":"1991-01-01T00:00:00Z","author":[{"full_name":"Chazelle, Bernard","first_name":"Bernard","last_name":"Chazelle"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","last_name":"Guibas","first_name":"Leonidas"},{"first_name":"Micha","last_name":"Sharir","full_name":"Sharir, Micha"},{"first_name":"Jack","last_name":"Snoeyink","full_name":"Snoeyink, Jack"}],"date_updated":"2022-02-28T14:41:47Z","article_processing_charge":"No"},{"abstract":[{"text":"Let P be a simple polygon with n vertices. We present a simple decomposition scheme that partitions the interior of P into O(n) so-called geodesic triangles, so that any line segment interior to P crosses at most 2 log n of these triangles. This decomposition can be used to preprocess P in time O(n log n) and storage O(n), so that any ray-shooting query can be answered in time O(log n).The algorithms are fairly simple and easy to implement. We also extend this technique to the case of ray-shooting amidst k polygonal obstacles with a total of n edges, so that a query can be answered in O(radicklog n) time.","lang":"eng"}],"extern":"1","date_created":"2018-12-11T12:06:42Z","oa_version":"None","publist_id":"2066","publication":"18th International Colloquium on Automata, Languages and Programming","title":"Ray shooting in polygons using geodesic triangulations","publisher":"Springer","citation":{"short":"B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, J. Snoeyink, in:, 18th International Colloquium on Automata, Languages and Programming, Springer, 1991, pp. 661–673.","mla":"Chazelle, Bernard, et al. “Ray Shooting in Polygons Using Geodesic Triangulations.” <i>18th International Colloquium on Automata, Languages and Programming</i>, vol. 510, Springer, 1991, pp. 661–73, doi:<a href=\"https://doi.org/10.1007/3-540-54233-7_172\">10.1007/3-540-54233-7_172</a>.","ista":"Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1991. Ray shooting in polygons using geodesic triangulations. 18th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 510, 661–673.","ama":"Chazelle B, Edelsbrunner H, Grigni M, et al. Ray shooting in polygons using geodesic triangulations. In: <i>18th International Colloquium on Automata, Languages and Programming</i>. Vol 510. Springer; 1991:661-673. doi:<a href=\"https://doi.org/10.1007/3-540-54233-7_172\">10.1007/3-540-54233-7_172</a>","apa":"Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Hershberger, J., Sharir, M., &#38; Snoeyink, J. (1991). Ray shooting in polygons using geodesic triangulations. In <i>18th International Colloquium on Automata, Languages and Programming</i> (Vol. 510, pp. 661–673). Madrid, Spain: Springer. <a href=\"https://doi.org/10.1007/3-540-54233-7_172\">https://doi.org/10.1007/3-540-54233-7_172</a>","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons Using Geodesic Triangulations.” In <i>18th International Colloquium on Automata, Languages and Programming</i>, 510:661–73. Springer, 1991. <a href=\"https://doi.org/10.1007/3-540-54233-7_172\">https://doi.org/10.1007/3-540-54233-7_172</a>.","ieee":"B. Chazelle <i>et al.</i>, “Ray shooting in polygons using geodesic triangulations,” in <i>18th International Colloquium on Automata, Languages and Programming</i>, Madrid, Spain, 1991, vol. 510, pp. 661–673."},"acknowledgement":"Work by Bernard Chazelle has been supported by NSF Grant CCR-87-00917. Work by Herbert Edelsbrunner has been supported by NSF Grant CCR-89-21421. Work by Micha Sharir has been supported by ONR Grants N00014-89-J-3042 and N00014-90-J-1284, by NSF Grant CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation, the Fund for Basic Research administered by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development.","status":"public","_id":"4059","year":"1991","volume":510,"page":"661 - 673","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","scopus_import":"1","quality_controlled":"1","date_published":"1991-06-20T00:00:00Z","author":[{"full_name":"Chazelle, Bernard","first_name":"Bernard","last_name":"Chazelle"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"last_name":"Grigni","first_name":"Michelangelo","full_name":"Grigni, Michelangelo"},{"full_name":"Guibas, Leonidas","last_name":"Guibas","first_name":"Leonidas"},{"last_name":"Hershberger","first_name":"John","full_name":"Hershberger, John"},{"first_name":"Micha","last_name":"Sharir","full_name":"Sharir, Micha"},{"last_name":"Snoeyink","first_name":"Jack","full_name":"Snoeyink, Jack"}],"article_processing_charge":"No","alternative_title":["LNCS"],"doi":"10.1007/3-540-54233-7_172","date_updated":"2022-02-28T14:53:03Z","conference":{"end_date":"1991-07-12","name":"ICALP: Automata, Languages and Programming","start_date":"1991-07-08","location":"Madrid, Spain"},"month":"06","language":[{"iso":"eng"}],"day":"20","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-54233-7_172"}],"intvolume":"       510","publication_status":"published"},{"month":"12","language":[{"iso":"eng"}],"day":"01","publication_status":"published","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02574698","open_access":"1"}],"intvolume":"         6","quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","doi":"10.1007/BF02574698","date_updated":"2022-02-24T15:06:41Z","date_published":"1991-12-01T00:00:00Z","author":[{"last_name":"Agarwal","first_name":"Pankaj","full_name":"Agarwal, Pankaj"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"last_name":"Schwarzkopf","first_name":"Otfried","full_name":"Schwarzkopf, Otfried"},{"full_name":"Welzl, Emo","first_name":"Emo","last_name":"Welzl"}],"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"citation":{"apa":"Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., &#38; Welzl, E. (1991). Euclidean minimum spanning trees and bichromatic closest pairs. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02574698\">https://doi.org/10.1007/BF02574698</a>","chicago":"Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1991. <a href=\"https://doi.org/10.1007/BF02574698\">https://doi.org/10.1007/BF02574698</a>.","ieee":"P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “Euclidean minimum spanning trees and bichromatic closest pairs,” <i>Discrete &#38; Computational Geometry</i>, vol. 6, no. 1. Springer, pp. 407–422, 1991.","ista":"Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &#38; Computational Geometry. 6(1), 407–422.","short":"P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete &#38; Computational Geometry 6 (1991) 407–422.","mla":"Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” <i>Discrete &#38; Computational Geometry</i>, vol. 6, no. 1, Springer, 1991, pp. 407–22, doi:<a href=\"https://doi.org/10.1007/BF02574698\">10.1007/BF02574698</a>.","ama":"Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs. <i>Discrete &#38; Computational Geometry</i>. 1991;6(1):407-422. doi:<a href=\"https://doi.org/10.1007/BF02574698\">10.1007/BF02574698</a>"},"issue":"1","article_type":"original","oa":1,"status":"public","acknowledgement":"The first, second, and fourth authors acknowledge support from the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), a National Science Foundation Science and Technology Center under NSF Grant STC 88-09648. The second author's work was supported by the National Science Foundation under Grant CCR-8714565. The third author's work was supported by the Deutsche Forschungsgemeinschaft under Grant A1 253/1-3, Schwerpunktprogramm \"Datenstrukturen und effiziente Algorithmen.\" The last two authors' work was also partially supported by the ESPRIT II Basic Research Action of the EC under Contract No. 3075 (project ALCOM).","year":"1991","_id":"4061","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":6,"page":"407 - 422","extern":"1","abstract":[{"text":"We present an algorithm to compute a Euclidean minimum spanning tree of a given set S of N points in Ed in time O(Fd (N,N) logd N), where Fd (n,m) is the time required to compute a bichromatic closest pair among n red and m green points in Ed . If Fd (N,N)=Ω(N1+ε), for some fixed e{open}&gt;0, then the running time improves to O(Fd (N,N)). Furthermore, we describe a randomized algorithm to compute a bichromatic closest pair in expected time O((nm log n log m)2/3+m log2 n+n log2 m) in E3, which yields an O(N4/3 log4/3 N) expected time, algorithm for computing a Euclidean minimum spanning tree of N points in E3. In d≥4 dimensions we obtain expected time O((nm)1-1/([d/2]+1)+ε+m log n+n log m) for the bichromatic closest pair problem and O(N2-2/([d/2]+1)ε) for the Euclidean minimum spanning tree problem, for any positive e{open}.","lang":"eng"}],"publist_id":"2062","date_created":"2018-12-11T12:06:42Z","oa_version":"Published Version","publisher":"Springer","publication":"Discrete & Computational Geometry","title":"Euclidean minimum spanning trees and bichromatic closest pairs"},{"_id":"4062","year":"1991","page":"435 - 442","volume":6,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"apa":"Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &#38; Wenger, R. (1991). Points and triangles in the plane and halving planes in space. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02574700\">https://doi.org/10.1007/BF02574700</a>","chicago":"Aronov, Boris, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Rephael Wenger. “Points and Triangles in the Plane and Halving Planes in Space.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1991. <a href=\"https://doi.org/10.1007/BF02574700\">https://doi.org/10.1007/BF02574700</a>.","ieee":"B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” <i>Discrete &#38; Computational Geometry</i>, vol. 6, no. 1. Springer, pp. 435–442, 1991.","ista":"Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1991. Points and triangles in the plane and halving planes in space. Discrete &#38; Computational Geometry. 6(1), 435–442.","short":"B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, Discrete &#38; Computational Geometry 6 (1991) 435–442.","mla":"Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.” <i>Discrete &#38; Computational Geometry</i>, vol. 6, no. 1, Springer, 1991, pp. 435–42, doi:<a href=\"https://doi.org/10.1007/BF02574700\">10.1007/BF02574700</a>.","ama":"Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. Points and triangles in the plane and halving planes in space. <i>Discrete &#38; Computational Geometry</i>. 1991;6(1):435-442. doi:<a href=\"https://doi.org/10.1007/BF02574700\">10.1007/BF02574700</a>"},"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"status":"public","acknowledgement":"Work on this paper by Boris Aronov and Rephael Wenger has been supported by DIMACS under NSF Grant STC-88-09648. Work on this paper by Bernard Chazelle has been supported by NSF Grant CCR-87-00917. Work by Herbert Edelsbrunner has been supported by NSF Grant CCR-87-14565. Micha Sharir has been supported by ONR Grant N00014-87-K-0129, by NSF Grant CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation, the Israeli National Council for Research and Development, and the Fund for Basic Research administered by the Israeli\r\nAcademy of Sciences","oa":1,"article_type":"original","issue":"1","oa_version":"Published Version","date_created":"2018-12-11T12:06:43Z","publist_id":"2063","title":"Points and triangles in the plane and halving planes in space","publication":"Discrete & Computational Geometry","publisher":"Springer","abstract":[{"lang":"eng","text":"We prove that for any set S of n points in the plane and n3-α triangles spanned by the points in S there exists a point (not necessarily in S) contained in at least n3-3α/(c log5 n) of the triangles. This implies that any set of n points in three-dimensional space defines at most {Mathematical expression} halving planes."}],"extern":"1","main_file_link":[{"open_access":"1","url":"https://link.springer.com/article/10.1007/BF02574700"}],"intvolume":"         6","publication_status":"published","language":[{"iso":"eng"}],"month":"12","day":"01","scopus_import":"1","quality_controlled":"1","author":[{"first_name":"Boris","last_name":"Aronov","full_name":"Aronov, Boris"},{"first_name":"Bernard","last_name":"Chazelle","full_name":"Chazelle, Bernard"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"first_name":"Micha","last_name":"Sharir","full_name":"Sharir, Micha"},{"first_name":"Rephael","last_name":"Wenger","full_name":"Wenger, Rephael"}],"date_published":"1991-12-01T00:00:00Z","doi":"10.1007/BF02574700","date_updated":"2022-02-24T15:39:25Z","article_processing_charge":"No"},{"date_created":"2018-12-11T12:09:13Z","conference":{"location":"Orlando, FL, United States of America","start_date":"1991-01-21","name":"POPL: Principles of Programming Languages","end_date":"1991-01-23"},"oa_version":"None","publist_id":"221","publication":"Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","title":"Temporal proof methodologies for real-time systems","publisher":"ACM","abstract":[{"lang":"eng","text":"We extend the specification language of temporal logic, the corresponding verification framework, and the underlying computational model to deal with real-time properties of concurrent and reactive systems. A global, discrete, and asynchronous clock is incorporated into the model by defining the abstract notion of a real-time transition system as a conservative extension of traditional transition systems: qualitative fairness requirements are replaced (and superseded) by quantitative lower-bound and upperbound real-time requirements for transitions. We show how to model real-time systems that communicate either through shared variables or by message passing, and how to represent the important real-time constructs of priorities (interrupts), scheduling, and timeouts in this framework. Two styles for the specification of real-time properties are presented. The first style uses bounded versions of the temporal operators; the real-time requirements expressed in this style are classified ..."}],"scopus_import":"1","quality_controlled":"1","extern":"1","date_published":"1991-01-01T00:00:00Z","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Manna, Zohar","last_name":"Manna","first_name":"Zohar"},{"last_name":"Pnueli","first_name":"Amir","full_name":"Pnueli, Amir"}],"article_processing_charge":"No","doi":"10.1145/99583.99629","date_updated":"2022-02-24T14:44:39Z","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/99583.99629"}],"_id":"4508","year":"1991","publication_status":"published","page":"353 - 366","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","citation":{"ieee":"T. A. Henzinger, Z. Manna, and A. Pnueli, “Temporal proof methodologies for real-time systems,” in <i>Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages</i>, Orlando, FL, United States of America, 1991, pp. 353–366.","chicago":"Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “Temporal Proof Methodologies for Real-Time Systems.” In <i>Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</i>, 353–66. ACM, 1991. <a href=\"https://doi.org/10.1145/99583.99629\">https://doi.org/10.1145/99583.99629</a>.","apa":"Henzinger, T. A., Manna, Z., &#38; Pnueli, A. (1991). Temporal proof methodologies for real-time systems. In <i>Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages</i> (pp. 353–366). Orlando, FL, United States of America: ACM. <a href=\"https://doi.org/10.1145/99583.99629\">https://doi.org/10.1145/99583.99629</a>","ama":"Henzinger TA, Manna Z, Pnueli A. Temporal proof methodologies for real-time systems. In: <i>Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</i>. ACM; 1991:353-366. doi:<a href=\"https://doi.org/10.1145/99583.99629\">10.1145/99583.99629</a>","ista":"Henzinger TA, Manna Z, Pnueli A. 1991. Temporal proof methodologies for real-time systems. Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. POPL: Principles of Programming Languages, 353–366.","short":"T.A. Henzinger, Z. Manna, A. Pnueli, in:, Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, 1991, pp. 353–366.","mla":"Henzinger, Thomas A., et al. “Temporal Proof Methodologies for Real-Time Systems.” <i>Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</i>, ACM, 1991, pp. 353–66, doi:<a href=\"https://doi.org/10.1145/99583.99629\">10.1145/99583.99629</a>."},"month":"01","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-0-89791-419-2"]},"status":"public","acknowledgement":"This research was supported in part by an IBM graduate fellowship, by the National Science Foundation grants CCR-89-11512 and CC R-89-13641, by the Defense Advanced Re-search Projects Agency under contract NOO03%84C-0211, by the United States Air Force Office of Scientific Research un-der contract AFOSR-W-0057, and by the European Community ESPRIT Basic Research Action project 3096 (SPEC). We thank Rajeev Alur for many helpful discussions. ","day":"01"},{"status":"public","day":"30","citation":{"chicago":"Henzinger, Thomas A. “The Temporal Specification and Verification of Real-Time Systems .” Stanford University, 1991.","ieee":"T. A. Henzinger, “The temporal specification and verification of real-time systems ,” Stanford University, 1991.","apa":"Henzinger, T. A. (1991). <i>The temporal specification and verification of real-time systems </i>. Stanford University.","ama":"Henzinger TA. The temporal specification and verification of real-time systems . 1991.","mla":"Henzinger, Thomas A. <i>The Temporal Specification and Verification of Real-Time Systems </i>. Stanford University, 1991.","short":"T.A. Henzinger, The Temporal Specification and Verification of Real-Time Systems , Stanford University, 1991.","ista":"Henzinger TA. 1991. The temporal specification and verification of real-time systems . Stanford University."},"month":"08","language":[{"iso":"eng"}],"page":"295","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"dissertation","main_file_link":[{"url":"http://pub.ist.ac.at/~tah/Publications/the_temporal_specification_and_verification_of_real-time_systems.pdf"}],"_id":"4516","year":"1991","publication_status":"published","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"}],"date_published":"1991-08-30T00:00:00Z","article_processing_charge":"No","date_updated":"2022-02-24T14:12:36Z","degree_awarded":"PhD","abstract":[{"lang":"eng","text":"We extend the specification language of temporal logic, the corresponding verification framework, and the underlying computational model to deal with real-time properties of reactive systems. Semantics We introduce the abstract computational model of timed transition systems as a conservative extension of traditional transition systems qualitative fairness requirements are superseded by quantitative real-time constraints on the transitions. Digital clocks are introduced as observers of continuous real-time behavior. We justify our semantical abstractions by demonstrating that a wide variety of concrete real-time systems can be modeled adequately. Specification We present two conservative extensions of temporal logic that allow for the specification of timing constraints while timed temporal logic provides access to time through a novel kind of time quantifier, metric temporal logic refers to time through time-bounded versions of the temporal operators. We justify our choice of specification languages by developing a general framework for the classification of real-time logics according to their complexity and expressive power. Verification We develop tools for determining if a real-time system that is modeled as a timed transition system meets a specification that is given in timed temporal logic or in metric temporal logic. We present both model-checking algorithms for the automatic verification of finite-state real-time systems and proof methods for the deductive verification of real-time systems."}],"extern":"1","title":"The temporal specification and verification of real-time systems ","publisher":"Stanford University","date_created":"2018-12-11T12:09:15Z","oa_version":"None","publist_id":"210"},{"extern":"1","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"}],"publist_id":"4421","date_created":"2018-12-11T11:57:55Z","oa_version":"Published Version","publisher":"American Society for Biochemistry and Molecular Biology","publication":"Journal of Biological Chemistry","title":"Cloning and expression of a rat neuromedin K receptor cDNA","publication_identifier":{"issn":["0021-9258"],"eissn":["1083-351X"]},"citation":{"short":"R. Shigemoto, Y. Yokota, K. Tsuchida, S. Nakanishi, Journal of Biological Chemistry 265 (1990) 623–628.","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.","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>.","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>","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>","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.","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>."},"issue":"2","article_type":"original","external_id":{"pmid":["2153106 "]},"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.","oa":1,"status":"public","year":"1990","_id":"2480","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":265,"page":"623 - 628","quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","date_updated":"2022-02-24T11:07:05Z","doi":"10.1016/s0021-9258(19)40095-1 ","date_published":"1990-01-15T00:00:00Z","author":[{"full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"first_name":"Yoshifumi","last_name":"Yokota","full_name":"Yokota, Yoshifumi"},{"full_name":"Tsuchida, Kunihiro","first_name":"Kunihiro","last_name":"Tsuchida"},{"first_name":"Shigetada","last_name":"Nakanishi","full_name":"Nakanishi, Shigetada"}],"month":"01","language":[{"iso":"eng"}],"day":"15","pmid":1,"publication_status":"published","intvolume":"       265","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S0021925819400951","open_access":"1"}]},{"day":"03","pmid":1,"month":"03","language":[{"iso":"eng"}],"publication_status":"published","intvolume":"       193","main_file_link":[{"url":"https://febs.onlinelibrary.wiley.com/doi/10.1111/j.1432-1033.1990.tb19396.x","open_access":"1"}],"article_processing_charge":"No","date_updated":"2022-02-24T10:20:14Z","doi":"10.1111/j.1432-1033.1990.tb19396.x","date_published":"1990-03-03T00:00:00Z","author":[{"full_name":"Tsuchida, Kunihiro","first_name":"Kunihiro","last_name":"Tsuchida"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","first_name":"Ryuichi"},{"first_name":"Yoshifumi","last_name":"Yokota","full_name":"Yokota, Yoshifumi"},{"full_name":"Nakanishi, Shigetada","last_name":"Nakanishi","first_name":"Shigetada"}],"quality_controlled":"1","scopus_import":"1","issue":"3","article_type":"original","external_id":{"pmid":["1701145"]},"status":"public","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","oa":1,"publication_identifier":{"eissn":["1432-1033"],"issn":["0014-2956"]},"citation":{"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.","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>.","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>","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>","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>.","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.","short":"K. Tsuchida, R. Shigemoto, Y. Yokota, S. Nakanishi, European Journal of Biochemistry 193 (1990) 751–757."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":193,"page":"751 - 757","year":"1990","_id":"2481","extern":"1","abstract":[{"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.","lang":"eng"}],"publisher":"Wiley-Blackwell","publication":"European Journal of Biochemistry","title":"Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors","publist_id":"4420","date_created":"2018-12-11T11:57:55Z","oa_version":"Published Version"},{"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"}],"extern":"1","title":"Immunohistochemical study of a rat membrane protein which induces a selective potassium permeation: Its localization in the apical membrane portion of epithelial cells","publication":"Journal of Membrane Biology","publisher":"Springer","oa_version":"None","date_created":"2018-12-11T11:58:12Z","publist_id":"4371","status":"public","article_type":"original","external_id":{"pmid":["2154581"]},"issue":"1","citation":{"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>","short":"T. Sugimoto, Y. Tanabe, R. Shigemoto, M. Iwai, T. Takumi, H. Ohkubo, S. Nakanishi, Journal of Membrane Biology 113 (1990) 39–47.","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>.","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.","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.","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>.","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>"},"publication_identifier":{"eissn":["1432-1424"],"issn":["0022-2631"]},"page":"39 - 47","volume":113,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"2528","year":"1990","author":[{"first_name":"Tetsuo","last_name":"Sugimoto","full_name":"Sugimoto, Tetsuo"},{"full_name":"Tanabe, Yasuto","last_name":"Tanabe","first_name":"Yasuto"},{"full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"full_name":"Iwai, Masazumi","last_name":"Iwai","first_name":"Masazumi"},{"full_name":"Takumi, Toru","last_name":"Takumi","first_name":"Toru"},{"first_name":"Hiroaki","last_name":"Ohkubo","full_name":"Ohkubo, Hiroaki"},{"first_name":"Shigetada","last_name":"Nakanishi","full_name":"Nakanishi, Shigetada"}],"date_published":"1990-01-01T00:00:00Z","date_updated":"2022-02-24T09:55:39Z","doi":"10.1007/BF01869604","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","pmid":1,"day":"01","language":[{"iso":"eng"}],"month":"01","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01869604"}],"intvolume":"       113","publication_status":"published"},{"date_updated":"2022-02-24T09:39:29Z","doi":"10.1007/BF01334766","article_processing_charge":"No","author":[{"orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"first_name":"Dao","last_name":"Tuyen","full_name":"Tuyen, Dao"}],"date_published":"1990-06-01T00:00:00Z","quality_controlled":"1","scopus_import":"1","day":"01","language":[{"iso":"eng"}],"month":"06","publication_status":"published","intvolume":"        59","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01334766"}],"extern":"1","abstract":[{"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.","lang":"eng"}],"publisher":"Springer","title":"Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier","publication":"Journal of Statistical Physics","publist_id":"4171","oa_version":"None","date_created":"2018-12-11T11:59:15Z","article_type":"original","issue":"5-6","status":"public","publication_identifier":{"issn":["0022-4715"],"eissn":["1572-9613"]},"citation":{"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.","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>.","short":"L. Erdös, D. Tuyen, Journal of Statistical Physics 59 (1990) 1589–1602.","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>","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>","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.","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>."},"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"1589 - 1602","volume":59,"year":"1990","_id":"2721"},{"publication_status":"published","year":"1990","_id":"4597","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/113764"}],"type":"conference","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"390 - 401","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0-8186-2073-0"]},"month":"08","citation":{"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.","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>.","short":"R. Alur, T.A. Henzinger, in:,  5th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1990, pp. 390–401.","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>","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>","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.","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>."},"day":"06","status":"public","publist_id":"112","oa_version":"None","conference":{"name":"LICS: Logic in Computer Science","end_date":"1990-06-07","location":"Philadelphia, PA, USA","start_date":"1990-06-04"},"date_created":"2018-12-11T12:09:40Z","publisher":"IEEE","title":"Real-time logics: Complexity and expressiveness","publication":" 5th Annual IEEE Symposium on Logic in Computer Science","extern":"1","quality_controlled":"1","abstract":[{"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","lang":"eng"}],"scopus_import":"1","date_updated":"2022-02-15T14:35:30Z","doi":"10.1109/LICS.1990.113764","article_processing_charge":"No","date_published":"1990-08-06T00:00:00Z","author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}]},{"publisher":"Wiley-Blackwell","publication":"Journal of Physiology","title":"A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments","publist_id":"2920","date_created":"2018-12-11T12:03:29Z","oa_version":"None","extern":"1","abstract":[{"lang":"eng","text":"The effects of mast cell degranulating peptide (MCDP), a toxin from the honey bee, and of dendrotoxin (DTX), a toxin from the green mamba snake, were studied in voltage-clamped experiments with myelinated nerve fibres of Xenopus. MCDP and DTX blocked part of the K+ current. About 20% of the K+ current, however, was resistant to the toxins even in high concentrations. In Ringer solution half-maximal block was reached with concentrations of 33 nM MCDP and 11 nM DTX. In high-K+ solution the potency of both toxins was lower. β-Bungarotoxin (β-BuTX), another snake toxin, also blocked part of the K+ current, but was less potent than MCDP and DTX. Tail currents in high-K+ solution were analysed and three K+ current components were separated according to Dubois (1981b). Both MCDP and DTX selectively blocked a fast deactivating, slowly inactivating K+ current component which steeply activates between E = -60 mV and E = -40 mV (component f1). In concentrations around 100 nM, MCDP and DTX blocked neither the slow K+ current (component s) nor the fast deactivating, rapidly inactivating K+ current which activates between E = -40 mV and E = 20 mV (component f2). Similar results could be derived from K+ outward currents in Ringer solution. In high-K+, IC50 of MCDP for component f1 was 99 nM, whereas it was 7.6 μM for f2. Corresponding values for DTX are 68 nM and 1.8 μM. Binding studies with nerve fibre membranes of Xenopus reveal high-affinity binding sites for 125I-labelled DTX )K(D) = 22 pM in Ringer solution and 81 pM in high-K+ solution). 125I-labelled DTX can be displaced from its sites completely by unlabelled DTX, toxin I (black mamba toxin), MCDP, and partially by β-BuTX. Immunocytochemical staining demonstrates that binding sites for DTX are present in nodal and paranodal regions of the axonal membrane. The axonal membrane of motor and sensory nerve fibres is equipped with three types of well-characterized K+ channels and constitutes so far the best preparation to study MCDP- and DTX-sensitive K+ channels with electrophysiological and biochemical methods."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":420,"page":"365 - 385","year":"1990","_id":"3467","article_type":"original","external_id":{"pmid":["2324990"]},"oa":1,"acknowledgement":"We thank Professor E. Habermann for critical reading of the manuscript and E. Schmidt and J. Schafer for technical assistance. Financial support by the Deutsche Forschungsgemeinschaft (Vo 188/13-1 and SFB 249) is gratefully acknowledged.\r\n","status":"public","publication_identifier":{"eissn":["1469-7793"],"issn":["0022-3751"]},"citation":{"ieee":"M. Bräu, F. Dreyer, P. M. Jonas, H. Repp, and W. Vogel, “A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments,” <i>Journal of Physiology</i>, vol. 420. Wiley-Blackwell, pp. 365–385, 1990.","chicago":"Bräu, Michael, Florian Dreyer, Peter M Jonas, Holger Repp, and Werner Vogel. “A K+ Channel in Xenopus Nerve Fibres Selectively Blocked by Bee and Snake Toxins: Binding and Voltage-Clamp Experiments.” <i>Journal of Physiology</i>. Wiley-Blackwell, 1990. <a href=\"https://doi.org/10.1113/jphysiol.1990.sp017918\">https://doi.org/10.1113/jphysiol.1990.sp017918</a>.","apa":"Bräu, M., Dreyer, F., Jonas, P. M., Repp, H., &#38; Vogel, W. (1990). A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. <i>Journal of Physiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1113/jphysiol.1990.sp017918\">https://doi.org/10.1113/jphysiol.1990.sp017918</a>","ama":"Bräu M, Dreyer F, Jonas PM, Repp H, Vogel W. A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. <i>Journal of Physiology</i>. 1990;420:365-385. doi:<a href=\"https://doi.org/10.1113/jphysiol.1990.sp017918\">10.1113/jphysiol.1990.sp017918</a>","short":"M. Bräu, F. Dreyer, P.M. Jonas, H. Repp, W. Vogel, Journal of Physiology 420 (1990) 365–385.","ista":"Bräu M, Dreyer F, Jonas PM, Repp H, Vogel W. 1990. A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. Journal of Physiology. 420, 365–385.","mla":"Bräu, Michael, et al. “A K+ Channel in Xenopus Nerve Fibres Selectively Blocked by Bee and Snake Toxins: Binding and Voltage-Clamp Experiments.” <i>Journal of Physiology</i>, vol. 420, Wiley-Blackwell, 1990, pp. 365–85, doi:<a href=\"https://doi.org/10.1113/jphysiol.1990.sp017918\">10.1113/jphysiol.1990.sp017918</a>."},"article_processing_charge":"No","date_updated":"2022-02-23T16:10:03Z","doi":"10.1113/jphysiol.1990.sp017918","date_published":"1990-01-01T00:00:00Z","author":[{"full_name":"Bräu, Michael","first_name":"Michael","last_name":"Bräu"},{"full_name":"Dreyer, Florian","last_name":"Dreyer","first_name":"Florian"},{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","last_name":"Jonas","orcid":"0000-0001-5001-4804"},{"first_name":"Holger","last_name":"Repp","full_name":"Repp, Holger"},{"first_name":"Werner","last_name":"Vogel","full_name":"Vogel, Werner"}],"quality_controlled":"1","scopus_import":"1","publication_status":"published","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1190055/","open_access":"1"}],"intvolume":"       420","day":"01","pmid":1,"month":"01","language":[{"iso":"eng"}]}]