---
_id: '2317'
abstract:
- lang: eng
  text: 'We present a summary of our recent rigorous derivation of the celebrated
    Ginzburg-Landau (GL) theory, starting from the microscopic Bardeen-Cooper-Schrieffer
    (BCS) model. Close to the critical temperature, GL arises as an effective theory
    on the macroscopic scale. The relevant scaling limit is semiclassical in nature,
    and semiclassical analysis, with minimal regularity assumptions, plays an important
    part in our proof. '
author:
- first_name: Rupert
  full_name: Frank, Rupert L
  last_name: Frank
- first_name: Christian
  full_name: Hainzl, Christian
  last_name: Hainzl
- first_name: Robert
  full_name: Robert Seiringer
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
- first_name: Jan
  full_name: Solovej, Jan P
  last_name: Solovej
citation:
  ama: 'Frank R, Hainzl C, Seiringer R, Solovej J. Microscopic derivation of the Ginzburg-Landau
    model. In: World Scientific Publishing; 2012:575-583. doi:<a href="https://doi.org/10.1142/9789814449243_0060">10.1142/9789814449243_0060</a>'
  apa: 'Frank, R., Hainzl, C., Seiringer, R., &#38; Solovej, J. (2012). Microscopic
    derivation of the Ginzburg-Landau model (pp. 575–583). Presented at the ICMP:
    International Congress on Mathematical Physics, World Scientific Publishing. <a
    href="https://doi.org/10.1142/9789814449243_0060">https://doi.org/10.1142/9789814449243_0060</a>'
  chicago: Frank, Rupert, Christian Hainzl, Robert Seiringer, and Jan Solovej. “Microscopic
    Derivation of the Ginzburg-Landau Model,” 575–83. World Scientific Publishing,
    2012. <a href="https://doi.org/10.1142/9789814449243_0060">https://doi.org/10.1142/9789814449243_0060</a>.
  ieee: 'R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “Microscopic derivation
    of the Ginzburg-Landau model,” presented at the ICMP: International Congress on
    Mathematical Physics, 2012, pp. 575–583.'
  ista: 'Frank R, Hainzl C, Seiringer R, Solovej J. 2012. Microscopic derivation of
    the Ginzburg-Landau model. ICMP: International Congress on Mathematical Physics,
    575–583.'
  mla: Frank, Rupert, et al. <i>Microscopic Derivation of the Ginzburg-Landau Model</i>.
    World Scientific Publishing, 2012, pp. 575–83, doi:<a href="https://doi.org/10.1142/9789814449243_0060">10.1142/9789814449243_0060</a>.
  short: R. Frank, C. Hainzl, R. Seiringer, J. Solovej, in:, World Scientific Publishing,
    2012, pp. 575–583.
conference:
  name: 'ICMP: International Congress on Mathematical Physics'
date_created: 2018-12-11T11:56:57Z
date_published: 2012-08-01T00:00:00Z
date_updated: 2021-01-12T06:56:44Z
day: '01'
doi: 10.1142/9789814449243_0060
extern: 1
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1209.1080
month: '08'
oa: 1
page: 575 - 583
publication_status: published
publisher: World Scientific Publishing
publist_id: '4610'
quality_controlled: 0
status: public
title: Microscopic derivation of the Ginzburg-Landau model
type: conference
year: '2012'
...
---
_id: '2318'
abstract:
- lang: eng
  text: 'We show that bosons interacting via pair potentials with negative scattering
    length form bound states for a suitable number of particles. In other words, the
    absence of many-particle bound states of any kind implies the non-negativity of
    the scattering length of the interaction potential. '
acknowledgement: 'Partial financial support by NSERC '
author:
- first_name: Robert
  full_name: Seiringer, Robert
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: Seiringer R. Absence of bound states implies non-negativity of the scattering
    length. <i>Journal of Spectral Theory</i>. 2012;2(3):321-328. doi:<a href="https://doi.org/10.4171/JST/31">10.4171/JST/31</a>
  apa: Seiringer, R. (2012). Absence of bound states implies non-negativity of the
    scattering length. <i>Journal of Spectral Theory</i>. European Mathematical Society.
    <a href="https://doi.org/10.4171/JST/31">https://doi.org/10.4171/JST/31</a>
  chicago: Seiringer, Robert. “Absence of Bound States Implies Non-Negativity of the
    Scattering Length.” <i>Journal of Spectral Theory</i>. European Mathematical Society,
    2012. <a href="https://doi.org/10.4171/JST/31">https://doi.org/10.4171/JST/31</a>.
  ieee: R. Seiringer, “Absence of bound states implies non-negativity of the scattering
    length,” <i>Journal of Spectral Theory</i>, vol. 2, no. 3. European Mathematical
    Society, pp. 321–328, 2012.
  ista: Seiringer R. 2012. Absence of bound states implies non-negativity of the scattering
    length. Journal of Spectral Theory. 2(3), 321–328.
  mla: Seiringer, Robert. “Absence of Bound States Implies Non-Negativity of the Scattering
    Length.” <i>Journal of Spectral Theory</i>, vol. 2, no. 3, European Mathematical
    Society, 2012, pp. 321–28, doi:<a href="https://doi.org/10.4171/JST/31">10.4171/JST/31</a>.
  short: R. Seiringer, Journal of Spectral Theory 2 (2012) 321–328.
date_created: 2018-12-11T11:56:58Z
date_published: 2012-06-24T00:00:00Z
date_updated: 2021-01-12T06:56:44Z
day: '24'
department:
- _id: RoSe
doi: 10.4171/JST/31
intvolume: '         2'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1204.0435
month: '06'
oa: 1
oa_version: Preprint
page: 321-328
publication: Journal of Spectral Theory
publication_status: published
publisher: European Mathematical Society
publist_id: '4609'
quality_controlled: '1'
status: public
title: Absence of bound states implies non-negativity of the scattering length
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2012'
...
---
_id: '2395'
abstract:
- lang: eng
  text: 'We give the first rigorous derivation of the celebrated Ginzburg-Landau (GL)
    theory, starting from the microscopic Bardeen-Cooper-Schrieffer (BCS) model. Close
    to the critical temperature, GL arises as an effective theory on the macroscopic
    scale. The relevant scaling limit is semiclassical in nature, and semiclassical
    analysis, with minimal regularity assumptions, plays an important part in our
    proof. '
author:
- first_name: Rupert
  full_name: Frank, Rupert L
  last_name: Frank
- first_name: Christian
  full_name: Hainzl, Christian
  last_name: Hainzl
- first_name: Robert
  full_name: Robert Seiringer
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
- first_name: Jan
  full_name: Solovej, Jan P
  last_name: Solovej
citation:
  ama: Frank R, Hainzl C, Seiringer R, Solovej J. Microscopic derivation of Ginzburg-Landau
    theory. <i>Journal of the American Mathematical Society</i>. 2012;25(3):667-713.
    doi:<a href="https://doi.org/10.1090/S0894-0347-2012-00735-8">10.1090/S0894-0347-2012-00735-8</a>
  apa: Frank, R., Hainzl, C., Seiringer, R., &#38; Solovej, J. (2012). Microscopic
    derivation of Ginzburg-Landau theory. <i>Journal of the American Mathematical
    Society</i>. American Mathematical Society. <a href="https://doi.org/10.1090/S0894-0347-2012-00735-8">https://doi.org/10.1090/S0894-0347-2012-00735-8</a>
  chicago: Frank, Rupert, Christian Hainzl, Robert Seiringer, and Jan Solovej. “Microscopic
    Derivation of Ginzburg-Landau Theory.” <i>Journal of the American Mathematical
    Society</i>. American Mathematical Society, 2012. <a href="https://doi.org/10.1090/S0894-0347-2012-00735-8">https://doi.org/10.1090/S0894-0347-2012-00735-8</a>.
  ieee: R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “Microscopic derivation
    of Ginzburg-Landau theory,” <i>Journal of the American Mathematical Society</i>,
    vol. 25, no. 3. American Mathematical Society, pp. 667–713, 2012.
  ista: Frank R, Hainzl C, Seiringer R, Solovej J. 2012. Microscopic derivation of
    Ginzburg-Landau theory. Journal of the American Mathematical Society. 25(3), 667–713.
  mla: Frank, Rupert, et al. “Microscopic Derivation of Ginzburg-Landau Theory.” <i>Journal
    of the American Mathematical Society</i>, vol. 25, no. 3, American Mathematical
    Society, 2012, pp. 667–713, doi:<a href="https://doi.org/10.1090/S0894-0347-2012-00735-8">10.1090/S0894-0347-2012-00735-8</a>.
  short: R. Frank, C. Hainzl, R. Seiringer, J. Solovej, Journal of the American Mathematical
    Society 25 (2012) 667–713.
date_created: 2018-12-11T11:57:25Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T06:57:13Z
day: '01'
doi: 10.1090/S0894-0347-2012-00735-8
extern: 1
intvolume: '        25'
issue: '3'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1102.4001
month: '01'
oa: 1
page: 667 - 713
publication: Journal of the American Mathematical Society
publication_status: published
publisher: American Mathematical Society
publist_id: '4531'
quality_controlled: 0
status: public
title: Microscopic derivation of Ginzburg-Landau theory
type: journal_article
volume: 25
year: '2012'
...
---
_id: '2396'
abstract:
- lang: eng
  text: A positive temperature analogue of the scattering length of a potential V
    can be defined via integrating the difference of the heat kernels of -Δ and, with
    Δ the Laplacian. An upper bound on this quantity is a crucial input in the derivation
    of a bound on the critical temperature of a dilute Bose gas (Seiringer and Ueltschi
    in Phys Rev B 80:014502, 2009). In (Seiringer and Ueltschi in Phys Rev B 80:014502,
    2009), a bound was given in the case of finite range potentials and sufficiently
    low temperature. In this paper, we improve the bound and extend it to potentials
    of infinite range.
author:
- first_name: Benjamin
  full_name: Landon, Benjamin
  last_name: Landon
- first_name: Robert
  full_name: Robert Seiringer
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: Landon B, Seiringer R. The scattering length at positive temperature. <i>Letters
    in Mathematical Physics</i>. 2012;100(3):237-243. doi:<a href="https://doi.org/10.1007/s11005-012-0566-5">10.1007/s11005-012-0566-5</a>
  apa: Landon, B., &#38; Seiringer, R. (2012). The scattering length at positive temperature.
    <i>Letters in Mathematical Physics</i>. Springer. <a href="https://doi.org/10.1007/s11005-012-0566-5">https://doi.org/10.1007/s11005-012-0566-5</a>
  chicago: Landon, Benjamin, and Robert Seiringer. “The Scattering Length at Positive
    Temperature.” <i>Letters in Mathematical Physics</i>. Springer, 2012. <a href="https://doi.org/10.1007/s11005-012-0566-5">https://doi.org/10.1007/s11005-012-0566-5</a>.
  ieee: B. Landon and R. Seiringer, “The scattering length at positive temperature,”
    <i>Letters in Mathematical Physics</i>, vol. 100, no. 3. Springer, pp. 237–243,
    2012.
  ista: Landon B, Seiringer R. 2012. The scattering length at positive temperature.
    Letters in Mathematical Physics. 100(3), 237–243.
  mla: Landon, Benjamin, and Robert Seiringer. “The Scattering Length at Positive
    Temperature.” <i>Letters in Mathematical Physics</i>, vol. 100, no. 3, Springer,
    2012, pp. 237–43, doi:<a href="https://doi.org/10.1007/s11005-012-0566-5">10.1007/s11005-012-0566-5</a>.
  short: B. Landon, R. Seiringer, Letters in Mathematical Physics 100 (2012) 237–243.
date_created: 2018-12-11T11:57:25Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2021-01-12T06:57:13Z
day: '01'
doi: 10.1007/s11005-012-0566-5
extern: 1
intvolume: '       100'
issue: '3'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1111.1683
month: '06'
oa: 1
page: 237 - 243
publication: Letters in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4529'
quality_controlled: 0
status: public
title: The scattering length at positive temperature
type: journal_article
volume: 100
year: '2012'
...
---
_id: '2397'
abstract:
- lang: eng
  text: We consider the low-density limit of a Fermi gas in the BCS approximation.
    We show that if the interaction potential allows for a two-particle bound state,
    the system at zero temperature is well approximated by the Gross-Pitaevskii functional,
    describing a Bose-Einstein condensate of fermion pairs.
author:
- first_name: Christian
  full_name: Hainzl, Christian
  last_name: Hainzl
- first_name: Robert
  full_name: Robert Seiringer
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: Hainzl C, Seiringer R. Low density limit of BCS theory and Bose-Einstein condensation
    of Fermion pairs. <i>Letters in Mathematical Physics</i>. 2012;100(2):119-138.
    doi:<a href="https://doi.org/10.1007/s11005-011-0535-4">10.1007/s11005-011-0535-4</a>
  apa: Hainzl, C., &#38; Seiringer, R. (2012). Low density limit of BCS theory and
    Bose-Einstein condensation of Fermion pairs. <i>Letters in Mathematical Physics</i>.
    Springer. <a href="https://doi.org/10.1007/s11005-011-0535-4">https://doi.org/10.1007/s11005-011-0535-4</a>
  chicago: Hainzl, Christian, and Robert Seiringer. “Low Density Limit of BCS Theory
    and Bose-Einstein Condensation of Fermion Pairs.” <i>Letters in Mathematical Physics</i>.
    Springer, 2012. <a href="https://doi.org/10.1007/s11005-011-0535-4">https://doi.org/10.1007/s11005-011-0535-4</a>.
  ieee: C. Hainzl and R. Seiringer, “Low density limit of BCS theory and Bose-Einstein
    condensation of Fermion pairs,” <i>Letters in Mathematical Physics</i>, vol. 100,
    no. 2. Springer, pp. 119–138, 2012.
  ista: Hainzl C, Seiringer R. 2012. Low density limit of BCS theory and Bose-Einstein
    condensation of Fermion pairs. Letters in Mathematical Physics. 100(2), 119–138.
  mla: Hainzl, Christian, and Robert Seiringer. “Low Density Limit of BCS Theory and
    Bose-Einstein Condensation of Fermion Pairs.” <i>Letters in Mathematical Physics</i>,
    vol. 100, no. 2, Springer, 2012, pp. 119–38, doi:<a href="https://doi.org/10.1007/s11005-011-0535-4">10.1007/s11005-011-0535-4</a>.
  short: C. Hainzl, R. Seiringer, Letters in Mathematical Physics 100 (2012) 119–138.
date_created: 2018-12-11T11:57:25Z
date_published: 2012-05-01T00:00:00Z
date_updated: 2021-01-12T06:57:14Z
day: '01'
doi: 10.1007/s11005-011-0535-4
extern: 1
intvolume: '       100'
issue: '2'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1105.1100
month: '05'
oa: 1
page: 119 - 138
publication: Letters in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4530'
quality_controlled: 0
status: public
title: Low density limit of BCS theory and Bose-Einstein condensation of Fermion pairs
type: journal_article
volume: 100
year: '2012'
...
---
_id: '2398'
abstract:
- lang: eng
  text: We extend the mathematical theory of quantum hypothesis testing to the general
    W*-algebraic setting and explore its relation with recent developments in non-equilibrium
    quantum statistical mechanics. In particular, we relate the large deviation principle
    for the full counting statistics of entropy flow to quantum hypothesis testing
    of the arrow of time.
author:
- first_name: Vojkan
  full_name: Jakšić, Vojkan
  last_name: Jakšić
- first_name: Yoshiko
  full_name: Ogata, Yoshiko
  last_name: Ogata
- first_name: Claude
  full_name: Pillet, Claude A
  last_name: Pillet
- first_name: Robert
  full_name: Robert Seiringer
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: Jakšić V, Ogata Y, Pillet C, Seiringer R. Quantum hypothesis testing and non-equilibrium
    statistical mechanics. <i>Reviews in Mathematical Physics</i>. 2012;24(6). doi:<a
    href="https://doi.org/10.1142/S0129055X12300026">10.1142/S0129055X12300026</a>
  apa: Jakšić, V., Ogata, Y., Pillet, C., &#38; Seiringer, R. (2012). Quantum hypothesis
    testing and non-equilibrium statistical mechanics. <i>Reviews in Mathematical
    Physics</i>. World Scientific Publishing. <a href="https://doi.org/10.1142/S0129055X12300026">https://doi.org/10.1142/S0129055X12300026</a>
  chicago: Jakšić, Vojkan, Yoshiko Ogata, Claude Pillet, and Robert Seiringer. “Quantum
    Hypothesis Testing and Non-Equilibrium Statistical Mechanics.” <i>Reviews in Mathematical
    Physics</i>. World Scientific Publishing, 2012. <a href="https://doi.org/10.1142/S0129055X12300026">https://doi.org/10.1142/S0129055X12300026</a>.
  ieee: V. Jakšić, Y. Ogata, C. Pillet, and R. Seiringer, “Quantum hypothesis testing
    and non-equilibrium statistical mechanics,” <i>Reviews in Mathematical Physics</i>,
    vol. 24, no. 6. World Scientific Publishing, 2012.
  ista: Jakšić V, Ogata Y, Pillet C, Seiringer R. 2012. Quantum hypothesis testing
    and non-equilibrium statistical mechanics. Reviews in Mathematical Physics. 24(6).
  mla: Jakšić, Vojkan, et al. “Quantum Hypothesis Testing and Non-Equilibrium Statistical
    Mechanics.” <i>Reviews in Mathematical Physics</i>, vol. 24, no. 6, World Scientific
    Publishing, 2012, doi:<a href="https://doi.org/10.1142/S0129055X12300026">10.1142/S0129055X12300026</a>.
  short: V. Jakšić, Y. Ogata, C. Pillet, R. Seiringer, Reviews in Mathematical Physics
    24 (2012).
date_created: 2018-12-11T11:57:26Z
date_published: 2012-07-01T00:00:00Z
date_updated: 2020-07-14T12:45:40Z
day: '01'
doi: 10.1142/S0129055X12300026
extern: 1
intvolume: '        24'
issue: '6'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1109.3804
month: '07'
oa: 1
publication: Reviews in Mathematical Physics
publication_status: published
publisher: World Scientific Publishing
publist_id: '4528'
quality_controlled: 0
status: public
title: Quantum hypothesis testing and non-equilibrium statistical mechanics
type: review
volume: 24
year: '2012'
...
---
_id: '2400'
abstract:
- lang: eng
  text: If the polaron coupling constant α is large enough, bipolarons or multi-polarons
    will form. When passing through the critical α c from above, does the radius of
    the system simply get arbitrarily large or does it reach a maximum and then explode?
    We prove that it is always the latter. We also prove the analogous statement for
    the Pekar-Tomasevich (PT) approximation to the energy, in which case there is
    a solution to the PT equation at α c. Similarly, we show that the same phenomenon
    occurs for atoms, e. g., helium, at the critical value of the nuclear charge.
    Our proofs rely only on energy estimates, not on a detailed analysis of the Schrödinger
    equation, and are very general. They use the fact that the Coulomb repulsion decays
    like 1/r, while 'uncertainty principle' localization energies decay more rapidly,
    as 1/r 2.
author:
- first_name: Rupert
  full_name: Frank, Rupert L
  last_name: Frank
- first_name: Élliott
  full_name: Lieb, Élliott H
  last_name: Lieb
- first_name: Robert
  full_name: Robert Seiringer
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: Frank R, Lieb É, Seiringer R. Binding of polarons and atoms at threshold. <i>Communications
    in Mathematical Physics</i>. 2012;313(2):405-424. doi:<a href="https://doi.org/10.1007/s00220-012-1436-9">10.1007/s00220-012-1436-9</a>
  apa: Frank, R., Lieb, É., &#38; Seiringer, R. (2012). Binding of polarons and atoms
    at threshold. <i>Communications in Mathematical Physics</i>. Springer. <a href="https://doi.org/10.1007/s00220-012-1436-9">https://doi.org/10.1007/s00220-012-1436-9</a>
  chicago: Frank, Rupert, Élliott Lieb, and Robert Seiringer. “Binding of Polarons
    and Atoms at Threshold.” <i>Communications in Mathematical Physics</i>. Springer,
    2012. <a href="https://doi.org/10.1007/s00220-012-1436-9">https://doi.org/10.1007/s00220-012-1436-9</a>.
  ieee: R. Frank, É. Lieb, and R. Seiringer, “Binding of polarons and atoms at threshold,”
    <i>Communications in Mathematical Physics</i>, vol. 313, no. 2. Springer, pp.
    405–424, 2012.
  ista: Frank R, Lieb É, Seiringer R. 2012. Binding of polarons and atoms at threshold.
    Communications in Mathematical Physics. 313(2), 405–424.
  mla: Frank, Rupert, et al. “Binding of Polarons and Atoms at Threshold.” <i>Communications
    in Mathematical Physics</i>, vol. 313, no. 2, Springer, 2012, pp. 405–24, doi:<a
    href="https://doi.org/10.1007/s00220-012-1436-9">10.1007/s00220-012-1436-9</a>.
  short: R. Frank, É. Lieb, R. Seiringer, Communications in Mathematical Physics 313
    (2012) 405–424.
date_created: 2018-12-11T11:57:27Z
date_published: 2012-07-01T00:00:00Z
date_updated: 2021-01-12T06:57:15Z
day: '01'
doi: 10.1007/s00220-012-1436-9
extern: 1
intvolume: '       313'
issue: '2'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1106.0729
month: '07'
oa: 1
page: 405 - 424
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4527'
quality_controlled: 0
status: public
title: Binding of polarons and atoms at threshold
type: journal_article
volume: 313
year: '2012'
...
---
_id: '2401'
abstract:
- lang: eng
  text: We find further implications of the BMV conjecture, which states that for
    hermitian matrices B≥0 and A, the function λ {mapping} Tr exp(A - λB) is the Laplace
    transform of a positive measure supported on [0,∞].
author:
- first_name: Élliott
  full_name: Lieb, Élliott H
  last_name: Lieb
- first_name: Robert
  full_name: Robert Seiringer
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: Lieb É, Seiringer R. Further implications of the Bessis-Moussa-Villani conjecture.
    <i>Journal of Statistical Physics</i>. 2012;149(1):86-91. doi:<a href="https://doi.org/10.1007/s10955-012-0585-8">10.1007/s10955-012-0585-8</a>
  apa: Lieb, É., &#38; Seiringer, R. (2012). Further implications of the Bessis-Moussa-Villani
    conjecture. <i>Journal of Statistical Physics</i>. Springer. <a href="https://doi.org/10.1007/s10955-012-0585-8">https://doi.org/10.1007/s10955-012-0585-8</a>
  chicago: Lieb, Élliott, and Robert Seiringer. “Further Implications of the Bessis-Moussa-Villani
    Conjecture.” <i>Journal of Statistical Physics</i>. Springer, 2012. <a href="https://doi.org/10.1007/s10955-012-0585-8">https://doi.org/10.1007/s10955-012-0585-8</a>.
  ieee: É. Lieb and R. Seiringer, “Further implications of the Bessis-Moussa-Villani
    conjecture,” <i>Journal of Statistical Physics</i>, vol. 149, no. 1. Springer,
    pp. 86–91, 2012.
  ista: Lieb É, Seiringer R. 2012. Further implications of the Bessis-Moussa-Villani
    conjecture. Journal of Statistical Physics. 149(1), 86–91.
  mla: Lieb, Élliott, and Robert Seiringer. “Further Implications of the Bessis-Moussa-Villani
    Conjecture.” <i>Journal of Statistical Physics</i>, vol. 149, no. 1, Springer,
    2012, pp. 86–91, doi:<a href="https://doi.org/10.1007/s10955-012-0585-8">10.1007/s10955-012-0585-8</a>.
  short: É. Lieb, R. Seiringer, Journal of Statistical Physics 149 (2012) 86–91.
date_created: 2018-12-11T11:57:27Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T06:57:16Z
day: '01'
doi: 10.1007/s10955-012-0585-8
extern: 1
intvolume: '       149'
issue: '1'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1206.0460
month: '10'
oa: 1
page: 86 - 91
publication: Journal of Statistical Physics
publication_status: published
publisher: Springer
publist_id: '4525'
quality_controlled: 0
status: public
title: Further implications of the Bessis-Moussa-Villani conjecture
type: journal_article
volume: 149
year: '2012'
...
---
_id: '2402'
abstract:
- lang: eng
  text: We consider a model of quantum-mechanical particles interacting via point
    interactions of infinite scattering length. In the case of fermions we prove a
    Lieb-Thirring inequality for the energy, i.e., we show that the energy is bounded
    from below by a constant times the integral of the particle density to the power.
author:
- first_name: Rupert
  full_name: Frank, Rupert L
  last_name: Frank
- first_name: Robert
  full_name: Robert Seiringer
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: Frank R, Seiringer R. Lieb-Thirring inequality for a model of particles with
    point interactions. <i>Journal of Mathematical Physics</i>. 2012;53(9). doi:<a
    href="https://doi.org/10.1063/1.3697416">10.1063/1.3697416</a>
  apa: Frank, R., &#38; Seiringer, R. (2012). Lieb-Thirring inequality for a model
    of particles with point interactions. <i>Journal of Mathematical Physics</i>.
    American Institute of Physics. <a href="https://doi.org/10.1063/1.3697416">https://doi.org/10.1063/1.3697416</a>
  chicago: Frank, Rupert, and Robert Seiringer. “Lieb-Thirring Inequality for a Model
    of Particles with Point Interactions.” <i>Journal of Mathematical Physics</i>.
    American Institute of Physics, 2012. <a href="https://doi.org/10.1063/1.3697416">https://doi.org/10.1063/1.3697416</a>.
  ieee: R. Frank and R. Seiringer, “Lieb-Thirring inequality for a model of particles
    with point interactions,” <i>Journal of Mathematical Physics</i>, vol. 53, no.
    9. American Institute of Physics, 2012.
  ista: Frank R, Seiringer R. 2012. Lieb-Thirring inequality for a model of particles
    with point interactions. Journal of Mathematical Physics. 53(9).
  mla: Frank, Rupert, and Robert Seiringer. “Lieb-Thirring Inequality for a Model
    of Particles with Point Interactions.” <i>Journal of Mathematical Physics</i>,
    vol. 53, no. 9, American Institute of Physics, 2012, doi:<a href="https://doi.org/10.1063/1.3697416">10.1063/1.3697416</a>.
  short: R. Frank, R. Seiringer, Journal of Mathematical Physics 53 (2012).
date_created: 2018-12-11T11:57:27Z
date_published: 2012-09-28T00:00:00Z
date_updated: 2021-01-12T06:57:16Z
day: '28'
doi: 10.1063/1.3697416
extern: 1
intvolume: '        53'
issue: '9'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1112.5617
month: '09'
oa: 1
publication: Journal of Mathematical Physics
publication_status: published
publisher: American Institute of Physics
publist_id: '4524'
quality_controlled: 0
status: public
title: Lieb-Thirring inequality for a model of particles with point interactions
type: journal_article
volume: 53
year: '2012'
...
---
_id: '2403'
abstract:
- lang: eng
  text: We study the effects of random scatterers on the ground state of the one-dimensional
    Lieb-Liniger model of interacting bosons on the unit interval in the Gross-Pitaevskii
    regime. We prove that Bose-Einstein condensation survives even a strong random
    potential with a high density of scatterers. The character of the wavefunction
    of the condensate, however, depends in an essential way on the interplay between
    randomness and the strength of the two-body interaction. For low density of scatterers
    and strong interactions the wavefunction extends over the whole interval. A high
    density of scatterers and weak interactions, on the other hand, lead to localization
    of the wavefunction in a fragmented subset of the interval.
author:
- first_name: Robert
  full_name: Robert Seiringer
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
- first_name: Jakob
  full_name: Yngvason, Jakob
  last_name: Yngvason
- first_name: Valentin
  full_name: Zagrebnov, Valentin A
  last_name: Zagrebnov
citation:
  ama: Seiringer R, Yngvason J, Zagrebnov V. Disordered Bose-Einstein condensates
    with interaction in one dimension. <i>Journal of Statistical Mechanics Theory
    and Experiment</i>. 2012;2012(11). doi:<a href="https://doi.org/10.1088/1742-5468/2012/11/P11007">10.1088/1742-5468/2012/11/P11007</a>
  apa: Seiringer, R., Yngvason, J., &#38; Zagrebnov, V. (2012). Disordered Bose-Einstein
    condensates with interaction in one dimension. <i>Journal of Statistical Mechanics
    Theory and Experiment</i>. IOP Publishing Ltd. <a href="https://doi.org/10.1088/1742-5468/2012/11/P11007">https://doi.org/10.1088/1742-5468/2012/11/P11007</a>
  chicago: Seiringer, Robert, Jakob Yngvason, and Valentin Zagrebnov. “Disordered
    Bose-Einstein Condensates with Interaction in One Dimension.” <i>Journal of Statistical
    Mechanics Theory and Experiment</i>. IOP Publishing Ltd., 2012. <a href="https://doi.org/10.1088/1742-5468/2012/11/P11007">https://doi.org/10.1088/1742-5468/2012/11/P11007</a>.
  ieee: R. Seiringer, J. Yngvason, and V. Zagrebnov, “Disordered Bose-Einstein condensates
    with interaction in one dimension,” <i>Journal of Statistical Mechanics Theory
    and Experiment</i>, vol. 2012, no. 11. IOP Publishing Ltd., 2012.
  ista: Seiringer R, Yngvason J, Zagrebnov V. 2012. Disordered Bose-Einstein condensates
    with interaction in one dimension. Journal of Statistical Mechanics Theory and
    Experiment. 2012(11).
  mla: Seiringer, Robert, et al. “Disordered Bose-Einstein Condensates with Interaction
    in One Dimension.” <i>Journal of Statistical Mechanics Theory and Experiment</i>,
    vol. 2012, no. 11, IOP Publishing Ltd., 2012, doi:<a href="https://doi.org/10.1088/1742-5468/2012/11/P11007">10.1088/1742-5468/2012/11/P11007</a>.
  short: R. Seiringer, J. Yngvason, V. Zagrebnov, Journal of Statistical Mechanics
    Theory and Experiment 2012 (2012).
date_created: 2018-12-11T11:57:28Z
date_published: 2012-11-01T00:00:00Z
date_updated: 2021-01-12T06:57:16Z
day: '01'
doi: 10.1088/1742-5468/2012/11/P11007
extern: 1
intvolume: '      2012'
issue: '11'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1207.7054
month: '11'
oa: 1
publication: Journal of Statistical Mechanics Theory and Experiment
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '4523'
quality_controlled: 0
status: public
title: Disordered Bose-Einstein condensates with interaction in one dimension
type: journal_article
volume: 2012
year: '2012'
...
---
_id: '2411'
abstract:
- lang: eng
  text: The kingdom of fungi provides model organisms for biotechnology, cell biology,
    genetics, and life sciences in general. Only when their phylogenetic relationships
    are stably resolved, can individual results from fungal research be integrated
    into a holistic picture of biology. However, and despite recent progress, many
    deep relationships within the fungi remain unclear. Here, we present the first
    phylogenomic study of an entire eukaryotic kingdom that uses a consistency criterion
    to strengthen phylogenetic conclusions. We reason that branches (splits) recovered
    with independent data and different tree reconstruction methods are likely to
    reflect true evolutionary relationships. Two complementary phylogenomic data sets
    based on 99 fungal genomes and 109 fungal expressed sequence tag (EST) sets analyzed
    with four different tree reconstruction methods shed light from different angles
    on the fungal tree of life. Eleven additional data sets address specifically the
    phylogenetic position of Blastocladiomycota, Ustilaginomycotina, and Dothideomycetes,
    respectively. The combined evidence from the resulting trees supports the deep-level
    stability of the fungal groups toward a comprehensive natural system of the fungi.
    In addition, our analysis reveals methodologically interesting aspects. Enrichment
    for EST encoded data-a common practice in phylogenomic analyses-introduces a strong
    bias toward slowly evolving and functionally correlated genes. Consequently, the
    generalization of phylogenomic data sets as collections of randomly selected genes
    cannot be taken for granted. A thorough characterization of the data to assess
    possible influences on the tree reconstruction should therefore become a standard
    in phylogenomic analyses.
author:
- first_name: Ingo
  full_name: Ebersberger, Ingo
  last_name: Ebersberger
- first_name: Ricardo
  full_name: De Matos Simoes, Ricardo
  last_name: De Matos Simoes
- first_name: Anne
  full_name: Kupczok, Anne
  id: 2BB22BC2-F248-11E8-B48F-1D18A9856A87
  last_name: Kupczok
- first_name: Matthias
  full_name: Gube, Matthias
  last_name: Gube
- first_name: Erika
  full_name: Kothe, Erika
  last_name: Kothe
- first_name: Kerstin
  full_name: Voigt, Kerstin
  last_name: Voigt
- first_name: Arndt
  full_name: Von Haeseler, Arndt
  last_name: Von Haeseler
citation:
  ama: Ebersberger I, De Matos Simoes R, Kupczok A, et al. A consistent phylogenetic
    backbone for the fungi. <i>Molecular Biology and Evolution</i>. 2012;29(5):1319-1334.
    doi:<a href="https://doi.org/10.1093/molbev/msr285">10.1093/molbev/msr285</a>
  apa: Ebersberger, I., De Matos Simoes, R., Kupczok, A., Gube, M., Kothe, E., Voigt,
    K., &#38; Von Haeseler, A. (2012). A consistent phylogenetic backbone for the
    fungi. <i>Molecular Biology and Evolution</i>. Oxford University Press. <a href="https://doi.org/10.1093/molbev/msr285">https://doi.org/10.1093/molbev/msr285</a>
  chicago: Ebersberger, Ingo, Ricardo De Matos Simoes, Anne Kupczok, Matthias Gube,
    Erika Kothe, Kerstin Voigt, and Arndt Von Haeseler. “A Consistent Phylogenetic
    Backbone for the Fungi.” <i>Molecular Biology and Evolution</i>. Oxford University
    Press, 2012. <a href="https://doi.org/10.1093/molbev/msr285">https://doi.org/10.1093/molbev/msr285</a>.
  ieee: I. Ebersberger <i>et al.</i>, “A consistent phylogenetic backbone for the
    fungi,” <i>Molecular Biology and Evolution</i>, vol. 29, no. 5. Oxford University
    Press, pp. 1319–1334, 2012.
  ista: Ebersberger I, De Matos Simoes R, Kupczok A, Gube M, Kothe E, Voigt K, Von
    Haeseler A. 2012. A consistent phylogenetic backbone for the fungi. Molecular
    Biology and Evolution. 29(5), 1319–1334.
  mla: Ebersberger, Ingo, et al. “A Consistent Phylogenetic Backbone for the Fungi.”
    <i>Molecular Biology and Evolution</i>, vol. 29, no. 5, Oxford University Press,
    2012, pp. 1319–34, doi:<a href="https://doi.org/10.1093/molbev/msr285">10.1093/molbev/msr285</a>.
  short: I. Ebersberger, R. De Matos Simoes, A. Kupczok, M. Gube, E. Kothe, K. Voigt,
    A. Von Haeseler, Molecular Biology and Evolution 29 (2012) 1319–1334.
date_created: 2018-12-11T11:57:30Z
date_published: 2012-05-01T00:00:00Z
date_updated: 2021-01-12T06:57:19Z
day: '01'
ddc:
- '570'
- '576'
department:
- _id: JoBo
doi: 10.1093/molbev/msr285
file:
- access_level: open_access
  checksum: d565dcac27d1736c0c378ea6fcf22d69
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:13:30Z
  date_updated: 2020-07-14T12:45:40Z
  file_id: '5013'
  file_name: IST-2015-384-v1+1_Mol_Biol_Evol-2012-Ebersberger-1319-34.pdf
  file_size: 754922
  relation: main_file
file_date_updated: 2020-07-14T12:45:40Z
has_accepted_license: '1'
intvolume: '        29'
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 1319 - 1334
publication: Molecular Biology and Evolution
publication_status: published
publisher: Oxford University Press
publist_id: '4515'
pubrep_id: '384'
quality_controlled: '1'
scopus_import: 1
status: public
title: A consistent phylogenetic backbone for the fungi
tmp:
  image: /images/cc_by_nc.png
  legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
  short: CC BY-NC (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2012'
...
---
_id: '242'
abstract:
- lang: eng
  text: We investigate the first and second moments of shifted convolutions of the
    generalized divisor function d 3(n).
acknowledgement: "EP/E053262/1\tEngineering and Physical Sciences Research Council"
author:
- first_name: Stephan
  full_name: Baier, Stephan
  last_name: Baier
- first_name: Timothy D
  full_name: Timothy Browning
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
- first_name: Gihan
  full_name: Marasingha, Gihan
  last_name: Marasingha
- first_name: Liangyi
  full_name: Zhao, Liangyi
  last_name: Zhao
citation:
  ama: Baier S, Browning TD, Marasingha G, Zhao L. Averages of shifted convolutions
    of d3 (n). <i>Proceedings of the Edinburgh Mathematical Society</i>. 2012;55(3):551-576.
    doi:<a href="https://doi.org/10.1017/S001309151100037X">10.1017/S001309151100037X</a>
  apa: Baier, S., Browning, T. D., Marasingha, G., &#38; Zhao, L. (2012). Averages
    of shifted convolutions of d3 (n). <i>Proceedings of the Edinburgh Mathematical
    Society</i>. Cambridge University Press. <a href="https://doi.org/10.1017/S001309151100037X">https://doi.org/10.1017/S001309151100037X</a>
  chicago: Baier, Stephan, Timothy D Browning, Gihan Marasingha, and Liangyi Zhao.
    “Averages of Shifted Convolutions of D3 (N).” <i>Proceedings of the Edinburgh
    Mathematical Society</i>. Cambridge University Press, 2012. <a href="https://doi.org/10.1017/S001309151100037X">https://doi.org/10.1017/S001309151100037X</a>.
  ieee: S. Baier, T. D. Browning, G. Marasingha, and L. Zhao, “Averages of shifted
    convolutions of d3 (n),” <i>Proceedings of the Edinburgh Mathematical Society</i>,
    vol. 55, no. 3. Cambridge University Press, pp. 551–576, 2012.
  ista: Baier S, Browning TD, Marasingha G, Zhao L. 2012. Averages of shifted convolutions
    of d3 (n). Proceedings of the Edinburgh Mathematical Society. 55(3), 551–576.
  mla: Baier, Stephan, et al. “Averages of Shifted Convolutions of D3 (N).” <i>Proceedings
    of the Edinburgh Mathematical Society</i>, vol. 55, no. 3, Cambridge University
    Press, 2012, pp. 551–76, doi:<a href="https://doi.org/10.1017/S001309151100037X">10.1017/S001309151100037X</a>.
  short: S. Baier, T.D. Browning, G. Marasingha, L. Zhao, Proceedings of the Edinburgh
    Mathematical Society 55 (2012) 551–576.
date_created: 2018-12-11T11:45:23Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T06:57:23Z
day: '01'
doi: 10.1017/S001309151100037X
extern: 1
intvolume: '        55'
issue: '3'
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1101.5464
month: '10'
oa: 1
page: 551 - 576
publication: Proceedings of the Edinburgh Mathematical Society
publication_status: published
publisher: Cambridge University Press
publist_id: '7662'
quality_controlled: 0
status: public
title: Averages of shifted convolutions of d3 (n)
type: journal_article
volume: 55
year: '2012'
...
---
_id: '492'
abstract:
- lang: eng
  text: 'Background: Characterizing root system architecture (RSA) is essential to
    understanding the development and function of vascular plants. Identifying RSA-associated
    genes also represents an underexplored opportunity for crop improvement. Software
    tools are needed to accelerate the pace at which quantitative traits of RSA are
    estimated from images of root networks.Results: We have developed GiA Roots (General
    Image Analysis of Roots), a semi-automated software tool designed specifically
    for the high-throughput analysis of root system images. GiA Roots includes user-assisted
    algorithms to distinguish root from background and a fully automated pipeline
    that extracts dozens of root system phenotypes. Quantitative information on each
    phenotype, along with intermediate steps for full reproducibility, is returned
    to the end-user for downstream analysis. GiA Roots has a GUI front end and a command-line
    interface for interweaving the software into large-scale workflows. GiA Roots
    can also be extended to estimate novel phenotypes specified by the end-user.Conclusions:
    We demonstrate the use of GiA Roots on a set of 2393 images of rice roots representing
    12 genotypes from the species Oryza sativa. We validate trait measurements against
    prior analyses of this image set that demonstrated that RSA traits are likely
    heritable and associated with genotypic differences. Moreover, we demonstrate
    that GiA Roots is extensible and an end-user can add functionality so that GiA
    Roots can estimate novel RSA traits. In summary, we show that the software can
    function as an efficient tool as part of a workflow to move from large numbers
    of root images to downstream analysis.'
article_number: '116'
article_processing_charge: No
author:
- first_name: Taras
  full_name: Galkovskyi, Taras
  last_name: Galkovskyi
- first_name: Yuriy
  full_name: Mileyko, Yuriy
  last_name: Mileyko
- first_name: Alexander
  full_name: Bucksch, Alexander
  last_name: Bucksch
- first_name: Brad
  full_name: Moore, Brad
  last_name: Moore
- first_name: Olga
  full_name: Symonova, Olga
  id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87
  last_name: Symonova
- first_name: Charles
  full_name: Price, Charles
  last_name: Price
- first_name: Chrostopher
  full_name: Topp, Chrostopher
  last_name: Topp
- first_name: Anjali
  full_name: Iyer Pascuzzi, Anjali
  last_name: Iyer Pascuzzi
- first_name: Paul
  full_name: Zurek, Paul
  last_name: Zurek
- first_name: Suqin
  full_name: Fang, Suqin
  last_name: Fang
- first_name: John
  full_name: Harer, John
  last_name: Harer
- first_name: Philip
  full_name: Benfey, Philip
  last_name: Benfey
- first_name: Joshua
  full_name: Weitz, Joshua
  last_name: Weitz
citation:
  ama: 'Galkovskyi T, Mileyko Y, Bucksch A, et al. GiA Roots: Software for the high
    throughput analysis of plant root system architecture. <i>BMC Plant Biology</i>.
    2012;12. doi:<a href="https://doi.org/10.1186/1471-2229-12-116">10.1186/1471-2229-12-116</a>'
  apa: 'Galkovskyi, T., Mileyko, Y., Bucksch, A., Moore, B., Symonova, O., Price,
    C., … Weitz, J. (2012). GiA Roots: Software for the high throughput analysis of
    plant root system architecture. <i>BMC Plant Biology</i>. BioMed Central. <a href="https://doi.org/10.1186/1471-2229-12-116">https://doi.org/10.1186/1471-2229-12-116</a>'
  chicago: 'Galkovskyi, Taras, Yuriy Mileyko, Alexander Bucksch, Brad Moore, Olga
    Symonova, Charles Price, Chrostopher Topp, et al. “GiA Roots: Software for the
    High Throughput Analysis of Plant Root System Architecture.” <i>BMC Plant Biology</i>.
    BioMed Central, 2012. <a href="https://doi.org/10.1186/1471-2229-12-116">https://doi.org/10.1186/1471-2229-12-116</a>.'
  ieee: 'T. Galkovskyi <i>et al.</i>, “GiA Roots: Software for the high throughput
    analysis of plant root system architecture,” <i>BMC Plant Biology</i>, vol. 12.
    BioMed Central, 2012.'
  ista: 'Galkovskyi T, Mileyko Y, Bucksch A, Moore B, Symonova O, Price C, Topp C,
    Iyer Pascuzzi A, Zurek P, Fang S, Harer J, Benfey P, Weitz J. 2012. GiA Roots:
    Software for the high throughput analysis of plant root system architecture. BMC
    Plant Biology. 12, 116.'
  mla: 'Galkovskyi, Taras, et al. “GiA Roots: Software for the High Throughput Analysis
    of Plant Root System Architecture.” <i>BMC Plant Biology</i>, vol. 12, 116, BioMed
    Central, 2012, doi:<a href="https://doi.org/10.1186/1471-2229-12-116">10.1186/1471-2229-12-116</a>.'
  short: T. Galkovskyi, Y. Mileyko, A. Bucksch, B. Moore, O. Symonova, C. Price, C.
    Topp, A. Iyer Pascuzzi, P. Zurek, S. Fang, J. Harer, P. Benfey, J. Weitz, BMC
    Plant Biology 12 (2012).
date_created: 2018-12-11T11:46:46Z
date_published: 2012-07-26T00:00:00Z
date_updated: 2022-08-25T14:59:17Z
day: '26'
ddc:
- '005'
- '514'
- '516'
doi: 10.1186/1471-2229-12-116
extern: '1'
file:
- access_level: open_access
  checksum: 0c629e36acd5f2878ff7dd088d67d494
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:12:35Z
  date_updated: 2020-07-14T12:46:35Z
  file_id: '4953'
  file_name: IST-2018-946-v1+1_2012_Symonova_GiA_Roots.pdf
  file_size: 1691436
  relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: '        12'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: BMC Plant Biology
publication_status: published
publisher: BioMed Central
publist_id: '7328'
pubrep_id: '946'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'GiA Roots: Software for the high throughput analysis of plant root system
  architecture'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2012'
...
---
_id: '493'
abstract:
- lang: eng
  text: 'The BCI competition IV stands in the tradition of prior BCI competitions
    that aim to provide high quality neuroscientific data for open access to the scientific
    community. As experienced already in prior competitions not only scientists from
    the narrow field of BCI compete, but scholars with a broad variety of backgrounds
    and nationalities. They include high specialists as well as students.The goals
    of all BCI competitions have always been to challenge with respect to novel paradigms
    and complex data. We report on the following challenges: (1) asynchronous data,
    (2) synthetic, (3) multi-class continuous data, (4) sessionto-session transfer,
    (5) directionally modulated MEG, (6) finger movements recorded by ECoG. As after
    past competitions, our hope is that winning entries may enhance the analysis methods
    of future BCIs.'
acknowledgement: "The studies were in part or completely supported by the Bundesministerium
  für Bildung und Forschung (BMBF), Fkz 01IB001A, 01GQ0850, by the German Science
  Foundation (DFG, contract MU 987/3-2), by the European ICT Programme Projects FP7-224631
  and 216886, the World Class University Program through the National Research Foundation
  of Korea funded by the Ministry of Education, Science, and Technology (Grant R31-10008),
  the US Army Research Office [W911NF-08-1-0216 (Gerwin Schalk) and W911NF-07-1-0415
  (Gerwin Schalk)] and the NIH [EB006356 (Gerwin Schalk) and EB000856 (Gerwin Schalk),
  the WIN-Kolleg of the Heidelberg Academy of Sciences and Humanities, German Federal
  Ministry of Education and Research grants 01GQ0420, 01GQ0761, 01GQ0762, and 01GQ0830,
  German Research Foundation grants 550/B5 and C6, and by a scholarship from the German
  National Academic Foundation. This paper only reflects the authors’ views and funding
  agencies are not liable for any use that may be made of the information contained
  herein.\r\n"
article_number: '55'
author:
- first_name: Michael
  full_name: Tangermann, Michael
  last_name: Tangermann
- first_name: Klaus
  full_name: Müller, Klaus
  last_name: Müller
- first_name: Ad
  full_name: Aertsen, Ad
  last_name: Aertsen
- first_name: Niels
  full_name: Birbaumer, Niels
  last_name: Birbaumer
- first_name: Christoph
  full_name: Braun, Christoph
  last_name: Braun
- first_name: Clemens
  full_name: Brunner, Clemens
  last_name: Brunner
- first_name: Robert
  full_name: Leeb, Robert
  last_name: Leeb
- first_name: Carsten
  full_name: Mehring, Carsten
  last_name: Mehring
- first_name: Kai
  full_name: Miller, Kai
  last_name: Miller
- first_name: Gernot
  full_name: Müller Putz, Gernot
  last_name: Müller Putz
- first_name: Guido
  full_name: Nolte, Guido
  last_name: Nolte
- first_name: Gert
  full_name: Pfurtscheller, Gert
  last_name: Pfurtscheller
- first_name: Hubert
  full_name: Preissl, Hubert
  last_name: Preissl
- first_name: Gerwin
  full_name: Schalk, Gerwin
  last_name: Schalk
- first_name: Alois
  full_name: Schlögl, Alois
  id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
  last_name: Schlögl
  orcid: 0000-0002-5621-8100
- first_name: Carmen
  full_name: Vidaurre, Carmen
  last_name: Vidaurre
- first_name: Stephan
  full_name: Waldert, Stephan
  last_name: Waldert
- first_name: Benjamin
  full_name: Blankertz, Benjamin
  last_name: Blankertz
citation:
  ama: Tangermann M, Müller K, Aertsen A, et al. Review of the BCI competition IV.
    <i>Frontiers in Neuroscience</i>. 2012;6. doi:<a href="https://doi.org/10.3389/fnins.2012.00055">10.3389/fnins.2012.00055</a>
  apa: Tangermann, M., Müller, K., Aertsen, A., Birbaumer, N., Braun, C., Brunner,
    C., … Blankertz, B. (2012). Review of the BCI competition IV. <i>Frontiers in
    Neuroscience</i>. Frontiers Research Foundation. <a href="https://doi.org/10.3389/fnins.2012.00055">https://doi.org/10.3389/fnins.2012.00055</a>
  chicago: Tangermann, Michael, Klaus Müller, Ad Aertsen, Niels Birbaumer, Christoph
    Braun, Clemens Brunner, Robert Leeb, et al. “Review of the BCI Competition IV.”
    <i>Frontiers in Neuroscience</i>. Frontiers Research Foundation, 2012. <a href="https://doi.org/10.3389/fnins.2012.00055">https://doi.org/10.3389/fnins.2012.00055</a>.
  ieee: M. Tangermann <i>et al.</i>, “Review of the BCI competition IV,” <i>Frontiers
    in Neuroscience</i>, vol. 6. Frontiers Research Foundation, 2012.
  ista: Tangermann M, Müller K, Aertsen A, Birbaumer N, Braun C, Brunner C, Leeb R,
    Mehring C, Miller K, Müller Putz G, Nolte G, Pfurtscheller G, Preissl H, Schalk
    G, Schlögl A, Vidaurre C, Waldert S, Blankertz B. 2012. Review of the BCI competition
    IV. Frontiers in Neuroscience. 6, 55.
  mla: Tangermann, Michael, et al. “Review of the BCI Competition IV.” <i>Frontiers
    in Neuroscience</i>, vol. 6, 55, Frontiers Research Foundation, 2012, doi:<a href="https://doi.org/10.3389/fnins.2012.00055">10.3389/fnins.2012.00055</a>.
  short: M. Tangermann, K. Müller, A. Aertsen, N. Birbaumer, C. Braun, C. Brunner,
    R. Leeb, C. Mehring, K. Miller, G. Müller Putz, G. Nolte, G. Pfurtscheller, H.
    Preissl, G. Schalk, A. Schlögl, C. Vidaurre, S. Waldert, B. Blankertz, Frontiers
    in Neuroscience 6 (2012).
date_created: 2018-12-11T11:46:46Z
date_published: 2012-07-13T00:00:00Z
date_updated: 2021-01-12T08:01:03Z
day: '13'
ddc:
- '004'
department:
- _id: ScienComp
- _id: PeJo
doi: 10.3389/fnins.2012.00055
file:
- access_level: open_access
  checksum: 195238221c4b0b0f4035f6f6c16ea17c
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:18:34Z
  date_updated: 2020-07-14T12:46:35Z
  file_id: '5356'
  file_name: IST-2018-945-v1+1_2012_Schloegl_Review_of.pdf
  file_size: 2693701
  relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: '         6'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Frontiers in Neuroscience
publication_status: published
publisher: Frontiers Research Foundation
publist_id: '7327'
pubrep_id: '945'
quality_controlled: '1'
scopus_import: 1
status: public
title: Review of the BCI competition IV
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2012'
...
---
_id: '495'
abstract:
- lang: eng
  text: An automaton with advice is a finite state automaton which has access to an
    additional fixed infinite string called an advice tape. We refine the Myhill-Nerode
    theorem to characterize the languages of finite strings that are accepted by automata
    with advice. We do the same for tree automata with advice.
alternative_title:
- EPTCS
author:
- first_name: Alex
  full_name: Kruckman, Alex
  last_name: Kruckman
- first_name: Sasha
  full_name: Rubin, Sasha
  id: 2EC51194-F248-11E8-B48F-1D18A9856A87
  last_name: Rubin
- first_name: John
  full_name: Sheridan, John
  last_name: Sheridan
- first_name: Ben
  full_name: Zax, Ben
  last_name: Zax
citation:
  ama: 'Kruckman A, Rubin S, Sheridan J, Zax B. A Myhill Nerode theorem for automata
    with advice. In: <i>Proceedings GandALF 2012</i>. Vol 96. Open Publishing Association;
    2012:238-246. doi:<a href="https://doi.org/10.4204/EPTCS.96.18">10.4204/EPTCS.96.18</a>'
  apa: 'Kruckman, A., Rubin, S., Sheridan, J., &#38; Zax, B. (2012). A Myhill Nerode
    theorem for automata with advice. In <i>Proceedings GandALF 2012</i> (Vol. 96,
    pp. 238–246). Napoli, Italy: Open Publishing Association. <a href="https://doi.org/10.4204/EPTCS.96.18">https://doi.org/10.4204/EPTCS.96.18</a>'
  chicago: Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode
    Theorem for Automata with Advice.” In <i>Proceedings GandALF 2012</i>, 96:238–46.
    Open Publishing Association, 2012. <a href="https://doi.org/10.4204/EPTCS.96.18">https://doi.org/10.4204/EPTCS.96.18</a>.
  ieee: A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for
    automata with advice,” in <i>Proceedings GandALF 2012</i>, Napoli, Italy, 2012,
    vol. 96, pp. 238–246.
  ista: 'Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for
    automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics
    and Formal Verification, EPTCS, vol. 96, 238–246.'
  mla: Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.”
    <i>Proceedings GandALF 2012</i>, vol. 96, Open Publishing Association, 2012, pp.
    238–46, doi:<a href="https://doi.org/10.4204/EPTCS.96.18">10.4204/EPTCS.96.18</a>.
  short: A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012,
    Open Publishing Association, 2012, pp. 238–246.
conference:
  end_date: 2012-09-08
  location: Napoli, Italy
  name: 'GandALF: Games, Automata, Logics and Formal Verification'
  start_date: 2012-09-06
date_created: 2018-12-11T11:46:47Z
date_published: 2012-10-07T00:00:00Z
date_updated: 2021-01-12T08:01:04Z
day: '07'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4204/EPTCS.96.18
ec_funded: 1
file:
- access_level: open_access
  checksum: 56277f95edc9d531fa3bdc5f9579fda8
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:15:31Z
  date_updated: 2020-07-14T12:46:35Z
  file_id: '5152'
  file_name: IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf
  file_size: 97736
  relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: '        96'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 238 - 246
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
publication: Proceedings GandALF 2012
publication_status: published
publisher: Open Publishing Association
publist_id: '7325'
pubrep_id: '944'
quality_controlled: '1'
scopus_import: 1
status: public
title: A Myhill Nerode theorem for automata with advice
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2012'
...
---
_id: '496'
abstract:
- lang: eng
  text: 'We study the expressive power of logical interpretations on the class of
    scattered trees, namely those with countably many infinite branches. Scattered
    trees can be thought of as the tree analogue of scattered linear orders. Every
    scattered tree has an ordinal rank that reflects the structure of its infinite
    branches. We prove, roughly, that trees and orders of large rank cannot be interpreted
    in scattered trees of small rank. We consider a quite general notion of interpretation:
    each element of the interpreted structure is represented by a set of tuples of
    subsets of the interpreting tree. Our trees are countable, not necessarily finitely
    branching, and may have finitely many unary predicates as labellings. We also
    show how to replace injective set-interpretations in (not necessarily scattered)
    trees by ''finitary'' set-interpretations.'
alternative_title:
- LICS
article_number: '6280474'
author:
- first_name: Alexander
  full_name: Rabinovich, Alexander
  last_name: Rabinovich
- first_name: Sasha
  full_name: Rubin, Sasha
  id: 2EC51194-F248-11E8-B48F-1D18A9856A87
  last_name: Rubin
citation:
  ama: 'Rabinovich A, Rubin S. Interpretations in trees with countably many branches.
    In: IEEE; 2012. doi:<a href="https://doi.org/10.1109/LICS.2012.65">10.1109/LICS.2012.65</a>'
  apa: 'Rabinovich, A., &#38; Rubin, S. (2012). Interpretations in trees with countably
    many branches. Presented at the LICS: Symposium on Logic in Computer Science,
    Dubrovnik, Croatia: IEEE. <a href="https://doi.org/10.1109/LICS.2012.65">https://doi.org/10.1109/LICS.2012.65</a>'
  chicago: Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with
    Countably Many Branches.” IEEE, 2012. <a href="https://doi.org/10.1109/LICS.2012.65">https://doi.org/10.1109/LICS.2012.65</a>.
  ieee: 'A. Rabinovich and S. Rubin, “Interpretations in trees with countably many
    branches,” presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik,
    Croatia, 2012.'
  ista: 'Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many
    branches. LICS: Symposium on Logic in Computer Science, LICS, , 6280474.'
  mla: Rabinovich, Alexander, and Sasha Rubin. <i>Interpretations in Trees with Countably
    Many Branches</i>. 6280474, IEEE, 2012, doi:<a href="https://doi.org/10.1109/LICS.2012.65">10.1109/LICS.2012.65</a>.
  short: A. Rabinovich, S. Rubin, in:, IEEE, 2012.
conference:
  end_date: 2012-06-28
  location: Dubrovnik, Croatia
  name: 'LICS: Symposium on Logic in Computer Science'
  start_date: 2012-06-25
date_created: 2018-12-11T11:46:47Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T08:01:05Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/LICS.2012.65
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arise.or.at/pubpdf/Interpretations_in_Trees_with_Countably_Many_Branches.pdf
month: '01'
oa: 1
oa_version: Preprint
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
publication_status: published
publisher: IEEE
publist_id: '7324'
quality_controlled: '1'
scopus_import: 1
status: public
title: Interpretations in trees with countably many branches
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '497'
abstract:
- lang: eng
  text: 'One central issue in the formal design and analysis of reactive systems is
    the notion of refinement that asks whether all behaviors of the implementation
    is allowed by the specification. The local interpretation of behavior leads to
    the notion of simulation. Alternating transition systems (ATSs) provide a general
    model for composite reactive systems, and the simulation relation for ATSs is
    known as alternating simulation. The simulation relation for fair transition systems
    is called fair simulation. In this work our main contributions are as follows:
    (1) We present an improved algorithm for fair simulation with Büchi fairness constraints;
    our algorithm requires O(n 3·m) time as compared to the previous known O(n 6)-time
    algorithm, where n is the number of states and m is the number of transitions.
    (2) We present a game based algorithm for alternating simulation that requires
    O(m2)-time as compared to the previous known O((n·m)2)-time algorithm, where n
    is the number of states and m is the size of transition relation. (3) We present
    an iterative algorithm for alternating simulation that matches the time complexity
    of the game based algorithm, but is more space efficient than the game based algorithm.
    © Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath.'
alternative_title:
- LIPIcs
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Siddhesh
  full_name: Chaubal, Siddhesh
  last_name: Chaubal
- first_name: Pritish
  full_name: Kamath, Pritish
  last_name: Kamath
citation:
  ama: 'Chatterjee K, Chaubal S, Kamath P. Faster algorithms for alternating refinement
    relations. In: Vol 16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:167-182.
    doi:<a href="https://doi.org/10.4230/LIPIcs.CSL.2012.167">10.4230/LIPIcs.CSL.2012.167</a>'
  apa: 'Chatterjee, K., Chaubal, S., &#38; Kamath, P. (2012). Faster algorithms for
    alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL:
    European Association for Computer Science Logic, Fontainebleau, France: Schloss
    Dagstuhl - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPIcs.CSL.2012.167">https://doi.org/10.4230/LIPIcs.CSL.2012.167</a>'
  chicago: Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms
    for Alternating Refinement Relations,” 16:167–82. Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2012. <a href="https://doi.org/10.4230/LIPIcs.CSL.2012.167">https://doi.org/10.4230/LIPIcs.CSL.2012.167</a>.
  ieee: 'K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating
    refinement relations,” presented at the EACSL: European Association for Computer
    Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.'
  ista: 'Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating
    refinement relations. EACSL: European Association for Computer Science Logic,
    LIPIcs, vol. 16, 167–182.'
  mla: Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Alternating Refinement
    Relations</i>. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012,
    pp. 167–82, doi:<a href="https://doi.org/10.4230/LIPIcs.CSL.2012.167">10.4230/LIPIcs.CSL.2012.167</a>.
  short: K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2012, pp. 167–182.
conference:
  end_date: 2012-09-06
  location: Fontainebleau, France
  name: 'EACSL: European Association for Computer Science Logic'
  start_date: 2012-09-03
date_created: 2018-12-11T11:46:48Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2023-02-23T12:23:32Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.CSL.2012.167
ec_funded: 1
file:
- access_level: open_access
  checksum: f1b0dd99240800db2d7dbf9b5131fe5e
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:08:50Z
  date_updated: 2020-07-14T12:46:35Z
  file_id: '4712'
  file_name: IST-2018-943-v1+1_2012_Chatterjee_Faster_Algorithms.pdf
  file_size: 471236
  relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: '        16'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 167 - 182
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P 23499-N23
  name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
  name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7323'
pubrep_id: '943'
quality_controlled: '1'
related_material:
  record:
  - id: '5378'
    relation: earlier_version
    status: public
scopus_import: 1
status: public
title: Faster algorithms for alternating refinement relations
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2012'
...
---
_id: '498'
abstract:
- lang: eng
  text: Understanding patterns and correlates of local adaptation in heterogeneous
    landscapes can provide important information in the selection of appropriate seed
    sources for restoration. We assessed the extent of local adaptation of fitness
    components in 12 population pairs of the perennial herb Rutidosis leptorrhynchoides
    (Asteraceae) and examined whether spatial scale (0.7-600 km), environmental distance,
    quantitative (QST) and neutral (FST) genetic differentiation, and size of the
    local and foreign populations could predict patterns of adaptive differentiation.
    Local adaptation varied among populations and fitness components. Including all
    population pairs, local adaptation was observed for seedling survival, but not
    for biomass, while foreign genotype advantage was observed for reproduction (number
    of inflorescences). Among population pairs, local adaptation increased with QST
    and local population size for biomass. QST was associated with environmental distance,
    suggesting ecological selection for phenotypic divergence. However, low FST and
    variation in population structure in small populations demonstrates the interaction
    of gene flow and drift in constraining local adaptation in R. leptorrhynchoides.
    Our study indicates that for species in heterogeneous landscapes, collecting seed
    from large populations from similar environments to candidate sites is likely
    to provide the most appropriate seed sources for restoration.
acknowledgement: "We thank Graham Pickup, David Steer, Linda Broadhurst, Lan Li and
  Carole Elliott for technical assistance. The New\r\nSouth Wales Department of Environment
  and Climate Change, ACT Parks, Conservation and Lands and the\r\nDepartment of Sustainability
  and Environment in Victoria provided permits for seed and soil collection. We thank\r\nSpencer
  C. H. Barrett for comments that improved the quality of the manuscript.\r\n"
author:
- first_name: Melinda
  full_name: Pickup, Melinda
  id: 2C78037E-F248-11E8-B48F-1D18A9856A87
  last_name: Pickup
  orcid: 0000-0001-6118-0541
- first_name: David
  full_name: Field, David
  id: 419049E2-F248-11E8-B48F-1D18A9856A87
  last_name: Field
  orcid: 0000-0002-4014-8478
- first_name: David
  full_name: Rowell, David
  last_name: Rowell
- first_name: Andrew
  full_name: Young, Andrew
  last_name: Young
citation:
  ama: 'Pickup M, Field D, Rowell D, Young A. Predicting local adaptation in fragmented
    plant populations: Implications for restoration genetics. <i>Evolutionary Applications</i>.
    2012;5(8):913-924. doi:<a href="https://doi.org/10.1111/j.1752-4571.2012.00284.x">10.1111/j.1752-4571.2012.00284.x</a>'
  apa: 'Pickup, M., Field, D., Rowell, D., &#38; Young, A. (2012). Predicting local
    adaptation in fragmented plant populations: Implications for restoration genetics.
    <i>Evolutionary Applications</i>. Wiley-Blackwell. <a href="https://doi.org/10.1111/j.1752-4571.2012.00284.x">https://doi.org/10.1111/j.1752-4571.2012.00284.x</a>'
  chicago: 'Pickup, Melinda, David Field, David Rowell, and Andrew Young. “Predicting
    Local Adaptation in Fragmented Plant Populations: Implications for Restoration
    Genetics.” <i>Evolutionary Applications</i>. Wiley-Blackwell, 2012. <a href="https://doi.org/10.1111/j.1752-4571.2012.00284.x">https://doi.org/10.1111/j.1752-4571.2012.00284.x</a>.'
  ieee: 'M. Pickup, D. Field, D. Rowell, and A. Young, “Predicting local adaptation
    in fragmented plant populations: Implications for restoration genetics,” <i>Evolutionary
    Applications</i>, vol. 5, no. 8. Wiley-Blackwell, pp. 913–924, 2012.'
  ista: 'Pickup M, Field D, Rowell D, Young A. 2012. Predicting local adaptation in
    fragmented plant populations: Implications for restoration genetics. Evolutionary
    Applications. 5(8), 913–924.'
  mla: 'Pickup, Melinda, et al. “Predicting Local Adaptation in Fragmented Plant Populations:
    Implications for Restoration Genetics.” <i>Evolutionary Applications</i>, vol.
    5, no. 8, Wiley-Blackwell, 2012, pp. 913–24, doi:<a href="https://doi.org/10.1111/j.1752-4571.2012.00284.x">10.1111/j.1752-4571.2012.00284.x</a>.'
  short: M. Pickup, D. Field, D. Rowell, A. Young, Evolutionary Applications 5 (2012)
    913–924.
date_created: 2018-12-11T11:46:48Z
date_published: 2012-12-01T00:00:00Z
date_updated: 2021-01-12T08:01:06Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1111/j.1752-4571.2012.00284.x
file:
- access_level: open_access
  checksum: 233007138606aca5a2f75f7ae1742f43
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:10:33Z
  date_updated: 2020-07-14T12:46:35Z
  file_id: '4821'
  file_name: IST-2018-942-v1+1_Pickup_et_al-2012-Evolutionary_Applications.pdf
  file_size: 396136
  relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: '         5'
issue: '8'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 913 - 924
publication: Evolutionary Applications
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7322'
pubrep_id: '942'
quality_controlled: '1'
status: public
title: 'Predicting local adaptation in fragmented plant populations: Implications
  for restoration genetics'
tmp:
  image: /images/cc_by_nc.png
  legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
  short: CC BY-NC (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2012'
...
---
_id: '506'
article_processing_charge: No
article_type: original
author:
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
citation:
  ama: 'Sixt MK. Cell migration: Fibroblasts find a new way to get ahead. <i>Journal
    of Cell Biology</i>. 2012;197(3):347-349. doi:<a href="https://doi.org/10.1083/jcb.201204039">10.1083/jcb.201204039</a>'
  apa: 'Sixt, M. K. (2012). Cell migration: Fibroblasts find a new way to get ahead.
    <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href="https://doi.org/10.1083/jcb.201204039">https://doi.org/10.1083/jcb.201204039</a>'
  chicago: 'Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.”
    <i>Journal of Cell Biology</i>. Rockefeller University Press, 2012. <a href="https://doi.org/10.1083/jcb.201204039">https://doi.org/10.1083/jcb.201204039</a>.'
  ieee: 'M. K. Sixt, “Cell migration: Fibroblasts find a new way to get ahead,” <i>Journal
    of Cell Biology</i>, vol. 197, no. 3. Rockefeller University Press, pp. 347–349,
    2012.'
  ista: 'Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal
    of Cell Biology. 197(3), 347–349.'
  mla: 'Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.”
    <i>Journal of Cell Biology</i>, vol. 197, no. 3, Rockefeller University Press,
    2012, pp. 347–49, doi:<a href="https://doi.org/10.1083/jcb.201204039">10.1083/jcb.201204039</a>.'
  short: M.K. Sixt, Journal of Cell Biology 197 (2012) 347–349.
date_created: 2018-12-11T11:46:51Z
date_published: 2012-04-30T00:00:00Z
date_updated: 2021-01-12T08:01:11Z
day: '30'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1083/jcb.201204039
file:
- access_level: open_access
  checksum: 45c02be33ebd99fc3077d60b9c90bdfa
  content_type: application/pdf
  creator: kschuh
  date_created: 2019-02-12T09:03:09Z
  date_updated: 2020-07-14T12:46:36Z
  file_id: '5957'
  file_name: 2012_CellBiology_Sixt.pdf
  file_size: 986566
  relation: main_file
file_date_updated: 2020-07-14T12:46:36Z
has_accepted_license: '1'
intvolume: '       197'
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '04'
oa: 1
oa_version: Published Version
page: 347 - 349
publication: Journal of Cell Biology
publication_status: published
publisher: Rockefeller University Press
publist_id: '7314'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Cell migration: Fibroblasts find a new way to get ahead'
tmp:
  image: /images/cc_by_nc_sa.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
    BY-NC-SA 4.0)
  short: CC BY-NC-SA (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 197
year: '2012'
...
---
_id: '5377'
abstract:
- lang: eng
  text: 'Two-player games on graphs are central in many problems in formal verification
    and program analysis such as synthesis and verification of open systems. In this
    work we consider solving recursive game graphs (or pushdown game graphs) that
    can model the control flow of sequential programs with recursion. While pushdown
    games have been studied before with qualitative objectives, such as reachability
    and ω-regular objectives, in this work we study for the first time such games
    with the most well-studied quantitative objective, namely, mean-payoff objectives.
    In pushdown games two types of strategies are relevant: (1) global strategies,
    that depend on the entire global history; and (2) modular strategies, that have
    only local memory and thus do not depend on the context of invocation, but only
    on the history of the current invocation of the module. Our main results are as
    follows: (1) One-player pushdown games with mean-payoff objectives under global
    strategies are decidable in polynomial time. (2) Two- player pushdown games with
    mean-payoff objectives under global strategies are undecidable. (3) One-player
    pushdown games with mean-payoff objectives under modular strategies are NP- hard.
    (4) Two-player pushdown games with mean-payoff objectives under modular strategies
    can be solved in NP (i.e., both one-player and two-player pushdown games with
    mean-payoff objectives under modular strategies are NP-complete). We also establish
    the optimal strategy complexity showing that global strategies for mean-payoff
    objectives require infinite memory even in one-player pushdown games; and memoryless
    modular strategies are sufficient in two- player pushdown games. Finally we also
    show that all the problems have the same complexity if the stack boundedness condition
    is added, where along with the mean-payoff objective the player must also ensure
    that the stack height is bounded.'
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: Yaron
  full_name: Velner, Yaron
  last_name: Velner
citation:
  ama: Chatterjee K, Velner Y. <i>Mean-Payoff Pushdown Games</i>. IST Austria; 2012.
    doi:<a href="https://doi.org/10.15479/AT:IST-2012-0002">10.15479/AT:IST-2012-0002</a>
  apa: Chatterjee, K., &#38; Velner, Y. (2012). <i>Mean-payoff pushdown games</i>.
    IST Austria. <a href="https://doi.org/10.15479/AT:IST-2012-0002">https://doi.org/10.15479/AT:IST-2012-0002</a>
  chicago: Chatterjee, Krishnendu, and Yaron Velner. <i>Mean-Payoff Pushdown Games</i>.
    IST Austria, 2012. <a href="https://doi.org/10.15479/AT:IST-2012-0002">https://doi.org/10.15479/AT:IST-2012-0002</a>.
  ieee: K. Chatterjee and Y. Velner, <i>Mean-payoff pushdown games</i>. IST Austria,
    2012.
  ista: Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
  mla: Chatterjee, Krishnendu, and Yaron Velner. <i>Mean-Payoff Pushdown Games</i>.
    IST Austria, 2012, doi:<a href="https://doi.org/10.15479/AT:IST-2012-0002">10.15479/AT:IST-2012-0002</a>.
  short: K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
date_created: 2018-12-12T11:38:59Z
date_published: 2012-07-02T00:00:00Z
date_updated: 2023-02-23T11:05:50Z
day: '02'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2012-0002
file:
- access_level: open_access
  checksum: a03c08c1589dbb0c96183a8bcf3ab240
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:54:00Z
  date_updated: 2020-07-14T12:46:38Z
  file_id: '5522'
  file_name: IST-2012-002_IST-2012-0002.pdf
  file_size: 592098
  relation: main_file
file_date_updated: 2020-07-14T12:46:38Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '10'
related_material:
  record:
  - id: '2956'
    relation: later_version
    status: public
status: public
title: Mean-payoff pushdown games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
