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.
7036 Publications
1990 |Published| Journal Article | IST-REx-ID: 2721
Erdös, L., & Tuyen, D. (1990). Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier. Journal of Statistical Physics. Springer. https://doi.org/10.1007/BF01334766
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 3650 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Mallet, J., Barton, N. H., Lamas, G., Santisteban, J., Muedas, M., & Eeley, H. (1990). Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones. Genetics. Genetics Society of America. https://doi.org/10.1093/genetics/124.4.921
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
1990 |Published| Journal Article | IST-REx-ID: 3649
Turelli, M., & Barton, N. H. (1990). Dynamics of polygenic characters under selection. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/0040-5809(90)90002-D
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 3651 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Barton, N. H. (1990). Pleiotropic models of quantitative variation. Genetics. Genetics Society of America. https://doi.org/10.1093/genetics/124.3.773
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
1990 |Published| Conference Paper | IST-REx-ID: 4067
Edelsbrunner, H., & Sharir, M. (1990). A hyperplane Incidence problem with applications to counting distances. In Proceedings of the International Symposium on Algorithms (Vol. 450, pp. 419–428). Tokyo, Japan: Springer. https://doi.org/10.1007/3-540-52921-7_91
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4066
Edelsbrunner, H., Guibas, L., & Sharir, M. (1990). The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187785
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4072
Edelsbrunner, H., Guibas, L., & Sharir, M. (1990). The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187784
View
| DOI
| Download None (ext.)
1990 |Published| Conference Paper | IST-REx-ID: 4073
Chazelle, B., Edelsbrunner, H., Guibas, L., Pollack, R., Seidel, R., Sharir, M., & Snoeyink, J. (1990). Counting and cutting cycles of lines and rods in space. In 31st Annual Symposium on Foundations of Computer Science (pp. 242–251). St. Louis, MO, United States of America: IEEE. https://doi.org/10.1109/FSCS.1990.89543
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4070
Edelsbrunner, H., Overmars, M., Welzl, E., Hartman, I., & Feldman, J. (1990). Ranking intervals under visibility constraints. International Journal of Computer Mathematics. Taylor & Francis. https://doi.org/10.1080/00207169008803871
View
| DOI
| Download None (ext.)
1990 |Published| Conference Paper | IST-REx-ID: 4071
Edelsbrunner, H., Tan, T., & Waupotitsch, R. (1990). An O(n^2log n) time algorithm for the MinMax angle triangulation. In Proceedings of the 6th annual symposium on Computational geometry (pp. 44–52). Berkley, CA, United States: ACM. https://doi.org/10.1145/98524.98535
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4068
Edelsbrunner, H., & Sharir, M. (1990). The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187778
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4069
Edelsbrunner, H. (1990). An acyclicity theorem for cell complexes in d dimension. Combinatorica. Springer. https://doi.org/10.1007/BF02122779
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 3467 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Bräu, M., Dreyer, F., Jonas, P. M., Repp, H., & Vogel, W. (1990). A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. Journal of Physiology. Wiley-Blackwell. https://doi.org/10.1113/jphysiol.1990.sp017918
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1990 |Published| Book Chapter | IST-REx-ID: 3565
Dobkin, D., Edelsbrunner, H., & Yap, C. (1990). Probing convex polytopes. In I. Cox & G. Wilfong (Eds.), Autonomous Robot Vehicles (pp. 328–341). Springer. https://doi.org/10.1007/978-1-4613-8997-2_25
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4064
Edelsbrunner, H., & Souvaine, D. (1990). Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. American Statistical Association. https://doi.org/10.1080/01621459.1990.10475313
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4063
Edelsbrunner, H., & Mücke, E. (1990). Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/77635.77639
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4060 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Edelsbrunner, H., Preparata, F., & West, D. (1990). Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. Elsevier. https://doi.org/10.1016/S0747-7171(08)80068-5
[Published Version]
View
| DOI
| Download Published Version (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4065
Edelsbrunner, H., Robison, A., & Shen, X. (1990). Covering convex sets with non-overlapping polygons. Discrete Mathematics. Elsevier. https://doi.org/10.1016/0012-365X(90)90147-A
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4074
Clarkson, K., Edelsbrunner, H., Guibas, L., Sharir, M., & Welzl, E. (1990). Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187783
View
| DOI
| Download None (ext.)
1990 |Published| Conference Paper | IST-REx-ID: 4078
Chazelle, B., Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., & Sharir, M. (1990). Slimming down by adding; selecting heavily covered points. In Proceedings of the 6th annual symposium on computational geometry (pp. 116–127). Berkley, CA, United States: ACM. https://doi.org/10.1145/98524.98551
View
| DOI
| Download None (ext.)