---
_id: '3356'
abstract:
- lang: eng
  text: There is recently a significant effort to add quantitative objectives to formal
    verification and synthesis. We introduce and investigate the extension of temporal
    logics with quantitative atomic assertions, aiming for a general and flexible
    framework for quantitative-oriented specifications. In the heart of quantitative
    objectives lies the accumulation of values along a computation. It is either the
    accumulated summation, as with the energy objectives, or the accumulated average,
    as with the mean-payoff objectives. We investigate the extension of temporal logics
    with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is
    a numeric variable of the system, c is a constant rational number, and Sum(v)
    and Avg(v) denote the accumulated sum and average of the values of v from the
    beginning of the computation up to the current point of time. We also allow the
    path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring
    to the average value along an entire computation. We study the border of decidability
    for extensions of various temporal logics. In particular, we show that extending
    the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by
    prefix-accumulation assertions and extending LTL with path-accumulation assertions,
    result in temporal logics whose model-checking problem is decidable. The extended
    logics allow to significantly extend the currently known energy and mean-payoff
    objectives. Moreover, the prefix-accumulation assertions may be refined with "controlled-accumulation",
    allowing, for example, to specify constraints on the average waiting time between
    a request and a grant. On the negative side, we show that the fragment we point
    to is, in a sense, the maximal logic whose extension with prefix-accumulation
    assertions permits a decidable model-checking procedure. Extending a temporal
    logic that has the EG or EU modalities, and in particular CTL and LTL, makes the
    problem undecidable.
article_number: '5970226'
article_processing_charge: No
author:
- first_name: Udi
  full_name: Boker, Udi
  id: 31E297B6-F248-11E8-B48F-1D18A9856A87
  last_name: Boker
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- 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: Orna
  full_name: Kupferman, Orna
  last_name: Kupferman
citation:
  ama: 'Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications
    with accumulative values. In: IEEE; 2011. doi:<a href="https://doi.org/10.1109/LICS.2011.33">10.1109/LICS.2011.33</a>'
  apa: 'Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). Temporal
    specifications with accumulative values. Presented at the LICS: Logic in Computer
    Science, Toronto, Canada: IEEE. <a href="https://doi.org/10.1109/LICS.2011.33">https://doi.org/10.1109/LICS.2011.33</a>'
  chicago: Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman.
    “Temporal Specifications with Accumulative Values.” IEEE, 2011. <a href="https://doi.org/10.1109/LICS.2011.33">https://doi.org/10.1109/LICS.2011.33</a>.
  ieee: 'U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications
    with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto,
    Canada, 2011.'
  ista: 'Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications
    with accumulative values. LICS: Logic in Computer Science, 5970226.'
  mla: Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>.
    5970226, IEEE, 2011, doi:<a href="https://doi.org/10.1109/LICS.2011.33">10.1109/LICS.2011.33</a>.
  short: U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.
conference:
  end_date: 2011-06-24
  location: Toronto, Canada
  name: 'LICS: Logic in Computer Science'
  start_date: 2011-06-21
date_created: 2018-12-11T12:02:52Z
date_published: 2011-06-21T00:00:00Z
date_updated: 2026-07-07T14:01:43Z
day: '21'
ddc:
- '000'
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1109/LICS.2011.33
ec_funded: 1
external_id:
  isi:
  - '000297350400007'
file:
- access_level: open_access
  checksum: 792128f5455f0f40f1105f0398e05fa9
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:12:42Z
  date_updated: 2020-07-14T12:46:09Z
  file_id: '4960'
  file_name: IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf
  file_size: 225426
  relation: main_file
file_date_updated: 2020-07-14T12:46:09Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '215543'
  name: COMponent-Based Embedded Systems design Techniques
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '214373'
  name: Design for Embedded Systems
- _id: 2587B514-B435-11E9-9278-68D0E5697425
  name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: IEEE
publist_id: '3259'
pubrep_id: '83'
related_material:
  record:
  - id: '5385'
    relation: earlier_version
    status: public
  - id: '2038'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Temporal specifications with accumulative values
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2011'
...
---
_id: '5385'
abstract:
- lang: eng
  text: There is recently a significant effort to add quantitative objectives to formal
    verification and synthesis. We introduce and investigate the extension of temporal
    logics with quantitative atomic assertions, aiming for a general and flexible
    framework for quantitative-oriented specifications. In the heart of quantitative
    objectives lies the accumulation of values along a computation. It is either the
    accumulated summation, as with the energy objectives, or the accumulated average,
    as with the mean-payoff objectives. We investigate the extension of temporal logics
    with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is
    a numeric variable of the system, c is a constant rational number, and Sum(v)
    and Avg(v) denote the accumulated sum and average of the values of v from the
    beginning of the computation up to the current point of time. We also allow the
    path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring
    to the average value along an entire computation. We study the border of decidability
    for extensions of various temporal logics. In particular, we show that extending
    the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by
    prefix-accumulation assertions and extending LTL with path-accumulation assertions,
    result in temporal logics whose model-checking problem is decidable. The extended
    logics allow to significantly extend the currently known energy and mean-payoff
    objectives. Moreover, the prefix-accumulation assertions may be refined with “controlled-accumulation”,
    allowing, for example, to specify constraints on the average waiting time between
    a request and a grant. On the negative side, we show that the fragment we point
    to is, in a sense, the maximal logic whose extension with prefix-accumulation
    assertions permits a decidable model-checking procedure. Extending a temporal
    logic that has the EG or EU modalities, and in particular CTL and LTL, makes the
    problem undecidable.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Udi
  full_name: Boker, Udi
  id: 31E297B6-F248-11E8-B48F-1D18A9856A87
  last_name: Boker
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- 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: Orna
  full_name: Kupferman, Orna
  last_name: Kupferman
citation:
  ama: Boker U, Chatterjee K, Henzinger TA, Kupferman O. <i>Temporal Specifications
    with Accumulative Values</i>. IST Austria; 2011. doi:<a href="https://doi.org/10.15479/AT:IST-2011-0003">10.15479/AT:IST-2011-0003</a>
  apa: Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). <i>Temporal
    specifications with accumulative values</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2011-0003">https://doi.org/10.15479/AT:IST-2011-0003</a>
  chicago: Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman.
    <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011. <a
    href="https://doi.org/10.15479/AT:IST-2011-0003">https://doi.org/10.15479/AT:IST-2011-0003</a>.
  ieee: U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, <i>Temporal specifications
    with accumulative values</i>. IST Austria, 2011.
  ista: Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications
    with accumulative values, IST Austria, 14p.
  mla: Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>.
    IST Austria, 2011, doi:<a href="https://doi.org/10.15479/AT:IST-2011-0003">10.15479/AT:IST-2011-0003</a>.
  short: U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications
    with Accumulative Values, IST Austria, 2011.
date_created: 2018-12-12T11:39:02Z
date_published: 2011-04-04T00:00:00Z
date_updated: 2026-07-07T14:01:43Z
day: '04'
ddc:
- '000'
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.15479/AT:IST-2011-0003
ec_funded: 1
file:
- access_level: open_access
  checksum: 8491d0d48c4911620ecd5350b413c11e
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:00Z
  date_updated: 2020-07-14T12:46:41Z
  file_id: '5461'
  file_name: IST-2011-0003_IST-2011-0003.pdf
  file_size: 366281
  relation: main_file
file_date_updated: 2020-07-14T12:46:41Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '14'
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '215543'
  name: COMponent-Based Embedded Systems design Techniques
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '214373'
  name: Design for Embedded Systems
- _id: 2587B514-B435-11E9-9278-68D0E5697425
  name: Microsoft Research Faculty Fellowship
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '21'
related_material:
  record:
  - id: '3356'
    relation: later_version
    status: public
  - id: '2038'
    relation: later_version
    status: public
status: public
title: Temporal specifications with accumulative values
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5381'
abstract:
- lang: eng
  text: "In two-player finite-state stochastic games of partial obser- vation on graphs,
    in every state of the graph, the players simultaneously choose an action, and
    their joint actions determine a probability distri- bution over the successor
    states. The game is played for infinitely many rounds and thus the players construct
    an infinite path in the graph. We consider reachability objectives where the first
    player tries to ensure a target state to be visited almost-surely (i.e., with
    probability 1) or pos- itively (i.e., with positive probability), no matter the
    strategy of the second player.\r\n\r\nWe classify such games according to the
    information and to the power of randomization available to the players. On the
    basis of information, the game can be one-sided with either (a) player 1, or (b)
    player 2 having partial observation (and the other player has perfect observation),
    or two- sided with (c) both players having partial observation. On the basis of
    randomization, (a) the players may not be allowed to use randomization (pure strategies),
    or (b) they may choose a probability distribution over actions but the actual
    random choice is external and not visible to the player (actions invisible), or
    (c) they may use full randomization.\r\n\r\nOur main results for pure strategies
    are as follows: (1) For one-sided games with player 2 perfect observation we show
    that (in contrast to full randomized strategies) belief-based (subset-construction
    based) strate- gies are not sufficient, and present an exponential upper bound
    on mem- ory both for almost-sure and positive winning strategies; we show that
    the problem of deciding the existence of almost-sure and positive winning strategies
    for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid
    the explicit exponential construction. (2) For one-sided games with player 1 perfect
    observation we show that non-elementary memory is both necessary and sufficient
    for both almost-sure and posi- tive winning strategies. (3) We show that for the
    general (two-sided) case finite-memory strategies are sufficient for both positive
    and almost-sure winning, and at least non-elementary memory is required. We establish
    the equivalence of the almost-sure winning problems for pure strategies and for
    randomized strategies with actions invisible. Our equivalence re- sult exhibit
    serious flaws in previous results in the literature: we show a non-elementary
    memory lower bound for almost-sure winning whereas an exponential upper bound
    was previously claimed."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Laurent
  full_name: Doyen, Laurent
  last_name: Doyen
citation:
  ama: 'Chatterjee K, Doyen L. <i>Partial-Observation Stochastic Games: How to Win
    When Belief Fails</i>. IST Austria; 2011. doi:<a href="https://doi.org/10.15479/AT:IST-2011-0007">10.15479/AT:IST-2011-0007</a>'
  apa: 'Chatterjee, K., &#38; Doyen, L. (2011). <i>Partial-observation stochastic
    games: How to win when belief fails</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2011-0007">https://doi.org/10.15479/AT:IST-2011-0007</a>'
  chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic
    Games: How to Win When Belief Fails</i>. IST Austria, 2011. <a href="https://doi.org/10.15479/AT:IST-2011-0007">https://doi.org/10.15479/AT:IST-2011-0007</a>.'
  ieee: 'K. Chatterjee and L. Doyen, <i>Partial-observation stochastic games: How
    to win when belief fails</i>. IST Austria, 2011.'
  ista: 'Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to
    win when belief fails, IST Austria, 43p.'
  mla: 'Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic
    Games: How to Win When Belief Fails</i>. IST Austria, 2011, doi:<a href="https://doi.org/10.15479/AT:IST-2011-0007">10.15479/AT:IST-2011-0007</a>.'
  short: 'K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win
    When Belief Fails, IST Austria, 2011.'
date_created: 2018-12-12T11:39:00Z
date_published: 2011-07-05T00:00:00Z
date_updated: 2026-07-07T14:01:25Z
day: '05'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0007
file:
- access_level: open_access
  checksum: 06bf6dfc97f6006e3fd0e9a3f31bc961
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:27Z
  date_updated: 2020-07-14T12:46:39Z
  file_id: '5488'
  file_name: IST-2011-0007_IST-2011-0007.pdf
  file_size: 574055
  relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '43'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '17'
related_material:
  record:
  - id: '1903'
    relation: later_version
    status: public
  - id: '2955'
    relation: later_version
    status: public
  - id: '2211'
    relation: later_version
    status: public
status: public
title: 'Partial-observation stochastic games: How to win when belief fails'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3353'
abstract:
- lang: eng
  text: 'Compositional theories are crucial when designing large and complex systems
    from smaller components. In this work we propose such a theory for synchronous
    concurrent systems. Our approach follows so-called interface theories, which use
    game-theoretic interpretations of composition and refinement. These are appropriate
    for systems with distinct inputs and outputs, and explicit conditions on inputs
    that must be enforced during composition. Our interfaces model systems that execute
    in an infinite sequence of synchronous rounds. At each round, a contract must
    be satisfied. The contract is simply a relation specifying the set of valid input/output
    pairs. Interfaces can be composed by parallel, serial or feedback composition.
    A refinement relation between interfaces is defined, and shown to have two main
    properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability,
    namely, the ability to replace an interface by another one in any context. Shared
    refinement and abstraction operators, corresponding to greatest lower and least
    upper bounds with respect to refinement, are also defined. Input-complete interfaces,
    that impose no restrictions on inputs, and deterministic interfaces, that produce
    a unique output for any legal input, are discussed as special cases, and an interesting
    duality between the two classes is exposed. A number of illustrative examples
    are provided, as well as algorithms to compute compositions, check refinement,
    and so on, for finite-state interfaces.'
article_number: '14'
article_processing_charge: No
author:
- first_name: Stavros
  full_name: Tripakis, Stavros
  last_name: Tripakis
- first_name: Ben
  full_name: Lickly, Ben
  last_name: Lickly
- 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: Edward
  full_name: Lee, Edward
  last_name: Lee
citation:
  ama: Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational
    interfaces. <i>ACM Transactions on Programming Languages and Systems</i>. 2011;33(4).
    doi:<a href="https://doi.org/10.1145/1985342.1985345">10.1145/1985342.1985345</a>
  apa: Tripakis, S., Lickly, B., Henzinger, T. A., &#38; Lee, E. (2011). A theory
    of synchronous relational interfaces. <i>ACM Transactions on Programming Languages
    and Systems</i>. ACM. <a href="https://doi.org/10.1145/1985342.1985345">https://doi.org/10.1145/1985342.1985345</a>
  chicago: Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory
    of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages
    and Systems</i>. ACM, 2011. <a href="https://doi.org/10.1145/1985342.1985345">https://doi.org/10.1145/1985342.1985345</a>.
  ieee: S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous
    relational interfaces,” <i>ACM Transactions on Programming Languages and Systems</i>,
    vol. 33, no. 4. ACM, 2011.
  ista: Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational
    interfaces. ACM Transactions on Programming Languages and Systems. 33(4), 14.
  mla: Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.”
    <i>ACM Transactions on Programming Languages and Systems</i>, vol. 33, no. 4,
    14, ACM, 2011, doi:<a href="https://doi.org/10.1145/1985342.1985345">10.1145/1985342.1985345</a>.
  short: S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming
    Languages and Systems 33 (2011).
das_tickbox: '1'
date_created: 2018-12-11T12:02:51Z
date_published: 2011-07-01T00:00:00Z
date_updated: 2026-07-07T14:03:34Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: ToHe
doi: 10.1145/1985342.1985345
ec_funded: 1
external_id:
  isi:
  - '000292766400003'
file:
- access_level: open_access
  checksum: 5d44a8aa81e33210649beae507602138
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:16:45Z
  date_updated: 2020-07-14T12:46:09Z
  file_id: '5235'
  file_name: IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf
  file_size: 775662
  relation: main_file
file_date_updated: 2020-07-14T12:46:09Z
has_accepted_license: '1'
intvolume: '        33'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '215543'
  name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '214373'
  name: Design for Embedded Systems
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11402-N23
  name: Moderne Concurrency Paradigms
publication: ACM Transactions on Programming Languages and Systems
publication_status: published
publisher: ACM
publist_id: '3263'
pubrep_id: '85'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A theory of synchronous relational interfaces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2011'
...
---
_id: '3354'
abstract:
- lang: eng
  text: 'We consider two-player games played on a finite state space for an infinite
    number of rounds. The games are concurrent: in each round, the two players (player
    1 and player 2) choose their moves independently and simultaneously; the current
    state and the two moves determine the successor state. We consider ω-regular winning
    conditions specified as parity objectives. Both players are allowed to use randomization
    when choosing their moves. We study the computation of the limit-winning set of
    states, consisting of the states where the sup-inf value of the game for player
    1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability
    of winning arbitrarily close to 1. We show that the limit-winning set can be computed
    in O(n2d+2) time, where n is the size of the game structure and 2d is the number
    of priorities (or colors). The membership problem of whether a state belongs to
    the limit-winning set can be decided in NP ∩ coNP. While this complexity is the
    same as for the simpler class of turn-based parity games, where in each state
    only one of the two players has a choice of moves, our algorithms are considerably
    more involved than those for turn-based games. This is because concurrent games
    do not satisfy two of the most fundamental properties of turn-based parity games.
    First, in concurrent games limit-winning strategies require randomization; and
    second, they require infinite memory.'
article_number: '28'
article_processing_charge: No
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Luca
  full_name: De Alfaro, Luca
  last_name: De Alfaro
- 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: Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games.
    <i>ACM Transactions on Computational Logic</i>. 2011;12(4). doi:<a href="https://doi.org/10.1145/1970398.1970404">10.1145/1970398.1970404</a>
  apa: Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2011). Qualitative concurrent
    parity games. <i>ACM Transactions on Computational Logic</i>. ACM. <a href="https://doi.org/10.1145/1970398.1970404">https://doi.org/10.1145/1970398.1970404</a>
  chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative
    Concurrent Parity Games.” <i>ACM Transactions on Computational Logic</i>. ACM,
    2011. <a href="https://doi.org/10.1145/1970398.1970404">https://doi.org/10.1145/1970398.1970404</a>.
  ieee: K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent
    parity games,” <i>ACM Transactions on Computational Logic</i>, vol. 12, no. 4.
    ACM, 2011.
  ista: Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity
    games. ACM Transactions on Computational Logic. 12(4), 28.
  mla: Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” <i>ACM
    Transactions on Computational Logic</i>, vol. 12, no. 4, 28, ACM, 2011, doi:<a
    href="https://doi.org/10.1145/1970398.1970404">10.1145/1970398.1970404</a>.
  short: K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational
    Logic 12 (2011).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:02:51Z
date_published: 2011-07-04T00:00:00Z
date_updated: 2026-07-07T14:02:38Z
day: '04'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/1970398.1970404
external_id:
  isi:
  - '000296202300006'
intvolume: '        12'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
  name: Microsoft Research Faculty Fellowship
publication: ACM Transactions on Computational Logic
publication_status: published
publisher: ACM
publist_id: '3262'
quality_controlled: '1'
related_material:
  record:
  - id: '2054'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Qualitative concurrent parity games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2011'
...
---
_id: '3396'
abstract:
- lang: eng
  text: Facial branchiomotor neurons (FBMNs) in zebrafish and mouse embryonic hindbrain
    undergo a characteristic tangential migration from rhombomere (r) 4, where they
    are born, to r6/7. Cohesion among neuroepithelial cells (NCs) has been suggested
    to function in FBMN migration by inhibiting FBMNs positioned in the basal neuroepithelium
    such that they move apically between NCs towards the midline of the neuroepithelium
    instead of tangentially along the basal side of the neuroepithelium towards r6/7.
    However, direct experimental evaluation of this hypothesis is still lacking. Here,
    we have used a combination of biophysical cell adhesion measurements and high-resolution
    time-lapse microscopy to determine the role of NC cohesion in FBMN migration.
    We show that reducing NC cohesion by interfering with Cadherin 2 (Cdh2) activity
    results in FBMNs positioned at the basal side of the neuroepithelium moving apically
    towards the neural tube midline instead of tangentially towards r6/7. In embryos
    with strongly reduced NC cohesion, ectopic apical FBMN movement frequently results
    in fusion of the bilateral FBMN clusters over the apical midline of the neural
    tube. By contrast, reducing cohesion among FBMNs by interfering with Contactin
    2 (Cntn2) expression in these cells has little effect on apical FBMN movement,
    but reduces the fusion of the bilateral FBMN clusters in embryos with strongly
    diminished NC cohesion. These data provide direct experimental evidence that NC
    cohesion functions in tangential FBMN migration by restricting their apical movement.
acknowledged_ssus:
- _id: Bio
- _id: PreCl
acknowledgement: We thank C. Moens and J. Geiger for critical reading of earlier versions
  of this manuscript and members of the Heisenberg laboratory for discussions. We
  are grateful to the microscopy facility of the MPI-CBG and IST Austria for continuous
  support; I. Nüsslein, J. Compagnon and Alex Eichner for help with cell sorting;
  and the fish facility of the MPI-CBG and IST Austria for excellent fish care.
article_processing_charge: No
article_type: original
author:
- first_name: Petra
  full_name: Stockinger, Petra
  id: 261CB030-E90D-11E9-B182-F697D44B663C
  last_name: Stockinger
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
- first_name: Jean-Léon
  full_name: Maître, Jean-Léon
  id: 48F1E0D8-F248-11E8-B48F-1D18A9856A87
  last_name: Maître
  orcid: 0000-0002-3688-1474
citation:
  ama: Stockinger P, Heisenberg C-PJ, Maître J-L. Defective neuroepithelial cell cohesion
    affects tangential branchiomotor neuron migration in the zebrafish neural tube.
    <i>Development</i>. 2011;138(21):4673-4683. doi:<a href="https://doi.org/10.1242/dev.071233">10.1242/dev.071233</a>
  apa: Stockinger, P., Heisenberg, C.-P. J., &#38; Maître, J.-L. (2011). Defective
    neuroepithelial cell cohesion affects tangential branchiomotor neuron migration
    in the zebrafish neural tube. <i>Development</i>. Company of Biologists. <a href="https://doi.org/10.1242/dev.071233">https://doi.org/10.1242/dev.071233</a>
  chicago: Stockinger, Petra, Carl-Philipp J Heisenberg, and Jean-Léon Maître. “Defective
    Neuroepithelial Cell Cohesion Affects Tangential Branchiomotor Neuron Migration
    in the Zebrafish Neural Tube.” <i>Development</i>. Company of Biologists, 2011.
    <a href="https://doi.org/10.1242/dev.071233">https://doi.org/10.1242/dev.071233</a>.
  ieee: P. Stockinger, C.-P. J. Heisenberg, and J.-L. Maître, “Defective neuroepithelial
    cell cohesion affects tangential branchiomotor neuron migration in the zebrafish
    neural tube,” <i>Development</i>, vol. 138, no. 21. Company of Biologists, pp.
    4673–4683, 2011.
  ista: Stockinger P, Heisenberg C-PJ, Maître J-L. 2011. Defective neuroepithelial
    cell cohesion affects tangential branchiomotor neuron migration in the zebrafish
    neural tube. Development. 138(21), 4673–4683.
  mla: Stockinger, Petra, et al. “Defective Neuroepithelial Cell Cohesion Affects
    Tangential Branchiomotor Neuron Migration in the Zebrafish Neural Tube.” <i>Development</i>,
    vol. 138, no. 21, Company of Biologists, 2011, pp. 4673–83, doi:<a href="https://doi.org/10.1242/dev.071233">10.1242/dev.071233</a>.
  short: P. Stockinger, C.-P.J. Heisenberg, J.-L. Maître, Development 138 (2011) 4673–4683.
corr_author: '1'
date_created: 2018-12-11T12:03:06Z
date_published: 2011-11-01T00:00:00Z
date_updated: 2026-07-28T08:23:30Z
day: '01'
ddc:
- '570'
department:
- _id: CaHe
doi: 10.1242/dev.071233
external_id:
  isi:
  - '000296060100011'
file:
- access_level: open_access
  checksum: ca12b79e01ef36c1ef1aea31cf7e7139
  content_type: application/pdf
  creator: dernst
  date_created: 2019-10-07T14:19:42Z
  date_updated: 2020-07-14T12:46:12Z
  file_id: '6930'
  file_name: 2011_Development_Stockinger.pdf
  file_size: 4672439
  relation: main_file
file_date_updated: 2020-07-14T12:46:12Z
has_accepted_license: '1'
intvolume: '       138'
isi: 1
issue: '21'
keyword:
- Epithelial cohesion
- Hindbrain
- Neuronal migration
- Zebrafish
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 4673 - 4683
publication: Development
publication_status: published
publisher: Company of Biologists
publist_id: '3210'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron
  migration in the zebrafish neural tube
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 138
year: '2011'
...
---
OA_place: repository
OA_type: green
_id: '3379'
abstract:
- lang: eng
  text: The process of gastrulation is highly conserved across vertebrates on both
    the genetic and morphological levels, despite great variety in embryonic shape
    and speed of development. This mechanism spatially separates the germ layers and
    establishes the organizational foundation for future development. Mesodermal identity
    is specified in a superficial layer of cells, the epiblast, where cells maintain
    an epithelioid morphology. These cells involute to join the deeper hypoblast layer
    where they adopt a migratory, mesenchymal morphology. Expression of a cascade
    of related transcription factors orchestrates the parallel genetic transition
    from primitive to mature mesoderm. Although the early and late stages of this
    process are increasingly well understood, the transition between them has remained
    largely mysterious. We present here the first high resolution in vivo observations
    of the blebby transitional morphology of involuting mesodermal cells in a vertebrate
    embryo. We further demonstrate that the zebrafish spadetail mutation creates a
    reversible block in the maturation program, stalling cells in the transition state.
    This mutation creates an ideal system for dissecting the specific properties of
    cells undergoing the morphological transition of maturing mesoderm, as we demonstrate
    with a direct measurement of cell–cell adhesion.
acknowledgement: We thank David Grunwald for providing the spadetail-myc fusion construct.
  This work was supported by an NIH grant (GM079203) to D.K. and grants from the Austrian
  Academy of Sciences to P.S., and from the DFG, MPG and IST Austria to C.-P.H. R.R.
  was supported by a Developmental Biology Predoctoral Training Grant, T32HD007183,
  from the National Institute of Child Health and Human Development. B.L.M. was supported
  by an American Cancer Society fellowship (PF-07-048-01-DDC).
article_processing_charge: No
article_type: original
author:
- first_name: Richard
  full_name: Row, Richard
  last_name: Row
- first_name: Jean-Léon
  full_name: Maître, Jean-Léon
  id: 48F1E0D8-F248-11E8-B48F-1D18A9856A87
  last_name: Maître
  orcid: 0000-0002-3688-1474
- first_name: Benjamin
  full_name: Martin, Benjamin
  last_name: Martin
- first_name: Petra
  full_name: Stockinger, Petra
  id: 261CB030-E90D-11E9-B182-F697D44B663C
  last_name: Stockinger
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
- first_name: David
  full_name: Kimelman, David
  last_name: Kimelman
citation:
  ama: Row R, Maître J-L, Martin B, Stockinger P, Heisenberg C-PJ, Kimelman D. Completion
    of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail.
    <i>Developmental Biology</i>. 2011;354(1):102-110. doi:<a href="https://doi.org/10.1016/j.ydbio.2011.03.025">10.1016/j.ydbio.2011.03.025</a>
  apa: Row, R., Maître, J.-L., Martin, B., Stockinger, P., Heisenberg, C.-P. J., &#38;
    Kimelman, D. (2011). Completion of the epithelial to mesenchymal transition in
    zebrafish mesoderm requires Spadetail. <i>Developmental Biology</i>. Elsevier.
    <a href="https://doi.org/10.1016/j.ydbio.2011.03.025">https://doi.org/10.1016/j.ydbio.2011.03.025</a>
  chicago: Row, Richard, Jean-Léon Maître, Benjamin Martin, Petra Stockinger, Carl-Philipp
    J Heisenberg, and David Kimelman. “Completion of the Epithelial to Mesenchymal
    Transition in Zebrafish Mesoderm Requires Spadetail.” <i>Developmental Biology</i>.
    Elsevier, 2011. <a href="https://doi.org/10.1016/j.ydbio.2011.03.025">https://doi.org/10.1016/j.ydbio.2011.03.025</a>.
  ieee: R. Row, J.-L. Maître, B. Martin, P. Stockinger, C.-P. J. Heisenberg, and D.
    Kimelman, “Completion of the epithelial to mesenchymal transition in zebrafish
    mesoderm requires Spadetail,” <i>Developmental Biology</i>, vol. 354, no. 1. Elsevier,
    pp. 102–110, 2011.
  ista: Row R, Maître J-L, Martin B, Stockinger P, Heisenberg C-PJ, Kimelman D. 2011.
    Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires
    Spadetail. Developmental Biology. 354(1), 102–110.
  mla: Row, Richard, et al. “Completion of the Epithelial to Mesenchymal Transition
    in Zebrafish Mesoderm Requires Spadetail.” <i>Developmental Biology</i>, vol.
    354, no. 1, Elsevier, 2011, pp. 102–10, doi:<a href="https://doi.org/10.1016/j.ydbio.2011.03.025">10.1016/j.ydbio.2011.03.025</a>.
  short: R. Row, J.-L. Maître, B. Martin, P. Stockinger, C.-P.J. Heisenberg, D. Kimelman,
    Developmental Biology 354 (2011) 102–110.
das_tickbox: '1'
date_created: 2018-12-11T12:03:00Z
date_published: 2011-06-01T00:00:00Z
date_updated: 2026-07-28T08:31:27Z
day: '01'
department:
- _id: CaHe
doi: 10.1016/j.ydbio.2011.03.025
external_id:
  isi:
  - '000290550500010'
  pmid:
  - '21463614'
intvolume: '       354'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3090540/
month: '06'
oa: 1
oa_version: Submitted Version
page: 102 - 110
pmid: 1
publication: Developmental Biology
publication_status: published
publisher: Elsevier
publist_id: '3228'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Completion of the epithelial to mesenchymal transition in zebrafish mesoderm
  requires Spadetail
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 354
year: '2011'
...
---
OA_type: closed access
_id: '3781'
abstract:
- lang: eng
  text: We bound the difference in length of two curves in terms of their total curvatures
    and the Fréchet distance. The bound is independent of the dimension of the ambient
    Euclidean space, it improves upon a bound by Cohen-Steiner and Edelsbrunner, and
    it generalizes a result by Fáry and Chakerian.
acknowledgement: Funded by Graduate Aid in Areas of National Need (GAANN) Fellowship.
  The author would like to thank Herbert Edelsbrunner for his discussions and guidance.
article_processing_charge: No
article_type: original
author:
- first_name: Brittany Terese
  full_name: Fasy, Brittany Terese
  id: F65D502E-E68D-11E9-9252-C644099818F6
  last_name: Fasy
citation:
  ama: Fasy BT. The difference in length of curves in R^n. <i>Acta Scientiarum Mathematicarum</i>.
    2011;77(1-2):359-367. doi:<a href="https://doi.org/10.1007/BF03651375">10.1007/BF03651375</a>
  apa: Fasy, B. T. (2011). The difference in length of curves in R^n. <i>Acta Scientiarum
    Mathematicarum</i>. Springer Nature. <a href="https://doi.org/10.1007/BF03651375">https://doi.org/10.1007/BF03651375</a>
  chicago: Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” <i>Acta
    Scientiarum Mathematicarum</i>. Springer Nature, 2011. <a href="https://doi.org/10.1007/BF03651375">https://doi.org/10.1007/BF03651375</a>.
  ieee: B. T. Fasy, “The difference in length of curves in R^n,” <i>Acta Scientiarum
    Mathematicarum</i>, vol. 77, no. 1–2. Springer Nature, pp. 359–367, 2011.
  ista: Fasy BT. 2011. The difference in length of curves in R^n. Acta Scientiarum
    Mathematicarum. 77(1–2), 359–367.
  mla: Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” <i>Acta
    Scientiarum Mathematicarum</i>, vol. 77, no. 1–2, Springer Nature, 2011, pp. 359–67,
    doi:<a href="https://doi.org/10.1007/BF03651375">10.1007/BF03651375</a>.
  short: B.T. Fasy, Acta Scientiarum Mathematicarum 77 (2011) 359–367.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:05:08Z
date_published: 2011-06-01T00:00:00Z
date_updated: 2026-07-28T08:11:07Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/BF03651375
intvolume: '        77'
issue: 1-2
language:
- iso: eng
month: '06'
oa_version: None
page: 359 - 367
publication: Acta Scientiarum Mathematicarum
publication_identifier:
  eissn:
  - 2064-8316
  issn:
  - 0001-6969
publication_status: published
publisher: Springer Nature
publist_id: '2446'
quality_controlled: '1'
status: public
title: The difference in length of curves in R^n
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2011'
...
---
OA_place: publisher
OA_type: free access
_id: '3383'
article_processing_charge: No
author:
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
citation:
  ama: 'Heisenberg C-PJ. Invited Lectures ‐ Symposia Area. In: <i>The FEBS Journal</i>.
    Vol 278. Wiley; 2011:24-24. doi:<a href="https://doi.org/10.1111/j.1742-4658.2011.08136.x">10.1111/j.1742-4658.2011.08136.x</a>'
  apa: 'Heisenberg, C.-P. J. (2011). Invited Lectures ‐ Symposia Area. In <i>The FEBS
    Journal</i> (Vol. 278, pp. 24–24). Torino, Italy: Wiley. <a href="https://doi.org/10.1111/j.1742-4658.2011.08136.x">https://doi.org/10.1111/j.1742-4658.2011.08136.x</a>'
  chicago: Heisenberg, Carl-Philipp J. “Invited Lectures ‐ Symposia Area.” In <i>The
    FEBS Journal</i>, 278:24–24. Wiley, 2011. <a href="https://doi.org/10.1111/j.1742-4658.2011.08136.x">https://doi.org/10.1111/j.1742-4658.2011.08136.x</a>.
  ieee: C.-P. J. Heisenberg, “Invited Lectures ‐ Symposia Area,” in <i>The FEBS Journal</i>,
    Torino, Italy, 2011, vol. 278, no. S1, pp. 24–24.
  ista: Heisenberg C-PJ. 2011. Invited Lectures ‐ Symposia Area. The FEBS Journal.
    FEBS Congress on Biochemistry for Tomorrow’s Medicine vol. 278, 24–24.
  mla: Heisenberg, Carl-Philipp J. “Invited Lectures ‐ Symposia Area.” <i>The FEBS
    Journal</i>, vol. 278, no. S1, Wiley, 2011, pp. 24–24, doi:<a href="https://doi.org/10.1111/j.1742-4658.2011.08136.x">10.1111/j.1742-4658.2011.08136.x</a>.
  short: C.-P.J. Heisenberg, in:, The FEBS Journal, Wiley, 2011, pp. 24–24.
conference:
  end_date: 2011-06-30
  location: Torino, Italy
  name: FEBS Congress on Biochemistry for Tomorrow's Medicine
  start_date: 2011-06-25
corr_author: '1'
date_created: 2018-12-11T12:03:01Z
date_published: 2011-07-01T00:00:00Z
date_updated: 2026-07-28T08:27:55Z
day: '01'
department:
- _id: CaHe
doi: 10.1111/j.1742-4658.2011.08136.x
intvolume: '       278'
issue: S1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1111/j.1742-4658.2011.08136.x
month: '07'
oa: 1
oa_version: Published Version
page: 24 - 24
publication: The FEBS Journal
publication_status: published
publisher: Wiley
publist_id: '3224'
quality_controlled: '1'
status: public
title: Invited Lectures ‐ Symposia Area
type: conference_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 278
year: '2011'
...
---
_id: '3368'
abstract:
- lang: eng
  text: Tissue surface tension (TST) is an important mechanical property influencing
    cell sorting and tissue envelopment. The study by Manning et al. (1) reported
    on a mathematical model describing TST on the basis of the balance between adhesive
    and tensile properties of the constituent cells. The model predicts that, in high-adhesion
    cell aggregates, surface cells will be stretched to maintain the same area of
    cell–cell contact as interior bulk cells, resulting in an elongated and flattened
    cell shape. The authors (1) observed flat and elongated cells at the surface of
    high-adhesion zebrafish germ-layer explants, which they argue are undifferentiated
    stretched germ-layer progenitor cells, and they use this observation as a validation
    of their model.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Gabriel
  full_name: Krens, Gabriel
  id: 2B819732-F248-11E8-B48F-1D18A9856A87
  last_name: Krens
  orcid: 0000-0003-4761-5996
- first_name: Stephanie
  full_name: Möllmert, Stephanie
  id: 260FD49C-E911-11E9-B5EA-D9538404589B
  last_name: Möllmert
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
citation:
  ama: Krens G, Möllmert S, Heisenberg C-PJ. Enveloping cell layer differentiation
    at the surface of zebrafish germ layer tissue explants. <i>PNAS</i>. 2011;108(3):E9-E10.
    doi:<a href="https://doi.org/10.1073/pnas.1010767108">10.1073/pnas.1010767108</a>
  apa: Krens, G., Möllmert, S., &#38; Heisenberg, C.-P. J. (2011). Enveloping cell
    layer differentiation at the surface of zebrafish germ layer tissue explants.
    <i>PNAS</i>. National Academy of Sciences. <a href="https://doi.org/10.1073/pnas.1010767108">https://doi.org/10.1073/pnas.1010767108</a>
  chicago: Krens, Gabriel, Stephanie Möllmert, and Carl-Philipp J Heisenberg. “Enveloping
    Cell Layer Differentiation at the Surface of Zebrafish Germ Layer Tissue Explants.”
    <i>PNAS</i>. National Academy of Sciences, 2011. <a href="https://doi.org/10.1073/pnas.1010767108">https://doi.org/10.1073/pnas.1010767108</a>.
  ieee: G. Krens, S. Möllmert, and C.-P. J. Heisenberg, “Enveloping cell layer differentiation
    at the surface of zebrafish germ layer tissue explants,” <i>PNAS</i>, vol. 108,
    no. 3. National Academy of Sciences, pp. E9–E10, 2011.
  ista: Krens G, Möllmert S, Heisenberg C-PJ. 2011. Enveloping cell layer differentiation
    at the surface of zebrafish germ layer tissue explants. PNAS. 108(3), E9–E10.
  mla: Krens, Gabriel, et al. “Enveloping Cell Layer Differentiation at the Surface
    of Zebrafish Germ Layer Tissue Explants.” <i>PNAS</i>, vol. 108, no. 3, National
    Academy of Sciences, 2011, pp. E9–10, doi:<a href="https://doi.org/10.1073/pnas.1010767108">10.1073/pnas.1010767108</a>.
  short: G. Krens, S. Möllmert, C.-P.J. Heisenberg, PNAS 108 (2011) E9–E10.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:02:56Z
date_published: 2011-01-18T00:00:00Z
date_updated: 2026-07-28T09:03:18Z
day: '18'
department:
- _id: CaHe
doi: 10.1073/pnas.1010767108
external_id:
  isi:
  - '000286310300003'
  pmid:
  - '21212360'
intvolume: '       108'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3024655
month: '01'
oa: 1
oa_version: Submitted Version
page: E9 - E10
pmid: 1
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '3244'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Enveloping cell layer differentiation at the surface of zebrafish germ layer
  tissue explants
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 108
year: '2011'
...
---
_id: '3373'
abstract:
- lang: eng
  text: The use of optical traps to measure or apply forces on the molecular level
    requires a precise knowledge of the trapping force field. Close to the trap center,
    this field is typically approximated as linear in the displacement of the trapped
    microsphere. However, applications demanding high forces at low laser intensities
    can probe the light-microsphere interaction beyond the linear regime. Here, we
    measured the full nonlinear force and displacement response of an optical trap
    in two dimensions using a dual-beam optical trap setup with back-focal-plane photodetection.
    We observed a substantial stiffening of the trap beyond the linear regime that
    depends on microsphere size, in agreement with Mie theory calculations. Surprisingly,
    we found that the linear detection range for forces exceeds the one for displacement
    by far. Our approach allows for a complete calibration of an optical trap.
article_processing_charge: No
author:
- first_name: Marcus
  full_name: Jahnel, Marcus
  last_name: Jahnel
- first_name: Martin
  full_name: Behrndt, Martin
  id: 3ECECA3A-F248-11E8-B48F-1D18A9856A87
  last_name: Behrndt
- first_name: Anita
  full_name: Jannasch, Anita
  last_name: Jannasch
- first_name: Erik
  full_name: Schaeffer, Erik
  last_name: Schaeffer
- first_name: Stephan
  full_name: Grill, Stephan
  last_name: Grill
citation:
  ama: Jahnel M, Behrndt M, Jannasch A, Schaeffer E, Grill S. Measuring the complete
    force field of an optical trap. <i>Optics Letters</i>. 2011;36(7):1260-1262. doi:<a
    href="https://doi.org/10.1364/OL.36.001260">10.1364/OL.36.001260</a>
  apa: Jahnel, M., Behrndt, M., Jannasch, A., Schaeffer, E., &#38; Grill, S. (2011).
    Measuring the complete force field of an optical trap. <i>Optics Letters</i>.
    Optica Publishing Group. <a href="https://doi.org/10.1364/OL.36.001260">https://doi.org/10.1364/OL.36.001260</a>
  chicago: Jahnel, Marcus, Martin Behrndt, Anita Jannasch, Erik Schaeffer, and Stephan
    Grill. “Measuring the Complete Force Field of an Optical Trap.” <i>Optics Letters</i>.
    Optica Publishing Group, 2011. <a href="https://doi.org/10.1364/OL.36.001260">https://doi.org/10.1364/OL.36.001260</a>.
  ieee: M. Jahnel, M. Behrndt, A. Jannasch, E. Schaeffer, and S. Grill, “Measuring
    the complete force field of an optical trap,” <i>Optics Letters</i>, vol. 36,
    no. 7. Optica Publishing Group, pp. 1260–1262, 2011.
  ista: Jahnel M, Behrndt M, Jannasch A, Schaeffer E, Grill S. 2011. Measuring the
    complete force field of an optical trap. Optics Letters. 36(7), 1260–1262.
  mla: Jahnel, Marcus, et al. “Measuring the Complete Force Field of an Optical Trap.”
    <i>Optics Letters</i>, vol. 36, no. 7, Optica Publishing Group, 2011, pp. 1260–62,
    doi:<a href="https://doi.org/10.1364/OL.36.001260">10.1364/OL.36.001260</a>.
  short: M. Jahnel, M. Behrndt, A. Jannasch, E. Schaeffer, S. Grill, Optics Letters
    36 (2011) 1260–1262.
date_created: 2018-12-11T12:02:58Z
date_published: 2011-03-30T00:00:00Z
date_updated: 2026-07-29T10:07:18Z
day: '30'
ddc:
- '570'
department:
- _id: CaHe
doi: 10.1364/OL.36.001260
external_id:
  isi:
  - '000289251000080'
intvolume: '        36'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.osapublishing.org/ol/abstract.cfm?uri=ol-36-7-1260
month: '03'
oa: 1
oa_version: Published Version
page: 1260 - 1262
publication: Optics Letters
publication_status: published
publisher: Optica Publishing Group
publist_id: '3234'
quality_controlled: '1'
related_material:
  record:
  - id: '1403'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Measuring the complete force field of an optical trap
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2011'
...
---
_id: '3393'
abstract:
- lang: eng
  text: 'Unlike unconditionally advantageous “Fisherian” variants that tend to spread
    throughout a species range once introduced anywhere, “bistable” variants, such
    as chromosome translocations, have two alternative stable frequencies, absence
    and (near) fixation. Analogous to populations with Allee effects, bistable variants
    tend to increase locally only once they become sufficiently common, and their
    spread depends on their rate of increase averaged over all frequencies. Several
    proposed manipulations of insect populations, such as using Wolbachia or “engineered
    underdominance” to suppress vector-borne diseases, produce bistable rather than
    Fisherian dynamics. We synthesize and extend theoretical analyses concerning three
    features of their spatial behavior: rate of spread, conditions to initiate spread
    from a localized introduction, and wave stopping caused by variation in population
    densities or dispersal rates. Unlike Fisherian variants, bistable variants tend
    to spread spatially only for particular parameter combinations and initial conditions.
    Wave initiation requires introduction over an extended region, while subsequent
    spatial spread is slower than for Fisherian waves and can easily be halted by
    local spatial inhomogeneities. We present several new results, including robust
    sufficient conditions to initiate (and stop) spread, using a one-parameter cubic
    approximation applicable to several models. The results have both basic and applied
    implications.'
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. Spatial waves of advance with bistable dynamics: Cytoplasmic
    and genetic analogues of Allee effects. <i>American Naturalist</i>. 2011;178(3):E48-E75.
    doi:<a href="https://doi.org/10.1086/661246">10.1086/661246</a>'
  apa: 'Barton, N. H., &#38; Turelli, M. (2011). Spatial waves of advance with bistable
    dynamics: Cytoplasmic and genetic analogues of Allee effects. <i>American Naturalist</i>.
    University of Chicago Press. <a href="https://doi.org/10.1086/661246">https://doi.org/10.1086/661246</a>'
  chicago: 'Barton, Nicholas H, and Michael Turelli. “Spatial Waves of Advance with
    Bistable Dynamics: Cytoplasmic and Genetic Analogues of Allee Effects.” <i>American
    Naturalist</i>. University of Chicago Press, 2011. <a href="https://doi.org/10.1086/661246">https://doi.org/10.1086/661246</a>.'
  ieee: 'N. H. Barton and M. Turelli, “Spatial waves of advance with bistable dynamics:
    Cytoplasmic and genetic analogues of Allee effects,” <i>American Naturalist</i>,
    vol. 178, no. 3. University of Chicago Press, pp. E48–E75, 2011.'
  ista: 'Barton NH, Turelli M. 2011. Spatial waves of advance with bistable dynamics:
    Cytoplasmic and genetic analogues of Allee effects. American Naturalist. 178(3),
    E48–E75.'
  mla: 'Barton, Nicholas H., and Michael Turelli. “Spatial Waves of Advance with Bistable
    Dynamics: Cytoplasmic and Genetic Analogues of Allee Effects.” <i>American Naturalist</i>,
    vol. 178, no. 3, University of Chicago Press, 2011, pp. E48–75, doi:<a href="https://doi.org/10.1086/661246">10.1086/661246</a>.'
  short: N.H. Barton, M. Turelli, American Naturalist 178 (2011) E48–E75.
date_created: 2018-12-11T12:03:05Z
date_published: 2011-09-01T00:00:00Z
date_updated: 2026-08-04T09:17:38Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1086/661246
external_id:
  isi:
  - '000294256800001'
file:
- access_level: open_access
  checksum: 7fd22a2ef3321a6fca6a439b3be5d8f4
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:08:31Z
  date_updated: 2020-07-14T12:46:11Z
  file_id: '4692'
  file_name: IST-2016-554-v1+1_BartonTurelli2011_copy.pdf
  file_size: 629130
  relation: main_file
file_date_updated: 2020-07-14T12:46:11Z
has_accepted_license: '1'
intvolume: '       178'
isi: 1
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: E48 - E75
publication: American Naturalist
publication_identifier:
  eissn:
  - 1537-5323
  issn:
  - 0003-0147
publication_status: published
publisher: University of Chicago Press
publist_id: '3214'
pubrep_id: '554'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Spatial waves of advance with bistable dynamics: Cytoplasmic and genetic analogues
  of Allee effects'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 178
year: '2011'
...
---
OA_type: closed access
_id: '22556'
abstract:
- lang: eng
  text: Numerous studies across multiple disciplines search for insights on the effects
    of climate change at local spatial scales and at fine time resolutions. This study
    presents an overall methodology of using a weather generator for downscaling an
    ensemble of climate model outputs. The downscaled predictions can explicitly include
    climate model uncertainty, which offers valuable information for making probabilistic
    inferences about climate impacts. The hourly weather generator that serves as
    the downscaling tool is briefly presented. The generator is designed to reproduce
    a set of meteorological variables that can serve as input to hydrological, ecological,
    geomorphological, and agricultural models. The generator is capable of reproducing
    a wide set of climate statistics over a range of temporal scales, from extremes,
    to low-frequency interannual variability; its performance for many climate variables
    and their statistics over different aggregation periods is highly satisfactory.
    The use of the weather generator in simulations of future climate scenarios, as
    inferred from climate models, is described in detail. Using a previously developed
    methodology based on a Bayesian approach, the stochastic downscaling procedure
    derives the frequency distribution functions of factors of change for several
    climate statistics from a multi-model ensemble of outputs of General Circulation
    Models. The factors of change are subsequently applied to the statistics derived
    from observations to re-evaluate the parameters of the weather generator. Using
    embedded causal and statistical relationships, the generator simulates future
    realizations of climate for a specific point location at the hourly scale. Uncertainties
    present in the climate model realizations and the multi-model ensemble predictions
    are discussed. An application of the weather generator in reproducing present
    (1961–2000) and forecasting future (2081–2100) climate conditions is illustrated
    for the location of Tucson (AZ). The stochastic downscaling is carried out using
    simulations of eight General Circulation Models adopted in the IPCC 4AR, A1B emission
    scenario.
article_processing_charge: No
article_type: original
author:
- first_name: Simone
  full_name: Fatichi, Simone
  id: cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6
  last_name: Fatichi
- first_name: Valeriy Y.
  full_name: Ivanov, Valeriy Y.
  last_name: Ivanov
- first_name: Enrica
  full_name: Caporali, Enrica
  last_name: Caporali
citation:
  ama: Fatichi S, Ivanov VY, Caporali E. Simulation of future climate scenarios with
    a weather generator. <i>Advances in Water Resources</i>. 2011;34(4):448-467. doi:<a
    href="https://doi.org/10.1016/j.advwatres.2010.12.013">10.1016/j.advwatres.2010.12.013</a>
  apa: Fatichi, S., Ivanov, V. Y., &#38; Caporali, E. (2011). Simulation of future
    climate scenarios with a weather generator. <i>Advances in Water Resources</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.advwatres.2010.12.013">https://doi.org/10.1016/j.advwatres.2010.12.013</a>
  chicago: Fatichi, Simone, Valeriy Y. Ivanov, and Enrica Caporali. “Simulation of
    Future Climate Scenarios with a Weather Generator.” <i>Advances in Water Resources</i>.
    Elsevier, 2011. <a href="https://doi.org/10.1016/j.advwatres.2010.12.013">https://doi.org/10.1016/j.advwatres.2010.12.013</a>.
  ieee: S. Fatichi, V. Y. Ivanov, and E. Caporali, “Simulation of future climate scenarios
    with a weather generator,” <i>Advances in Water Resources</i>, vol. 34, no. 4.
    Elsevier, pp. 448–467, 2011.
  ista: Fatichi S, Ivanov VY, Caporali E. 2011. Simulation of future climate scenarios
    with a weather generator. Advances in Water Resources. 34(4), 448–467.
  mla: Fatichi, Simone, et al. “Simulation of Future Climate Scenarios with a Weather
    Generator.” <i>Advances in Water Resources</i>, vol. 34, no. 4, Elsevier, 2011,
    pp. 448–67, doi:<a href="https://doi.org/10.1016/j.advwatres.2010.12.013">10.1016/j.advwatres.2010.12.013</a>.
  short: S. Fatichi, V.Y. Ivanov, E. Caporali, Advances in Water Resources 34 (2011)
    448–467.
das_tickbox: '1'
date_created: 2026-07-27T12:30:24Z
date_published: 2011-04-01T00:00:00Z
date_updated: 2026-08-06T10:13:12Z
day: '01'
doi: 10.1016/j.advwatres.2010.12.013
extern: '1'
intvolume: '        34'
issue: '4'
keyword:
- Weather generator
- Stochastic downscaling
- Climate change
- Hydro-meteorology
- Rainfall model
language:
- iso: eng
month: '04'
oa_version: None
page: 448-467
publication: Advances in Water Resources
publication_identifier:
  issn:
  - 0309-1708
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Simulation of future climate scenarios with a weather generator
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 34
year: '2011'
...
---
_id: '10908'
abstract:
- lang: eng
  text: We present ABC, a software tool for automatically computing symbolic upper
    bounds on the number of iterations of nested program loops. The system combines
    static analysis of programs with symbolic summation techniques to derive loop
    invariant relations between program variables. Iteration bounds are obtained from
    the inferred invariants, by replacing variables with bounds on their greatest
    values. We have successfully applied ABC to a large number of examples. The derived
    symbolic bounds express non-trivial polynomial relations over loop variables.
    We also report on results to automatically infer symbolic expressions over harmonic
    numbers as upper bounds on loop iteration counts.
acknowledgement: This work was supported in part by the Swiss NSF. The fourth author
  is supported by an FWF Hertha Firnberg Research grant (T425-N23).
article_processing_charge: No
author:
- first_name: Régis
  full_name: Blanc, Régis
  last_name: Blanc
- 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: Thibaud
  full_name: Hottelier, Thibaud
  last_name: Hottelier
- first_name: Laura
  full_name: Kovács, Laura
  last_name: Kovács
citation:
  ama: 'Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation
    for loops. In: Clarke EM, Voronkov A, eds. <i>Logic for Programming, Artificial
    Intelligence, and Reasoning</i>. Vol 6355. LNCS. Berlin, Heidelberg: Springer
    Nature; 2010:103-118. doi:<a href="https://doi.org/10.1007/978-3-642-17511-4_7">10.1007/978-3-642-17511-4_7</a>'
  apa: 'Blanc, R., Henzinger, T. A., Hottelier, T., &#38; Kovács, L. (2010). ABC:
    Algebraic Bound Computation for loops. In E. M. Clarke &#38; A. Voronkov (Eds.),
    <i>Logic for Programming, Artificial Intelligence, and Reasoning</i> (Vol. 6355,
    pp. 103–118). Berlin, Heidelberg: Springer Nature. <a href="https://doi.org/10.1007/978-3-642-17511-4_7">https://doi.org/10.1007/978-3-642-17511-4_7</a>'
  chicago: 'Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács.
    “ABC: Algebraic Bound Computation for Loops.” In <i>Logic for Programming, Artificial
    Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov,
    6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. <a href="https://doi.org/10.1007/978-3-642-17511-4_7">https://doi.org/10.1007/978-3-642-17511-4_7</a>.'
  ieee: 'R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound
    Computation for loops,” in <i>Logic for Programming, Artificial Intelligence,
    and Reasoning</i>, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.'
  ista: 'Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound
    Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning.
    LPAR: Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355,
    103–118.'
  mla: 'Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” <i>Logic
    for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund
    M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:<a
    href="https://doi.org/10.1007/978-3-642-17511-4_7">10.1007/978-3-642-17511-4_7</a>.'
  short: R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov
    (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer
    Nature, Berlin, Heidelberg, 2010, pp. 103–118.
conference:
  end_date: 2010-05-01
  location: Dakar, Senegal
  name: 'LPAR: Logic for Programming, Artificial Intelligence and Reasoning'
  start_date: 2010-04-25
corr_author: '1'
date_created: 2022-03-21T08:14:35Z
date_published: 2010-05-01T00:00:00Z
date_updated: 2025-09-30T09:51:13Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-642-17511-4_7
editor:
- first_name: Edmund M
  full_name: Clarke, Edmund M
  last_name: Clarke
- first_name: Andrei
  full_name: Voronkov, Andrei
  last_name: Voronkov
external_id:
  isi:
  - '000309668000007'
intvolume: '      6355'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://infoscience.epfl.ch/record/186096
month: '05'
oa: 1
oa_version: Submitted Version
page: 103-118
place: Berlin, Heidelberg
publication: Logic for Programming, Artificial Intelligence, and Reasoning
publication_identifier:
  eisbn:
  - '9783642175114'
  eissn:
  - 1611-3349
  isbn:
  - '9783642175107'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: 'ABC: Algebraic Bound Computation for loops'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 6355
year: '2010'
...
---
_id: '10909'
abstract:
- lang: eng
  text: We address the problem of localizing homology classes, namely, finding the
    cycle representing a given class with the most concise geometric measure. We focus
    on the volume measure, that is, the 1-norm of a cycle. Two main results are presented.
    First, we prove the problem is NP-hard to approximate within any constant factor.
    Second, we prove that for homology of dimension two or higher, the problem is
    NP-hard to approximate even when the Betti number is O(1). A side effect is the
    inapproximability of the problem of computing the nonbounding cycle with the smallest
    volume, and computing cycles representing a homology basis with the minimal total
    volume. We also discuss other geometric measures (diameter and radius) and show
    their disadvantages in homology localization. Our work is restricted to homology
    over the ℤ2 field.
acknowledgement: Partially supported by the Austrian Science Fund under grantFSP-S9103-N04
  and P20134-N13.
article_processing_charge: No
author:
- first_name: Chao
  full_name: Chen, Chao
  id: 3E92416E-F248-11E8-B48F-1D18A9856A87
  last_name: Chen
- first_name: Daniel
  full_name: Freedman, Daniel
  last_name: Freedman
citation:
  ama: 'Chen C, Freedman D. Hardness results for homology localization. In: <i>Proceedings
    of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for
    Industrial and Applied Mathematics; 2010:1594-1604. doi:<a href="https://doi.org/10.1137/1.9781611973075.129">10.1137/1.9781611973075.129</a>'
  apa: 'Chen, C., &#38; Freedman, D. (2010). Hardness results for homology localization.
    In <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>
    (pp. 1594–1604). Austin, TX, United States: Society for Industrial and Applied
    Mathematics. <a href="https://doi.org/10.1137/1.9781611973075.129">https://doi.org/10.1137/1.9781611973075.129</a>'
  chicago: Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.”
    In <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>,
    1594–1604. Society for Industrial and Applied Mathematics, 2010. <a href="https://doi.org/10.1137/1.9781611973075.129">https://doi.org/10.1137/1.9781611973075.129</a>.
  ieee: C. Chen and D. Freedman, “Hardness results for homology localization,” in
    <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>,
    Austin, TX, United States, 2010, pp. 1594–1604.
  ista: 'Chen C, Freedman D. 2010. Hardness results for homology localization. Proceedings
    of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium
    on Discrete Algorithms, 1594–1604.'
  mla: Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.”
    <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>,
    Society for Industrial and Applied Mathematics, 2010, pp. 1594–604, doi:<a href="https://doi.org/10.1137/1.9781611973075.129">10.1137/1.9781611973075.129</a>.
  short: C. Chen, D. Freedman, in:, Proceedings of the 2010 Annual ACM-SIAM Symposium
    on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2010,
    pp. 1594–1604.
conference:
  end_date: 2010-01-19
  location: Austin, TX, United States
  name: 'SODA: Symposium on Discrete Algorithms'
  start_date: 2010-01-17
corr_author: '1'
date_created: 2022-03-21T08:24:07Z
date_published: 2010-02-01T00:00:00Z
date_updated: 2025-09-30T09:22:32Z
day: '01'
department:
- _id: HeEd
doi: 10.1137/1.9781611973075.129
language:
- iso: eng
month: '02'
oa_version: None
page: 1594-1604
publication: Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
  eisbn:
  - '9781611973075'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
  record:
  - id: '3267'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Hardness results for homology localization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '11097'
abstract:
- lang: eng
  text: The nuclear envelope (NE) is a highly regulated membrane barrier that separates
    the nucleus from the cytoplasm in eukaryotic cells. It contains a large number
    of different proteins that have been implicated in chromatin organization and
    gene regulation. Although the nuclear membrane enables complex levels of gene
    expression, it also poses a challenge when it comes to cell division. To allow
    access of the mitotic spindle to chromatin, the nucleus of metazoans must completely
    disassemble during mitosis, generating the need to re-establish the nuclear compartment
    at the end of each cell division. Here, I summarize our current understanding
    of the dynamic remodeling of the NE during the cell cycle.
article_processing_charge: No
article_type: original
author:
- first_name: Martin W
  full_name: HETZER, Martin W
  id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
  last_name: HETZER
  orcid: 0000-0002-2111-992X
citation:
  ama: Hetzer M. The nuclear envelope. <i>Cold Spring Harbor Perspectives in Biology</i>.
    2010;2(3):a000539-a000539. doi:<a href="https://doi.org/10.1101/cshperspect.a000539">10.1101/cshperspect.a000539</a>
  apa: Hetzer, M. (2010). The nuclear envelope. <i>Cold Spring Harbor Perspectives
    in Biology</i>. Cold Spring Harbor Laboratory. <a href="https://doi.org/10.1101/cshperspect.a000539">https://doi.org/10.1101/cshperspect.a000539</a>
  chicago: Hetzer, Martin. “The Nuclear Envelope.” <i>Cold Spring Harbor Perspectives
    in Biology</i>. Cold Spring Harbor Laboratory, 2010. <a href="https://doi.org/10.1101/cshperspect.a000539">https://doi.org/10.1101/cshperspect.a000539</a>.
  ieee: M. Hetzer, “The nuclear envelope,” <i>Cold Spring Harbor Perspectives in Biology</i>,
    vol. 2, no. 3. Cold Spring Harbor Laboratory, pp. a000539–a000539, 2010.
  ista: Hetzer M. 2010. The nuclear envelope. Cold Spring Harbor Perspectives in Biology.
    2(3), a000539–a000539.
  mla: Hetzer, Martin. “The Nuclear Envelope.” <i>Cold Spring Harbor Perspectives
    in Biology</i>, vol. 2, no. 3, Cold Spring Harbor Laboratory, 2010, pp. a000539–a000539,
    doi:<a href="https://doi.org/10.1101/cshperspect.a000539">10.1101/cshperspect.a000539</a>.
  short: M. Hetzer, Cold Spring Harbor Perspectives in Biology 2 (2010) a000539–a000539.
date_created: 2022-04-07T07:52:49Z
date_published: 2010-02-03T00:00:00Z
date_updated: 2024-10-14T11:26:41Z
day: '03'
doi: 10.1101/cshperspect.a000539
extern: '1'
external_id:
  pmid:
  - '20300205'
intvolume: '         2'
issue: '3'
keyword:
- General Biochemistry
- Genetics and Molecular Biology
language:
- iso: eng
month: '02'
oa_version: None
page: a000539-a000539
pmid: 1
publication: Cold Spring Harbor Perspectives in Biology
publication_identifier:
  issn:
  - 1943-0264
publication_status: published
publisher: Cold Spring Harbor Laboratory
quality_controlled: '1'
scopus_import: '1'
status: public
title: The nuclear envelope
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2010'
...
---
_id: '11098'
article_processing_charge: No
article_type: original
author:
- first_name: Martin W
  full_name: HETZER, Martin W
  id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
  last_name: HETZER
  orcid: 0000-0002-2111-992X
citation:
  ama: Hetzer M. The role of the nuclear pore complex in aging of post-mitotic cells.
    <i>Aging</i>. 2010;2(2):74-75. doi:<a href="https://doi.org/10.18632/aging.100125">10.18632/aging.100125</a>
  apa: Hetzer, M. (2010). The role of the nuclear pore complex in aging of post-mitotic
    cells. <i>Aging</i>. Impact Journals. <a href="https://doi.org/10.18632/aging.100125">https://doi.org/10.18632/aging.100125</a>
  chicago: Hetzer, Martin. “The Role of the Nuclear Pore Complex in Aging of Post-Mitotic
    Cells.” <i>Aging</i>. Impact Journals, 2010. <a href="https://doi.org/10.18632/aging.100125">https://doi.org/10.18632/aging.100125</a>.
  ieee: M. Hetzer, “The role of the nuclear pore complex in aging of post-mitotic
    cells,” <i>Aging</i>, vol. 2, no. 2. Impact Journals, pp. 74–75, 2010.
  ista: Hetzer M. 2010. The role of the nuclear pore complex in aging of post-mitotic
    cells. Aging. 2(2), 74–75.
  mla: Hetzer, Martin. “The Role of the Nuclear Pore Complex in Aging of Post-Mitotic
    Cells.” <i>Aging</i>, vol. 2, no. 2, Impact Journals, 2010, pp. 74–75, doi:<a
    href="https://doi.org/10.18632/aging.100125">10.18632/aging.100125</a>.
  short: M. Hetzer, Aging 2 (2010) 74–75.
date_created: 2022-04-07T07:52:58Z
date_published: 2010-02-01T00:00:00Z
date_updated: 2024-10-14T11:26:51Z
day: '01'
doi: 10.18632/aging.100125
extern: '1'
external_id:
  pmid:
  - '20354266'
intvolume: '         2'
issue: '2'
keyword:
- Cell Biology
- Aging
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.18632/aging.100125
month: '02'
oa: 1
oa_version: Published Version
page: 74-75
pmid: 1
publication: Aging
publication_identifier:
  issn:
  - 1945-4589
publication_status: published
publisher: Impact Journals
quality_controlled: '1'
scopus_import: '1'
status: public
title: The role of the nuclear pore complex in aging of post-mitotic cells
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2010'
...
---
_id: '11099'
abstract:
- lang: eng
  text: Nuclear pore complexes (NPCs) serve as transport channels across the nuclear
    membrane, a double lipid bilayer that physically separates the nucleoplasm and
    cytoplasm of eukaryotic cells. New evidence suggests that the multiprotein nuclear
    pores also play a role in chromatin organization and gene expression. Given the
    importance of NPC function, it is not surprising that a growing list of human
    diseases and developmental defects have been linked to its malfunction. In order
    to fully understand the functional repertoire of NPCs and their essential role
    for nuclear organization, it is critical to determine the sequence of events that
    lead to the formation of nuclear pores. This is particularly relevant since NPC
    number, and possibly composition, are tightly linked to metabolic activity. Most
    of our knowledge is derived from NPC formation that occurs in dividing cells at
    the end of mitosis when the nuclear envelope (NE) and NPCs reform from disassembled
    precursors. However, NPC assembly also takes place during interphase into an intact
    NE. Importantly, this process is not restricted to dividing cells but also occurs
    during cell differentiation. Here, we will review aspects unique to this process,
    namely the regulation of nuclear expansion and the mechanisms of fusion between
    the outer and inner nuclear membranes. We will then discuss conserved and diverging
    mechanisms between post-mitotic and interphase assembly of the proteinaceous structure
    in light of recently published data.
article_processing_charge: No
article_type: review
author:
- first_name: Christine M.
  full_name: Doucet, Christine M.
  last_name: Doucet
- first_name: Martin W
  full_name: HETZER, Martin W
  id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
  last_name: HETZER
  orcid: 0000-0002-2111-992X
citation:
  ama: Doucet CM, Hetzer M. Nuclear pore biogenesis into an intact nuclear envelope.
    <i>Chromosoma</i>. 2010;119:469-477. doi:<a href="https://doi.org/10.1007/s00412-010-0289-2">10.1007/s00412-010-0289-2</a>
  apa: Doucet, C. M., &#38; Hetzer, M. (2010). Nuclear pore biogenesis into an intact
    nuclear envelope. <i>Chromosoma</i>. Springer Nature. <a href="https://doi.org/10.1007/s00412-010-0289-2">https://doi.org/10.1007/s00412-010-0289-2</a>
  chicago: Doucet, Christine M., and Martin Hetzer. “Nuclear Pore Biogenesis into
    an Intact Nuclear Envelope.” <i>Chromosoma</i>. Springer Nature, 2010. <a href="https://doi.org/10.1007/s00412-010-0289-2">https://doi.org/10.1007/s00412-010-0289-2</a>.
  ieee: C. M. Doucet and M. Hetzer, “Nuclear pore biogenesis into an intact nuclear
    envelope,” <i>Chromosoma</i>, vol. 119. Springer Nature, pp. 469–477, 2010.
  ista: Doucet CM, Hetzer M. 2010. Nuclear pore biogenesis into an intact nuclear
    envelope. Chromosoma. 119, 469–477.
  mla: Doucet, Christine M., and Martin Hetzer. “Nuclear Pore Biogenesis into an Intact
    Nuclear Envelope.” <i>Chromosoma</i>, vol. 119, Springer Nature, 2010, pp. 469–77,
    doi:<a href="https://doi.org/10.1007/s00412-010-0289-2">10.1007/s00412-010-0289-2</a>.
  short: C.M. Doucet, M. Hetzer, Chromosoma 119 (2010) 469–477.
date_created: 2022-04-07T07:53:12Z
date_published: 2010-10-01T00:00:00Z
date_updated: 2024-10-14T11:27:07Z
day: '01'
doi: 10.1007/s00412-010-0289-2
extern: '1'
external_id:
  pmid:
  - '20721671'
intvolume: '       119'
keyword:
- Genetics (clinical)
- Genetics
language:
- iso: eng
month: '10'
oa_version: None
page: 469-477
pmid: 1
publication: Chromosoma
publication_identifier:
  eissn:
  - 1432-0886
  issn:
  - 0009-5915
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nuclear pore biogenesis into an intact nuclear envelope
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2010'
...
---
_id: '11101'
abstract:
- lang: eng
  text: In metazoa, nuclear pore complexes (NPCs) assemble from disassembled precursors
    into a reforming nuclear envelope (NE) at the end of mitosis and into growing
    intact NEs during interphase. Here, we show via RNAi-mediated knockdown that ELYS,
    a nucleoporin critical for the recruitment of the essential Nup107/160 complex
    to chromatin, is required for NPC assembly at the end of mitosis but not during
    interphase. Conversely, the transmembrane nucleoporin POM121 is critical for the
    incorporation of the Nup107/160 complex into new assembly sites specifically during
    interphase. Strikingly, recruitment of the Nup107/160 complex to an intact NE
    involves a membrane curvature-sensing domain of its constituent Nup133, which
    is not required for postmitotic NPC formation. Our results suggest that in organisms
    with open mitosis, NPCs assemble via two distinct mechanisms to accommodate cell
    cycle-dependent differences in NE topology.
article_processing_charge: No
article_type: original
author:
- first_name: Christine M.
  full_name: Doucet, Christine M.
  last_name: Doucet
- first_name: Jessica A.
  full_name: Talamas, Jessica A.
  last_name: Talamas
- first_name: Martin W
  full_name: HETZER, Martin W
  id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
  last_name: HETZER
  orcid: 0000-0002-2111-992X
citation:
  ama: Doucet CM, Talamas JA, Hetzer M. Cell cycle-dependent differences in nuclear
    pore complex assembly in metazoa. <i>Cell</i>. 2010;141(6):1030-1041. doi:<a href="https://doi.org/10.1016/j.cell.2010.04.036">10.1016/j.cell.2010.04.036</a>
  apa: Doucet, C. M., Talamas, J. A., &#38; Hetzer, M. (2010). Cell cycle-dependent
    differences in nuclear pore complex assembly in metazoa. <i>Cell</i>. Elsevier.
    <a href="https://doi.org/10.1016/j.cell.2010.04.036">https://doi.org/10.1016/j.cell.2010.04.036</a>
  chicago: Doucet, Christine M., Jessica A. Talamas, and Martin Hetzer. “Cell Cycle-Dependent
    Differences in Nuclear Pore Complex Assembly in Metazoa.” <i>Cell</i>. Elsevier,
    2010. <a href="https://doi.org/10.1016/j.cell.2010.04.036">https://doi.org/10.1016/j.cell.2010.04.036</a>.
  ieee: C. M. Doucet, J. A. Talamas, and M. Hetzer, “Cell cycle-dependent differences
    in nuclear pore complex assembly in metazoa,” <i>Cell</i>, vol. 141, no. 6. Elsevier,
    pp. 1030–1041, 2010.
  ista: Doucet CM, Talamas JA, Hetzer M. 2010. Cell cycle-dependent differences in
    nuclear pore complex assembly in metazoa. Cell. 141(6), 1030–1041.
  mla: Doucet, Christine M., et al. “Cell Cycle-Dependent Differences in Nuclear Pore
    Complex Assembly in Metazoa.” <i>Cell</i>, vol. 141, no. 6, Elsevier, 2010, pp.
    1030–41, doi:<a href="https://doi.org/10.1016/j.cell.2010.04.036">10.1016/j.cell.2010.04.036</a>.
  short: C.M. Doucet, J.A. Talamas, M. Hetzer, Cell 141 (2010) 1030–1041.
date_created: 2022-04-07T07:53:29Z
date_published: 2010-06-11T00:00:00Z
date_updated: 2024-10-14T11:28:00Z
day: '11'
doi: 10.1016/j.cell.2010.04.036
extern: '1'
external_id:
  pmid:
  - '20550937'
intvolume: '       141'
issue: '6'
keyword:
- General Biochemistry
- Genetics and Molecular Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1016/j.cell.2010.04.036
month: '06'
oa: 1
oa_version: Published Version
page: 1030-1041
pmid: 1
publication: Cell
publication_identifier:
  issn:
  - 0092-8674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cell cycle-dependent differences in nuclear pore complex assembly in metazoa
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 141
year: '2010'
...
---
_id: '11102'
abstract:
- lang: eng
  text: Nuclear pore complexes have recently been shown to play roles in gene activation;
    however their potential involvement in metazoan transcription remains unclear.
    Here we show that the nucleoporins Sec13, Nup98, and Nup88, as well as a group
    of FG-repeat nucleoporins, bind to the Drosophila genome at functionally distinct
    loci that often do not represent nuclear envelope contact sites. Whereas Nup88
    localizes to silent loci, Sec13, Nup98, and a subset of FG-repeat nucleoporins
    bind to developmentally regulated genes undergoing transcription induction. Strikingly,
    RNAi-mediated knockdown of intranuclear Sec13 and Nup98 specifically inhibits
    transcription of their target genes and prevents efficient reactivation of transcription
    after heat shock, suggesting an essential role of NPC components in regulating
    complex gene expression programs of multicellular organisms.
article_processing_charge: No
article_type: original
author:
- first_name: Maya
  full_name: Capelson, Maya
  last_name: Capelson
- first_name: Yun
  full_name: Liang, Yun
  last_name: Liang
- first_name: Roberta
  full_name: Schulte, Roberta
  last_name: Schulte
- first_name: William
  full_name: Mair, William
  last_name: Mair
- first_name: Ulrich
  full_name: Wagner, Ulrich
  last_name: Wagner
- first_name: Martin W
  full_name: HETZER, Martin W
  id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
  last_name: HETZER
  orcid: 0000-0002-2111-992X
citation:
  ama: Capelson M, Liang Y, Schulte R, Mair W, Wagner U, Hetzer M. Chromatin-bound
    nuclear pore components regulate gene expression in higher eukaryotes. <i>Cell</i>.
    2010;140(3):372-383. doi:<a href="https://doi.org/10.1016/j.cell.2009.12.054">10.1016/j.cell.2009.12.054</a>
  apa: Capelson, M., Liang, Y., Schulte, R., Mair, W., Wagner, U., &#38; Hetzer, M.
    (2010). Chromatin-bound nuclear pore components regulate gene expression in higher
    eukaryotes. <i>Cell</i>. Elsevier. <a href="https://doi.org/10.1016/j.cell.2009.12.054">https://doi.org/10.1016/j.cell.2009.12.054</a>
  chicago: Capelson, Maya, Yun Liang, Roberta Schulte, William Mair, Ulrich Wagner,
    and Martin Hetzer. “Chromatin-Bound Nuclear Pore Components Regulate Gene Expression
    in Higher Eukaryotes.” <i>Cell</i>. Elsevier, 2010. <a href="https://doi.org/10.1016/j.cell.2009.12.054">https://doi.org/10.1016/j.cell.2009.12.054</a>.
  ieee: M. Capelson, Y. Liang, R. Schulte, W. Mair, U. Wagner, and M. Hetzer, “Chromatin-bound
    nuclear pore components regulate gene expression in higher eukaryotes,” <i>Cell</i>,
    vol. 140, no. 3. Elsevier, pp. 372–383, 2010.
  ista: Capelson M, Liang Y, Schulte R, Mair W, Wagner U, Hetzer M. 2010. Chromatin-bound
    nuclear pore components regulate gene expression in higher eukaryotes. Cell. 140(3),
    372–383.
  mla: Capelson, Maya, et al. “Chromatin-Bound Nuclear Pore Components Regulate Gene
    Expression in Higher Eukaryotes.” <i>Cell</i>, vol. 140, no. 3, Elsevier, 2010,
    pp. 372–83, doi:<a href="https://doi.org/10.1016/j.cell.2009.12.054">10.1016/j.cell.2009.12.054</a>.
  short: M. Capelson, Y. Liang, R. Schulte, W. Mair, U. Wagner, M. Hetzer, Cell 140
    (2010) 372–383.
date_created: 2022-04-07T07:53:36Z
date_published: 2010-02-05T00:00:00Z
date_updated: 2024-10-14T11:28:14Z
day: '05'
doi: 10.1016/j.cell.2009.12.054
extern: '1'
external_id:
  pmid:
  - '20144761'
intvolume: '       140'
issue: '3'
keyword:
- General Biochemistry
- Genetics and Molecular Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1016/j.cell.2009.12.054
month: '02'
oa: 1
oa_version: Published Version
page: 372-383
pmid: 1
publication: Cell
publication_identifier:
  issn:
  - 0092-8674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Chromatin-bound nuclear pore components regulate gene expression in higher
  eukaryotes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 140
year: '2010'
...
