[{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","article_processing_charge":"No","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"}],"main_file_link":[{"url":"https://www.sciencedirect.com/book/9780444895967/handbook-of-convex-geometry"}],"citation":{"ieee":"H. Edelsbrunner, “Geometric algorithms,” in <i>Handbook of Convex Geometry</i>, North Holland, 1993, pp. 699–735.","ama":"Edelsbrunner H. Geometric algorithms. In: <i>Handbook of Convex Geometry</i>. North Holland; 1993:699-735. doi:<a href=\"https://doi.org/10.1016/C2009-0-15705-7\">10.1016/C2009-0-15705-7</a>","ista":"Edelsbrunner H. 1993.Geometric algorithms. In: Handbook of Convex Geometry. , 699–735.","short":"H. Edelsbrunner, in:, Handbook of Convex Geometry, North Holland, 1993, pp. 699–735.","chicago":"Edelsbrunner, Herbert. “Geometric Algorithms.” In <i>Handbook of Convex Geometry</i>, 699–735. North Holland, 1993. <a href=\"https://doi.org/10.1016/C2009-0-15705-7\">https://doi.org/10.1016/C2009-0-15705-7</a>.","mla":"Edelsbrunner, Herbert. “Geometric Algorithms.” <i>Handbook of Convex Geometry</i>, North Holland, 1993, pp. 699–735, doi:<a href=\"https://doi.org/10.1016/C2009-0-15705-7\">10.1016/C2009-0-15705-7</a>.","apa":"Edelsbrunner, H. (1993). Geometric algorithms. In <i>Handbook of Convex Geometry</i> (pp. 699–735). North Holland. <a href=\"https://doi.org/10.1016/C2009-0-15705-7\">https://doi.org/10.1016/C2009-0-15705-7</a>"},"day":"24","year":"1993","date_updated":"2022-03-30T09:30:11Z","type":"book_chapter","oa_version":"None","language":[{"iso":"eng"}],"doi":"10.1016/C2009-0-15705-7","_id":"3568","title":"Geometric algorithms","publication":"Handbook of Convex Geometry","publication_status":"published","page":"699 - 735","date_published":"1993-08-24T00:00:00Z","publisher":"North Holland","publication_identifier":{"isbn":["978-0-444-89596-7"]},"publist_id":"2817","status":"public","date_created":"2018-12-11T12:04:00Z","month":"08"},{"publication_status":"published","title":"Computational geometry","publication":"Current Trends in Theoretical Computer Science, Essays and Tutorials","language":[{"iso":"eng"}],"_id":"3569","date_updated":"2022-03-30T08:46:20Z","type":"book_chapter","oa_version":"None","day":"01","year":"1993","citation":{"apa":"Edelsbrunner, H. (1993). Computational geometry. In <i>Current Trends in Theoretical Computer Science, Essays and Tutorials</i> (pp. 1–48). World Scientific Publishing.","mla":"Edelsbrunner, Herbert. “Computational Geometry.” <i>Current Trends in Theoretical Computer Science, Essays and Tutorials</i>, World Scientific Publishing, 1993, pp. 1–48.","ieee":"H. Edelsbrunner, “Computational geometry,” in <i>Current Trends in Theoretical Computer Science, Essays and Tutorials</i>, World Scientific Publishing, 1993, pp. 1–48.","ama":"Edelsbrunner H. Computational geometry. In: <i>Current Trends in Theoretical Computer Science, Essays and Tutorials</i>. World Scientific Publishing; 1993:1-48.","ista":"Edelsbrunner H. 1993.Computational geometry. In: Current Trends in Theoretical Computer Science, Essays and Tutorials. , 1–48.","chicago":"Edelsbrunner, Herbert. “Computational Geometry.” In <i>Current Trends in Theoretical Computer Science, Essays and Tutorials</i>, 1–48. World Scientific Publishing, 1993.","short":"H. Edelsbrunner, in:, Current Trends in Theoretical Computer Science, Essays and Tutorials, World Scientific Publishing, 1993, pp. 1–48."},"main_file_link":[{"url":"https://books.google.at/books?hl=en&lr=&id=fr_sCgAAQBAJ&oi=fnd&pg=PR5&ots=XAust-LAGl&sig=FQTlA5rrM25y5EZ8ZmrorT7SaMo&redir_esc=y#v=onepage&q&f=false"}],"article_processing_charge":"No","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","date_created":"2018-12-11T12:04:01Z","month":"08","status":"public","publication_identifier":{"isbn":["978-9810214623"]},"publist_id":"2816","publisher":"World Scientific Publishing","date_published":"1993-08-01T00:00:00Z","page":"1 - 48"},{"page":"127 - 136","date_published":"1993-04-01T00:00:00Z","scopus_import":"1","publication_identifier":{"issn":["0016-6723"]},"day":"01","oa_version":"None","date_updated":"2022-03-30T08:28:54Z","type":"journal_article","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"This work was supported by the Darwin Trust, by a Science and Engineering Research Council grant (GR/E/08507), and by an SERC Visiting Fellowship to S.Rouhani. ","doi":"10.1017/S0016672300031232","language":[{"iso":"eng"}],"article_type":"original","publisher":"Cambridge University Press","issue":"2","volume":61,"status":"public","month":"04","date_created":"2018-12-11T12:04:24Z","publist_id":"2740","intvolume":"        61","year":"1993","quality_controlled":"1","author":[{"full_name":"Rouhani, Shahin","first_name":"Shahin","last_name":"Rouhani"},{"first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"extern":"1","citation":{"mla":"Rouhani, Shahin, and Nicholas H. Barton. “Group Selection and the ‘Shifting Balance.’” <i>Genetical Research</i>, vol. 61, no. 2, Cambridge University Press, 1993, pp. 127–36, doi:<a href=\"https://doi.org/10.1017/S0016672300031232\">10.1017/S0016672300031232</a>.","apa":"Rouhani, S., &#38; Barton, N. H. (1993). Group selection and the “shifting balance.” <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672300031232\">https://doi.org/10.1017/S0016672300031232</a>","ieee":"S. Rouhani and N. H. Barton, “Group selection and the ‘shifting balance,’” <i>Genetical Research</i>, vol. 61, no. 2. Cambridge University Press, pp. 127–136, 1993.","ama":"Rouhani S, Barton NH. Group selection and the “shifting balance.” <i>Genetical Research</i>. 1993;61(2):127-136. doi:<a href=\"https://doi.org/10.1017/S0016672300031232\">10.1017/S0016672300031232</a>","short":"S. Rouhani, N.H. Barton, Genetical Research 61 (1993) 127–136.","chicago":"Rouhani, Shahin, and Nicholas H Barton. “Group Selection and the ‘Shifting Balance.’” <i>Genetical Research</i>. Cambridge University Press, 1993. <a href=\"https://doi.org/10.1017/S0016672300031232\">https://doi.org/10.1017/S0016672300031232</a>.","ista":"Rouhani S, Barton NH. 1993. Group selection and the ‘shifting balance’. Genetical Research. 61(2), 127–136."},"main_file_link":[{"url":"https://www.cambridge.org/core/journals/genetics-research/article/group-selection-and-the-shifting-balance/CFDE26EA7125957545F9A0AA37755BC4"}],"abstract":[{"lang":"eng","text":"We investigate the establishment and spread of new adaptive peaks within Wright's ‘shifting balance’. The third phase of the ‘shifting balance’ involves a kind of group selection, since demes in which a superior peak has been established contain more individuals, and so send out more migrants. We assume that population size, N, increases with mean fitness, , according to the exponential relation, . Here, k is a measure of the weakness of density-dependent regulation, and equals the inverse of the regression of log (fitness) on log(N). In the island model, we find that just as with soft selection (k = 0), two distinct types of behaviour exist: group selection makes no qualitative difference. With low numbers of migrants, demes fluctuate almost independently, and only one equilibrium exists. With large numbers of migrants, all the demes evolve towards the same adaptive peak, and so the whole population can move towards one or other of the peaks. Group selection can be understood in terms of an effective mean fitness function. Its main consequence is to increase the effect of selection relative to drift (Ns), and so increase the bias towards the fitter peak. However, this increased bias depends on the ratio between k and the deme size (k/N), and so is very small when density-dependence is reasonably strong."}],"publication_status":"published","_id":"3643","publication":"Genetical Research","title":"Group selection and the 'shifting balance'"},{"page":"57 - 74","date_published":"1993-02-01T00:00:00Z","scopus_import":"1","publication_identifier":{"issn":["0016-6723"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","day":"01","oa_version":"None","type":"journal_article","date_updated":"2022-03-30T08:18:58Z","language":[{"iso":"eng"}],"doi":"10.1017/S0016672300031098 ","volume":61,"issue":"1","publisher":"Cambridge University Press","article_type":"original","publist_id":"2739","intvolume":"        61","status":"public","month":"02","date_created":"2018-12-11T12:04:24Z","author":[{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton"},{"first_name":"Shahin","last_name":"Rouhani","full_name":"Rouhani, Shahin"}],"extern":"1","quality_controlled":"1","citation":{"apa":"Barton, N. H., &#38; Rouhani, S. (1993). Adaptation and the “shifting balance.” <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672300031098 \">https://doi.org/10.1017/S0016672300031098 </a>","mla":"Barton, Nicholas H., and Shahin Rouhani. “Adaptation and the ‘Shifting Balance.’” <i>Genetical Research</i>, vol. 61, no. 1, Cambridge University Press, 1993, pp. 57–74, doi:<a href=\"https://doi.org/10.1017/S0016672300031098 \">10.1017/S0016672300031098 </a>.","short":"N.H. Barton, S. Rouhani, Genetical Research 61 (1993) 57–74.","chicago":"Barton, Nicholas H, and Shahin Rouhani. “Adaptation and the ‘Shifting Balance.’” <i>Genetical Research</i>. Cambridge University Press, 1993. <a href=\"https://doi.org/10.1017/S0016672300031098 \">https://doi.org/10.1017/S0016672300031098 </a>.","ista":"Barton NH, Rouhani S. 1993. Adaptation and the ‘shifting balance’. Genetical Research. 61(1), 57–74.","ama":"Barton NH, Rouhani S. Adaptation and the “shifting balance.” <i>Genetical Research</i>. 1993;61(1):57-74. doi:<a href=\"https://doi.org/10.1017/S0016672300031098 \">10.1017/S0016672300031098 </a>","ieee":"N. H. Barton and S. Rouhani, “Adaptation and the ‘shifting balance,’” <i>Genetical Research</i>, vol. 61, no. 1. Cambridge University Press, pp. 57–74, 1993."},"main_file_link":[{"url":"https://www.cambridge.org/core/journals/genetics-research/article/adaptation-and-the-shifting-balance/2E15452B3AFCA97E77743E0C7E108064"}],"year":"1993","_id":"3644","publication":"Genetical Research","title":"Adaptation and the 'shifting balance'","abstract":[{"text":"Wright proposed that there is a ' shifting balance' between selection within demes, random drift, and selection between demes at different 'adaptive peaks'. We investigate the establishment and spread of new adaptive peaks, considering a chromosome rearrangement, and a polygenic character under disruptive selection. When the number of migrants (Nm) is small, demes fluctuate independently, with a bias towards the fitter peak. When Nm is large, the whole population can\r\nmove to one of two stable equilibria, and so can be trapped near the lower peak. These two regimes are separated by a sharp transition at a critical Nm of order 1. Just below this critical point, adaptation is most efficient, since the shifting balance greatly increases the proportion of demes that reach the global optimum. This is so even if one peak is only slightly fitter than the other (AWx \\/N), and for both strong and weak selection (Ns <§ 1 or Ns > 1). Provided that Nm\r\nvaries sufficiently gradually from place to place, the fitter peak can be established in regions where Nm « 1, and can then spread through the rest of the range. Our analysis confirms Wright's argument that if selection, migration and drift are of the same order, the ' shifting balance' leads to efficient evolution towards the global optimum.","lang":"eng"}],"publication_status":"published"},{"publication":"SIAM Journal on Computing","title":"Computing a face in an arrangement of line segments and related problems","_id":"4036","abstract":[{"lang":"eng","text":"This paper presents a randomized incremental algorithm for computing a single face in an arrangement of n line segments in the plane that is fairly simple to implement. The expected running time of the algorithm is O(nα(n)log n). The analysis of the algorithm uses a novel approach that generalizes and extends the Clarkson-Shor analysis technique [in Discrete Comput. Geom., 4(1989), pp. 387-421]. A few extensions of the technique, obtaining efficient randomized incremental algorithms for constructing the entire arrangement of a collection of line segments and for computing a single face in an arrangement of Jordan arcs are also presented."}],"publication_status":"published","citation":{"ista":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. 1993. Computing a face in an arrangement of line segments and related problems. SIAM Journal on Computing. 22(6), 1286–1302.","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jack Snoeyink. “Computing a Face in an Arrangement of Line Segments and Related Problems.” <i>SIAM Journal on Computing</i>. SIAM, 1993. <a href=\"https://doi.org/10.1137/0222077 \">https://doi.org/10.1137/0222077 </a>.","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Snoeyink, SIAM Journal on Computing 22 (1993) 1286–1302.","ieee":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink, “Computing a face in an arrangement of line segments and related problems,” <i>SIAM Journal on Computing</i>, vol. 22, no. 6. SIAM, pp. 1286–1302, 1993.","ama":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. Computing a face in an arrangement of line segments and related problems. <i>SIAM Journal on Computing</i>. 1993;22(6):1286-1302. doi:<a href=\"https://doi.org/10.1137/0222077 \">10.1137/0222077 </a>","mla":"Chazelle, Bernard, et al. “Computing a Face in an Arrangement of Line Segments and Related Problems.” <i>SIAM Journal on Computing</i>, vol. 22, no. 6, SIAM, 1993, pp. 1286–302, doi:<a href=\"https://doi.org/10.1137/0222077 \">10.1137/0222077 </a>.","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &#38; Snoeyink, J. (1993). Computing a face in an arrangement of line segments and related problems. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0222077 \">https://doi.org/10.1137/0222077 </a>"},"main_file_link":[{"url":"https://epubs.siam.org/doi/10.1137/0222077"}],"quality_controlled":"1","extern":"1","author":[{"last_name":"Chazelle","first_name":"Bernard","full_name":"Chazelle, Bernard"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"},{"full_name":"Sharir, Micha","last_name":"Sharir","first_name":"Micha"},{"last_name":"Snoeyink","first_name":"Jack","full_name":"Snoeyink, Jack"}],"year":"1993","intvolume":"        22","publist_id":"2087","month":"12","date_created":"2018-12-11T12:06:34Z","status":"public","volume":22,"issue":"6","article_type":"original","publisher":"SIAM","language":[{"iso":"eng"}],"doi":"10.1137/0222077 ","acknowledgement":"The authors wish to express their gratitude for the generous support and hospitality of the DEC Palo Alto Systems Research Center.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","oa_version":"None","date_updated":"2022-03-30T08:07:21Z","type":"journal_article","day":"01","scopus_import":"1","publication_identifier":{"issn":["0097-5397"]},"date_published":"1993-12-01T00:00:00Z","page":"1286 - 1302"},{"date_updated":"2022-03-28T14:58:16Z","type":"journal_article","oa_version":"None","day":"01","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","acknowledgement":"Research of the first author is supported by the National Science Foundation under Grant CCR-8921421 and under the Alan T. Waterman award, Grant CCR-9118874. Any opinions, findings, 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. Work of the second author was conducted while he was on study leave at the University of Illinois. ","language":[{"iso":"eng"}],"doi":"10.1007/BF02573974","date_published":"1993-12-01T00:00:00Z","page":"197 - 213","publication_identifier":{"issn":["0179-5376"]},"year":"1993","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02573974"}],"citation":{"apa":"Edelsbrunner, H., &#38; Tan, T. (1993). An upper bound for conforming Delaunay triangulations. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02573974\">https://doi.org/10.1007/BF02573974</a>","mla":"Edelsbrunner, Herbert, and Tiow Tan. “An Upper Bound for Conforming Delaunay Triangulations.” <i>Discrete &#38; Computational Geometry</i>, vol. 10, no. 1, Springer, 1993, pp. 197–213, doi:<a href=\"https://doi.org/10.1007/BF02573974\">10.1007/BF02573974</a>.","short":"H. Edelsbrunner, T. Tan, Discrete &#38; Computational Geometry 10 (1993) 197–213.","chicago":"Edelsbrunner, Herbert, and Tiow Tan. “An Upper Bound for Conforming Delaunay Triangulations.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1993. <a href=\"https://doi.org/10.1007/BF02573974\">https://doi.org/10.1007/BF02573974</a>.","ista":"Edelsbrunner H, Tan T. 1993. An upper bound for conforming Delaunay triangulations. Discrete &#38; Computational Geometry. 10(1), 197–213.","ama":"Edelsbrunner H, Tan T. An upper bound for conforming Delaunay triangulations. <i>Discrete &#38; Computational Geometry</i>. 1993;10(1):197-213. doi:<a href=\"https://doi.org/10.1007/BF02573974\">10.1007/BF02573974</a>","ieee":"H. Edelsbrunner and T. Tan, “An upper bound for conforming Delaunay triangulations,” <i>Discrete &#38; Computational Geometry</i>, vol. 10, no. 1. Springer, pp. 197–213, 1993."},"extern":"1","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Tan, Tiow","last_name":"Tan","first_name":"Tiow"}],"quality_controlled":"1","publication_status":"published","abstract":[{"text":"A plane geometric graph C in ℝ2 conforms to another such graph G if each edge of G is the union of some edges of C. It is proved that, for every G with n vertices and m edges, there is a completion of a Delaunay triangulation of O(m2 n) points that conforms to G. The algorithm that constructs the points is also described.","lang":"eng"}],"publication":"Discrete & Computational Geometry","title":"An upper bound for conforming Delaunay triangulations","_id":"4040","article_type":"original","publisher":"Springer","issue":"1","volume":10,"date_created":"2018-12-11T12:06:35Z","month":"12","status":"public","intvolume":"        10","publist_id":"2084"},{"date_created":"2018-12-11T12:06:35Z","month":"04","status":"public","intvolume":"        22","publist_id":"2085","article_type":"original","publisher":"SIAM","issue":"2","volume":22,"publication_status":"published","abstract":[{"text":"The zone theorem for an arrangement of n hyperplanes in d-dimensional real space says that the total number of faces bounding the cells intersected by another hyperplane is O(n(d-1)). This result is the basis of a time-optimal incremental algorithm that constructs a hyperplane arrangement and has a host of other algorithmic and combinatorial applications. Unfortunately, the original proof of the zone theorem, for d greater-than-or-equal-to 3, turned out to contain a serious and irreparable error. This paper presents a new proof of the theorem. The proof is based on an inductive argument, which also applies in the case of pseudohyperplane arrangements. The fallacies of the old proof along with some ways of partially saving that approach are briefly discussed.","lang":"eng"}],"publication":"SIAM Journal on Computing","title":"On the zone theorem for hyperplane arrangements","_id":"4041","year":"1993","citation":{"mla":"Edelsbrunner, Herbert, et al. “On the Zone Theorem for Hyperplane Arrangements.” <i>SIAM Journal on Computing</i>, vol. 22, no. 2, SIAM, 1993, pp. 418–29, doi:<a href=\"https://doi.org/10.1137/0222031\">10.1137/0222031</a>.","apa":"Edelsbrunner, H., Seidel, R., &#38; Sharir, M. (1993). On the zone theorem for hyperplane arrangements. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0222031\">https://doi.org/10.1137/0222031</a>","ista":"Edelsbrunner H, Seidel R, Sharir M. 1993. On the zone theorem for hyperplane arrangements. SIAM Journal on Computing. 22(2), 418–429.","short":"H. Edelsbrunner, R. Seidel, M. Sharir, SIAM Journal on Computing 22 (1993) 418–429.","chicago":"Edelsbrunner, Herbert, Raimund Seidel, and Micha Sharir. “On the Zone Theorem for Hyperplane Arrangements.” <i>SIAM Journal on Computing</i>. SIAM, 1993. <a href=\"https://doi.org/10.1137/0222031\">https://doi.org/10.1137/0222031</a>.","ieee":"H. Edelsbrunner, R. Seidel, and M. Sharir, “On the zone theorem for hyperplane arrangements,” <i>SIAM Journal on Computing</i>, vol. 22, no. 2. SIAM, pp. 418–429, 1993.","ama":"Edelsbrunner H, Seidel R, Sharir M. On the zone theorem for hyperplane arrangements. <i>SIAM Journal on Computing</i>. 1993;22(2):418-429. doi:<a href=\"https://doi.org/10.1137/0222031\">10.1137/0222031</a>"},"main_file_link":[{"url":"https://epubs.siam.org/doi/10.1137/0222031"}],"author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Seidel, Raimund","last_name":"Seidel","first_name":"Raimund"},{"full_name":"Sharir, Micha","last_name":"Sharir","first_name":"Micha"}],"extern":"1","quality_controlled":"1","publication_identifier":{"issn":["0097-5397"]},"scopus_import":"1","date_published":"1993-04-01T00:00:00Z","page":"418 - 429","acknowledgement":"National Science Foundation under grant CCR-89- 21421.","language":[{"iso":"eng"}],"doi":"10.1137/0222031","type":"journal_article","date_updated":"2022-03-29T13:25:02Z","oa_version":"None","day":"01","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No"},{"date_published":"1993-06-01T00:00:00Z","page":"527 - 551","scopus_import":"1","publication_identifier":{"issn":["0097-5397"]},"oa_version":"None","type":"journal_article","date_updated":"2022-03-30T07:43:13Z","day":"01","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"The authors thank an anonymous referee for suggestions on the organization of this paper.","language":[{"iso":"eng"}],"doi":"10.1137/0222036 ","publisher":"SIAM","article_type":"original","volume":22,"issue":"3","month":"06","date_created":"2018-12-11T12:06:36Z","status":"public","intvolume":"        22","publist_id":"2086","year":"1993","citation":{"mla":"Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” <i>SIAM Journal on Computing</i>, vol. 22, no. 3, SIAM, 1993, pp. 527–51, doi:<a href=\"https://doi.org/10.1137/0222036 \">10.1137/0222036 </a>.","apa":"Edelsbrunner, H., &#38; Tan, T. (1993). A quadratic time algorithm for the minmax length triangulation. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0222036 \">https://doi.org/10.1137/0222036 </a>","ista":"Edelsbrunner H, Tan T. 1993. A quadratic time algorithm for the minmax length triangulation. SIAM Journal on Computing. 22(3), 527–551.","chicago":"Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” <i>SIAM Journal on Computing</i>. SIAM, 1993. <a href=\"https://doi.org/10.1137/0222036 \">https://doi.org/10.1137/0222036 </a>.","short":"H. Edelsbrunner, T. Tan, SIAM Journal on Computing 22 (1993) 527–551.","ieee":"H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length triangulation,” <i>SIAM Journal on Computing</i>, vol. 22, no. 3. SIAM, pp. 527–551, 1993.","ama":"Edelsbrunner H, Tan T. A quadratic time algorithm for the minmax length triangulation. <i>SIAM Journal on Computing</i>. 1993;22(3):527-551. doi:<a href=\"https://doi.org/10.1137/0222036 \">10.1137/0222036 </a>"},"main_file_link":[{"url":"https://epubs.siam.org/doi/10.1137/0222036"}],"quality_controlled":"1","extern":"1","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tan","first_name":"Tiow","full_name":"Tan, Tiow"}],"abstract":[{"lang":"eng","text":"It is shown that a triangulation of a set of n points in the plane that minimizes the maximum edge length can be computed in time 0(n2). The algorithm is reasonably easy to implement and is based on the theorem that there is a triangulation with minmax edge length that contains the relative neighborhood graph of the points as a subgraph. With minor modifications the algorithm works for arbitrary normed metrics."}],"publication_status":"published","publication":"SIAM Journal on Computing","title":"A quadratic time algorithm for the minmax length triangulation","_id":"4042"},{"publist_id":"2082","intvolume":"        10","status":"public","date_created":"2018-12-11T12:06:36Z","month":"12","issue":"1","volume":10,"article_type":"original","publisher":"Springer","_id":"4044","title":"Edge insertion for optimal triangulations","publication":"Discrete & Computational Geometry","publication_status":"published","abstract":[{"text":"Edge insertion iteratively improves a triangulation of a finite point set in ℜ2 by adding a new edge, deleting old edges crossing the new edge, and retriangulating the polygonal regions on either side of the new edge. This paper presents an abstract view of the edge insertion paradigm, and then shows that it gives polynomial-time algorithms for several types of optimal triangulations, including minimizing the maximum slope of a piecewise-linear interpolating surface.","lang":"eng"}],"extern":"1","author":[{"full_name":"Bern, Marshall","last_name":"Bern","first_name":"Marshall"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"last_name":"Eppstein","first_name":"David","full_name":"Eppstein, David"},{"full_name":"Mitchell, Stephen","last_name":"Mitchell","first_name":"Stephen"},{"full_name":"Tan, Tiow","first_name":"Tiow","last_name":"Tan"}],"quality_controlled":"1","citation":{"apa":"Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., &#38; Tan, T. (1993). Edge insertion for optimal triangulations. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02573962\">https://doi.org/10.1007/BF02573962</a>","mla":"Bern, Marshall, et al. “Edge Insertion for Optimal Triangulations.” <i>Discrete &#38; Computational Geometry</i>, vol. 10, no. 1, Springer, 1993, pp. 47–65, doi:<a href=\"https://doi.org/10.1007/BF02573962\">10.1007/BF02573962</a>.","chicago":"Bern, Marshall, Herbert Edelsbrunner, David Eppstein, Stephen Mitchell, and Tiow Tan. “Edge Insertion for Optimal Triangulations.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1993. <a href=\"https://doi.org/10.1007/BF02573962\">https://doi.org/10.1007/BF02573962</a>.","short":"M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. Tan, Discrete &#38; Computational Geometry 10 (1993) 47–65.","ista":"Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1993. Edge insertion for optimal triangulations. Discrete &#38; Computational Geometry. 10(1), 47–65.","ieee":"M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan, “Edge insertion for optimal triangulations,” <i>Discrete &#38; Computational Geometry</i>, vol. 10, no. 1. Springer, pp. 47–65, 1993.","ama":"Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. Edge insertion for optimal triangulations. <i>Discrete &#38; Computational Geometry</i>. 1993;10(1):47-65. doi:<a href=\"https://doi.org/10.1007/BF02573962\">10.1007/BF02573962</a>"},"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02573962"}],"year":"1993","publication_identifier":{"issn":["0179-5376"]},"scopus_import":"1","page":"47 - 65","date_published":"1993-12-01T00:00:00Z","doi":"10.1007/BF02573962","language":[{"iso":"eng"}],"acknowledgement":"The authors thank two anonymous referees for suggestions on improving the style of this paper. The research of the second' author was supported by the National Science Foundation under Grant No. CCR-8921421 and under the Alan T. Waterman award, Grant No. CCR-9118874. Any opinions, findings, 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,\r\nand while the fifth author was on study leave at the University of Illinois. ","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","day":"01","date_updated":"2022-03-28T14:10:59Z","type":"journal_article","oa_version":"None"},{"acknowledgement":"*Work by Bernard Chazelle was supported by NSF Grant CCR-90-02352. Work by Herbert Edelsbrunner was supported by NSF Grant CCR-89-21421. Work by Leonidas Guibas and Micha Sharir was supported by a grant from the U.S.-Israeli Binational Science Foundation. Work by Micha Sharir was also supported by ONR Grant N00014-90-J-1284, by NSF Grant CCR-89-01484, and by grants from the Fund for Basic Research administered by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development.","doi":"10.1007/BF02573973","language":[{"iso":"eng"}],"day":"01","oa_version":"None","type":"journal_article","date_updated":"2022-03-28T14:50:42Z","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","scopus_import":"1","publication_identifier":{"issn":["0179-5376"]},"page":"183 - 196","date_published":"1993-12-01T00:00:00Z","abstract":[{"text":"We apply Megiddo's parametric searching technique to several geometric optimization problems and derive significantly improved solutions for them. We obtain, for any fixed ε&gt;0, an O(n1+ε) algorithm for computing the diameter of a point set in 3-space, an O(8/5+ε) algorithm for computing the width of such a set, and on O(n8/5+ε) algorithm for computing the closest pair in a set of n lines in space. All these algorithms are deterministic.","lang":"eng"}],"publication_status":"published","_id":"4045","publication":"Discrete & Computational Geometry","title":"Diameter, width, closest line pair, and parametric searching","year":"1993","extern":"1","author":[{"full_name":"Chazelle, Bernard","last_name":"Chazelle","first_name":"Bernard"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"},{"full_name":"Sharir, Micha","last_name":"Sharir","first_name":"Micha"}],"quality_controlled":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02573973"}],"citation":{"apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., &#38; Sharir, M. (1993). Diameter, width, closest line pair, and parametric searching. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02573973\">https://doi.org/10.1007/BF02573973</a>","mla":"Chazelle, Bernard, et al. “Diameter, Width, Closest Line Pair, and Parametric Searching.” <i>Discrete &#38; Computational Geometry</i>, vol. 10, no. 1, Springer, 1993, pp. 183–96, doi:<a href=\"https://doi.org/10.1007/BF02573973\">10.1007/BF02573973</a>.","ieee":"B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “Diameter, width, closest line pair, and parametric searching,” <i>Discrete &#38; Computational Geometry</i>, vol. 10, no. 1. Springer, pp. 183–196, 1993.","ama":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M. Diameter, width, closest line pair, and parametric searching. <i>Discrete &#38; Computational Geometry</i>. 1993;10(1):183-196. doi:<a href=\"https://doi.org/10.1007/BF02573973\">10.1007/BF02573973</a>","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “Diameter, Width, Closest Line Pair, and Parametric Searching.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1993. <a href=\"https://doi.org/10.1007/BF02573973\">https://doi.org/10.1007/BF02573973</a>.","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &#38; Computational Geometry 10 (1993) 183–196.","ista":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1993. Diameter, width, closest line pair, and parametric searching. Discrete &#38; Computational Geometry. 10(1), 183–196."},"status":"public","month":"12","date_created":"2018-12-11T12:06:37Z","publist_id":"2083","intvolume":"        10","publisher":"Springer","article_type":"original","volume":10,"issue":"1"},{"page":"1455 - 1464","date_published":"1993-11-01T00:00:00Z","external_id":{"pmid":["7904521 "]},"publication_identifier":{"issn":["0953-816X"]},"scopus_import":"1","day":"01","type":"journal_article","date_updated":"2022-03-28T13:33:18Z","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","doi":"10.1111/j.1460-9568.1993.tb00213.x","language":[{"iso":"eng"}],"article_type":"original","publisher":"Wiley-Blackwell","volume":5,"issue":"11","status":"public","date_created":"2018-12-11T12:07:24Z","month":"11","publist_id":"1943","intvolume":"         5","year":"1993","author":[{"first_name":"Dan","last_name":"Lindholm","full_name":"Lindholm, Dan"},{"first_name":"Georg","last_name":"Dechant","full_name":"Dechant, Georg"},{"first_name":"Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Thoenen, Hans","last_name":"Thoenen","first_name":"Hans"}],"extern":"1","quality_controlled":"1","citation":{"apa":"Lindholm, D., Dechant, G., Heisenberg, C.-P. J., &#38; Thoenen, H. (1993). Brain-derived neurotrophic factor is a survival factor for cultured rat cerebellar granule neurons and protects them against glutamate-induced neurotoxicity. <i>European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1460-9568.1993.tb00213.x\">https://doi.org/10.1111/j.1460-9568.1993.tb00213.x</a>","mla":"Lindholm, Dan, et al. “Brain-Derived Neurotrophic Factor Is a Survival Factor for Cultured Rat Cerebellar Granule Neurons and Protects Them against Glutamate-Induced Neurotoxicity.” <i>European Journal of Neuroscience</i>, vol. 5, no. 11, Wiley-Blackwell, 1993, pp. 1455–64, doi:<a href=\"https://doi.org/10.1111/j.1460-9568.1993.tb00213.x\">10.1111/j.1460-9568.1993.tb00213.x</a>.","ieee":"D. Lindholm, G. Dechant, C.-P. J. Heisenberg, and H. Thoenen, “Brain-derived neurotrophic factor is a survival factor for cultured rat cerebellar granule neurons and protects them against glutamate-induced neurotoxicity,” <i>European Journal of Neuroscience</i>, vol. 5, no. 11. Wiley-Blackwell, pp. 1455–1464, 1993.","ama":"Lindholm D, Dechant G, Heisenberg C-PJ, Thoenen H. Brain-derived neurotrophic factor is a survival factor for cultured rat cerebellar granule neurons and protects them against glutamate-induced neurotoxicity. <i>European Journal of Neuroscience</i>. 1993;5(11):1455-1464. doi:<a href=\"https://doi.org/10.1111/j.1460-9568.1993.tb00213.x\">10.1111/j.1460-9568.1993.tb00213.x</a>","short":"D. Lindholm, G. Dechant, C.-P.J. Heisenberg, H. Thoenen, European Journal of Neuroscience 5 (1993) 1455–1464.","chicago":"Lindholm, Dan, Georg Dechant, Carl-Philipp J Heisenberg, and Hans Thoenen. “Brain-Derived Neurotrophic Factor Is a Survival Factor for Cultured Rat Cerebellar Granule Neurons and Protects Them against Glutamate-Induced Neurotoxicity.” <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 1993. <a href=\"https://doi.org/10.1111/j.1460-9568.1993.tb00213.x\">https://doi.org/10.1111/j.1460-9568.1993.tb00213.x</a>.","ista":"Lindholm D, Dechant G, Heisenberg C-PJ, Thoenen H. 1993. Brain-derived neurotrophic factor is a survival factor for cultured rat cerebellar granule neurons and protects them against glutamate-induced neurotoxicity. European Journal of Neuroscience. 5(11), 1455–1464."},"main_file_link":[{"url":"https://onlinelibrary.wiley.com/doi/10.1111/j.1460-9568.1993.tb00213.x"}],"publication_status":"published","abstract":[{"lang":"eng","text":"We have studied the effects of different neurotrophins on the survival and proliferation of rat cerebellar granule cells in culture. These neurons express trkB and trkC, the putative neuronal receptors for brain-derived neurotrophic factor (BDNF) and neurotrophin-3 (NT-3) respectively. Binding studies using iodinated BDNF and NT-3 demonstrated that both BDNF and NT-3 bind to the cerebellar granule neurons with a similar affinity of approximately 2 x 10(-9) M. The number of receptors per granule cell was surprisingly high, approximately 30 x 10(-4) and 2 x 10(5) for BDNF and NT-3, respectively. Both NT-3 and BDNF elevated c-fos mRNA in the granule neurons, but only BDNF up-regulated the mRNA encoding the low-affinity neurotrophin receptor (p75). In contrast to NT-3, BDNF acted as a survival factor for the granule neurons. BDNF also induced sprouting of the granule neurons and significantly protected them against neurotoxicity induced by high (1 mM) glutamate concentrations. Cultured granule neurons also expressed low levels of BDNF mRNA which were increased by kainic acid, a glutamate receptor agonist. Thus, BDNF, but not NT-3, is a survival factor for cultured cerebellar granule neurons and activation of glutamate receptor(s) up-regulates BDNF expression in these cells."}],"_id":"4175","title":"Brain-derived neurotrophic factor is a survival factor for cultured rat cerebellar granule neurons and protects them against glutamate-induced neurotoxicity","publication":"European Journal of Neuroscience","pmid":1},{"intvolume":"       122","publist_id":"1942","month":"07","date_created":"2018-12-11T12:07:25Z","status":"public","issue":"2","volume":122,"publisher":"Rockefeller University Press","article_type":"original","pmid":1,"title":"Neurotrophin-3 induced by tri-iodothyronine in cerebellar granule cells promotes Purkinje cell differentiation","publication":"Journal of Cell Biology","_id":"4177","oa":1,"abstract":[{"text":"Thyroid hormones play an important role in brain development, but the mechanism(s) by which triiodothyronine (T3) mediates neuronal differentiation is poorly understood. Here we demonstrate that T3 regulates the neurotrophic factor, neurotrophin-3 (NT-3), in developing rat cerebellar granule cells both in cell culture and in vivo. In situ hybridization experiments showed that developing Purkinje cells do not express NT-3 mRNA but do express trkC, the putative neuronal receptor for NT-3. Addition of recombinant NT-3 to cerebellar cultures from embryonic rat brain induces hypertrophy and neurite sprouting of Purkinje cells, and upregulates the mRNA encoding the calcium-binding protein, calbindin-28 kD. The present study demonstrates a novel interaction between cerebellar granule neurons and developing Purkinje cells in which NT-3 induced by T3 in the granule cells promotes Purkinje cell differentiation.","lang":"eng"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2119654/"}],"citation":{"apa":"Lindholm, D., Castrén, E., Tsoulfas, P., Kolbeck, R., Berzaghi, M., Leingärtner, A., … Thoenen, H. (1993). Neurotrophin-3 induced by tri-iodothyronine in cerebellar granule cells promotes Purkinje cell differentiation. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.122.2.443\">https://doi.org/10.1083/jcb.122.2.443</a>","mla":"Lindholm, Dan, et al. “Neurotrophin-3 Induced by Tri-Iodothyronine in Cerebellar Granule Cells Promotes Purkinje Cell Differentiation.” <i>Journal of Cell Biology</i>, vol. 122, no. 2, Rockefeller University Press, 1993, pp. 443–50, doi:<a href=\"https://doi.org/10.1083/jcb.122.2.443\">10.1083/jcb.122.2.443</a>.","chicago":"Lindholm, Dan, Eero Castrén, Pantelis Tsoulfas, Roland Kolbeck, Maria Berzaghi, Axel Leingärtner, Carl-Philipp J Heisenberg, Lino Tesarollo, Luis Parada, and Hans Thoenen. “Neurotrophin-3 Induced by Tri-Iodothyronine in Cerebellar Granule Cells Promotes Purkinje Cell Differentiation.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 1993. <a href=\"https://doi.org/10.1083/jcb.122.2.443\">https://doi.org/10.1083/jcb.122.2.443</a>.","short":"D. Lindholm, E. Castrén, P. Tsoulfas, R. Kolbeck, M. Berzaghi, A. Leingärtner, C.-P.J. Heisenberg, L. Tesarollo, L. Parada, H. Thoenen, Journal of Cell Biology 122 (1993) 443–450.","ista":"Lindholm D, Castrén E, Tsoulfas P, Kolbeck R, Berzaghi M, Leingärtner A, Heisenberg C-PJ, Tesarollo L, Parada L, Thoenen H. 1993. Neurotrophin-3 induced by tri-iodothyronine in cerebellar granule cells promotes Purkinje cell differentiation. Journal of Cell Biology. 122(2), 443–450.","ieee":"D. Lindholm <i>et al.</i>, “Neurotrophin-3 induced by tri-iodothyronine in cerebellar granule cells promotes Purkinje cell differentiation,” <i>Journal of Cell Biology</i>, vol. 122, no. 2. Rockefeller University Press, pp. 443–450, 1993.","ama":"Lindholm D, Castrén E, Tsoulfas P, et al. Neurotrophin-3 induced by tri-iodothyronine in cerebellar granule cells promotes Purkinje cell differentiation. <i>Journal of Cell Biology</i>. 1993;122(2):443-450. doi:<a href=\"https://doi.org/10.1083/jcb.122.2.443\">10.1083/jcb.122.2.443</a>"},"quality_controlled":"1","extern":"1","author":[{"first_name":"Dan","last_name":"Lindholm","full_name":"Lindholm, Dan"},{"first_name":"Eero","last_name":"Castrén","full_name":"Castrén, Eero"},{"last_name":"Tsoulfas","first_name":"Pantelis","full_name":"Tsoulfas, Pantelis"},{"last_name":"Kolbeck","first_name":"Roland","full_name":"Kolbeck, Roland"},{"last_name":"Berzaghi","first_name":"Maria","full_name":"Berzaghi, Maria"},{"full_name":"Leingärtner, Axel","first_name":"Axel","last_name":"Leingärtner"},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566"},{"last_name":"Tesarollo","first_name":"Lino","full_name":"Tesarollo, Lino"},{"full_name":"Parada, Luis","last_name":"Parada","first_name":"Luis"},{"full_name":"Thoenen, Hans","first_name":"Hans","last_name":"Thoenen"}],"year":"1993","scopus_import":"1","publication_identifier":{"issn":["0021-9525"]},"external_id":{"pmid":["8320266"]},"date_published":"1993-07-15T00:00:00Z","page":"443 - 450","doi":"10.1083/jcb.122.2.443","language":[{"iso":"eng"}],"acknowledgement":"E. Castrtn is an Alexander von Humboldt fellow. M. Berzaghi is supported by a scholarship from CNPQ, Brasil. L. F. Parada, P. Tsoulfas, and L. Tesarollo were supported by a National Institutes of Health grant. We thank D. Stratmann and K. Angermeyer for skillful technical assistance; I. Hajjar for secretarial work and Dr. R. G~rtner for help with\r\ninducing hypothyroidism; Dr. W. Hunzieker for the calbindin-28 kD eDNA; Dr. M. Fishman for the GAP-43 eDNA; and Dr. Y.-A. Barde for critical comments.","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","date_updated":"2022-03-24T12:59:20Z","type":"journal_article","day":"15"},{"external_id":{"pmid":["8125281 "]},"date_published":"1993-01-01T00:00:00Z","page":"89 - 98","scopus_import":"1","publication_identifier":{"issn":["0016-6707"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","oa_version":"None","type":"journal_article","date_updated":"2022-06-02T10:00:56Z","day":"01","language":[{"iso":"eng"}],"doi":"10.1007/BF01435990","issue":"1-3","volume":91,"publisher":"Springer","article_type":"original","intvolume":"        91","publist_id":"1769","month":"01","date_created":"2018-12-11T12:08:07Z","status":"public","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01435990"}],"citation":{"mla":"Partridge, Linda, and Nicholas H. Barton. “Evolution of Aging: Testing the Theory Using Drosophila.” <i>Genetica</i>, vol. 91, no. 1–3, Springer, 1993, pp. 89–98, doi:<a href=\"https://doi.org/10.1007/BF01435990\">10.1007/BF01435990</a>.","apa":"Partridge, L., &#38; Barton, N. H. (1993). Evolution of aging: Testing the theory using Drosophila. <i>Genetica</i>. Springer. <a href=\"https://doi.org/10.1007/BF01435990\">https://doi.org/10.1007/BF01435990</a>","short":"L. Partridge, N.H. Barton, Genetica 91 (1993) 89–98.","chicago":"Partridge, Linda, and Nicholas H Barton. “Evolution of Aging: Testing the Theory Using Drosophila.” <i>Genetica</i>. Springer, 1993. <a href=\"https://doi.org/10.1007/BF01435990\">https://doi.org/10.1007/BF01435990</a>.","ista":"Partridge L, Barton NH. 1993. Evolution of aging: Testing the theory using Drosophila. Genetica. 91(1–3), 89–98.","ieee":"L. Partridge and N. H. Barton, “Evolution of aging: Testing the theory using Drosophila,” <i>Genetica</i>, vol. 91, no. 1–3. Springer, pp. 89–98, 1993.","ama":"Partridge L, Barton NH. Evolution of aging: Testing the theory using Drosophila. <i>Genetica</i>. 1993;91(1-3):89-98. doi:<a href=\"https://doi.org/10.1007/BF01435990\">10.1007/BF01435990</a>"},"quality_controlled":"1","author":[{"first_name":"Linda","last_name":"Partridge","full_name":"Partridge, Linda"},{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H"}],"extern":"1","year":"1993","pmid":1,"title":"Evolution of aging: Testing the theory using Drosophila","publication":"Genetica","_id":"4299","abstract":[{"lang":"eng","text":"Evolutionary explanations of aging (or senescence) fall into two classes. First, organisms might have evolved the optimal life history, in which survival and fertility late in life are sacrificed for the sake of early reproduction or high pre-adult survival. Second, the life history might be depressed below this optimal compromise by the influx of deleterious mutations; since selection against late-acting mutations is weaker, deleterious mutations will impose a greater load on late life. We discuss ways in which these theories might be investigated and distinguished, with reference to experimental work withDrosophila. While genetic correlations between life history traits determine the immediate response to selection, they are hard to measure, and may not reflect the fundamental constraints on life history. Long term selection experiments are more likely to be informative. The third approach of using experimental manipulations suffers from some of the same problems as measures of genetic correlations; however, these two approaches may be fruitful when used together. The experimental results so far suggest that aging inDrosophila has evolved in part as a consequence of selection for an optimal life history, and in part as a result of accumulation of predominantly late-acting deleterious mutations. Quantification of these effects presents a major challenge for the future."}],"publication_status":"published"},{"month":"03","date_created":"2018-12-11T12:08:07Z","status":"public","intvolume":"       362","publist_id":"1766","article_type":"original","publisher":"Nature Publishing Group","volume":362,"abstract":[{"text":"Evolutionary explanations of ageing fall into two classes. Organisms might have evolved the optimal life history, in which survival and fertility late in life are sacrificed for the sake of early reproduction and survival. Alternatively, the life history might be depressed below this optimal compromise by deleterious mutations: because selection against late-acting mutations is weaker, these will impose a greater load on late life. Evidence for the importance of both is emerging, and unravelling their relative importance presents experimentalists with a major challenge.","lang":"eng"}],"publication_status":"published","pmid":1,"title":"Optimality, mutation and the evolution of ageing","publication":"Nature","_id":"4300","year":"1993","main_file_link":[{"url":"https://www.nature.com/articles/362305a0"}],"citation":{"apa":"Partridge, L., &#38; Barton, N. H. (1993). Optimality, mutation and the evolution of ageing. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/362305a0\">https://doi.org/10.1038/362305a0</a>","mla":"Partridge, Linda, and Nicholas H. Barton. “Optimality, Mutation and the Evolution of Ageing.” <i>Nature</i>, vol. 362, Nature Publishing Group, 1993, pp. 305–11, doi:<a href=\"https://doi.org/10.1038/362305a0\">10.1038/362305a0</a>.","ama":"Partridge L, Barton NH. Optimality, mutation and the evolution of ageing. <i>Nature</i>. 1993;362:305-311. doi:<a href=\"https://doi.org/10.1038/362305a0\">10.1038/362305a0</a>","ieee":"L. Partridge and N. H. Barton, “Optimality, mutation and the evolution of ageing,” <i>Nature</i>, vol. 362. Nature Publishing Group, pp. 305–311, 1993.","chicago":"Partridge, Linda, and Nicholas H Barton. “Optimality, Mutation and the Evolution of Ageing.” <i>Nature</i>. Nature Publishing Group, 1993. <a href=\"https://doi.org/10.1038/362305a0\">https://doi.org/10.1038/362305a0</a>.","short":"L. Partridge, N.H. Barton, Nature 362 (1993) 305–311.","ista":"Partridge L, Barton NH. 1993. Optimality, mutation and the evolution of ageing. Nature. 362, 305–311."},"extern":"1","author":[{"first_name":"Linda","last_name":"Partridge","full_name":"Partridge, Linda"},{"last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"}],"quality_controlled":"1","publication_identifier":{"issn":["0028-0836"]},"external_id":{"pmid":["8455716"]},"date_published":"1993-03-25T00:00:00Z","page":"305 - 311","acknowledgement":"We thank B. Charlesworth, T. Chapman. K. Dawson, K. S. Gale. P. Harvey. A. Kondrashov. J. Maynard Smith, M. J. Morgan, M. Slatkin and M. Turell/ for helpful comments and C. Roper for providing the data for Fig. 1. Our work was supported by grants from the NERC and SERC and by the Darwin Trust of Edinburgh.","doi":"10.1038/362305a0","language":[{"iso":"eng"}],"oa_version":"None","date_updated":"2022-03-24T12:22:38Z","type":"journal_article","day":"25","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"editor":[{"full_name":"Harrison, Richard","last_name":"Harrison","first_name":"Richard"}],"publisher":"Oxford University Press","page":"13 - 45","date_published":"1993-01-01T00:00:00Z","status":"public","month":"01","date_created":"2018-12-11T12:08:08Z","publication_identifier":{"isbn":[" 0-19-506917-X"]},"publist_id":"1764","year":"1993","day":"01","oa_version":"None","date_updated":"2022-03-24T10:36:10Z","type":"book_chapter","extern":"1","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"},{"full_name":"Gale, Katherine","last_name":"Gale","first_name":"Katherine"}],"main_file_link":[{"url":"https://books.google.at/books?hl=en&lr=&id=aFJFkVKskYIC&oi=fnd&pg=PA13&ots=MFf0ehNeKK&sig=Yp6VrwzCJRB-v-iOhI7WZw-xf8w&redir_esc=y#v=onepage&q&f=false"}],"citation":{"mla":"Barton, Nicholas H., and Katherine Gale. “Genetic Analysis of Hybrid Zones.” <i>Hybrid Zones and the Evolutionary Process</i>, edited by Richard Harrison, Oxford University Press, 1993, pp. 13–45, doi:<a href=\"https://doi.org/10.1046/j.1420-9101.1994.7050631.x\">10.1046/j.1420-9101.1994.7050631.x</a>.","apa":"Barton, N. H., &#38; Gale, K. (1993). Genetic analysis of hybrid zones. In R. Harrison (Ed.), <i>Hybrid zones and the evolutionary process</i> (pp. 13–45). Oxford University Press. <a href=\"https://doi.org/10.1046/j.1420-9101.1994.7050631.x\">https://doi.org/10.1046/j.1420-9101.1994.7050631.x</a>","ama":"Barton NH, Gale K. Genetic analysis of hybrid zones. In: Harrison R, ed. <i>Hybrid Zones and the Evolutionary Process</i>. Oxford University Press; 1993:13-45. doi:<a href=\"https://doi.org/10.1046/j.1420-9101.1994.7050631.x\">10.1046/j.1420-9101.1994.7050631.x</a>","ieee":"N. H. Barton and K. Gale, “Genetic analysis of hybrid zones,” in <i>Hybrid zones and the evolutionary process</i>, R. Harrison, Ed. Oxford University Press, 1993, pp. 13–45.","ista":"Barton NH, Gale K. 1993.Genetic analysis of hybrid zones. In: Hybrid zones and the evolutionary process. , 13–45.","chicago":"Barton, Nicholas H, and Katherine Gale. “Genetic Analysis of Hybrid Zones.” In <i>Hybrid Zones and the Evolutionary Process</i>, edited by Richard Harrison, 13–45. Oxford University Press, 1993. <a href=\"https://doi.org/10.1046/j.1420-9101.1994.7050631.x\">https://doi.org/10.1046/j.1420-9101.1994.7050631.x</a>.","short":"N.H. Barton, K. Gale, in:, R. Harrison (Ed.), Hybrid Zones and the Evolutionary Process, Oxford University Press, 1993, pp. 13–45."},"publication_status":"published","_id":"4301","language":[{"iso":"eng"}],"doi":"10.1046/j.1420-9101.1994.7050631.x","title":"Genetic analysis of hybrid zones","publication":"Hybrid zones and the evolutionary process"},{"publication_identifier":{"issn":["0016-6723"]},"publist_id":"1763","intvolume":"        62","status":"public","month":"01","date_created":"2018-12-11T12:08:08Z","page":"77 - 85","issue":"1","volume":62,"date_published":"1993-01-01T00:00:00Z","publisher":"Cambridge University Press","_id":"4302","doi":"10.1017/S001667230003158X ","language":[{"iso":"eng"}],"publication":"Genetical Research","title":"Review of &quot;The causes of molecular evolution&quot; by J.H. Gillespie","publication_status":"published","author":[{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H"}],"article_processing_charge":"No","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","main_file_link":[{"url":"https://www.cambridge.org/core/journals/genetics-research/article/causes-of-molecular-evolution-by-john-h-gillespie-oxford-university-press-1992-336-pages-price-2500-isbn-0-19-506883-1/FF2B56D0B883F340BEC4E3C068F89F6C"}],"citation":{"mla":"Barton, Nicholas H. “Review of &#38;quot;The Causes of Molecular Evolution&#38;quot; by J.H. Gillespie.” <i>Genetical Research</i>, vol. 62, no. 1, Cambridge University Press, 1993, pp. 77–85, doi:<a href=\"https://doi.org/10.1017/S001667230003158X \">10.1017/S001667230003158X </a>.","apa":"Barton, N. H. (1993). Review of &#38;quot;The causes of molecular evolution&#38;quot; by J.H. Gillespie. <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S001667230003158X \">https://doi.org/10.1017/S001667230003158X </a>","ama":"Barton NH. Review of &#38;quot;The causes of molecular evolution&#38;quot; by J.H. Gillespie. <i>Genetical Research</i>. 1993;62(1):77-85. doi:<a href=\"https://doi.org/10.1017/S001667230003158X \">10.1017/S001667230003158X </a>","ieee":"N. H. Barton, “Review of &#38;quot;The causes of molecular evolution&#38;quot; by J.H. Gillespie,” <i>Genetical Research</i>, vol. 62, no. 1. Cambridge University Press, pp. 77–85, 1993.","short":"N.H. Barton, Genetical Research 62 (1993) 77–85.","chicago":"Barton, Nicholas H. “Review of &#38;quot;The Causes of Molecular Evolution&#38;quot; by J.H. Gillespie.” <i>Genetical Research</i>. Cambridge University Press, 1993. <a href=\"https://doi.org/10.1017/S001667230003158X \">https://doi.org/10.1017/S001667230003158X </a>.","ista":"Barton NH. 1993. Review of &#38;quot;The causes of molecular evolution&#38;quot; by J.H. Gillespie. Genetical Research. 62(1), 77–85."},"year":"1993","day":"01","oa_version":"None","date_updated":"2022-03-23T16:05:31Z","type":"review"},{"main_file_link":[{"open_access":"1","url":"https://www.cambridge.org/core/journals/genetics-research/article/probability-of-fixation-of-a-favoured-allele-in-a-subdivided-population/3257B4AEC7044AFE40436C2DC15FBC4C#article"}],"citation":{"short":"N.H. Barton, Genetics Research 62 (1993) 149–158.","chicago":"Barton, Nicholas H. “The Probability of Fixation of a Favoured Allele in a Subdivided Population.” <i>Genetics Research</i>. Cambridge University Press, 1993. <a href=\"https://doi.org/10.1017/S0016672300031748\">https://doi.org/10.1017/S0016672300031748</a>.","ista":"Barton NH. 1993. The probability of fixation of a favoured allele in a subdivided population. Genetics Research. 62(2), 149–158.","ama":"Barton NH. The probability of fixation of a favoured allele in a subdivided population. <i>Genetics Research</i>. 1993;62(2):149-158. doi:<a href=\"https://doi.org/10.1017/S0016672300031748\">10.1017/S0016672300031748</a>","ieee":"N. H. Barton, “The probability of fixation of a favoured allele in a subdivided population,” <i>Genetics Research</i>, vol. 62, no. 2. Cambridge University Press, pp. 149–158, 1993.","apa":"Barton, N. H. (1993). The probability of fixation of a favoured allele in a subdivided population. <i>Genetics Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672300031748\">https://doi.org/10.1017/S0016672300031748</a>","mla":"Barton, Nicholas H. “The Probability of Fixation of a Favoured Allele in a Subdivided Population.” <i>Genetics Research</i>, vol. 62, no. 2, Cambridge University Press, 1993, pp. 149–58, doi:<a href=\"https://doi.org/10.1017/S0016672300031748\">10.1017/S0016672300031748</a>."},"author":[{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"}],"extern":"1","quality_controlled":"1","year":"1993","title":"The probability of fixation of a favoured allele in a subdivided population","publication":"Genetics Research","_id":"4303","oa":1,"abstract":[{"text":"In a stably subdivided population with symmetric migration, the chance that a favoured allele will be fixed is independent of population structure. However, random extinction introduces an extra component of sampling drift, and reduces the probability of fixation. In this paper, the fixation probability is calculated using the diffusion approximation; comparison with exact solution of the discrete model shows this to be accurate. The key parameters are the rates of selection, migration and extinction, scaled relative to population size (S = 4Ns, M = 4Nm, Λ = 4Nλ); results apply to a haploid model, or to diploids with additive selection. If new colonies derive from many demes, the fixation probability cannot be reduced by more than half. However, if colonies are initially homogeneous, fixation probability can be much reduced. In the limit of low migration and extinction rates (M, Λ 1), it is 2s/{1 + (Λ/MS)(1 −exp(−S))}, whilst in the opposite limit (S  1), it is 4sM/{Λ(Λ + M)}. In the limit of weak selection (M, Λ  1), it is 4sM/{Λ(Λ + M)}. These factors are not the same as the reduction in effective population size (Ne/N), showing that the effects of population structure on selected alleles cannot be understood from the behaviour of neutral markers.","lang":"eng"}],"publication_status":"published","issue":"2","volume":62,"publisher":"Cambridge University Press","article_type":"original","intvolume":"        62","publist_id":"1762","month":"10","date_created":"2018-12-11T12:08:09Z","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","oa_version":"None","date_updated":"2022-03-23T15:41:32Z","type":"journal_article","day":"01","doi":"10.1017/S0016672300031748","language":[{"iso":"eng"}],"acknowledgement":"This work was supported by grants from the SERC (GR/H/09928) and NERC (GR/3/8002), and by the Darwin Trust of Edinburgh. Thanks are due to B. Nürnberger for convincing me that population structure does reduce fixation probability, to M. Whitlock for discussions on calculations of effective population size, and to W. G. Hill, P. Keightley and the anonymous referees for their comments.","date_published":"1993-10-01T00:00:00Z","page":"149 - 158","scopus_import":"1","publication_identifier":{"issn":["0016-6723"]}},{"publication_status":"published","publication":"Current Biology","title":"Why species and subspecies?","_id":"4304","language":[{"iso":"eng"}],"doi":"10.1016/0960-9822(93)90036-N","oa_version":"None","date_updated":"2022-03-23T13:19:21Z","type":"journal_article","year":"1993","day":"01","citation":{"chicago":"Barton, Nicholas H. “Why Species and Subspecies?” <i>Current Biology</i>. Cell Press, 1993. <a href=\"https://doi.org/10.1016/0960-9822(93)90036-N\">https://doi.org/10.1016/0960-9822(93)90036-N</a>.","short":"N.H. Barton, Current Biology 3 (1993) 797–799.","ista":"Barton NH. 1993. Why species and subspecies? Current Biology. 3(11), 797–799.","ieee":"N. H. Barton, “Why species and subspecies?,” <i>Current Biology</i>, vol. 3, no. 11. Cell Press, pp. 797–799, 1993.","ama":"Barton NH. Why species and subspecies? <i>Current Biology</i>. 1993;3(11):797-799. doi:<a href=\"https://doi.org/10.1016/0960-9822(93)90036-N\">10.1016/0960-9822(93)90036-N</a>","mla":"Barton, Nicholas H. “Why Species and Subspecies?” <i>Current Biology</i>, vol. 3, no. 11, Cell Press, 1993, pp. 797–99, doi:<a href=\"https://doi.org/10.1016/0960-9822(93)90036-N\">10.1016/0960-9822(93)90036-N</a>.","apa":"Barton, N. H. (1993). Why species and subspecies? <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/0960-9822(93)90036-N\">https://doi.org/10.1016/0960-9822(93)90036-N</a>"},"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/096098229390036N?via%3Dihub"}],"extern":"1","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","author":[{"last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"month":"11","date_created":"2018-12-11T12:08:09Z","status":"public","intvolume":"         3","publication_identifier":{"issn":["0960-9822"]},"publist_id":"1761","article_type":"letter_note","publisher":"Cell Press","date_published":"1993-11-01T00:00:00Z","volume":3,"issue":"11","page":"797 - 799"},{"article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","type":"conference","date_updated":"2022-03-23T13:13:46Z","day":"01","language":[{"iso":"eng"}],"doi":"10.1007/3-540-57318-6_24","acknowledgement":"This research was supported in part by the National Science Foundation under grants CCR-92-00794 and CCR-92-23226, by the Defense Advanced Research Projects Agency under contract NAG2-703, by the United States Air Force Office of Scientific Research under contracts F49620-93-1-0056 and F49620-93-1-0139, and by the European Community ESPRIT Basic Research Action Project 6021 (REACT).","date_published":"1993-01-01T00:00:00Z","page":"60 - 76","alternative_title":["LNCS"],"publication_identifier":{"isbn":["978-3-540-57318-0"]},"citation":{"mla":"Henzinger, Thomas A., et al. “Towards Refining Temporal Specifications into Hybrid Systems.” <i>International Hybrid Systems Workshop</i>, edited by Robert Grossman et al., vol. 736, Springer, 1993, pp. 60–76, doi:<a href=\"https://doi.org/10.1007/3-540-57318-6_24\">10.1007/3-540-57318-6_24</a>.","apa":"Henzinger, T. A., Manna, Z., &#38; Pnueli, A. (1993). Towards refining temporal specifications into hybrid systems. In R. Grossman, A. Nerode, A. Ravn, &#38; H. Rischel (Eds.), <i>International Hybrid Systems Workshop</i> (Vol. 736, pp. 60–76). Springer. <a href=\"https://doi.org/10.1007/3-540-57318-6_24\">https://doi.org/10.1007/3-540-57318-6_24</a>","ista":"Henzinger TA, Manna Z, Pnueli A. 1993. Towards refining temporal specifications into hybrid systems. International Hybrid Systems Workshop. International Hybrid Systems Workshop, LNCS, vol. 736, 60–76.","chicago":"Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “Towards Refining Temporal Specifications into Hybrid Systems.” In <i>International Hybrid Systems Workshop</i>, edited by Robert Grossman, Anil Nerode, Anders Ravn, and Hans Rischel, 736:60–76. Springer, 1993. <a href=\"https://doi.org/10.1007/3-540-57318-6_24\">https://doi.org/10.1007/3-540-57318-6_24</a>.","short":"T.A. Henzinger, Z. Manna, A. Pnueli, in:, R. Grossman, A. Nerode, A. Ravn, H. Rischel (Eds.), International Hybrid Systems Workshop, Springer, 1993, pp. 60–76.","ama":"Henzinger TA, Manna Z, Pnueli A. Towards refining temporal specifications into hybrid systems. In: Grossman R, Nerode A, Ravn A, Rischel H, eds. <i>International Hybrid Systems Workshop</i>. Vol 736. Springer; 1993:60-76. doi:<a href=\"https://doi.org/10.1007/3-540-57318-6_24\">10.1007/3-540-57318-6_24</a>","ieee":"T. A. Henzinger, Z. Manna, and A. Pnueli, “Towards refining temporal specifications into hybrid systems,” in <i>International Hybrid Systems Workshop</i>, 1993, vol. 736, pp. 60–76."},"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-57318-6_24"}],"extern":"1","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Zohar","last_name":"Manna","full_name":"Manna, Zohar"},{"first_name":"Amir","last_name":"Pnueli","full_name":"Pnueli, Amir"}],"quality_controlled":"1","year":"1993","publication":"International Hybrid Systems Workshop","title":"Towards refining temporal specifications into hybrid systems","_id":"4506","abstract":[{"text":"We propose a formal framework for designing hybrid systems by stepwise refinement. Starting with a specification in hybrid temporal logic, we make successively more transitions explicit until we obtain an executable system.","lang":"eng"}],"publication_status":"published","volume":736,"editor":[{"full_name":"Grossman, Robert","last_name":"Grossman","first_name":"Robert"},{"full_name":"Nerode, Anil","first_name":"Anil","last_name":"Nerode"},{"full_name":"Ravn, Anders","last_name":"Ravn","first_name":"Anders"},{"full_name":"Rischel, Hans","last_name":"Rischel","first_name":"Hans"}],"publisher":"Springer","intvolume":"       736","publist_id":"225","month":"01","conference":{"name":"International Hybrid Systems Workshop"},"date_created":"2018-12-11T12:09:12Z","status":"public"},{"month":"05","date_created":"2018-12-11T12:09:38Z","status":"public","intvolume":"       104","publist_id":"116","article_type":"original","publisher":"Elsevier","volume":104,"issue":"1","abstract":[{"text":"The theory of the natural numbers with linear order and monadic predicates underlies propositional linear temporal logic. To study temporal logics that are suitable for reasoning about real-time systems, we combine this classical theory of infinite state sequences with a theory of discrete time, via a monotonic function that maps every state to its time. The resulting theory of timed state sequences is shown to be decidable, albeit nonelementary, and its expressive power is characterized by ω-regular sets. Several more expressive variants are proved to be highly undecidable. This framework allows us to classify a wide variety of real-time logics according to their complexity and expressiveness. Indeed, it follows that most formalisms proposed in the literature cannot be decided. We are, however, able to identify two elementary real-time temporal logics as expressively complete fragments of the theory of timed state sequences, and we present tableau-based decision procedures for checking validity. Consequently, these two formalisms are well-suited for the specification and verification of real-time systems.\r\n\r\nCopyright © 1993 Academic Press. All rights reserved.","lang":"eng"}],"publication_status":"published","publication":"Information and Computation","title":"Real-time logics: Complexity and expressiveness","_id":"4589","oa":1,"year":"1993","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S0890540183710254?via%3Dihub","open_access":"1"}],"citation":{"chicago":"Alur, Rajeev, and Thomas A Henzinger. “Real-Time Logics: Complexity and Expressiveness.” <i>Information and Computation</i>. Elsevier, 1993. <a href=\"https://doi.org/10.1006/inco.1993.1025\">https://doi.org/10.1006/inco.1993.1025</a>.","short":"R. Alur, T.A. Henzinger, Information and Computation 104 (1993) 35–77.","ista":"Alur R, Henzinger TA. 1993. Real-time logics: Complexity and expressiveness. Information and Computation. 104(1), 35–77.","ieee":"R. Alur and T. A. Henzinger, “Real-time logics: Complexity and expressiveness,” <i>Information and Computation</i>, vol. 104, no. 1. Elsevier, pp. 35–77, 1993.","ama":"Alur R, Henzinger TA. Real-time logics: Complexity and expressiveness. <i>Information and Computation</i>. 1993;104(1):35-77. doi:<a href=\"https://doi.org/10.1006/inco.1993.1025\">10.1006/inco.1993.1025</a>","mla":"Alur, Rajeev, and Thomas A. Henzinger. “Real-Time Logics: Complexity and Expressiveness.” <i>Information and Computation</i>, vol. 104, no. 1, Elsevier, 1993, pp. 35–77, doi:<a href=\"https://doi.org/10.1006/inco.1993.1025\">10.1006/inco.1993.1025</a>.","apa":"Alur, R., &#38; Henzinger, T. A. (1993). Real-time logics: Complexity and expressiveness. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1006/inco.1993.1025\">https://doi.org/10.1006/inco.1993.1025</a>"},"quality_controlled":"1","extern":"1","author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"scopus_import":"1","publication_identifier":{"eissn":["0890-5401"]},"date_published":"1993-05-01T00:00:00Z","page":"35 - 77","acknowledgement":"We thank David Dill, Zohar Manna, and Amir Pnueli for helpful discussion.","doi":"10.1006/inco.1993.1025","language":[{"iso":"eng"}],"oa_version":"Published Version","date_updated":"2022-03-23T13:08:27Z","type":"journal_article","day":"01","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"}]