Please note that IST 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.

31 Publications


1990 | Journal Article | IST-REx-ID: 2480
R. Shigemoto, Y. Yokota, K. Tsuchida, and S. Nakanishi, “Cloning and expression of a rat neuromedin K receptor cDNA,” Journal of Biological Chemistry, vol. 265, no. 2. American Society for Biochemistry and Molecular Biology, pp. 623–628, 1990.
View
 

1990 | Journal Article | IST-REx-ID: 2481
K. Tsuchida, R. Shigemoto, Y. Yokota, and S. Nakanishi, “Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors,” European Journal of Biochemistry, vol. 193, no. 3. Wiley-Blackwell, pp. 751–757, 1990.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 2528
T. Sugimoto et al., “Immunohistochemical study of a rat membrane protein which induces a selective potassium permeation: Its localization in the apical membrane portion of epithelial cells,” Journal of Membrane Biology, vol. 113, no. 1. Springer, pp. 39–47, 1990.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 2721
L. Erdös and D. Tuyen, “Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier,” Journal of Statistical Physics, vol. 59, no. 5–6. Springer, pp. 1589–1602, 1990.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4060
H. Edelsbrunner, F. Preparata, and D. West, “Tetrahedrizing point sets in three dimensions,” Journal of Symbolic Computation, vol. 10, no. 3–4. Elsevier, pp. 335–347, 1990.
View | DOI | Download (ext.)
 

1990 | Journal Article | IST-REx-ID: 4063
H. Edelsbrunner and E. Mücke, “Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms,” ACM Transactions on Graphics, vol. 9, no. 1. ACM, pp. 66–104, 1990.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4064
H. Edelsbrunner and D. 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, pp. 115–119, 1990.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4065
H. Edelsbrunner, A. Robison, and X. Shen, “Covering convex sets with non-overlapping polygons,” Discrete Mathematics, vol. 81, no. 2. Elsevier, pp. 153–164, 1990.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4066
H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity of many cells in arrangements of planes and related problems,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 197–216, 1990.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4067
H. Edelsbrunner and M. Sharir, “A hyperplane Incidence problem with applications to counting distances,” presented at the SIGAL:  Special Interest Group on Algorithms, International Symposium on Algorithms  , 1990, vol. 450, pp. 419–428.
View | DOI
 

1990 | 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
 

1990 | 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
 

1990 | 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
 

1990 | 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,” presented at the SCG: Symposium on Computational Geometry, 1990, pp. 44–52.
View | DOI
 

1990 | 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
 

1990 | Conference Paper | IST-REx-ID: 4073
B. Chazelle et al., “Counting and cutting cycles of lines and rods in space,” presented at the FOCS: Foundations of Computer Science, 1990, pp. 242–251.
View | DOI
 

1990 | 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
 

1990 | 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
 

1990 | Conference Paper | IST-REx-ID: 4076
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “ Euclidean minimum spanning trees and bichromatic closest pairs,” presented at the SCG: Symposium on Computational Geometry, 1990, pp. 203–210.
View | DOI
 

1990 | 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,” presented at the SCG: Symposium on Computational Geometry, 1990, pp. 112–115.
View | DOI
 

Filters and Search Terms

year=1990

Search

Filter Publications