[{"author":[{"first_name":"Takeshi","last_name":"Ishihara","full_name":"Ishihara, Takeshi"},{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"},{"first_name":"Kensaku","last_name":"Mori","full_name":"Mori, Kensaku"},{"full_name":"Takahashi, Kenji","last_name":"Takahashi","first_name":"Kenji"},{"last_name":"Nagata","first_name":"Shigekazu","full_name":"Nagata, Shigekazu"}],"date_published":"1992-04-01T00:00:00Z","doi":"10.1016/0896-6273(92)90101-I","date_updated":"2022-03-17T13:33:07Z","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","pmid":1,"day":"01","language":[{"iso":"eng"}],"month":"04","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/089662739290101I?via%3Dihub"}],"intvolume":"         8","publication_status":"published","abstract":[{"text":"Vasoactive intestinal polypeptide (VIP), a 28 amino acid peptide hormone, plays many physiological roles in the peripheral and central nerve systems. A functional cDNA clone of the VIP receptor was isolated from a rat lung cDNA library by cross-hybridization with the secretin receptor cDNA. VIP bound the cloned VIP receptor expressed in mouse COP cells and stimulated adenylate cyclase through the cloned receptor. The rat VIP receptor consists of 459 amino acids with a calculated Mr of 52,054 and contains seven transmembrane segments. It is structurally related to the secretin, calcitonin, and parathyroid hormone receptors, suggesting that they constitute a new subfamily of the G5 protein - coupled receptors. VIP receptor mRNA was detected in various rat tissues including liver, lung, intestines, and brain. In situ hybridization revealed that VIP receptor mRNA is widely distributed in neuronal cells of the adult rat brain, with a relatively high expression in the cerebral cortex and hippocampus.","lang":"eng"}],"extern":"1","title":"Functional expression and tissue distribution of a novel receptor for vasoactive intestinal polypeptide","publication":"Neuron","publisher":"Elsevier","oa_version":"None","date_created":"2018-12-11T11:58:14Z","publist_id":"4363","acknowledgement":"We thank Drs. R. Yoshida, K. Katoh, and K. lmamura for help with the in situ hybridization, Dr. M. Nishizawa for discussion, and Ms. M. lkeda for secretarial assistance. This work was supported in part by a Grant-in-Aid from the Ministry of Education, Science and Culture of Japan. The costs of publication of this article were defrayed in part\r\nby the payment of page charges. This article must therefore be hereby marked “advertisement” in accordance with 18 USC Section 1734 solely to indicate this fact.","status":"public","article_type":"original","external_id":{"pmid":["1314625"]},"issue":"4","citation":{"ista":"Ishihara T, Shigemoto R, Mori K, Takahashi K, Nagata S. 1992. Functional expression and tissue distribution of a novel receptor for vasoactive intestinal polypeptide. Neuron. 8(4), 811–819.","short":"T. Ishihara, R. Shigemoto, K. Mori, K. Takahashi, S. Nagata, Neuron 8 (1992) 811–819.","mla":"Ishihara, Takeshi, et al. “Functional Expression and Tissue Distribution of a Novel Receptor for Vasoactive Intestinal Polypeptide.” <i>Neuron</i>, vol. 8, no. 4, Elsevier, 1992, pp. 811–19, doi:<a href=\"https://doi.org/10.1016/0896-6273(92)90101-I\">10.1016/0896-6273(92)90101-I</a>.","ama":"Ishihara T, Shigemoto R, Mori K, Takahashi K, Nagata S. Functional expression and tissue distribution of a novel receptor for vasoactive intestinal polypeptide. <i>Neuron</i>. 1992;8(4):811-819. doi:<a href=\"https://doi.org/10.1016/0896-6273(92)90101-I\">10.1016/0896-6273(92)90101-I</a>","apa":"Ishihara, T., Shigemoto, R., Mori, K., Takahashi, K., &#38; Nagata, S. (1992). Functional expression and tissue distribution of a novel receptor for vasoactive intestinal polypeptide. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/0896-6273(92)90101-I\">https://doi.org/10.1016/0896-6273(92)90101-I</a>","ieee":"T. Ishihara, R. Shigemoto, K. Mori, K. Takahashi, and S. Nagata, “Functional expression and tissue distribution of a novel receptor for vasoactive intestinal polypeptide,” <i>Neuron</i>, vol. 8, no. 4. Elsevier, pp. 811–819, 1992.","chicago":"Ishihara, Takeshi, Ryuichi Shigemoto, Kensaku Mori, Kenji Takahashi, and Shigekazu Nagata. “Functional Expression and Tissue Distribution of a Novel Receptor for Vasoactive Intestinal Polypeptide.” <i>Neuron</i>. Elsevier, 1992. <a href=\"https://doi.org/10.1016/0896-6273(92)90101-I\">https://doi.org/10.1016/0896-6273(92)90101-I</a>."},"publication_identifier":{"issn":["0896-6273"]},"page":"811 - 819","volume":8,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"2534","year":"1992"},{"day":"01","pmid":1,"month":"01","language":[{"iso":"eng"}],"publication_status":"published","main_file_link":[{"url":"http://genesdev.cshlp.org/content/6/12b/2620","open_access":"1"}],"intvolume":"         6","article_processing_charge":"No","doi":"10.1101/gad.6.12b.2620","date_updated":"2022-03-17T14:52:29Z","author":[{"full_name":"Sasai, Yoshiki","last_name":"Sasai","first_name":"Yoshiki"},{"full_name":"Kageyama, Ryoichiro","last_name":"Kageyama","first_name":"Ryoichiro"},{"last_name":"Tagawa","first_name":"Yoshiaki","full_name":"Tagawa, Yoshiaki"},{"first_name":"Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Shigetada","last_name":"Nakanishi","full_name":"Nakanishi, Shigetada"}],"date_published":"1992-01-01T00:00:00Z","quality_controlled":"1","scopus_import":"1","issue":"12 B","article_type":"original","external_id":{"pmid":["1340473"]},"oa":1,"acknowledgement":"We thank Professor Noboru Mizuno for his kind help with in situ hybridization experiments, Akira Uesugi and Dr. Chihiro\r\nAkazawa for photographic assistance, Drs. Elizabeth Knust and Jose A. Campos-Ortega for communicating their unpublished results, Dr. Shinji Fushiki for useful discussion, Dr. Mikio Nishizawa and Professor Shigekazu Nagata for pMNT, Dr. David Baltimore for the E47 expression vector, Drs. Yoichiro Nabeshima and Atsuko Fujisawa for the MyoD expression vector and the reporter plasmid with the MCK enhancer, and Dr. Makoto Ishibashi for his help in isolating the human E47 eDNA clone. This work was supported in part by research grants from the Ministry of Education, Science, and Culture of Japan. The publication costs of this article were defrayed in part by payment of page charges. This article must therefore be hereby marked \"advertisement\" in accordance with 18 USC section 1734 solely to indicate this fact. \r\n","status":"public","publication_identifier":{"issn":["0890-9369"]},"citation":{"ista":"Sasai Y, Kageyama R, Tagawa Y, Shigemoto R, Nakanishi S. 1992. Two mammalian helix-loop-helix factors structurally related to Drosophila hairy and Enhancer of split. Genes and Development. 6(12 B), 2620–2634.","short":"Y. Sasai, R. Kageyama, Y. Tagawa, R. Shigemoto, S. Nakanishi, Genes and Development 6 (1992) 2620–2634.","mla":"Sasai, Yoshiki, et al. “Two Mammalian Helix-Loop-Helix Factors Structurally Related to Drosophila Hairy and Enhancer of Split.” <i>Genes and Development</i>, vol. 6, no. 12 B, Cold Spring Harbor Laboratory Press, 1992, pp. 2620–34, doi:<a href=\"https://doi.org/10.1101/gad.6.12b.2620\">10.1101/gad.6.12b.2620</a>.","ama":"Sasai Y, Kageyama R, Tagawa Y, Shigemoto R, Nakanishi S. Two mammalian helix-loop-helix factors structurally related to Drosophila hairy and Enhancer of split. <i>Genes and Development</i>. 1992;6(12 B):2620-2634. doi:<a href=\"https://doi.org/10.1101/gad.6.12b.2620\">10.1101/gad.6.12b.2620</a>","apa":"Sasai, Y., Kageyama, R., Tagawa, Y., Shigemoto, R., &#38; Nakanishi, S. (1992). Two mammalian helix-loop-helix factors structurally related to Drosophila hairy and Enhancer of split. <i>Genes and Development</i>. Cold Spring Harbor Laboratory Press. <a href=\"https://doi.org/10.1101/gad.6.12b.2620\">https://doi.org/10.1101/gad.6.12b.2620</a>","ieee":"Y. Sasai, R. Kageyama, Y. Tagawa, R. Shigemoto, and S. Nakanishi, “Two mammalian helix-loop-helix factors structurally related to Drosophila hairy and Enhancer of split,” <i>Genes and Development</i>, vol. 6, no. 12 B. Cold Spring Harbor Laboratory Press, pp. 2620–2634, 1992.","chicago":"Sasai, Yoshiki, Ryoichiro Kageyama, Yoshiaki Tagawa, Ryuichi Shigemoto, and Shigetada Nakanishi. “Two Mammalian Helix-Loop-Helix Factors Structurally Related to Drosophila Hairy and Enhancer of Split.” <i>Genes and Development</i>. Cold Spring Harbor Laboratory Press, 1992. <a href=\"https://doi.org/10.1101/gad.6.12b.2620\">https://doi.org/10.1101/gad.6.12b.2620</a>."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":6,"page":"2620 - 2634","year":"1992","_id":"2535","extern":"1","abstract":[{"lang":"eng","text":"We report the molecular characterization of two novel rat helix-loop-helix (HLH) proteins, designated HES-1 and HES-3, that show structural homology to the Drosophila hairy and Enhancer of split [E(spl)] proteins, both of which are required for normal neurogenesis. HES-1 mRNA, expressed in various tissues of both embryos and adults, is present at a high level in the epithelial cells, including the embryonal neuroepithelial cells, as well as in the mesoderm-derived tissues such as the embryonal muscle. In contrast, HES-3 mRNA is produced exclusively in cerebellar Purkinje cells. HES-1 represses transcription by binding to the N box, which is a recognition sequence of E(spl) proteins. Interestingly, neither HES-1 nor HES-3 alone interacts efficiently with the E box, but each protein decreases the transcription induced by E-box-binding HLH activators such as E47. Furthermore, HES-1 also inhibits the functions of MyoD and MASH1 and effectively diminishes the myogenic conversion of C3H10T1/2 cells induced by MyoD. These results suggest that HES-1 may play an important role in mammalian development by negatively acting on the two different sequences while HES-3 acts as a repressor in a specific type of neurons."}],"publisher":"Cold Spring Harbor Laboratory Press","publication":"Genes and Development","title":"Two mammalian helix-loop-helix factors structurally related to Drosophila hairy and Enhancer of split","publist_id":"4364","date_created":"2018-12-11T11:58:15Z","oa_version":"Published Version"},{"article_type":"original","issue":"1-2","status":"public","publication_identifier":{"issn":["0001-5954"]},"citation":{"ieee":"L. Erdös, “On some problems of P. Turán concerning power sums of complex numbers,” <i>Acta Mathematica Hungarica</i>, vol. 59, no. 1–2. Springer, pp. 11–24, 1992.","chicago":"Erdös, László. “On Some Problems of P. Turán Concerning Power Sums of Complex Numbers.” <i>Acta Mathematica Hungarica</i>. Springer, 1992. <a href=\"https://doi.org/10.1007/BF00052086\">https://doi.org/10.1007/BF00052086</a>.","apa":"Erdös, L. (1992). On some problems of P. Turán concerning power sums of complex numbers. <i>Acta Mathematica Hungarica</i>. Springer. <a href=\"https://doi.org/10.1007/BF00052086\">https://doi.org/10.1007/BF00052086</a>","ama":"Erdös L. On some problems of P. Turán concerning power sums of complex numbers. <i>Acta Mathematica Hungarica</i>. 1992;59(1-2):11-24. doi:<a href=\"https://doi.org/10.1007/BF00052086\">10.1007/BF00052086</a>","short":"L. Erdös, Acta Mathematica Hungarica 59 (1992) 11–24.","ista":"Erdös L. 1992. On some problems of P. Turán concerning power sums of complex numbers. Acta Mathematica Hungarica. 59(1–2), 11–24.","mla":"Erdös, László. “On Some Problems of P. Turán Concerning Power Sums of Complex Numbers.” <i>Acta Mathematica Hungarica</i>, vol. 59, no. 1–2, Springer, 1992, pp. 11–24, doi:<a href=\"https://doi.org/10.1007/BF00052086\">10.1007/BF00052086</a>."},"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"11 - 24","volume":59,"year":"1992","_id":"2714","extern":"1","publisher":"Springer","title":"On some problems of P. Turán concerning power sums of complex numbers","publication":"Acta Mathematica Hungarica","publist_id":"4182","oa_version":"None","date_created":"2018-12-11T11:59:13Z","day":"01","language":[{"iso":"eng"}],"month":"03","publication_status":"published","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF00052086"}],"intvolume":"        59","date_updated":"2022-03-16T15:33:08Z","doi":"10.1007/BF00052086","article_processing_charge":"No","author":[{"first_name":"László","orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"}],"date_published":"1992-03-01T00:00:00Z","quality_controlled":"1","scopus_import":"1"},{"publisher":"Springer","title":"Central limit theorems for the one-dimensional Rayleigh gas with semipermeable barriers","publication":"Communications in Mathematical Physics","publist_id":"4170","oa_version":"Published Version","date_created":"2018-12-11T11:59:15Z","extern":"1","abstract":[{"lang":"eng","text":"A version of the one-dimensional Rayleigh gas is considered: a point particle of mass M (molecule), confined to the unit interval [0,1], is surrounded by an infinite ideal gas of point particles of mass 1 (atoms). The molecule interacts with the atoms and with the walls via elastic collision. Central limit theorems are proved for a wide class of additive functionals of this system (e.g. the number of collisions with the walls and the total length of the molecular path)."}],"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"451 - 466","volume":143,"year":"1992","_id":"2722","article_type":"original","issue":"3","acknowledgement":"The authors are very grateful to D. Szasz and A. Kramli for valuable discussions and their encouragement. We are also indebted to D. Dϋrr for his comments and suggestions.\r\n","status":"public","oa":1,"publication_identifier":{"issn":["0010-3616"]},"citation":{"chicago":"Erdös, László, and Dao Tuyen. “Central Limit Theorems for the One-Dimensional Rayleigh Gas with Semipermeable Barriers.” <i>Communications in Mathematical Physics</i>. Springer, 1992. <a href=\"https://doi.org/10.1007/BF02099260\">https://doi.org/10.1007/BF02099260</a>.","ieee":"L. Erdös and D. Tuyen, “Central limit theorems for the one-dimensional Rayleigh gas with semipermeable barriers,” <i>Communications in Mathematical Physics</i>, vol. 143, no. 3. Springer, pp. 451–466, 1992.","apa":"Erdös, L., &#38; Tuyen, D. (1992). Central limit theorems for the one-dimensional Rayleigh gas with semipermeable barriers. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/BF02099260\">https://doi.org/10.1007/BF02099260</a>","ama":"Erdös L, Tuyen D. Central limit theorems for the one-dimensional Rayleigh gas with semipermeable barriers. <i>Communications in Mathematical Physics</i>. 1992;143(3):451-466. doi:<a href=\"https://doi.org/10.1007/BF02099260\">10.1007/BF02099260</a>","mla":"Erdös, László, and Dao Tuyen. “Central Limit Theorems for the One-Dimensional Rayleigh Gas with Semipermeable Barriers.” <i>Communications in Mathematical Physics</i>, vol. 143, no. 3, Springer, 1992, pp. 451–66, doi:<a href=\"https://doi.org/10.1007/BF02099260\">10.1007/BF02099260</a>.","short":"L. Erdös, D. Tuyen, Communications in Mathematical Physics 143 (1992) 451–466.","ista":"Erdös L, Tuyen D. 1992. Central limit theorems for the one-dimensional Rayleigh gas with semipermeable barriers. Communications in Mathematical Physics. 143(3), 451–466."},"date_updated":"2022-03-16T14:24:12Z","doi":"10.1007/BF02099260","article_processing_charge":"No","date_published":"1992-01-01T00:00:00Z","author":[{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","orcid":"0000-0001-5366-9603"},{"first_name":"Dao","last_name":"Tuyen","full_name":"Tuyen, Dao"}],"quality_controlled":"1","scopus_import":"1","publication_status":"published","main_file_link":[{"url":"https://projecteuclid.org/journals/communications-in-mathematical-physics/volume-143/issue-3/Central-limit-theorems-for-the-one-dimensional-Rayleigh-gas-with/cmp/1104249076.full","open_access":"1"}],"intvolume":"       143","day":"01","language":[{"iso":"eng"}],"month":"01"},{"language":[{"iso":"eng"}],"month":"10","day":"10","pmid":1,"publication_status":"published","main_file_link":[{"url":"https://europepmc.org/article/med/1457592"}],"intvolume":"        57","quality_controlled":"1","date_updated":"2022-03-21T10:47:19Z","article_processing_charge":"No","date_published":"1992-10-10T00:00:00Z","author":[{"first_name":"Leonid A","orcid":"0000-0002-0977-7989","last_name":"Sazanov","full_name":"Sazanov, Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zaǐtsev, Sergei","first_name":"Sergei","last_name":"Zaǐtsev"}],"publication_identifier":{"issn":["0006-2979"]},"citation":{"apa":"Sazanov, L. A., &#38; Zaǐtsev, S. (1992). Effect of superlow doses (10(-18)-10-(-14) M) of biologically active substances: general rules, features, and possible mechanisms. <i>Biochemistry (Moscow)</i>. Izdatel’stvo Nauka.","chicago":"Sazanov, Leonid A, and Sergei Zaǐtsev. “Effect of Superlow Doses (10(-18)-10-(-14) M) of Biologically Active Substances: General Rules, Features, and Possible Mechanisms.” <i>Biochemistry (Moscow)</i>. Izdatel’stvo Nauka, 1992.","ieee":"L. A. Sazanov and S. Zaǐtsev, “Effect of superlow doses (10(-18)-10-(-14) M) of biologically active substances: general rules, features, and possible mechanisms,” <i>Biochemistry (Moscow)</i>, vol. 57, no. 10. Izdatel’stvo Nauka, pp. 1443–1460, 1992.","mla":"Sazanov, Leonid A., and Sergei Zaǐtsev. “Effect of Superlow Doses (10(-18)-10-(-14) M) of Biologically Active Substances: General Rules, Features, and Possible Mechanisms.” <i>Biochemistry (Moscow)</i>, vol. 57, no. 10, Izdatel’stvo Nauka, 1992, pp. 1443–60.","short":"L.A. Sazanov, S. Zaǐtsev, Biochemistry (Moscow) 57 (1992) 1443–1460.","ista":"Sazanov LA, Zaǐtsev S. 1992. Effect of superlow doses (10(-18)-10-(-14) M) of biologically active substances: general rules, features, and possible mechanisms. Biochemistry (Moscow). 57(10), 1443–1460.","ama":"Sazanov LA, Zaǐtsev S. Effect of superlow doses (10(-18)-10-(-14) M) of biologically active substances: general rules, features, and possible mechanisms. <i>Biochemistry (Moscow)</i>. 1992;57(10):1443-1460."},"external_id":{"pmid":["1457592 "]},"article_type":"original","issue":"10","status":"public","year":"1992","_id":"1945","type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"1443 - 1460","volume":57,"extern":"1","abstract":[{"text":"The effects of ultra-low (10(-18)-10(-14) M) doses (ULD) of biologically active substances have been reviewed in terms of common regularities of ULD effects and peculiarities of action of various groups of compounds. The most common and at the same time paradoxical regularities of ULD action are bi- or polymodal patterns of dose dependence, absence or presence of an inverse effect at higher doses, and instability of ULD effect. Possible mechanisms of ULD action including the mechanism based on the adaptation theory are discussed.","lang":"eng"}],"publist_id":"5138","oa_version":"None","date_created":"2018-12-11T11:54:51Z","publisher":"Izdatel'stvo Nauka","title":"Effect of superlow doses (10(-18)-10-(-14) M) of biologically active substances: general rules, features, and possible mechanisms","publication":"Biochemistry (Moscow)"},{"type":"conference","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"74 - 106","volume":600,"year":"1992","_id":"4593","status":"public","citation":{"ista":"Alur R, Henzinger TA. 1992. Logics and models of real time: A survey. REX Workshop on Real Time: Theory in Practice. Workshop/School/Symposium of the REX Project, LNCS, vol. 600, 74–106.","mla":"Alur, Rajeev, and Thomas A. Henzinger. “Logics and Models of Real Time: A Survey.” <i>REX Workshop on Real Time: Theory in Practice</i>, vol. 600, Springer, 1992, pp. 74–106, doi:<a href=\"https://doi.org/10.1007/BFb0031984\">10.1007/BFb0031984</a>.","short":"R. Alur, T.A. Henzinger, in:, REX Workshop on Real Time: Theory in Practice, Springer, 1992, pp. 74–106.","ama":"Alur R, Henzinger TA. Logics and models of real time: A survey. In: <i>REX Workshop on Real Time: Theory in Practice</i>. Vol 600. Springer; 1992:74-106. doi:<a href=\"https://doi.org/10.1007/BFb0031984\">10.1007/BFb0031984</a>","apa":"Alur, R., &#38; Henzinger, T. A. (1992). Logics and models of real time: A survey. In <i>REX Workshop on Real Time: Theory in Practice</i> (Vol. 600, pp. 74–106). Mook, The Netherlands: Springer. <a href=\"https://doi.org/10.1007/BFb0031984\">https://doi.org/10.1007/BFb0031984</a>","ieee":"R. Alur and T. A. Henzinger, “Logics and models of real time: A survey,” in <i>REX Workshop on Real Time: Theory in Practice</i>, Mook, The Netherlands, 1992, vol. 600, pp. 74–106.","chicago":"Alur, Rajeev, and Thomas A Henzinger. “Logics and Models of Real Time: A Survey.” In <i>REX Workshop on Real Time: Theory in Practice</i>, 600:74–106. Springer, 1992. <a href=\"https://doi.org/10.1007/BFb0031984\">https://doi.org/10.1007/BFb0031984</a>."},"publisher":"Springer","title":"Logics and models of real time: A survey","publication":"REX Workshop on Real Time: Theory in Practice","publist_id":"114","oa_version":"None","date_created":"2018-12-11T12:09:39Z","extern":"1","abstract":[{"lang":"eng","text":"We survey logic-based and automata-based languages and techniques for the specification and verification of real-time systems. In particular, we discuss three syntactic extensions of temporal logic: time-bounded operators, freeze quantification, and time variables. We also discuss the extension of finite-state machines with clocks and the extension of transition systems with time bounds on the transitions. All of the resulting notations can be interpreted over a variety of different models of time and computation, including linear and branching time, interleaving and true concurrency, discrete and continuous time. For each choice of syntax and semantics, we summarize the results that are known about expressive power, algorithmic finite-state verification, and deductive verification."}],"publication_status":"published","intvolume":"       600","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/BFb0031988#enumeration"}],"day":"01","language":[{"iso":"eng"}],"month":"01","conference":{"location":"Mook, The Netherlands","start_date":"1991-06-03","name":"Workshop/School/Symposium of the REX Project","end_date":"1991-06-07"},"date_updated":"2022-03-07T10:20:06Z","alternative_title":["LNCS"],"doi":"10.1007/BFb0031984","article_processing_charge":"No","date_published":"1992-01-01T00:00:00Z","author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"quality_controlled":"1","scopus_import":"1"},{"citation":{"ama":"Alur R, Henzinger TA. Back to the future: Towards a theory of timed regular languages. In: <i>Proceedings of the 33rd Annual Symposium on Foundations of Computer Science</i>. IEEE; 1992:177-186. doi:<a href=\"https://doi.org/10.1109/SFCS.1992.267774\">10.1109/SFCS.1992.267774</a>","ista":"Alur R, Henzinger TA. 1992. Back to the future: Towards a theory of timed regular languages. Proceedings of the 33rd Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 177–186.","short":"R. Alur, T.A. Henzinger, in:, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992, pp. 177–186.","mla":"Alur, Rajeev, and Thomas A. Henzinger. “Back to the Future: Towards a Theory of Timed Regular Languages.” <i>Proceedings of the 33rd Annual Symposium on Foundations of Computer Science</i>, IEEE, 1992, pp. 177–86, doi:<a href=\"https://doi.org/10.1109/SFCS.1992.267774\">10.1109/SFCS.1992.267774</a>.","chicago":"Alur, Rajeev, and Thomas A Henzinger. “Back to the Future: Towards a Theory of Timed Regular Languages.” In <i>Proceedings of the 33rd Annual Symposium on Foundations of Computer Science</i>, 177–86. IEEE, 1992. <a href=\"https://doi.org/10.1109/SFCS.1992.267774\">https://doi.org/10.1109/SFCS.1992.267774</a>.","ieee":"R. Alur and T. A. Henzinger, “Back to the future: Towards a theory of timed regular languages,” in <i>Proceedings of the 33rd Annual Symposium on Foundations of Computer Science</i>, Pittsburgh, PA, United States of America, 1992, pp. 177–186.","apa":"Alur, R., &#38; Henzinger, T. A. (1992). Back to the future: Towards a theory of timed regular languages. In <i>Proceedings of the 33rd Annual Symposium on Foundations of Computer Science</i> (pp. 177–186). Pittsburgh, PA, United States of America: IEEE. <a href=\"https://doi.org/10.1109/SFCS.1992.267774\">https://doi.org/10.1109/SFCS.1992.267774</a>"},"month":"01","language":[{"iso":"eng"}],"status":"public","day":"01","_id":"4594","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/267774"}],"year":"1992","publication_status":"published","page":"177 - 186","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","abstract":[{"text":"The authors introduce two-way timed automata-timed automata that can move back and forth while reading a timed word. Two-wayness in its unrestricted form leads, like nondeterminism, to the undecidability of language inclusion. However, if they restrict the number of times an input symbol may be revisited, then two-wayness is both harmless and desirable. The authors show that the resulting class of bounded two-way deterministic timed automata is closed under all boolean operations, has decidable (PSPACE-complete) emptiness and inclusion problems, and subsumes all decidable real-time logics we know. They obtain a strict hierarchy of real-time properties: deterministic timed automata can accept more languages as the bound on the number of times an input symbol may be revisited is increased. This hierarchy is also enforced by the number of alternations between past and future operators in temporal logic. The combination of the results leads to a decision procedure for a real-time logic with past operators\r\n","lang":"eng"}],"scopus_import":"1","extern":"1","quality_controlled":"1","author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"date_published":"1992-01-01T00:00:00Z","article_processing_charge":"No","date_updated":"2022-03-07T10:45:34Z","doi":"10.1109/SFCS.1992.267774","date_created":"2018-12-11T12:09:39Z","conference":{"location":"Pittsburgh, PA, United States of America","start_date":"1992-10-24","name":"FOCS: Foundations of Computer Science","end_date":"1992-10-27"},"oa_version":"None","publist_id":"115","publication":"Proceedings of the 33rd Annual Symposium on Foundations of Computer Science","title":"Back to the future: Towards a theory of timed regular languages","publisher":"IEEE"},{"publisher":"American Association for the Advancement of Science","publication":"Science","title":"Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells.","publist_id":"2918","date_created":"2018-12-11T12:03:30Z","oa_version":"None","extern":"1","abstract":[{"lang":"eng","text":"Glutamate-operated ion channels (GluR channels) of the L-alpha-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid (AMPA)-kainate subtype are found in both neurons and glial cells of the central nervous system. These channels are assembled from the GluR-A, -B, -C, and -D subunits; channels containing a GluR-B subunit show an outwardly rectifying current-voltage relation and low calcium permeability, whereas channels lacking the GluR-B subunit are characterized by a doubly rectifying current-voltage relation and high calcium permeability. Most cell types in the central nervous system coexpress several subunits, including GluR-B. However, Bergmann glia in rat cerebellum do not express GluR-B subunit genes. In a subset of cultured cerebellar glial cells, likely derived from Bergmann glial cells. GluR channels exhibit doubly rectifying current-voltage relations and high calcium permeability, whereas GluR channels of cerebellar neurons have low calcium permeability. Thus, differential expression of the GluR-B subunit gene in neurons and glia is one mechanism by which functional properties of native GluR channels are regulated."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":256,"page":"1566 - 1570","year":"1992","_id":"3469","issue":"5063","article_type":"original","external_id":{"pmid":["1317970"]},"status":"public","publication_identifier":{"issn":["0036-8075"]},"citation":{"ama":"Burnashev N, Khodorova A, Jonas PM, et al. Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells. <i>Science</i>. 1992;256(5063):1566-1570. doi:<a href=\"https://doi.org/10.1126/science.1317970\">10.1126/science.1317970</a>","ista":"Burnashev N, Khodorova A, Jonas PM, Helm P, Wisden W, Monyer H, Seeburg P, Sakmann B. 1992. Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells. Science. 256(5063), 1566–1570.","short":"N. Burnashev, A. Khodorova, P.M. Jonas, P. Helm, W. Wisden, H. Monyer, P. Seeburg, B. Sakmann, Science 256 (1992) 1566–1570.","mla":"Burnashev, Nail, et al. “Calcium-Permeable AMPA-Kainate Receptors in Fusiform Cerebellar Glial Cells.” <i>Science</i>, vol. 256, no. 5063, American Association for the Advancement of Science, 1992, pp. 1566–70, doi:<a href=\"https://doi.org/10.1126/science.1317970\">10.1126/science.1317970</a>.","chicago":"Burnashev, Nail, Alla Khodorova, Peter M Jonas, P. Helm, William Wisden, Hannah Monyer, Peter Seeburg, and Bert Sakmann. “Calcium-Permeable AMPA-Kainate Receptors in Fusiform Cerebellar Glial Cells.” <i>Science</i>. American Association for the Advancement of Science, 1992. <a href=\"https://doi.org/10.1126/science.1317970\">https://doi.org/10.1126/science.1317970</a>.","ieee":"N. Burnashev <i>et al.</i>, “Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells.,” <i>Science</i>, vol. 256, no. 5063. American Association for the Advancement of Science, pp. 1566–1570, 1992.","apa":"Burnashev, N., Khodorova, A., Jonas, P. M., Helm, P., Wisden, W., Monyer, H., … Sakmann, B. (1992). Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1317970\">https://doi.org/10.1126/science.1317970</a>"},"article_processing_charge":"No","date_updated":"2022-03-16T13:24:52Z","doi":"10.1126/science.1317970","date_published":"1992-06-12T00:00:00Z","author":[{"full_name":"Burnashev, Nail","last_name":"Burnashev","first_name":"Nail"},{"first_name":"Alla","last_name":"Khodorova","full_name":"Khodorova, Alla"},{"first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Helm, P.","first_name":"P.","last_name":"Helm"},{"first_name":"William","last_name":"Wisden","full_name":"Wisden, William"},{"full_name":"Monyer, Hannah","last_name":"Monyer","first_name":"Hannah"},{"last_name":"Seeburg","first_name":"Peter","full_name":"Seeburg, Peter"},{"last_name":"Sakmann","first_name":"Bert","full_name":"Sakmann, Bert"}],"quality_controlled":"1","scopus_import":"1","publication_status":"published","main_file_link":[{"url":"https://www.science.org/doi/10.1126/science.1317970"}],"intvolume":"       256","day":"12","pmid":1,"month":"06","language":[{"iso":"eng"}]},{"status":"public","oa":1,"acknowledgement":"We thank Dr D. Colquhoun, Dr J. P. Ruppersberg and Dr T. A. Verdoorn for critically reading the manuscript, K. Bauer, C. Busch and F. Helmchen for computer programming, and M. Kaiser for technical assistance. \r\n","article_type":"original","external_id":{"pmid":["1282929 "]},"citation":{"ama":"Jonas PM, Sakmann B. Glutamate receptor channels in isolated patches from CA1 and CA3 pyramidal cells of rat hippocampal slices. <i>Journal of Physiology</i>. 1992;455:143-171. doi:<a href=\"https://doi.org/10.1113/jphysiol.1992.sp019294 \">10.1113/jphysiol.1992.sp019294 </a>","mla":"Jonas, Peter M., and Bert Sakmann. “Glutamate Receptor Channels in Isolated Patches from CA1 and CA3 Pyramidal Cells of Rat Hippocampal Slices.” <i>Journal of Physiology</i>, vol. 455, Wiley-Blackwell, 1992, pp. 143–71, doi:<a href=\"https://doi.org/10.1113/jphysiol.1992.sp019294 \">10.1113/jphysiol.1992.sp019294 </a>.","short":"P.M. Jonas, B. Sakmann, Journal of Physiology 455 (1992) 143–171.","ista":"Jonas PM, Sakmann B. 1992. Glutamate receptor channels in isolated patches from CA1 and CA3 pyramidal cells of rat hippocampal slices. Journal of Physiology. 455, 143–171.","chicago":"Jonas, Peter M, and Bert Sakmann. “Glutamate Receptor Channels in Isolated Patches from CA1 and CA3 Pyramidal Cells of Rat Hippocampal Slices.” <i>Journal of Physiology</i>. Wiley-Blackwell, 1992. <a href=\"https://doi.org/10.1113/jphysiol.1992.sp019294 \">https://doi.org/10.1113/jphysiol.1992.sp019294 </a>.","ieee":"P. M. Jonas and B. Sakmann, “Glutamate receptor channels in isolated patches from CA1 and CA3 pyramidal cells of rat hippocampal slices,” <i>Journal of Physiology</i>, vol. 455. Wiley-Blackwell, pp. 143–171, 1992.","apa":"Jonas, P. M., &#38; Sakmann, B. (1992). Glutamate receptor channels in isolated patches from CA1 and CA3 pyramidal cells of rat hippocampal slices. <i>Journal of Physiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1113/jphysiol.1992.sp019294 \">https://doi.org/10.1113/jphysiol.1992.sp019294 </a>"},"publication_identifier":{"issn":["0022-3751"]},"page":"143 - 171","volume":455,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"3470","year":"1992","abstract":[{"lang":"eng","text":"Currents activated by glutamate receptor (GluR) agonists were recorded from outside-out patches isolated from the soma of visually identified pyramidal neurones of the (CA3 and CA1 region of rat hippocampal slices. α-Amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid (AMPA). L-glutamate (L-Glu), and kainate (KA) were delivered either by bath application through perfusion of the recording chamber or by rapid application via a piezo-driven two-barrelled fast application system. 2. Bath application of each of the three agonists activated inward currents in all patches (n = 134) at holding potentials of -50 or -60 mV. The current amplitude increased in size between 3 to 30 μM-AMPA and 100 μM to 1 mM-KA. With this slow mode of bath application, the responses showed no apparent desensitization even at saturating concentrations of AMPA (30 μM) and KA (1 mM). 3. The ratio of currents activated by 30 μM-AMPA and 300 μM-KA showed a characteristic difference between CA3 and CA1 neurones. The ratio was 0.242 ± 0.028 (mean ± S.E.M., n = 16) for CA3 cell patches and 0.097 ± 0.012 (n = 8) for CA1 cell patches indicating that GluRs in the two cell populations are different. 4. The steady-state current-voltage relations (I-Vs) for AMPA- and KA-activated currents showed pronounced outward rectification for both cell types (when the main cations are Na+ in the bath and Cs+ in the pipette solution). The current reversed close to 0 mV and the ratio of chord conductances 80 mV on either side of the reversal potential was 2.66 for KA-activated currents in CA3 cell patches and 2.60 in CA1 cell patches. AMPA-activated currents showed a time-dependent increase after steps to positive membrane potentials and a decrease after steps to negative voltages, indicating that a gating process is responsible for outward rectification of the steady-state I-IV. 5. The permeability (P) of GluR channels was high for Na+ as compared to Cs+ for both cell types (P(Na)/P(Cs) = 0.88 and 0.84). The permeability was low for N-methyl-D-glucamine+ (P(NMG)/P(Cs) ≤ 0.03) and Ca2+ (P(Ca)/P(Cs) ≤0.05). 6. The current noise level increased during application of AMPA or KA. Apparent single-channel conductances obtained from fluctuation analysis were higher for AMPA than for KA, but similar for both cell types. In CA3 cell patches, AMPA activated channels with an apparent chord conductance of 7.2 pS, KA of 3.0 pS conductance. 7. Fast agonist application revealed desensitization of GluR channels which was dependent on the type of agonist, currents activated by AMPA and L-Glu rose rapidly to a peak and then desensitized to a steady-state current. In contrast, currents activated by fast application of KA rose to a plateau and did not desensitize. The steady state current expressed as a percentage of the peak current was higher for L-Glu than for AMPA and slightly higher for CA3 than for CA1 cell patches. For CA3 cell patches, this fraction amounted to 6.2 %, with 300 μM-L-Glu and 2.8%, with 300 μM-AMPA. For CA1 cell patches, corresponding values were 3.6 and 1.9 % 8. The dose response relations for the peak current activated by AMPA and L-Glu and the steady-state current activated by KA were similar for CA3 and CA1 cell patches. The order of potency was AMPA &gt; L-Glu ≃ KA for both cell types EC50 values 189, 342 and 344 μM for CA3 cell patches and 183, 424 and 474 μM for CA1 cell patches). In all cases, the Hill coefficients ranged between 12 and 1.7. 8. The rise of AMPA and L-Glu-activated currents became faster with increasing agonist concentration for both cell types. With L-Glu, rise times decreased from about 3 ms at 100 μM to 500 μs at 3 mM. The delay for agonist concentrations ≥ 300 μM was described by the sum of two exponential functions. The time constant of the predominant fast component was slightly concentration dependent and decreased from about 12 ms at 300 μM to 8 ms at 3 mM-L-Glu. 10. The current voltage relations of the peak currents activated by 300 μM-AMPA were linear for both cell types with a reversal potential close to OmV. 11. It is concluded that the GluR channels in pyramidal cells of hippocampal CA3 and CA1 regions are distinet but share many pharmacological and functional properties. Comparison of the properties of native and recombinant GluRs suggests that in both CA3 and CA1 regions GluR channels are hetero-oligomers containing the GluR-B subunit."}],"extern":"1","title":"Glutamate receptor channels in isolated patches from CA1 and CA3 pyramidal cells of rat hippocampal slices","publication":"Journal of Physiology","publisher":"Wiley-Blackwell","oa_version":"Published Version","date_created":"2018-12-11T12:03:30Z","publist_id":"2917","pmid":1,"day":"01","language":[{"iso":"eng"}],"month":"09","main_file_link":[{"url":"https://physoc.onlinelibrary.wiley.com/doi/abs/10.1113/jphysiol.1992.sp019294","open_access":"1"}],"intvolume":"       455","publication_status":"published","author":[{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M"},{"last_name":"Sakmann","first_name":"Bert","full_name":"Sakmann, Bert"}],"date_published":"1992-09-01T00:00:00Z","doi":"10.1113/jphysiol.1992.sp019294 ","date_updated":"2022-03-16T13:01:55Z","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1"},{"publication_status":"published","intvolume":"       458","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1175155/","open_access":"1"}],"language":[{"iso":"eng"}],"month":"12","day":"01","pmid":1,"quality_controlled":"1","scopus_import":"1","date_updated":"2022-03-16T12:41:01Z","doi":"10.1113/jphysiol.1992.sp019417","article_processing_charge":"No","date_published":"1992-12-01T00:00:00Z","author":[{"full_name":"Colquhoun, D.","last_name":"Colquhoun","first_name":"D."},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M"},{"first_name":"Bert","last_name":"Sakmann","full_name":"Sakmann, Bert"}],"year":"1992","_id":"3471","type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"261 - 287","volume":458,"publication_identifier":{"issn":["0022-3751"]},"citation":{"apa":"Colquhoun, D., Jonas, P. M., &#38; Sakmann, B. (1992). Action of brief pulses of glutamate on AMPA/kainate receptors in patches from different neurones of rat hippocampal slices. <i>Journal of Physiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1113/jphysiol.1992.sp019417\">https://doi.org/10.1113/jphysiol.1992.sp019417</a>","ieee":"D. Colquhoun, P. M. Jonas, and B. Sakmann, “Action of brief pulses of glutamate on AMPA/kainate receptors in patches from different neurones of rat hippocampal slices,” <i>Journal of Physiology</i>, vol. 458. Wiley-Blackwell, pp. 261–287, 1992.","chicago":"Colquhoun, D., Peter M Jonas, and Bert Sakmann. “Action of Brief Pulses of Glutamate on AMPA/Kainate Receptors in Patches from Different Neurones of Rat Hippocampal Slices.” <i>Journal of Physiology</i>. Wiley-Blackwell, 1992. <a href=\"https://doi.org/10.1113/jphysiol.1992.sp019417\">https://doi.org/10.1113/jphysiol.1992.sp019417</a>.","mla":"Colquhoun, D., et al. “Action of Brief Pulses of Glutamate on AMPA/Kainate Receptors in Patches from Different Neurones of Rat Hippocampal Slices.” <i>Journal of Physiology</i>, vol. 458, Wiley-Blackwell, 1992, pp. 261–87, doi:<a href=\"https://doi.org/10.1113/jphysiol.1992.sp019417\">10.1113/jphysiol.1992.sp019417</a>.","ista":"Colquhoun D, Jonas PM, Sakmann B. 1992. Action of brief pulses of glutamate on AMPA/kainate receptors in patches from different neurones of rat hippocampal slices. Journal of Physiology. 458, 261–287.","short":"D. Colquhoun, P.M. Jonas, B. Sakmann, Journal of Physiology 458 (1992) 261–287.","ama":"Colquhoun D, Jonas PM, Sakmann B. Action of brief pulses of glutamate on AMPA/kainate receptors in patches from different neurones of rat hippocampal slices. <i>Journal of Physiology</i>. 1992;458:261-287. doi:<a href=\"https://doi.org/10.1113/jphysiol.1992.sp019417\">10.1113/jphysiol.1992.sp019417</a>"},"external_id":{"pmid":["1338788"]},"article_type":"original","acknowledgement":"We thank Drs N.Burnashev, P. Ruppersberg , and G.Stuart for critically reading the manuscript, and Marlies Kaiser for technical assistance. D.C.is a recipient of a Humboldt prize. ","status":"public","oa":1,"publist_id":"2916","oa_version":"Published Version","date_created":"2018-12-11T12:03:30Z","publisher":"Wiley-Blackwell","title":"Action of brief pulses of glutamate on AMPA/kainate receptors in patches from different neurones of rat hippocampal slices","publication":"Journal of Physiology","extern":"1","abstract":[{"lang":"eng","text":"1. Outside-out patches were isolated from granule cells of dentate gyrus and pyramidal cells of CA3 and CA1 regions of rat hippocampal slices. Patches were exposed briefly to L-glutamate using a piezo-driven double-barrelled application pipette. 2. Applications of glutamate (1 mM) of 1 ms duration activated patch currents which rose and decayed rapidly. The 20-80% rise time of these glutamate receptor (GluR)-mediated currents was usually 0.2-0.6 ms. At -50 mV the peak current varied from 10 to 500 pA in different patches. 3. The peak current-voltage relation for brief pulses of 1 mM glutamate was virtually linear in normal extracellular solution for patches from the three cell types (-100 to 60 mV). 4. The permeability of GluR channels activated at the peak to Ca2+, relative to K+, was less than 0.1 for all three cell types (under bi-ionic conditions with Ca2+ on the extracellular side and K+ on the intracellular side of the membrane). 5. The offset decay time constant of the current following 1 ms pulses of 1 mM glutamate was brief, with mean values of 3.0 +/- 0.8, 2.5 +/- 0.7, and 2.3 +/- 0.7 ms for dentate, CA3 and CA1 cell patches, respectively. Offset time constants were independent of membrane potential and independent of glutamate concentration (200 microM and 1 mM) for the three cell types. 6. Applications of 1 mM glutamate of 100 ms duration showed that glutamate responses desensitized rapidly. The time constants for desensitization were 9.4 +/- 2.7, 11.3 +/- 2.8, and 9.3 +/- 2.8 ms for patches from dentate, CA3 and CA1 cells respectively. Desensitization time constants were only weakly dependent on glutamate concentration (200 microM and 1 mM) for the three cell types. Thus offset time constants are about four times faster than desensitization time constants for both glutamate concentrations. 7. Double pulse application of glutamate indicated that even a 1 ms pulse of 1 mM glutamate causes partial (about 60%) desensitization of GluR channels. The time course of recovery from desensitization was slower in dentate gyrus granule cell patches than in CA3 or CA1 pyramidal cell patches. 8. Desensitization was studied at equilibrium by exposing patches to low glutamate concentrations for at least 15 s before a 1 ms test pulse of 1 mM glutamate."}]},{"page":"149 - 162","volume":130,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"3472","year":"1992","status":"public","acknowledgement":"A grant from the Konrad-Adenauer-Stiftung to D.-S.K. is gratefully acknowledged, and this paper constitutes a part of his dissertation. We thank Drs. H. Bostock, B. Neumcke, D. Siemen and Mr. G. Reid for reading the manuscript and Mrs. Elke Schmidt for technical assistance. Financial support was received from the Deutsche Forschungsgemeinschaft (Vol88/13-2).","external_id":{"pmid":["1291683 "]},"article_type":"original","citation":{"ieee":"D. Koh, P. M. Jonas, M. Bräu, and W. Vogel, “A TEA-insensitive flickering potassium channel active around the resting potential in myelinated nerve,” <i>Journal of Membrane Biology</i>, vol. 130. Springer, pp. 149–162, 1992.","chicago":"Koh, Duk, Peter M Jonas, Michael Bräu, and Werner Vogel. “A TEA-Insensitive Flickering Potassium Channel Active around the Resting Potential in Myelinated Nerve.” <i>Journal of Membrane Biology</i>. Springer, 1992. <a href=\"https://doi.org/10.1007/BF00231893\">https://doi.org/10.1007/BF00231893</a>.","apa":"Koh, D., Jonas, P. M., Bräu, M., &#38; Vogel, W. (1992). A TEA-insensitive flickering potassium channel active around the resting potential in myelinated nerve. <i>Journal of Membrane Biology</i>. Springer. <a href=\"https://doi.org/10.1007/BF00231893\">https://doi.org/10.1007/BF00231893</a>","ama":"Koh D, Jonas PM, Bräu M, Vogel W. A TEA-insensitive flickering potassium channel active around the resting potential in myelinated nerve. <i>Journal of Membrane Biology</i>. 1992;130:149-162. doi:<a href=\"https://doi.org/10.1007/BF00231893\">10.1007/BF00231893</a>","short":"D. Koh, P.M. Jonas, M. Bräu, W. Vogel, Journal of Membrane Biology 130 (1992) 149–162.","mla":"Koh, Duk, et al. “A TEA-Insensitive Flickering Potassium Channel Active around the Resting Potential in Myelinated Nerve.” <i>Journal of Membrane Biology</i>, vol. 130, Springer, 1992, pp. 149–62, doi:<a href=\"https://doi.org/10.1007/BF00231893\">10.1007/BF00231893</a>.","ista":"Koh D, Jonas PM, Bräu M, Vogel W. 1992. A TEA-insensitive flickering potassium channel active around the resting potential in myelinated nerve. Journal of Membrane Biology. 130, 149–162."},"publication_identifier":{"issn":["0022-2631"]},"title":"A TEA-insensitive flickering potassium channel active around the resting potential in myelinated nerve","publication":"Journal of Membrane Biology","publisher":"Springer","oa_version":"None","date_created":"2018-12-11T12:03:30Z","publist_id":"2915","abstract":[{"text":"A novel potassium-selective channel which is active at membrane potentials between -100 mV and +40 mV has been identified in peripheral myelinated axons of Xenopus laevis using the patch-clamp technique. At negative potentials with 105 mM-K on both sides of the membrane, the channel at 1 kHz resolution showed a series of brief openings and closings interrupted by longer closings, resulting in a flickery bursting activity. Measurements with resolution up to 10 kHz revealed a single-channel conductance of 49 pS with 105 mM-K and 17 pS with 2.5 mM-K on the outer side of the membrane. The channel was selective for K ions over Na ions (PNa/PK = 0.033). The probability of being within a burst in outside-out patches varied from patch to patch (&gt; 0.2, but often &gt; 0.9), and was independent of membrane potential. Open-time histograms were satisfactorily described with a single exponential (tau o = 0.09 msec), closed times with the sum of three exponentials (tau c = 0.13, 5.9, and 36.6 msec). Sensitivity to external tetraethylammonium was comparatively low (IC50 = 19.0 mM). External Cs ions reduced the apparent unitary conductance for inward currents at Em = -90 mV (IC50 = 1.1 mM). Ba and, more potently, Zn ions lowered not only the apparent single-channel conductance but also open probability. The local anesthetic bupivacaine with high potency reduced probability of being within a burst (IC50 = 165 nM). The flickering K channel is clearly different from the other five types of K channels identified so far in the same preparation. We suggest that this channel may form the molecular basis of the resting potential in vertebrate myelinated axons.","lang":"eng"}],"extern":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF00231893"}],"intvolume":"       130","publication_status":"published","pmid":1,"day":"01","language":[{"iso":"eng"}],"month":"01","date_published":"1992-01-01T00:00:00Z","author":[{"last_name":"Koh","first_name":"Duk","full_name":"Koh, Duk"},{"first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bräu, Michael","last_name":"Bräu","first_name":"Michael"},{"first_name":"Werner","last_name":"Vogel","full_name":"Vogel, Werner"}],"date_updated":"2022-03-16T11:15:02Z","doi":"10.1007/BF00231893","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1"},{"scopus_import":"1","quality_controlled":"1","author":[{"full_name":"Chazelle, Bernard","first_name":"Bernard","last_name":"Chazelle"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"},{"full_name":"Pollack, Richard","last_name":"Pollack","first_name":"Richard"},{"full_name":"Seidel, Raimund","first_name":"Raimund","last_name":"Seidel"},{"first_name":"Micha","last_name":"Sharir","full_name":"Sharir, Micha"},{"full_name":"Snoeyink, Jack","last_name":"Snoeyink","first_name":"Jack"}],"date_published":"1992-06-01T00:00:00Z","doi":"10.1016/0925-7721(92)90009-H","date_updated":"2022-03-16T10:41:58Z","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/092577219290009H?via%3Dihub"}],"intvolume":"         1","publication_status":"published","language":[{"iso":"eng"}],"month":"06","day":"01","oa_version":"Published Version","date_created":"2018-12-11T12:04:04Z","publist_id":"2804","title":"Counting and cutting cycles of lines and rods in space","publication":"Computational Geometry: Theory and Applications","publisher":"Elsevier","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. In this paper we address the problem of estimating how many such cuts arc always sufficient. We also consider a few related algorithmic and combinatorial geometry problems. For example, we demonstrate that n lines in space can be sorted in randomized expected time O(n4’st’), provided that they define no cycle. We also prove an 0(n7’4) upper bound on the number of points in space so that there are n lines with the property that for each point there are at least three noncoplanar lines that contain it. "}],"extern":"1","_id":"3581","year":"1992","page":"305 - 323","volume":1,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"ista":"Chazelle B, Edelsbrunner H, Guibas L, Pollack R, Seidel R, Sharir M, Snoeyink J. 1992. Counting and cutting cycles of lines and rods in space. Computational Geometry: Theory and Applications. 1(6), 305–323.","mla":"Chazelle, Bernard, et al. “Counting and Cutting Cycles of Lines and Rods in Space.” <i>Computational Geometry: Theory and Applications</i>, vol. 1, no. 6, Elsevier, 1992, pp. 305–23, doi:<a href=\"https://doi.org/10.1016/0925-7721(92)90009-H\">10.1016/0925-7721(92)90009-H</a>.","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, Computational Geometry: Theory and Applications 1 (1992) 305–323.","ama":"Chazelle B, Edelsbrunner H, Guibas L, et al. Counting and cutting cycles of lines and rods in space. <i>Computational Geometry: Theory and Applications</i>. 1992;1(6):305-323. doi:<a href=\"https://doi.org/10.1016/0925-7721(92)90009-H\">10.1016/0925-7721(92)90009-H</a>","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., Pollack, R., Seidel, R., Sharir, M., &#38; Snoeyink, J. (1992). Counting and cutting cycles of lines and rods in space. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/0925-7721(92)90009-H\">https://doi.org/10.1016/0925-7721(92)90009-H</a>","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.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 1992. <a href=\"https://doi.org/10.1016/0925-7721(92)90009-H\">https://doi.org/10.1016/0925-7721(92)90009-H</a>.","ieee":"B. Chazelle <i>et al.</i>, “Counting and cutting cycles of lines and rods in space,” <i>Computational Geometry: Theory and Applications</i>, vol. 1, no. 6. Elsevier, pp. 305–323, 1992."},"publication_identifier":{"issn":["0925-7721"]},"acknowledgement":"* Bernard Chazelle wishes to acknowledge the National Science Foundation for supporting this research in part under Grant CCR-9002352. Herbert Edelsbrunner acknowledges the support of the National Science Foundation under grants CCR-8714565 and CCR-8921421. Richard Pollack was supported in part by NSF grant CCR-8901484, NSA grant MDA904-89-H-2030, and DIMACS, a Science and Technology Center under NSF grant STC88-09648. Raimund Seidel acknowledges support by NSF grant CCR-8809040. Mich Sharir was partially supported by the Office of Naval\r\nResearch under Grant N00014-87-K-0129, by the National Science Foundation under Grant CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation and the Fund for Basic Research administered by the Israeli Academy of Sciences.","oa":1,"status":"public","article_type":"original","issue":"6"},{"date_created":"2018-12-11T12:04:24Z","oa_version":"None","publist_id":"2738","publication":"Evolution","title":"Variation in mating call across the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata","publisher":"Wiley-Blackwell","abstract":[{"lang":"eng","text":"Three components of mating call (pulse duration, cycle length, and fundamental frequency) were measured and six diagnostic enzyme loci scored across the hybrid zone between the toads Bombina bombina and B. variegata. All three call components differ significantly, but only cycle length is diagnostic. The clines in call coincide with those for enzymes, and have similar widths. This suggests that there is no strong selection on any of these characters. There are significant correlations between electrophoretic markers and call components, but these are no stronger than would be expected if the electrophoretic loci and the genes causing mating call were neutral. The selection differential on the call is no greater than 6% of the difference in mean cycle length between the two taxa. There is a substantial increase in the variance of cycle length in the center of the zone, suggesting that a small number of loci are involved (≈ three). Recombination between these loci will hinder the evolution of reinforcement and may partly be responsible for the lack of premating isolation between B. bombina and B. variegata."}],"extern":"1","_id":"3645","year":"1992","volume":46,"page":"595 - 607","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","citation":{"ieee":"N. Sanderson, J. Szymura, and N. H. Barton, “Variation in mating call across the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata,” <i>Evolution</i>, vol. 46, no. 3. Wiley-Blackwell, pp. 595–607, 1992.","chicago":"Sanderson, Neil, Jacek Szymura, and Nicholas H Barton. “Variation in Mating Call across the Hybrid Zone between the Fire-Bellied Toads Bombina Bombina and B. Variegata.” <i>Evolution</i>. Wiley-Blackwell, 1992. <a href=\"https://doi.org/10.1111/j.1558-5646.1992.tb02068.x\">https://doi.org/10.1111/j.1558-5646.1992.tb02068.x</a>.","apa":"Sanderson, N., Szymura, J., &#38; Barton, N. H. (1992). Variation in mating call across the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata. <i>Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.1992.tb02068.x\">https://doi.org/10.1111/j.1558-5646.1992.tb02068.x</a>","ama":"Sanderson N, Szymura J, Barton NH. Variation in mating call across the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata. <i>Evolution</i>. 1992;46(3):595-607. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1992.tb02068.x\">10.1111/j.1558-5646.1992.tb02068.x</a>","short":"N. Sanderson, J. Szymura, N.H. Barton, Evolution 46 (1992) 595–607.","mla":"Sanderson, Neil, et al. “Variation in Mating Call across the Hybrid Zone between the Fire-Bellied Toads Bombina Bombina and B. Variegata.” <i>Evolution</i>, vol. 46, no. 3, Wiley-Blackwell, 1992, pp. 595–607, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1992.tb02068.x\">10.1111/j.1558-5646.1992.tb02068.x</a>.","ista":"Sanderson N, Szymura J, Barton NH. 1992. Variation in mating call across the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata. Evolution. 46(3), 595–607."},"publication_identifier":{"issn":["0014-3820"]},"status":"public","acknowledgement":"Thanks are due to Drs. A. Leibowitz and P. Mason for help in the field. N.S. would like to thank Drs. K. Ibrahim and R. Nich-ols for discussions, and the Szymura family for their hospitality on his visits to Poland. Dr. R. Butlin provided the program to fit tanh curves to dines. The referees, Prof. A. J. Cain, Ms. L. Humpage and Dr. J. S. Jones made helpful remarks on earlier drafts of the manuscript. Ms. L. Ringrose translated articles from German. N.S. was supported by a NERC studentship, a NERC fellowship and the DHSS, J.S. was supported by the Polish Academy of Sciences (project MRII/ 6), and N.B. by grants from NERC (GR3/ 8002) and SERC (GR/E/08507). ","issue":"3","external_id":{"pmid":["28568664"]},"article_type":"original","quality_controlled":"1","author":[{"full_name":"Sanderson, Neil","last_name":"Sanderson","first_name":"Neil"},{"last_name":"Szymura","first_name":"Jacek","full_name":"Szymura, Jacek"},{"first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"date_published":"1992-01-01T00:00:00Z","article_processing_charge":"No","date_updated":"2022-03-16T09:52:55Z","doi":"10.1111/j.1558-5646.1992.tb02068.x","main_file_link":[{"url":"https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1558-5646.1992.tb02068.x"}],"intvolume":"        46","publication_status":"published","month":"01","language":[{"iso":"eng"}],"pmid":1,"day":"01"},{"quality_controlled":"1","date_published":"1992-07-01T00:00:00Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Tan, Tiow","last_name":"Tan","first_name":"Tiow"},{"first_name":"Roman","last_name":"Waupotitsch","full_name":"Waupotitsch, Roman"}],"doi":"10.1137/0913058","date_updated":"2022-03-16T09:35:05Z","article_processing_charge":"No","main_file_link":[{"url":"https://epubs.siam.org/doi/10.1137/0913058"}],"intvolume":"        13","publication_status":"published","language":[{"iso":"eng"}],"month":"07","day":"01","oa_version":"None","date_created":"2018-12-11T12:06:36Z","publist_id":"2081","title":"An O(n^2 log n) time algorithm for the MinMax angle triangulation","publication":"SIAM Journal on Scientific Computing","publisher":"Society for Industrial and Applied Mathematics ","abstract":[{"text":"It is shown 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). The algorithm is fairly easy to implement and is based on the edge-insertion scheme that iteratively improves an arbitrary initial triangulation. It can be extended to the case where edges are prescribed, and, within the same time- and space-bounds, it can lexicographically minimize the sorted angle vector if the point set is in general position. Experimental results on the efficiency of the algorithm and the quality of the triangulations obtained are included.","lang":"eng"}],"extern":"1","_id":"4043","year":"1992","page":"994 - 1008","volume":13,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"short":"H. Edelsbrunner, T. Tan, R. Waupotitsch, SIAM Journal on Scientific Computing 13 (1992) 994–1008.","mla":"Edelsbrunner, Herbert, et al. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.” <i>SIAM Journal on Scientific Computing</i>, vol. 13, no. 4, Society for Industrial and Applied Mathematics , 1992, pp. 994–1008, doi:<a href=\"https://doi.org/10.1137/0913058\">10.1137/0913058</a>.","ista":"Edelsbrunner H, Tan T, Waupotitsch R. 1992. An O(n^2 log n) time algorithm for the MinMax angle triangulation. SIAM Journal on Scientific Computing. 13(4), 994–1008.","ama":"Edelsbrunner H, Tan T, Waupotitsch R. An O(n^2 log n) time algorithm for the MinMax angle triangulation. <i>SIAM Journal on Scientific Computing</i>. 1992;13(4):994-1008. doi:<a href=\"https://doi.org/10.1137/0913058\">10.1137/0913058</a>","apa":"Edelsbrunner, H., Tan, T., &#38; Waupotitsch, R. (1992). An O(n^2 log n) time algorithm for the MinMax angle triangulation. <i>SIAM Journal on Scientific Computing</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/0913058\">https://doi.org/10.1137/0913058</a>","ieee":"H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2 log n) time algorithm for the MinMax angle triangulation,” <i>SIAM Journal on Scientific Computing</i>, vol. 13, no. 4. Society for Industrial and Applied Mathematics , pp. 994–1008, 1992.","chicago":"Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.” <i>SIAM Journal on Scientific Computing</i>. Society for Industrial and Applied Mathematics , 1992. <a href=\"https://doi.org/10.1137/0913058\">https://doi.org/10.1137/0913058</a>."},"publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"status":"public","article_type":"original","issue":"4"},{"scopus_import":"1","quality_controlled":"1","date_published":"1992-01-01T00:00:00Z","author":[{"last_name":"Chazelle","first_name":"Bernard","full_name":"Chazelle, Bernard"},{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","date_updated":"2022-03-16T08:32:17Z","doi":"10.1145/147508.147511","intvolume":"        39","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/147508.147511"}],"publication_status":"published","month":"01","language":[{"iso":"eng"}],"day":"01","date_created":"2018-12-11T12:06:37Z","oa_version":"None","publist_id":"2078","publication":"Journal of the ACM","title":"An optimal algorithm for intersecting line segments in the plane","publisher":"ACM","abstract":[{"text":"The main contribution of this work is an O(n log n + k)-time algorithm for computing all k intersections among n line segments in the plane. This time complexity is easily shown to be optimal. Within the same asymptotic cost, our algorithm can also construct the subdivision of the plane defined by the segments and compute which segment (if any) lies right above (or below) each intersection and each endpoint. The algorithm has been implemented and performs very well. The storage requirement is on the order of n + k in the worst case, but it is considerably lower in practice. To analyze the complexity of the algorithm, an amortization argument based on a new combinatorial theorem on line arrangements is used.","lang":"eng"}],"extern":"1","_id":"4046","year":"1992","volume":39,"page":"1 - 54","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","citation":{"ieee":"B. Chazelle and H. Edelsbrunner, “An optimal algorithm for intersecting line segments in the plane,” <i>Journal of the ACM</i>, vol. 39, no. 1. ACM, pp. 1–54, 1992.","chicago":"Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.” <i>Journal of the ACM</i>. ACM, 1992. <a href=\"https://doi.org/10.1145/147508.147511\">https://doi.org/10.1145/147508.147511</a>.","apa":"Chazelle, B., &#38; Edelsbrunner, H. (1992). An optimal algorithm for intersecting line segments in the plane. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/147508.147511\">https://doi.org/10.1145/147508.147511</a>","ama":"Chazelle B, Edelsbrunner H. An optimal algorithm for intersecting line segments in the plane. <i>Journal of the ACM</i>. 1992;39(1):1-54. doi:<a href=\"https://doi.org/10.1145/147508.147511\">10.1145/147508.147511</a>","mla":"Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.” <i>Journal of the ACM</i>, vol. 39, no. 1, ACM, 1992, pp. 1–54, doi:<a href=\"https://doi.org/10.1145/147508.147511\">10.1145/147508.147511</a>.","ista":"Chazelle B, Edelsbrunner H. 1992. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM. 39(1), 1–54.","short":"B. Chazelle, H. Edelsbrunner, Journal of the ACM 39 (1992) 1–54."},"publication_identifier":{"eissn":["1557-735X"],"issn":["0004-5411"]},"acknowledgement":"B, Chazelle wishes to acknowledge the National Science Foundation for supporting this research in part under Grant CCR 87-00917. H, Edelsbrunner is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and the NSF under Grant CCR 87-14565. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for\r\nComputing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.","status":"public","issue":"1","article_type":"original"},{"extern":"1","abstract":[{"lang":"eng","text":"Arrangements of curves in the plane are fundamental to many problems in computational and combinatorial geometry (e.g. motion planning, algebraic cell decomposition, etc.). In this paper we study various topological and combinatorial properties of such arrangements under some mild assumptions on the shape of the curves, and develop basic tools for the construction, manipulation, and analysis of these arrangements. Our main results include a generalization of the zone theorem of Edelsbrunner (1986) and Chazelle (1985) to arrangements of curves (in which we show that the combinatorial complexity of the zone of a curve is nearly linear in the number of curves) and an application of that theorem to obtain a nearly quadratic incremental algorithm for the construction of such arrangements."}],"publisher":"Elsevier","title":"Arrangements of curves in the plane - topology, combinatorics, and algorithms","publication":"Theoretical Computer Science","publist_id":"2079","oa_version":"Published Version","date_created":"2018-12-11T12:06:37Z","article_type":"original","issue":"2","acknowledgement":"Work on this paper by the first author has been supported by the National Science Foundation under grant CCR-8714565. Work by the third and sixth authors has been supported by Office of Naval Research Grant NOOOl4-82-K-0381, by National Science Foundation Grant No. NSF-DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation. Work by the sixth author has also been supported by a research grant from the NCRD- the Israeli National Council for Research and Development. Work by the fourth author has been supported by National Science Foundation Grant DMS-8501947. ","status":"public","oa":1,"publication_identifier":{"issn":["0304-3975"]},"citation":{"ama":"Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. Arrangements of curves in the plane - topology, combinatorics, and algorithms. <i>Theoretical Computer Science</i>. 1992;92(2):319-336. doi:<a href=\"https://doi.org/10.1016/0304-3975(92)90319-B\">10.1016/0304-3975(92)90319-B</a>","ista":"Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1992. Arrangements of curves in the plane - topology, combinatorics, and algorithms. Theoretical Computer Science. 92(2), 319–336.","short":"H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, M. Sharir, Theoretical Computer Science 92 (1992) 319–336.","mla":"Edelsbrunner, Herbert, et al. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” <i>Theoretical Computer Science</i>, vol. 92, no. 2, Elsevier, 1992, pp. 319–36, doi:<a href=\"https://doi.org/10.1016/0304-3975(92)90319-B\">10.1016/0304-3975(92)90319-B</a>.","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, János Pach, Richard Pollack, Raimund Seidel, and Micha Sharir. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” <i>Theoretical Computer Science</i>. Elsevier, 1992. <a href=\"https://doi.org/10.1016/0304-3975(92)90319-B\">https://doi.org/10.1016/0304-3975(92)90319-B</a>.","ieee":"H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir, “Arrangements of curves in the plane - topology, combinatorics, and algorithms,” <i>Theoretical Computer Science</i>, vol. 92, no. 2. Elsevier, pp. 319–336, 1992.","apa":"Edelsbrunner, H., Guibas, L., Pach, J., Pollack, R., Seidel, R., &#38; Sharir, M. (1992). Arrangements of curves in the plane - topology, combinatorics, and algorithms. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3975(92)90319-B\">https://doi.org/10.1016/0304-3975(92)90319-B</a>"},"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"319 - 336","volume":92,"year":"1992","_id":"4047","date_updated":"2022-03-16T09:04:37Z","doi":"10.1016/0304-3975(92)90319-B","article_processing_charge":"No","date_published":"1992-01-20T00:00:00Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"first_name":"Leonidas","last_name":"Guibas","full_name":"Guibas, Leonidas"},{"first_name":"János","last_name":"Pach","full_name":"Pach, János"},{"first_name":"Richard","last_name":"Pollack","full_name":"Pollack, Richard"},{"last_name":"Seidel","first_name":"Raimund","full_name":"Seidel, Raimund"},{"first_name":"Micha","last_name":"Sharir","full_name":"Sharir, Micha"}],"quality_controlled":"1","scopus_import":"1","day":"20","language":[{"iso":"eng"}],"month":"01","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/030439759290319B?via%3Dihub"}],"intvolume":"        92"},{"quality_controlled":"1","scopus_import":"1","date_updated":"2022-03-16T09:20:13Z","doi":"10.1016/0020-0190(92)90133-G","article_processing_charge":"No","author":[{"last_name":"Aggarwal","first_name":"Alok","full_name":"Aggarwal, Alok"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Raghavan, Prabhakar","last_name":"Raghavan","first_name":"Prabhakar"},{"full_name":"Tiwari, Prasoon","last_name":"Tiwari","first_name":"Prasoon"}],"date_published":"1992-04-27T00:00:00Z","publication_status":"published","intvolume":"        42","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/002001909290133G"}],"language":[{"iso":"eng"}],"month":"04","day":"27","publist_id":"2080","oa_version":"None","date_created":"2018-12-11T12:06:38Z","publisher":"Elsevier","title":"Optimal time bounds for some proximity problems in the plane","publication":"Information Processing Letters","extern":"1","abstract":[{"text":"Given a sequence of n points that form the vertices of a simple polygon, we show that determining a closest pair requires OMEGA(n log n) time in the algebraic decision tree model. Together with the well-known O(n log n) upper bound for finding a closest pair, this settles an open problem of Lee and Preparata. We also extend this O(n log n) upper bound to the following problem: Given a collection of sets with a total of n points in the plane, find for each point a closest neighbor that does not belong to the same set.","lang":"eng"}],"year":"1992","_id":"4048","type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"55 - 60","volume":42,"publication_identifier":{"eissn":["1872-6119"],"issn":["0020-0190"]},"citation":{"ama":"Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P. Optimal time bounds for some proximity problems in the plane. <i>Information Processing Letters</i>. 1992;42(1):55-60. doi:<a href=\"https://doi.org/10.1016/0020-0190(92)90133-G\">10.1016/0020-0190(92)90133-G</a>","mla":"Aggarwal, Alok, et al. “Optimal Time Bounds for Some Proximity Problems in the Plane.” <i>Information Processing Letters</i>, vol. 42, no. 1, Elsevier, 1992, pp. 55–60, doi:<a href=\"https://doi.org/10.1016/0020-0190(92)90133-G\">10.1016/0020-0190(92)90133-G</a>.","short":"A. Aggarwal, H. Edelsbrunner, P. Raghavan, P. Tiwari, Information Processing Letters 42 (1992) 55–60.","ista":"Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P. 1992. Optimal time bounds for some proximity problems in the plane. Information Processing Letters. 42(1), 55–60.","ieee":"A. Aggarwal, H. Edelsbrunner, P. Raghavan, and P. Tiwari, “Optimal time bounds for some proximity problems in the plane,” <i>Information Processing Letters</i>, vol. 42, no. 1. Elsevier, pp. 55–60, 1992.","chicago":"Aggarwal, Alok, Herbert Edelsbrunner, Prabhakar Raghavan, and Prasoon Tiwari. “Optimal Time Bounds for Some Proximity Problems in the Plane.” <i>Information Processing Letters</i>. Elsevier, 1992. <a href=\"https://doi.org/10.1016/0020-0190(92)90133-G\">https://doi.org/10.1016/0020-0190(92)90133-G</a>.","apa":"Aggarwal, A., Edelsbrunner, H., Raghavan, P., &#38; Tiwari, P. (1992). Optimal time bounds for some proximity problems in the plane. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(92)90133-G\">https://doi.org/10.1016/0020-0190(92)90133-G</a>"},"article_type":"original","issue":"1","acknowledgement":"Research supported by the National Science Foundation under Grant CCR-8714565.","status":"public"},{"month":"04","language":[{"iso":"eng"}],"day":"07","publication_status":"published","intvolume":"       583","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/BFb0023816"}],"quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","doi":"10.1007/BFb0023816","date_updated":"2022-03-16T08:04:53Z","alternative_title":["LNCS"],"author":[{"first_name":"Marshall","last_name":"Bern","full_name":"Bern, Marshall"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Eppstein, David","last_name":"Eppstein","first_name":"David"},{"last_name":"Mitchell","first_name":"Stephen","full_name":"Mitchell, Stephen"},{"full_name":"Tan, Tiow","first_name":"Tiow","last_name":"Tan"}],"date_published":"1992-04-07T00:00:00Z","editor":[{"first_name":"Imre","last_name":"Simon","full_name":"Simon, Imre"}],"conference":{"start_date":"1992-04-06","location":"São Paulo, Brazil","end_date":"1992-04-10","name":"LATIN: Latin American Symposium on Theoretical Informatics "},"publication_identifier":{"isbn":["978-3-540-55284-0"]},"citation":{"chicago":"Bern, Marshall, Herbert Edelsbrunner, David Eppstein, Stephen Mitchell, and Tiow Tan. “Edge Insertion for Optimal Triangulations.” In <i>1st Latin American Symposium on Theoretical Informatics</i>, edited by Imre Simon, 583:46–60. Springer, 1992. <a href=\"https://doi.org/10.1007/BFb0023816\">https://doi.org/10.1007/BFb0023816</a>.","ieee":"M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan, “Edge insertion for optimal triangulations,” in <i>1st Latin American Symposium on Theoretical Informatics</i>, São Paulo, Brazil, 1992, vol. 583, pp. 46–60.","apa":"Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., &#38; Tan, T. (1992). Edge insertion for optimal triangulations. In I. Simon (Ed.), <i>1st Latin American Symposium on Theoretical Informatics</i> (Vol. 583, pp. 46–60). São Paulo, Brazil: Springer. <a href=\"https://doi.org/10.1007/BFb0023816\">https://doi.org/10.1007/BFb0023816</a>","ama":"Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. Edge insertion for optimal triangulations. In: Simon I, ed. <i>1st Latin American Symposium on Theoretical Informatics</i>. Vol 583. Springer; 1992:46-60. doi:<a href=\"https://doi.org/10.1007/BFb0023816\">10.1007/BFb0023816</a>","ista":"Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1992. Edge insertion for optimal triangulations. 1st Latin American Symposium on Theoretical Informatics. LATIN: Latin American Symposium on Theoretical Informatics , LNCS, vol. 583, 46–60.","mla":"Bern, Marshall, et al. “Edge Insertion for Optimal Triangulations.” <i>1st Latin American Symposium on Theoretical Informatics</i>, edited by Imre Simon, vol. 583, Springer, 1992, pp. 46–60, doi:<a href=\"https://doi.org/10.1007/BFb0023816\">10.1007/BFb0023816</a>.","short":"M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. Tan, in:, I. Simon (Ed.), 1st Latin American Symposium on Theoretical Informatics, Springer, 1992, pp. 46–60."},"acknowledgement":"Research of the second author is supported by the National Science Foundation under grant no. CCR-8921421 and under the Alan T. Waterman award, grant no. CCR-9118874. Any opinions, finding and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the view of the National Science Foundation. Part of the work was done while the second, third, and fourth authors visited the Xerox Palo Alto Research Center. The fifth author is on study leave from the National University of Singapore, Republic of Singapore.","status":"public","year":"1992","_id":"4049","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","volume":583,"page":"46 - 60","extern":"1","abstract":[{"lang":"eng","text":"The edge-insertion paradigm improves a triangulation of a finite point set in R2 iteratively by adding a new edge, deleting intersecting old edges, and retriangulating the resulting two polygonal regions. After presenting an abstract view of the paradigm, this paper shows that it can be used to obtain polynomial time algorithms for several types of optimal triangulations."}],"publist_id":"2076","date_created":"2018-12-11T12:06:38Z","oa_version":"None","publisher":"Springer","publication":"1st Latin American Symposium on Theoretical Informatics","title":"Edge insertion for optimal triangulations"},{"date_updated":"2022-03-16T08:15:04Z","doi":"10.1007/BF02293046","article_processing_charge":"No","date_published":"1992-08-01T00:00:00Z","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"extern":"1","quality_controlled":"1","scopus_import":"1","publisher":"Springer","title":"Guest editor's foreword","publication":"Discrete & Computational Geometry","publist_id":"2077","oa_version":"None","date_created":"2018-12-11T12:06:39Z","day":"01","article_type":"letter_note","issue":"1","status":"public","language":[{"iso":"eng"}],"month":"08","citation":{"apa":"Edelsbrunner, H. (1992). Guest editor’s foreword. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02293046\">https://doi.org/10.1007/BF02293046</a>","ieee":"H. Edelsbrunner, “Guest editor’s foreword,” <i>Discrete &#38; Computational Geometry</i>, vol. 8, no. 1. Springer, pp. 217–217, 1992.","chicago":"Edelsbrunner, Herbert. “Guest Editor’s Foreword.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1992. <a href=\"https://doi.org/10.1007/BF02293046\">https://doi.org/10.1007/BF02293046</a>.","mla":"Edelsbrunner, Herbert. “Guest Editor’s Foreword.” <i>Discrete &#38; Computational Geometry</i>, vol. 8, no. 1, Springer, 1992, pp. 217–217, doi:<a href=\"https://doi.org/10.1007/BF02293046\">10.1007/BF02293046</a>.","short":"H. Edelsbrunner, Discrete &#38; Computational Geometry 8 (1992) 217–217.","ista":"Edelsbrunner H. 1992. Guest editor’s foreword. Discrete &#38; Computational Geometry. 8(1), 217–217.","ama":"Edelsbrunner H. Guest editor’s foreword. <i>Discrete &#38; Computational Geometry</i>. 1992;8(1):217-217. doi:<a href=\"https://doi.org/10.1007/BF02293046\">10.1007/BF02293046</a>"},"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"217 - 217","volume":8,"publication_status":"published","year":"1992","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02293046"}],"_id":"4050","intvolume":"         8"},{"language":[{"iso":"eng"}],"month":"09","day":"01","publication_status":"published","intvolume":"        12","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01285815"}],"quality_controlled":"1","scopus_import":"1","date_updated":"2022-03-15T15:44:26Z","doi":"10.1007/BF01285815","article_processing_charge":"No","author":[{"full_name":"Aronov, Boris","first_name":"Boris","last_name":"Aronov"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"first_name":"Leonidas","last_name":"Guibas","full_name":"Guibas, Leonidas"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"date_published":"1992-09-01T00:00:00Z","publication_identifier":{"issn":["0209-9683"]},"citation":{"ama":"Aronov B, Edelsbrunner H, Guibas L, Sharir M. The number of edges of many faces in a line segment arrangement. <i>Combinatorica</i>. 1992;12(3):261-274. doi:<a href=\"https://doi.org/10.1007/BF01285815\">10.1007/BF01285815</a>","ista":"Aronov B, Edelsbrunner H, Guibas L, Sharir M. 1992. The number of edges of many faces in a line segment arrangement. Combinatorica. 12(3), 261–274.","short":"B. Aronov, H. Edelsbrunner, L. Guibas, M. Sharir, Combinatorica 12 (1992) 261–274.","mla":"Aronov, Boris, et al. “The Number of Edges of Many Faces in a Line Segment Arrangement.” <i>Combinatorica</i>, vol. 12, no. 3, Springer, 1992, pp. 261–74, doi:<a href=\"https://doi.org/10.1007/BF01285815\">10.1007/BF01285815</a>.","ieee":"B. Aronov, H. Edelsbrunner, L. Guibas, and M. Sharir, “The number of edges of many faces in a line segment arrangement,” <i>Combinatorica</i>, vol. 12, no. 3. Springer, pp. 261–274, 1992.","chicago":"Aronov, Boris, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “The Number of Edges of Many Faces in a Line Segment Arrangement.” <i>Combinatorica</i>. Springer, 1992. <a href=\"https://doi.org/10.1007/BF01285815\">https://doi.org/10.1007/BF01285815</a>.","apa":"Aronov, B., Edelsbrunner, H., Guibas, L., &#38; Sharir, M. (1992). The number of edges of many faces in a line segment arrangement. <i>Combinatorica</i>. Springer. <a href=\"https://doi.org/10.1007/BF01285815\">https://doi.org/10.1007/BF01285815</a>"},"article_type":"original","issue":"3","status":"public","year":"1992","_id":"4053","type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"261 - 274","volume":12,"extern":"1","abstract":[{"text":"We show that the maximum number of edges bounding m faces in an arrangement of n line segments in the plane is O(m2/3n2/3+nα(n)+nlog m). This improves a previous upper bound of Edelsbrunner et al. [5] and almost matches the best known lower bound which is Ω(m2/3n2/3+nα(n)). In addition, we show that the number of edges bounding any m faces in an arrangement of n line segments with a total of t intersecting pairs is O(m2/3t1/3+nα(t/n)+nmin{log m,log t/n}), almost matching the lower bound of Ω(m2/3t1/3+nα(t/n)) demonstrated in this paper.","lang":"eng"}],"publist_id":"2074","oa_version":"None","date_created":"2018-12-11T12:06:40Z","publisher":"Springer","title":"The number of edges of many faces in a line segment arrangement","publication":"Combinatorica"}]