[{"author":[{"full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto"},{"full_name":"Yokota, Yoshifumi","last_name":"Yokota","first_name":"Yoshifumi"},{"full_name":"Tsuchida, Kunihiro","first_name":"Kunihiro","last_name":"Tsuchida"},{"last_name":"Nakanishi","first_name":"Shigetada","full_name":"Nakanishi, Shigetada"}],"volume":265,"date_updated":"2022-02-24T11:07:05Z","date_created":"2018-12-11T11:57:55Z","pmid":1,"year":"1990","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.","publisher":"American Society for Biochemistry and Molecular Biology","publication_status":"published","publist_id":"4421","extern":"1","doi":"10.1016/s0021-9258(19)40095-1 ","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0021925819400951"}],"external_id":{"pmid":["2153106 "]},"oa":1,"quality_controlled":"1","publication_identifier":{"issn":["0021-9258"],"eissn":["1083-351X"]},"month":"01","oa_version":"Published Version","_id":"2480","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":" 265","status":"public","title":"Cloning and expression of a rat neuromedin K receptor cDNA","issue":"2","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 > substance K > 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"}],"type":"journal_article","date_published":"1990-01-15T00:00:00Z","citation":{"chicago":"Shigemoto, Ryuichi, Yoshifumi Yokota, Kunihiro Tsuchida, and Shigetada Nakanishi. “Cloning and Expression of a Rat Neuromedin K Receptor CDNA.” Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology, 1990. https://doi.org/10.1016/s0021-9258(19)40095-1 .","short":"R. Shigemoto, Y. Yokota, K. Tsuchida, S. Nakanishi, Journal of Biological Chemistry 265 (1990) 623–628.","mla":"Shigemoto, Ryuichi, et al. “Cloning and Expression of a Rat Neuromedin K Receptor CDNA.” Journal of Biological Chemistry, vol. 265, no. 2, American Society for Biochemistry and Molecular Biology, 1990, pp. 623–28, doi:10.1016/s0021-9258(19)40095-1 .","ieee":"R. Shigemoto, Y. Yokota, K. Tsuchida, and S. Nakanishi, “Cloning and expression of a rat neuromedin K receptor cDNA,” Journal of Biological Chemistry, vol. 265, no. 2. American Society for Biochemistry and Molecular Biology, pp. 623–628, 1990.","apa":"Shigemoto, R., Yokota, Y., Tsuchida, K., & Nakanishi, S. (1990). Cloning and expression of a rat neuromedin K receptor cDNA. Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology. https://doi.org/10.1016/s0021-9258(19)40095-1 ","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. Journal of Biological Chemistry. 1990;265(2):623-628. doi:10.1016/s0021-9258(19)40095-1 "},"publication":"Journal of Biological Chemistry","page":"623 - 628","article_type":"original","article_processing_charge":"No","day":"15","scopus_import":"1"},{"publist_id":"4420","extern":"1","author":[{"full_name":"Tsuchida, Kunihiro","last_name":"Tsuchida","first_name":"Kunihiro"},{"full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","first_name":"Ryuichi"},{"full_name":"Yokota, Yoshifumi","last_name":"Yokota","first_name":"Yoshifumi"},{"full_name":"Nakanishi, Shigetada","first_name":"Shigetada","last_name":"Nakanishi"}],"date_created":"2018-12-11T11:57:55Z","date_updated":"2022-02-24T10:20:14Z","volume":193,"year":"1990","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","pmid":1,"publication_status":"published","publisher":"Wiley-Blackwell","month":"03","publication_identifier":{"eissn":["1432-1033"],"issn":["0014-2956"]},"doi":"10.1111/j.1432-1033.1990.tb19396.x","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://febs.onlinelibrary.wiley.com/doi/10.1111/j.1432-1033.1990.tb19396.x"}],"oa":1,"external_id":{"pmid":["1701145"]},"quality_controlled":"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"}],"issue":"3","type":"journal_article","oa_version":"Published Version","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"2481","title":"Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors","status":"public","intvolume":" 193","day":"03","article_processing_charge":"No","scopus_import":"1","date_published":"1990-03-03T00:00:00Z","publication":"European Journal of Biochemistry","citation":{"ama":"Tsuchida K, Shigemoto R, Yokota Y, Nakanishi S. Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors. European Journal of Biochemistry. 1990;193(3):751-757. doi:10.1111/j.1432-1033.1990.tb19396.x","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,” European Journal of Biochemistry, vol. 193, no. 3. Wiley-Blackwell, pp. 751–757, 1990.","apa":"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. Wiley-Blackwell. https://doi.org/10.1111/j.1432-1033.1990.tb19396.x","mla":"Tsuchida, Kunihiro, et al. “Tissue Distribution and Quantitation of the MRNAs for Three Rat Tachykinin Receptors.” European Journal of Biochemistry, vol. 193, no. 3, Wiley-Blackwell, 1990, pp. 751–57, doi:10.1111/j.1432-1033.1990.tb19396.x.","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.” European Journal of Biochemistry. Wiley-Blackwell, 1990. https://doi.org/10.1111/j.1432-1033.1990.tb19396.x."},"article_type":"original","page":"751 - 757"},{"month":"01","publication_identifier":{"issn":["0022-2631"],"eissn":["1432-1424"]},"language":[{"iso":"eng"}],"doi":"10.1007/BF01869604","quality_controlled":"1","external_id":{"pmid":["2154581"]},"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01869604"}],"extern":"1","publist_id":"4371","date_updated":"2022-02-24T09:55:39Z","date_created":"2018-12-11T11:58:12Z","volume":113,"author":[{"first_name":"Tetsuo","last_name":"Sugimoto","full_name":"Sugimoto, Tetsuo"},{"full_name":"Tanabe, Yasuto","last_name":"Tanabe","first_name":"Yasuto"},{"last_name":"Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"},{"full_name":"Iwai, Masazumi","first_name":"Masazumi","last_name":"Iwai"},{"full_name":"Takumi, Toru","first_name":"Toru","last_name":"Takumi"},{"full_name":"Ohkubo, Hiroaki","first_name":"Hiroaki","last_name":"Ohkubo"},{"full_name":"Nakanishi, Shigetada","first_name":"Shigetada","last_name":"Nakanishi"}],"publication_status":"published","publisher":"Springer","year":"1990","pmid":1,"day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"1990-01-01T00:00:00Z","article_type":"original","page":"39 - 47","publication":"Journal of Membrane Biology","citation":{"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.” Journal of Membrane Biology, vol. 113, no. 1, Springer, 1990, pp. 39–47, doi:10.1007/BF01869604.","short":"T. Sugimoto, Y. Tanabe, R. Shigemoto, M. Iwai, T. Takumi, H. Ohkubo, S. Nakanishi, Journal of Membrane Biology 113 (1990) 39–47.","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.” Journal of Membrane Biology. Springer, 1990. https://doi.org/10.1007/BF01869604.","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. Journal of Membrane Biology. 1990;113(1):39-47. doi:10.1007/BF01869604","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 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,” Journal of Membrane Biology, vol. 113, no. 1. Springer, pp. 39–47, 1990.","apa":"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. Springer. https://doi.org/10.1007/BF01869604"},"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"}],"issue":"1","type":"journal_article","oa_version":"None","status":"public","title":"Immunohistochemical study of a rat membrane protein which induces a selective potassium permeation: Its localization in the apical membrane portion of epithelial cells","intvolume":" 113","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"2528"},{"title":"Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier","status":"public","intvolume":" 59","_id":"2721","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","type":"journal_article","abstract":[{"lang":"eng","text":"We consider a multidimensional system consisting of a particle of mass M and radius r (molecule), surrounded by an infinite ideal gas of point particles of mass m (atoms). The molecule is confined to the unit ball and interacts with its boundary (barrier) via elastic collision, while the atoms are not affected by the boundary. We obtain convergence to equilibrium for the molecule from almost every initial distribution on its position and velocity. Furthermore, we prove that the infinite composite system of the molecule and the atoms is Bernoulli."}],"issue":"5-6","article_type":"original","page":"1589 - 1602","publication":"Journal of Statistical Physics","citation":{"apa":"Erdös, L., & Tuyen, D. (1990). Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier. Journal of Statistical Physics. Springer. https://doi.org/10.1007/BF01334766","ieee":"L. Erdös and D. Tuyen, “Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier,” Journal of Statistical Physics, vol. 59, no. 5–6. Springer, pp. 1589–1602, 1990.","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.","ama":"Erdös L, Tuyen D. Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier. Journal of Statistical Physics. 1990;59(5-6):1589-1602. doi:10.1007/BF01334766","chicago":"Erdös, László, and Dao Tuyen. “Ergodic Properties of the Multidimensional Rayleigh Gas with a Semipermeable Barrier.” Journal of Statistical Physics. Springer, 1990. https://doi.org/10.1007/BF01334766.","short":"L. Erdös, D. Tuyen, Journal of Statistical Physics 59 (1990) 1589–1602.","mla":"Erdös, László, and Dao Tuyen. “Ergodic Properties of the Multidimensional Rayleigh Gas with a Semipermeable Barrier.” Journal of Statistical Physics, vol. 59, no. 5–6, Springer, 1990, pp. 1589–602, doi:10.1007/BF01334766."},"date_published":"1990-06-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","publication_status":"published","publisher":"Springer","year":"1990","date_created":"2018-12-11T11:59:15Z","date_updated":"2022-02-24T09:39:29Z","volume":59,"author":[{"last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"full_name":"Tuyen, Dao","last_name":"Tuyen","first_name":"Dao"}],"extern":"1","publist_id":"4171","quality_controlled":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01334766"}],"language":[{"iso":"eng"}],"doi":"10.1007/BF01334766","month":"06","publication_identifier":{"issn":["0022-4715"],"eissn":["1572-9613"]}},{"scopus_import":"1","article_processing_charge":"No","day":"01","citation":{"ista":"Mallet J, Barton NH, Lamas G, Santisteban J, Muedas M, Eeley H. 1990. Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones. Genetics. 124(4), 921–936.","apa":"Mallet, J., Barton, N. H., Lamas, G., Santisteban, J., Muedas, M., & Eeley, H. (1990). Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones. Genetics. Genetics Society of America. https://doi.org/10.1093/genetics/124.4.921","ieee":"J. Mallet, N. H. Barton, G. Lamas, J. Santisteban, M. Muedas, and H. Eeley, “Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones,” Genetics, vol. 124, no. 4. Genetics Society of America, pp. 921–936, 1990.","ama":"Mallet J, Barton NH, Lamas G, Santisteban J, Muedas M, Eeley H. Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones. Genetics. 1990;124(4):921-936. doi:10.1093/genetics/124.4.921","chicago":"Mallet, James, Nicholas H Barton, Gerado Lamas, José Santisteban, Manuel Muedas, and Harriet Eeley. “Estimates of Selection and Gene Flow from Measures of Cline Width and Linkage Disequilibrium in Heliconius Hybrid Zones.” Genetics. Genetics Society of America, 1990. https://doi.org/10.1093/genetics/124.4.921.","mla":"Mallet, James, et al. “Estimates of Selection and Gene Flow from Measures of Cline Width and Linkage Disequilibrium in Heliconius Hybrid Zones.” Genetics, vol. 124, no. 4, Genetics Society of America, 1990, pp. 921–36, doi:10.1093/genetics/124.4.921.","short":"J. Mallet, N.H. Barton, G. Lamas, J. Santisteban, M. Muedas, H. Eeley, Genetics 124 (1990) 921–936."},"publication":"Genetics","page":"921 - 936","article_type":"original","date_published":"1990-04-01T00:00:00Z","type":"journal_article","issue":"4","abstract":[{"text":"Hybrid zones can yield estimates of natural selection and gene flow. The width of a cline in gene frequency is approximately proportional to gene flow (σ) divided by the square root of per-locus selection ( &s). Gene flow also causes gametic correlations (linkage disequilibria) between genes that differ across hybrid zones. Correlations are stronger when the hybrid zone is narrow, and rise to a maximum roughly equal to s. Thus cline width and gametic correlations combine to give estimates of gene flow and selection. These indirect measures of σ and s are especially useful because they can be made from collections, and require no field experiments. The method was applied to hybrid zones between color pattern races in a pair of Peruvian Heliconius butterfly species. The species are Mullerian mimics of one another, and both show the same changes in warning color pattern across their respective hybrid zones. The expectations of cline width and gametic correlation were generated using simulations of clines stabilized by strong frequency-dependent selection. In the hybrid zone in Heliconius erato, clines at three major color pattern loci were between 8.5 and 10.2 km wide, and the pairwise gametic correlations peaked at R & 0.35. These measures suggest that s & 0.23 per locus, and that σ & 2.6 km. In erato, the shapes of the clines agreed with that expected on the basis of dominance. Heliconius melpomene has a nearly coincident hybrid zone. In this species, cline widths at four major color pattern loci varied between 11.7 and 13.4 km. Pairwise gametic correlations peaked near R & 1.00 for tightly linked genes, and at R & 0.40 for unlinked genes, giving s & 0.25 per locus and σ & 3.7 km. In melpomene, cline shapes did not perfectly fit theoretical shapes based on dominance; this deviation might be explained by long-distance migration and/or strong epistasis. Compared with erato, sample sizes in melpomene are lower and the genetics of its color patterns are less well understood. In spite of these problems, selection and gene flow are clearly of the same order of magnitude in the two species. The relatively high per locus selection coefficients agree with ``major gene'' theories for the evolution of Mullerian mimicry, but the genetic architecture of the color patterns does not. These results show that the genetics and evolution of mimicry are still only sketchily understood.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"3650","intvolume":" 124","title":"Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones","status":"public","oa_version":"Published Version","publication_identifier":{"issn":["0016-6731"]},"month":"04","oa":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1203983/"}],"external_id":{"pmid":["2323556"]},"quality_controlled":"1","doi":"10.1093/genetics/124.4.921","language":[{"iso":"eng"}],"publist_id":"2733","extern":"1","pmid":1,"acknowledgement":"We thank the Natural Environmental Research Council, the Royal Society, the Nuffield Foundation, CONCYTEC, and Mrs. G. W. BORLASE for financial support, and the people of San Martin for their generous hospitality. We are very grateful to S. D. KNAPP, who helped by maintaining our sanity and rearing larvae. We are also grateful to an anonymous reviewer, A. W. PORTER, J. C. SCHNEIDER, M. TURELLI and C. E. WATSON for helpful comments on the manuscript. This paper was approved for publication as journal article no. 5-7255 of the Mississippi Agricultural and Forestry Experiment Station, Mississippi State University, project no. MIS-2 122. ","year":"1990","publisher":"Genetics Society of America","publication_status":"published","author":[{"first_name":"James","last_name":"Mallet","full_name":"Mallet, James"},{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H"},{"last_name":"Lamas","first_name":"Gerado","full_name":"Lamas, Gerado"},{"full_name":"Santisteban, José","first_name":"José","last_name":"Santisteban"},{"last_name":"Muedas","first_name":"Manuel","full_name":"Muedas, Manuel"},{"full_name":"Eeley, Harriet","last_name":"Eeley","first_name":"Harriet"}],"volume":124,"date_created":"2018-12-11T12:04:26Z","date_updated":"2022-02-23T11:04:17Z"},{"month":"01","publication_identifier":{"issn":["0040-5809"]},"quality_controlled":"1","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/004058099090002D?via%3Dihub"}],"language":[{"iso":"eng"}],"doi":"10.1016/0040-5809(90)90002-D","extern":"1","publist_id":"2734","publication_status":"published","publisher":"Academic Press","acknowledgement":"We thank R. Burger, J. A. Coyne, W. G. Hill, A. A. Hoffmann, J. H. Gillespie, M. Slatkin, T. Nagylaki and Z.-B. Zeng for helpful discussions and comments on earlier drafts. Our research is supported by grants from the National Science Foundation (BSR-8866548), the Science and Engineering Research Council, and the Institute of Theoretical Dynamics at UCD. ","year":"1990","date_updated":"2022-02-23T14:48:49Z","date_created":"2018-12-11T12:04:26Z","volume":38,"author":[{"full_name":"Turelli, Michael","first_name":"Michael","last_name":"Turelli"},{"full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","day":"01","article_processing_charge":"No","article_type":"original","page":"1 - 57","publication":"Theoretical Population Biology","citation":{"chicago":"Turelli, Michael, and Nicholas H Barton. “Dynamics of Polygenic Characters under Selection.” Theoretical Population Biology. Academic Press, 1990. https://doi.org/10.1016/0040-5809(90)90002-D.","mla":"Turelli, Michael, and Nicholas H. Barton. “Dynamics of Polygenic Characters under Selection.” Theoretical Population Biology, vol. 38, no. 1, Academic Press, 1990, pp. 1–57, doi:10.1016/0040-5809(90)90002-D.","short":"M. Turelli, N.H. Barton, Theoretical Population Biology 38 (1990) 1–57.","ista":"Turelli M, Barton NH. 1990. Dynamics of polygenic characters under selection. Theoretical Population Biology. 38(1), 1–57.","ieee":"M. Turelli and N. H. Barton, “Dynamics of polygenic characters under selection,” Theoretical Population Biology, vol. 38, no. 1. Academic Press, pp. 1–57, 1990.","apa":"Turelli, M., & Barton, N. H. (1990). Dynamics of polygenic characters under selection. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/0040-5809(90)90002-D","ama":"Turelli M, Barton NH. Dynamics of polygenic characters under selection. Theoretical Population Biology. 1990;38(1):1-57. doi:10.1016/0040-5809(90)90002-D"},"date_published":"1990-01-01T00:00:00Z","type":"journal_article","abstract":[{"text":"Selection on polygenic characters is generally analyzed by statistical methods that assume a Gaussian (normal) distribution of breeding values. We present an alternative analysis based on multilocus population genetics. We use a general representation of selection, recombination, and drift to analyze an idealized polygenic system in which all genetic effects are additive (i.e., both dominance and epistasis are absent), but no assumptions are made about the distribution of breeding values or the numbers of loci or alleles. Our analysis produces three results. First, our equations reproduce the standard recursions for the mean and additive variance if breeding values are Gaussian; but they also reveal how non-Gaussian distributions of breeding values will alter these dynamics. Second, an approximation valid for weak selection shows that even if genetic variance is attributable to an effectively infinite number of loci with only additive effects, selection will generally drive the distribution of breeding values away from a Gaussian distribution by creating multilocus linkage disequilibria. Long-term dynamics of means can depart substantially from the predictions of the standard selection recursions, but the discrepancy may often be negligible for short-term selection. Third, by including mutation, we show that, for realistic parameter values, linkage disequilibrium has little effect on the amount of additive variance maintained at an equilibrium between stabilizing selection and mutation. Each of these analytical results is supported by numerical calculations.","lang":"eng"}],"issue":"1","title":"Dynamics of polygenic characters under selection","status":"public","intvolume":" 38","_id":"3649","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None"},{"oa_version":"Published Version","status":"public","title":"Pleiotropic models of quantitative variation","intvolume":" 124","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"3651","abstract":[{"text":"It is widely held that each gene typically affects many characters, and that each character is affected by many genes. Moreover, strong stabilizing selection cannot act on an indefinitely large number of independent traits. This makes it likely that heritable variation in any one trait is maintained as a side effect of polymorphisms which have nothing to do with selection on that trait. This paper examines the idea that variation is maintained as the pleiotropic side effect of either deleterious mutation, or balancing selection. If mutation is responsible, it must produce alleles which are only mildly deleterious (s & 10(-3)), but nevertheless have significant effects on the trait. Balancing selection can readily maintain high heritabilities; however, selection must be spread over many weakly selected polymorphisms if large responses to artificial selection are to be possible. In both classes of pleiotropic model, extreme phenotypes are less fit, giving the appearance of stabilizing selection on the trait. However, it is shown that this effect is weak (of the same order as the selection on each gene): the strong stabilizing selection which is often observed is likely to be caused by correlations with a limited number of directly selected traits. Possible experiments for distinguishing the alternatives are discussed.","lang":"eng"}],"issue":"3","type":"journal_article","date_published":"1990-03-01T00:00:00Z","article_type":"original","page":"773 - 782","publication":"Genetics","citation":{"mla":"Barton, Nicholas H. “Pleiotropic Models of Quantitative Variation.” Genetics, vol. 124, no. 3, Genetics Society of America, 1990, pp. 773–82, doi:10.1093/genetics/124.3.773 .","short":"N.H. Barton, Genetics 124 (1990) 773–782.","chicago":"Barton, Nicholas H. “Pleiotropic Models of Quantitative Variation.” Genetics. Genetics Society of America, 1990. https://doi.org/10.1093/genetics/124.3.773 .","ama":"Barton NH. Pleiotropic models of quantitative variation. Genetics. 1990;124(3):773-782. doi:10.1093/genetics/124.3.773 ","ista":"Barton NH. 1990. Pleiotropic models of quantitative variation. Genetics. 124(3), 773–782.","ieee":"N. H. Barton, “Pleiotropic models of quantitative variation,” Genetics, vol. 124, no. 3. Genetics Society of America, pp. 773–782, 1990.","apa":"Barton, N. H. (1990). Pleiotropic models of quantitative variation. Genetics. Genetics Society of America. https://doi.org/10.1093/genetics/124.3.773 "},"day":"01","article_processing_charge":"No","scopus_import":"1","date_updated":"2022-02-23T10:41:43Z","date_created":"2018-12-11T12:04:26Z","volume":124,"author":[{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"}],"publication_status":"published","publisher":"Genetics Society of America","year":"1990","acknowledgement":"Thanks to JERRY COYNE, BILL HILL, LINDA PARTRIDGE, MICHAEL TURELLI, and two anonymous reviewers for their critical comments. This work was supported by grants from the National Science Foundation (BSR-8866548) the Science and Engineering Research Council (GR/E/08507), and by the Institute of Theoretical Dynamics, University of California, Davis.","pmid":1,"extern":"1","publist_id":"2732","language":[{"iso":"eng"}],"doi":"10.1093/genetics/124.3.773 ","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://academic.oup.com/genetics/article/124/3/773/5999956?login=true"}],"external_id":{"pmid":["2311921"]},"oa":1,"month":"03","publication_identifier":{"issn":["0016-6731"]}},{"extern":"1","publist_id":"2056","publication_status":"published","publisher":"Springer","acknowledgement":"Research of the first author was supported by the National Science Foundation under grant CCR-8714565. Work of the second author was supported by Office of Naval Research Grants DCR-83-20085 and CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation, the NCRD — the Israeli National Council for Research and Development, and the Fund for Basic Research in Electronics, Computers and Communication administered by the Israeli Academy of Sciences.","year":"1990","date_updated":"2022-02-22T14:31:26Z","date_created":"2018-12-11T12:06:45Z","volume":450,"author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Sharir, Micha","last_name":"Sharir","first_name":"Micha"}],"month":"01","publication_identifier":{"isbn":["978-3-540-52921-7"]},"quality_controlled":"1","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-52921-7_91"}],"language":[{"iso":"eng"}],"conference":{"end_date":"1990-08-18","location":"Tokyo, Japan","start_date":"1990-08-16","name":"SIGAL: Special Interest Group on Algorithms, International Symposium on Algorithms "},"doi":"10.1007/3-540-52921-7_91","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"This paper proves an O(m 2/3 n 2/3+m+n) upper bound on the number of incidences between m points and n hyperplanes in four dimensions, assuming all points lie on one side of each hyperplane and the points and hyperplanes satisfy certain natural general position conditions. This result has application to various three-dimensional combinatorial distance problems. For example, it implies the same upper bound for the number of bichromatic minimum distance pairs in a set of m blue and n red points in three-dimensional space. This improves the best previous bound for this problem.","lang":"eng"}],"title":"A hyperplane Incidence problem with applications to counting distances","status":"public","intvolume":" 450","_id":"4067","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","scopus_import":"1","day":"01","article_processing_charge":"No","page":"419 - 428","publication":"Proceedings of the International Symposium on Algorithms","citation":{"ama":"Edelsbrunner H, Sharir M. A hyperplane Incidence problem with applications to counting distances. In: Proceedings of the International Symposium on Algorithms. Vol 450. Springer; 1990:419-428. doi:10.1007/3-540-52921-7_91","ieee":"H. Edelsbrunner and M. Sharir, “A hyperplane Incidence problem with applications to counting distances,” in Proceedings of the International Symposium on Algorithms, Tokyo, Japan, 1990, vol. 450, pp. 419–428.","apa":"Edelsbrunner, H., & Sharir, M. (1990). A hyperplane Incidence problem with applications to counting distances. In Proceedings of the International Symposium on Algorithms (Vol. 450, pp. 419–428). Tokyo, Japan: Springer. https://doi.org/10.1007/3-540-52921-7_91","ista":"Edelsbrunner H, Sharir M. 1990. A hyperplane Incidence problem with applications to counting distances. Proceedings of the International Symposium on Algorithms. SIGAL: Special Interest Group on Algorithms, International Symposium on Algorithms , LNCS, vol. 450, 419–428.","short":"H. Edelsbrunner, M. Sharir, in:, Proceedings of the International Symposium on Algorithms, Springer, 1990, pp. 419–428.","mla":"Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.” Proceedings of the International Symposium on Algorithms, vol. 450, Springer, 1990, pp. 419–28, doi:10.1007/3-540-52921-7_91.","chicago":"Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.” In Proceedings of the International Symposium on Algorithms, 450:419–28. Springer, 1990. https://doi.org/10.1007/3-540-52921-7_91."},"date_published":"1990-01-01T00:00:00Z"},{"article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"1990-03-01T00:00:00Z","page":"197 - 216","article_type":"original","citation":{"ama":"Edelsbrunner H, Guibas L, Sharir M. The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. 1990;5(1):197-216. doi:10.1007/BF02187785","ieee":"H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity of many cells in arrangements of planes and related problems,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 197–216, 1990.","apa":"Edelsbrunner, H., Guibas, L., & Sharir, M. (1990). The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187785","ista":"Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. 5(1), 197–216.","short":"H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 197–216.","mla":"Edelsbrunner, Herbert, et al. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 197–216, doi:10.1007/BF02187785.","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.” Discrete & Computational Geometry. Springer, 1990. https://doi.org/10.1007/BF02187785."},"publication":"Discrete & Computational Geometry","issue":"1","abstract":[{"lang":"eng","text":"We consider several problems involving points and planes in three dimensions. Our main results are: (i) The maximum number of faces boundingm distinct cells in an arrangement ofn planes isO(m 2/3 n logn +n 2); we can calculatem such cells specified by a point in each, in worst-case timeO(m 2/3 n log3 n+n 2 logn). (ii) The maximum number of incidences betweenn planes andm vertices of their arrangement isO(m 2/3 n logn+n 2), but this number is onlyO(m 3/5– n 4/5+2 +m+n logm), for any>0, for any collection of points no three of which are collinear. (iii) For an arbitrary collection ofm points, we can calculate the number of incidences between them andn planes by a randomized algorithm whose expected time complexity isO((m 3/4– n 3/4+3 +m) log2 n+n logn logm) for any>0. (iv) Givenm points andn planes, we can find the plane lying immediately below each point in randomized expected timeO([m 3/4– n 3/4+3 +m] log2 n+n logn logm) for any>0. (v) The maximum number of facets (i.e., (d–1)-dimensional faces) boundingm distinct cells in an arrangement ofn hyperplanes ind dimensions,d>3, isO(m 2/3 n d/3 logn+n d–1). This is also an upper bound for the number of incidences betweenn hyperplanes ind dimensions andm vertices of their arrangement. The combinatorial bounds in (i) and (v) and the general bound in (ii) are almost tight."}],"type":"journal_article","oa_version":"None","intvolume":" 5","status":"public","title":"The complexity of many cells in arrangements of planes and related problems","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4066","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"month":"03","language":[{"iso":"eng"}],"doi":"10.1007/BF02187785","quality_controlled":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187785"}],"extern":"1","publist_id":"2054","volume":5,"date_created":"2018-12-11T12:06:44Z","date_updated":"2022-02-22T11:02:41Z","author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"first_name":"Leonidas","last_name":"Guibas","full_name":"Guibas, Leonidas"},{"first_name":"Micha","last_name":"Sharir","full_name":"Sharir, Micha"}],"publisher":"Springer","publication_status":"published","acknowledgement":"Supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by NSF Grant CCR-8714565. Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. I-6-44862 and by NSF Grant CCR-87t4565. Work by the third author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant DCR-82-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD--the Israeli National Council for Research and Development. An abstract of this\r\npaper has appeared in the Proceedings of the 13th International Mathematical Programming Symposium, Tokyo, 1988, p. 147","year":"1990"},{"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"month":"01","language":[{"iso":"eng"}],"doi":"10.1007/BF02187784","quality_controlled":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187784"}],"extern":"1","publist_id":"2053","volume":5,"date_created":"2018-12-11T12:06:46Z","date_updated":"2022-02-22T09:27:30Z","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"first_name":"Leonidas","last_name":"Guibas","full_name":"Guibas, Leonidas"},{"first_name":"Micha","last_name":"Sharir","full_name":"Sharir, Micha"}],"publisher":"Springer","publication_status":"published","year":"1990","acknowledgement":"The first author is pleased to acknowledge partial support by the Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and the National Science Foundation under Grant CCR-8714565. Work on this paper by the third author has been supported by Office of Naval Research Grant N00014-82-K-0381, by National Science Foundation Grant DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD-the Israeli National Council for Research and Development. A preliminary version of this paper has appeared in theProceedings of the 4th ACM Symposium on Computational Geometry, 1988, pp. 44–55.","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"1990-01-01T00:00:00Z","page":"161 - 196","article_type":"original","citation":{"ama":"Edelsbrunner H, Guibas L, Sharir M. The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. 1990;5(1):161-196. doi:10.1007/BF02187784","ista":"Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. 5(1), 161–196.","apa":"Edelsbrunner, H., Guibas, L., & Sharir, M. (1990). The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187784","ieee":"H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity and construction of many faces in arrangements of lines and of segments,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 161–196, 1990.","mla":"Edelsbrunner, Herbert, et al. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 161–96, doi:10.1007/BF02187784.","short":"H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 161–196.","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.” Discrete & Computational Geometry. Springer, 1990. https://doi.org/10.1007/BF02187784."},"publication":"Discrete & Computational Geometry","issue":"1","abstract":[{"lang":"eng","text":"We show that the total number of edges ofm faces of an arrangement ofn lines in the plane isO(m 2/3– n 2/3+2 +n) for any>0. The proof takes an algorithmic approach, that is, we describe an algorithm for the calculation of thesem faces and derive the upper bound from the analysis of the algorithm. The algorithm uses randomization and its expected time complexity isO(m 2/3– n 2/3+2 logn+n logn logm). If instead of lines we have an arrangement ofn line segments, then the maximum number of edges ofm faces isO(m 2/3– n 2/3+2 +n (n) logm) for any>0, where(n) is the functional inverse of Ackermann's function. We give a (randomized) algorithm that produces these faces and takes expected timeO(m 2/3– n 2/3+2 log+n(n) log2 n logm)."}],"type":"journal_article","oa_version":"None","intvolume":" 5","title":"The complexity and construction of many faces in arrangements of lines and of segments","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4072"},{"page":"242 - 251","quality_controlled":"1","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/89543"}],"citation":{"chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “Counting and Cutting Cycles of Lines and Rods in Space.” In 31st Annual Symposium on Foundations of Computer Science, 242–51. IEEE, 1990. https://doi.org/10.1109/FSCS.1990.89543.","mla":"Chazelle, Bernard, et al. “Counting and Cutting Cycles of Lines and Rods in Space.” 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 242–51, doi:10.1109/FSCS.1990.89543.","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, in:, 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 242–251.","ista":"Chazelle B, Edelsbrunner H, Guibas L, Pollack R, Seidel R, Sharir M, Snoeyink J. 1990. Counting and cutting cycles of lines and rods in space. 31st Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 242–251.","ieee":"B. Chazelle et al., “Counting and cutting cycles of lines and rods in space,” in 31st Annual Symposium on Foundations of Computer Science, St. Louis, MO, United States of America, 1990, pp. 242–251.","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., Pollack, R., Seidel, R., Sharir, M., & Snoeyink, J. (1990). Counting and cutting cycles of lines and rods in space. In 31st Annual Symposium on Foundations of Computer Science (pp. 242–251). St. Louis, MO, United States of America: IEEE. https://doi.org/10.1109/FSCS.1990.89543","ama":"Chazelle B, Edelsbrunner H, Guibas L, et al. Counting and cutting cycles of lines and rods in space. In: 31st Annual Symposium on Foundations of Computer Science. IEEE; 1990:242-251. doi:10.1109/FSCS.1990.89543"},"publication":"31st Annual Symposium on Foundations of Computer Science","language":[{"iso":"eng"}],"doi":"10.1109/FSCS.1990.89543","date_published":"1990-01-01T00:00:00Z","conference":{"name":"FOCS: Foundations of Computer Science","end_date":"1990-10-24","location":"St. Louis, MO, United States of America","start_date":"1990-10-22"},"scopus_import":"1","article_processing_charge":"No","publication_identifier":{"isbn":["0-8186-2082-X"]},"day":"01","month":"01","publisher":"IEEE","title":"Counting and cutting cycles of lines and rods in space","status":"public","publication_status":"published","_id":"4073","year":"1990","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","date_updated":"2022-02-17T11:07:07Z","date_created":"2018-12-11T12:06:47Z","author":[{"first_name":"Bernard","last_name":"Chazelle","full_name":"Chazelle, Bernard"},{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"first_name":"Leonidas","last_name":"Guibas","full_name":"Guibas, Leonidas"},{"last_name":"Pollack","first_name":"Richard","full_name":"Pollack, Richard"},{"first_name":"Raimund","last_name":"Seidel","full_name":"Seidel, Raimund"},{"full_name":"Sharir, Micha","last_name":"Sharir","first_name":"Micha"},{"first_name":"Jack","last_name":"Snoeyink","full_name":"Snoeyink, Jack"}],"type":"conference","extern":"1","publist_id":"2047","abstract":[{"lang":"eng","text":"A number of rendering algorithms in computer graphics sort three-dimensional objects by depth and assume that there is no cycle that makes the sorting impossible. One way to resolve the problem caused by cycles is to cut the objects into smaller pieces. The problem of estimating how many such cuts are always sufficient is addressed. A few related algorithmic and combinatorial geometry problems are considered."}]},{"language":[{"iso":"eng"}],"doi":"10.1080/00207169008803871","quality_controlled":"1","main_file_link":[{"url":"https://www.tandfonline.com/doi/abs/10.1080/00207169008803871"}],"month":"01","publication_identifier":{"eissn":["1029-0265"],"issn":["0020-7160"]},"date_updated":"2022-02-21T13:19:52Z","date_created":"2018-12-11T12:06:46Z","volume":34,"author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Overmars, Mark","first_name":"Mark","last_name":"Overmars"},{"last_name":"Welzl","first_name":"Emo","full_name":"Welzl, Emo"},{"last_name":"Hartman","first_name":"Irith","full_name":"Hartman, Irith"},{"first_name":"Jack","last_name":"Feldman","full_name":"Feldman, Jack"}],"publication_status":"published","publisher":"Taylor & Francis","year":"1990","extern":"1","publist_id":"2051","date_published":"1990-01-01T00:00:00Z","page":"129 - 144","publication":"International Journal of Computer Mathematics","citation":{"ama":"Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 1990;34(3-4):129-144. doi:10.1080/00207169008803871","ieee":"H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, and J. Feldman, “Ranking intervals under visibility constraints,” International Journal of Computer Mathematics, vol. 34, no. 3–4. Taylor & Francis, pp. 129–144, 1990.","apa":"Edelsbrunner, H., Overmars, M., Welzl, E., Hartman, I., & Feldman, J. (1990). Ranking intervals under visibility constraints. International Journal of Computer Mathematics. Taylor & Francis. https://doi.org/10.1080/00207169008803871","ista":"Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. 1990. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 34(3–4), 129–144.","short":"H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, J. Feldman, International Journal of Computer Mathematics 34 (1990) 129–144.","mla":"Edelsbrunner, Herbert, et al. “Ranking Intervals under Visibility Constraints.” International Journal of Computer Mathematics, vol. 34, no. 3–4, Taylor & Francis, 1990, pp. 129–44, doi:10.1080/00207169008803871.","chicago":"Edelsbrunner, Herbert, Mark Overmars, Emo Welzl, Irith Hartman, and Jack Feldman. “Ranking Intervals under Visibility Constraints.” International Journal of Computer Mathematics. Taylor & Francis, 1990. https://doi.org/10.1080/00207169008803871."},"day":"01","article_processing_charge":"No","scopus_import":"1","oa_version":"None","status":"public","title":"Ranking intervals under visibility constraints","intvolume":" 34","_id":"4070","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Let S be a set of n closed intervals on the x-axis. A ranking assigns to each interval, s, a distinct rank, p(s)∊ [1, 2,…,n]. We say that s can see t if p(s)
Proceedings of the 6th Annual Symposium on Computational Geometry, 44–52. ACM, 1990. https://doi.org/10.1145/98524.98535.","mla":"Edelsbrunner, Herbert, et al. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.” Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52, doi:10.1145/98524.98535.","short":"H. Edelsbrunner, T. Tan, R. Waupotitsch, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52.","ista":"Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm for the MinMax angle triangulation. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 44–52.","apa":"Edelsbrunner, H., Tan, T., & Waupotitsch, R. (1990). An O(n^2log n) time algorithm for the MinMax angle triangulation. In Proceedings of the 6th annual symposium on Computational geometry (pp. 44–52). Berkley, CA, United States: ACM. https://doi.org/10.1145/98524.98535","ieee":"H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2log n) time algorithm for the MinMax angle triangulation,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 44–52.","ama":"Edelsbrunner H, Tan T, Waupotitsch R. An O(n^2log n) time algorithm for the MinMax angle triangulation. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:44-52. doi:10.1145/98524.98535"},"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/98524.98535"}],"publication":"Proceedings of the 6th annual symposium on Computational geometry","page":"44 - 52","quality_controlled":"1","article_processing_charge":"No","publication_identifier":{"isbn":["978-0-89791-362-1"]},"month":"01","day":"01","author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"last_name":"Tan","first_name":"Tiow","full_name":"Tan, Tiow"},{"full_name":"Waupotitsch, Roman","first_name":"Roman","last_name":"Waupotitsch"}],"oa_version":"None","date_created":"2018-12-11T12:06:46Z","date_updated":"2022-02-22T08:56:42Z","year":"1990","_id":"4071","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publisher":"ACM","status":"public","publication_status":"published","title":"An O(n^2log n) time algorithm for the MinMax angle triangulation","publist_id":"2052","abstract":[{"text":"We show that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). In the same amount of time and space we can also handle the constrained case where edges are prescribed. The algorithm iteratively improves an arbitrary initial triangulation and is fairly easy to implement.","lang":"eng"}],"extern":"1","type":"conference"},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4068","title":"The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2","status":"public","intvolume":" 5","oa_version":"None","type":"journal_article","abstract":[{"text":"LetS be a collection ofn convex, closed, and pairwise nonintersecting sets in the Euclidean plane labeled from 1 ton. A pair of permutations\r\n(i1i2in−1in)(inin−1i2i1) \r\nis called ageometric permutation of S if there is a line that intersects all sets ofS in this order. We prove thatS can realize at most 2n–2 geometric permutations. This upper bound is tight.","lang":"eng"}],"issue":"1","publication":"Discrete & Computational Geometry","citation":{"short":"H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990) 35–42.","mla":"Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi:10.1007/BF02187778.","chicago":"Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” Discrete & Computational Geometry. Springer, 1990. https://doi.org/10.1007/BF02187778.","ama":"Edelsbrunner H, Sharir M. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. 1990;5(1):35-42. doi:10.1007/BF02187778","apa":"Edelsbrunner, H., & Sharir, M. (1990). The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187778","ieee":"H. Edelsbrunner and M. Sharir, “The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 35–42, 1990.","ista":"Edelsbrunner H, Sharir M. 1990. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. 5(1), 35–42."},"article_type":"original","page":"35 - 42","date_published":"1990-01-01T00:00:00Z","day":"01","article_processing_charge":"No","year":"1990","acknowledgement":"Research of the first author was supported by Amoco Foundation for Faculty Development in Computer Science Grant No. 1-6-44862. Work on this paper by the second author was supported by Office of Naval Research Grant No. N00014-82-K-0381, National Science Foundation Grant No. NSF-DCR-83-20085, and by grants from the Digital Equipment Corporation and the IBM Corporation.","publication_status":"published","publisher":"Springer","author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"date_updated":"2022-02-22T14:50:34Z","date_created":"2018-12-11T12:06:45Z","volume":5,"publist_id":"2057","extern":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187778"}],"quality_controlled":"1","doi":"10.1007/BF02187778","language":[{"iso":"eng"}],"month":"01","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]}},{"publication_identifier":{"eissn":["1439-6912"],"issn":["0209-9683"]},"month":"09","doi":"10.1007/BF02122779","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02122779"}],"quality_controlled":"1","publist_id":"2050","extern":"1","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"}],"volume":10,"date_created":"2018-12-11T12:06:45Z","date_updated":"2022-02-21T11:08:30Z","acknowledgement":"Research reported in this paper was supported by the National Science Foundation under grant CCR-8714565.","year":"1990","publisher":"Springer","publication_status":"published","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"1990-09-01T00:00:00Z","citation":{"mla":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” Combinatorica, vol. 10, no. 3, Springer, 1990, pp. 251–60, doi:10.1007/BF02122779.","short":"H. Edelsbrunner, Combinatorica 10 (1990) 251–260.","chicago":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” Combinatorica. Springer, 1990. https://doi.org/10.1007/BF02122779.","ama":"Edelsbrunner H. An acyclicity theorem for cell complexes in d dimension. Combinatorica. 1990;10(3):251-260. doi:10.1007/BF02122779","ista":"Edelsbrunner H. 1990. An acyclicity theorem for cell complexes in d dimension. Combinatorica. 10(3), 251–260.","ieee":"H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” Combinatorica, vol. 10, no. 3. Springer, pp. 251–260, 1990.","apa":"Edelsbrunner, H. (1990). An acyclicity theorem for cell complexes in d dimension. Combinatorica. Springer. https://doi.org/10.1007/BF02122779"},"publication":"Combinatorica","page":"251 - 260","article_type":"original","issue":"3","abstract":[{"lang":"eng","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."}],"type":"journal_article","oa_version":"None","_id":"4069","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":" 10","title":"An acyclicity theorem for cell complexes in d dimension","status":"public"},{"publication":"Journal of Physiology","citation":{"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.” Journal of Physiology. Wiley-Blackwell, 1990. https://doi.org/10.1113/jphysiol.1990.sp017918.","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.” Journal of Physiology, vol. 420, Wiley-Blackwell, 1990, pp. 365–85, doi:10.1113/jphysiol.1990.sp017918.","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.","apa":"Bräu, M., Dreyer, F., Jonas, P. M., 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. Wiley-Blackwell. https://doi.org/10.1113/jphysiol.1990.sp017918","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,” Journal of Physiology, vol. 420. Wiley-Blackwell, pp. 365–385, 1990.","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. Journal of Physiology. 1990;420:365-385. doi:10.1113/jphysiol.1990.sp017918"},"article_type":"original","page":"365 - 385","date_published":"1990-01-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"3467","title":"A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments","status":"public","intvolume":" 420","oa_version":"None","type":"journal_article","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."}],"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1190055/","open_access":"1"}],"oa":1,"external_id":{"pmid":["2324990"]},"quality_controlled":"1","doi":"10.1113/jphysiol.1990.sp017918","language":[{"iso":"eng"}],"month":"01","publication_identifier":{"eissn":["1469-7793"],"issn":["0022-3751"]},"year":"1990","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","pmid":1,"publication_status":"published","publisher":"Wiley-Blackwell","author":[{"full_name":"Bräu, Michael","last_name":"Bräu","first_name":"Michael"},{"first_name":"Florian","last_name":"Dreyer","full_name":"Dreyer, Florian"},{"last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M"},{"first_name":"Holger","last_name":"Repp","full_name":"Repp, Holger"},{"last_name":"Vogel","first_name":"Werner","full_name":"Vogel, Werner"}],"date_updated":"2022-02-23T16:10:03Z","date_created":"2018-12-11T12:03:29Z","volume":420,"publist_id":"2920","extern":"1"},{"day":"01","month":"01","article_processing_charge":"No","publication_identifier":{"isbn":["978-1-4613-8997-2"]},"publication":"Autonomous Robot Vehicles","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-1-4613-8997-2_25"}],"citation":{"short":"D. Dobkin, H. Edelsbrunner, C. Yap, in:, I. Cox, G. Wilfong (Eds.), Autonomous Robot Vehicles, Springer, 1990, pp. 328–341.","mla":"Dobkin, David, et al. “Probing Convex Polytopes.” Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong, Springer, 1990, pp. 328–41, doi:10.1007/978-1-4613-8997-2_25.","chicago":"Dobkin, David, Herbert Edelsbrunner, and Chee Yap. “Probing Convex Polytopes.” In Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong, 328–41. Springer, 1990. https://doi.org/10.1007/978-1-4613-8997-2_25.","ama":"Dobkin D, Edelsbrunner H, Yap C. Probing convex polytopes. In: Cox I, Wilfong G, eds. Autonomous Robot Vehicles. Springer; 1990:328-341. doi:10.1007/978-1-4613-8997-2_25","apa":"Dobkin, D., Edelsbrunner, H., & Yap, C. (1990). Probing convex polytopes. In I. Cox & G. Wilfong (Eds.), Autonomous Robot Vehicles (pp. 328–341). Springer. https://doi.org/10.1007/978-1-4613-8997-2_25","ieee":"D. Dobkin, H. Edelsbrunner, and C. Yap, “Probing convex polytopes,” in Autonomous Robot Vehicles, I. Cox and G. Wilfong, Eds. Springer, 1990, pp. 328–341.","ista":"Dobkin D, Edelsbrunner H, Yap C. 1990.Probing convex polytopes. In: Autonomous Robot Vehicles. , 328–341."},"quality_controlled":"1","page":"328 - 341","doi":"10.1007/978-1-4613-8997-2_25","date_published":"1990-01-01T00:00:00Z","language":[{"iso":"eng"}],"type":"book_chapter","abstract":[{"text":"We investigate the complexity of determining the shape and presentation (i.e. position with orientation) of convex polytopes in multi-dimensional Euclidean space using a variety of probe models.","lang":"eng"}],"publist_id":"2820","extern":"1","_id":"3565","year":"1990","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"NSF Grant MCS-83-03926 and DCR-85-05517\r\nAmoco Foundation Faculty Development in Computer Science\r\nNSF Grant DCR-84-01633 and DCR-84-01898","status":"public","title":"Probing convex polytopes","publication_status":"published","editor":[{"full_name":"Cox, Ingemar","first_name":"Ingemar","last_name":"Cox"},{"full_name":"Wilfong, Gordon","last_name":"Wilfong","first_name":"Gordon"}],"publisher":"Springer","author":[{"last_name":"Dobkin","first_name":"David","full_name":"Dobkin, David"},{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"first_name":"Chee","last_name":"Yap","full_name":"Yap, Chee"}],"date_created":"2018-12-11T12:03:59Z","date_updated":"2022-02-23T15:41:07Z","oa_version":"None"},{"extern":"1","publist_id":"2059","volume":85,"date_created":"2018-12-11T12:06:43Z","date_updated":"2022-02-22T15:10:54Z","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Souvaine, Diane","first_name":"Diane","last_name":"Souvaine"}],"publisher":"American Statistical Association","publication_status":"published","year":"1990","publication_identifier":{"issn":["0003-1291"],"eissn":["1537-274X"]},"month":"01","language":[{"iso":"eng"}],"doi":"10.1080/01621459.1990.10475313","quality_controlled":"1","main_file_link":[{"url":"https://www.tandfonline.com/doi/abs/10.1080/01621459.1990.10475313"}],"issue":"409","abstract":[{"text":"Given a set of data points pi = (xi, yi ) for 1 ≤ i ≤ n, the least median of squares regression line is a line y = ax + b for which the median of the squared residuals is a minimum over all choices of a and b. An algorithm is described that computes such a line in O(n 2) time and O(n) memory space, thus improving previous upper bounds on the problem. This algorithm is an application of a general method built on top of the topological sweep of line arrangements.","lang":"eng"}],"type":"journal_article","oa_version":"None","intvolume":" 85","title":"Computing least median of squares regression lines and guided topological sweep","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4064","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"1990-01-01T00:00:00Z","page":"115 - 119","article_type":"original","citation":{"chicago":"Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.” Journal of the American Statistical Association. American Statistical Association, 1990. https://doi.org/10.1080/01621459.1990.10475313.","mla":"Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.” Journal of the American Statistical Association, vol. 85, no. 409, American Statistical Association, 1990, pp. 115–19, doi:10.1080/01621459.1990.10475313.","short":"H. Edelsbrunner, D. Souvaine, Journal of the American Statistical Association 85 (1990) 115–119.","ista":"Edelsbrunner H, Souvaine D. 1990. Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. 85(409), 115–119.","ieee":"H. Edelsbrunner and D. Souvaine, “Computing least median of squares regression lines and guided topological sweep,” Journal of the American Statistical Association, vol. 85, no. 409. American Statistical Association, pp. 115–119, 1990.","apa":"Edelsbrunner, H., & Souvaine, D. (1990). Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. American Statistical Association. https://doi.org/10.1080/01621459.1990.10475313","ama":"Edelsbrunner H, Souvaine D. Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. 1990;85(409):115-119. doi:10.1080/01621459.1990.10475313"},"publication":"Journal of the American Statistical Association"},{"publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"month":"01","language":[{"iso":"eng"}],"doi":"10.1145/77635.77639","quality_controlled":"1","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/77635.77639"}],"extern":"1","publist_id":"2058","volume":9,"date_updated":"2022-02-22T14:58:39Z","date_created":"2018-12-11T12:06:43Z","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mücke, Ernst","first_name":"Ernst","last_name":"Mücke"}],"publisher":"ACM","publication_status":"published","year":"1990","acknowledgement":"Research of both authors was supported by Amoco Foundation Faculty Development grant CS 1-6-44862. It was partially carried out while both authors were with the Institutes for Information Processing at the Technical University of Graz, Austria. The first author also acknowledges support by the National Science Foundation under grant CCR-8714565. ","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"1990-01-01T00:00:00Z","page":"66 - 104","article_type":"original","citation":{"short":"H. Edelsbrunner, E. Mücke, ACM Transactions on Graphics 9 (1990) 66–104.","mla":"Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.” ACM Transactions on Graphics, vol. 9, no. 1, ACM, 1990, pp. 66–104, doi:10.1145/77635.77639.","chicago":"Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.” ACM Transactions on Graphics. ACM, 1990. https://doi.org/10.1145/77635.77639.","ama":"Edelsbrunner H, Mücke E. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics. 1990;9(1):66-104. doi:10.1145/77635.77639","ieee":"H. Edelsbrunner and E. Mücke, “Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms,” ACM Transactions on Graphics, vol. 9, no. 1. ACM, pp. 66–104, 1990.","apa":"Edelsbrunner, H., & Mücke, E. (1990). Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/77635.77639","ista":"Edelsbrunner H, Mücke E. 1990. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics. 9(1), 66–104."},"publication":"ACM Transactions on Graphics","issue":"1","abstract":[{"text":"This paper describes a general-purpose programming technique, called Simulation of Simplicity, that can be used to cope with degenerate input data for geometric algorithms. It relieves the programmer from the task of providing a consistent treatment for every single special case that can occur. The programs that use the technique tend to be considerably smaller and more robust than those that do not use it. We believe that this technique will become a standard tool in writing geometric software.","lang":"eng"}],"type":"journal_article","oa_version":"None","intvolume":" 9","status":"public","title":"Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4063"},{"issue":"3-4","abstract":[{"text":"This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in a tetrahedrization of n points in general position in three dimensions, i.e. such that no four points are co-planar, It also presents an algorithm that in O(n log n) time constructs a tetrahedrization of a set of n points consisting of at most 3n-11 tetrahedra.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","intvolume":" 10","status":"public","title":"Tetrahedrizing point sets in three dimensions","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4060","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"1990-01-01T00:00:00Z","page":"335 - 347","article_type":"original","citation":{"ama":"Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. 1990;10(3-4):335-347. doi:10.1016/S0747-7171(08)80068-5","ieee":"H. Edelsbrunner, F. Preparata, and D. West, “Tetrahedrizing point sets in three dimensions,” Journal of Symbolic Computation, vol. 10, no. 3–4. Elsevier, pp. 335–347, 1990.","apa":"Edelsbrunner, H., Preparata, F., & West, D. (1990). Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. Elsevier. https://doi.org/10.1016/S0747-7171(08)80068-5","ista":"Edelsbrunner H, Preparata F, West D. 1990. Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. 10(3–4), 335–347.","short":"H. Edelsbrunner, F. Preparata, D. West, Journal of Symbolic Computation 10 (1990) 335–347.","mla":"Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” Journal of Symbolic Computation, vol. 10, no. 3–4, Elsevier, 1990, pp. 335–47, doi:10.1016/S0747-7171(08)80068-5.","chicago":"Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.” Journal of Symbolic Computation. Elsevier, 1990. https://doi.org/10.1016/S0747-7171(08)80068-5."},"publication":"Journal of Symbolic Computation","extern":"1","publist_id":"2061","volume":10,"date_created":"2018-12-11T12:06:42Z","date_updated":"2022-02-23T10:10:35Z","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Preparata, Franco","first_name":"Franco","last_name":"Preparata"},{"last_name":"West","first_name":"Douglas","full_name":"West, Douglas"}],"publisher":"Elsevier","publication_status":"published","acknowledgement":"Research of the first author is supported by Amoco Fnd. Fac. Dec. Comput. Sci. 1-6-44862, the second author is supported by NSF Grant ECS 84-10902, and research of the third author is supported in part by ONR Grant N00014-85K0570 and by NSF Grant DMS 8504322.","year":"1990","publication_identifier":{"issn":["0747-7171"],"eissn":["1095-855X"]},"month":"01","language":[{"iso":"eng"}],"doi":"10.1016/S0747-7171(08)80068-5","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0747717108800685?via%3Dihub"}],"oa":1},{"title":"Covering convex sets with non-overlapping polygons","status":"public","intvolume":" 81","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4065","oa_version":"None","type":"journal_article","abstract":[{"text":"We prove that given n⩾3 convex, compact, and pairwise disjoint sets in the plane, they may be covered with n non-overlapping convex polygons with a total of not more than 6n−9 sides, and with not more than 3n−6 distinct slopes. Furthermore, we construct sets that require 6n−9 sides and 3n−6 slopes for n⩾3. The upper bound on the number of slopes implies a new bound on a recently studied transversal problem.","lang":"eng"}],"issue":"2","article_type":"original","page":"153 - 164","publication":"Discrete Mathematics","citation":{"mla":"Edelsbrunner, Herbert, et al. “Covering Convex Sets with Non-Overlapping Polygons.” Discrete Mathematics, vol. 81, no. 2, Elsevier, 1990, pp. 153–64, doi:10.1016/0012-365X(90)90147-A.","short":"H. Edelsbrunner, A. Robison, X. Shen, Discrete Mathematics 81 (1990) 153–164.","chicago":"Edelsbrunner, Herbert, Arch Robison, and Xiao Shen. “Covering Convex Sets with Non-Overlapping Polygons.” Discrete Mathematics. Elsevier, 1990. https://doi.org/10.1016/0012-365X(90)90147-A.","ama":"Edelsbrunner H, Robison A, Shen X. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 1990;81(2):153-164. doi:10.1016/0012-365X(90)90147-A","ista":"Edelsbrunner H, Robison A, Shen X. 1990. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 81(2), 153–164.","apa":"Edelsbrunner, H., Robison, A., & Shen, X. (1990). Covering convex sets with non-overlapping polygons. Discrete Mathematics. Elsevier. https://doi.org/10.1016/0012-365X(90)90147-A","ieee":"H. Edelsbrunner, A. Robison, and X. Shen, “Covering convex sets with non-overlapping polygons,” Discrete Mathematics, vol. 81, no. 2. Elsevier, pp. 153–164, 1990."},"date_published":"1990-04-15T00:00:00Z","scopus_import":"1","day":"15","article_processing_charge":"No","publication_status":"published","publisher":"Elsevier","year":"1990","acknowledgement":"The first author acknowledges the support by Amoco Fnd. Fat. Dev. Comput. Sci. l-6-44862. Work on this paper by the second author was supported by a Shell Fellowship in Computer Science. The third author as supported by the office of Naval Research under grant NOOO14-86K-0416. ","date_updated":"2022-02-22T15:45:55Z","date_created":"2018-12-11T12:06:44Z","volume":81,"author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"full_name":"Robison, Arch","last_name":"Robison","first_name":"Arch"},{"first_name":"Xiao","last_name":"Shen","full_name":"Shen, Xiao"}],"extern":"1","publist_id":"2060","quality_controlled":"1","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0012365X9090147A?via%3Dihub"}],"language":[{"iso":"eng"}],"doi":"10.1016/0012-365X(90)90147-A","month":"04","publication_identifier":{"issn":["0012-365X"],"eissn":["1872-681X"]}},{"day":"01","article_processing_charge":"No","date_published":"1990-03-01T00:00:00Z","article_type":"original","page":"99 - 160","publication":"Discrete & Computational Geometry","citation":{"ama":"Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. 1990;5(1):99-160. doi:10.1007/BF02187783","ista":"Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. 1990. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. 5(1), 99–160.","apa":"Clarkson, K., Edelsbrunner, H., Guibas, L., Sharir, M., & Welzl, E. (1990). Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187783","ieee":"K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, “Combinatorial complexity bounds for arrangements of curves and spheres,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 99–160, 1990.","mla":"Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:10.1007/BF02187783.","short":"K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 5 (1990) 99–160.","chicago":"Clarkson, Kenneth, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Emo Welzl. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.” Discrete & Computational Geometry. Springer, 1990. https://doi.org/10.1007/BF02187783."},"abstract":[{"text":"We present upper and lower bounds for extremal problems defined for arrangements of lines, circles, spheres, and alike. For example, we prove that the maximum number of edges boundingm cells in an arrangement ofn lines is Θ(m 2/3 n 2/3 +n), and that it isO(m 2/3 n 2/3 β(n) +n) forn unit-circles, whereβ(n) (and laterβ(m, n)) is a function that depends on the inverse of Ackermann's function and grows extremely slowly. If we replace unit-circles by circles of arbitrary radii the upper bound goes up toO(m 3/5 n 4/5 β(n) +n). The same bounds (without theβ(n)-terms) hold for the maximum sum of degrees ofm vertices. In the case of vertex degrees in arrangements of lines and of unit-circles our bounds match previous results, but our proofs are considerably simpler than the previous ones. The maximum sum of degrees ofm vertices in an arrangement ofn spheres in three dimensions isO(m 4/7 n 9/7 β(m, n) +n 2), in general, andO(m 3/4 n 3/4 β(m, n) +n) if no three spheres intersect in a common circle. The latter bound implies that the maximum number of unit-distances amongm points in three dimensions isO(m 3/2 β(m)) which improves the best previous upper bound on this problem. Applications of our results to other distance problems are also given.","lang":"eng"}],"issue":"1","type":"journal_article","oa_version":"None","title":"Combinatorial complexity bounds for arrangements of curves and spheres","status":"public","intvolume":" 5","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4074","month":"03","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"language":[{"iso":"eng"}],"doi":"10.1007/BF02187783","quality_controlled":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187783"}],"extern":"1","publist_id":"2048","date_updated":"2022-02-17T15:41:04Z","date_created":"2018-12-11T12:06:47Z","volume":5,"author":[{"first_name":"Kenneth","last_name":"Clarkson","full_name":"Clarkson, Kenneth"},{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","last_name":"Guibas","first_name":"Leonidas"},{"last_name":"Sharir","first_name":"Micha","full_name":"Sharir, Micha"},{"first_name":"Emo","last_name":"Welzl","full_name":"Welzl, Emo"}],"publication_status":"published","publisher":"Springer","acknowledgement":"The research of the second author was supported by the National Science Foundation under Grant CCR-8714565. Work by the fourth author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant No. NSF-DCR-83-20085, by grants from the Digital Equipment Corporation and the IBM Corporation, and by a research grant from the NCRD, the Israeli National Council for Research and Development. A preliminary version of this paper has appeared in theProceedings of the 29th IEEE Symposium on Foundations of Computer Science, 1988.","year":"1990"},{"author":[{"full_name":"Chazelle, Bernard","last_name":"Chazelle","first_name":"Bernard"},{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"full_name":"Hershberger, John","first_name":"John","last_name":"Hershberger"},{"full_name":"Seidel, Raimund","first_name":"Raimund","last_name":"Seidel"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"oa_version":"None","date_updated":"2022-02-17T10:09:54Z","date_created":"2018-12-11T12:06:48Z","year":"1990","_id":"4078","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publisher":"ACM","title":"Slimming down by adding; selecting heavily covered points","status":"public","publication_status":"published","publist_id":"2046","abstract":[{"text":"In this paper we derived combinatorial point selection results for geometric objects defined by pairs of points. In a nutshell, the results say that if many pairs of a set of n points in some fixed dimension each define a geometric object of some type, then there is a point covered by many of these objects. Based on such a result for three-dimensional spheres we show that the combinatorial size of the Delaunay triangulation of a point set in space can be reduced by adding new points. We believe that from a practical point of view this is the most important result of this paper.","lang":"eng"}],"extern":"1","type":"conference","date_published":"1990-01-01T00:00:00Z","doi":"10.1145/98524.98551","conference":{"name":"SCG: Symposium on Computational Geometry","location":"Berkley, CA, United States","start_date":"1990-06-07","end_date":"1990-06-09"},"language":[{"iso":"eng"}],"citation":{"ama":"Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. Slimming down by adding; selecting heavily covered points. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:116-127. doi:10.1145/98524.98551","ista":"Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. 1990. Slimming down by adding; selecting heavily covered points. Proceedings of the 6th annual symposium on computational geometry. SCG: Symposium on Computational Geometry, 116–127.","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., & Sharir, M. (1990). Slimming down by adding; selecting heavily covered points. In Proceedings of the 6th annual symposium on computational geometry (pp. 116–127). Berkley, CA, United States: ACM. https://doi.org/10.1145/98524.98551","ieee":"B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, and M. Sharir, “Slimming down by adding; selecting heavily covered points,” in Proceedings of the 6th annual symposium on computational geometry, Berkley, CA, United States, 1990, pp. 116–127.","mla":"Chazelle, Bernard, et al. “Slimming down by Adding; Selecting Heavily Covered Points.” Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 116–27, doi:10.1145/98524.98551.","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 116–127.","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, John Hershberger, Raimund Seidel, and Micha Sharir. “Slimming down by Adding; Selecting Heavily Covered Points.” In Proceedings of the 6th Annual Symposium on Computational Geometry, 116–27. ACM, 1990. https://doi.org/10.1145/98524.98551."},"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/98524.98551"}],"publication":"Proceedings of the 6th annual symposium on computational geometry","page":"116 - 127","quality_controlled":"1","publication_identifier":{"isbn":["978-0-89791-362-1"]},"article_processing_charge":"No","day":"01","month":"01","scopus_import":"1"},{"oa_version":"None","date_updated":"2022-02-16T15:30:22Z","date_created":"2018-12-11T12:06:48Z","author":[{"full_name":"Agarwal, Pankaj","last_name":"Agarwal","first_name":"Pankaj"},{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"first_name":"Otfried","last_name":"Schwarzkopf","full_name":"Schwarzkopf, Otfried"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"}],"publisher":"ACM","publication_status":"published","title":" Euclidean minimum spanning trees and bichromatic closest pairs","status":"public","_id":"4076","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","year":"1990","extern":"1","publist_id":"2044","abstract":[{"lang":"eng","text":"We present an algorithm to compute a Euclidean minimum spanning tree of a given set S of n points in Ed in time O(Td(N, N) logd N), where Td(n, m) is the time required to compute a bichromatic closest pair among n red and m blue points in Ed. If Td(N, N) = Ω(N1+ε), for some fixed ε > 0, then the running time improves to O(Td(N, N)). Furthermore, we describe a randomized algorithm to compute a bichromatic closets pair in expected time O((nm log n log m)2/3+m log2 n + n log2 m) in E3, which yields an O(N4/3log4/3 N) expected time algorithm for computing a Euclidean minimum spanning tree of N points in E3."}],"type":"conference","language":[{"iso":"eng"}],"date_published":"1990-01-01T00:00:00Z","doi":"10.1145/98524.98567","conference":{"name":"SCG: Symposium on Computational Geometry","end_date":"1990-06-09","location":"Berkeley, CA, United States","start_date":"1990-06-07"},"page":"203 - 210","quality_controlled":"1","citation":{"ista":"Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1990. Euclidean minimum spanning trees and bichromatic closest pairs. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 203–210.","ieee":"P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “ Euclidean minimum spanning trees and bichromatic closest pairs,” in Proceedings of the 6th annual symposium on Computational geometry, Berkeley, CA, United States, 1990, pp. 203–210.","apa":"Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., & Welzl, E. (1990). Euclidean minimum spanning trees and bichromatic closest pairs. In Proceedings of the 6th annual symposium on Computational geometry (pp. 203–210). Berkeley, CA, United States: ACM. https://doi.org/10.1145/98524.98567","ama":"Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:203-210. doi:10.1145/98524.98567","chicago":"Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “ Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” In Proceedings of the 6th Annual Symposium on Computational Geometry, 203–10. ACM, 1990. https://doi.org/10.1145/98524.98567.","mla":"Agarwal, Pankaj, et al. “ Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–10, doi:10.1145/98524.98567.","short":"P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210."},"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/98524.98567"}],"publication":"Proceedings of the 6th annual symposium on Computational geometry","publication_identifier":{"isbn":["978-0-89791-362-1"]},"article_processing_charge":"No","day":"01","month":"01","scopus_import":"1"},{"status":"public","publication_status":"published","title":"Points and triangles in the plane and halving planes in space","publisher":"ACM","_id":"4077","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","year":"1990","date_created":"2018-12-11T12:06:48Z","date_updated":"2022-02-17T09:42:27Z","oa_version":"None","author":[{"full_name":"Aronov, Boris","first_name":"Boris","last_name":"Aronov"},{"full_name":"Chazelle, Bernard","last_name":"Chazelle","first_name":"Bernard"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"},{"full_name":"Wenger, Rephael","last_name":"Wenger","first_name":"Rephael"}],"type":"conference","extern":"1","abstract":[{"text":"We prove that for any set S of n points in the plane and n3-α triangles spanned by the points of S there exists a point (not necessarily of S) contained in at least n3-3α/(512 log25 n) of the triangles. This implies that any set of n points in three - dimensional space defines at most 6.4n8/3 log5/3 n halving planes.","lang":"eng"}],"publist_id":"2045","quality_controlled":"1","page":"112 - 115","publication":"Proceedings of the 6th annual symposium on Computational geometry","citation":{"short":"B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–115.","mla":"Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.” Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–15, doi:10.1145/98524.98548.","chicago":"Aronov, Boris, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Rephael Wenger. “Points and Triangles in the Plane and Halving Planes in Space.” In Proceedings of the 6th Annual Symposium on Computational Geometry, 112–15. ACM, 1990. https://doi.org/10.1145/98524.98548.","ama":"Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. Points and triangles in the plane and halving planes in space. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:112-115. doi:10.1145/98524.98548","apa":"Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., & Wenger, R. (1990). Points and triangles in the plane and halving planes in space. In Proceedings of the 6th annual symposium on Computational geometry (pp. 112–115). Berkley, CA, United States: ACM. https://doi.org/10.1145/98524.98548","ieee":"B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 112–115.","ista":"Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1990. Points and triangles in the plane and halving planes in space. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 112–115."},"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/98524.98548"}],"language":[{"iso":"eng"}],"conference":{"name":"SCG: Symposium on Computational Geometry","end_date":"1990-06-09","start_date":"1990-06-07","location":"Berkley, CA, United States"},"date_published":"1990-01-01T00:00:00Z","doi":"10.1145/98524.98548","scopus_import":"1","day":"01","month":"01","publication_identifier":{"isbn":["978-0-89791-362-1"]},"article_processing_charge":"No"},{"scopus_import":"1","article_processing_charge":"No","day":"01","page":"561 - 571","article_type":"original","citation":{"ama":"Dobkin D, Edelsbrunner H, Overmars M. Searching for empty convex polygons. Algorithmica. 1990;5(4):561-571. doi:10.1007/BF01840404","apa":"Dobkin, D., Edelsbrunner, H., & Overmars, M. (1990). Searching for empty convex polygons. Algorithmica. Springer. https://doi.org/10.1007/BF01840404","ieee":"D. Dobkin, H. Edelsbrunner, and M. Overmars, “Searching for empty convex polygons,” Algorithmica, vol. 5, no. 4. Springer, pp. 561–571, 1990.","ista":"Dobkin D, Edelsbrunner H, Overmars M. 1990. Searching for empty convex polygons. Algorithmica. 5(4), 561–571.","short":"D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.","mla":"Dobkin, David, et al. “Searching for Empty Convex Polygons.” Algorithmica, vol. 5, no. 4, Springer, 1990, pp. 561–71, doi:10.1007/BF01840404.","chicago":"Dobkin, David, Herbert Edelsbrunner, and Mark Overmars. “Searching for Empty Convex Polygons.” Algorithmica. Springer, 1990. https://doi.org/10.1007/BF01840404."},"publication":"Algorithmica","date_published":"1990-06-01T00:00:00Z","type":"journal_article","issue":"4","abstract":[{"text":"A key problem in computational geometry is the identification of subsets of a point set having particular properties. We study this problem for the properties of convexity and emptiness. We show that finding empty triangles is related to the problem of determining pairs of vertices that see each other in a star-shaped polygon. A linear-time algorithm for this problem which is of independent interest yields an optimal algorithm for finding all empty triangles. This result is then extended to an algorithm for finding empty convex r-gons (r> 3) and for determining a largest empty convex subset. Finally, extensions to higher dimensions are mentioned.","lang":"eng"}],"intvolume":" 5","status":"public","title":"Searching for empty convex polygons","_id":"4075","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","publication_identifier":{"eissn":["1432-0541"],"issn":["0178-4617"]},"month":"06","quality_controlled":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01840404"}],"language":[{"iso":"eng"}],"doi":"10.1007/BF01840404","extern":"1","publist_id":"2049","publisher":"Springer","publication_status":"published","year":"1990","acknowledgement":"The first author is pleased to acknowledge support by the National Science Foundation under Grant CCR-8700917. The research of the second author was supported by Amoco Foundation Faculty Development Grant CS 1-6-44862 and by the National Science Foundatio","volume":5,"date_updated":"2022-02-21T10:55:13Z","date_created":"2018-12-11T12:06:47Z","author":[{"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","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Overmars, Mark","first_name":"Mark","last_name":"Overmars"}]},{"day":"01","month":"01","publication_identifier":{"isbn":[" 978-3642744761"]},"article_processing_charge":"No","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-74474-7_5","date_published":"1990-01-01T00:00:00Z","quality_controlled":"1","page":"115 - 174","publication":"Population biology: Ecological and evolutionary viewpoints","citation":{"short":"N.H. Barton, A. Clark, in:, K. Wöhrmann, S. Jain (Eds.), Population Biology: Ecological and Evolutionary Viewpoints, Springer, 1990, pp. 115–174.","mla":"Barton, Nicholas H., and A. Clark. “Population Structure and Processes in Evolution.” Population Biology: Ecological and Evolutionary Viewpoints, edited by Klaus Wöhrmann and Subodh Jain, Springer, 1990, pp. 115–74, doi:10.1007/978-3-642-74474-7_5.","chicago":"Barton, Nicholas H, and A. Clark. “Population Structure and Processes in Evolution.” In Population Biology: Ecological and Evolutionary Viewpoints, edited by Klaus Wöhrmann and Subodh Jain, 115–74. Springer, 1990. https://doi.org/10.1007/978-3-642-74474-7_5.","ama":"Barton NH, Clark A. Population structure and processes in evolution. In: Wöhrmann K, Jain S, eds. Population Biology: Ecological and Evolutionary Viewpoints. Springer; 1990:115-174. doi:10.1007/978-3-642-74474-7_5","apa":"Barton, N. H., & Clark, A. (1990). Population structure and processes in evolution. In K. Wöhrmann & S. Jain (Eds.), Population biology: Ecological and evolutionary viewpoints (pp. 115–174). Springer. https://doi.org/10.1007/978-3-642-74474-7_5","ieee":"N. H. Barton and A. Clark, “Population structure and processes in evolution,” in Population biology: Ecological and evolutionary viewpoints, K. Wöhrmann and S. Jain, Eds. Springer, 1990, pp. 115–174.","ista":"Barton NH, Clark A. 1990.Population structure and processes in evolution. In: Population biology: Ecological and evolutionary viewpoints. , 115–174."},"main_file_link":[{"url":"https://link.springer.com/book/10.1007/978-3-642-74474-7"}],"extern":"1","publist_id":"1748","type":"book_chapter","date_updated":"2022-02-16T10:49:05Z","date_created":"2018-12-11T12:08:11Z","oa_version":"None","author":[{"last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"},{"last_name":"Clark","first_name":"A.","full_name":"Clark, A."}],"status":"public","title":"Population structure and processes in evolution","publication_status":"published","editor":[{"full_name":"Wöhrmann, Klaus","last_name":"Wöhrmann","first_name":"Klaus"},{"last_name":"Jain","first_name":"Subodh","full_name":"Jain, Subodh"}],"publisher":"Springer","_id":"4311","year":"1990","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"scopus_import":"1","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"article_processing_charge":"No","day":"02","month":"08","page":"415 - 416","quality_controlled":"1","article_type":"original","main_file_link":[{"url":"https://www.nature.com/articles/346415a0"}],"citation":{"chicago":"Barton, Nicholas H, and Steve Jones. “The Language of the Genes.” Nature. Nature Publishing Group, 1990. https://doi.org/10.1038/346415a0.","short":"N.H. Barton, S. Jones, Nature 346 (1990) 415–416.","mla":"Barton, Nicholas H., and Steve Jones. “The Language of the Genes.” Nature, vol. 346, Nature Publishing Group, 1990, pp. 415–16, doi:10.1038/346415a0.","apa":"Barton, N. H., & Jones, S. (1990). The language of the genes. Nature. Nature Publishing Group. https://doi.org/10.1038/346415a0","ieee":"N. H. Barton and S. Jones, “The language of the genes,” Nature, vol. 346. Nature Publishing Group, pp. 415–416, 1990.","ista":"Barton NH, Jones S. 1990. The language of the genes. Nature. 346, 415–416.","ama":"Barton NH, Jones S. The language of the genes. Nature. 1990;346:415-416. doi:10.1038/346415a0"},"publication":"Nature","language":[{"iso":"eng"}],"date_published":"1990-08-02T00:00:00Z","doi":"10.1038/346415a0","type":"journal_article","extern":"1","publist_id":"1749","publisher":"Nature Publishing Group","intvolume":" 346","publication_status":"published","title":"The language of the genes","status":"public","_id":"4310","year":"1990","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","volume":346,"oa_version":"None","date_updated":"2022-02-16T10:51:50Z","date_created":"2018-12-11T12:08:11Z","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H"},{"full_name":"Jones, Steve","last_name":"Jones","first_name":"Steve"}]},{"publist_id":"220","abstract":[{"text":"The interleaving model is both adequate and sufficiently abstract to allow for the practical specification and verification of many properties of concurrent systems. We incorporate real time into this model by defining the abstract notion of a real-time transition system as a conservative extension of traditional transition systems: qualitative fairness requirements are replaced (and superseded) by quantitative lower-bound and upper-bound real-time requirements for transitions.\r\nWe present proof rules to establish lower and upper real-time bounds for response properties of real-time transition systems. This proof system can be used to verify bounded-invariance and bounded-response properties, such as timely termination of shared-variables multi-process systems, whose semantics is defined in terms of real-time transition systems.","lang":"eng"}],"extern":"1","type":"conference","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Manna, Zohar","first_name":"Zohar","last_name":"Manna"},{"first_name":"Amir","last_name":"Pnueli","full_name":"Pnueli, Amir"}],"oa_version":"None","date_updated":"2022-02-15T15:51:25Z","date_created":"2018-12-11T12:09:14Z","_id":"4510","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"Sponsors: IBM graduate fellowship, National Science Foundation grant CCR-89-11512, National Science Foundation CCR-89-13641, Defense Advanced Research Projects Agency under contract N00039-84-C-0211, United States Air Force Office of Scientific Research under contract AFOSR-90-0057, European Community ESPRIT Basic Research Action project 3096 (SPEC).","year":"1990","publisher":"IEEE","title":"An interleaving model for real time","publication_status":"published","status":"public","publication_identifier":{"isbn":["0-8186-2078-1"]},"article_processing_charge":"No","day":"01","month":"01","scopus_import":"1","date_published":"1990-01-01T00:00:00Z","doi":"10.1109/JCIT.1990.128356","conference":{"name":"JCIT: Jerusalem Conference on Information Technology","start_date":"1990-10-22","location":"Jerusalem, Israel","end_date":"1990-10-25"},"language":[{"iso":"eng"}],"citation":{"mla":"Henzinger, Thomas A., et al. “An Interleaving Model for Real Time.” Proceedings of the 5th Jerusalem Conference on Information Technology, IEEE, 1990, pp. 717–30, doi:10.1109/JCIT.1990.128356.","short":"T.A. Henzinger, Z. Manna, A. Pnueli, in:, Proceedings of the 5th Jerusalem Conference on Information Technology, IEEE, 1990, pp. 717–730.","chicago":"Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “An Interleaving Model for Real Time.” In Proceedings of the 5th Jerusalem Conference on Information Technology, 717–30. IEEE, 1990. https://doi.org/10.1109/JCIT.1990.128356.","ama":"Henzinger TA, Manna Z, Pnueli A. An interleaving model for real time. In: Proceedings of the 5th Jerusalem Conference on Information Technology. IEEE; 1990:717-730. doi:10.1109/JCIT.1990.128356","ista":"Henzinger TA, Manna Z, Pnueli A. 1990. An interleaving model for real time. Proceedings of the 5th Jerusalem Conference on Information Technology. JCIT: Jerusalem Conference on Information Technology, 717–730.","apa":"Henzinger, T. A., Manna, Z., & Pnueli, A. (1990). An interleaving model for real time. In Proceedings of the 5th Jerusalem Conference on Information Technology (pp. 717–730). Jerusalem, Israel: IEEE. https://doi.org/10.1109/JCIT.1990.128356","ieee":"T. A. Henzinger, Z. Manna, and A. Pnueli, “An interleaving model for real time,” in Proceedings of the 5th Jerusalem Conference on Information Technology, Jerusalem, Israel, 1990, pp. 717–730."},"main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/128356"}],"publication":" Proceedings of the 5th Jerusalem Conference on Information Technology","page":"717 - 730","quality_controlled":"1"},{"page":"281 - 296","quality_controlled":"1","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/93385.93429"}],"citation":{"ama":"Henzinger TA. Half-order modal logic: How to prove real-time properties. In: Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing. ACM; 1990:281-296. doi:10.1145/93385.93429","apa":"Henzinger, T. A. (1990). Half-order modal logic: How to prove real-time properties. In Proceedings of the 9th annual ACM symposium on Principles of distributed computing (pp. 281–296). Quebec City, Canada: ACM. https://doi.org/10.1145/93385.93429","ieee":"T. A. Henzinger, “Half-order modal logic: How to prove real-time properties,” in Proceedings of the 9th annual ACM symposium on Principles of distributed computing, 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.","short":"T.A. Henzinger, in:, Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1990, pp. 281–296.","mla":"Henzinger, Thomas A. “Half-Order Modal Logic: How to Prove Real-Time Properties.” Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1990, pp. 281–96, doi:10.1145/93385.93429.","chicago":"Henzinger, Thomas A. “Half-Order Modal Logic: How to Prove Real-Time Properties.” In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, 281–96. ACM, 1990. https://doi.org/10.1145/93385.93429."},"publication":"Proceedings of the 9th annual ACM symposium on Principles of distributed computing","language":[{"iso":"eng"}],"date_published":"1990-01-01T00:00:00Z","doi":"10.1145/93385.93429","conference":{"name":"PODC: Principles of Distributed Computing","end_date":"1990-08-24","start_date":"1990-08-22","location":"Quebec City, Canada"},"scopus_import":"1","article_processing_charge":"No","publication_identifier":{"isbn":["978-0-89791-404-8"]},"day":"01","month":"01","publisher":"ACM","status":"public","title":"Half-order modal logic: How to prove real-time properties","publication_status":"published","acknowledgement":"Many thanks to Rajeev Alur, Adam Grove, Zohar Manna, and Amir Pnueli for their continuous discussions and support.","_id":"4522","year":"1990","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","date_updated":"2022-02-15T15:11:03Z","date_created":"2018-12-11T12:09:17Z","author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"}],"type":"conference","extern":"1","publist_id":"209","abstract":[{"text":"We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These values are. however, not treated as full first-order objects: they can be accessed only by a very restricted form of quantification: the \"freeze\" quantifier binds a variable to the value of the current world. We present a complete proof system for this (\"half-order\") modal logic. As a special case, we obtain the real-time temporal logic TPTL of [AH891: the models are restricted to infinite sequences of states, whose values are monotonically increasing natural numbers. The ordering relation between states is interpreted as temporal precedence. while the value associated with a state is interpreted as its \"rear time. We extend our proof system to be complete for TPTL. and demonstrate how it can be used to derive real-time properties. ","lang":"eng"}]},{"page":"390 - 401","quality_controlled":"1","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/113764"}],"citation":{"chicago":"Alur, Rajeev, and Thomas A Henzinger. “Real-Time Logics: Complexity and Expressiveness.” In 5th Annual IEEE Symposium on Logic in Computer Science, 390–401. IEEE, 1990. https://doi.org/10.1109/LICS.1990.113764.","mla":"Alur, Rajeev, and Thomas A. Henzinger. “Real-Time Logics: Complexity and Expressiveness.” 5th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1990, pp. 390–401, doi:10.1109/LICS.1990.113764.","short":"R. Alur, T.A. Henzinger, in:, 5th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1990, pp. 390–401.","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.","apa":"Alur, R., & Henzinger, T. A. (1990). Real-time logics: Complexity and expressiveness. In 5th Annual IEEE Symposium on Logic in Computer Science (pp. 390–401). Philadelphia, PA, USA: IEEE. https://doi.org/10.1109/LICS.1990.113764","ieee":"R. Alur and T. A. Henzinger, “Real-time logics: Complexity and expressiveness,” in 5th Annual IEEE Symposium on Logic in Computer Science, Philadelphia, PA, USA, 1990, pp. 390–401.","ama":"Alur R, Henzinger TA. Real-time logics: Complexity and expressiveness. In: 5th Annual IEEE Symposium on Logic in Computer Science. IEEE; 1990:390-401. doi:10.1109/LICS.1990.113764"},"publication":" 5th Annual IEEE Symposium on Logic in Computer Science","language":[{"iso":"eng"}],"doi":"10.1109/LICS.1990.113764","date_published":"1990-08-06T00:00:00Z","conference":{"name":"LICS: Logic in Computer Science","location":"Philadelphia, PA, USA","start_date":"1990-06-04","end_date":"1990-06-07"},"scopus_import":"1","publication_identifier":{"isbn":["0-8186-2073-0"]},"article_processing_charge":"No","month":"08","day":"06","publisher":"IEEE","status":"public","title":"Real-time logics: Complexity and expressiveness","publication_status":"published","year":"1990","_id":"4597","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","date_updated":"2022-02-15T14:35:30Z","date_created":"2018-12-11T12:09:40Z","author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"type":"conference","extern":"1","publist_id":"112","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"}]}]