[{"type":"review","extern":"1","publist_id":"1758","publisher":"Nature Publishing Group","intvolume":" 357","status":"public","publication_status":"published","title":"Genetics and geography","_id":"4306","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","year":"1992","volume":357,"oa_version":"None","date_created":"2018-12-11T12:08:10Z","date_updated":"2022-03-15T14:27:10Z","author":[{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"last_name":"Goldman","first_name":"Nick","full_name":"Goldman, Nick"}],"scopus_import":"1","article_processing_charge":"No","month":"06","day":"11","page":"440 - 441","quality_controlled":"1","citation":{"ieee":"N. H. Barton and N. Goldman, “Genetics and geography,” Nature, vol. 357. Nature Publishing Group, pp. 440–441, 1992.","apa":"Barton, N. H., & Goldman, N. (1992). Genetics and geography. Nature. Nature Publishing Group. https://doi.org/10.1038/357440a0","ista":"Barton NH, Goldman N. 1992. Genetics and geography. Nature. 357, 440–441.","ama":"Barton NH, Goldman N. Genetics and geography. Nature. 1992;357:440-441. doi:10.1038/357440a0","chicago":"Barton, Nicholas H, and Nick Goldman. “Genetics and Geography.” Nature. Nature Publishing Group, 1992. https://doi.org/10.1038/357440a0.","short":"N.H. Barton, N. Goldman, Nature 357 (1992) 440–441.","mla":"Barton, Nicholas H., and Nick Goldman. “Genetics and Geography.” Nature, vol. 357, Nature Publishing Group, 1992, pp. 440–41, doi:10.1038/357440a0."},"main_file_link":[{"url":"https://www.nature.com/articles/357440a0"}],"publication":"Nature","language":[{"iso":"eng"}],"doi":"10.1038/357440a0","date_published":"1992-06-11T00:00:00Z"},{"type":"journal_article","abstract":[{"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.","lang":"eng"}],"issue":"5063","title":"Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells.","status":"public","intvolume":" 256","_id":"3469","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","scopus_import":"1","day":"12","article_processing_charge":"No","article_type":"original","page":"1566 - 1570","publication":"Science","citation":{"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.” Science. American Association for the Advancement of Science, 1992. https://doi.org/10.1126/science.1317970.","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.” Science, vol. 256, no. 5063, American Association for the Advancement of Science, 1992, pp. 1566–70, doi:10.1126/science.1317970.","ieee":"N. Burnashev et al., “Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells.,” Science, 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. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.1317970","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.","ama":"Burnashev N, Khodorova A, Jonas PM, et al. Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells. Science. 1992;256(5063):1566-1570. doi:10.1126/science.1317970"},"date_published":"1992-06-12T00:00:00Z","extern":"1","publist_id":"2918","publication_status":"published","publisher":"American Association for the Advancement of Science","year":"1992","pmid":1,"date_updated":"2022-03-16T13:24:52Z","date_created":"2018-12-11T12:03:30Z","volume":256,"author":[{"first_name":"Nail","last_name":"Burnashev","full_name":"Burnashev, Nail"},{"full_name":"Khodorova, Alla","first_name":"Alla","last_name":"Khodorova"},{"full_name":"Jonas, Peter M","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Helm, P.","first_name":"P.","last_name":"Helm"},{"full_name":"Wisden, William","last_name":"Wisden","first_name":"William"},{"full_name":"Monyer, Hannah","first_name":"Hannah","last_name":"Monyer"},{"full_name":"Seeburg, Peter","first_name":"Peter","last_name":"Seeburg"},{"full_name":"Sakmann, Bert","first_name":"Bert","last_name":"Sakmann"}],"month":"06","publication_identifier":{"issn":["0036-8075"]},"quality_controlled":"1","main_file_link":[{"url":"https://www.science.org/doi/10.1126/science.1317970"}],"external_id":{"pmid":["1317970"]},"language":[{"iso":"eng"}],"doi":"10.1126/science.1317970"},{"publication":"Computational Geometry: Theory and Applications","citation":{"apa":"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. Elsevier. https://doi.org/10.1016/0925-7721(92)90009-H","ieee":"B. Chazelle et al., “Counting and cutting cycles of lines and rods in space,” Computational Geometry: Theory and Applications, vol. 1, no. 6. Elsevier, pp. 305–323, 1992.","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.","ama":"Chazelle B, Edelsbrunner H, Guibas L, et al. Counting and cutting cycles of lines and rods in space. Computational Geometry: Theory and Applications. 1992;1(6):305-323. doi:10.1016/0925-7721(92)90009-H","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.” Computational Geometry: Theory and Applications. Elsevier, 1992. https://doi.org/10.1016/0925-7721(92)90009-H.","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, Computational Geometry: Theory and Applications 1 (1992) 305–323.","mla":"Chazelle, Bernard, et al. “Counting and Cutting Cycles of Lines and Rods in Space.” Computational Geometry: Theory and Applications, vol. 1, no. 6, Elsevier, 1992, pp. 305–23, doi:10.1016/0925-7721(92)90009-H."},"article_type":"original","page":"305 - 323","date_published":"1992-06-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"3581","status":"public","title":"Counting and cutting cycles of lines and rods in space","intvolume":" 1","oa_version":"Published Version","type":"journal_article","abstract":[{"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. ","lang":"eng"}],"issue":"6","oa":1,"main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/092577219290009H?via%3Dihub"}],"quality_controlled":"1","doi":"10.1016/0925-7721(92)90009-H","language":[{"iso":"eng"}],"month":"06","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.","year":"1992","publication_status":"published","publisher":"Elsevier","author":[{"full_name":"Chazelle, Bernard","first_name":"Bernard","last_name":"Chazelle"},{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"full_name":"Pollack, Richard","last_name":"Pollack","first_name":"Richard"},{"first_name":"Raimund","last_name":"Seidel","full_name":"Seidel, Raimund"},{"last_name":"Sharir","first_name":"Micha","full_name":"Sharir, Micha"},{"full_name":"Snoeyink, Jack","first_name":"Jack","last_name":"Snoeyink"}],"date_created":"2018-12-11T12:04:04Z","date_updated":"2022-03-16T10:41:58Z","volume":1,"publist_id":"2804","extern":"1"},{"publication_status":"published","publisher":"Wiley-Blackwell","year":"1992","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). ","pmid":1,"date_created":"2018-12-11T12:04:24Z","date_updated":"2022-03-16T09:52:55Z","volume":46,"author":[{"full_name":"Sanderson, Neil","first_name":"Neil","last_name":"Sanderson"},{"full_name":"Szymura, Jacek","last_name":"Szymura","first_name":"Jacek"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","full_name":"Barton, Nicholas H"}],"extern":"1","publist_id":"2738","quality_controlled":"1","main_file_link":[{"url":"https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1558-5646.1992.tb02068.x"}],"external_id":{"pmid":["28568664"]},"language":[{"iso":"eng"}],"doi":"10.1111/j.1558-5646.1992.tb02068.x","month":"01","publication_identifier":{"issn":["0014-3820"]},"status":"public","title":"Variation in mating call across the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata","intvolume":" 46","_id":"3645","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","type":"journal_article","abstract":[{"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.","lang":"eng"}],"issue":"3","article_type":"original","page":"595 - 607","publication":"Evolution","citation":{"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. Evolution. 1992;46(3):595-607. doi:10.1111/j.1558-5646.1992.tb02068.x","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.","apa":"Sanderson, N., Szymura, J., & Barton, N. H. (1992). Variation in mating call across the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata. Evolution. Wiley-Blackwell. https://doi.org/10.1111/j.1558-5646.1992.tb02068.x","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,” Evolution, vol. 46, no. 3. Wiley-Blackwell, pp. 595–607, 1992.","mla":"Sanderson, Neil, et al. “Variation in Mating Call across the Hybrid Zone between the Fire-Bellied Toads Bombina Bombina and B. Variegata.” Evolution, vol. 46, no. 3, Wiley-Blackwell, 1992, pp. 595–607, doi:10.1111/j.1558-5646.1992.tb02068.x.","short":"N. Sanderson, J. Szymura, N.H. Barton, Evolution 46 (1992) 595–607.","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.” Evolution. Wiley-Blackwell, 1992. https://doi.org/10.1111/j.1558-5646.1992.tb02068.x."},"date_published":"1992-01-01T00:00:00Z","day":"01","article_processing_charge":"No"},{"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."}],"alternative_title":["LNCS"],"type":"conference","oa_version":"None","intvolume":" 583","status":"public","title":"Edge insertion for optimal triangulations","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4049","article_processing_charge":"No","day":"07","scopus_import":"1","date_published":"1992-04-07T00:00:00Z","page":"46 - 60","citation":{"chicago":"Bern, Marshall, Herbert Edelsbrunner, David Eppstein, Stephen Mitchell, and Tiow Tan. “Edge Insertion for Optimal Triangulations.” In 1st Latin American Symposium on Theoretical Informatics, edited by Imre Simon, 583:46–60. Springer, 1992. https://doi.org/10.1007/BFb0023816.","mla":"Bern, Marshall, et al. “Edge Insertion for Optimal Triangulations.” 1st Latin American Symposium on Theoretical Informatics, edited by Imre Simon, vol. 583, Springer, 1992, pp. 46–60, doi:10.1007/BFb0023816.","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.","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.","ieee":"M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan, “Edge insertion for optimal triangulations,” in 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, 1992, vol. 583, pp. 46–60.","apa":"Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., & Tan, T. (1992). Edge insertion for optimal triangulations. In I. Simon (Ed.), 1st Latin American Symposium on Theoretical Informatics (Vol. 583, pp. 46–60). São Paulo, Brazil: Springer. https://doi.org/10.1007/BFb0023816","ama":"Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. Edge insertion for optimal triangulations. In: Simon I, ed. 1st Latin American Symposium on Theoretical Informatics. Vol 583. Springer; 1992:46-60. doi:10.1007/BFb0023816"},"publication":"1st Latin American Symposium on Theoretical Informatics","extern":"1","publist_id":"2076","volume":583,"date_created":"2018-12-11T12:06:38Z","date_updated":"2022-03-16T08:04:53Z","author":[{"full_name":"Bern, Marshall","first_name":"Marshall","last_name":"Bern"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"first_name":"David","last_name":"Eppstein","full_name":"Eppstein, David"},{"first_name":"Stephen","last_name":"Mitchell","full_name":"Mitchell, Stephen"},{"last_name":"Tan","first_name":"Tiow","full_name":"Tan, Tiow"}],"editor":[{"full_name":"Simon, Imre","last_name":"Simon","first_name":"Imre"}],"publisher":"Springer","publication_status":"published","year":"1992","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.","publication_identifier":{"isbn":["978-3-540-55284-0"]},"month":"04","language":[{"iso":"eng"}],"doi":"10.1007/BFb0023816","conference":{"end_date":"1992-04-10","start_date":"1992-04-06","location":"São Paulo, Brazil","name":"LATIN: Latin American Symposium on Theoretical Informatics "},"quality_controlled":"1","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/BFb0023816"}]},{"date_updated":"2022-03-16T09:04:37Z","date_created":"2018-12-11T12:06:37Z","volume":92,"author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"full_name":"Pach, János","last_name":"Pach","first_name":"János"},{"full_name":"Pollack, Richard","last_name":"Pollack","first_name":"Richard"},{"last_name":"Seidel","first_name":"Raimund","full_name":"Seidel, Raimund"},{"full_name":"Sharir, Micha","last_name":"Sharir","first_name":"Micha"}],"publication_status":"published","publisher":"Elsevier","year":"1992","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. ","extern":"1","publist_id":"2079","language":[{"iso":"eng"}],"doi":"10.1016/0304-3975(92)90319-B","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/030439759290319B?via%3Dihub"}],"month":"01","publication_identifier":{"issn":["0304-3975"]},"oa_version":"Published Version","title":"Arrangements of curves in the plane - topology, combinatorics, and algorithms","status":"public","intvolume":" 92","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4047","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."}],"issue":"2","type":"journal_article","date_published":"1992-01-20T00:00:00Z","article_type":"original","page":"319 - 336","publication":"Theoretical Computer Science","citation":{"ama":"Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. Arrangements of curves in the plane - topology, combinatorics, and algorithms. Theoretical Computer Science. 1992;92(2):319-336. doi:10.1016/0304-3975(92)90319-B","ieee":"H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir, “Arrangements of curves in the plane - topology, combinatorics, and algorithms,” Theoretical Computer Science, vol. 92, no. 2. Elsevier, pp. 319–336, 1992.","apa":"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. Elsevier. https://doi.org/10.1016/0304-3975(92)90319-B","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.” Theoretical Computer Science, vol. 92, no. 2, Elsevier, 1992, pp. 319–36, doi:10.1016/0304-3975(92)90319-B.","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.” Theoretical Computer Science. Elsevier, 1992. https://doi.org/10.1016/0304-3975(92)90319-B."},"day":"20","article_processing_charge":"No","scopus_import":"1"},{"oa_version":"None","_id":"4046","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":" 39","status":"public","title":"An optimal algorithm for intersecting line segments in the plane","issue":"1","abstract":[{"lang":"eng","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."}],"type":"journal_article","date_published":"1992-01-01T00:00:00Z","citation":{"mla":"Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.” Journal of the ACM, vol. 39, no. 1, ACM, 1992, pp. 1–54, doi:10.1145/147508.147511.","short":"B. Chazelle, H. Edelsbrunner, Journal of the ACM 39 (1992) 1–54.","chicago":"Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.” Journal of the ACM. ACM, 1992. https://doi.org/10.1145/147508.147511.","ama":"Chazelle B, Edelsbrunner H. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM. 1992;39(1):1-54. doi:10.1145/147508.147511","ista":"Chazelle B, Edelsbrunner H. 1992. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM. 39(1), 1–54.","ieee":"B. Chazelle and H. Edelsbrunner, “An optimal algorithm for intersecting line segments in the plane,” Journal of the ACM, vol. 39, no. 1. ACM, pp. 1–54, 1992.","apa":"Chazelle, B., & Edelsbrunner, H. (1992). An optimal algorithm for intersecting line segments in the plane. Journal of the ACM. ACM. https://doi.org/10.1145/147508.147511"},"publication":"Journal of the ACM","page":"1 - 54","article_type":"original","article_processing_charge":"No","day":"01","scopus_import":"1","author":[{"last_name":"Chazelle","first_name":"Bernard","full_name":"Chazelle, Bernard"},{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"}],"volume":39,"date_created":"2018-12-11T12:06:37Z","date_updated":"2022-03-16T08:32:17Z","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.","year":"1992","publisher":"ACM","publication_status":"published","publist_id":"2078","extern":"1","doi":"10.1145/147508.147511","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/147508.147511"}],"quality_controlled":"1","publication_identifier":{"eissn":["1557-735X"],"issn":["0004-5411"]},"month":"01"},{"publist_id":"2081","extern":"1","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Tan, Tiow","last_name":"Tan","first_name":"Tiow"},{"first_name":"Roman","last_name":"Waupotitsch","full_name":"Waupotitsch, Roman"}],"volume":13,"date_updated":"2022-03-16T09:35:05Z","date_created":"2018-12-11T12:06:36Z","year":"1992","publisher":"Society for Industrial and Applied Mathematics ","publication_status":"published","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"month":"07","doi":"10.1137/0913058","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://epubs.siam.org/doi/10.1137/0913058"}],"quality_controlled":"1","issue":"4","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"}],"type":"journal_article","oa_version":"None","_id":"4043","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":" 13","status":"public","title":"An O(n^2 log n) time algorithm for the MinMax angle triangulation","article_processing_charge":"No","day":"01","date_published":"1992-07-01T00:00:00Z","citation":{"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.","apa":"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. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/0913058","ieee":"H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2 log n) time algorithm for the MinMax angle triangulation,” SIAM Journal on Scientific Computing, vol. 13, no. 4. Society for Industrial and Applied Mathematics , pp. 994–1008, 1992.","ama":"Edelsbrunner H, Tan T, Waupotitsch R. An O(n^2 log n) time algorithm for the MinMax angle triangulation. SIAM Journal on Scientific Computing. 1992;13(4):994-1008. doi:10.1137/0913058","chicago":"Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.” SIAM Journal on Scientific Computing. Society for Industrial and Applied Mathematics , 1992. https://doi.org/10.1137/0913058.","mla":"Edelsbrunner, Herbert, et al. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.” SIAM Journal on Scientific Computing, vol. 13, no. 4, Society for Industrial and Applied Mathematics , 1992, pp. 994–1008, doi:10.1137/0913058.","short":"H. Edelsbrunner, T. Tan, R. Waupotitsch, SIAM Journal on Scientific Computing 13 (1992) 994–1008."},"publication":"SIAM Journal on Scientific Computing","page":"994 - 1008","article_type":"original"},{"extern":"1","publist_id":"2080","publication_status":"published","publisher":"Elsevier","year":"1992","acknowledgement":"Research supported by the National Science Foundation under Grant CCR-8714565.","date_created":"2018-12-11T12:06:38Z","date_updated":"2022-03-16T09:20:13Z","volume":42,"author":[{"full_name":"Aggarwal, Alok","first_name":"Alok","last_name":"Aggarwal"},{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Raghavan, Prabhakar","first_name":"Prabhakar","last_name":"Raghavan"},{"first_name":"Prasoon","last_name":"Tiwari","full_name":"Tiwari, Prasoon"}],"month":"04","publication_identifier":{"issn":["0020-0190"],"eissn":["1872-6119"]},"quality_controlled":"1","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/002001909290133G"}],"language":[{"iso":"eng"}],"doi":"10.1016/0020-0190(92)90133-G","type":"journal_article","abstract":[{"lang":"eng","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."}],"issue":"1","status":"public","title":"Optimal time bounds for some proximity problems in the plane","intvolume":" 42","_id":"4048","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","scopus_import":"1","day":"27","article_processing_charge":"No","article_type":"original","page":"55 - 60","publication":"Information Processing Letters","citation":{"chicago":"Aggarwal, Alok, Herbert Edelsbrunner, Prabhakar Raghavan, and Prasoon Tiwari. “Optimal Time Bounds for Some Proximity Problems in the Plane.” Information Processing Letters. Elsevier, 1992. https://doi.org/10.1016/0020-0190(92)90133-G.","short":"A. Aggarwal, H. Edelsbrunner, P. Raghavan, P. Tiwari, Information Processing Letters 42 (1992) 55–60.","mla":"Aggarwal, Alok, et al. “Optimal Time Bounds for Some Proximity Problems in the Plane.” Information Processing Letters, vol. 42, no. 1, Elsevier, 1992, pp. 55–60, doi:10.1016/0020-0190(92)90133-G.","apa":"Aggarwal, A., Edelsbrunner, H., Raghavan, P., & Tiwari, P. (1992). Optimal time bounds for some proximity problems in the plane. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(92)90133-G","ieee":"A. Aggarwal, H. Edelsbrunner, P. Raghavan, and P. Tiwari, “Optimal time bounds for some proximity problems in the plane,” Information Processing Letters, vol. 42, no. 1. Elsevier, pp. 55–60, 1992.","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.","ama":"Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P. Optimal time bounds for some proximity problems in the plane. Information Processing Letters. 1992;42(1):55-60. doi:10.1016/0020-0190(92)90133-G"},"date_published":"1992-04-27T00:00:00Z"},{"scopus_import":"1","article_processing_charge":"No","publication_identifier":{"isbn":["0-8186-2735-2"]},"day":"01","month":"01","page":"394 - 406","quality_controlled":"1","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/185551"}],"citation":{"apa":"Henzinger, T. A., Nicollin, X., Sifakis, J., & Yovine, S. (1992). Symbolic model checking for real-time systems. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science (pp. 394–406). Santa Cruz, CA, United States of America: IEEE. https://doi.org/10.1109/LICS.1992.185551","ieee":"T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, “Symbolic model checking for real-time systems,” in Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, CA, United States of America, 1992, pp. 394–406.","ista":"Henzinger TA, Nicollin X, Sifakis J, Yovine S. 1992. Symbolic model checking for real-time systems. Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 394–406.","ama":"Henzinger TA, Nicollin X, Sifakis J, Yovine S. Symbolic model checking for real-time systems. In: Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science. IEEE; 1992:394-406. doi:10.1109/LICS.1992.185551","chicago":"Henzinger, Thomas A, Xavier Nicollin, Joseph Sifakis, and Sergio Yovine. “Symbolic Model Checking for Real-Time Systems.” In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, 394–406. IEEE, 1992. https://doi.org/10.1109/LICS.1992.185551.","short":"T.A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine, in:, Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1992, pp. 394–406.","mla":"Henzinger, Thomas A., et al. “Symbolic Model Checking for Real-Time Systems.” Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1992, pp. 394–406, doi:10.1109/LICS.1992.185551."},"publication":"Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science","language":[{"iso":"eng"}],"doi":"10.1109/LICS.1992.185551","date_published":"1992-01-01T00:00:00Z","conference":{"end_date":"1992-06-25","location":"Santa Cruz, CA, United States of America","start_date":"1992-06-22","name":"LICS: Logic in Computer Science"},"type":"conference","extern":"1","publist_id":"224","abstract":[{"lang":"eng","text":"We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space.\r\n\r\nFor this purpose, we introduce a mu-calculus on computation trees over real-numbered time. Unfortunately, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed mu-calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does not impair the symbolic verification of "implementable" real-time programs--those whose safety constraints are machine-closed with respect to diverging time and whose fairness constraints are restricted to finite upper bounds on clock values. All timed CTL properties of such programs are shown to be computable as finitely approximable fixpoints in a simple decidable theory."}],"publisher":"IEEE","publication_status":"published","title":"Symbolic model checking for real-time systems","status":"public","year":"1992","_id":"4505","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","date_created":"2018-12-11T12:09:12Z","date_updated":"2022-03-14T13:20:50Z","author":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Nicollin","first_name":"Xavier","full_name":"Nicollin, Xavier"},{"first_name":"Joseph","last_name":"Sifakis","full_name":"Sifakis, Joseph"},{"full_name":"Yovine, Sergio","last_name":"Yovine","first_name":"Sergio"}]},{"date_published":"1992-01-01T00:00:00Z","publication":"19th International Colloquium on Automata, Languages and Programming","citation":{"ista":"Henzinger TA, Manna Z, Pnueli A. 1992. What good are digital clocks? 19th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 623, 545–558.","apa":"Henzinger, T. A., Manna, Z., & Pnueli, A. (1992). What good are digital clocks? In 19th International Colloquium on Automata, Languages and Programming (Vol. 623, pp. 545–558). Vienna, Austria: Springer. https://doi.org/10.1007/3-540-55719-9_103","ieee":"T. A. Henzinger, Z. Manna, and A. Pnueli, “What good are digital clocks?,” in 19th International Colloquium on Automata, Languages and Programming, Vienna, Austria, 1992, vol. 623, pp. 545–558.","ama":"Henzinger TA, Manna Z, Pnueli A. What good are digital clocks? In: 19th International Colloquium on Automata, Languages and Programming. Vol 623. Springer; 1992:545-558. doi:10.1007/3-540-55719-9_103","chicago":"Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “What Good Are Digital Clocks?” In 19th International Colloquium on Automata, Languages and Programming, 623:545–58. Springer, 1992. https://doi.org/10.1007/3-540-55719-9_103.","mla":"Henzinger, Thomas A., et al. “What Good Are Digital Clocks?” 19th International Colloquium on Automata, Languages and Programming, vol. 623, Springer, 1992, pp. 545–58, doi:10.1007/3-540-55719-9_103.","short":"T.A. Henzinger, Z. Manna, A. Pnueli, in:, 19th International Colloquium on Automata, Languages and Programming, Springer, 1992, pp. 545–558."},"page":"545 - 558","day":"01","article_processing_charge":"No","oa_version":"None","_id":"4504","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"What good are digital clocks?","status":"public","intvolume":" 623","abstract":[{"lang":"eng","text":"Real-time systems operate in “real,” continuous time and state changes may occur at any real-numbered time point. Yet many verification methods are based on the assumption that states are observed at integer time points only. What can we conclude if a real-time system has been shown “correct” for integral observations?\r\n\r\nInteger time verification techniques suffice if the problem of whether all real-numbered behaviors of a system satisfy a property can be reduced to the question of whether the integral observations satisfy a (possibly modified) property. We show that this reduction is possible for a large and important class of systems and properties: the class of systems includes all systems that can be modeled as timed transition systems; the class of properties includes time-bounded invariance and time-bounded response."}],"type":"conference","alternative_title":["LNCS"],"conference":{"name":"ICALP: Automata, Languages and Programming","end_date":"1992-07-17","location":"Vienna, Austria","start_date":"1992-07-13"},"doi":"10.1007/3-540-55719-9_103","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-55719-9_103"}],"quality_controlled":"1","month":"01","author":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Manna, Zohar","first_name":"Zohar","last_name":"Manna"},{"last_name":"Pnueli","first_name":"Amir","full_name":"Pnueli, Amir"}],"date_updated":"2022-03-14T09:47:09Z","date_created":"2018-12-11T12:09:11Z","volume":623,"year":"1992","acknowledgement":"A full version of this paper (including all proofs) is available as a technical report from Cornell University and Stanford University. The research was supported in part by the National Science Foundation under grants CCR-89-11512 and CCR-89-13641, by the Defense Advanced Research Projects Agency under contract NAG2-703, by the United States Air Force Office of Scientific Research under contract AFOSR-90-0057, and by the European Community ESPRIT Basic Research Action Project 3096 (SPEC).\r\n\r\nSponsors: National Science Foundation grant CCR-89-11512, National Science Foundation grant CCR-89-13641, Defense Advanced Research Projects Agency contract NAG2-703, United States Air Force Office of Scientific Research contract AFOSR-90-0057, European Community ESPRIT Basic Research Action Project 3096 (SPEC).\r\n","publication_status":"published","publisher":"Springer","publist_id":"223","extern":"1"},{"alternative_title":["LNCS"],"type":"book_chapter","extern":"1","publist_id":"222","abstract":[{"text":"We incorporate time into an interleaving model of concurrency. In timed transition systems, the qualitative fairness requirements of traditional transition system are replaced (and superseded) by quantitative lower-bound and upperbound timing constraints on transitions. The purpose of this paper is to explore the scope of applicability for the abstract model of timed transition systems. We demonstrate that the model can represent a wide variety of phenomena that routinely occur in conjunction with the timed execution of concurrent processes. Our treatment covers both processes that are executed in parallel on separate processors and communicate either through shared variables or by message passing, and processes that time-share a limited number of processors under a given scheduling policy. Often it is this scheduling policy that determines if a system meets its real-time requirements. Thus we explicitly address such questions as time-outs, interrupts, static and dynamic priorities.","lang":"eng"}],"publisher":"Springer","intvolume":" 600","status":"public","publication_status":"published","title":"Timed transition systems","_id":"4507","acknowledgement":"Sponsor: IBM graduate fellowship, National Science Foundation grant CCR-89-11512 National Science Foundation grant CCR-89-13641, Defense Advanced Research Projects Agency 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":"1992","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","volume":600,"oa_version":"None","date_updated":"2022-03-14T09:34:44Z","date_created":"2018-12-11T12:09:12Z","author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Manna, Zohar","first_name":"Zohar","last_name":"Manna"},{"first_name":"Amir","last_name":"Pnueli","full_name":"Pnueli, Amir"}],"article_processing_charge":"No","month":"01","day":"01","page":"226 - 251","citation":{"ama":"Henzinger TA, Manna Z, Pnueli A. Timed transition systems. In: Real Time: Theory in Practice. Vol 600. Springer; 1992:226-251. doi:10.1007/BFb0031995","ieee":"T. A. Henzinger, Z. Manna, and A. Pnueli, “Timed transition systems,” in Real Time: Theory in Practice, vol. 600, Springer, 1992, pp. 226–251.","apa":"Henzinger, T. A., Manna, Z., & Pnueli, A. (1992). Timed transition systems. In Real Time: Theory in Practice (Vol. 600, pp. 226–251). Springer. https://doi.org/10.1007/BFb0031995","ista":"Henzinger TA, Manna Z, Pnueli A. 1992.Timed transition systems. In: Real Time: Theory in Practice. LNCS, vol. 600, 226–251.","short":"T.A. Henzinger, Z. Manna, A. Pnueli, in:, Real Time: Theory in Practice, Springer, 1992, pp. 226–251.","mla":"Henzinger, Thomas A., et al. “Timed Transition Systems.” Real Time: Theory in Practice, vol. 600, Springer, 1992, pp. 226–51, doi:10.1007/BFb0031995.","chicago":"Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “Timed Transition Systems.” In Real Time: Theory in Practice, 600:226–51. Springer, 1992. https://doi.org/10.1007/BFb0031995."},"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/BFb0031995"}],"publication":"Real Time: Theory in Practice","language":[{"iso":"eng"}],"doi":"10.1007/BFb0031995","date_published":"1992-01-01T00:00:00Z"},{"page":"135 - 141","article_type":"original","citation":{"ama":"Henzinger TA. Sooner Is Safer Than Later. Information Processing Letters. 1992;43(3):135-141. doi:10.1016/0020-0190(92)90005-G","ista":"Henzinger TA. 1992. Sooner Is Safer Than Later. Information Processing Letters. 43(3), 135–141.","ieee":"T. A. Henzinger, “Sooner Is Safer Than Later,” Information Processing Letters, vol. 43, no. 3. Elsevier, pp. 135–141, 1992.","apa":"Henzinger, T. A. (1992). Sooner Is Safer Than Later. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(92)90005-G","mla":"Henzinger, Thomas A. “Sooner Is Safer Than Later.” Information Processing Letters, vol. 43, no. 3, Elsevier, 1992, pp. 135–41, doi:10.1016/0020-0190(92)90005-G.","short":"T.A. Henzinger, Information Processing Letters 43 (1992) 135–141.","chicago":"Henzinger, Thomas A. “Sooner Is Safer Than Later.” Information Processing Letters. Elsevier, 1992. https://doi.org/10.1016/0020-0190(92)90005-G."},"publication":"Information Processing Letters","date_published":"1992-09-14T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"14","intvolume":" 43","status":"public","title":"Sooner Is Safer Than Later","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4517","oa_version":"None","type":"journal_article","issue":"3","abstract":[{"text":"It has been observed repeatedly that the standard safety-liveness classification for properties of reactive systems does not fit for real-time properties. This is because the implicit “liveliness” of time shifts the spectrum towards the safety side. While, for example, response—that “something good” will happen eventually—is a classical liveness property, bounded response—that “something good” will happen soon, within a certain amount of time—has many characteristics of safety. We account for this phenomenon formally by defining safety and liveness relative to a given condition, such as the progress of time.","lang":"eng"}],"quality_controlled":"1","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/002001909290005G?via%3Dihub"}],"language":[{"iso":"eng"}],"doi":"10.1016/0020-0190(92)90005-G","publication_identifier":{"issn":["0020-0190"]},"month":"09","publisher":"Elsevier","publication_status":"published","acknowledgement":"The author thanks Martin Abadi, Rajeev Alur, David Dill, Leslie Lamport, Zohar Manna, Amir Pnueli, Fred Schneider, and two anonymous referees for many valuable suggestions and improvements. ","year":"1992","volume":43,"date_created":"2018-12-11T12:09:16Z","date_updated":"2022-03-07T11:31:23Z","author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"extern":"1","publist_id":"211"},{"doi":"10.1007/BFb0031984","conference":{"start_date":"1991-06-03","location":"Mook, The Netherlands","end_date":"1991-06-07","name":"Workshop/School/Symposium of the REX Project"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/BFb0031988#enumeration"}],"quality_controlled":"1","month":"01","author":[{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"volume":600,"date_created":"2018-12-11T12:09:39Z","date_updated":"2022-03-07T10:20:06Z","year":"1992","publisher":"Springer","publication_status":"published","publist_id":"114","extern":"1","date_published":"1992-01-01T00:00:00Z","citation":{"ama":"Alur R, Henzinger TA. Logics and models of real time: A survey. In: REX Workshop on Real Time: Theory in Practice. Vol 600. Springer; 1992:74-106. doi:10.1007/BFb0031984","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.","ieee":"R. Alur and T. A. Henzinger, “Logics and models of real time: A survey,” in REX Workshop on Real Time: Theory in Practice, Mook, The Netherlands, 1992, vol. 600, pp. 74–106.","apa":"Alur, R., & Henzinger, T. A. (1992). Logics and models of real time: A survey. In REX Workshop on Real Time: Theory in Practice (Vol. 600, pp. 74–106). Mook, The Netherlands: Springer. https://doi.org/10.1007/BFb0031984","mla":"Alur, Rajeev, and Thomas A. Henzinger. “Logics and Models of Real Time: A Survey.” REX Workshop on Real Time: Theory in Practice, vol. 600, Springer, 1992, pp. 74–106, doi:10.1007/BFb0031984.","short":"R. Alur, T.A. Henzinger, in:, REX Workshop on Real Time: Theory in Practice, Springer, 1992, pp. 74–106.","chicago":"Alur, Rajeev, and Thomas A Henzinger. “Logics and Models of Real Time: A Survey.” In REX Workshop on Real Time: Theory in Practice, 600:74–106. Springer, 1992. https://doi.org/10.1007/BFb0031984."},"publication":"REX Workshop on Real Time: Theory in Practice","page":"74 - 106","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4593","intvolume":" 600","status":"public","title":"Logics and models of real time: A survey","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."}],"type":"conference","alternative_title":["LNCS"]},{"article_processing_charge":"No","month":"01","day":"01","scopus_import":"1","language":[{"iso":"eng"}],"date_published":"1992-01-01T00:00:00Z","doi":"10.1109/SFCS.1992.267774","conference":{"end_date":"1992-10-27","start_date":"1992-10-24","location":"Pittsburgh, PA, United States of America","name":"FOCS: Foundations of Computer Science"},"page":"177 - 186","quality_controlled":"1","citation":{"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.” Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992, pp. 177–86, doi:10.1109/SFCS.1992.267774.","chicago":"Alur, Rajeev, and Thomas A Henzinger. “Back to the Future: Towards a Theory of Timed Regular Languages.” In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 177–86. IEEE, 1992. https://doi.org/10.1109/SFCS.1992.267774.","ama":"Alur R, Henzinger TA. Back to the future: Towards a theory of timed regular languages. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science. IEEE; 1992:177-186. doi:10.1109/SFCS.1992.267774","ieee":"R. Alur and T. A. Henzinger, “Back to the future: Towards a theory of timed regular languages,” in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, United States of America, 1992, pp. 177–186.","apa":"Alur, R., & Henzinger, T. A. (1992). Back to the future: Towards a theory of timed regular languages. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (pp. 177–186). Pittsburgh, PA, United States of America: IEEE. https://doi.org/10.1109/SFCS.1992.267774","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."},"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/267774"}],"publication":"Proceedings of the 33rd Annual Symposium on Foundations of Computer Science","extern":"1","publist_id":"115","abstract":[{"lang":"eng","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"}],"type":"conference","oa_version":"None","date_created":"2018-12-11T12:09:39Z","date_updated":"2022-03-07T10:45:34Z","author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"publisher":"IEEE","status":"public","title":"Back to the future: Towards a theory of timed regular languages","publication_status":"published","_id":"4594","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","year":"1992"}]