Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
9789 Publications
1990 | Published | Journal Article | IST-REx-ID: 4068
H. Edelsbrunner and M. Sharir, “The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 35–42, 1990.
View
| DOI
| Download None (ext.)
1990 | Published | Journal Article | IST-REx-ID: 4069
H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” Combinatorica, vol. 10, no. 3. Springer, pp. 251–260, 1990.
View
| DOI
| Download None (ext.)
1990 | Published | Journal Article | IST-REx-ID: 4070
H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, and J. Feldman, “Ranking intervals under visibility constraints,” International Journal of Computer Mathematics, vol. 34, no. 3–4. Taylor & Francis, pp. 129–144, 1990.
View
| DOI
| Download None (ext.)
1990 | Published | Conference Paper | IST-REx-ID: 4071
H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2log n) time algorithm for the MinMax angle triangulation,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 44–52.
View
| DOI
| Download None (ext.)
1990 | Published | Journal Article | IST-REx-ID: 4072
H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity and construction of many faces in arrangements of lines and of segments,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 161–196, 1990.
View
| DOI
| Download None (ext.)
1990 | Published | Conference Paper | IST-REx-ID: 4073
B. Chazelle et al., “Counting and cutting cycles of lines and rods in space,” in 31st Annual Symposium on Foundations of Computer Science, St. Louis, MO, United States of America, 1990, pp. 242–251.
View
| DOI
| Download None (ext.)
1990 | Published | Journal Article | IST-REx-ID: 4074
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, “Combinatorial complexity bounds for arrangements of curves and spheres,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 99–160, 1990.
View
| DOI
| Download None (ext.)
1990 | Published | Journal Article | IST-REx-ID: 4075
D. Dobkin, H. Edelsbrunner, and M. Overmars, “Searching for empty convex polygons,” Algorithmica, vol. 5, no. 4. Springer, pp. 561–571, 1990.
View
| DOI
| Download None (ext.)
1990 | Published | Conference Paper | IST-REx-ID: 4076
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “ Euclidean minimum spanning trees and bichromatic closest pairs,” in Proceedings of the 6th annual symposium on Computational geometry, Berkeley, CA, United States, 1990, pp. 203–210.
View
| DOI
| Download None (ext.)
1990 | Published | Conference Paper | IST-REx-ID: 4077
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 112–115.
View
| DOI
| Download None (ext.)
1990 | Published | Conference Paper | IST-REx-ID: 4078
B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, and M. Sharir, “Slimming down by adding; selecting heavily covered points,” in Proceedings of the 6th annual symposium on computational geometry, Berkley, CA, United States, 1990, pp. 116–127.
View
| DOI
| Download None (ext.)
1990 | Published | Journal Article | IST-REx-ID: 4310
N. H. Barton and S. Jones, “The language of the genes,” Nature, vol. 346. Nature Publishing Group, pp. 415–416, 1990.
View
| DOI
| Download None (ext.)
1990 | Published | Book Chapter | IST-REx-ID: 4311
N. H. Barton and A. Clark, “Population structure and processes in evolution,” in Population biology: Ecological and evolutionary viewpoints, K. Wöhrmann and S. Jain, Eds. Springer, 1990, pp. 115–174.
View
| DOI
| Download None (ext.)
1990 | Published | Conference Paper | IST-REx-ID: 4510
T. A. Henzinger, Z. Manna, and A. Pnueli, “An interleaving model for real time,” in Proceedings of the 5th Jerusalem Conference on Information Technology, Jerusalem, Israel, 1990, pp. 717–730.
View
| DOI
| Download None (ext.)
1990 | Published | Conference Paper | IST-REx-ID: 4522
T. A. Henzinger, “Half-order modal logic: How to prove real-time properties,” in Proceedings of the 9th annual ACM symposium on Principles of distributed computing, Quebec City, Canada, 1990, pp. 281–296.
View
| DOI
| Download None (ext.)
1990 | Published | Conference Paper | IST-REx-ID: 4597
R. Alur and T. A. Henzinger, “Real-time logics: Complexity and expressiveness,” in 5th Annual IEEE Symposium on Logic in Computer Science, Philadelphia, PA, USA, 1990, pp. 390–401.
View
| DOI
| Download None (ext.)
1990 | Published | Journal Article | IST-REx-ID: 3467 | 
M. Bräu, F. Dreyer, P. M. Jonas, H. Repp, and W. Vogel, “A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments,” Journal of Physiology, vol. 420. Wiley-Blackwell, pp. 365–385, 1990.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1990 | Published | Book Chapter | IST-REx-ID: 3565
D. Dobkin, H. Edelsbrunner, and C. Yap, “Probing convex polytopes,” in Autonomous Robot Vehicles, I. Cox and G. Wilfong, Eds. Springer, 1990, pp. 328–341.
View
| DOI
| Download None (ext.)
1990 | Published | Journal Article | IST-REx-ID: 3649
M. Turelli and N. H. Barton, “Dynamics of polygenic characters under selection,” Theoretical Population Biology, vol. 38, no. 1. Academic Press, pp. 1–57, 1990.
View
| DOI
| Download None (ext.)
1990 | Published | Journal Article | IST-REx-ID: 3650 |
J. Mallet, N. H. Barton, G. Lamas, J. Santisteban, M. Muedas, and H. Eeley, “Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones,” Genetics, vol. 124, no. 4. Genetics Society of America, pp. 921–936, 1990.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC