@article{4068,
  abstract     = {LetS be a collection ofn convex, closed, and pairwise nonintersecting sets in the Euclidean plane labeled from 1 ton. A pair of permutations
(i1i2in−1in)(inin−1i2i1) 
is called ageometric permutation of S if there is a line that intersects all sets ofS in this order. We prove thatS can realize at most 2n–2 geometric permutations. This upper bound is tight.},
  author       = {Edelsbrunner, Herbert and Sharir, Micha},
  issn         = {1432-0444},
  journal      = {Discrete & Computational Geometry},
  number       = {1},
  pages        = {35 -- 42},
  publisher    = {Springer},
  title        = {{The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2}},
  doi          = {10.1007/BF02187778},
  volume       = {5},
  year         = {1990},
}

@article{4069,
  abstract     = {Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry.},
  author       = {Edelsbrunner, Herbert},
  issn         = {1439-6912},
  journal      = {Combinatorica},
  number       = {3},
  pages        = {251 -- 260},
  publisher    = {Springer},
  title        = {{An acyclicity theorem for cell complexes in d dimension}},
  doi          = {10.1007/BF02122779},
  volume       = {10},
  year         = {1990},
}

@article{4070,
  abstract     = {Let S be a set of n closed intervals on the x-axis. A ranking assigns to each interval, s, a distinct rank, p(s)∊ [1, 2,…,n]. We say that s can see t if p(s)<p(t) and there is a point p∊s∩t so that p∉u for all u with p(s)<p(u)<p(t). It is shown that a ranking can be found in time O(n log n) such that each interval sees at most three other intervals. It is also shown that a ranking that minimizes the average number of endpoints visible from an interval can be computed in time O(n 5/2). The results have applications to intersection problems for intervals, as well as to channel routing problems which arise in layouts of VLSI circuits.},
  author       = {Edelsbrunner, Herbert and Overmars, Mark and Welzl, Emo and Hartman, Irith and Feldman, Jack},
  issn         = {1029-0265},
  journal      = {International Journal of Computer Mathematics},
  number       = {3-4},
  pages        = {129 -- 144},
  publisher    = {Taylor & Francis},
  title        = {{Ranking intervals under visibility constraints}},
  doi          = {10.1080/00207169008803871},
  volume       = {34},
  year         = {1990},
}

@inproceedings{4071,
  abstract     = {We show that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). In the same amount of time and space we can also handle the constrained case where edges are prescribed. The algorithm iteratively improves an arbitrary initial triangulation and is fairly easy to implement.},
  author       = {Edelsbrunner, Herbert and Tan, Tiow and Waupotitsch, Roman},
  booktitle    = {Proceedings of the 6th annual symposium on Computational geometry},
  isbn         = {978-0-89791-362-1},
  location     = {Berkley, CA, United States},
  pages        = {44 -- 52},
  publisher    = {ACM},
  title        = {{An O(n^2log n) time algorithm for the MinMax angle triangulation}},
  doi          = {10.1145/98524.98535},
  year         = {1990},
}

@article{4072,
  abstract     = {We show that the total number of edges ofm faces of an arrangement ofn lines in the plane isO(m 2/3– n 2/3+2 +n) for any&gt;0. The proof takes an algorithmic approach, that is, we describe an algorithm for the calculation of thesem faces and derive the upper bound from the analysis of the algorithm. The algorithm uses randomization and its expected time complexity isO(m 2/3– n 2/3+2 logn+n logn logm). If instead of lines we have an arrangement ofn line segments, then the maximum number of edges ofm faces isO(m 2/3– n 2/3+2 +n (n) logm) for any&gt;0, where(n) is the functional inverse of Ackermann's function. We give a (randomized) algorithm that produces these faces and takes expected timeO(m 2/3– n 2/3+2 log+n(n) log2 n logm).},
  author       = {Edelsbrunner, Herbert and Guibas, Leonidas and Sharir, Micha},
  issn         = {1432-0444},
  journal      = {Discrete & Computational Geometry},
  number       = {1},
  pages        = {161 -- 196},
  publisher    = {Springer},
  title        = {{The complexity and construction of many faces in arrangements of lines and of segments}},
  doi          = {10.1007/BF02187784},
  volume       = {5},
  year         = {1990},
}

@inproceedings{4073,
  abstract     = {A number of rendering algorithms in computer graphics sort three-dimensional objects by depth and assume that there is no cycle that makes the sorting impossible. One way to resolve the problem caused by cycles is to cut the objects into smaller pieces. The problem of estimating how many such cuts are always sufficient is addressed. A few related algorithmic and combinatorial geometry problems are considered.},
  author       = {Chazelle, Bernard and Edelsbrunner, Herbert and Guibas, Leonidas and Pollack, Richard and Seidel, Raimund and Sharir, Micha and Snoeyink, Jack},
  booktitle    = {31st Annual Symposium on Foundations of Computer Science},
  isbn         = {0-8186-2082-X},
  location     = {St. Louis, MO, United States of America},
  pages        = {242 -- 251},
  publisher    = {IEEE},
  title        = {{Counting and cutting cycles of lines and rods in space}},
  doi          = {10.1109/FSCS.1990.89543},
  year         = {1990},
}

@article{4074,
  abstract     = {We present upper and lower bounds for extremal problems defined for arrangements of lines, circles, spheres, and alike. For example, we prove that the maximum number of edges boundingm cells in an arrangement ofn lines is Θ(m 2/3 n 2/3 +n), and that it isO(m 2/3 n 2/3 β(n) +n) forn unit-circles, whereβ(n) (and laterβ(m, n)) is a function that depends on the inverse of Ackermann's function and grows extremely slowly. If we replace unit-circles by circles of arbitrary radii the upper bound goes up toO(m 3/5 n 4/5 β(n) +n). The same bounds (without theβ(n)-terms) hold for the maximum sum of degrees ofm vertices. In the case of vertex degrees in arrangements of lines and of unit-circles our bounds match previous results, but our proofs are considerably simpler than the previous ones. The maximum sum of degrees ofm vertices in an arrangement ofn spheres in three dimensions isO(m 4/7 n 9/7 β(m, n) +n 2), in general, andO(m 3/4 n 3/4 β(m, n) +n) if no three spheres intersect in a common circle. The latter bound implies that the maximum number of unit-distances amongm points in three dimensions isO(m 3/2 β(m)) which improves the best previous upper bound on this problem. Applications of our results to other distance problems are also given.},
  author       = {Clarkson, Kenneth and Edelsbrunner, Herbert and Guibas, Leonidas and Sharir, Micha and Welzl, Emo},
  issn         = {1432-0444},
  journal      = {Discrete & Computational Geometry},
  number       = {1},
  pages        = {99 -- 160},
  publisher    = {Springer},
  title        = {{Combinatorial complexity bounds for arrangements of curves and spheres}},
  doi          = {10.1007/BF02187783},
  volume       = {5},
  year         = {1990},
}

@article{4075,
  abstract     = {A key problem in computational geometry is the identification of subsets of a point set having particular properties. We study this problem for the properties of convexity and emptiness. We show that finding empty triangles is related to the problem of determining pairs of vertices that see each other in a star-shaped polygon. A linear-time algorithm for this problem which is of independent interest yields an optimal algorithm for finding all empty triangles. This result is then extended to an algorithm for finding empty convex r-gons (r&gt; 3) and for determining a largest empty convex subset. Finally, extensions to higher dimensions are mentioned.},
  author       = {Dobkin, David and Edelsbrunner, Herbert and Overmars, Mark},
  issn         = {1432-0541},
  journal      = {Algorithmica},
  number       = {4},
  pages        = {561 -- 571},
  publisher    = {Springer},
  title        = {{Searching for empty convex polygons}},
  doi          = {10.1007/BF01840404},
  volume       = {5},
  year         = {1990},
}

@inproceedings{4076,
  abstract     = {We present an algorithm to compute a Euclidean minimum spanning tree of a given set S of n points in Ed in time O(Td(N, N) logd N), where Td(n, m) is the time required to compute a bichromatic closest pair among n red and m blue points in Ed. If Td(N, N) = Ω(N1+ε), for some fixed ε &gt; 0, then the running time improves to O(Td(N, N)). Furthermore, we describe a randomized algorithm to compute a bichromatic closets pair in expected time O((nm log n log m)2/3+m log2 n + n log2 m) in E3, which yields an O(N4/3log4/3 N) expected time algorithm for computing a Euclidean minimum spanning tree of N points in E3.},
  author       = {Agarwal, Pankaj and Edelsbrunner, Herbert and Schwarzkopf, Otfried and Welzl, Emo},
  booktitle    = {Proceedings of the 6th annual symposium on Computational geometry},
  isbn         = {978-0-89791-362-1},
  location     = {Berkeley, CA, United States},
  pages        = {203 -- 210},
  publisher    = {ACM},
  title        = {{ Euclidean minimum spanning trees and bichromatic closest pairs}},
  doi          = {10.1145/98524.98567},
  year         = {1990},
}

@inproceedings{4077,
  abstract     = {We prove that for any set S of n points in the plane and n3-α triangles spanned by the points of S there exists a point (not necessarily of S) contained in at least n3-3α/(512 log25 n) of the triangles. This implies that any set of n points in three - dimensional space defines at most 6.4n8/3 log5/3 n halving planes.},
  author       = {Aronov, Boris and Chazelle, Bernard and Edelsbrunner, Herbert and Guibas, Leonidas and Sharir, Micha and Wenger, Rephael},
  booktitle    = {Proceedings of the 6th annual symposium on Computational geometry},
  isbn         = {978-0-89791-362-1},
  location     = {Berkley, CA, United States},
  pages        = {112 -- 115},
  publisher    = {ACM},
  title        = {{Points and triangles in the plane and halving planes in space}},
  doi          = {10.1145/98524.98548},
  year         = {1990},
}

@inproceedings{4078,
  abstract     = {In this paper we derived combinatorial point selection results for geometric objects defined by pairs of points. In a nutshell, the results say that if many pairs of a set of n points in some fixed dimension each define a geometric object of some type, then there is a point covered by many of these objects. Based on such a result for three-dimensional spheres we show that the combinatorial size of the Delaunay triangulation of a point set in space can be reduced by adding new points. We believe that from a practical point of view this is the most important result of this paper.},
  author       = {Chazelle, Bernard and Edelsbrunner, Herbert and Guibas, Leonidas and Hershberger, John and Seidel, Raimund and Sharir, Micha},
  booktitle    = {Proceedings of the 6th annual symposium on computational geometry},
  isbn         = {978-0-89791-362-1},
  location     = {Berkley, CA, United States},
  pages        = {116 -- 127},
  publisher    = {ACM},
  title        = {{Slimming down by adding; selecting heavily covered points}},
  doi          = {10.1145/98524.98551},
  year         = {1990},
}

@article{4310,
  author       = {Barton, Nicholas H and Jones, Steve},
  issn         = {1476-4687},
  journal      = {Nature},
  pages        = {415 -- 416},
  publisher    = {Nature Publishing Group},
  title        = {{The language of the genes}},
  doi          = {10.1038/346415a0},
  volume       = {346},
  year         = {1990},
}

@inbook{4311,
  author       = {Barton, Nicholas H and Clark, A.},
  booktitle    = {Population biology: Ecological and evolutionary viewpoints},
  editor       = {Wöhrmann, Klaus and Jain, Subodh},
  isbn         = { 978-3642744761},
  pages        = {115 -- 174},
  publisher    = {Springer},
  title        = {{Population structure and processes in evolution}},
  doi          = {10.1007/978-3-642-74474-7_5},
  year         = {1990},
}

@inproceedings{4510,
  abstract     = {The interleaving model is both adequate and sufficiently abstract to allow for the practical specification and verification of many properties of concurrent systems. We incorporate real time into this model by defining the abstract notion of a real-time transition system as a conservative extension of traditional transition systems: qualitative fairness requirements are replaced (and superseded) by quantitative lower-bound and upper-bound real-time requirements for transitions.
We present proof rules to establish lower and upper real-time bounds for response properties of real-time transition systems. This proof system can be used to verify bounded-invariance and bounded-response properties, such as timely termination of shared-variables multi-process systems, whose semantics is defined in terms of real-time transition systems.},
  author       = {Henzinger, Thomas A and Manna, Zohar and Pnueli, Amir},
  booktitle    = { Proceedings of the 5th Jerusalem Conference on Information Technology},
  isbn         = {0-8186-2078-1},
  location     = {Jerusalem, Israel},
  pages        = {717 -- 730},
  publisher    = {IEEE},
  title        = {{An interleaving model for real time}},
  doi          = {10.1109/JCIT.1990.128356},
  year         = {1990},
}

@inproceedings{4522,
  abstract     = {We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These values are. however, not treated as full first-order objects: they can be accessed only by a very restricted form of quantification: the "freeze" quantifier binds a variable to the value of the current world. We present a complete proof system for this ("half-order") modal logic. As a special case, we obtain the real-time temporal logic TPTL of [AH891: the models are restricted to infinite sequences of states, whose values are monotonically increasing natural numbers. The ordering relation between states is interpreted as temporal precedence. while the value associated with a state is interpreted as its "rear time. We extend our proof system to be complete for TPTL. and demonstrate how it can be used to derive real-time properties. },
  author       = {Henzinger, Thomas A},
  booktitle    = {Proceedings of the 9th annual ACM symposium on Principles of distributed computing},
  isbn         = {978-0-89791-404-8},
  location     = {Quebec City, Canada},
  pages        = {281 -- 296},
  publisher    = {ACM},
  title        = {{Half-order modal logic: How to prove real-time properties}},
  doi          = {10.1145/93385.93429},
  year         = {1990},
}

@article{2479,
  abstract     = {Distribution of putative glutamatergic neurons in the lower brainstem and cerebellum of the rat was examined immunocytochemically by using a monoclonal antibody against phosphate-activated glutaminase, which has been proposed to be a major synthetic enzyme of transmitter glutamate and so may serve as a marker for glutamatergic neurons in the central nervous system. Intensely-immunolabeled neuronal cell bodies were densely distributed in the main precerebellar nuclei sending mossy fibers to the cerebellum; in the pontine nuclei, pontine tegmental reticular nucleus of Bechterew, external cuneate nucleus, and lateral reticular nucleus of the medulla oblongata. Phosphate-activated glutaminase-immunoreactive granular deposits were densely seen in the brachium pontis and restiform body, suggesting the immunolabeling of mossy fibers of passage. In the cerebellum, neuropil within the granule cell layer of the cerebellar cortex displayed intense phosphate-activated glutaminase-immunoreactivity, and that within the deep cerebellar nuclei showed moderate immunoreactivity. These results indicate that many mossy fiber terminals originate from phosphate-activated glutaminase-containing neurons and utilize phosphate-activated glutaminase for the synthesis of transmitter glutamate. Intensely-immunostained neuronal cell bodies were further observed in other regions which have been reported to contain neurons sending mossy fibers to the cerebellum; in the dorsal part of the principal sensory trigeminal nucleus, dorsomedial part of the oral subnucleus of the spinal trigeminal nucleus, interpolar subnucleus of the spinal trigeminal nucleus, paratrigeminal nucleus, supragenual nucleus, regions dorsal to the abducens nucleus and genu of the facial nerve, superior and medial vestibular nuclei, cell groups f, x and y, hypoglossal prepositus nucleus, intercalated nucleus, nucleus of Roller, reticular regions intercalated between the motor trigeminal and principal sensory trigeminal nuclei, linear nucleus, and gigantocellular and paramedian reticular formation. Neuronal cell bodies with intense phosphate-activated glutaminase-immunoreactivity were also found in other brainstem regions, such as the paracochlear glial substance, posterior ventral cochlear nucleus, and cell group e. Although it is still controversial whether all glutamatergic neurons use phosphate-activated glutaminase in a transmitter-related process and whether phosphate-activated glutaminase is involved in other metabolism-related processes, the neurons showing intense phosphate-activated glutaminase-immuno-reactivity in the present study were suggested to be putative glutamatergic neurons.},
  author       = {Kaneko, Takeshi and Itoh, Kazuo and Shigemoto, Ryuichi and Mizuno, Noboru},
  issn         = {1873-7544},
  journal      = {Neuroscience},
  number       = {1},
  pages        = {79 -- 98},
  publisher    = {Elsevier},
  title        = {{Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat}},
  doi          = {10.1016/0306-4522(89)90109-7},
  volume       = {32},
  year         = {1989},
}

@article{2525,
  abstract     = {This paper describes the amino acid sequence of the rat substance P receptor and its comparison with that of the rat substance K receptor on the basis of molecular cloning and sequence analysis. From a rat brain cDNA library constructed with an RNA expression vector, we identified a cDNA mixture containing a functional substance P receptor cDNA by examining electrophysiologically a receptor expression following injection of the mRNAs synthesized in vitro into Xenopus oocytes. A receptor cDNA clone was then isolated by cross-hybridization with the bovine substance K receptor DNA. The clone was confirmed by selective binding of substance P to the cloned receptor expressed in mammalian COS cells. The deduced amino acid sequence (407 amino acid residues) possesses seven putative membrane spanning domains and shows a sequence similarity to the members of G-protein-coupled receptors. The rat substance P and substance K receptor are very similar in both size and amino acid sequences, particularly in the putative transmembrane similarity is in marked contrast to the sequence divergence in the amino- and carboxyl-terminal regions and the third cytoplasmic loop. The observed sequence similarytity and divergence would thus contribute to the expression of similar but pharmacological regions and the first and second cytoplasmic loops. This distinguishable activities of the two tachykinin receptors.},
  author       = {Yokota, Yoshifumi and Sasai, Yoshiki and Tanaka, Kohichi and Fujiwara, Tsutomu and Tsuchida, Kunihiro and Shigemoto, Ryuichi and Kakizuka, Akira and Ohkubo, Hiroaki and Nakanishi, Shigetada},
  issn         = {1083-351X},
  journal      = {Journal of Biological Chemistry},
  number       = {30},
  pages        = {17649 -- 17652},
  publisher    = {American Society for Biochemistry and Molecular Biology},
  title        = {{Molecular characterization of a functional cDNA for rat substance P receptor}},
  doi          = {doi.org/10.1016/S0021-9258(19)84619-7},
  volume       = {264},
  year         = {1989},
}

@article{2526,
  abstract     = {When WGA-HRP (wheat germ agglutinin-horseradish peroxidase conjugate) or HRP was injected into the regions around the superior central and/or the dorsal raphe nuclei in the cat, cell bodies of a number of non-pyramidal neurons were labeled in Ammon's horn. Thus the existence of direct projections from non-pyramidal neurons in Ammon's horn to the rostral raphe regions in the brainstem was suggested in the cat.},
  author       = {Ino, Tadashi and Itoh, Kazuo and Kamiya, Hiroto and Kaneko, Takeshi and Shigemoto, Ryuichi and Akiguchi, Ichiro and Mizuno, Noboru},
  issn         = {1872-6240},
  journal      = {Brain Research},
  number       = {1},
  pages        = {157 -- 161},
  publisher    = {Elsevier},
  title        = {{Direct projections from Ammon's horn to the rostral raphe regions in the brainstem of the cat}},
  doi          = {10.1016/0006-8993(89)91346-2},
  volume       = {479},
  year         = {1989},
}

@article{2527,
  author       = {Akimoto, Masumi and Shigemoto, Ryuichi and Kawamura, Makiko and Yamagata, Hideharu and Kurihara, Takeshi and Takata, S and Miwa, Yoko and Akagami, N and Katsu, Kenichi and Yamauchi, D},
  journal      = {Japanese Journal of Gastroenterology},
  number       = {11},
  pages        = {2627},
  publisher    = {Japanese Society of Gastroenterology},
  title        = {{Effect of endothelin on gastric mucosal blood flow in rat}},
  doi          = {10.11405/nisshoshi1964.86.2627},
  volume       = {86},
  year         = {1989},
}

@inproceedings{4596,
  abstract     = {A real-time temporal logic for the specification of reactive systems is introduced. The novel feature of the logic, TPTL, is the adoption of temporal operators as quantifiers over time variables; every modality binds a variable to the time(s) it refers to. TPTL is demonstrated to be both a natural specification language and a suitable formalism for verification and synthesis. A tableau-based decision procedure and model-checking algorithm for TPTL are presented. Several generalizations of TPTL are shown to be highly undecidable.},
  author       = {Alur, Rajeev and Henzinger, Thomas A},
  booktitle    = {30th Annual Symposium on Foundations of Computer Science},
  isbn         = {0-8186-1982-1},
  issn         = {1558-0814},
  location     = {Research Triangle Park, NC, USA},
  pages        = {164 -- 169},
  publisher    = {IEEE},
  title        = {{A really temporal logic}},
  doi          = {10.1109/SFCS.1989.63473},
  year         = {1989},
}