---
_id: '4522'
abstract:
- lang: eng
text: '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. '
acknowledgement: Many thanks to Rajeev Alur, Adam Grove, Zohar Manna, and Amir Pnueli
for their continuous discussions and support.
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Henzinger TA. Half-order modal logic: How to prove real-time properties. In:
Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing.
ACM; 1990:281-296. doi:10.1145/93385.93429'
apa: 'Henzinger, T. A. (1990). Half-order modal logic: How to prove real-time properties.
In Proceedings of the 9th annual ACM symposium on Principles of distributed
computing (pp. 281–296). Quebec City, Canada: ACM. https://doi.org/10.1145/93385.93429'
chicago: 'Henzinger, Thomas A. “Half-Order Modal Logic: How to Prove Real-Time Properties.”
In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed
Computing, 281–96. ACM, 1990. https://doi.org/10.1145/93385.93429.'
ieee: 'T. A. Henzinger, “Half-order modal logic: How to prove real-time properties,”
in Proceedings of the 9th annual ACM symposium on Principles of distributed
computing, Quebec City, Canada, 1990, pp. 281–296.'
ista: 'Henzinger TA. 1990. Half-order modal logic: How to prove real-time properties.
Proceedings of the 9th annual ACM symposium on Principles of distributed computing.
PODC: Principles of Distributed Computing, 281–296.'
mla: 'Henzinger, Thomas A. “Half-Order Modal Logic: How to Prove Real-Time Properties.”
Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing,
ACM, 1990, pp. 281–96, doi:10.1145/93385.93429.'
short: T.A. Henzinger, in:, Proceedings of the 9th Annual ACM Symposium on Principles
of Distributed Computing, ACM, 1990, pp. 281–296.
conference:
end_date: 1990-08-24
location: Quebec City, Canada
name: 'PODC: Principles of Distributed Computing'
start_date: 1990-08-22
date_created: 2018-12-11T12:09:17Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-15T15:11:03Z
day: '01'
doi: 10.1145/93385.93429
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/10.1145/93385.93429
month: '01'
oa_version: None
page: 281 - 296
publication: Proceedings of the 9th annual ACM symposium on Principles of distributed
computing
publication_identifier:
isbn:
- 978-0-89791-404-8
publication_status: published
publisher: ACM
publist_id: '209'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Half-order modal logic: How to prove real-time properties'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1990'
...
---
_id: '4597'
abstract:
- lang: eng
text: 'A unifying framework for the study of real-time logics is developed. In analogy
to the untimed case, the underlying classical theory of timed state sequences
is identified, it is shown to be nonelementarily decidable, and its complexity
and expressiveness are used as a point of reference. Two orthogonal extensions
of PTL (timed propositional temporal logic and metric temporal logic) that inherit
its appeal are defined: they capture elementary, yet expressively complete, fragments
of the theory of timed state sequences, and thus are excellent candidates for
practical real-time specification languages'
article_processing_charge: No
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Alur R, Henzinger TA. Real-time logics: Complexity and expressiveness. In:
5th Annual IEEE Symposium on Logic in Computer Science. IEEE; 1990:390-401.
doi:10.1109/LICS.1990.113764'
apa: 'Alur, R., & Henzinger, T. A. (1990). Real-time logics: Complexity and
expressiveness. In 5th Annual IEEE Symposium on Logic in Computer Science
(pp. 390–401). Philadelphia, PA, USA: IEEE. https://doi.org/10.1109/LICS.1990.113764'
chicago: 'Alur, Rajeev, and Thomas A Henzinger. “Real-Time Logics: Complexity and
Expressiveness.” In 5th Annual IEEE Symposium on Logic in Computer Science,
390–401. IEEE, 1990. https://doi.org/10.1109/LICS.1990.113764.'
ieee: 'R. Alur and T. A. Henzinger, “Real-time logics: Complexity and expressiveness,”
in 5th Annual IEEE Symposium on Logic in Computer Science, Philadelphia,
PA, USA, 1990, pp. 390–401.'
ista: 'Alur R, Henzinger TA. 1990. Real-time logics: Complexity and expressiveness. 5th
Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science,
390–401.'
mla: 'Alur, Rajeev, and Thomas A. Henzinger. “Real-Time Logics: Complexity and Expressiveness.”
5th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1990, pp.
390–401, doi:10.1109/LICS.1990.113764.'
short: R. Alur, T.A. Henzinger, in:, 5th Annual IEEE Symposium on Logic in Computer
Science, IEEE, 1990, pp. 390–401.
conference:
end_date: 1990-06-07
location: Philadelphia, PA, USA
name: 'LICS: Logic in Computer Science'
start_date: 1990-06-04
date_created: 2018-12-11T12:09:40Z
date_published: 1990-08-06T00:00:00Z
date_updated: 2022-02-15T14:35:30Z
day: '06'
doi: 10.1109/LICS.1990.113764
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/113764
month: '08'
oa_version: None
page: 390 - 401
publication: ' 5th Annual IEEE Symposium on Logic in Computer Science'
publication_identifier:
isbn:
- 0-8186-2073-0
publication_status: published
publisher: IEEE
publist_id: '112'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Real-time logics: Complexity and expressiveness'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1990'
...
---
_id: '2480'
abstract:
- lang: eng
text: Functional cDNA clones for rat neuromedin K receptor were isolated from a
rat brain cDNA library by cross-hybridization with the bovine substance K recepor
cDNA. Injection of the mRNA synthesized in vitro from the cloned cDNA into Xenopus
oocytes elicited electrophysiological responses to tachykinins, with the most
potent sensitivity being to neuromedin K. Ligand-binding displacement in membranes
of mammalian COS cells transfected with the cDNA indicated the rank order of affinity
of the receptor to tachykinins; neuromedin K > substance K > substance P.
The hybridization analysis showed that the neuromedin K receptor mRNA is expressed
in both the brain and the peripheral tissues at different levels. The rat neuromedin
K receptor consists of 452 amino acid residues and belongs to the family of G
protein-coupled receptors, which are thought to have seven transmembrane domains.
The sequence comparison of the rat neuromedin K, substance P, and substance K
receptors revealed that these receptors are highly conserved in the seven transmembrane
domains and the cytoplasmic sides of the receptors. They also show some structural
characteristics, including the common presence of histidine residues in transmembrane
segments V and VI and the difference in the numbers and distributions of serine
and threonine residues as possible phosphorylation sites in the cytoplasmic regions.
This paper thus presents the first comprehensive analysis of the molecular nature
of the multiple peptide receptors that exhibit similar but pharmacologically distinguishable
activities.
acknowledgement: This work was supported in part by research grants from the Ministry
Education, Science and Culture of Japan; the Institute of Physical and Chemical
Research; and the Science and Technology Agency of Japan. The costs of publication
of this article were defrayed in part by the payment of page charges. This article
must therefore be hereby marked “advertisement” in accordance with 18 USC. Section
1734 solely to indicate this fact.
article_processing_charge: No
article_type: original
author:
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Yoshifumi
full_name: Yokota, Yoshifumi
last_name: Yokota
- first_name: Kunihiro
full_name: Tsuchida, Kunihiro
last_name: Tsuchida
- first_name: Shigetada
full_name: Nakanishi, Shigetada
last_name: Nakanishi
citation:
ama: Shigemoto R, Yokota Y, Tsuchida K, Nakanishi S. Cloning and expression of a
rat neuromedin K receptor cDNA. Journal of Biological Chemistry. 1990;265(2):623-628.
doi:10.1016/s0021-9258(19)40095-1
apa: Shigemoto, R., Yokota, Y., Tsuchida, K., & Nakanishi, S. (1990). Cloning
and expression of a rat neuromedin K receptor cDNA. Journal of Biological Chemistry.
American Society for Biochemistry and Molecular Biology. https://doi.org/10.1016/s0021-9258(19)40095-1
chicago: Shigemoto, Ryuichi, Yoshifumi Yokota, Kunihiro Tsuchida, and Shigetada
Nakanishi. “Cloning and Expression of a Rat Neuromedin K Receptor CDNA.” Journal
of Biological Chemistry. American Society for Biochemistry and Molecular Biology,
1990. https://doi.org/10.1016/s0021-9258(19)40095-1
.
ieee: 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.
ista: Shigemoto R, Yokota Y, Tsuchida K, Nakanishi S. 1990. Cloning and expression
of a rat neuromedin K receptor cDNA. Journal of Biological Chemistry. 265(2),
623–628.
mla: Shigemoto, Ryuichi, et al. “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, 1990, pp. 623–28, doi:10.1016/s0021-9258(19)40095-1 .
short: R. Shigemoto, Y. Yokota, K. Tsuchida, S. Nakanishi, Journal of Biological
Chemistry 265 (1990) 623–628.
date_created: 2018-12-11T11:57:55Z
date_published: 1990-01-15T00:00:00Z
date_updated: 2022-02-24T11:07:05Z
day: '15'
doi: '10.1016/s0021-9258(19)40095-1 '
extern: '1'
external_id:
pmid:
- '2153106 '
intvolume: ' 265'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S0021925819400951
month: '01'
oa: 1
oa_version: Published Version
page: 623 - 628
pmid: 1
publication: Journal of Biological Chemistry
publication_identifier:
eissn:
- 1083-351X
issn:
- 0021-9258
publication_status: published
publisher: American Society for Biochemistry and Molecular Biology
publist_id: '4421'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cloning and expression of a rat neuromedin K receptor cDNA
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 265
year: '1990'
...
---
_id: '2481'
abstract:
- lang: eng
text: The family of mammalian tachykinin receptors consists of substance P receptor
(SPR), neuromedin K receptor (NKR) and substance K receptor (SKR). In this investigation,
tissue and regional distributions of the mRNAs for the three rat tachykinin receptors
were investigated by blot-hybridization and RNase-protection analyses using the
previously cloned receptor cDNAs. SPR mRNA is widely distributed in both the nervous
system and peripheral tissues and is expressed abundantly in the hypothalamus
and olfactory buld, as well as in the urinary bladder, salivary glands and small
and large intestines. In contrast, NKR mRNA is predominantly expressed in the
nervous system, particularly in the cortex, hypothalamus and cerebellum, whereas
SKR mRNA expression is restricted to the peripheral tissues, being abundant in
the urinary bladder, large intestine, stomach and adenal glands. Thus, the mRNAs
for the three tachykinin receptors show distinct patterns of expression between
the nervous system and peripheral tissues. Blot-hybridization analysis in combination
with S1 nuclease protection and primer-extension analyses revealed that there
are two large forms of SKR mRNA expressed commonly in the peripheral tissues,
and two additional small forms of the mRNA expressed specifically in the adrenal
gland and eye. These analyses also showed that the multiple forms of SKR mRNA
differ in the lengths of the 5' mRNA portions, and that the two small forms of
the mRNA, if translated, encode a truncated SKR polypeptide lacking the first
two transmembrane domains. This investigation thus provides the comprehensive
analysis of the distribution and mode of expression of the mRNAs for the multiple
peptide receptors and offers a new basis on which to interpret the diverse functions
of multiple tachykinin peptides in the CNS and peripheral tissues.
acknowledgement: This work was supported in part by research grants from the Ministry
of Education, Science and Culture of Japan, the Ministry of Health and Welfare
of Japan, and the Yamanouchi Foundation for Research on Metabolic Disorders
article_processing_charge: No
article_type: original
author:
- first_name: Kunihiro
full_name: Tsuchida, Kunihiro
last_name: Tsuchida
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Yoshifumi
full_name: Yokota, Yoshifumi
last_name: Yokota
- first_name: Shigetada
full_name: Nakanishi, Shigetada
last_name: Nakanishi
citation:
ama: Tsuchida K, Shigemoto R, Yokota Y, Nakanishi S. Tissue distribution and quantitation
of the mRNAs for three rat tachykinin receptors. European Journal of Biochemistry.
1990;193(3):751-757. doi:10.1111/j.1432-1033.1990.tb19396.x
apa: Tsuchida, K., Shigemoto, R., Yokota, Y., & Nakanishi, S. (1990). Tissue
distribution and quantitation of the mRNAs for three rat tachykinin receptors.
European Journal of Biochemistry. Wiley-Blackwell. https://doi.org/10.1111/j.1432-1033.1990.tb19396.x
chicago: Tsuchida, Kunihiro, Ryuichi Shigemoto, Yoshifumi Yokota, and Shigetada
Nakanishi. “Tissue Distribution and Quantitation of the MRNAs for Three Rat Tachykinin
Receptors.” European Journal of Biochemistry. Wiley-Blackwell, 1990. https://doi.org/10.1111/j.1432-1033.1990.tb19396.x.
ieee: 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.
ista: Tsuchida K, Shigemoto R, Yokota Y, Nakanishi S. 1990. Tissue distribution
and quantitation of the mRNAs for three rat tachykinin receptors. European Journal
of Biochemistry. 193(3), 751–757.
mla: Tsuchida, Kunihiro, et al. “Tissue Distribution and Quantitation of the MRNAs
for Three Rat Tachykinin Receptors.” European Journal of Biochemistry,
vol. 193, no. 3, Wiley-Blackwell, 1990, pp. 751–57, doi:10.1111/j.1432-1033.1990.tb19396.x.
short: K. Tsuchida, R. Shigemoto, Y. Yokota, S. Nakanishi, European Journal of Biochemistry
193 (1990) 751–757.
date_created: 2018-12-11T11:57:55Z
date_published: 1990-03-03T00:00:00Z
date_updated: 2022-02-24T10:20:14Z
day: '03'
doi: 10.1111/j.1432-1033.1990.tb19396.x
extern: '1'
external_id:
pmid:
- '1701145'
intvolume: ' 193'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://febs.onlinelibrary.wiley.com/doi/10.1111/j.1432-1033.1990.tb19396.x
month: '03'
oa: 1
oa_version: Published Version
page: 751 - 757
pmid: 1
publication: European Journal of Biochemistry
publication_identifier:
eissn:
- 1432-1033
issn:
- 0014-2956
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4420'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tissue distribution and quantitation of the mRNAs for three rat tachykinin
receptors
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 193
year: '1990'
...
---
_id: '2528'
abstract:
- lang: eng
text: We previously reported a novel rat membrane protein that exhibits a voltage-dependent
potassium channel activity on the basis of molecular cloning combined with an
electrophysiological assay. This protein, termed I(sK) protein, is small and different
from the conventional potassium channel proteins but induces selective permeation
of potassium ions on its expression in Xenopus oocytes. In this investigation,
we examined cellular localization of rat I(sK) protein by preparing three different
types of antibody that specifically reacts with a distinct part of rat I(sK) protein.
Immunohistochemical analysis using these antibody preparations demonstrated that
rat I(sK) protein is confined to the apical membrane portion of epithelial cells
in the proximal tubule of the kidney, the submandibular duct and the uterine endometrium.
The observed tissue distribution of rat I(sK) protein was consistent with that
of the I(sK) protein mRNA determined by blot hybridization analysis. In epithelial
cells, the sodium, potassium-ATPase pump in the basolateral membrane generates
a sodium gradient across the epithelial cell and allows sodium ions to enter the
cell through the apical membrane. Thus, taking into account the cellular localization
of the I(sK) protein, together with its electrophysiological properties, we discussed
a possible function of the I(sK) protein, namely that this protein is involved
in potassium permeation in the apical membrane of epithelial cells through the
depolarizing effect of sodium entry.
article_processing_charge: No
article_type: original
author:
- first_name: Tetsuo
full_name: Sugimoto, Tetsuo
last_name: Sugimoto
- first_name: Yasuto
full_name: Tanabe, Yasuto
last_name: Tanabe
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Masazumi
full_name: Iwai, Masazumi
last_name: Iwai
- first_name: Toru
full_name: Takumi, Toru
last_name: Takumi
- first_name: Hiroaki
full_name: Ohkubo, Hiroaki
last_name: Ohkubo
- first_name: Shigetada
full_name: Nakanishi, Shigetada
last_name: Nakanishi
citation:
ama: 'Sugimoto T, Tanabe Y, Shigemoto R, 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.
1990;113(1):39-47. doi:10.1007/BF01869604'
apa: 'Sugimoto, T., Tanabe, Y., Shigemoto, R., Iwai, M., Takumi, T., Ohkubo, H.,
& Nakanishi, S. (1990). 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. Springer.
https://doi.org/10.1007/BF01869604'
chicago: 'Sugimoto, Tetsuo, Yasuto Tanabe, Ryuichi Shigemoto, Masazumi Iwai, Toru
Takumi, Hiroaki Ohkubo, and Shigetada Nakanishi. “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.
Springer, 1990. https://doi.org/10.1007/BF01869604.'
ieee: '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.'
ista: 'Sugimoto T, Tanabe Y, Shigemoto R, Iwai M, Takumi T, Ohkubo H, Nakanishi
S. 1990. 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. 113(1), 39–47.'
mla: 'Sugimoto, Tetsuo, 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, 1990, pp. 39–47, doi:10.1007/BF01869604.'
short: T. Sugimoto, Y. Tanabe, R. Shigemoto, M. Iwai, T. Takumi, H. Ohkubo, S. Nakanishi,
Journal of Membrane Biology 113 (1990) 39–47.
date_created: 2018-12-11T11:58:12Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-24T09:55:39Z
day: '01'
doi: 10.1007/BF01869604
extern: '1'
external_id:
pmid:
- '2154581'
intvolume: ' 113'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF01869604
month: '01'
oa_version: None
page: 39 - 47
pmid: 1
publication: Journal of Membrane Biology
publication_identifier:
eissn:
- 1432-1424
issn:
- 0022-2631
publication_status: published
publisher: Springer
publist_id: '4371'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Immunohistochemical study of a rat membrane protein which induces a selective
potassium permeation: Its localization in the apical membrane portion of epithelial
cells'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 113
year: '1990'
...
---
_id: '2721'
abstract:
- lang: eng
text: We consider a multidimensional system consisting of a particle of mass M and
radius r (molecule), surrounded by an infinite ideal gas of point particles of
mass m (atoms). The molecule is confined to the unit ball and interacts with its
boundary (barrier) via elastic collision, while the atoms are not affected by
the boundary. We obtain convergence to equilibrium for the molecule from almost
every initial distribution on its position and velocity. Furthermore, we prove
that the infinite composite system of the molecule and the atoms is Bernoulli.
article_processing_charge: No
article_type: original
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Dao
full_name: Tuyen, Dao
last_name: Tuyen
citation:
ama: Erdös L, Tuyen D. Ergodic properties of the multidimensional rayleigh gas with
a semipermeable barrier. Journal of Statistical Physics. 1990;59(5-6):1589-1602.
doi:10.1007/BF01334766
apa: 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
chicago: Erdös, László, and Dao Tuyen. “Ergodic Properties of the Multidimensional
Rayleigh Gas with a Semipermeable Barrier.” Journal of Statistical Physics.
Springer, 1990. https://doi.org/10.1007/BF01334766.
ieee: 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.
ista: Erdös L, Tuyen D. 1990. Ergodic properties of the multidimensional rayleigh
gas with a semipermeable barrier. Journal of Statistical Physics. 59(5–6), 1589–1602.
mla: 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.
short: L. Erdös, D. Tuyen, Journal of Statistical Physics 59 (1990) 1589–1602.
date_created: 2018-12-11T11:59:15Z
date_published: 1990-06-01T00:00:00Z
date_updated: 2022-02-24T09:39:29Z
day: '01'
doi: 10.1007/BF01334766
extern: '1'
intvolume: ' 59'
issue: 5-6
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF01334766
month: '06'
oa_version: None
page: 1589 - 1602
publication: Journal of Statistical Physics
publication_identifier:
eissn:
- 1572-9613
issn:
- 0022-4715
publication_status: published
publisher: Springer
publist_id: '4171'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ergodic properties of the multidimensional rayleigh gas with a semipermeable
barrier
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 59
year: '1990'
...
---
_id: '3465'
abstract:
- lang: eng
text: Asymmetrical displacement currents and Na currents of single myelinated nerve
fibers of Xenopus laevis were studied in the temperature range from 5 to 24 degrees
C. The time constant of the on-response at E = 4 mV, tau on, was strongly temperature
dependent, whereas the amount of displaced charge at E = 39 mV, Qon, was only
slightly temperature dependent. The mean Q10 for tau on-1 was 2.54, the mean Q10
for Qon was 1.07. The time constant of charge immobilization, tau i, at E = 4
mV varied significantly (alpha = 0.001) with temperature. The mean Q10 for tau
i-1 was 2.71 +/- 0.38. The time constants of immobilization of gating charge and
of fast inactivation of Na permeability were similar in the temperature range
from 6 to 22 degrees C. The Qoff/Qon ratio for E = 4 mV pulses of 0.5 msec duration
decreased with increasing temperature. The temperature dependence of the time
constant of the off-response could not be described by a single Q10 value, since
the Q10 depended on the duration of the test pulse. Increasing temperature shifted
Qon (E) curves to more negative potentials by 0.51 mV K-1, but shifted PNa (E)
curves and h infinity (E) curves to more positive potentials by 0.43 and 0.57
mV K-1, respectively. h infinity (E = -70 mV) increased monotonously with increasing
temperature. The present data indicate that considerable entropy changes may occur
when the Na channel molecule passes from closed through open to inactivated states.
article_processing_charge: No
article_type: original
author:
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Jonas PM. Temperature dependence of gating current in myelinated nerve fibers.
Journal of Membrane Biology. 1989;112(3):277-289. doi:10.1007/BF01870958
apa: Jonas, P. M. (1989). Temperature dependence of gating current in myelinated
nerve fibers. Journal of Membrane Biology. Springer. https://doi.org/10.1007/BF01870958
chicago: Jonas, Peter M. “Temperature Dependence of Gating Current in Myelinated
Nerve Fibers.” Journal of Membrane Biology. Springer, 1989. https://doi.org/10.1007/BF01870958.
ieee: P. M. Jonas, “Temperature dependence of gating current in myelinated nerve
fibers,” Journal of Membrane Biology, vol. 112, no. 3. Springer, pp. 277–289,
1989.
ista: Jonas PM. 1989. Temperature dependence of gating current in myelinated nerve
fibers. Journal of Membrane Biology. 112(3), 277–289.
mla: Jonas, Peter M. “Temperature Dependence of Gating Current in Myelinated Nerve
Fibers.” Journal of Membrane Biology, vol. 112, no. 3, Springer, 1989,
pp. 277–89, doi:10.1007/BF01870958.
short: P.M. Jonas, Journal of Membrane Biology 112 (1989) 277–289.
date_created: 2018-12-11T12:03:28Z
date_published: 1989-12-01T00:00:00Z
date_updated: 2022-02-15T08:59:02Z
day: '01'
doi: 10.1007/BF01870958
extern: '1'
external_id:
pmid:
- '2559205 '
intvolume: ' 112'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF01870958
month: '12'
oa_version: None
page: 277 - 289
pmid: 1
publication: Journal of Membrane Biology
publication_identifier:
eissn:
- 1432-1424
issn:
- 0022-2631
publication_status: published
publisher: Springer
publist_id: '2922'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Temperature dependence of gating current in myelinated nerve fibers
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 112
year: '1989'
...
---
_id: '3466'
abstract:
- lang: eng
text: Amphibian myelinated nerve fibers were treated with collagenase and protease.
Axons with retraction of the myelin sheath were patch-clamped in the nodal and
paranodal region. One type of Na channel was found. It has a single-channel conductance
of 11 pS (15 degrees C) and is blocked by tetrodotoxin. Averaged events show the
typical activation and inactivation kinetics of macroscopic Na current. Three
potential-dependent K channels were identified (I, F, and S channel). The I channel,
being the most frequent type, has a single-channel conductance of 23 pS (inward
current, 105 mM K on both sides of the membrane), activates between -60 and -30
mV, deactivates with intermediate kinetics, and is sensitive to dendrotoxin. The
F channel has a conductance of 30 pS, activates between -40 and 60 mV, and deactivates
with fast kinetics. The former inactivates within tens of seconds; the latter
inactivates within seconds. The third type, the S channel, has a conductance of
7 pS and deactivates slowly. All three channels can be blocked by external tetraethylammonium
chloride. We suggest that these distinct K channel types form the basis for the
different components of macroscopic K current described previously.
acknowledgement: We thank Drs. C. Baumann, D. Siemen, and W. Stuhmer for reading the
manuscript and Dr. F. Dreyer for the generous gift of DTX. The study was supported
by the Deutsche Forschungsgemeinschaft.
article_processing_charge: No
article_type: original
author:
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Michael
full_name: Bräu, Michael
last_name: Bräu
- first_name: Markus
full_name: Hermsteiner, Markus
last_name: Hermsteiner
- first_name: Werner
full_name: Vogel, Werner
last_name: Vogel
citation:
ama: Jonas PM, Bräu M, Hermsteiner M, Vogel W. Single-channel recording in myelinated
nerve fibers reveals one type of Na channel but different K channels. PNAS.
1989;86(18):7238-7242. doi:10.1073/pnas.86.18.7238
apa: Jonas, P. M., Bräu, M., Hermsteiner, M., & Vogel, W. (1989). Single-channel
recording in myelinated nerve fibers reveals one type of Na channel but different
K channels. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.86.18.7238
chicago: Jonas, Peter M, Michael Bräu, Markus Hermsteiner, and Werner Vogel. “Single-Channel
Recording in Myelinated Nerve Fibers Reveals One Type of Na Channel but Different
K Channels.” PNAS. National Academy of Sciences, 1989. https://doi.org/10.1073/pnas.86.18.7238.
ieee: P. M. Jonas, M. Bräu, M. Hermsteiner, and W. Vogel, “Single-channel recording
in myelinated nerve fibers reveals one type of Na channel but different K channels,”
PNAS, vol. 86, no. 18. National Academy of Sciences, pp. 7238–7242, 1989.
ista: Jonas PM, Bräu M, Hermsteiner M, Vogel W. 1989. Single-channel recording in
myelinated nerve fibers reveals one type of Na channel but different K channels.
PNAS. 86(18), 7238–7242.
mla: Jonas, Peter M., et al. “Single-Channel Recording in Myelinated Nerve Fibers
Reveals One Type of Na Channel but Different K Channels.” PNAS, vol. 86,
no. 18, National Academy of Sciences, 1989, pp. 7238–42, doi:10.1073/pnas.86.18.7238.
short: P.M. Jonas, M. Bräu, M. Hermsteiner, W. Vogel, PNAS 86 (1989) 7238–7242.
date_created: 2018-12-11T12:03:28Z
date_published: 1989-09-01T00:00:00Z
date_updated: 2022-02-14T16:12:33Z
day: '01'
doi: 10.1073/pnas.86.18.7238
extern: '1'
external_id:
pmid:
- '2550937 '
intvolume: ' 86'
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC298032/?tool=pubmed
month: '09'
oa: 1
oa_version: Published Version
page: 7238 - 7242
pmid: 1
publication: PNAS
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
publist_id: '2921'
quality_controlled: '1'
status: public
title: Single-channel recording in myelinated nerve fibers reveals one type of Na
channel but different K channels
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 86
year: '1989'
...
---
_id: '3549'
abstract:
- lang: eng
text: 'We study three types of spatial triangulations: Delaunay triangulations,
triangulations with non-obtuse dihedral angles, and KJ-triangulations. The latter
satisfy a certain angle condition useful for finite element approximation. We
show that the condition for Delaunay triangulations is incomparable with the other
two conditions, and that triangulations with non-obtuse dihedral angles are necessarily
also KJ-triangulations. These relationships are in sharp contrast to the ones
in the planar case. '
acknowledgement: 'Research was supported by the National Science Foundation under
grant CCR-8714565. The author thanks Thomas Kerkhoven, Raimund Seidel, and Peter
Shor for helpful discussions on the material of this paper. '
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Edelsbrunner H. Spatial triangulations with dihedral angle conditions. In:
Institute of the Electronics, Information and Communication Enginneers; 1989:83-89.'
apa: Edelsbrunner, H. (1989). Spatial triangulations with dihedral angle conditions
(pp. 83–89). Presented at the International Workshop on Discrete Algorithms and
Complexity, Institute of the Electronics, Information and Communication Enginneers.
chicago: Edelsbrunner, Herbert. “Spatial Triangulations with Dihedral Angle Conditions,”
83–89. Institute of the Electronics, Information and Communication Enginneers,
1989.
ieee: H. Edelsbrunner, “Spatial triangulations with dihedral angle conditions,”
presented at the International Workshop on Discrete Algorithms and Complexity,
1989, pp. 83–89.
ista: Edelsbrunner H. 1989. Spatial triangulations with dihedral angle conditions.
International Workshop on Discrete Algorithms and Complexity, 83–89.
mla: Edelsbrunner, Herbert. Spatial Triangulations with Dihedral Angle Conditions.
Institute of the Electronics, Information and Communication Enginneers, 1989,
pp. 83–89.
short: H. Edelsbrunner, in:, Institute of the Electronics, Information and Communication
Enginneers, 1989, pp. 83–89.
conference:
name: International Workshop on Discrete Algorithms and Complexity
date_created: 2018-12-11T12:03:54Z
date_published: 1989-01-01T00:00:00Z
date_updated: 2022-02-14T14:34:06Z
day: '01'
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://ipsj.ixsq.nii.ac.jp/ej/?action=pages_view_main&active_action=repository_view_main_item_detail&item_id=32670&item_no=1&page_id=13&block_id=8
month: '01'
oa_version: None
page: 83 - 89
publication_status: published
publisher: Institute of the Electronics, Information and Communication Enginneers
publist_id: '2836'
quality_controlled: '1'
status: public
title: Spatial triangulations with dihedral angle conditions
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1989'
...
---
_id: '3652'
abstract:
- lang: eng
text: Frequency-dependent selection against rare forms can maintain clines. For
weak selection, s, in simple linear models of frequency-dependence, single locus
clines are stabilized with a maximum slope of between square root of s/square
root of 8 sigma and square root of s/square root of 12 delta, where sigma is the
dispersal distance. These clines are similar to those maintained by heterozygote
disadvantage. Using computer simulations, the weak-selection analytical results
are extended to higher selection pressures with up to three unlinked genes. Graphs
are used to display the effect of selection, migration, dominance, and number
of loci on cline widths, speeds of cline movements, two-way gametic correlations
("linkage disequilibria"), and heterozygote deficits. The effects of changing
the order of reproduction, migration, and selection, are also briefly explored.
Epistasis can also maintain tension zones. We show that epistatic selection is
similar in its effects to frequency-dependent selection, except that the disequilibria
produced in the zone will be higher for a given level of selection. If selection
consists of a mixture of frequency-dependence and epistasis, as is likely in nature,
the error made in estimating selection is usually less than twofold. From the
graphs, selection and migration can be estimated using knowledge of the dominance
and number of genes, of gene frequencies and of gametic correlations from a hybrid
zone.
acknowledgement: "The publication costs of this article were partly defrayed by the
payment of page charges. This article must therefore be hereby marked “advertisment”
in accordance with 18 U.S.C. §1734 solely to indicate this fact. \r\n\r\nWe thank
the Natural Environmental Research Council for financial support, and N. SANDERSON,
M. SLATKIN and an anonymous reviewer for comments on the manuscript."
article_processing_charge: No
article_type: original
author:
- first_name: James
full_name: Mallet, James
last_name: Mallet
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Mallet J, Barton NH. Inference from clines stabilized by frequency-dependent
selection. Genetics. 1989;122(4):967-976. doi:10.1093/genetics/122.4.967
apa: Mallet, J., & Barton, N. H. (1989). Inference from clines stabilized by
frequency-dependent selection. Genetics. Genetics Society of America. https://doi.org/10.1093/genetics/122.4.967
chicago: Mallet, James, and Nicholas H Barton. “Inference from Clines Stabilized
by Frequency-Dependent Selection.” Genetics. Genetics Society of America,
1989. https://doi.org/10.1093/genetics/122.4.967.
ieee: J. Mallet and N. H. Barton, “Inference from clines stabilized by frequency-dependent
selection,” Genetics, vol. 122, no. 4. Genetics Society of America, pp.
967–976, 1989.
ista: Mallet J, Barton NH. 1989. Inference from clines stabilized by frequency-dependent
selection. Genetics. 122(4), 967–976.
mla: Mallet, James, and Nicholas H. Barton. “Inference from Clines Stabilized by
Frequency-Dependent Selection.” Genetics, vol. 122, no. 4, Genetics Society
of America, 1989, pp. 967–76, doi:10.1093/genetics/122.4.967.
short: J. Mallet, N.H. Barton, Genetics 122 (1989) 967–976.
date_created: 2018-12-11T12:04:27Z
date_published: 1989-08-01T00:00:00Z
date_updated: 2022-02-14T14:07:12Z
day: '01'
doi: 10.1093/genetics/122.4.967
extern: '1'
external_id:
pmid:
- '2759433'
intvolume: ' 122'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1203771
month: '08'
oa: 1
oa_version: None
page: 967 - 976
pmid: 1
publication: Genetics
publication_identifier:
issn:
- 0016-6731
publication_status: published
publisher: Genetics Society of America
publist_id: '2731'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inference from clines stabilized by frequency-dependent selection
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 122
year: '1989'
...
---
_id: '3653'
abstract:
- lang: eng
text: 'Frequency-dependent selection on warning color can maintain narrow hybrid
zones between unpalatable prey taxa. To measure such selection, we transferred
marked Heliconius erato (Lepidoptera: Nymphalidae) in both directions across a
10-km-wide hybrid zone between Peruvian races differing in color pattern. These
experimental H. erato were released at four sites, along with control H. erato
of the phenotype native to each site. Survival of experimental butterflies was
significantly lower than that of controls at two sites and overall. Most selection,
measured as differences in survival, occurred soon after release. Selection against
foreign morphs was 52% (confidence limits: 25-71%) and was probably due to bird
attacks on unusual warning-color morphs (more than 10% of the recaptures had beak
marks). Since only three major loci determine the color-pattern differences, this
suggests an average selection coefficient of 0.17 per locus, sufficient to maintain
the narrow clines in H. erato.'
acknowledgement: We thank G.Lamas for sharing his knowledge of the Tarapoto hybrid
zone; M.A.Arboleda, H.Eeley, S.Knapp, M.Muedas, and J.Santisteban for their help
in the field; P.Donnelly and C.Smith for statistical advice; and S.Jones, S.Knapp,
G.Lamas, and the reviewers for helpful comments on the manuscript. We are grateful
to the Natural Environment Research Council, the Royal Society, and the Nuffield
Foundation for funding this research.
article_processing_charge: No
article_type: original
author:
- first_name: James
full_name: Mallet, James
last_name: Mallet
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Mallet J, Barton NH. Strong natural selection in a warning color hybrid zone.
Evolution. 1989;43(2):421-431. doi:10.2307/2409217
apa: Mallet, J., & Barton, N. H. (1989). Strong natural selection in a warning
color hybrid zone. Evolution. Wiley-Blackwell. https://doi.org/10.2307/2409217
chicago: Mallet, James, and Nicholas H Barton. “Strong Natural Selection in a Warning
Color Hybrid Zone.” Evolution. Wiley-Blackwell, 1989. https://doi.org/10.2307/2409217 .
ieee: J. Mallet and N. H. Barton, “Strong natural selection in a warning color hybrid
zone,” Evolution, vol. 43, no. 2. Wiley-Blackwell, pp. 421–431, 1989.
ista: Mallet J, Barton NH. 1989. Strong natural selection in a warning color hybrid
zone. Evolution. 43(2), 421–431.
mla: Mallet, James, and Nicholas H. Barton. “Strong Natural Selection in a Warning
Color Hybrid Zone.” Evolution, vol. 43, no. 2, Wiley-Blackwell, 1989, pp.
421–31, doi:10.2307/2409217 .
short: J. Mallet, N.H. Barton, Evolution 43 (1989) 421–431.
date_created: 2018-12-11T12:04:27Z
date_published: 1989-01-01T00:00:00Z
date_updated: 2022-02-14T11:00:42Z
day: '01'
doi: '10.2307/2409217 '
extern: '1'
external_id:
pmid:
- '28568556 '
intvolume: ' 43'
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://www.jstor.org/stable/2409217?origin=crossref&seq=1#metadata_info_tab_contents
month: '01'
oa_version: None
page: 421 - 431
pmid: 1
publication: Evolution
publication_identifier:
eissn:
- 1558-5646
issn:
- 0014-3820
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2730'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strong natural selection in a warning color hybrid zone
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 43
year: '1989'
...
---
_id: '3654'
abstract:
- lang: eng
text: Many species are divided into a mosaic of genetically distinct populations,
separated by narrow zones of hybridization. Studies of hybrid zones allow us to
quantify the genetic differences responsible for speciation, to measure the diffusion
of genes between diverging taxa, and to understand the spread of alternative adaptations.
article_processing_charge: No
article_type: original
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Godfrey
full_name: Hewitt, Godfrey
last_name: Hewitt
citation:
ama: Barton NH, Hewitt G. Adaptation, speciation and hybrid zones. Nature.
1989;341:497-503. doi:10.1038/341497a0
apa: Barton, N. H., & Hewitt, G. (1989). Adaptation, speciation and hybrid zones.
Nature. Nature Publishing Group. https://doi.org/10.1038/341497a0
chicago: Barton, Nicholas H, and Godfrey Hewitt. “Adaptation, Speciation and Hybrid
Zones.” Nature. Nature Publishing Group, 1989. https://doi.org/10.1038/341497a0.
ieee: N. H. Barton and G. Hewitt, “Adaptation, speciation and hybrid zones,” Nature,
vol. 341. Nature Publishing Group, pp. 497–503, 1989.
ista: Barton NH, Hewitt G. 1989. Adaptation, speciation and hybrid zones. Nature.
341, 497–503.
mla: Barton, Nicholas H., and Godfrey Hewitt. “Adaptation, Speciation and Hybrid
Zones.” Nature, vol. 341, Nature Publishing Group, 1989, pp. 497–503, doi:10.1038/341497a0.
short: N.H. Barton, G. Hewitt, Nature 341 (1989) 497–503.
date_created: 2018-12-11T12:04:27Z
date_published: 1989-10-12T00:00:00Z
date_updated: 2022-02-14T10:13:44Z
day: '12'
doi: 10.1038/341497a0
extern: '1'
external_id:
pmid:
- '2677747 '
intvolume: ' 341'
language:
- iso: eng
main_file_link:
- url: https://www.nature.com/articles/341497a0
month: '10'
oa_version: None
page: 497 - 503
pmid: 1
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Nature Publishing Group
publist_id: '2729'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Adaptation, speciation and hybrid zones
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 341
year: '1989'
...
---
_id: '4079'
acknowledgement: Research supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Steven
full_name: Skiena, Steven
last_name: Skiena
citation:
ama: Edelsbrunner H, Skiena S. On the number of furthest neighbor pairs in a point
set. American Mathematical Monthly. 1989;96(7):614-618. doi:10.1080/00029890.1989.11972250
apa: Edelsbrunner, H., & Skiena, S. (1989). On the number of furthest neighbor
pairs in a point set. American Mathematical Monthly. Mathematical Association
of America. https://doi.org/10.1080/00029890.1989.11972250
chicago: Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor
Pairs in a Point Set.” American Mathematical Monthly. Mathematical Association
of America, 1989. https://doi.org/10.1080/00029890.1989.11972250.
ieee: H. Edelsbrunner and S. Skiena, “On the number of furthest neighbor pairs in
a point set,” American Mathematical Monthly, vol. 96, no. 7. Mathematical
Association of America, pp. 614–618, 1989.
ista: Edelsbrunner H, Skiena S. 1989. On the number of furthest neighbor pairs in
a point set. American Mathematical Monthly. 96(7), 614–618.
mla: Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor
Pairs in a Point Set.” American Mathematical Monthly, vol. 96, no. 7, Mathematical
Association of America, 1989, pp. 614–18, doi:10.1080/00029890.1989.11972250.
short: H. Edelsbrunner, S. Skiena, American Mathematical Monthly 96 (1989) 614–618.
date_created: 2018-12-11T12:06:49Z
date_published: 1989-01-01T00:00:00Z
date_updated: 2022-02-11T12:59:01Z
day: '01'
doi: 10.1080/00029890.1989.11972250
extern: '1'
intvolume: ' 96'
issue: '7'
language:
- iso: eng
main_file_link:
- url: 'http://www.jstor.org/stable/2325182 '
month: '01'
oa_version: None
page: 614 - 618
publication: American Mathematical Monthly
publication_identifier:
eissn:
- 1930-0972
issn:
- 0002-9890
publication_status: published
publisher: Mathematical Association of America
publist_id: '2042'
quality_controlled: '1'
status: public
title: On the number of furthest neighbor pairs in a point set
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 96
year: '1989'
...
---
_id: '4080'
abstract:
- lang: eng
text: This paper proves that any set of n points in the plane contains two points
such that any circle through those two points encloses at least n12−112+O(1)n47 points
of the set. The main ingredients used in the proof of this result are edge counting
formulas for k-order Voronoi diagrams and a lower bound on the minimum number
of semispaces of size at most k.
acknowledgement: Work on this paper by the first author has been supported by Amoco
Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by the National Science Foundation under
Grant CCR-8714565, by the second author has been partially supported by the Digital
Equipment Corporation, by the fourth author has been partially supported by the
Office of Naval Research under Grant N00014-86K-0416.
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Nany
full_name: Hasan, Nany
last_name: Hasan
- first_name: Raimund
full_name: Seidel, Raimund
last_name: Seidel
- first_name: Xiao
full_name: Shen, Xiao
last_name: Shen
citation:
ama: Edelsbrunner H, Hasan N, Seidel R, Shen X. Circles through two points that
always enclose many points. Geometriae Dedicata. 1989;32(1):1-12. doi:10.1007/BF00181432
apa: Edelsbrunner, H., Hasan, N., Seidel, R., & Shen, X. (1989). Circles through
two points that always enclose many points. Geometriae Dedicata. Springer.
https://doi.org/10.1007/BF00181432
chicago: Edelsbrunner, Herbert, Nany Hasan, Raimund Seidel, and Xiao Shen. “Circles
through Two Points That Always Enclose Many Points.” Geometriae Dedicata.
Springer, 1989. https://doi.org/10.1007/BF00181432.
ieee: H. Edelsbrunner, N. Hasan, R. Seidel, and X. Shen, “Circles through two points
that always enclose many points,” Geometriae Dedicata, vol. 32, no. 1.
Springer, pp. 1–12, 1989.
ista: Edelsbrunner H, Hasan N, Seidel R, Shen X. 1989. Circles through two points
that always enclose many points. Geometriae Dedicata. 32(1), 1–12.
mla: Edelsbrunner, Herbert, et al. “Circles through Two Points That Always Enclose
Many Points.” Geometriae Dedicata, vol. 32, no. 1, Springer, 1989, pp.
1–12, doi:10.1007/BF00181432.
short: H. Edelsbrunner, N. Hasan, R. Seidel, X. Shen, Geometriae Dedicata 32 (1989)
1–12.
date_created: 2018-12-11T12:06:49Z
date_published: 1989-10-01T00:00:00Z
date_updated: 2022-02-14T09:55:28Z
day: '01'
doi: 10.1007/BF00181432
extern: '1'
intvolume: ' 32'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF00181432
month: '10'
oa_version: None
page: 1 - 12
publication: Geometriae Dedicata
publication_identifier:
eissn:
- 1572-9168
issn:
- 0046-5755
publication_status: published
publisher: Springer
publist_id: '2043'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Circles through two points that always enclose many points
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 32
year: '1989'
...
---
_id: '4081'
abstract:
- lang: eng
text: This paper studies applications of envelopes of piecewise linear functions
to problems in computational geometry. Among these applications we find problems
involving hidden line/surface elimination, motion planning, transversals of polytopes,
and a new type of Voronoi diagram for clusters of points. All results are either
combinatorial or computational in nature. They are based on the combinatorial
analysis in two companion papers [PS] and [E2] and a divide-and-conquer algorithm
for computing envelopes described in this paper.
acknowledgement: Work on this paper by the first author has been supported by Amoco
Fnd. Fac. Dev. Comput. Sci. 1-6-44862. Work by the third author has been supported
by the Office of Naval Research Grant N00014-82-K-0381, National Science Foundation
Grant No. NSF-DCR-83-20085, by grants from the Digital Equipment Corporation and
the IBM Corporation, and by a research grant from NCRD, the Israeli National Council
for Research and Development.
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
citation:
ama: 'Edelsbrunner H, Guibas L, Sharir M. The upper envelope of piecewise linear
functions: Algorithms and applications. Discrete & Computational Geometry.
1989;4(1):311-336. doi:10.1007/BF02187733'
apa: 'Edelsbrunner, H., Guibas, L., & Sharir, M. (1989). The upper envelope
of piecewise linear functions: Algorithms and applications. Discrete &
Computational Geometry. Springer. https://doi.org/10.1007/BF02187733'
chicago: 'Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Upper Envelope
of Piecewise Linear Functions: Algorithms and Applications.” Discrete &
Computational Geometry. Springer, 1989. https://doi.org/10.1007/BF02187733.'
ieee: 'H. Edelsbrunner, L. Guibas, and M. Sharir, “The upper envelope of piecewise
linear functions: Algorithms and applications,” Discrete & Computational
Geometry, vol. 4, no. 1. Springer, pp. 311–336, 1989.'
ista: 'Edelsbrunner H, Guibas L, Sharir M. 1989. The upper envelope of piecewise
linear functions: Algorithms and applications. Discrete & Computational Geometry.
4(1), 311–336.'
mla: 'Edelsbrunner, Herbert, et al. “The Upper Envelope of Piecewise Linear Functions:
Algorithms and Applications.” Discrete & Computational Geometry, vol.
4, no. 1, Springer, 1989, pp. 311–36, doi:10.1007/BF02187733.'
short: H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry
4 (1989) 311–336.
date_created: 2018-12-11T12:06:50Z
date_published: 1989-12-01T00:00:00Z
date_updated: 2022-02-10T15:53:48Z
day: '01'
doi: 10.1007/BF02187733
extern: '1'
intvolume: ' 4'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/article/10.1007/BF02187733
month: '12'
oa: 1
oa_version: Published Version
page: 311 - 336
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2038'
quality_controlled: '1'
status: public
title: 'The upper envelope of piecewise linear functions: Algorithms and applications'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 4
year: '1989'
...
---
_id: '4082'
abstract:
- lang: eng
text: Sweeping a collection of figures in the Euclidean plane with a straight line
is one of the novel algorithmic paradigms that have emerged in the field of computational
geometry. In this paper we demonstrate the advantages of sweeping with a topological
line that is not necessarily straight. We show how an arrangement of n lines in
the plane can be swept over in O(n2) time and O(n) space by a such a line. In
the process each element, i.e., vertex, edge, or region, is visited once in a
consistent ordering. Our technique makes use of novel data structures which exhibit
interesting amortized complexity behavior; the result is an algorithm that improves
upon all its predecessors either in the space or the time bounds, as well as being
eminently practical. Numerous applications of the technique to problems in computational
geometry are given—many through the use of duality transforms. Examples include
solving visibility problems, detecting degeneracies in configurations, computing
the extremal shadows of convex polytopes, and others. Even though our basic technique
solves a planar problem, its applications include several problems in higher dimensions.
acknowledgement: he authors wish to thank Raimund Seidel for suggesting the argument
that we used to prove Theorem 3.1, Harald Rosenberger who implemented the topological
sweep and compared it with a straight line sweep, the students who took the Stanford
1985 analysis of algorithms qualifying examination and suffered through a version
of this problem, and finally Lyle Ramshaw and Cynthia Hibbard for their detailed
reading and comments on the manuscript. The constructive criticism of an anonymous
referee is also appreciated.
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
citation:
ama: Edelsbrunner H, Guibas L. Topologically sweeping an arrangement. Journal
of Computer and System Sciences. 1989;38(1):165-194. doi:10.1016/0022-0000(89)90038-X
apa: Edelsbrunner, H., & Guibas, L. (1989). Topologically sweeping an arrangement.
Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/0022-0000(89)90038-X
chicago: Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an
Arrangement.” Journal of Computer and System Sciences. Elsevier, 1989.
https://doi.org/10.1016/0022-0000(89)90038-X.
ieee: H. Edelsbrunner and L. Guibas, “Topologically sweeping an arrangement,” Journal
of Computer and System Sciences, vol. 38, no. 1. Elsevier, pp. 165–194, 1989.
ista: Edelsbrunner H, Guibas L. 1989. Topologically sweeping an arrangement. Journal
of Computer and System Sciences. 38(1), 165–194.
mla: Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.”
Journal of Computer and System Sciences, vol. 38, no. 1, Elsevier, 1989,
pp. 165–94, doi:10.1016/0022-0000(89)90038-X.
short: H. Edelsbrunner, L. Guibas, Journal of Computer and System Sciences 38 (1989)
165–194.
date_created: 2018-12-11T12:06:50Z
date_published: 1989-02-01T00:00:00Z
date_updated: 2022-02-10T16:06:05Z
day: '01'
doi: 10.1016/0022-0000(89)90038-X
extern: '1'
intvolume: ' 38'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/002200008990038X?via%3Dihub
month: '02'
oa: 1
oa_version: Published Version
page: 165 - 194
publication: Journal of Computer and System Sciences
publication_identifier:
eissn:
- 1090-2724
issn:
- 0022-0000
publication_status: published
publisher: Elsevier
publist_id: '2039'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Topologically sweeping an arrangement
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 38
year: '1989'
...
---
_id: '4083'
abstract:
- lang: eng
text: 'It is shown that, given a set S of n points in $R^3 $, one can always find
three planes that form an eight-partition of S, that is, a partition where at
most ${n / 8}$ points of S lie in each of the eight open regions. This theorem
is used to define a data structure, called an octant tree, for representing any
point set in $R^3 $. An octant tree for n points occupies $O(n)$ space and can
be constructed in polynomial time. With this data structure and its refinements,
efficient solutions to various range query problems in two and three dimensions
can be obtained, including (1) half-space queries: find all points of S that lie
to one side of any given plane; (2) polyhedron queries: find all points that lie
inside (outside) any given polyhedron; and (3) circle queries in $R^2 $: for a
planar set S, find all points that lie inside (outside) any given circle. The
retrieval time for all these queries is $T(n) = O(n^\alpha + m)$, where $\alpha
= 0.8988$ (or 0.8471 in case (3)), and m is the size of the output. This performance
is the best currently known for linear-space data structures that can be deterministically
constructed in polynomial time.'
article_processing_charge: No
article_type: original
author:
- first_name: F.
full_name: Yao, F.
last_name: Yao
- first_name: David
full_name: Dobkin, David
last_name: Dobkin
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Michael
full_name: Paterson, Michael
last_name: Paterson
citation:
ama: Yao F, Dobkin D, Edelsbrunner H, Paterson M. Partitioning space for range queries.
SIAM Journal on Computing. 1989;18(2):371-384. doi:10.1137/0218025
apa: Yao, F., Dobkin, D., Edelsbrunner, H., & Paterson, M. (1989). Partitioning
space for range queries. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0218025
chicago: Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning
Space for Range Queries.” SIAM Journal on Computing. SIAM, 1989. https://doi.org/10.1137/0218025.
ieee: F. Yao, D. Dobkin, H. Edelsbrunner, and M. Paterson, “Partitioning space for
range queries,” SIAM Journal on Computing, vol. 18, no. 2. SIAM, pp. 371–384,
1989.
ista: Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for
range queries. SIAM Journal on Computing. 18(2), 371–384.
mla: Yao, F., et al. “Partitioning Space for Range Queries.” SIAM Journal on
Computing, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:10.1137/0218025.
short: F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing
18 (1989) 371–384.
date_created: 2018-12-11T12:06:50Z
date_published: 1989-04-01T00:00:00Z
date_updated: 2022-02-11T07:55:48Z
day: '01'
doi: 10.1137/0218025
extern: '1'
intvolume: ' 18'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://epubs.siam.org/doi/10.1137/0218025
month: '04'
oa: 1
oa_version: Published Version
page: 371 - 384
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: SIAM
publist_id: '2040'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Partitioning space for range queries
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 18
year: '1989'
...
---
_id: '4084'
abstract:
- lang: eng
text: "A tour of a finite set P of points is a necklace-tour if there are disks
with the points in P as centers such that two disks intersect if and only if their
centers are adjacent in . It has been observed by Sanders that a necklace-tour
is an optimal traveling salesman tour.\r\n\r\nIn this paper, we present an algorithm
that either reports that no necklace-tour exists or outputs a necklace-tour of
a given set of n points in O(n2 log n) time. If a tour is given, then we can test
in O(n2) time whether or not this tour is a necklace-tour. Both algorithms can
be generalized to ƒ-factors of point sets in the plane. The complexity results
rely on a combinatorial analysis of certain intersection graphs of disks defined
for finite sets of points in the plane."
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Günter
full_name: Rote, Günter
last_name: Rote
- first_name: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: Edelsbrunner H, Rote G, Welzl E. Testing the necklace condition for shortest
tours and optimal factors in the plane. Theoretical Computer Science. 1989;66(2):157-180.
doi:10.1016/0304-3975(89)90133-3
apa: Edelsbrunner, H., Rote, G., & Welzl, E. (1989). Testing the necklace condition
for shortest tours and optimal factors in the plane. Theoretical Computer Science.
Elsevier. https://doi.org/10.1016/0304-3975(89)90133-3
chicago: Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace
Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical
Computer Science. Elsevier, 1989. https://doi.org/10.1016/0304-3975(89)90133-3.
ieee: H. Edelsbrunner, G. Rote, and E. Welzl, “Testing the necklace condition for
shortest tours and optimal factors in the plane,” Theoretical Computer Science,
vol. 66, no. 2. Elsevier, pp. 157–180, 1989.
ista: Edelsbrunner H, Rote G, Welzl E. 1989. Testing the necklace condition for
shortest tours and optimal factors in the plane. Theoretical Computer Science.
66(2), 157–180.
mla: Edelsbrunner, Herbert, et al. “Testing the Necklace Condition for Shortest
Tours and Optimal Factors in the Plane.” Theoretical Computer Science,
vol. 66, no. 2, Elsevier, 1989, pp. 157–80, doi:10.1016/0304-3975(89)90133-3.
short: H. Edelsbrunner, G. Rote, E. Welzl, Theoretical Computer Science 66 (1989)
157–180.
date_created: 2018-12-11T12:06:51Z
date_published: 1989-08-01T00:00:00Z
date_updated: 2022-02-11T11:15:43Z
day: '01'
doi: 10.1016/0304-3975(89)90133-3
extern: '1'
intvolume: ' 66'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/0304397589901333?via%3Dihub
month: '08'
oa: 1
oa_version: Published Version
page: 157 - 180
publication: Theoretical Computer Science
publication_identifier:
eissn:
- 1879-2294
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
publist_id: '2041'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Testing the necklace condition for shortest tours and optimal factors in the
plane
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 66
year: '1989'
...
---
_id: '4085'
abstract:
- lang: eng
text: 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.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Edelsbrunner H. An acyclicity theorem for cell complexes in d dimension. In:
Proceedings of the 5th Annual Symposium on Computational Geometry. ACM;
1989:145-151. doi:10.1145/73833.73850'
apa: 'Edelsbrunner, H. (1989). An acyclicity theorem for cell complexes in d dimension.
In Proceedings of the 5th annual symposium on Computational geometry (pp.
145–151). Saarbruchen, Germany: ACM. https://doi.org/10.1145/73833.73850'
chicago: Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.”
In Proceedings of the 5th Annual Symposium on Computational Geometry, 145–51.
ACM, 1989. https://doi.org/10.1145/73833.73850.
ieee: H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,”
in Proceedings of the 5th annual symposium on Computational geometry, Saarbruchen,
Germany, 1989, pp. 145–151.
ista: 'Edelsbrunner H. 1989. An acyclicity theorem for cell complexes in d dimension.
Proceedings of the 5th annual symposium on Computational geometry. SCG: Symposium
on Computational Geometry, 145–151.'
mla: Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.”
Proceedings of the 5th Annual Symposium on Computational Geometry, ACM,
1989, pp. 145–51, doi:10.1145/73833.73850.
short: H. Edelsbrunner, in:, Proceedings of the 5th Annual Symposium on Computational
Geometry, ACM, 1989, pp. 145–151.
conference:
end_date: 1989-06-07
location: Saarbruchen, Germany
name: 'SCG: Symposium on Computational Geometry'
start_date: 1989-06-05
date_created: 2018-12-11T12:06:51Z
date_published: 1989-06-01T00:00:00Z
date_updated: 2022-02-10T10:56:49Z
day: '01'
doi: 10.1145/73833.73850
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/10.1145/73833.73850
month: '06'
oa_version: None
page: 145 - 151
publication: Proceedings of the 5th annual symposium on Computational geometry
publication_identifier:
isbn:
- 978-0-89791-318-8
publication_status: published
publisher: ACM
publist_id: '2033'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An acyclicity theorem for cell complexes in d dimension
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1989'
...
---
_id: '4086'
abstract:
- lang: eng
text: This note proves that the maximum number of faces (of any dimension) of the
upper envelope of a set ofn possibly intersectingd-simplices ind+1 dimensions
is (n d (n)). This is an extension of a result of Pach and Sharir [PS] who prove
the same bound for the number ofd-dimensional faces of the upper envelope.
acknowledgement: "This work was supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862
and by the National Science Foundation under Grant CCR-8714565. Research on the
presented result was partially carried out while the author worked for the IBM T.
J. Watson Research Center at Yorktown Height, New York, USA. \r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Edelsbrunner H. The upper envelope of piecewise linear functions: Tight bounds
on the number of faces . Discrete & Computational Geometry. 1989;4(4):337-343.
doi:10.1007/BF02187734'
apa: 'Edelsbrunner, H. (1989). The upper envelope of piecewise linear functions:
Tight bounds on the number of faces . Discrete & Computational Geometry.
Springer. https://doi.org/10.1007/BF02187734'
chicago: 'Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions:
Tight Bounds on the Number of Faces .” Discrete & Computational Geometry.
Springer, 1989. https://doi.org/10.1007/BF02187734.'
ieee: 'H. Edelsbrunner, “The upper envelope of piecewise linear functions: Tight
bounds on the number of faces ,” Discrete & Computational Geometry,
vol. 4, no. 4. Springer, pp. 337–343, 1989.'
ista: 'Edelsbrunner H. 1989. The upper envelope of piecewise linear functions: Tight
bounds on the number of faces . Discrete & Computational Geometry. 4(4), 337–343.'
mla: 'Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions:
Tight Bounds on the Number of Faces .” Discrete & Computational Geometry,
vol. 4, no. 4, Springer, 1989, pp. 337–43, doi:10.1007/BF02187734.'
short: H. Edelsbrunner, Discrete & Computational Geometry 4 (1989) 337–343.
date_created: 2018-12-11T12:06:51Z
date_published: 1989-11-01T00:00:00Z
date_updated: 2022-02-10T11:08:12Z
day: '01'
doi: 10.1007/BF02187734
extern: '1'
intvolume: ' 4'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/article/10.1007/BF02187734
month: '11'
oa: 1
oa_version: Published Version
page: 337 - 343
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2034'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The upper envelope of piecewise linear functions: Tight bounds on the number
of faces '
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 4
year: '1989'
...