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ászló, and Dao Tuyen. “Ergodic Properties of the Multidimensional Rayleigh Gas with a Semipermeable Barrier.” Journal of Statistical Physics, vol. 59, no. 5–6, Springer, 1990, pp. 1589–602, doi: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, James, et al. “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, 1990, pp. 921–36, doi: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, Michael, and Nicholas H. Barton. “Dynamics of Polygenic Characters under Selection.” Theoretical Population Biology, vol. 38, no. 1, Academic Press, 1990, pp. 1–57, doi: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, Nicholas H. “Pleiotropic Models of Quantitative Variation.” Genetics, vol. 124, no. 3, Genetics Society of America, 1990, pp. 773–82, doi: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, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.” Proceedings of the International Symposium on Algorithms, vol. 450, Springer, 1990, pp. 419–28, doi:10.1007/3-540-52921-7_91.
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4066
Edelsbrunner, Herbert, et al. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 197–216, doi:10.1007/BF02187785.
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4072
Edelsbrunner, Herbert, et al. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 161–96, doi:10.1007/BF02187784.
View
| DOI
| Download None (ext.)
1990 |Published| Conference Paper | IST-REx-ID: 4073
Chazelle, Bernard, et al. “Counting and Cutting Cycles of Lines and Rods in Space.” 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 242–51, doi:10.1109/FSCS.1990.89543.
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4070
Edelsbrunner, Herbert, et al. “Ranking Intervals under Visibility Constraints.” International Journal of Computer Mathematics, vol. 34, no. 3–4, Taylor & Francis, 1990, pp. 129–44, doi:10.1080/00207169008803871.
View
| DOI
| Download None (ext.)
1990 |Published| Conference Paper | IST-REx-ID: 4071
Edelsbrunner, Herbert, et al. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.” Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52, doi:10.1145/98524.98535.
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4068
Edelsbrunner, Herbert, and Micha 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, 1990, pp. 35–42, doi:10.1007/BF02187778.
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4069
Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” Combinatorica, vol. 10, no. 3, Springer, 1990, pp. 251–60, doi: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, Michael, et al. “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, 1990, pp. 365–85, doi:10.1113/jphysiol.1990.sp017918.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1990 |Published| Book Chapter | IST-REx-ID: 3565
Dobkin, David, et al. “Probing Convex Polytopes.” Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong, Springer, 1990, pp. 328–41, doi:10.1007/978-1-4613-8997-2_25.
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4064
Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.” Journal of the American Statistical Association, vol. 85, no. 409, American Statistical Association, 1990, pp. 115–19, doi:10.1080/01621459.1990.10475313.
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4063
Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.” ACM Transactions on Graphics, vol. 9, no. 1, ACM, 1990, pp. 66–104, doi: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, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” Journal of Symbolic Computation, vol. 10, no. 3–4, Elsevier, 1990, pp. 335–47, doi:10.1016/S0747-7171(08)80068-5.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4065
Edelsbrunner, Herbert, et al. “Covering Convex Sets with Non-Overlapping Polygons.” Discrete Mathematics, vol. 81, no. 2, Elsevier, 1990, pp. 153–64, doi:10.1016/0012-365X(90)90147-A.
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4074
Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:10.1007/BF02187783.
View
| DOI
| Download None (ext.)
1990 |Published| Conference Paper | IST-REx-ID: 4078
Chazelle, Bernard, et al. “Slimming down by Adding; Selecting Heavily Covered Points.” Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 116–27, doi:10.1145/98524.98551.
View
| DOI
| Download None (ext.)