---
_id: '3584'
abstract:
- lang: eng
text: We develop fast algorithms for computing the linking number of a simplicial
complex within a filtration.We give experimental results in applying our work
toward the detection of non-trivial tangling in biomolecules, modeled as alpha
complexes.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Afra
full_name: Zomorodian, Afra
last_name: Zomorodian
citation:
ama: Edelsbrunner H, Zomorodian A. Computing linking numbers of a filtration. Homology,
Homotopy and Applications. 2003;5(2):19-37.
apa: Edelsbrunner, H., & Zomorodian, A. (2003). Computing linking numbers of
a filtration. Homology, Homotopy and Applications. International Press.
chicago: Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers
of a Filtration.” Homology, Homotopy and Applications. International Press,
2003.
ieee: H. Edelsbrunner and A. Zomorodian, “Computing linking numbers of a filtration,”
Homology, Homotopy and Applications, vol. 5, no. 2. International Press,
pp. 19–37, 2003.
ista: Edelsbrunner H, Zomorodian A. 2003. Computing linking numbers of a filtration.
Homology, Homotopy and Applications. 5(2), 19–37.
mla: Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a
Filtration.” Homology, Homotopy and Applications, vol. 5, no. 2, International
Press, 2003, pp. 19–37.
short: H. Edelsbrunner, A. Zomorodian, Homology, Homotopy and Applications 5 (2003)
19–37.
date_created: 2018-12-11T12:04:05Z
date_published: 2003-04-22T00:00:00Z
date_updated: 2021-01-12T07:44:28Z
day: '22'
extern: '1'
intvolume: ' 5'
issue: '2'
language:
- iso: eng
main_file_link:
- url: http://projecteuclid.org/euclid.hha/1088453320
month: '04'
oa_version: None
page: 19 - 37
publication: Homology, Homotopy and Applications
publication_status: published
publisher: International Press
publist_id: '2801'
quality_controlled: '1'
status: public
title: Computing linking numbers of a filtration
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2003'
...
---
_id: '3620'
abstract:
- lang: eng
text: 'Stable hybrid zones in which ecologically divergent taxa give rise to a range
of recombinants are natural laboratories in which the genetic basis of adaptation
and reproductive isolation can be unraveled. One such hybrid zone is formed by
the fire-bellied toads Bombina bombina and B. variegata (Anura: Discoglossidae).
Adaptations to permanent and ephemeral breeding habitats, respectively, have shaped
numerous phenotypic differences between the taxa. All of these are, in principle,
candidates for a genetic dissection via QTL mapping. We present here a linkage
map of 28 codominant and 10 dominant markers in the Bombina genome. In an F2 cross,
markers that were mainly microsatellites, SSCPs or allozymes were mapped to 20
linkage groups. Among the 40 isolated CA microsatellites, we noted a preponderance
of compound and frequently interleaved CA-TA repeats as well as a striking polarity
at the 5′ end of the repeats.'
author:
- first_name: Beate
full_name: Nürnberger, Beate
last_name: Nürnberger
- first_name: Sebastian
full_name: Hofman, Sebastian
last_name: Hofman
- first_name: Bqruni
full_name: Förg-Brey, Bqruni
last_name: Förg Brey
- first_name: Gabriele
full_name: Praetzel, Gabriele
last_name: Praetzel
- first_name: Alan
full_name: Maclean, Alan W
last_name: Maclean
- first_name: Jacek
full_name: Szymura, Jacek M
last_name: Szymura
- first_name: Catherine
full_name: Abbott, Catherine M
last_name: Abbott
- first_name: Nicholas H
full_name: Nicholas Barton
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Nürnberger B, Hofman S, Förg Brey B, et al. A linkage map for the hybridising
toads Bombina bombina and B. variegata (Anura: Discoglossidae). Heredity.
2003;91(2):136-142. doi:10.1038/sj.hdy.6800291'
apa: 'Nürnberger, B., Hofman, S., Förg Brey, B., Praetzel, G., Maclean, A., Szymura,
J., … Barton, N. H. (2003). A linkage map for the hybridising toads Bombina bombina
and B. variegata (Anura: Discoglossidae). Heredity. Nature Publishing Group.
https://doi.org/10.1038/sj.hdy.6800291'
chicago: 'Nürnberger, Beate, Sebastian Hofman, Bqruni Förg Brey, Gabriele Praetzel,
Alan Maclean, Jacek Szymura, Catherine Abbott, and Nicholas H Barton. “A Linkage
Map for the Hybridising Toads Bombina Bombina and B. Variegata (Anura: Discoglossidae).”
Heredity. Nature Publishing Group, 2003. https://doi.org/10.1038/sj.hdy.6800291.'
ieee: 'B. Nürnberger et al., “A linkage map for the hybridising toads Bombina
bombina and B. variegata (Anura: Discoglossidae),” Heredity, vol. 91, no.
2. Nature Publishing Group, pp. 136–142, 2003.'
ista: 'Nürnberger B, Hofman S, Förg Brey B, Praetzel G, Maclean A, Szymura J, Abbott
C, Barton NH. 2003. A linkage map for the hybridising toads Bombina bombina and
B. variegata (Anura: Discoglossidae). Heredity. 91(2), 136–142.'
mla: 'Nürnberger, Beate, et al. “A Linkage Map for the Hybridising Toads Bombina
Bombina and B. Variegata (Anura: Discoglossidae).” Heredity, vol. 91, no.
2, Nature Publishing Group, 2003, pp. 136–42, doi:10.1038/sj.hdy.6800291.'
short: B. Nürnberger, S. Hofman, B. Förg Brey, G. Praetzel, A. Maclean, J. Szymura,
C. Abbott, N.H. Barton, Heredity 91 (2003) 136–142.
date_created: 2018-12-11T12:04:17Z
date_published: 2003-08-01T00:00:00Z
date_updated: 2021-01-12T07:44:43Z
day: '01'
doi: 10.1038/sj.hdy.6800291
extern: 1
intvolume: ' 91'
issue: '2'
month: '08'
page: 136 - 142
publication: Heredity
publication_status: published
publisher: Nature Publishing Group
publist_id: '2763'
quality_controlled: 0
status: public
title: 'A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura:
Discoglossidae)'
type: journal_article
volume: 91
year: '2003'
...
---
_id: '3619'
abstract:
- lang: eng
text: What is the chance that some part of a stretch of genome will survive? In
a population of constant size, and with no selection, the probability of survival
of some part of a stretch of map length y<1 approaches View the MathML source
for View the MathML source. Thus, the whole genome is certain to be lost, but
the rate of loss is extremely slow. This solution extends to give the whole distribution
of surviving block sizes as a function of time. We show that the expected number
of blocks at time t is 1+yt and give expressions for the moments of the number
of blocks and the total amount of genome that survives for a given time. The solution
is based on a branching process and assumes complete interference between crossovers,
so that each descendant carries only a single block of ancestral material. We
consider cases where most individuals carry multiple blocks, either because there
are multiple crossovers in a long genetic map, or because enough time has passed
that most individuals in the population are related to each other. For species
such as ours, which have a long genetic map, the genome of any individual which
leaves descendants (∼80% of the population for a Poisson offspring number with
mean two) is likely to persist for an extremely long time, in the form of a few
short blocks of genome.
author:
- first_name: Stuart
full_name: Baird, Stuart J
last_name: Baird
- first_name: Nicholas H
full_name: Nicholas Barton
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Alison
full_name: Etheridge, Alison M
last_name: Etheridge
citation:
ama: Baird S, Barton NH, Etheridge A. The distribution of surviving blocks of an
ancestral genome. Theoretical Population Biology. 2003;64(4):451-471. doi:10.1016/S0040-5809(03)00098-4
apa: Baird, S., Barton, N. H., & Etheridge, A. (2003). The distribution of surviving
blocks of an ancestral genome. Theoretical Population Biology. Academic
Press. https://doi.org/10.1016/S0040-5809(03)00098-4
chicago: Baird, Stuart, Nicholas H Barton, and Alison Etheridge. “The Distribution
of Surviving Blocks of an Ancestral Genome.” Theoretical Population Biology.
Academic Press, 2003. https://doi.org/10.1016/S0040-5809(03)00098-4.
ieee: S. Baird, N. H. Barton, and A. Etheridge, “The distribution of surviving blocks
of an ancestral genome,” Theoretical Population Biology, vol. 64, no. 4.
Academic Press, pp. 451–471, 2003.
ista: Baird S, Barton NH, Etheridge A. 2003. The distribution of surviving blocks
of an ancestral genome. Theoretical Population Biology. 64(4), 451–471.
mla: Baird, Stuart, et al. “The Distribution of Surviving Blocks of an Ancestral
Genome.” Theoretical Population Biology, vol. 64, no. 4, Academic Press,
2003, pp. 451–71, doi:10.1016/S0040-5809(03)00098-4.
short: S. Baird, N.H. Barton, A. Etheridge, Theoretical Population Biology 64 (2003)
451–471.
date_created: 2018-12-11T12:04:17Z
date_published: 2003-12-01T00:00:00Z
date_updated: 2021-01-12T07:44:42Z
day: '01'
doi: 10.1016/S0040-5809(03)00098-4
extern: 1
intvolume: ' 64'
issue: '4'
month: '12'
page: 451 - 471
publication: Theoretical Population Biology
publication_status: published
publisher: Academic Press
publist_id: '2764'
quality_controlled: 0
status: public
title: The distribution of surviving blocks of an ancestral genome
type: journal_article
volume: 64
year: '2003'
...
---
_id: '3618'
abstract:
- lang: eng
text: There are several analyses in evolutionary ecology which assume that a family
of offspring has come from only two parents. Here, we present a simple test for
detecting when a batch involves two or more subfamilies. It is based on the fact
that the mixing of families generates associations amongst unlinked marker loci.
We also present simulations illustrating the power of our method for varying numbers
of loci, alleles per locus and genotyped individuals.
author:
- first_name: Timothy
full_name: Vines, Timothy H
last_name: Vines
- first_name: Nicholas H
full_name: Nicholas Barton
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Vines T, Barton NH. A new approach to detecting mixed families. Molecular
Ecology. 2003;12(7):1999-2002. doi:10.1046/j.1365-294X.2003.01867.x
apa: Vines, T., & Barton, N. H. (2003). A new approach to detecting mixed families.
Molecular Ecology. Wiley-Blackwell. https://doi.org/10.1046/j.1365-294X.2003.01867.x
chicago: Vines, Timothy, and Nicholas H Barton. “A New Approach to Detecting Mixed
Families.” Molecular Ecology. Wiley-Blackwell, 2003. https://doi.org/10.1046/j.1365-294X.2003.01867.x.
ieee: T. Vines and N. H. Barton, “A new approach to detecting mixed families,” Molecular
Ecology, vol. 12, no. 7. Wiley-Blackwell, pp. 1999–2002, 2003.
ista: Vines T, Barton NH. 2003. A new approach to detecting mixed families. Molecular
Ecology. 12(7), 1999–2002.
mla: Vines, Timothy, and Nicholas H. Barton. “A New Approach to Detecting Mixed
Families.” Molecular Ecology, vol. 12, no. 7, Wiley-Blackwell, 2003, pp.
1999–2002, doi:10.1046/j.1365-294X.2003.01867.x.
short: T. Vines, N.H. Barton, Molecular Ecology 12 (2003) 1999–2002.
date_created: 2018-12-11T12:04:16Z
date_published: 2003-07-01T00:00:00Z
date_updated: 2021-01-12T07:44:42Z
day: '01'
doi: 10.1046/j.1365-294X.2003.01867.x
extern: 1
intvolume: ' 12'
issue: '7'
month: '07'
page: 1999 - 2002
publication: Molecular Ecology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2765'
quality_controlled: 0
status: public
title: A new approach to detecting mixed families
type: journal_article
volume: 12
year: '2003'
...
---
_id: '3752'
abstract:
- lang: eng
text: We use the lac operon in Escherichia coli as a prototype system to illustrate
the current state, applicability, and limitations of modeling the dynamics of
cellular networks. We integrate three different levels of description (molecular,
cellular, and that of cell population) into a single model, which seems to capture
many experimental aspects of the system.
author:
- first_name: Jose
full_name: Vilar,Jose M
last_name: Vilar
- first_name: Calin C
full_name: Calin Guet
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Stanislas
full_name: Leibler, Stanislas
last_name: Leibler
citation:
ama: 'Vilar J, Guet CC, Leibler S. Modeling network dynamics: the lac operon, a
case study. Journal of Cell Biology. 2003;161(3):471-476. doi:10.1083/jcb.200301125'
apa: 'Vilar, J., Guet, C. C., & Leibler, S. (2003). Modeling network dynamics:
the lac operon, a case study. Journal of Cell Biology. Rockefeller University
Press. https://doi.org/10.1083/jcb.200301125'
chicago: 'Vilar, Jose, Calin C Guet, and Stanislas Leibler. “Modeling Network Dynamics:
The Lac Operon, a Case Study.” Journal of Cell Biology. Rockefeller University
Press, 2003. https://doi.org/10.1083/jcb.200301125.'
ieee: 'J. Vilar, C. C. Guet, and S. Leibler, “Modeling network dynamics: the lac
operon, a case study,” Journal of Cell Biology, vol. 161, no. 3. Rockefeller
University Press, pp. 471–476, 2003.'
ista: 'Vilar J, Guet CC, Leibler S. 2003. Modeling network dynamics: the lac operon,
a case study. Journal of Cell Biology. 161(3), 471–476.'
mla: 'Vilar, Jose, et al. “Modeling Network Dynamics: The Lac Operon, a Case Study.”
Journal of Cell Biology, vol. 161, no. 3, Rockefeller University Press,
2003, pp. 471–76, doi:10.1083/jcb.200301125.'
short: J. Vilar, C.C. Guet, S. Leibler, Journal of Cell Biology 161 (2003) 471–476.
date_created: 2018-12-11T12:04:58Z
date_published: 2003-01-12T00:00:00Z
date_updated: 2021-01-12T07:51:57Z
day: '12'
doi: 10.1083/jcb.200301125
extern: 1
intvolume: ' 161'
issue: '3'
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2172934/?tool=pubmed
month: '01'
oa: 1
page: 471 - 476
publication: Journal of Cell Biology
publication_status: published
publisher: Rockefeller University Press
publist_id: '2475'
quality_controlled: 0
status: public
title: 'Modeling network dynamics: the lac operon, a case study'
type: journal_article
volume: 161
year: '2003'
...
---
_id: '3797'
article_processing_charge: No
author:
- first_name: Wolfgang
full_name: Bauer, Wolfgang
last_name: Bauer
- first_name: Marco
full_name: Kleine Berkenbusch, Marco
last_name: Kleine Berkenbusch
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: 'Bauer W, Kleine Berkenbusch M, Bollenbach MT. Breaking atomic nuclei into
little pieces: evidence for a phase transition. Revista Mexicana De Fisica.
2003;49(4):1-6.'
apa: 'Bauer, W., Kleine Berkenbusch, M., & Bollenbach, M. T. (2003). Breaking
atomic nuclei into little pieces: evidence for a phase transition. Revista
Mexicana De Fisica. Sociedad Mexicana de Física.'
chicago: 'Bauer, Wolfgang, Marco Kleine Berkenbusch, and Mark Tobias Bollenbach.
“Breaking Atomic Nuclei into Little Pieces: Evidence for a Phase Transition.”
Revista Mexicana De Fisica. Sociedad Mexicana de Física, 2003.'
ieee: 'W. Bauer, M. Kleine Berkenbusch, and M. T. Bollenbach, “Breaking atomic nuclei
into little pieces: evidence for a phase transition,” Revista Mexicana De Fisica,
vol. 49, no. 4. Sociedad Mexicana de Física, pp. 1–6, 2003.'
ista: 'Bauer W, Kleine Berkenbusch M, Bollenbach MT. 2003. Breaking atomic nuclei
into little pieces: evidence for a phase transition. Revista Mexicana De Fisica.
49(4), 1–6.'
mla: 'Bauer, Wolfgang, et al. “Breaking Atomic Nuclei into Little Pieces: Evidence
for a Phase Transition.” Revista Mexicana De Fisica, vol. 49, no. 4, Sociedad
Mexicana de Física, 2003, pp. 1–6.'
short: W. Bauer, M. Kleine Berkenbusch, M.T. Bollenbach, Revista Mexicana De Fisica
49 (2003) 1–6.
date_created: 2018-12-11T12:05:13Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:16Z
day: '01'
extern: '1'
intvolume: ' 49'
issue: '4'
language:
- iso: eng
month: '01'
oa_version: None
page: 1 - 6
publication: Revista Mexicana De Fisica
publication_status: published
publisher: Sociedad Mexicana de Física
publist_id: '2413'
status: public
title: 'Breaking atomic nuclei into little pieces: evidence for a phase transition'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 49
year: '2003'
...
---
_id: '3897'
abstract:
- lang: eng
text: Many verification, planning, and control problems can be modeled as games
played on state-transition graphs by one or two players whose conflicting goals
are to form a path in the graph. The focus here is on simple stochastic parity
games, that is, two-player games with turn-based probabilistic transitions and
omega-regular objectives formalized as parity (Rabin chain) winning conditions.
An efficient translation from simple stochastic parity games to nonstochastic
parity games is given. As many algorithms are known for solving the latter, the
translation yields efficient algorithms for computing the states of a simple stochastic
parity game from which a player can win with probability 1. An important special
case of simple stochastic parity games are the Markov decision processes with
Buchi objectives. For this special case a first provably subquadratic algorithm
is given for computing the states from which the single player has a strategy
to achieve a Buchi objective with probability 1. For game graphs with m edges
the algorithm works in time O(mrootm). Interestingly, a similar technique sheds
light on the question of the computational complexity of solving simple Buchi
games and yields the first provably subquadratic algorithm, with a running time
of O(n(2)/log n) for game graphs with n vertices and O(n) edges.
acknowledgement: This research was supported in part by the DARPA grant F33615-C-98-3614,
the ONR grant N00014-02-1-0671, the NSF grants CCR-9988172 and CCR-0225610, and
the Polish KBN grant 7-T11C-027-20.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Marcin
full_name: Jurdziński, Marcin
last_name: Jurdziński
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Jurdziński M, Henzinger TA. Simple stochastic parity games.
In: Vol 2803. Springer; 2003:100-113. doi:10.1007/978-3-540-45220-1_11'
apa: 'Chatterjee, K., Jurdziński, M., & Henzinger, T. A. (2003). Simple stochastic
parity games (Vol. 2803, pp. 100–113). Presented at the CSL: Computer Science
Logic, Springer. https://doi.org/10.1007/978-3-540-45220-1_11'
chicago: Chatterjee, Krishnendu, Marcin Jurdziński, and Thomas A Henzinger. “Simple
Stochastic Parity Games,” 2803:100–113. Springer, 2003. https://doi.org/10.1007/978-3-540-45220-1_11.
ieee: 'K. Chatterjee, M. Jurdziński, and T. A. Henzinger, “Simple stochastic parity
games,” presented at the CSL: Computer Science Logic, 2003, vol. 2803, pp. 100–113.'
ista: 'Chatterjee K, Jurdziński M, Henzinger TA. 2003. Simple stochastic parity
games. CSL: Computer Science Logic, LNCS, vol. 2803, 100–113.'
mla: Chatterjee, Krishnendu, et al. Simple Stochastic Parity Games. Vol.
2803, Springer, 2003, pp. 100–13, doi:10.1007/978-3-540-45220-1_11.
short: K. Chatterjee, M. Jurdziński, T.A. Henzinger, in:, Springer, 2003, pp. 100–113.
conference:
name: 'CSL: Computer Science Logic'
date_created: 2018-12-11T12:05:46Z
date_published: 2003-08-18T00:00:00Z
date_updated: 2021-01-12T07:53:02Z
day: '18'
doi: 10.1007/978-3-540-45220-1_11
extern: 1
intvolume: ' 2803'
month: '08'
page: 100 - 113
publication_status: published
publisher: Springer
publist_id: '2259'
quality_controlled: 0
status: public
title: Simple stochastic parity games
type: conference
volume: 2803
year: '2003'
...
---
_id: '3898'
abstract:
- lang: eng
text: We study the problem of determining stack boundedness and the exact maximum
stack size for three classes of interrupt-driven programs. Interrupt-driven programs
axe used in many real-time applications that require responsive interrupt handling.
In order to ensure responsiveness, programmers often enable interrupt processing
in the body of lower-priority interrupt handlers. In such programs a programming
error can allow interrupt handlers to be interrupted in cyclic fashion to lead
to an unbounded stack, causing the system to crash. For a restricted class of
interrupt-driven programs, we show that there is a polynomial-time procedure to
check stack boundedness, while determining the exact maximum stack size is PSPACE-complete.
For a larger class of programs, the two problems are both PSPACE-complete, and
for the largest class of programs we consider, the two problems are PSPACE-hard
and can be solved in exponential time.
acknowledgement: Jens Palsberg, Di Ma, and Tian Zhao were supported by the NSF ITR
award 0112628. Thomas A. Henzinger, Krishnendu Chatterjee, and Rupak Majumdar were
supported by the AFOSR grant F49620-00-1-0327, the DARPA grants F33615-C-98-3614
and F33615-00-C-1693, the MARCO grant 98-DT-660, and the NSF grants CCR-0208875
and CCR-0085949.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Di
full_name: Ma, Di
last_name: Ma
- first_name: Ritankar
full_name: Majumdar, Ritankar S
last_name: Majumdar
- first_name: Tian
full_name: Zhao, Tian
last_name: Zhao
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jens
full_name: Palsberg, Jens
last_name: Palsberg
citation:
ama: 'Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. Stack size
analysis for interrupt-driven programs. In: Vol 2694. Springer; 2003:109-126.
doi:10.1007/3-540-44898-5_7'
apa: 'Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., & Palsberg,
J. (2003). Stack size analysis for interrupt-driven programs (Vol. 2694, pp. 109–126).
Presented at the SAS: Static Analysis Symposium, Springer. https://doi.org/10.1007/3-540-44898-5_7'
chicago: Chatterjee, Krishnendu, Di Ma, Ritankar Majumdar, Tian Zhao, Thomas A Henzinger,
and Jens Palsberg. “Stack Size Analysis for Interrupt-Driven Programs,” 2694:109–26.
Springer, 2003. https://doi.org/10.1007/3-540-44898-5_7.
ieee: 'K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T. A. Henzinger, and J. Palsberg,
“Stack size analysis for interrupt-driven programs,” presented at the SAS: Static
Analysis Symposium, 2003, vol. 2694, pp. 109–126.'
ista: 'Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2003. Stack
size analysis for interrupt-driven programs. SAS: Static Analysis Symposium, LNCS,
vol. 2694, 109–126.'
mla: Chatterjee, Krishnendu, et al. Stack Size Analysis for Interrupt-Driven
Programs. Vol. 2694, Springer, 2003, pp. 109–26, doi:10.1007/3-540-44898-5_7.
short: K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg,
in:, Springer, 2003, pp. 109–126.
conference:
name: 'SAS: Static Analysis Symposium'
date_created: 2018-12-11T12:05:46Z
date_published: 2003-05-28T00:00:00Z
date_updated: 2021-01-12T07:53:02Z
day: '28'
doi: 10.1007/3-540-44898-5_7
extern: 1
intvolume: ' 2694'
month: '05'
page: 109 - 126
publication_status: published
publisher: Springer
publist_id: '2260'
quality_controlled: 0
status: public
title: Stack size analysis for interrupt-driven programs
type: conference
volume: 2694
year: '2003'
...
---
_id: '3993'
abstract:
- lang: eng
text: We present algorithms for constructing a hierarchy of increasingly coarse
Morse-Smale complexes that decompose a piecewise linear 2-manifold. While these
complexes are defined only in the smooth category, we extend the construction
to the piecewise linearcategory by ensuring structural integrity and simulating
differentiability. We then simplify Morse-Smale complexes by canceling pairs of
critical points in order of increasing persistence.
acknowledgement: Partially supported by ARO under Grant DAAG55-98-1-0177, NSF under
Grants CCR-97-12088, EIA-9972879 and CCR-00-86013.
author:
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: John
full_name: Harer, John
last_name: Harer
- first_name: Afra
full_name: Zomorodian, Afra
last_name: Zomorodian
citation:
ama: Edelsbrunner H, Harer J, Zomorodian A. Hierarchical Morse-Smale complexes for
piecewise linear 2-manifolds. Discrete & Computational Geometry. 2003;30(1):87-107.
doi:10.1007/s00454-003-2926-5
apa: Edelsbrunner, H., Harer, J., & Zomorodian, A. (2003). Hierarchical Morse-Smale
complexes for piecewise linear 2-manifolds. Discrete & Computational Geometry.
Springer. https://doi.org/10.1007/s00454-003-2926-5
chicago: Edelsbrunner, Herbert, John Harer, and Afra Zomorodian. “Hierarchical Morse-Smale
Complexes for Piecewise Linear 2-Manifolds.” Discrete & Computational Geometry.
Springer, 2003. https://doi.org/10.1007/s00454-003-2926-5.
ieee: H. Edelsbrunner, J. Harer, and A. Zomorodian, “Hierarchical Morse-Smale complexes
for piecewise linear 2-manifolds,” Discrete & Computational Geometry,
vol. 30, no. 1. Springer, pp. 87–107, 2003.
ista: Edelsbrunner H, Harer J, Zomorodian A. 2003. Hierarchical Morse-Smale complexes
for piecewise linear 2-manifolds. Discrete & Computational Geometry. 30(1),
87–107.
mla: Edelsbrunner, Herbert, et al. “Hierarchical Morse-Smale Complexes for Piecewise
Linear 2-Manifolds.” Discrete & Computational Geometry, vol. 30, no.
1, Springer, 2003, pp. 87–107, doi:10.1007/s00454-003-2926-5.
short: H. Edelsbrunner, J. Harer, A. Zomorodian, Discrete & Computational Geometry
30 (2003) 87–107.
date_created: 2018-12-11T12:06:19Z
date_published: 2003-07-01T00:00:00Z
date_updated: 2021-01-12T07:53:43Z
day: '01'
doi: 10.1007/s00454-003-2926-5
extern: 1
intvolume: ' 30'
issue: '1'
month: '07'
page: 87 - 107
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '2134'
quality_controlled: 0
status: public
title: Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds
type: journal_article
volume: 30
year: '2003'
...
---
_id: '3994'
abstract:
- lang: eng
text: The body defined by a finite collection of disks is a subset of the plane
bounded by a tangent continuous curve, which we call the skin. We give analytic
formulas for the area, the perimeter, the area derivative, and the perimeter derivative
of the body. Given the filtrations of the Delaunay triangulation and the Voronoi
diagram of the disks, all formulas can be evaluated in time proportional to the
number of disks.
acknowledgement: NSF under grant DMS-98-73945, ARO under grant DAAG55-98-1-0177 and
by NSF under grants CCR- 97-12088, EIA-9972879, and CCR-00-86013.
author:
- first_name: Ho
full_name: Cheng, Ho-Lun
last_name: Cheng
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Cheng H, Edelsbrunner H. Area, perimeter and derivatives of a skin curve.
Computational Geometry: Theory and Applications. 2003;26(2):173-192. doi:10.1016/S0925-7721(02)00124-4'
apa: 'Cheng, H., & Edelsbrunner, H. (2003). Area, perimeter and derivatives
of a skin curve. Computational Geometry: Theory and Applications. Elsevier.
https://doi.org/10.1016/S0925-7721(02)00124-4'
chicago: 'Cheng, Ho, and Herbert Edelsbrunner. “Area, Perimeter and Derivatives
of a Skin Curve.” Computational Geometry: Theory and Applications. Elsevier,
2003. https://doi.org/10.1016/S0925-7721(02)00124-4.'
ieee: 'H. Cheng and H. Edelsbrunner, “Area, perimeter and derivatives of a skin
curve,” Computational Geometry: Theory and Applications, vol. 26, no. 2.
Elsevier, pp. 173–192, 2003.'
ista: 'Cheng H, Edelsbrunner H. 2003. Area, perimeter and derivatives of a skin
curve. Computational Geometry: Theory and Applications. 26(2), 173–192.'
mla: 'Cheng, Ho, and Herbert Edelsbrunner. “Area, Perimeter and Derivatives of a
Skin Curve.” Computational Geometry: Theory and Applications, vol. 26,
no. 2, Elsevier, 2003, pp. 173–92, doi:10.1016/S0925-7721(02)00124-4.'
short: 'H. Cheng, H. Edelsbrunner, Computational Geometry: Theory and Applications
26 (2003) 173–192.'
date_created: 2018-12-11T12:06:20Z
date_published: 2003-10-01T00:00:00Z
date_updated: 2021-01-12T07:53:43Z
day: '01'
doi: 10.1016/S0925-7721(02)00124-4
extern: 1
intvolume: ' 26'
issue: '2'
month: '10'
page: 173 - 192
publication: 'Computational Geometry: Theory and Applications'
publication_status: published
publisher: Elsevier
publist_id: '2135'
quality_controlled: 0
status: public
title: Area, perimeter and derivatives of a skin curve
type: journal_article
volume: 26
year: '2003'
...