[{"abstract":[{"lang":"eng","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. "}],"month":"01","date_published":"1990-01-01T00:00:00Z","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"209","date_updated":"2022-02-15T15:11:03Z","publisher":"ACM","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/93385.93429"}],"page":"281 - 296","scopus_import":"1","day":"01","year":"1990","publication_identifier":{"isbn":["978-0-89791-404-8"]},"language":[{"iso":"eng"}],"title":"Half-order modal logic: How to prove real-time properties","status":"public","quality_controlled":"1","oa_version":"None","date_created":"2018-12-11T12:09:17Z","citation":{"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>","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.","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.","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>.","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>","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>.","short":"T.A. Henzinger, in:, Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1990, pp. 281–296."},"doi":"10.1145/93385.93429","publication":"Proceedings of the 9th annual ACM symposium on Principles of distributed computing","extern":"1","_id":"4522","article_processing_charge":"No","type":"conference","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"Many thanks to Rajeev Alur, Adam Grove, Zohar Manna, and Amir Pnueli for their continuous discussions and support.","conference":{"end_date":"1990-08-24","start_date":"1990-08-22","location":"Quebec City, Canada","name":"PODC: Principles of Distributed Computing"}},{"page":"390 - 401","scopus_import":"1","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/113764"}],"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"112","date_updated":"2022-02-15T14:35:30Z","publisher":"IEEE","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"}],"month":"08","date_published":"1990-08-06T00:00:00Z","author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"conference":{"name":"LICS: Logic in Computer Science","end_date":"1990-06-07","start_date":"1990-06-04","location":"Philadelphia, PA, USA"},"quality_controlled":"1","date_created":"2018-12-11T12:09:40Z","oa_version":"None","doi":"10.1109/LICS.1990.113764","citation":{"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>","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.","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>.","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>","short":"R. Alur, T.A. Henzinger, in:,  5th Annual IEEE Symposium on Logic in Computer Science, IEEE, 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>."},"publication":" 5th Annual IEEE Symposium on Logic in Computer Science","extern":"1","article_processing_charge":"No","_id":"4597","type":"conference","title":"Real-time logics: Complexity and expressiveness","status":"public","year":"1990","day":"06","publication_identifier":{"isbn":["0-8186-2073-0"]},"language":[{"iso":"eng"}]},{"page":"623 - 628","external_id":{"pmid":["2153106 "]},"abstract":[{"lang":"eng","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."}],"oa":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.","quality_controlled":"1","citation":{"short":"R. Shigemoto, Y. Yokota, K. Tsuchida, S. Nakanishi, Journal of Biological Chemistry 265 (1990) 623–628.","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>.","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>","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>.","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.","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.","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>"},"doi":"10.1016/s0021-9258(19)40095-1 ","extern":"1","intvolume":"       265","pmid":1,"year":"1990","publication_identifier":{"issn":["0021-9258"],"eissn":["1083-351X"]},"language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0021925819400951"}],"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-02-24T11:07:05Z","publist_id":"4421","publisher":"American Society for Biochemistry and Molecular Biology","article_type":"original","month":"01","date_published":"1990-01-15T00:00:00Z","author":[{"last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444"},{"first_name":"Yoshifumi","last_name":"Yokota","full_name":"Yokota, Yoshifumi"},{"full_name":"Tsuchida, Kunihiro","last_name":"Tsuchida","first_name":"Kunihiro"},{"full_name":"Nakanishi, Shigetada","last_name":"Nakanishi","first_name":"Shigetada"}],"date_created":"2018-12-11T11:57:55Z","oa_version":"Published Version","publication":"Journal of Biological Chemistry","_id":"2480","type":"journal_article","issue":"2","article_processing_charge":"No","volume":265,"title":"Cloning and expression of a rat neuromedin K receptor cDNA","status":"public","day":"15"},{"article_type":"original","date_published":"1990-03-03T00:00:00Z","month":"03","date_updated":"2022-02-24T10:20:14Z","publist_id":"4420","publisher":"Wiley-Blackwell","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"open_access":"1","url":"https://febs.onlinelibrary.wiley.com/doi/10.1111/j.1432-1033.1990.tb19396.x"}],"scopus_import":"1","day":"03","status":"public","title":"Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors","volume":193,"publication":"European Journal of Biochemistry","issue":"3","_id":"2481","type":"journal_article","article_processing_charge":"No","date_created":"2018-12-11T11:57:55Z","oa_version":"Published Version","author":[{"full_name":"Tsuchida, Kunihiro","first_name":"Kunihiro","last_name":"Tsuchida"},{"last_name":"Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi"},{"first_name":"Yoshifumi","last_name":"Yokota","full_name":"Yokota, Yoshifumi"},{"last_name":"Nakanishi","first_name":"Shigetada","full_name":"Nakanishi, Shigetada"}],"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"}],"oa":1,"external_id":{"pmid":["1701145"]},"page":"751 - 757","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0014-2956"],"eissn":["1432-1033"]},"year":"1990","intvolume":"       193","pmid":1,"extern":"1","quality_controlled":"1","citation":{"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.","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.","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>"},"doi":"10.1111/j.1432-1033.1990.tb19396.x","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"},{"volume":113,"title":"Immunohistochemical study of a rat membrane protein which induces a selective potassium permeation: Its localization in the apical membrane portion of epithelial cells","status":"public","day":"01","author":[{"full_name":"Sugimoto, Tetsuo","last_name":"Sugimoto","first_name":"Tetsuo"},{"full_name":"Tanabe, Yasuto","last_name":"Tanabe","first_name":"Yasuto"},{"last_name":"Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444"},{"full_name":"Iwai, Masazumi","last_name":"Iwai","first_name":"Masazumi"},{"full_name":"Takumi, Toru","first_name":"Toru","last_name":"Takumi"},{"full_name":"Ohkubo, Hiroaki","last_name":"Ohkubo","first_name":"Hiroaki"},{"first_name":"Shigetada","last_name":"Nakanishi","full_name":"Nakanishi, Shigetada"}],"oa_version":"None","date_created":"2018-12-11T11:58:12Z","publication":"Journal of Membrane Biology","_id":"2528","article_processing_charge":"No","issue":"1","type":"journal_article","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-02-24T09:55:39Z","publist_id":"4371","publisher":"Springer","article_type":"original","date_published":"1990-01-01T00:00:00Z","month":"01","scopus_import":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01869604"}],"intvolume":"       113","pmid":1,"year":"1990","publication_identifier":{"issn":["0022-2631"],"eissn":["1432-1424"]},"language":[{"iso":"eng"}],"quality_controlled":"1","doi":"10.1007/BF01869604","citation":{"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.","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>.","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>.","short":"T. Sugimoto, Y. Tanabe, R. Shigemoto, M. Iwai, T. Takumi, H. Ohkubo, S. Nakanishi, Journal of Membrane Biology 113 (1990) 39–47.","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>"},"extern":"1","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"}],"page":"39 - 47","external_id":{"pmid":["2154581"]}},{"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01334766"}],"scopus_import":"1","article_type":"original","date_published":"1990-06-01T00:00:00Z","month":"06","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"4171","date_updated":"2022-02-24T09:39:29Z","publisher":"Springer","oa_version":"None","date_created":"2018-12-11T11:59:15Z","publication":"Journal of Statistical Physics","issue":"5-6","_id":"2721","article_processing_charge":"No","type":"journal_article","author":[{"last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"first_name":"Dao","last_name":"Tuyen","full_name":"Tuyen, Dao"}],"day":"01","title":"Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier","volume":59,"status":"public","page":"1589 - 1602","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"}],"quality_controlled":"1","doi":"10.1007/BF01334766","citation":{"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>","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>.","short":"L. Erdös, D. Tuyen, Journal of Statistical Physics 59 (1990) 1589–1602.","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.","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>."},"extern":"1","year":"1990","publication_identifier":{"issn":["0022-4715"],"eissn":["1572-9613"]},"language":[{"iso":"eng"}],"intvolume":"        59"},{"page":"277 - 289","external_id":{"pmid":["2559205 "]},"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."}],"quality_controlled":"1","doi":"10.1007/BF01870958","citation":{"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>","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.","ista":"Jonas PM. 1989. Temperature dependence of gating current in myelinated nerve fibers. Journal of Membrane Biology. 112(3), 277–289.","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>.","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.","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>."},"extern":"1","intvolume":"       112","pmid":1,"year":"1989","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0022-2631"],"eissn":["1432-1424"]},"scopus_import":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01870958"}],"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-02-15T08:59:02Z","publist_id":"2922","publisher":"Springer","article_type":"original","date_published":"1989-12-01T00:00:00Z","month":"12","author":[{"first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804"}],"oa_version":"None","date_created":"2018-12-11T12:03:28Z","publication":"Journal of Membrane Biology","_id":"3465","type":"journal_article","issue":"3","article_processing_charge":"No","volume":112,"title":"Temperature dependence of gating current in myelinated nerve fibers","status":"public","day":"01"},{"external_id":{"pmid":["2550937 "]},"page":"7238 - 7242","abstract":[{"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.","lang":"eng"}],"oa":1,"extern":"1","quality_controlled":"1","doi":"10.1073/pnas.86.18.7238","citation":{"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>.","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.","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.","short":"P.M. Jonas, M. Bräu, M. Hermsteiner, W. Vogel, PNAS 86 (1989) 7238–7242.","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>.","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>","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>"},"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.","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"language":[{"iso":"eng"}],"year":"1989","intvolume":"        86","pmid":1,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC298032/?tool=pubmed"}],"article_type":"original","month":"09","date_published":"1989-09-01T00:00:00Z","publist_id":"2921","date_updated":"2022-02-14T16:12:33Z","publisher":"National Academy of Sciences","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"PNAS","type":"journal_article","_id":"3466","article_processing_charge":"No","issue":"18","date_created":"2018-12-11T12:03:28Z","oa_version":"Published Version","author":[{"orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","last_name":"Jonas"},{"first_name":"Michael","last_name":"Bräu","full_name":"Bräu, Michael"},{"first_name":"Markus","last_name":"Hermsteiner","full_name":"Hermsteiner, Markus"},{"full_name":"Vogel, Werner","first_name":"Werner","last_name":"Vogel"}],"day":"01","status":"public","title":"Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels","volume":86},{"page":"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"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Institute of the Electronics, Information and Communication Enginneers","date_updated":"2022-02-14T14:34:06Z","publist_id":"2836","abstract":[{"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. ","lang":"eng"}],"month":"01","date_published":"1989-01-01T00:00:00Z","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"}],"conference":{"name":"International Workshop on Discrete Algorithms and Complexity"},"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. ","citation":{"ista":"Edelsbrunner H. 1989. Spatial triangulations with dihedral angle conditions. International Workshop on Discrete Algorithms and Complexity, 83–89.","ieee":"H. Edelsbrunner, “Spatial triangulations with dihedral angle conditions,” presented at the International Workshop on Discrete Algorithms and Complexity, 1989, pp. 83–89.","mla":"Edelsbrunner, Herbert. <i>Spatial Triangulations with Dihedral Angle Conditions</i>. 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.","chicago":"Edelsbrunner, Herbert. “Spatial Triangulations with Dihedral Angle Conditions,” 83–89. Institute of the Electronics, Information and Communication Enginneers, 1989.","short":"H. Edelsbrunner, in:, 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."},"quality_controlled":"1","date_created":"2018-12-11T12:03:54Z","oa_version":"None","_id":"3549","type":"conference","article_processing_charge":"No","extern":"1","title":"Spatial triangulations with dihedral angle conditions","status":"public","day":"01","year":"1989","language":[{"iso":"eng"}]},{"external_id":{"pmid":["2759433"]},"page":"967 - 976","abstract":[{"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.","lang":"eng"}],"oa":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.","extern":"1","quality_controlled":"1","citation":{"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>.","ista":"Mallet J, Barton NH. 1989. Inference from clines stabilized by frequency-dependent selection. Genetics. 122(4), 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.","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>.","short":"J. Mallet, N.H. Barton, Genetics 122 (1989) 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>"},"doi":"10.1093/genetics/122.4.967","intvolume":"       122","pmid":1,"publication_identifier":{"issn":["0016-6731"]},"language":[{"iso":"eng"}],"year":"1989","scopus_import":"1","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1203771","open_access":"1"}],"date_updated":"2022-02-14T14:07:12Z","publist_id":"2731","publisher":"Genetics Society of America","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_type":"original","month":"08","date_published":"1989-08-01T00:00:00Z","author":[{"full_name":"Mallet, James","first_name":"James","last_name":"Mallet"},{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"publication":"Genetics","_id":"3652","article_processing_charge":"No","issue":"4","type":"journal_article","oa_version":"None","date_created":"2018-12-11T12:04:27Z","status":"public","volume":122,"title":"Inference from clines stabilized by frequency-dependent selection","day":"01"},{"scopus_import":"1","main_file_link":[{"url":"https://www.jstor.org/stable/2409217?origin=crossref&seq=1#metadata_info_tab_contents"}],"date_updated":"2022-02-14T11:00:42Z","publist_id":"2730","publisher":"Wiley-Blackwell","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_type":"original","date_published":"1989-01-01T00:00:00Z","month":"01","author":[{"full_name":"Mallet, James","last_name":"Mallet","first_name":"James"},{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"publication":"Evolution","issue":"2","_id":"3653","type":"journal_article","article_processing_charge":"No","oa_version":"None","date_created":"2018-12-11T12:04:27Z","status":"public","volume":43,"title":"Strong natural selection in a warning color hybrid zone","day":"01","external_id":{"pmid":["28568556 "]},"page":"421 - 431","abstract":[{"text":"Frequency-dependent selection on warning color can maintain narrow hybrid zones between unpalatable prey taxa. To measure such selection, we transferred marked Heliconius erato (Lepidoptera: Nymphalidae) in both directions across a 10-km-wide hybrid zone between Peruvian races differing in color pattern. These experimental H. erato were released at four sites, along with control H. erato of the phenotype native to each site. Survival of experimental butterflies was significantly lower than that of controls at two sites and overall. Most selection, measured as differences in survival, occurred soon after release. Selection against foreign morphs was 52% (confidence limits: 25-71%) and was probably due to bird attacks on unusual warning-color morphs (more than 10% of the recaptures had beak marks). Since only three major loci determine the color-pattern differences, this suggests an average selection coefficient of 0.17 per locus, sufficient to maintain the narrow clines in H. erato.","lang":"eng"}],"acknowledgement":"We thank G.Lamas for sharing his knowledge of the Tarapoto hybrid zone;  M.A.Arboleda, H.Eeley, S.Knapp, M.Muedas, and J.Santisteban for their help in the field;  P.Donnelly and C.Smith for statistical advice; and S.Jones, S.Knapp, G.Lamas, and the reviewers for helpful comments on the manuscript. We are grateful to the Natural Environment Research Council, the Royal Society, and the Nuffield Foundation for funding this research.","extern":"1","quality_controlled":"1","doi":"10.2307/2409217 ","citation":{"mla":"Mallet, James, and Nicholas H. Barton. “Strong Natural Selection in a Warning Color Hybrid Zone.” <i>Evolution</i>, vol. 43, no. 2, Wiley-Blackwell, 1989, pp. 421–31, doi:<a href=\"https://doi.org/10.2307/2409217 \">10.2307/2409217 </a>.","ista":"Mallet J, Barton NH. 1989. Strong natural selection in a warning color hybrid zone. Evolution. 43(2), 421–431.","ieee":"J. Mallet and N. H. Barton, “Strong natural selection in a warning color hybrid zone,” <i>Evolution</i>, vol. 43, no. 2. Wiley-Blackwell, pp. 421–431, 1989.","short":"J. Mallet, N.H. Barton, Evolution 43 (1989) 421–431.","chicago":"Mallet, James, and Nicholas H Barton. “Strong Natural Selection in a Warning Color Hybrid Zone.” <i>Evolution</i>. Wiley-Blackwell, 1989. <a href=\"https://doi.org/10.2307/2409217 \">https://doi.org/10.2307/2409217 </a>.","apa":"Mallet, J., &#38; Barton, N. H. (1989). Strong natural selection in a warning color hybrid zone. <i>Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.2307/2409217 \">https://doi.org/10.2307/2409217 </a>","ama":"Mallet J, Barton NH. Strong natural selection in a warning color hybrid zone. <i>Evolution</i>. 1989;43(2):421-431. doi:<a href=\"https://doi.org/10.2307/2409217 \">10.2307/2409217 </a>"},"intvolume":"        43","pmid":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1558-5646"],"issn":["0014-3820"]},"year":"1989"},{"volume":341,"title":"Adaptation, speciation and hybrid zones","status":"public","day":"12","author":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton"},{"first_name":"Godfrey","last_name":"Hewitt","full_name":"Hewitt, Godfrey"}],"date_created":"2018-12-11T12:04:27Z","oa_version":"None","_id":"3654","article_processing_charge":"No","type":"journal_article","publication":"Nature","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Nature Publishing Group","publist_id":"2729","date_updated":"2022-02-14T10:13:44Z","month":"10","date_published":"1989-10-12T00:00:00Z","article_type":"original","scopus_import":"1","main_file_link":[{"url":"https://www.nature.com/articles/341497a0"}],"pmid":1,"intvolume":"       341","year":"1989","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"citation":{"apa":"Barton, N. H., &#38; Hewitt, G. (1989). Adaptation, speciation and hybrid zones. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/341497a0\">https://doi.org/10.1038/341497a0</a>","short":"N.H. Barton, G. Hewitt, Nature 341 (1989) 497–503.","chicago":"Barton, Nicholas H, and Godfrey Hewitt. “Adaptation, Speciation and Hybrid Zones.” <i>Nature</i>. Nature Publishing Group, 1989. <a href=\"https://doi.org/10.1038/341497a0\">https://doi.org/10.1038/341497a0</a>.","ista":"Barton NH, Hewitt G. 1989. Adaptation, speciation and hybrid zones. Nature. 341, 497–503.","ieee":"N. H. Barton and G. Hewitt, “Adaptation, speciation and hybrid zones,” <i>Nature</i>, vol. 341. Nature Publishing Group, pp. 497–503, 1989.","mla":"Barton, Nicholas H., and Godfrey Hewitt. “Adaptation, Speciation and Hybrid Zones.” <i>Nature</i>, vol. 341, Nature Publishing Group, 1989, pp. 497–503, doi:<a href=\"https://doi.org/10.1038/341497a0\">10.1038/341497a0</a>.","ama":"Barton NH, Hewitt G. Adaptation, speciation and hybrid zones. <i>Nature</i>. 1989;341:497-503. doi:<a href=\"https://doi.org/10.1038/341497a0\">10.1038/341497a0</a>"},"doi":"10.1038/341497a0","quality_controlled":"1","extern":"1","abstract":[{"lang":"eng","text":"Many species are divided into a mosaic of genetically distinct populations, separated by narrow zones of hybridization. Studies of hybrid zones allow us to quantify the genetic differences responsible for speciation, to measure the diffusion of genes between diverging taxa, and to understand the spread of alternative adaptations."}],"page":"497 - 503","external_id":{"pmid":["2677747 "]}},{"intvolume":"        96","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1930-0972"],"issn":["0002-9890"]},"year":"1989","acknowledgement":"Research supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862","extern":"1","quality_controlled":"1","doi":"10.1080/00029890.1989.11972250","citation":{"mla":"Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor Pairs in a Point Set.” <i>American Mathematical Monthly</i>, vol. 96, no. 7, Mathematical Association of America, 1989, pp. 614–18, doi:<a href=\"https://doi.org/10.1080/00029890.1989.11972250\">10.1080/00029890.1989.11972250</a>.","ieee":"H. Edelsbrunner and S. Skiena, “On the number of furthest neighbor pairs in a point set,” <i>American Mathematical Monthly</i>, vol. 96, no. 7. Mathematical Association of America, pp. 614–618, 1989.","ista":"Edelsbrunner H, Skiena S. 1989. On the number of furthest neighbor pairs in a point set. American Mathematical Monthly. 96(7), 614–618.","short":"H. Edelsbrunner, S. Skiena, American Mathematical Monthly 96 (1989) 614–618.","chicago":"Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor Pairs in a Point Set.” <i>American Mathematical Monthly</i>. Mathematical Association of America, 1989. <a href=\"https://doi.org/10.1080/00029890.1989.11972250\">https://doi.org/10.1080/00029890.1989.11972250</a>.","apa":"Edelsbrunner, H., &#38; Skiena, S. (1989). On the number of furthest neighbor pairs in a point set. <i>American Mathematical Monthly</i>. Mathematical Association of America. <a href=\"https://doi.org/10.1080/00029890.1989.11972250\">https://doi.org/10.1080/00029890.1989.11972250</a>","ama":"Edelsbrunner H, Skiena S. On the number of furthest neighbor pairs in a point set. <i>American Mathematical Monthly</i>. 1989;96(7):614-618. doi:<a href=\"https://doi.org/10.1080/00029890.1989.11972250\">10.1080/00029890.1989.11972250</a>"},"page":"614 - 618","status":"public","title":"On the number of furthest neighbor pairs in a point set","volume":96,"day":"01","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"first_name":"Steven","last_name":"Skiena","full_name":"Skiena, Steven"}],"publication":"American Mathematical Monthly","type":"journal_article","issue":"7","_id":"4079","article_processing_charge":"No","date_created":"2018-12-11T12:06:49Z","oa_version":"None","date_updated":"2022-02-11T12:59:01Z","publist_id":"2042","publisher":"Mathematical Association of America","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_type":"original","date_published":"1989-01-01T00:00:00Z","month":"01","main_file_link":[{"url":"http://www.jstor.org/stable/2325182 "}]},{"acknowledgement":"Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by the National Science Foundation under Grant CCR-8714565, by the second author has been partially supported by the Digital Equipment Corporation, by the fourth author has been partially supported by the Office of Naval Research under Grant N00014-86K-0416.","doi":"10.1007/BF00181432","citation":{"ama":"Edelsbrunner H, Hasan N, Seidel R, Shen X. Circles through two points that always enclose many points. <i>Geometriae Dedicata</i>. 1989;32(1):1-12. doi:<a href=\"https://doi.org/10.1007/BF00181432\">10.1007/BF00181432</a>","ista":"Edelsbrunner H, Hasan N, Seidel R, Shen X. 1989. Circles through two points that always enclose many points. Geometriae Dedicata. 32(1), 1–12.","ieee":"H. Edelsbrunner, N. Hasan, R. Seidel, and X. Shen, “Circles through two points that always enclose many points,” <i>Geometriae Dedicata</i>, vol. 32, no. 1. Springer, pp. 1–12, 1989.","mla":"Edelsbrunner, Herbert, et al. “Circles through Two Points That Always Enclose Many Points.” <i>Geometriae Dedicata</i>, vol. 32, no. 1, Springer, 1989, pp. 1–12, doi:<a href=\"https://doi.org/10.1007/BF00181432\">10.1007/BF00181432</a>.","apa":"Edelsbrunner, H., Hasan, N., Seidel, R., &#38; Shen, X. (1989). Circles through two points that always enclose many points. <i>Geometriae Dedicata</i>. Springer. <a href=\"https://doi.org/10.1007/BF00181432\">https://doi.org/10.1007/BF00181432</a>","chicago":"Edelsbrunner, Herbert, Nany Hasan, Raimund Seidel, and Xiao Shen. “Circles through Two Points That Always Enclose Many Points.” <i>Geometriae Dedicata</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF00181432\">https://doi.org/10.1007/BF00181432</a>.","short":"H. Edelsbrunner, N. Hasan, R. Seidel, X. Shen, Geometriae Dedicata 32 (1989) 1–12."},"quality_controlled":"1","extern":"1","intvolume":"        32","year":"1989","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0046-5755"],"eissn":["1572-9168"]},"page":"1 - 12","abstract":[{"text":"This paper proves that any set of n points in the plane contains two points such that any circle through those two points encloses at least n12−112+O(1)n47  points of the set. The main ingredients used in the proof of this result are edge counting formulas for k-order Voronoi diagrams and a lower bound on the minimum number of semispaces of size at most k.","lang":"eng"}],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Hasan, Nany","first_name":"Nany","last_name":"Hasan"},{"last_name":"Seidel","first_name":"Raimund","full_name":"Seidel, Raimund"},{"first_name":"Xiao","last_name":"Shen","full_name":"Shen, Xiao"}],"date_created":"2018-12-11T12:06:49Z","oa_version":"None","_id":"4080","type":"journal_article","article_processing_charge":"No","issue":"1","publication":"Geometriae Dedicata","volume":32,"title":"Circles through two points that always enclose many points","status":"public","day":"01","scopus_import":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF00181432"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Springer","publist_id":"2043","date_updated":"2022-02-14T09:55:28Z","month":"10","date_published":"1989-10-01T00:00:00Z","article_type":"original"},{"article_type":"original","date_published":"1989-12-01T00:00:00Z","month":"12","publist_id":"2038","date_updated":"2022-02-10T15:53:48Z","publisher":"Springer","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187733","open_access":"1"}],"day":"01","status":"public","volume":4,"title":"The upper envelope of piecewise linear functions: Algorithms and applications","publication":"Discrete & Computational Geometry","_id":"4081","type":"journal_article","issue":"1","article_processing_charge":"No","date_created":"2018-12-11T12:06:50Z","oa_version":"Published Version","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Leonidas","last_name":"Guibas","full_name":"Guibas, Leonidas"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"abstract":[{"lang":"eng","text":"This paper studies applications of envelopes of piecewise linear functions to problems in computational geometry. Among these applications we find problems involving hidden line/surface elimination, motion planning, transversals of polytopes, and a new type of Voronoi diagram for clusters of points. All results are either combinatorial or computational in nature. They are based on the combinatorial analysis in two companion papers [PS] and [E2] and a divide-and-conquer algorithm for computing envelopes described in this paper."}],"oa":1,"page":"311 - 336","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"year":"1989","intvolume":"         4","extern":"1","quality_controlled":"1","citation":{"mla":"Edelsbrunner, Herbert, et al. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 311–36, doi:<a href=\"https://doi.org/10.1007/BF02187733\">10.1007/BF02187733</a>.","ieee":"H. Edelsbrunner, L. Guibas, and M. Sharir, “The upper envelope of piecewise linear functions: Algorithms and applications,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1. Springer, pp. 311–336, 1989.","ista":"Edelsbrunner H, Guibas L, Sharir M. 1989. The upper envelope of piecewise linear functions: Algorithms and applications. Discrete &#38; Computational Geometry. 4(1), 311–336.","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187733\">https://doi.org/10.1007/BF02187733</a>.","short":"H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &#38; Computational Geometry 4 (1989) 311–336.","apa":"Edelsbrunner, H., Guibas, L., &#38; Sharir, M. (1989). The upper envelope of piecewise linear functions: Algorithms and applications. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187733\">https://doi.org/10.1007/BF02187733</a>","ama":"Edelsbrunner H, Guibas L, Sharir M. The upper envelope of piecewise linear functions: Algorithms and applications. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):311-336. doi:<a href=\"https://doi.org/10.1007/BF02187733\">10.1007/BF02187733</a>"},"doi":"10.1007/BF02187733","acknowledgement":"Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862. Work by the third author has been supported by the Office of Naval Research Grant N00014-82-K-0381, 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 NCRD, the Israeli National Council for Research and Development."},{"abstract":[{"lang":"eng","text":"Sweeping a collection of figures in the Euclidean plane with a straight line is one of the novel algorithmic paradigms that have emerged in the field of computational geometry. In this paper we demonstrate the advantages of sweeping with a topological line that is not necessarily straight. We show how an arrangement of n lines in the plane can be swept over in O(n2) time and O(n) space by a such a line. In the process each element, i.e., vertex, edge, or region, is visited once in a consistent ordering. Our technique makes use of novel data structures which exhibit interesting amortized complexity behavior; the result is an algorithm that improves upon all its predecessors either in the space or the time bounds, as well as being eminently practical. Numerous applications of the technique to problems in computational geometry are given—many through the use of duality transforms. Examples include solving visibility problems, detecting degeneracies in configurations, computing the extremal shadows of convex polytopes, and others. Even though our basic technique solves a planar problem, its applications include several problems in higher dimensions."}],"oa":1,"page":"165 - 194","intvolume":"        38","publication_identifier":{"issn":["0022-0000"],"eissn":["1090-2724"]},"language":[{"iso":"eng"}],"year":"1989","acknowledgement":"he authors wish to thank Raimund Seidel for suggesting the argument that we used to prove Theorem 3.1, Harald Rosenberger who implemented the topological sweep and compared it with a straight line sweep, the students who took the Stanford 1985 analysis of algorithms qualifying examination and suffered through a version of this problem, and finally Lyle Ramshaw and Cynthia Hibbard for their detailed reading and comments on the manuscript. The constructive criticism of an anonymous referee is also appreciated.","extern":"1","quality_controlled":"1","doi":"10.1016/0022-0000(89)90038-X","citation":{"ama":"Edelsbrunner H, Guibas L. Topologically sweeping an arrangement. <i>Journal of Computer and System Sciences</i>. 1989;38(1):165-194. doi:<a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">10.1016/0022-0000(89)90038-X</a>","chicago":"Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.” <i>Journal of Computer and System Sciences</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">https://doi.org/10.1016/0022-0000(89)90038-X</a>.","short":"H. Edelsbrunner, L. Guibas, Journal of Computer and System Sciences 38 (1989) 165–194.","apa":"Edelsbrunner, H., &#38; Guibas, L. (1989). Topologically sweeping an arrangement. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">https://doi.org/10.1016/0022-0000(89)90038-X</a>","mla":"Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.” <i>Journal of Computer and System Sciences</i>, vol. 38, no. 1, Elsevier, 1989, pp. 165–94, doi:<a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">10.1016/0022-0000(89)90038-X</a>.","ista":"Edelsbrunner H, Guibas L. 1989. Topologically sweeping an arrangement. Journal of Computer and System Sciences. 38(1), 165–194.","ieee":"H. Edelsbrunner and L. Guibas, “Topologically sweeping an arrangement,” <i>Journal of Computer and System Sciences</i>, vol. 38, no. 1. Elsevier, pp. 165–194, 1989."},"publist_id":"2039","date_updated":"2022-02-10T16:06:05Z","publisher":"Elsevier","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_type":"original","month":"02","date_published":"1989-02-01T00:00:00Z","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/002200008990038X?via%3Dihub"}],"status":"public","volume":38,"title":"Topologically sweeping an arrangement","day":"01","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"}],"publication":"Journal of Computer and System Sciences","type":"journal_article","_id":"4082","issue":"1","article_processing_charge":"No","oa_version":"Published Version","date_created":"2018-12-11T12:06:50Z"},{"author":[{"full_name":"Yao, F.","first_name":"F.","last_name":"Yao"},{"full_name":"Dobkin, David","first_name":"David","last_name":"Dobkin"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"last_name":"Paterson","first_name":"Michael","full_name":"Paterson, Michael"}],"date_created":"2018-12-11T12:06:50Z","oa_version":"Published Version","publication":"SIAM Journal on Computing","article_processing_charge":"No","_id":"4083","type":"journal_article","issue":"2","volume":18,"title":"Partitioning space for range queries","status":"public","day":"01","scopus_import":"1","main_file_link":[{"url":"https://epubs.siam.org/doi/10.1137/0218025","open_access":"1"}],"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-02-11T07:55:48Z","publist_id":"2040","publisher":"SIAM","article_type":"original","month":"04","date_published":"1989-04-01T00:00:00Z","quality_controlled":"1","citation":{"ama":"Yao F, Dobkin D, Edelsbrunner H, Paterson M. Partitioning space for range queries. <i>SIAM Journal on Computing</i>. 1989;18(2):371-384. doi:<a href=\"https://doi.org/10.1137/0218025\">10.1137/0218025</a>","apa":"Yao, F., Dobkin, D., Edelsbrunner, H., &#38; Paterson, M. (1989). Partitioning space for range queries. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0218025\">https://doi.org/10.1137/0218025</a>","chicago":"Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning Space for Range Queries.” <i>SIAM Journal on Computing</i>. SIAM, 1989. <a href=\"https://doi.org/10.1137/0218025\">https://doi.org/10.1137/0218025</a>.","short":"F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.","ista":"Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for range queries. SIAM Journal on Computing. 18(2), 371–384.","ieee":"F. Yao, D. Dobkin, H. Edelsbrunner, and M. Paterson, “Partitioning space for range queries,” <i>SIAM Journal on Computing</i>, vol. 18, no. 2. SIAM, pp. 371–384, 1989.","mla":"Yao, F., et al. “Partitioning Space for Range Queries.” <i>SIAM Journal on Computing</i>, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:<a href=\"https://doi.org/10.1137/0218025\">10.1137/0218025</a>."},"doi":"10.1137/0218025","extern":"1","intvolume":"        18","year":"1989","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"page":"371 - 384","abstract":[{"lang":"eng","text":"It is shown that, given a set S of n points in $R^3 $, one can always find three planes that form an eight-partition of S, that is, a partition where at most ${n / 8}$ points of S lie in each of the eight open regions. This theorem is used to define a data structure, called an octant tree, for representing any point set in $R^3 $. An octant tree for n points occupies $O(n)$ space and can be constructed in polynomial time. With this data structure and its refinements, efficient solutions to various range query problems in two and three dimensions can be obtained, including (1) half-space queries: find all points of S that lie to one side of any given plane; (2) polyhedron queries: find all points that lie inside (outside) any given polyhedron; and (3) circle queries in $R^2 $: for a planar set S, find all points that lie inside (outside) any given circle. The retrieval time for all these queries is $T(n) = O(n^\\alpha + m)$, where $\\alpha = 0.8988$ (or 0.8471 in case (3)), and m is the size of the output. This performance is the best currently known for linear-space data structures that can be deterministically constructed in polynomial time."}],"oa":1},{"page":"157 - 180","oa":1,"abstract":[{"text":"A tour  of a finite set P of points is a necklace-tour if there are disks with the points in P as centers such that two disks intersect if and only if their centers are adjacent in . It has been observed by Sanders that a necklace-tour is an optimal traveling salesman tour.\r\n\r\nIn this paper, we present an algorithm that either reports that no necklace-tour exists or outputs a necklace-tour of a given set of n points in O(n2 log n) time. If a tour is given, then we can test in O(n2) time whether or not this tour is a necklace-tour. Both algorithms can be generalized to ƒ-factors of point sets in the plane. The complexity results rely on a combinatorial analysis of certain intersection graphs of disks defined for finite sets of points in the plane.","lang":"eng"}],"doi":"10.1016/0304-3975(89)90133-3","citation":{"mla":"Edelsbrunner, Herbert, et al. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” <i>Theoretical Computer Science</i>, vol. 66, no. 2, Elsevier, 1989, pp. 157–80, doi:<a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">10.1016/0304-3975(89)90133-3</a>.","ieee":"H. Edelsbrunner, G. Rote, and E. Welzl, “Testing the necklace condition for shortest tours and optimal factors in the plane,” <i>Theoretical Computer Science</i>, vol. 66, no. 2. Elsevier, pp. 157–180, 1989.","ista":"Edelsbrunner H, Rote G, Welzl E. 1989. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 66(2), 157–180.","chicago":"Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” <i>Theoretical Computer Science</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">https://doi.org/10.1016/0304-3975(89)90133-3</a>.","short":"H. Edelsbrunner, G. Rote, E. Welzl, Theoretical Computer Science 66 (1989) 157–180.","apa":"Edelsbrunner, H., Rote, G., &#38; Welzl, E. (1989). Testing the necklace condition for shortest tours and optimal factors in the plane. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">https://doi.org/10.1016/0304-3975(89)90133-3</a>","ama":"Edelsbrunner H, Rote G, Welzl E. Testing the necklace condition for shortest tours and optimal factors in the plane. <i>Theoretical Computer Science</i>. 1989;66(2):157-180. doi:<a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">10.1016/0304-3975(89)90133-3</a>"},"quality_controlled":"1","extern":"1","year":"1989","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1879-2294"],"issn":["0304-3975"]},"intvolume":"        66","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0304397589901333?via%3Dihub","open_access":"1"}],"scopus_import":"1","date_published":"1989-08-01T00:00:00Z","month":"08","article_type":"original","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Elsevier","date_updated":"2022-02-11T11:15:43Z","publist_id":"2041","oa_version":"Published Version","date_created":"2018-12-11T12:06:51Z","article_processing_charge":"No","_id":"4084","type":"journal_article","issue":"2","publication":"Theoretical Computer Science","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Rote, Günter","first_name":"Günter","last_name":"Rote"},{"first_name":"Emo","last_name":"Welzl","full_name":"Welzl, Emo"}],"day":"01","volume":66,"title":"Testing the necklace condition for shortest tours and optimal factors in the plane","status":"public"},{"status":"public","title":"An acyclicity theorem for cell complexes in d dimension","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-0-89791-318-8"]},"day":"01","year":"1989","conference":{"name":"SCG: Symposium on Computational Geometry","location":"Saarbruchen, Germany","end_date":"1989-06-07","start_date":"1989-06-05"},"author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"}],"publication":"Proceedings of the 5th annual symposium on Computational geometry","extern":"1","_id":"4085","type":"conference","article_processing_charge":"No","date_created":"2018-12-11T12:06:51Z","quality_controlled":"1","oa_version":"None","citation":{"ama":"Edelsbrunner H. An acyclicity theorem for cell complexes in d dimension. In: <i>Proceedings of the 5th Annual Symposium on Computational Geometry</i>. ACM; 1989:145-151. doi:<a href=\"https://doi.org/10.1145/73833.73850\">10.1145/73833.73850</a>","mla":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” <i>Proceedings of the 5th Annual Symposium on Computational Geometry</i>, ACM, 1989, pp. 145–51, doi:<a href=\"https://doi.org/10.1145/73833.73850\">10.1145/73833.73850</a>.","ista":"Edelsbrunner H. 1989. An acyclicity theorem for cell complexes in d dimension. Proceedings of the 5th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 145–151.","ieee":"H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” in <i>Proceedings of the 5th annual symposium on Computational geometry</i>, Saarbruchen, Germany, 1989, pp. 145–151.","short":"H. Edelsbrunner, in:, Proceedings of the 5th Annual Symposium on Computational Geometry, ACM, 1989, pp. 145–151.","chicago":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” In <i>Proceedings of the 5th Annual Symposium on Computational Geometry</i>, 145–51. ACM, 1989. <a href=\"https://doi.org/10.1145/73833.73850\">https://doi.org/10.1145/73833.73850</a>.","apa":"Edelsbrunner, H. (1989). An acyclicity theorem for cell complexes in d dimension. In <i>Proceedings of the 5th annual symposium on Computational geometry</i> (pp. 145–151). Saarbruchen, Germany: ACM. <a href=\"https://doi.org/10.1145/73833.73850\">https://doi.org/10.1145/73833.73850</a>"},"doi":"10.1145/73833.73850","date_updated":"2022-02-10T10:56:49Z","publist_id":"2033","publisher":"ACM","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","month":"06","date_published":"1989-06-01T00:00:00Z","abstract":[{"text":"Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in_front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry.","lang":"eng"}],"page":"145 - 151","scopus_import":"1","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/73833.73850"}]},{"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://link.springer.com/article/10.1007/BF02187734"}],"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"2034","date_updated":"2022-02-10T11:08:12Z","publisher":"Springer","article_type":"original","date_published":"1989-11-01T00:00:00Z","month":"11","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"}],"date_created":"2018-12-11T12:06:51Z","oa_version":"Published Version","publication":"Discrete & Computational Geometry","issue":"4","_id":"4086","type":"journal_article","article_processing_charge":"No","volume":4,"title":"The upper envelope of piecewise linear functions: Tight bounds on the number of faces ","status":"public","day":"01","page":"337 - 343","abstract":[{"text":"This note proves that the maximum number of faces (of any dimension) of the upper envelope of a set ofn possibly intersectingd-simplices ind+1 dimensions is (n d (n)). This is an extension of a result of Pach and Sharir [PS] who prove the same bound for the number ofd-dimensional faces of the upper envelope.","lang":"eng"}],"oa":1,"acknowledgement":"This work was supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by the National Science Foundation under Grant CCR-8714565. Research on the presented result was partially carried out while the author worked for the IBM T. J. Watson Research Center at Yorktown Height, New York, USA. \r\n","quality_controlled":"1","doi":"10.1007/BF02187734","citation":{"ista":"Edelsbrunner H. 1989. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete &#38; Computational Geometry. 4(4), 337–343.","ieee":"H. Edelsbrunner, “The upper envelope of piecewise linear functions: Tight bounds on the number of faces ,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 4. Springer, pp. 337–343, 1989.","mla":"Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 4, Springer, 1989, pp. 337–43, doi:<a href=\"https://doi.org/10.1007/BF02187734\">10.1007/BF02187734</a>.","apa":"Edelsbrunner, H. (1989). The upper envelope of piecewise linear functions: Tight bounds on the number of faces . <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187734\">https://doi.org/10.1007/BF02187734</a>","short":"H. Edelsbrunner, Discrete &#38; Computational Geometry 4 (1989) 337–343.","chicago":"Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187734\">https://doi.org/10.1007/BF02187734</a>.","ama":"Edelsbrunner H. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . <i>Discrete &#38; Computational Geometry</i>. 1989;4(4):337-343. doi:<a href=\"https://doi.org/10.1007/BF02187734\">10.1007/BF02187734</a>"},"extern":"1","intvolume":"         4","year":"1989","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]}}]