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.
1461 Publications
1992 | Journal Article | IST-REx-ID: 2535 | 
Sasai, Yoshiki, et al. “Two Mammalian Helix-Loop-Helix Factors Structurally Related to Drosophila Hairy and Enhancer of Split.” Genes and Development, vol. 6, no. 12 B, Cold Spring Harbor Laboratory Press, 1992, pp. 2620–34, doi:10.1101/gad.6.12b.2620.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
1992 | Journal Article | IST-REx-ID: 2532
Nishioka, Tatsuya, et al. “Distribution of the Glucose Transporters in Human Brain Tumors.” Cancer Research, vol. 52, no. 14, American Association for Cancer Research, 1992, pp. 3972–79.
View
| Download None (ext.)
| PubMed | Europe PMC
1992 | Journal Article | IST-REx-ID: 3470 |
Jonas, Peter M., and Bert Sakmann. “Glutamate Receptor Channels in Isolated Patches from CA1 and CA3 Pyramidal Cells of Rat Hippocampal Slices.” Journal of Physiology, vol. 455, Wiley-Blackwell, 1992, pp. 143–71, doi:10.1113/jphysiol.1992.sp019294 .
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
1992 | Journal Article | IST-REx-ID: 3471 |
Colquhoun, D., et al. “Action of Brief Pulses of Glutamate on AMPA/Kainate Receptors in Patches from Different Neurones of Rat Hippocampal Slices.” Journal of Physiology, vol. 458, Wiley-Blackwell, 1992, pp. 261–87, doi:10.1113/jphysiol.1992.sp019417.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
1992 | Journal Article | IST-REx-ID: 4043
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.
View
| DOI
| Download None (ext.)
1992 | Conference Paper | IST-REx-ID: 4505
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.
View
| DOI
| Download None (ext.)
1991 | Book Chapter | IST-REx-ID: 3567
Edelsbrunner, Herbert. “Lines in Space – A Collection of Results.” Discrete & Computational Geometry: Papers from the Dimacs Special Year, vol. 6, Springer, 1991, pp. 77–93.
View
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4051
Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.” SIAM Journal on Computing, vol. 20, no. 2, SIAM, 1991, pp. 259–69, doi:10.1137/0220016 .
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 3646
Szymura, Jacek, and Nicholas H. Barton. “The Genetic Structure of the Hybrid Zone between the Fire-Bellied Toads Bombina Bombina and B. Variegata: Comparisons between Transects and between Loci.” Evolution, vol. 45, no. 2, Wiley-Blackwell, 1991, pp. 237–61, doi:10.1111/j.1558-5646.1991.tb04400.x.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1991 | Conference Paper | IST-REx-ID: 4059
Chazelle, Bernard, et al. “Ray Shooting in Polygons Using Geodesic Triangulations.” 18th International Colloquium on Automata, Languages and Programming, vol. 510, Springer, 1991, pp. 661–73, doi:10.1007/3-540-54233-7_172.
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4061 |
Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Discrete & Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 407–22, doi:10.1007/BF02574698.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Conference Paper | IST-REx-ID: 4508
Henzinger, Thomas A., et al. “Temporal Proof Methodologies for Real-Time Systems.” Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, 1991, pp. 353–66, doi:10.1145/99583.99629.
View
| DOI
| Download None (ext.)
1990 | 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 | 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 | 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 | 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 | 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 | 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 | 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 | 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.)