---
_id: '1946'
abstract:
- lang: eng
text: An ultra-low dose (10-14 M) of opioid peptide [D-Ala2]methionine enkephalinamide
(DAMEA) is found to exert an inhibitory effect on the production of reactive oxygen
species (respiratory burst) in human neutrophils. The validity of this phenomenon
has been verified in a series of studies that comprised 30 experiments. The inhibition
has proved to be statistically significant (P<0.001). The dose-response dependence
of the effect (10-15-10-9 M) followed a characteristic biphasic pattern (with
the maximum effect at ultra-low doses). An opioid antagonist, naloxone partially
blocks the inhibitory effect, which indicates that the DAMEA action is at least
partially mediated by opioid receptors.
article_processing_charge: No
author:
- first_name: Sergei
full_name: Zaǐtsev, Sergei
last_name: Zaǐtsev
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: Aleksei
full_name: Koshkin, Aleksei
last_name: Koshkin
- first_name: Galina
full_name: Sud'Ina, Galina
last_name: Sud'Ina
- first_name: Sergei
full_name: Varfolomeev, Sergei
last_name: Varfolomeev
citation:
ama: Zaǐtsev S, Sazanov LA, Koshkin A, Sud’Ina G, Varfolomeev S. Respiratory burst
inhibition in human neutrophils by ultra-low doses of [D-Ala2] methionine enkephalinamide.
FEBS Letters. 1991;291(1):84-86. doi:10.1016/0014-5793(91)81109-L
apa: Zaǐtsev, S., Sazanov, L. A., Koshkin, A., Sud’Ina, G., & Varfolomeev, S.
(1991). Respiratory burst inhibition in human neutrophils by ultra-low doses of
[D-Ala2] methionine enkephalinamide. FEBS Letters. Elsevier. https://doi.org/10.1016/0014-5793(91)81109-L
chicago: Zaǐtsev, Sergei, Leonid A Sazanov, Aleksei Koshkin, Galina Sud’Ina, and
Sergei Varfolomeev. “Respiratory Burst Inhibition in Human Neutrophils by Ultra-Low
Doses of [D-Ala2] Methionine Enkephalinamide.” FEBS Letters. Elsevier,
1991. https://doi.org/10.1016/0014-5793(91)81109-L.
ieee: S. Zaǐtsev, L. A. Sazanov, A. Koshkin, G. Sud’Ina, and S. Varfolomeev, “Respiratory
burst inhibition in human neutrophils by ultra-low doses of [D-Ala2] methionine
enkephalinamide,” FEBS Letters, vol. 291, no. 1. Elsevier, pp. 84–86, 1991.
ista: Zaǐtsev S, Sazanov LA, Koshkin A, Sud’Ina G, Varfolomeev S. 1991. Respiratory
burst inhibition in human neutrophils by ultra-low doses of [D-Ala2] methionine
enkephalinamide. FEBS Letters. 291(1), 84–86.
mla: Zaǐtsev, Sergei, et al. “Respiratory Burst Inhibition in Human Neutrophils
by Ultra-Low Doses of [D-Ala2] Methionine Enkephalinamide.” FEBS Letters,
vol. 291, no. 1, Elsevier, 1991, pp. 84–86, doi:10.1016/0014-5793(91)81109-L.
short: S. Zaǐtsev, L.A. Sazanov, A. Koshkin, G. Sud’Ina, S. Varfolomeev, FEBS Letters
291 (1991) 84–86.
date_created: 2018-12-11T11:54:51Z
date_published: 1991-10-07T00:00:00Z
date_updated: 2022-03-07T09:49:06Z
day: '07'
doi: 10.1016/0014-5793(91)81109-L
extern: '1'
external_id:
pmid:
- '1936255 '
intvolume: ' 291'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/001457939181109L
month: '10'
oa_version: None
page: 84 - 86
pmid: 1
publication: FEBS Letters
publication_identifier:
issn:
- 0014-2956
publication_status: published
publisher: Elsevier
publist_id: '5139'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Respiratory burst inhibition in human neutrophils by ultra-low doses of [D-Ala2]
methionine enkephalinamide
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 291
year: '1991'
...
---
_id: '3468'
abstract:
- lang: eng
text: "Two types of metabolically regulated K channels have been identified for
the first time in enzymatically demyelinated fibres of amphibian sciatic nerve
using the patch-clamp technique. A maxi K channel with a single-channel conductance
of 132 pS (105 mM K on both sides of the membrane, 15°C) is activated both by
micromolar concentrations of internal Ca and by depolarization. A second type
of K channel with a conductance of 44 pS is inhibited by intracellular adenosine
5'-triphosphate (ATP) with a half-maximal inhibitory concentration (IC50) of 35
μM. It is blocked by submicromolar concentrations of external glibenclamide. Both
channels are sensitive to external tetraethylammonium chloride (IC50 = 0.2 mM
for the maxi K channel and 4.2 mM for the ATP-sensitive channel). They may be
part of a complex feedback system regulating axonal excitability under various
metabolic conditions.\r\n"
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: Duk
full_name: Koh, Duk
last_name: Koh
- first_name: Knut
full_name: Kampe, Knut
last_name: Kampe
- first_name: Markus
full_name: Hermsteiner, Markus
last_name: Hermsteiner
- first_name: Werner
full_name: Vogel, Werner
last_name: Vogel
citation:
ama: 'Jonas PM, Koh D, Kampe K, Hermsteiner M, Vogel W. ATP-sensitive and Ca-activated
K channels in vertebrate axons: novel links between metabolism and excitability.
Pflügers Archiv : European Journal of Physiology. 1991;418(1-2):68-73.
doi:10.1007/BF00370453'
apa: 'Jonas, P. M., Koh, D., Kampe, K., Hermsteiner, M., & Vogel, W. (1991).
ATP-sensitive and Ca-activated K channels in vertebrate axons: novel links between
metabolism and excitability. Pflügers Archiv : European Journal of Physiology.
Springer. https://doi.org/10.1007/BF00370453'
chicago: 'Jonas, Peter M, Duk Koh, Knut Kampe, Markus Hermsteiner, and Werner Vogel.
“ATP-Sensitive and Ca-Activated K Channels in Vertebrate Axons: Novel Links between
Metabolism and Excitability.” Pflügers Archiv : European Journal of Physiology.
Springer, 1991. https://doi.org/10.1007/BF00370453.'
ieee: 'P. M. Jonas, D. Koh, K. Kampe, M. Hermsteiner, and W. Vogel, “ATP-sensitive
and Ca-activated K channels in vertebrate axons: novel links between metabolism
and excitability,” Pflügers Archiv : European Journal of Physiology, vol.
418, no. 1–2. Springer, pp. 68–73, 1991.'
ista: 'Jonas PM, Koh D, Kampe K, Hermsteiner M, Vogel W. 1991. ATP-sensitive and
Ca-activated K channels in vertebrate axons: novel links between metabolism and
excitability. Pflügers Archiv : European Journal of Physiology. 418(1–2), 68–73.'
mla: 'Jonas, Peter M., et al. “ATP-Sensitive and Ca-Activated K Channels in Vertebrate
Axons: Novel Links between Metabolism and Excitability.” Pflügers Archiv :
European Journal of Physiology, vol. 418, no. 1–2, Springer, 1991, pp. 68–73,
doi:10.1007/BF00370453.'
short: 'P.M. Jonas, D. Koh, K. Kampe, M. Hermsteiner, W. Vogel, Pflügers Archiv :
European Journal of Physiology 418 (1991) 68–73.'
date_created: 2018-12-11T12:03:29Z
date_published: 1991-01-01T00:00:00Z
date_updated: 2022-03-03T14:42:06Z
day: '01'
doi: 10.1007/BF00370453
extern: '1'
external_id:
pmid:
- '2041727'
intvolume: ' 418'
issue: 1-2
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF00370453
month: '01'
oa_version: None
page: 68 - 73
pmid: 1
publication: 'Pflügers Archiv : European Journal of Physiology'
publication_identifier:
eissn:
- 1432-2013
issn:
- 0031-6768
publication_status: published
publisher: Springer
publist_id: '2919'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'ATP-sensitive and Ca-activated K channels in vertebrate axons: novel links
between metabolism and excitability'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 418
year: '1991'
...
---
_id: '3566'
abstract:
- lang: eng
text: This paper proves an O(m2/3n2/3 + m + n) upper bound on the number of incidences
between m points and n hyperplanes in four dimensions, assuming all points lie
on one side of each hyperplane and the points and hyperplanes satisfy certain
natural general position conditions. This result has application to various three-dimensional
combinatorial distance problems. For example, it implies the same upper bound
for the number of bichromatic minimum distance pairs in a set of m blue and n
red points in three-dimensional space. This improves the best previous bound for
this problem. © Springer-Verlag Berlin Heidelberg 1990.
alternative_title:
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
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
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
citation:
ama: 'Edelsbrunner H, Sharir M. A hyperplane incidence problem with applications
to counting distances. In: Applied Geometry and Discrete Mathematics: The Victor
Klee Festschrift. Vol 4. American Mathematical Society; 1991:253-263.'
apa: 'Edelsbrunner, H., & Sharir, M. (1991). A hyperplane incidence problem
with applications to counting distances. In Applied Geometry and Discrete Mathematics:
The Victor Klee Festschrift (Vol. 4, pp. 253–263). American Mathematical Society.'
chicago: 'Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem
with Applications to Counting Distances.” In Applied Geometry and Discrete
Mathematics: The Victor Klee Festschrift, 4:253–63. American Mathematical
Society, 1991.'
ieee: 'H. Edelsbrunner and M. Sharir, “A hyperplane incidence problem with applications
to counting distances,” in Applied Geometry and Discrete Mathematics: The Victor
Klee Festschrift, vol. 4, American Mathematical Society, 1991, pp. 253–263.'
ista: 'Edelsbrunner H, Sharir M. 1991.A hyperplane incidence problem with applications
to counting distances. In: Applied Geometry and Discrete Mathematics: The Victor
Klee Festschrift. DIMACS Series in Discrete Mathematics and Theoretical Computer
Science, vol. 4, 253–263.'
mla: 'Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with
Applications to Counting Distances.” Applied Geometry and Discrete Mathematics:
The Victor Klee Festschrift, vol. 4, American Mathematical Society, 1991,
pp. 253–63.'
short: 'H. Edelsbrunner, M. Sharir, in:, Applied Geometry and Discrete Mathematics:
The Victor Klee Festschrift, American Mathematical Society, 1991, pp. 253–263.'
date_created: 2018-12-11T12:04:00Z
date_published: 1991-04-01T00:00:00Z
date_updated: 2022-03-03T13:27:01Z
day: '01'
extern: '1'
intvolume: ' 4'
language:
- iso: eng
main_file_link:
- url: http://www.cs.duke.edu/~edels/Papers/1991-B-01-HyperplaneIncidence.pdf
month: '04'
oa_version: None
page: 253 - 263
publication: 'Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift'
publication_identifier:
isbn:
- 978-0897913850
publication_status: published
publisher: American Mathematical Society
publist_id: '2819'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A hyperplane incidence problem with applications to counting distances
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 4
year: '1991'
...
---
_id: '3567'
abstract:
- lang: eng
text: 'Many computational geometry problems arc exceedingly more difficult if the
setting is the (three-dimensional real) space R3 rather than the plane . Most
often the reason for this striking increase in complexity is the appearance of
new geometric phenomena caused by one-dimensional objects in space. The intention
of recent studies on problems for lines in space is to shed light on these new
phenomena and their complexities. This paper reviews some of the most important
results and shows how they are related to problems in dimensions 2 and 5. '
acknowledgement: National Science Foundation under grant CCR-8921421.
alternative_title:
- DIAMCS Series in Discrete Mathematics and Theoretical Computer Science
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. Lines in space – A collection of results. In: Discrete
& Computational Geometry: Papers from the Dimacs Special Year. Vol 6.
Springer; 1991:77-93.'
apa: 'Edelsbrunner, H. (1991). Lines in space – A collection of results. In Discrete
& Computational Geometry: Papers from the Dimacs Special Year (Vol. 6,
pp. 77–93). Springer.'
chicago: 'Edelsbrunner, Herbert. “Lines in Space – A Collection of Results.” In
Discrete & Computational Geometry: Papers from the Dimacs Special Year,
6:77–93. Springer, 1991.'
ieee: 'H. Edelsbrunner, “Lines in space – A collection of results,” in Discrete
& Computational Geometry: Papers from the Dimacs Special Year, vol. 6,
Springer, 1991, pp. 77–93.'
ista: 'Edelsbrunner H. 1991.Lines in space – A collection of results. In: Discrete
& Computational Geometry: Papers from the Dimacs Special Year. DIAMCS Series
in Discrete Mathematics and Theoretical Computer Science, vol. 6, 77–93.'
mla: 'Edelsbrunner, Herbert. “Lines in Space – A Collection of Results.” Discrete
& Computational Geometry: Papers from the Dimacs Special Year, vol. 6,
Springer, 1991, pp. 77–93.'
short: 'H. Edelsbrunner, in:, Discrete & Computational Geometry: Papers from
the Dimacs Special Year, Springer, 1991, pp. 77–93.'
date_created: 2018-12-11T12:04:00Z
date_published: 1991-06-01T00:00:00Z
date_updated: 2022-03-03T10:48:15Z
day: '01'
extern: '1'
intvolume: ' 6'
language:
- iso: eng
main_file_link:
- url: https://pub.ist.ac.at/~edels/Papers/1991-B-02-LinesInSpaceACollection.pdf
month: '06'
oa_version: None
page: 77 - 93
publication: 'Discrete & Computational Geometry: Papers from the Dimacs Special Year'
publication_identifier:
isbn:
- '9780821865958'
publication_status: published
publisher: Springer
publist_id: '2818'
quality_controlled: '1'
status: public
title: Lines in space – A collection of results
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 6
year: '1991'
...
---
_id: '3646'
abstract:
- lang: eng
text: "We compare the pattern of morphological and electrophoretic variation in
the hybrid zone between Bombina bombina and B. variegata across two transects:
one near Cracow and one 200 km away, near Przemysl in southeastern Poland. Morphological
variation across the Przemysl transect had been surveyed more than 50 years ago;
though we found a significant shift at one site, there is no evidence for gross
movement over this period. Morphological and electrophoretic changes coincide,
and the average shape of the clines is the same across both transects. At the
center, most of the change in frequency of six diagnostic allozymes occurs within
w = 6.05 km (2-unit support limits 5.56-6.54 km). These steep gradients are generated
not by selection on the allozymes themselves, but by associations with other loci:
though these markers are unlinked, they are in strong linkage disequilibrium with
each other [R = D/ = 0.22 (0.15-0.29) at the center]. Disequilibria are broken
up as alleles diffuse away from the zone and flow into the new genetic background.
The net barrier to the flow of genes from bombina into variegata, which is generated
by these disequilibria, is B = 51 (22-81) km. The fitness of hybrids must be substantially
reduced to produce such a barrier [W̄H/W̄P = 0.58 (0.54-0.68)], and this selection
must be spread over many loci [N = 55 (26-88)]. Alleles introgress significantly
less far than would be expected from the age of the zone and the estimated dispersal
rate [σ = 0.99 (0.82-1.14) km gen.-1/2]: this implies selection of se = 0.37 (0.15-0.58)%
on the enzymes themselves. There is weak but significant linkage disequilibrium
well away from the center of the zone; this, together with the presence of parental
and F1 genotypes, suggests some long-range migration. However, such migration
is not likely to cause significant introgression.\r\n"
acknowledgement: This work was supported by grants from the Royal Society, the Nuffield
Foundation, the University of London Central Research Fund, and the Polish Academy
of Sciences (project MR-II.6). We also thank Dr. Jan Rafinski for help in collecting
toads.
article_processing_charge: No
article_type: original
author:
- first_name: Jacek
full_name: Szymura, Jacek
last_name: Szymura
- 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: 'Szymura J, Barton NH. The genetic structure of the hybrid zone between the
fire-bellied toads Bombina bombina and B. variegata: comparisons between transects
and between loci. Evolution. 1991;45(2):237-261. doi:10.1111/j.1558-5646.1991.tb04400.x'
apa: 'Szymura, J., & Barton, N. H. (1991). The genetic structure of the hybrid
zone between the fire-bellied toads Bombina bombina and B. variegata: comparisons
between transects and between loci. Evolution. Wiley-Blackwell. https://doi.org/10.1111/j.1558-5646.1991.tb04400.x'
chicago: 'Szymura, Jacek, and Nicholas H Barton. “The Genetic Structure of the Hybrid
Zone between the Fire-Bellied Toads Bombina Bombina and B. Variegata: Comparisons
between Transects and between Loci.” Evolution. Wiley-Blackwell, 1991.
https://doi.org/10.1111/j.1558-5646.1991.tb04400.x.'
ieee: 'J. Szymura and N. H. Barton, “The genetic structure of the hybrid zone between
the fire-bellied toads Bombina bombina and B. variegata: comparisons between transects
and between loci,” Evolution, vol. 45, no. 2. Wiley-Blackwell, pp. 237–261,
1991.'
ista: 'Szymura J, Barton NH. 1991. The genetic structure of the hybrid zone between
the fire-bellied toads Bombina bombina and B. variegata: comparisons between transects
and between loci. Evolution. 45(2), 237–261.'
mla: 'Szymura, Jacek, and Nicholas H. Barton. “The Genetic Structure of the Hybrid
Zone between the Fire-Bellied Toads Bombina Bombina and B. Variegata: Comparisons
between Transects and between Loci.” Evolution, vol. 45, no. 2, Wiley-Blackwell,
1991, pp. 237–61, doi:10.1111/j.1558-5646.1991.tb04400.x.'
short: J. Szymura, N.H. Barton, Evolution 45 (1991) 237–261.
date_created: 2018-12-11T12:04:25Z
date_published: 1991-03-01T00:00:00Z
date_updated: 2022-03-02T15:50:09Z
day: '01'
doi: 10.1111/j.1558-5646.1991.tb04400.x
extern: '1'
external_id:
pmid:
- '28567861 '
intvolume: ' 45'
issue: '2'
language:
- iso: eng
main_file_link:
- url: ' http://www.jstor.org/stable/2409660'
month: '03'
oa_version: None
page: 237 - 261
pmid: 1
publication: Evolution
publication_identifier:
eissn:
- 1558-5646
issn:
- 0014-3820
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2737'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The genetic structure of the hybrid zone between the fire-bellied toads Bombina
bombina and B. variegata: comparisons between transects and between loci'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 45
year: '1991'
...
---
_id: '3647'
abstract:
- lang: eng
text: A method is developed that describes the effects on an arbitrary number of
autosomal loci of selection on haploid and diploid stages, of nonrandom mating
between haploid individuals, and of recombination. We provide exact recursions
for the dynamics of allele frequencies and linkage disequilibria (nonrandom associations
of alleles across loci). When selection is weak relative to recombination, our
recursions provide simple approximations for the linkage disequilibria among arbitrary
combinations of loci. We show how previous models of sex-independent natural selection
on diploids, assortative mating between haploids, and sexual selection on haploids
can be analyzed in this framework. Using our weak-selection approximations, we
derive new results concerning the coevolution of male traits and female preferences
under natural and sexual selection. In particular, we provide general expressions
for the intensity of linkage-disequilibrium induced selection experienced by loci
that contribute to female preferences for specific male traits. Our general results
support the previous observation that these indirect selection forces are so weak
that they are unlikely to dominate the evolution of preference-producing loci.
acknowledgement: "BENGT OLLE BENGTSSON, JERRY COYNE, RICHARD GOMULKIEWICZ, CHUCK LANGLEY,
LINDA PARTRIDGE, MONTY SLATKIN, and NEAL TAYLOR gave helpful comments on preliminary
versions, which are gratefully acknowledged. We are particularly indebted to DICK
HUDSON, MARK KIRKPATRICK and TOM NAGYLAKI for\r\nhelping to eliminate many obscurities.
This work was supported by the Science and Engineering Research Council (GR/C/91529,
GR/E/08507), the National Science Foundation (BSR-8866548), the Institute of Theoretical
Dynamics and the Center for Population Biology at the University of California,
Davis, and by the Swedish Natural Science Research Council. "
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: Michael
full_name: Turelli, Michael
last_name: Turelli
citation:
ama: Barton NH, Turelli M. Natural and sexual selection on many loci. Genetics.
1991;127(1):229-255. doi:10.1093/genetics/127.1.229
apa: Barton, N. H., & Turelli, M. (1991). Natural and sexual selection on many
loci. Genetics. Genetics Society of America. https://doi.org/10.1093/genetics/127.1.229
chicago: Barton, Nicholas H, and Michael Turelli. “Natural and Sexual Selection
on Many Loci.” Genetics. Genetics Society of America, 1991. https://doi.org/10.1093/genetics/127.1.229.
ieee: N. H. Barton and M. Turelli, “Natural and sexual selection on many loci,”
Genetics, vol. 127, no. 1. Genetics Society of America, pp. 229–255, 1991.
ista: Barton NH, Turelli M. 1991. Natural and sexual selection on many loci. Genetics.
127(1), 229–255.
mla: Barton, Nicholas H., and Michael Turelli. “Natural and Sexual Selection on
Many Loci.” Genetics, vol. 127, no. 1, Genetics Society of America, 1991,
pp. 229–55, doi:10.1093/genetics/127.1.229.
short: N.H. Barton, M. Turelli, Genetics 127 (1991) 229–255.
date_created: 2018-12-11T12:04:25Z
date_published: 1991-01-01T00:00:00Z
date_updated: 2022-03-02T15:23:02Z
day: '01'
doi: 10.1093/genetics/127.1.229
extern: '1'
external_id:
pmid:
- '2016044'
intvolume: ' 127'
issue: '1'
language:
- iso: eng
main_file_link:
- url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1204308/
month: '01'
oa_version: None
page: 229 - 255
pmid: 1
publication: Genetics
publication_identifier:
issn:
- 0016-6731
publication_status: published
publisher: Genetics Society of America
publist_id: '2736'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Natural and sexual selection on many loci
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 127
year: '1991'
...
---
_id: '3648'
abstract:
- lang: eng
text: 'We investigate the probability of fixation of a chromosome rearrangement
in a subdivided population, concentrating on the limit where migration is so large
relative to selection (m ≫ s) that the population can be thought of as being continuously
distributed. We study two demes, and one- and two-dimensional populations. For
two demes, the probability of fixation in the limit of high migration approximates
that of a population with twice the size of a single deme: migration therefore
greatly reduces the fixation probability. However, this behavior does not extend
to a large array of demes. Then, the fixation probability depends primarily on
neighborhood size (Nb), and may be appreciable even with strong selection and
free gene flow (≈exp(-B·Nb) in one dimension, ≈exp(-B\cdotNb) in two dimensions).
Our results are close to those for the more tractable case of a polygenic character
under disruptive selection.'
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: Shahin
full_name: Rouhani, Shahin
last_name: Rouhani
citation:
ama: Barton NH, Rouhani S. The probability of fixation of a new karyotype in a continuous
population. Evolution. 1991;45(3):499-517. doi:10.1111/j.1558-5646.1991.tb04326.x
apa: Barton, N. H., & Rouhani, S. (1991). The probability of fixation of a new
karyotype in a continuous population. Evolution. Wiley-Blackwell. https://doi.org/10.1111/j.1558-5646.1991.tb04326.x
chicago: Barton, Nicholas H, and Shahin Rouhani. “The Probability of Fixation of
a New Karyotype in a Continuous Population.” Evolution. Wiley-Blackwell,
1991. https://doi.org/10.1111/j.1558-5646.1991.tb04326.x.
ieee: N. H. Barton and S. Rouhani, “The probability of fixation of a new karyotype
in a continuous population,” Evolution, vol. 45, no. 3. Wiley-Blackwell,
pp. 499–517, 1991.
ista: Barton NH, Rouhani S. 1991. The probability of fixation of a new karyotype
in a continuous population. Evolution. 45(3), 499–517.
mla: Barton, Nicholas H., and Shahin Rouhani. “The Probability of Fixation of a
New Karyotype in a Continuous Population.” Evolution, vol. 45, no. 3, Wiley-Blackwell,
1991, pp. 499–517, doi:10.1111/j.1558-5646.1991.tb04326.x.
short: N.H. Barton, S. Rouhani, Evolution 45 (1991) 499–517.
date_created: 2018-12-11T12:04:25Z
date_published: 1991-05-01T00:00:00Z
date_updated: 2022-03-02T10:37:19Z
day: '01'
doi: 10.1111/j.1558-5646.1991.tb04326.x
extern: '1'
external_id:
pmid:
- '28568824'
intvolume: ' 45'
issue: '3'
language:
- iso: eng
main_file_link:
- url: http://www.jstor.org/stable/2409908
month: '05'
oa_version: None
page: 499 - 517
pmid: 1
publication: Evolution
publication_identifier:
eissn:
- 1558-5646
issn:
- 0014-3820
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2735'
quality_controlled: '1'
status: public
title: The probability of fixation of a new karyotype in a continuous population
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 45
year: '1991'
...
---
_id: '4051'
abstract:
- lang: eng
text: An algorithm is presented that constructs the convex hull of a set of n points
in three dimensions in worst-case time O(n log2h) and storage O(n), where h is
the number of extreme points. This is an improvement of the O(nh) time gift-wrapping
algorithm and, for certain values of h, of the O(n log n) time divide-and-conquer
algorithm.
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: Weiping
full_name: Shi, Weiping
last_name: Shi
citation:
ama: Edelsbrunner H, Shi W. An O(n log^2 h) time algorithm for the three-dimensional
convex hull problem. SIAM Journal on Computing. 1991;20(2):259-269. doi:10.1137/0220016
apa: Edelsbrunner, H., & Shi, W. (1991). An O(n log^2 h) time algorithm for
the three-dimensional convex hull problem. SIAM Journal on Computing. SIAM.
https://doi.org/10.1137/0220016
chicago: Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm
for the Three-Dimensional Convex Hull Problem.” SIAM Journal on Computing.
SIAM, 1991. https://doi.org/10.1137/0220016
.
ieee: H. Edelsbrunner and W. Shi, “An O(n log^2 h) time algorithm for the three-dimensional
convex hull problem,” SIAM Journal on Computing, vol. 20, no. 2. SIAM,
pp. 259–269, 1991.
ista: Edelsbrunner H, Shi W. 1991. An O(n log^2 h) time algorithm for the three-dimensional
convex hull problem. SIAM Journal on Computing. 20(2), 259–269.
mla: Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for
the Three-Dimensional Convex Hull Problem.” SIAM Journal on Computing,
vol. 20, no. 2, SIAM, 1991, pp. 259–69, doi:10.1137/0220016 .
short: H. Edelsbrunner, W. Shi, SIAM Journal on Computing 20 (1991) 259–269.
date_created: 2018-12-11T12:06:39Z
date_published: 1991-04-01T00:00:00Z
date_updated: 2022-03-02T10:18:31Z
day: '01'
doi: '10.1137/0220016 '
extern: '1'
intvolume: ' 20'
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://epubs.siam.org/doi/10.1137/0220016
month: '04'
oa_version: None
page: 259 - 269
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: SIAM
publist_id: '2072'
quality_controlled: '1'
status: public
title: An O(n log^2 h) time algorithm for the three-dimensional convex hull problem
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 20
year: '1991'
...
---
_id: '4052'
abstract:
- lang: eng
text: This paper describes an effective procedure for stratifying a real semi-algebraic
set into cells of constant description size. The attractive feature of our method
is that the number of cells produced is singly exponential in the number of input
variables. This compares favorably with the doubly exponential size of Collins'
decomposition. Unlike Collins' construction, however, our scheme does not produce
a cell complex but only a smooth stratification. Nevertheless, we are able to
apply our results in interesting ways to problems of point location and geometric
optimization.
acknowledgement: The authors wish to thank DEC/Systems Research Center and DEC/Paris
Research Laboratory, where part of this research was conducted. For individual support,
Bernard Chazelle acknowledges the National Science Foundation for supporting this
research in part under Grant CCR-8700917. Herbert Edelsbrunner acknowledges the
support of the National Science Foundation under Grant CCR-8714565. Micha Sharir
acknowledges the Office of Naval Research under Grant N00014-87-K-0129, the National
Science Foundation under Grant No. NSF-DCR-83-20085, grants from the Digital Equipment
Corporation and the IBM Corporation, and a research grant from the US-Israeli Binational
Science Foundation.
article_processing_charge: No
article_type: original
author:
- first_name: Bernard
full_name: Chazelle, Bernard
last_name: Chazelle
- 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: Chazelle B, Edelsbrunner H, Guibas L, Sharir M. A singly exponential stratification
scheme for real semi-algebraic varieties and its applications. Theoretical
Computer Science. 1991;84(1):77-105. doi:10.1016/0304-3975(91)90261-Y
apa: Chazelle, B., Edelsbrunner, H., Guibas, L., & Sharir, M. (1991). A singly
exponential stratification scheme for real semi-algebraic varieties and its applications.
Theoretical Computer Science. Elsevier. https://doi.org/10.1016/0304-3975(91)90261-Y
chicago: Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir.
“A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties
and Its Applications.” Theoretical Computer Science. Elsevier, 1991. https://doi.org/10.1016/0304-3975(91)90261-Y.
ieee: B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “A singly exponential
stratification scheme for real semi-algebraic varieties and its applications,”
Theoretical Computer Science, vol. 84, no. 1. Elsevier, pp. 77–105, 1991.
ista: Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1991. A singly exponential
stratification scheme for real semi-algebraic varieties and its applications.
Theoretical Computer Science. 84(1), 77–105.
mla: Chazelle, Bernard, et al. “A Singly Exponential Stratification Scheme for Real
Semi-Algebraic Varieties and Its Applications.” Theoretical Computer Science,
vol. 84, no. 1, Elsevier, 1991, pp. 77–105, doi:10.1016/0304-3975(91)90261-Y.
short: B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Theoretical Computer
Science 84 (1991) 77–105.
date_created: 2018-12-11T12:06:39Z
date_published: 1991-07-22T00:00:00Z
date_updated: 2022-03-02T10:23:58Z
day: '22'
doi: 10.1016/0304-3975(91)90261-Y
extern: '1'
intvolume: ' 84'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/030439759190261Y?via%3Dihub
month: '07'
oa: 1
oa_version: Published Version
page: 77 - 105
publication: Theoretical Computer Science
publication_identifier:
eissn:
- 1879-2294
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
publist_id: '2073'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A singly exponential stratification scheme for real semi-algebraic varieties
and its applications
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 84
year: '1991'
...
---
_id: '4054'
abstract:
- lang: eng
text: The zone theorem for an arrangement of n hyperplanes in d-dimensional real
space says that the total number of faces bounding the cells intersected by another
hyperplane is O(n d–1). This result is the basis of a time-optimal incremental
algorithm that constructs a hyperplane arrangement and has a host of other algorithmic
and combinatorial applications. Unfortunately, the original proof of the zone
theorem, for d ge 3, turned out to contain a serious and irreparable error. This
paper presents a new proof of the theorem. Our proof is based on an inductive
argument, which also applies in the case of pseudo-hyperplane arrangements. We
also briefly discuss the fallacies of the old proof along with some ways of partially
saving that approach.
acknowledgement: Research of Herbert Edelsbrunner was supported by the National Science
Foundation under grant CCR-89-21421. Raimund Seidel acknowledges support by an NSF
Presidential Young Investigator Grant CCR-90-58440. Micha Sharir has been supported
by ONR Grant N00014-90-J-1284, by NSF Grant CCR-89-01484, and by grants from the
U.S.-Israeli Binational Science Foundation, the German-Israeli Foundation for Scientific
Research and Development, and the Fund for Basic Research of the Israeli Academy
of Sciences.
alternative_title:
- LNCS
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
- first_name: Raimund
full_name: Seidel, Raimund
last_name: Seidel
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
citation:
ama: 'Edelsbrunner H, Seidel R, Sharir M. On the zone theorem for hyperplane arrangements.
In: Vol 555. Springer; 1991:108-123. doi:10.1007/BFb0038185'
apa: Edelsbrunner, H., Seidel, R., & Sharir, M. (1991). On the zone theorem
for hyperplane arrangements (Vol. 555, pp. 108–123). Presented at the New Results
and New Trends in Computer Science , Springer. https://doi.org/10.1007/BFb0038185
chicago: Edelsbrunner, Herbert, Raimund Seidel, and Micha Sharir. “On the Zone Theorem
for Hyperplane Arrangements,” 555:108–23. Springer, 1991. https://doi.org/10.1007/BFb0038185.
ieee: H. Edelsbrunner, R. Seidel, and M. Sharir, “On the zone theorem for hyperplane
arrangements,” presented at the New Results and New Trends in Computer Science
, 1991, vol. 555, pp. 108–123.
ista: Edelsbrunner H, Seidel R, Sharir M. 1991. On the zone theorem for hyperplane
arrangements. New Results and New Trends in Computer Science , LNCS, vol. 555,
108–123.
mla: Edelsbrunner, Herbert, et al. On the Zone Theorem for Hyperplane Arrangements.
Vol. 555, Springer, 1991, pp. 108–23, doi:10.1007/BFb0038185.
short: H. Edelsbrunner, R. Seidel, M. Sharir, in:, Springer, 1991, pp. 108–123.
conference:
name: 'New Results and New Trends in Computer Science '
date_created: 2018-12-11T12:06:40Z
date_published: 1991-11-13T00:00:00Z
date_updated: 2022-02-28T15:13:37Z
day: '13'
doi: 10.1007/BFb0038185
extern: '1'
intvolume: ' 555'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/BFb0038185
month: '11'
oa_version: None
page: 108 - 123
publication_status: published
publisher: Springer
publist_id: '2068'
quality_controlled: '1'
status: public
title: On the zone theorem for hyperplane arrangements
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 555
year: '1991'
...
---
_id: '4055'
abstract:
- lang: eng
text: It is shown that a triangulation of a set of n points in the plane that minimizes
the maximum edge length can be computed in time O(n2). The algorithm is reasonably
easy to implement and is based on the theorem that there is a triangulation with
minmax edge length that contains the relative neighborhood graph of the points
as a subgraph. With minor modifications the algorithm works for arbitrary normed
metrics.
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
- first_name: Tiow
full_name: Tan, Tiow
last_name: Tan
citation:
ama: 'Edelsbrunner H, Tan T. A quadratic time algorithm for the minmax length triangulation.
In: 32nd Annual Symposium of Foundations of Computer Science. IEEE; 1991:414-423.
doi:10.1109/SFCS.1991.185400'
apa: 'Edelsbrunner, H., & Tan, T. (1991). A quadratic time algorithm for the
minmax length triangulation. In 32nd Annual Symposium of Foundations of Computer
Science (pp. 414–423). San Juan, PR, United States of America: IEEE. https://doi.org/10.1109/SFCS.1991.185400'
chicago: Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the
Minmax Length Triangulation.” In 32nd Annual Symposium of Foundations of Computer
Science, 414–23. IEEE, 1991. https://doi.org/10.1109/SFCS.1991.185400.
ieee: H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length
triangulation,” in 32nd Annual Symposium of Foundations of Computer Science,
San Juan, PR, United States of America, 1991, pp. 414–423.
ista: 'Edelsbrunner H, Tan T. 1991. A quadratic time algorithm for the minmax length
triangulation. 32nd Annual Symposium of Foundations of Computer Science. FOCS:
Foundations of Computer Science, 414–423.'
mla: Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax
Length Triangulation.” 32nd Annual Symposium of Foundations of Computer Science,
IEEE, 1991, pp. 414–23, doi:10.1109/SFCS.1991.185400.
short: H. Edelsbrunner, T. Tan, in:, 32nd Annual Symposium of Foundations of Computer
Science, IEEE, 1991, pp. 414–423.
conference:
end_date: 1991-10-04
location: San Juan, PR, United States of America
name: 'FOCS: Foundations of Computer Science'
start_date: 1991-10-01
date_created: 2018-12-11T12:06:40Z
date_published: 1991-12-01T00:00:00Z
date_updated: 2022-02-28T15:51:45Z
day: '01'
doi: 10.1109/SFCS.1991.185400
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/185400
month: '12'
oa_version: None
page: 414 - 423
publication: 32nd Annual Symposium of Foundations of Computer Science
publication_status: published
publisher: IEEE
publist_id: '2069'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A quadratic time algorithm for the minmax length triangulation
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1991'
...
---
_id: '4056'
abstract:
- lang: eng
text: This paper proves that for every n ≥ 4 there is a convex n-gon such that the
vertices of 2n - 7 vertex pairs are one unit of distance apart. This improves
the previously best lower bound of ⌊ (5n - 5) 3⌋ given by Erdo{combining double
acute accent}s and Moser if n ≥ 17.
acknowledgement: The first author is pleased to acknowledge partial support by the
Amoco Fnd. Fat. Dev. Comput. Sci. i-6-44862 and the National Science Foundation
under Grant CCR-8714565.
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: Péter
full_name: Hajnal, Péter
last_name: Hajnal
citation:
ama: Edelsbrunner H, Hajnal P. A lower bound on the number of unit distances between
the vertices of a convex polygon. Journal of Combinatorial Theory Series A.
1991;56(2):312-316. doi:10.1016/0097-3165(91)90042-F
apa: Edelsbrunner, H., & Hajnal, P. (1991). A lower bound on the number of unit
distances between the vertices of a convex polygon. Journal of Combinatorial
Theory Series A. Elsevier. https://doi.org/10.1016/0097-3165(91)90042-F
chicago: Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of
Unit Distances between the Vertices of a Convex Polygon.” Journal of Combinatorial
Theory Series A. Elsevier, 1991. https://doi.org/10.1016/0097-3165(91)90042-F.
ieee: H. Edelsbrunner and P. Hajnal, “A lower bound on the number of unit distances
between the vertices of a convex polygon,” Journal of Combinatorial Theory
Series A, vol. 56, no. 2. Elsevier, pp. 312–316, 1991.
ista: Edelsbrunner H, Hajnal P. 1991. A lower bound on the number of unit distances
between the vertices of a convex polygon. Journal of Combinatorial Theory Series
A. 56(2), 312–316.
mla: Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit
Distances between the Vertices of a Convex Polygon.” Journal of Combinatorial
Theory Series A, vol. 56, no. 2, Elsevier, 1991, pp. 312–16, doi:10.1016/0097-3165(91)90042-F.
short: H. Edelsbrunner, P. Hajnal, Journal of Combinatorial Theory Series A 56 (1991)
312–316.
date_created: 2018-12-11T12:06:41Z
date_published: 1991-03-01T00:00:00Z
date_updated: 2022-03-02T09:56:10Z
day: '01'
doi: 10.1016/0097-3165(91)90042-F
extern: '1'
intvolume: ' 56'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/009731659190042F?via%3Dihub
month: '03'
oa: 1
oa_version: Published Version
page: 312 - 316
publication: Journal of Combinatorial Theory Series A
publication_identifier:
eissn:
- 1096-0899
issn:
- 0097-3165
publication_status: published
publisher: Elsevier
publist_id: '2070'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A lower bound on the number of unit distances between the vertices of a convex
polygon
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 56
year: '1991'
...
---
_id: '4057'
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. Corrigendum. Journal of Computer and System Sciences.
1991;42(2):249-251. doi:10.1016/0022-0000(91)90013-U
apa: Edelsbrunner, H. (1991). Corrigendum. Journal of Computer and System Sciences.
Elsevier. https://doi.org/10.1016/0022-0000(91)90013-U
chicago: Edelsbrunner, Herbert. “Corrigendum.” Journal of Computer and System
Sciences. Elsevier, 1991. https://doi.org/10.1016/0022-0000(91)90013-U.
ieee: H. Edelsbrunner, “Corrigendum,” Journal of Computer and System Sciences,
vol. 42, no. 2. Elsevier, pp. 249–251, 1991.
ista: Edelsbrunner H. 1991. Corrigendum. Journal of Computer and System Sciences.
42(2), 249–251.
mla: Edelsbrunner, Herbert. “Corrigendum.” Journal of Computer and System Sciences,
vol. 42, no. 2, Elsevier, 1991, pp. 249–51, doi:10.1016/0022-0000(91)90013-U.
short: H. Edelsbrunner, Journal of Computer and System Sciences 42 (1991) 249–251.
date_created: 2018-12-11T12:06:41Z
date_published: 1991-04-01T00:00:00Z
date_updated: 2022-03-02T10:06:55Z
day: '01'
doi: 10.1016/0022-0000(91)90013-U
extern: '1'
intvolume: ' 42'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/002200009190013U?via%3Dihub
month: '04'
oa: 1
oa_version: Published Version
page: 249 - 251
publication: Journal of Computer and System Sciences
publication_identifier:
eissn:
- 1090-2724
issn:
- 0022-0000
publication_status: published
publisher: Elsevier
publist_id: '2071'
quality_controlled: '1'
status: public
title: Corrigendum
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 42
year: '1991'
...
---
_id: '4058'
abstract:
- lang: eng
text: We present a randomized incremental algorithm for computing a single face
in an arrangement of n line segments in the plane that is fairly simple to implement.
The expected running time of the algorithm is O (nα(n) log n). The analysis of
the algorithm uses a novel approach that generalizes and extends the Clarkson-Shor
analysis technique.
acknowledgement: 'NSF Grant CC R-89-21421. The authors wish to express their gratitude
for the generous support and hospitality of the DEC Palo Alto Systems Research Center. '
article_processing_charge: No
author:
- first_name: Bernard
full_name: Chazelle, Bernard
last_name: Chazelle
- 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
- first_name: Jack
full_name: Snoeyink, Jack
last_name: Snoeyink
citation:
ama: 'Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. Computing a face
in an arrangement of line segments. In: Proceedings of the 2nd Annual ACM-SIAM
Symposium on Discrete Algorithms. SIAM; 1991:441-448.'
apa: 'Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., & Snoeyink, J.
(1991). Computing a face in an arrangement of line segments. In Proceedings
of the 2nd annual ACM-SIAM symposium on Discrete algorithms (pp. 441–448).
San Francisco, CA, United States of America: SIAM.'
chicago: Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir,
and Jack Snoeyink. “Computing a Face in an Arrangement of Line Segments.” In Proceedings
of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, 441–48. SIAM,
1991.
ieee: B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink, “Computing
a face in an arrangement of line segments,” in Proceedings of the 2nd annual
ACM-SIAM symposium on Discrete algorithms, San Francisco, CA, United States
of America, 1991, pp. 441–448.
ista: 'Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. 1991. Computing
a face in an arrangement of line segments. Proceedings of the 2nd annual ACM-SIAM
symposium on Discrete algorithms. SODA: Symposium on Discrete Algorithms, 441–448.'
mla: Chazelle, Bernard, et al. “Computing a Face in an Arrangement of Line Segments.”
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms,
SIAM, 1991, pp. 441–48.
short: B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Snoeyink, in:, Proceedings
of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1991, pp. 441–448.
conference:
end_date: 1991-01-30
location: San Francisco, CA, United States of America
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 1991-01-28
date_created: 2018-12-11T12:06:41Z
date_published: 1991-01-01T00:00:00Z
date_updated: 2022-02-28T14:41:47Z
day: '01'
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/10.5555/127787.127864
month: '01'
oa_version: None
page: 441 - 448
publication: Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms
publication_identifier:
isbn:
- 978-0-89791-376-8
publication_status: published
publisher: SIAM
publist_id: '2065'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computing a face in an arrangement of line segments
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1991'
...
---
_id: '4059'
abstract:
- lang: eng
text: Let P be a simple polygon with n vertices. We present a simple decomposition
scheme that partitions the interior of P into O(n) so-called geodesic triangles,
so that any line segment interior to P crosses at most 2 log n of these triangles.
This decomposition can be used to preprocess P in time O(n log n) and storage
O(n), so that any ray-shooting query can be answered in time O(log n).The algorithms
are fairly simple and easy to implement. We also extend this technique to the
case of ray-shooting amidst k polygonal obstacles with a total of n edges, so
that a query can be answered in O(radicklog n) time.
acknowledgement: Work by Bernard Chazelle has been supported by NSF Grant CCR-87-00917.
Work by Herbert Edelsbrunner has been supported by NSF Grant CCR-89-21421. Work
by Micha Sharir has been supported by ONR Grants N00014-89-J-3042 and N00014-90-J-1284,
by NSF Grant CCR-89-01484, and by grants from the U.S.-Israeli Binational Science
Foundation, the Fund for Basic Research administered by the Israeli Academy of Sciences,
and the G.I.F., the German-Israeli Foundation for Scientific Research and Development.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Bernard
full_name: Chazelle, Bernard
last_name: Chazelle
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Michelangelo
full_name: Grigni, Michelangelo
last_name: Grigni
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: John
full_name: Hershberger, John
last_name: Hershberger
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
- first_name: Jack
full_name: Snoeyink, Jack
last_name: Snoeyink
citation:
ama: 'Chazelle B, Edelsbrunner H, Grigni M, et al. Ray shooting in polygons using
geodesic triangulations. In: 18th International Colloquium on Automata, Languages
and Programming. Vol 510. Springer; 1991:661-673. doi:10.1007/3-540-54233-7_172'
apa: 'Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Hershberger, J., Sharir,
M., & Snoeyink, J. (1991). Ray shooting in polygons using geodesic triangulations.
In 18th International Colloquium on Automata, Languages and Programming
(Vol. 510, pp. 661–673). Madrid, Spain: Springer. https://doi.org/10.1007/3-540-54233-7_172'
chicago: Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas
Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons
Using Geodesic Triangulations.” In 18th International Colloquium on Automata,
Languages and Programming, 510:661–73. Springer, 1991. https://doi.org/10.1007/3-540-54233-7_172.
ieee: B. Chazelle et al., “Ray shooting in polygons using geodesic triangulations,”
in 18th International Colloquium on Automata, Languages and Programming,
Madrid, Spain, 1991, vol. 510, pp. 661–673.
ista: 'Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M,
Snoeyink J. 1991. Ray shooting in polygons using geodesic triangulations. 18th
International Colloquium on Automata, Languages and Programming. ICALP: Automata,
Languages and Programming, LNCS, vol. 510, 661–673.'
mla: Chazelle, Bernard, et al. “Ray Shooting in Polygons Using Geodesic Triangulations.”
18th International Colloquium on Automata, Languages and Programming, vol.
510, Springer, 1991, pp. 661–73, doi:10.1007/3-540-54233-7_172.
short: B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir,
J. Snoeyink, in:, 18th International Colloquium on Automata, Languages and Programming,
Springer, 1991, pp. 661–673.
conference:
end_date: 1991-07-12
location: Madrid, Spain
name: 'ICALP: Automata, Languages and Programming'
start_date: 1991-07-08
date_created: 2018-12-11T12:06:42Z
date_published: 1991-06-20T00:00:00Z
date_updated: 2022-02-28T14:53:03Z
day: '20'
doi: 10.1007/3-540-54233-7_172
extern: '1'
intvolume: ' 510'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/3-540-54233-7_172
month: '06'
oa_version: None
page: 661 - 673
publication: 18th International Colloquium on Automata, Languages and Programming
publication_status: published
publisher: Springer
publist_id: '2066'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ray shooting in polygons using geodesic triangulations
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 510
year: '1991'
...
---
_id: '4061'
abstract:
- lang: eng
text: We present an algorithm to compute a Euclidean minimum spanning tree of a
given set S of N points in Ed in time O(Fd (N,N) logd N), where Fd (n,m) is the
time required to compute a bichromatic closest pair among n red and m green points
in Ed . If Fd (N,N)=Ω(N1+ε), for some fixed e{open}>0, then the running time
improves to O(Fd (N,N)). Furthermore, we describe a randomized algorithm to compute
a bichromatic closest 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/3 log4/3 N) expected time, algorithm for computing
a Euclidean minimum spanning tree of N points in E3. In d≥4 dimensions we obtain
expected time O((nm)1-1/([d/2]+1)+ε+m log n+n log m) for the bichromatic closest
pair problem and O(N2-2/([d/2]+1)ε) for the Euclidean minimum spanning tree problem,
for any positive e{open}.
acknowledgement: The first, second, and fourth authors acknowledge support from the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), a National
Science Foundation Science and Technology Center under NSF Grant STC 88-09648. The
second author's work was supported by the National Science Foundation under Grant
CCR-8714565. The third author's work was supported by the Deutsche Forschungsgemeinschaft
under Grant A1 253/1-3, Schwerpunktprogramm "Datenstrukturen und effiziente Algorithmen."
The last two authors' work was also partially supported by the ESPRIT II Basic Research
Action of the EC under Contract No. 3075 (project ALCOM).
article_processing_charge: No
article_type: original
author:
- first_name: Pankaj
full_name: Agarwal, Pankaj
last_name: Agarwal
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Otfried
full_name: Schwarzkopf, Otfried
last_name: Schwarzkopf
- first_name: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning
trees and bichromatic closest pairs. Discrete & Computational Geometry.
1991;6(1):407-422. doi:10.1007/BF02574698
apa: Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., & Welzl, E. (1991). Euclidean
minimum spanning trees and bichromatic closest pairs. Discrete & Computational
Geometry. Springer. https://doi.org/10.1007/BF02574698
chicago: Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl.
“Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Discrete
& Computational Geometry. Springer, 1991. https://doi.org/10.1007/BF02574698.
ieee: P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “Euclidean minimum
spanning trees and bichromatic closest pairs,” Discrete & Computational
Geometry, vol. 6, no. 1. Springer, pp. 407–422, 1991.
ista: Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1991. Euclidean minimum
spanning trees and bichromatic closest pairs. Discrete & Computational Geometry.
6(1), 407–422.
mla: Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest
Pairs.” Discrete & Computational Geometry, vol. 6, no. 1, Springer,
1991, pp. 407–22, doi:10.1007/BF02574698.
short: P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational
Geometry 6 (1991) 407–422.
date_created: 2018-12-11T12:06:42Z
date_published: 1991-12-01T00:00:00Z
date_updated: 2022-02-24T15:06:41Z
day: '01'
doi: 10.1007/BF02574698
extern: '1'
intvolume: ' 6'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/article/10.1007/BF02574698
month: '12'
oa: 1
oa_version: Published Version
page: 407 - 422
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2062'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Euclidean minimum spanning trees and bichromatic closest pairs
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 6
year: '1991'
...
---
_id: '4062'
abstract:
- lang: eng
text: We prove that for any set S of n points in the plane and n3-α triangles spanned
by the points in S there exists a point (not necessarily in S) contained in at
least n3-3α/(c log5 n) of the triangles. This implies that any set of n points
in three-dimensional space defines at most {Mathematical expression} halving planes.
acknowledgement: "Work on this paper by Boris Aronov and Rephael Wenger has been supported
by DIMACS under NSF Grant STC-88-09648. Work on this paper by Bernard Chazelle has
been supported by NSF Grant CCR-87-00917. Work by Herbert Edelsbrunner has been
supported by NSF Grant CCR-87-14565. Micha Sharir has been supported by ONR Grant
N00014-87-K-0129, by NSF Grant CCR-89-01484, and by grants from the U.S.-Israeli
Binational Science Foundation, the Israeli National Council for Research and Development,
and the Fund for Basic Research administered by the Israeli\r\nAcademy of Sciences"
article_processing_charge: No
article_type: original
author:
- first_name: Boris
full_name: Aronov, Boris
last_name: Aronov
- first_name: Bernard
full_name: Chazelle, Bernard
last_name: Chazelle
- 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
- first_name: Rephael
full_name: Wenger, Rephael
last_name: Wenger
citation:
ama: Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. Points
and triangles in the plane and halving planes in space. Discrete & Computational
Geometry. 1991;6(1):435-442. doi:10.1007/BF02574700
apa: Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., & Wenger,
R. (1991). Points and triangles in the plane and halving planes in space. Discrete
& Computational Geometry. Springer. https://doi.org/10.1007/BF02574700
chicago: Aronov, Boris, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas,
Micha Sharir, and Rephael Wenger. “Points and Triangles in the Plane and Halving
Planes in Space.” Discrete & Computational Geometry. Springer, 1991.
https://doi.org/10.1007/BF02574700.
ieee: B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger,
“Points and triangles in the plane and halving planes in space,” Discrete &
Computational Geometry, vol. 6, no. 1. Springer, pp. 435–442, 1991.
ista: Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1991.
Points and triangles in the plane and halving planes in space. Discrete &
Computational Geometry. 6(1), 435–442.
mla: Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes
in Space.” Discrete & Computational Geometry, vol. 6, no. 1, Springer,
1991, pp. 435–42, doi:10.1007/BF02574700.
short: B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger,
Discrete & Computational Geometry 6 (1991) 435–442.
date_created: 2018-12-11T12:06:43Z
date_published: 1991-12-01T00:00:00Z
date_updated: 2022-02-24T15:39:25Z
day: '01'
doi: 10.1007/BF02574700
extern: '1'
intvolume: ' 6'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/article/10.1007/BF02574700
month: '12'
oa: 1
oa_version: Published Version
page: 435 - 442
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2063'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Points and triangles in the plane and halving planes in space
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 6
year: '1991'
...
---
_id: '4508'
abstract:
- lang: eng
text: 'We extend the specification language of temporal logic, the corresponding
verification framework, and the underlying computational model to deal with real-time
properties of concurrent and reactive systems. A global, discrete, and asynchronous
clock is incorporated into the 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 upperbound real-time requirements for transitions. We show how
to model real-time systems that communicate either through shared variables or
by message passing, and how to represent the important real-time constructs of
priorities (interrupts), scheduling, and timeouts in this framework. Two styles
for the specification of real-time properties are presented. The first style uses
bounded versions of the temporal operators; the real-time requirements expressed
in this style are classified ...'
acknowledgement: 'This research was supported in part by an IBM graduate fellowship,
by the National Science Foundation grants CCR-89-11512 and CC R-89-13641, by the
Defense Advanced Re-search Projects Agency under contract NOO03%84C-0211, by the
United States Air Force Office of Scientific Research un-der contract AFOSR-W-0057,
and by the European Community ESPRIT Basic Research Action project 3096 (SPEC).
We thank Rajeev Alur for many helpful discussions. '
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
- first_name: Zohar
full_name: Manna, Zohar
last_name: Manna
- first_name: Amir
full_name: Pnueli, Amir
last_name: Pnueli
citation:
ama: 'Henzinger TA, Manna Z, Pnueli A. Temporal proof methodologies for real-time
systems. In: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles
of Programming Languages. ACM; 1991:353-366. doi:10.1145/99583.99629'
apa: 'Henzinger, T. A., Manna, Z., & Pnueli, A. (1991). Temporal proof methodologies
for real-time systems. In Proceedings of the 18th ACM SIGPLAN-SIGACT symposium
on Principles of programming languages (pp. 353–366). Orlando, FL, United
States of America: ACM. https://doi.org/10.1145/99583.99629'
chicago: Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “Temporal Proof Methodologies
for Real-Time Systems.” In Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium
on Principles of Programming Languages, 353–66. ACM, 1991. https://doi.org/10.1145/99583.99629.
ieee: T. A. Henzinger, Z. Manna, and A. Pnueli, “Temporal proof methodologies for
real-time systems,” in Proceedings of the 18th ACM SIGPLAN-SIGACT symposium
on Principles of programming languages, Orlando, FL, United States of America,
1991, pp. 353–366.
ista: 'Henzinger TA, Manna Z, Pnueli A. 1991. Temporal proof methodologies for real-time
systems. Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of
programming languages. POPL: Principles of Programming Languages, 353–366.'
mla: Henzinger, Thomas A., et al. “Temporal Proof Methodologies for Real-Time Systems.”
Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming
Languages, ACM, 1991, pp. 353–66, doi:10.1145/99583.99629.
short: T.A. Henzinger, Z. Manna, A. Pnueli, in:, Proceedings of the 18th ACM SIGPLAN-SIGACT
Symposium on Principles of Programming Languages, ACM, 1991, pp. 353–366.
conference:
end_date: 1991-01-23
location: Orlando, FL, United States of America
name: 'POPL: Principles of Programming Languages'
start_date: 1991-01-21
date_created: 2018-12-11T12:09:13Z
date_published: 1991-01-01T00:00:00Z
date_updated: 2022-02-24T14:44:39Z
day: '01'
doi: 10.1145/99583.99629
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/10.1145/99583.99629
month: '01'
oa_version: None
page: 353 - 366
publication: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of
programming languages
publication_identifier:
isbn:
- 978-0-89791-419-2
publication_status: published
publisher: ACM
publist_id: '221'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Temporal proof methodologies for real-time systems
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1991'
...
---
_id: '4516'
abstract:
- lang: eng
text: We extend the specification language of temporal logic, the corresponding
verification framework, and the underlying computational model to deal with real-time
properties of reactive systems. Semantics We introduce the abstract computational
model of timed transition systems as a conservative extension of traditional transition
systems qualitative fairness requirements are superseded by quantitative real-time
constraints on the transitions. Digital clocks are introduced as observers of
continuous real-time behavior. We justify our semantical abstractions by demonstrating
that a wide variety of concrete real-time systems can be modeled adequately. Specification
We present two conservative extensions of temporal logic that allow for the specification
of timing constraints while timed temporal logic provides access to time through
a novel kind of time quantifier, metric temporal logic refers to time through
time-bounded versions of the temporal operators. We justify our choice of specification
languages by developing a general framework for the classification of real-time
logics according to their complexity and expressive power. Verification We develop
tools for determining if a real-time system that is modeled as a timed transition
system meets a specification that is given in timed temporal logic or in metric
temporal logic. We present both model-checking algorithms for the automatic verification
of finite-state real-time systems and proof methods for the deductive verification
of real-time systems.
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. The temporal specification and verification of real-time systems
. 1991.
apa: Henzinger, T. A. (1991). The temporal specification and verification of
real-time systems . Stanford University.
chicago: Henzinger, Thomas A. “The Temporal Specification and Verification of Real-Time
Systems .” Stanford University, 1991.
ieee: T. A. Henzinger, “The temporal specification and verification of real-time
systems ,” Stanford University, 1991.
ista: Henzinger TA. 1991. The temporal specification and verification of real-time
systems . Stanford University.
mla: Henzinger, Thomas A. The Temporal Specification and Verification of Real-Time
Systems . Stanford University, 1991.
short: T.A. Henzinger, The Temporal Specification and Verification of Real-Time
Systems , Stanford University, 1991.
date_created: 2018-12-11T12:09:15Z
date_published: 1991-08-30T00:00:00Z
date_updated: 2022-02-24T14:12:36Z
day: '30'
degree_awarded: PhD
extern: '1'
language:
- iso: eng
main_file_link:
- url: http://pub.ist.ac.at/~tah/Publications/the_temporal_specification_and_verification_of_real-time_systems.pdf
month: '08'
oa_version: None
page: '295'
publication_status: published
publisher: Stanford University
publist_id: '210'
status: public
title: 'The temporal specification and verification of real-time systems '
type: dissertation
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1991'
...
---
_id: '4592'
article_processing_charge: No
article_type: letter_note
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. Time for logic. SIGACT News. 1991;22(3):6-12.
apa: Alur, R., & Henzinger, T. A. (1991). Time for logic. SIGACT News.
ACM.
chicago: Alur, Rajeev, and Thomas A Henzinger. “Time for Logic.” SIGACT News.
ACM, 1991.
ieee: R. Alur and T. A. Henzinger, “Time for logic,” SIGACT News, vol. 22,
no. 3. ACM, pp. 6–12, 1991.
ista: Alur R, Henzinger TA. 1991. Time for logic. SIGACT News. 22(3), 6–12.
mla: Alur, Rajeev, and Thomas A. Henzinger. “Time for Logic.” SIGACT News,
vol. 22, no. 3, ACM, 1991, pp. 6–12.
short: R. Alur, T.A. Henzinger, SIGACT News 22 (1991) 6–12.
date_created: 2018-12-11T12:09:39Z
date_published: 1991-01-01T00:00:00Z
date_updated: 2022-02-24T13:54:10Z
day: '01'
extern: '1'
intvolume: ' 22'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/toc/sigact/1991/22/1
month: '01'
oa_version: None
page: 6 - 12
publication: SIGACT News
publication_identifier:
issn:
- 0163-5700
publication_status: published
publisher: ACM
publist_id: '113'
quality_controlled: '1'
status: public
title: Time for logic
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 22
year: '1991'
...