---
_id: '1521'
abstract:
- lang: eng
  text: Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular
    energy production, coupling electron transfer between NADH and quinone to proton
    translocation. It is the largest protein assembly of respiratory chains and one
    of the most elaborate redox membrane proteins known. Bacterial enzyme is about
    half the size of mitochondrial and thus provides its important &quot;minimal&quot;
    model. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative
    diseases. The L-shaped complex consists of a hydrophilic arm, where electron transfer
    occurs, and a membrane arm, where proton translocation takes place. We have solved
    the crystal structures of the hydrophilic domain of complex I from Thermus thermophilus,
    the membrane domain from Escherichia coli and recently of the intact, entire complex
    I from T. thermophilus (536. kDa, 16 subunits, 9 iron-sulphur clusters, 64 transmembrane
    helices). The 95. Å long electron transfer pathway through the enzyme proceeds
    from the primary electron acceptor flavin mononucleotide through seven conserved
    Fe-S clusters to the unusual elongated quinone-binding site at the interface with
    the membrane domain. Four putative proton translocation channels are found in
    the membrane domain, all linked by the central flexible axis containing charged
    residues. The redox energy of electron transfer is coupled to proton translocation
    by the as yet undefined mechanism proposed to involve long-range conformational
    changes. This article is part of a Special Issue entitled Respiratory complex
    I, edited by Volker Zickermann and Ulrich Brandt.
acknowledgement: funded by the Medical Research Council (Grant number MC_U105674180)
article_processing_charge: No
author:
- first_name: John
  full_name: Berrisford, John
  last_name: Berrisford
- first_name: Rozbeh
  full_name: Baradaran, Rozbeh
  last_name: Baradaran
- first_name: Leonid A
  full_name: Sazanov, Leonid A
  id: 338D39FE-F248-11E8-B48F-1D18A9856A87
  last_name: Sazanov
  orcid: 0000-0002-0977-7989
citation:
  ama: Berrisford J, Baradaran R, Sazanov LA. Structure of bacterial respiratory complex
    I. <i>Biochimica et Biophysica Acta - Bioenergetics</i>. 2016;1857(7):892-901.
    doi:<a href="https://doi.org/10.1016/j.bbabio.2016.01.012">10.1016/j.bbabio.2016.01.012</a>
  apa: Berrisford, J., Baradaran, R., &#38; Sazanov, L. A. (2016). Structure of bacterial
    respiratory complex I. <i>Biochimica et Biophysica Acta - Bioenergetics</i>. Elsevier.
    <a href="https://doi.org/10.1016/j.bbabio.2016.01.012">https://doi.org/10.1016/j.bbabio.2016.01.012</a>
  chicago: Berrisford, John, Rozbeh Baradaran, and Leonid A Sazanov. “Structure of
    Bacterial Respiratory Complex I.” <i>Biochimica et Biophysica Acta - Bioenergetics</i>.
    Elsevier, 2016. <a href="https://doi.org/10.1016/j.bbabio.2016.01.012">https://doi.org/10.1016/j.bbabio.2016.01.012</a>.
  ieee: J. Berrisford, R. Baradaran, and L. A. Sazanov, “Structure of bacterial respiratory
    complex I,” <i>Biochimica et Biophysica Acta - Bioenergetics</i>, vol. 1857, no.
    7. Elsevier, pp. 892–901, 2016.
  ista: Berrisford J, Baradaran R, Sazanov LA. 2016. Structure of bacterial respiratory
    complex I. Biochimica et Biophysica Acta - Bioenergetics. 1857(7), 892–901.
  mla: Berrisford, John, et al. “Structure of Bacterial Respiratory Complex I.” <i>Biochimica
    et Biophysica Acta - Bioenergetics</i>, vol. 1857, no. 7, Elsevier, 2016, pp.
    892–901, doi:<a href="https://doi.org/10.1016/j.bbabio.2016.01.012">10.1016/j.bbabio.2016.01.012</a>.
  short: J. Berrisford, R. Baradaran, L.A. Sazanov, Biochimica et Biophysica Acta
    - Bioenergetics 1857 (2016) 892–901.
corr_author: '1'
date_created: 2018-12-11T11:52:30Z
date_published: 2016-07-01T00:00:00Z
date_updated: 2025-09-18T11:08:50Z
day: '01'
department:
- _id: LeSa
doi: 10.1016/j.bbabio.2016.01.012
external_id:
  isi:
  - '000377727500005'
intvolume: '      1857'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa_version: None
page: 892 - 901
publication: Biochimica et Biophysica Acta - Bioenergetics
publication_status: published
publisher: Elsevier
publist_id: '5654'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structure of bacterial respiratory complex I
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 1857
year: '2016'
...
---
_id: '1522'
abstract:
- lang: eng
  text: 'We classify smooth Brunnian (i.e., unknotted on both components) embeddings
    (S2 × S1) ⊔ S3 → ℝ6. Any Brunnian embedding (S2 × S1) ⊔ S3 → ℝ6 is isotopic to
    an explicitly constructed embedding fk,m,n for some integers k, m, n such that
    m ≡ n (mod 2). Two embeddings fk,m,n and fk′ ,m′,n′ are isotopic if and only if
    k = k′, m ≡ m′ (mod 2k) and n ≡ n′ (mod 2k). We use Haefliger’s classification
    of embeddings S3 ⊔ S3 → ℝ6 in our proof. The relation between the embeddings (S2
    × S1) ⊔ S3 → ℝ6 and S3 ⊔ S3 → ℝ6 is not trivial, however. For example, we show
    that there exist embeddings f: (S2 ×S1) ⊔ S3 → ℝ6 and g, g′ : S3 ⊔ S3 → ℝ6 such
    that the componentwise embedded connected sum f # g is isotopic to f # g′ but
    g is not isotopic to g′.'
acknowledgement: "I thank A. Skopenkov for telling me about the problem and for his
  useful remarks.  I also thank A. Sossinsky,\r\nA. Zhubr, M. Skopenkov, P. Akhmetiev,
  and an anonymous referee for their feedback.  Author was partially\r\nsupported
  by Dobrushin fellowship, 2013, and by RFBR grant 15-01-06302."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Serhii
  full_name: Avvakumov, Serhii
  id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
  last_name: Avvakumov
citation:
  ama: Avvakumov S. The classification of certain linked 3-manifolds in 6-space. <i>Moscow
    Mathematical Journal</i>. 2016;16(1):1-25. doi:<a href="https://doi.org/10.17323/1609-4514-2016-16-1-1-25">10.17323/1609-4514-2016-16-1-1-25</a>
  apa: Avvakumov, S. (2016). The classification of certain linked 3-manifolds in 6-space.
    <i>Moscow Mathematical Journal</i>. Independent University of Moscow. <a href="https://doi.org/10.17323/1609-4514-2016-16-1-1-25">https://doi.org/10.17323/1609-4514-2016-16-1-1-25</a>
  chicago: Avvakumov, Sergey. “The Classification of Certain Linked 3-Manifolds in
    6-Space.” <i>Moscow Mathematical Journal</i>. Independent University of Moscow,
    2016. <a href="https://doi.org/10.17323/1609-4514-2016-16-1-1-25">https://doi.org/10.17323/1609-4514-2016-16-1-1-25</a>.
  ieee: S. Avvakumov, “The classification of certain linked 3-manifolds in 6-space,”
    <i>Moscow Mathematical Journal</i>, vol. 16, no. 1. Independent University of
    Moscow, pp. 1–25, 2016.
  ista: Avvakumov S. 2016. The classification of certain linked 3-manifolds in 6-space.
    Moscow Mathematical Journal. 16(1), 1–25.
  mla: Avvakumov, Sergey. “The Classification of Certain Linked 3-Manifolds in 6-Space.”
    <i>Moscow Mathematical Journal</i>, vol. 16, no. 1, Independent University of
    Moscow, 2016, pp. 1–25, doi:<a href="https://doi.org/10.17323/1609-4514-2016-16-1-1-25">10.17323/1609-4514-2016-16-1-1-25</a>.
  short: S. Avvakumov, Moscow Mathematical Journal 16 (2016) 1–25.
corr_author: '1'
date_created: 2018-12-11T11:52:30Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2024-10-09T20:56:44Z
day: '01'
department:
- _id: UlWa
doi: 10.17323/1609-4514-2016-16-1-1-25
external_id:
  arxiv:
  - '1408.3918'
intvolume: '        16'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1408.3918
month: '01'
oa: 1
oa_version: Preprint
page: 1 - 25
publication: Moscow Mathematical Journal
publication_identifier:
  eissn:
  - 1609-4514
publication_status: published
publisher: Independent University of Moscow
publist_id: '5652'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The classification of certain linked 3-manifolds in 6-space
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2016'
...
---
_id: '1523'
abstract:
- lang: eng
  text: For random graphs, the containment problem considers the probability that
    a binomial random graph G(n, p) contains a given graph as a substructure. When
    asking for the graph as a topological minor, i.e., for a copy of a subdivision
    of the given graph, it is well known that the (sharp) threshold is at p = 1/n.
    We consider a natural analogue of this question for higher-dimensional random
    complexes Xk(n, p), first studied by Cohen, Costa, Farber and Kappeler for k =
    2. Improving previous results, we show that p = Θ(1/ √n) is the (coarse) threshold
    for containing a subdivision of any fixed complete 2-complex. For higher dimensions
    k &gt; 2, we get that p = O(n−1/k) is an upper bound for the threshold probability
    of containing a subdivision of a fixed k-dimensional complex.
acknowledgement: This research was supported by the Swiss National Science Foundation
  (SNF Projects 200021-125309 and 200020-138230
article_processing_charge: No
arxiv: 1
author:
- first_name: Anna
  full_name: Gundert, Anna
  last_name: Gundert
- first_name: Uli
  full_name: Wagner, Uli
  id: 36690CA2-F248-11E8-B48F-1D18A9856A87
  last_name: Wagner
  orcid: 0000-0002-1494-0568
citation:
  ama: Gundert A, Wagner U. On topological minors in random simplicial complexes.
    <i>Proceedings of the American Mathematical Society</i>. 2016;144(4):1815-1828.
    doi:<a href="https://doi.org/10.1090/proc/12824">10.1090/proc/12824</a>
  apa: Gundert, A., &#38; Wagner, U. (2016). On topological minors in random simplicial
    complexes. <i>Proceedings of the American Mathematical Society</i>. American Mathematical
    Society. <a href="https://doi.org/10.1090/proc/12824">https://doi.org/10.1090/proc/12824</a>
  chicago: Gundert, Anna, and Uli Wagner. “On Topological Minors in Random Simplicial
    Complexes.” <i>Proceedings of the American Mathematical Society</i>. American
    Mathematical Society, 2016. <a href="https://doi.org/10.1090/proc/12824">https://doi.org/10.1090/proc/12824</a>.
  ieee: A. Gundert and U. Wagner, “On topological minors in random simplicial complexes,”
    <i>Proceedings of the American Mathematical Society</i>, vol. 144, no. 4. American
    Mathematical Society, pp. 1815–1828, 2016.
  ista: Gundert A, Wagner U. 2016. On topological minors in random simplicial complexes.
    Proceedings of the American Mathematical Society. 144(4), 1815–1828.
  mla: Gundert, Anna, and Uli Wagner. “On Topological Minors in Random Simplicial
    Complexes.” <i>Proceedings of the American Mathematical Society</i>, vol. 144,
    no. 4, American Mathematical Society, 2016, pp. 1815–28, doi:<a href="https://doi.org/10.1090/proc/12824">10.1090/proc/12824</a>.
  short: A. Gundert, U. Wagner, Proceedings of the American Mathematical Society 144
    (2016) 1815–1828.
corr_author: '1'
date_created: 2018-12-11T11:52:30Z
date_published: 2016-04-01T00:00:00Z
date_updated: 2025-09-18T11:07:39Z
day: '01'
department:
- _id: UlWa
doi: 10.1090/proc/12824
external_id:
  arxiv:
  - '1404.2106'
  isi:
  - '000369298400040'
intvolume: '       144'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1404.2106
month: '04'
oa: 1
oa_version: Preprint
page: 1815 - 1828
publication: Proceedings of the American Mathematical Society
publication_status: published
publisher: American Mathematical Society
publist_id: '5650'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On topological minors in random simplicial complexes
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 144
year: '2016'
...
---
_id: '1524'
abstract:
- lang: eng
  text: "When designing genetic circuits, the typical primitives used in major existing
    modelling formalisms are gene interaction graphs, where edges between genes denote
    either an activation or inhibition relation. However, when designing experiments,
    it is important to be precise about the low-level mechanistic details as to how
    each such relation is implemented. The rule-based modelling language Kappa allows
    to unambiguously specify mechanistic details such as DNA binding sites, dimerisation
    of transcription factors, or co-operative interactions. Such a detailed description
    comes with complexity and computationally costly executions. We propose a general
    method for automatically transforming a rule-based program, by eliminating intermediate
    species and adjusting the rate constants accordingly. To the best of our knowledge,
    we show the first automated reduction of rule-based models based on equilibrium
    approximations.\r\nOur algorithm is an adaptation of an existing algorithm, which
    was designed for reducing reaction-based programs; our version of the algorithm
    scans the rule-based Kappa model in search for those interaction patterns known
    to be amenable to equilibrium approximations (e.g. Michaelis-Menten scheme). Additional
    checks are then performed in order to verify if the reduction is meaningful in
    the context of the full model. The reduced model is efficiently obtained by static
    inspection over the rule-set. The tool is tested on a detailed rule-based model
    of a λ-phage switch, which lists 92 rules and 13 agents. The reduced model has
    11 rules and 5 agents, and provides a dramatic reduction in simulation time of
    several orders of magnitude."
acknowledgement: This research was supported by the People Programme (Marie Curie
  Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under
  REA grant agreement no. 291734, and the SNSF Early Postdoc.Mobility Fellowship,
  the grant number P2EZP2_148797.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Andreea
  full_name: Beica, Andreea
  last_name: Beica
- first_name: Calin C
  full_name: Guet, Calin C
  id: 47F8433E-F248-11E8-B48F-1D18A9856A87
  last_name: Guet
  orcid: 0000-0001-6220-2052
- first_name: Tatjana
  full_name: Petrov, Tatjana
  id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
  last_name: Petrov
  orcid: 0000-0002-9041-0905
citation:
  ama: 'Beica A, Guet CC, Petrov T. Efficient reduction of kappa models by static
    inspection of the rule-set. In: Vol 9271. Springer; 2016:173-191. doi:<a href="https://doi.org/10.1007/978-3-319-26916-0_10">10.1007/978-3-319-26916-0_10</a>'
  apa: 'Beica, A., Guet, C. C., &#38; Petrov, T. (2016). Efficient reduction of kappa
    models by static inspection of the rule-set (Vol. 9271, pp. 173–191). Presented
    at the HSB: Hybrid Systems Biology, Madrid, Spain: Springer. <a href="https://doi.org/10.1007/978-3-319-26916-0_10">https://doi.org/10.1007/978-3-319-26916-0_10</a>'
  chicago: Beica, Andreea, Calin C Guet, and Tatjana Petrov. “Efficient Reduction
    of Kappa Models by Static Inspection of the Rule-Set,” 9271:173–91. Springer,
    2016. <a href="https://doi.org/10.1007/978-3-319-26916-0_10">https://doi.org/10.1007/978-3-319-26916-0_10</a>.
  ieee: 'A. Beica, C. C. Guet, and T. Petrov, “Efficient reduction of kappa models
    by static inspection of the rule-set,” presented at the HSB: Hybrid Systems Biology,
    Madrid, Spain, 2016, vol. 9271, pp. 173–191.'
  ista: 'Beica A, Guet CC, Petrov T. 2016. Efficient reduction of kappa models by
    static inspection of the rule-set. HSB: Hybrid Systems Biology, LNCS, vol. 9271,
    173–191.'
  mla: Beica, Andreea, et al. <i>Efficient Reduction of Kappa Models by Static Inspection
    of the Rule-Set</i>. Vol. 9271, Springer, 2016, pp. 173–91, doi:<a href="https://doi.org/10.1007/978-3-319-26916-0_10">10.1007/978-3-319-26916-0_10</a>.
  short: A. Beica, C.C. Guet, T. Petrov, in:, Springer, 2016, pp. 173–191.
conference:
  end_date: 2015-09-05
  location: Madrid, Spain
  name: 'HSB: Hybrid Systems Biology'
  start_date: 2015-09-04
corr_author: '1'
date_created: 2018-12-11T11:52:31Z
date_published: 2016-01-10T00:00:00Z
date_updated: 2025-06-04T12:06:27Z
day: '10'
department:
- _id: CaGu
- _id: ToHe
doi: 10.1007/978-3-319-26916-0_10
ec_funded: 1
external_id:
  arxiv:
  - '1501.00440'
intvolume: '      9271'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1501.00440
month: '01'
oa: 1
oa_version: Preprint
page: 173 - 191
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Springer
publist_id: '5649'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient reduction of kappa models by static inspection of the rule-set
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9271
year: '2016'
...
---
_id: '1526'
abstract:
- lang: eng
  text: 'We present the first study of robustness of systems that are both timed as
    well as reactive (I/O). We study the behavior of such timed I/O systems in the
    presence of uncertain inputs and formalize their robustness using the analytic
    notion of Lipschitz continuity: a timed I/O system is K-(Lipschitz) robust if
    the perturbation in its output is at most K times the perturbation in its input.
    We quantify input and output perturbation using similarity functions over timed
    words such as the timed version of the Manhattan distance and the Skorokhod distance.
    We consider two models of timed I/O systems — timed transducers and asynchronous
    sequential circuits. We show that K-robustness of timed transducers can be decided
    in polynomial space under certain conditions. For asynchronous sequential circuits,
    we reduce K-robustness w.r.t. timed Manhattan distances to K-robustness of discrete
    letter-to-letter transducers and show PSpace-completeness of the problem.'
acknowledgement: This research was supported in part by the European Research Council
  (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund (FWF) under grants
  S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and by the National Science
  Centre (NCN), Poland under grant 2014/15/D/ST6/04543.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Jan
  full_name: Otop, Jan
  id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
  last_name: Otop
- first_name: Roopsha
  full_name: Samanta, Roopsha
  id: 3D2AAC08-F248-11E8-B48F-1D18A9856A87
  last_name: Samanta
citation:
  ama: 'Henzinger TA, Otop J, Samanta R. Lipschitz robustness of timed I/O systems.
    In: Vol 9583. Springer; 2016:250-267. doi:<a href="https://doi.org/10.1007/978-3-662-49122-5_12">10.1007/978-3-662-49122-5_12</a>'
  apa: 'Henzinger, T. A., Otop, J., &#38; Samanta, R. (2016). Lipschitz robustness
    of timed I/O systems (Vol. 9583, pp. 250–267). Presented at the VMCAI: Verification,
    Model Checking and Abstract Interpretation, St. Petersburg, FL, USA: Springer.
    <a href="https://doi.org/10.1007/978-3-662-49122-5_12">https://doi.org/10.1007/978-3-662-49122-5_12</a>'
  chicago: Henzinger, Thomas A, Jan Otop, and Roopsha Samanta. “Lipschitz Robustness
    of Timed I/O Systems,” 9583:250–67. Springer, 2016. <a href="https://doi.org/10.1007/978-3-662-49122-5_12">https://doi.org/10.1007/978-3-662-49122-5_12</a>.
  ieee: 'T. A. Henzinger, J. Otop, and R. Samanta, “Lipschitz robustness of timed
    I/O systems,” presented at the VMCAI: Verification, Model Checking and Abstract
    Interpretation, St. Petersburg, FL, USA, 2016, vol. 9583, pp. 250–267.'
  ista: 'Henzinger TA, Otop J, Samanta R. 2016. Lipschitz robustness of timed I/O
    systems. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS,
    vol. 9583, 250–267.'
  mla: Henzinger, Thomas A., et al. <i>Lipschitz Robustness of Timed I/O Systems</i>.
    Vol. 9583, Springer, 2016, pp. 250–67, doi:<a href="https://doi.org/10.1007/978-3-662-49122-5_12">10.1007/978-3-662-49122-5_12</a>.
  short: T.A. Henzinger, J. Otop, R. Samanta, in:, Springer, 2016, pp. 250–267.
conference:
  end_date: 2016-01-19
  location: St. Petersburg, FL, USA
  name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
  start_date: 2016-01-17
corr_author: '1'
date_created: 2018-12-11T11:52:32Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2025-09-18T11:06:25Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-662-49122-5_12
ec_funded: 1
external_id:
  arxiv:
  - '1506.01233'
  isi:
  - '000375148800012'
intvolume: '      9583'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1506.01233
month: '01'
oa: 1
oa_version: Preprint
page: 250 - 267
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '5647'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lipschitz robustness of timed I/O systems
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9583
year: '2016'
...
---
_id: '1545'
abstract:
- lang: eng
  text: We provide general conditions for which bosonic quadratic Hamiltonians on
    Fock spaces can be diagonalized by Bogoliubov transformations. Our results cover
    the case when quantum systems have infinite degrees of freedom and the associated
    one-body kinetic and paring operators are unbounded. Our sufficient conditions
    are optimal in the sense that they become necessary when the relevant one-body
    operators commute.
acknowledgement: We thank Jan Dereziński for several inspiring discussions and useful
  remarks. We thank the referee for helpful comments. J.P.S. thanks the Erwin Schrödinger
  Institute for the hospitality during the thematic programme “Quantum many-body systems,
  random matrices, and disorder”. We gratefully acknowledge the financial supports
  by the European Union's Seventh Framework Programme under the ERC Advanced Grant
  ERC-2012-AdG 321029 (J.P.S.) and the REA grant agreement No. 291734 (P.T.N.), as
  well as the support of the National Science Center (NCN) grant No. 2012/07/N/ST1/03185
  and the Austrian Science Fund (FWF) project No. P 27533-N27 (M.N.).
article_processing_charge: No
arxiv: 1
author:
- first_name: Phan
  full_name: Nam, Phan
  id: 404092F4-F248-11E8-B48F-1D18A9856A87
  last_name: Nam
- first_name: Marcin M
  full_name: Napiórkowski, Marcin M
  id: 4197AD04-F248-11E8-B48F-1D18A9856A87
  last_name: Napiórkowski
- first_name: Jan
  full_name: Solovej, Jan
  last_name: Solovej
citation:
  ama: Nam P, Napiórkowski MM, Solovej J. Diagonalization of bosonic quadratic Hamiltonians
    by Bogoliubov transformations. <i>Journal of Functional Analysis</i>. 2016;270(11):4340-4368.
    doi:<a href="https://doi.org/10.1016/j.jfa.2015.12.007">10.1016/j.jfa.2015.12.007</a>
  apa: Nam, P., Napiórkowski, M. M., &#38; Solovej, J. (2016). Diagonalization of
    bosonic quadratic Hamiltonians by Bogoliubov transformations. <i>Journal of Functional
    Analysis</i>. Academic Press. <a href="https://doi.org/10.1016/j.jfa.2015.12.007">https://doi.org/10.1016/j.jfa.2015.12.007</a>
  chicago: Nam, Phan, Marcin M Napiórkowski, and Jan Solovej. “Diagonalization of
    Bosonic Quadratic Hamiltonians by Bogoliubov Transformations.” <i>Journal of Functional
    Analysis</i>. Academic Press, 2016. <a href="https://doi.org/10.1016/j.jfa.2015.12.007">https://doi.org/10.1016/j.jfa.2015.12.007</a>.
  ieee: P. Nam, M. M. Napiórkowski, and J. Solovej, “Diagonalization of bosonic quadratic
    Hamiltonians by Bogoliubov transformations,” <i>Journal of Functional Analysis</i>,
    vol. 270, no. 11. Academic Press, pp. 4340–4368, 2016.
  ista: Nam P, Napiórkowski MM, Solovej J. 2016. Diagonalization of bosonic quadratic
    Hamiltonians by Bogoliubov transformations. Journal of Functional Analysis. 270(11),
    4340–4368.
  mla: Nam, Phan, et al. “Diagonalization of Bosonic Quadratic Hamiltonians by Bogoliubov
    Transformations.” <i>Journal of Functional Analysis</i>, vol. 270, no. 11, Academic
    Press, 2016, pp. 4340–68, doi:<a href="https://doi.org/10.1016/j.jfa.2015.12.007">10.1016/j.jfa.2015.12.007</a>.
  short: P. Nam, M.M. Napiórkowski, J. Solovej, Journal of Functional Analysis 270
    (2016) 4340–4368.
corr_author: '1'
date_created: 2018-12-11T11:52:38Z
date_published: 2016-06-01T00:00:00Z
date_updated: 2025-09-18T11:04:09Z
day: '01'
department:
- _id: RoSe
doi: 10.1016/j.jfa.2015.12.007
ec_funded: 1
external_id:
  arxiv:
  - '1508.07321'
  isi:
  - '000375241700011'
intvolume: '       270'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1508.07321
month: '06'
oa: 1
oa_version: Submitted Version
page: 4340 - 4368
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P27533_N27
  name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication: Journal of Functional Analysis
publication_status: published
publisher: Academic Press
publist_id: '5626'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 270
year: '2016'
...
---
_id: '1592'
abstract:
- lang: eng
  text: A modular approach to constructing cryptographic protocols leads to simple
    designs but often inefficient instantiations. On the other hand, ad hoc constructions
    may yield efficient protocols at the cost of losing conceptual simplicity. We
    suggest a new design paradigm, structure-preserving cryptography, that provides
    a way to construct modular protocols with reasonable efficiency while retaining
    conceptual simplicity. A cryptographic scheme over a bilinear group is called
    structure-preserving if its public inputs and outputs consist of elements from
    the bilinear groups and their consistency can be verified by evaluating pairing-product
    equations. As structure-preserving schemes smoothly interoperate with each other,
    they are useful as building blocks in modular design of cryptographic applications.
    This paper introduces structure-preserving commitment and signature schemes over
    bilinear groups with several desirable properties. The commitment schemes include
    homomorphic, trapdoor and length-reducing commitments to group elements, and the
    structure-preserving signature schemes are the first ones that yield constant-size
    signatures on multiple group elements. A structure-preserving signature scheme
    is called automorphic if the public keys lie in the message space, which cannot
    be achieved by compressing inputs via a cryptographic hash function, as this would
    destroy the mathematical structure we are trying to preserve. Automorphic signatures
    can be used for building certification chains underlying privacy-preserving protocols.
    Among a vast number of applications of structure-preserving protocols, we present
    an efficient round-optimal blind-signature scheme and a group signature scheme
    with an efficient and concurrently secure protocol for enrolling new members.
acknowledgement: The authors would like to thank the anonymous reviewers of this paper.
  We also would like to express our appreciation to the program committee and the
  anonymous reviewers for CRYPTO 2010. The first author thanks Sherman S. M. Chow
  for his comment on group signatures in Sect. 7.1.
article_processing_charge: No
author:
- first_name: Masayuki
  full_name: Abe, Masayuki
  last_name: Abe
- first_name: Georg
  full_name: Fuchsbauer, Georg
  id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
  last_name: Fuchsbauer
- first_name: Jens
  full_name: Groth, Jens
  last_name: Groth
- first_name: Kristiyan
  full_name: Haralambiev, Kristiyan
  last_name: Haralambiev
- first_name: Miyako
  full_name: Ohkubo, Miyako
  last_name: Ohkubo
citation:
  ama: Abe M, Fuchsbauer G, Groth J, Haralambiev K, Ohkubo M. Structure preserving
    signatures and commitments to group elements. <i>Journal of Cryptology</i>. 2016;29(2):363-421.
    doi:<a href="https://doi.org/10.1007/s00145-014-9196-7">10.1007/s00145-014-9196-7</a>
  apa: Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., &#38; Ohkubo, M. (2016).
    Structure preserving signatures and commitments to group elements. <i>Journal
    of Cryptology</i>. Springer. <a href="https://doi.org/10.1007/s00145-014-9196-7">https://doi.org/10.1007/s00145-014-9196-7</a>
  chicago: Abe, Masayuki, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, and
    Miyako Ohkubo. “Structure Preserving Signatures and Commitments to Group Elements.”
    <i>Journal of Cryptology</i>. Springer, 2016. <a href="https://doi.org/10.1007/s00145-014-9196-7">https://doi.org/10.1007/s00145-014-9196-7</a>.
  ieee: M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, “Structure
    preserving signatures and commitments to group elements,” <i>Journal of Cryptology</i>,
    vol. 29, no. 2. Springer, pp. 363–421, 2016.
  ista: Abe M, Fuchsbauer G, Groth J, Haralambiev K, Ohkubo M. 2016. Structure preserving
    signatures and commitments to group elements. Journal of Cryptology. 29(2), 363–421.
  mla: Abe, Masayuki, et al. “Structure Preserving Signatures and Commitments to Group
    Elements.” <i>Journal of Cryptology</i>, vol. 29, no. 2, Springer, 2016, pp. 363–421,
    doi:<a href="https://doi.org/10.1007/s00145-014-9196-7">10.1007/s00145-014-9196-7</a>.
  short: M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, M. Ohkubo, Journal of Cryptology
    29 (2016) 363–421.
date_created: 2018-12-11T11:52:54Z
date_published: 2016-04-01T00:00:00Z
date_updated: 2025-09-18T11:02:49Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/s00145-014-9196-7
external_id:
  isi:
  - '000371077900004'
intvolume: '        29'
isi: 1
issue: '2'
language:
- iso: eng
month: '04'
oa_version: None
page: 363 - 421
publication: Journal of Cryptology
publication_status: published
publisher: Springer
publist_id: '5579'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structure preserving signatures and commitments to group elements
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 29
year: '2016'
...
---
_id: '1597'
abstract:
- lang: eng
  text: Chemokines are the main guidance cues directing leukocyte migration. Opposed
    to early assumptions, chemokines do not necessarily act as soluble cues but are
    often immobilized within tissues, e.g., dendritic cell migration toward lymphatic
    vessels is guided by a haptotactic gradient of the chemokine CCL21. Controlled
    assay systems to quantitatively study haptotaxis in vitro are still missing. In
    this chapter, we describe an in vitro haptotaxis assay optimized for the unique
    properties of dendritic cells. The chemokine CCL21 is immobilized in a bioactive
    state, using laser-assisted protein adsorption by photobleaching. The cells follow
    this immobilized CCL21 gradient in a haptotaxis chamber, which provides three
    dimensionally confined migration conditions.
acknowledged_ssus:
- _id: Bio
acknowledgement: This work was supported by the Boehringer Ingelheim Fonds, the European
  Research Council (ERC StG 281556), and a START Award of the Austrian Science Foundation
  (FWF). We thank Robert Hauschild, Anne Reversat, and Jack Merrin for valuable input
  and the Imaging Facility of IST Austria for excellent support.
article_processing_charge: No
article_type: original
author:
- first_name: Jan
  full_name: Schwarz, Jan
  id: 346C1EC6-F248-11E8-B48F-1D18A9856A87
  last_name: Schwarz
- 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: Schwarz J, Sixt MK. Quantitative analysis of dendritic cell haptotaxis. <i>Methods
    in Enzymology</i>. 2016;570:567-581. doi:<a href="https://doi.org/10.1016/bs.mie.2015.11.004">10.1016/bs.mie.2015.11.004</a>
  apa: Schwarz, J., &#38; Sixt, M. K. (2016). Quantitative analysis of dendritic cell
    haptotaxis. <i>Methods in Enzymology</i>. Elsevier. <a href="https://doi.org/10.1016/bs.mie.2015.11.004">https://doi.org/10.1016/bs.mie.2015.11.004</a>
  chicago: Schwarz, Jan, and Michael K Sixt. “Quantitative Analysis of Dendritic Cell
    Haptotaxis.” <i>Methods in Enzymology</i>. Elsevier, 2016. <a href="https://doi.org/10.1016/bs.mie.2015.11.004">https://doi.org/10.1016/bs.mie.2015.11.004</a>.
  ieee: J. Schwarz and M. K. Sixt, “Quantitative analysis of dendritic cell haptotaxis,”
    <i>Methods in Enzymology</i>, vol. 570. Elsevier, pp. 567–581, 2016.
  ista: Schwarz J, Sixt MK. 2016. Quantitative analysis of dendritic cell haptotaxis.
    Methods in Enzymology. 570, 567–581.
  mla: Schwarz, Jan, and Michael K. Sixt. “Quantitative Analysis of Dendritic Cell
    Haptotaxis.” <i>Methods in Enzymology</i>, vol. 570, Elsevier, 2016, pp. 567–81,
    doi:<a href="https://doi.org/10.1016/bs.mie.2015.11.004">10.1016/bs.mie.2015.11.004</a>.
  short: J. Schwarz, M.K. Sixt, Methods in Enzymology 570 (2016) 567–581.
corr_author: '1'
date_created: 2018-12-11T11:52:56Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2025-09-18T11:02:13Z
day: '01'
department:
- _id: MiSi
doi: 10.1016/bs.mie.2015.11.004
ec_funded: 1
external_id:
  isi:
  - '000375648700025'
  pmid:
  - '26921962'
intvolume: '       570'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 567 - 581
pmid: 1
project:
- _id: 25A603A2-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '281556'
  name: Cytoskeletal force generation and force transduction of migrating leukocytes
- _id: 25A8E5EA-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Y 564-B12
  name: Cytoskeletal force generation and force transduction of migrating leukocytes
publication: Methods in Enzymology
publication_status: published
publisher: Elsevier
publist_id: '5573'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative analysis of dendritic cell haptotaxis
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 570
year: '2016'
...
---
_id: '1599'
abstract:
- lang: eng
  text: "The addition of polysialic acid to N- and/or O-linked glycans, referred to
    as polysialylation, is a rare posttranslational modification that is mainly known
    to control the developmental plasticity of the nervous system. Here we show that
    CCR7, the central chemokine receptor controlling immune cell trafficking to secondary
    lymphatic organs, carries polysialic acid. This modification is essential for
    the recognition of the CCR7 ligand CCL21. As a consequence, dendritic cell trafficking
    is abrogated in polysialyltransferase-deficient mice, manifesting as disturbed
    lymph node homeostasis and unresponsiveness to inflammatory stimuli. Structure-function
    analysis of chemokine-receptor interactions reveals that CCL21 adopts an autoinhibited
    conformation, which is released upon interaction with polysialic acid. Thus, we
    describe a glycosylation-mediated immune cell trafficking disorder and its mechanistic
    basis.\r\n"
acknowledged_ssus:
- _id: SSU
acknowledgement: 'We thank S. Schüchner and E. Ogris for kindly providing the antibody
  to GFP, M. Helmbrecht and A. Huber for providing Nrp2−/− mice, the IST Scientific
  Support Facilities for excellent services, and J. Renkawitz and K. Vaahtomeri for
  critically reading the manuscript. '
article_processing_charge: No
article_type: original
author:
- first_name: Eva
  full_name: Kiermaier, Eva
  id: 3EB04B78-F248-11E8-B48F-1D18A9856A87
  last_name: Kiermaier
  orcid: 0000-0001-6165-5738
- first_name: Christine
  full_name: Moussion, Christine
  id: 3356F664-F248-11E8-B48F-1D18A9856A87
  last_name: Moussion
- first_name: Christopher
  full_name: Veldkamp, Christopher
  last_name: Veldkamp
- first_name: Rita
  full_name: Gerardy  Schahn, Rita
  last_name: Gerardy  Schahn
- first_name: Ingrid
  full_name: De Vries, Ingrid
  id: 4C7D837E-F248-11E8-B48F-1D18A9856A87
  last_name: De Vries
- first_name: Larry
  full_name: Williams, Larry
  last_name: Williams
- first_name: Gary
  full_name: Chaffee, Gary
  last_name: Chaffee
- first_name: Andrew
  full_name: Phillips, Andrew
  last_name: Phillips
- first_name: Friedrich
  full_name: Freiberger, Friedrich
  last_name: Freiberger
- first_name: Richard
  full_name: Imre, Richard
  last_name: Imre
- first_name: Deni
  full_name: Taleski, Deni
  last_name: Taleski
- first_name: Richard
  full_name: Payne, Richard
  last_name: Payne
- first_name: Asolina
  full_name: Braun, Asolina
  last_name: Braun
- first_name: Reinhold
  full_name: Förster, Reinhold
  last_name: Förster
- first_name: Karl
  full_name: Mechtler, Karl
  last_name: Mechtler
- first_name: Martina
  full_name: Mühlenhoff, Martina
  last_name: Mühlenhoff
- first_name: Brian
  full_name: Volkman, Brian
  last_name: Volkman
- 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: Kiermaier E, Moussion C, Veldkamp C, et al. Polysialylation controls dendritic
    cell trafficking by regulating chemokine recognition. <i>Science</i>. 2016;351(6269):186-190.
    doi:<a href="https://doi.org/10.1126/science.aad0512">10.1126/science.aad0512</a>
  apa: Kiermaier, E., Moussion, C., Veldkamp, C., Gerardy  Schahn, R., de Vries, I.,
    Williams, L., … Sixt, M. K. (2016). Polysialylation controls dendritic cell trafficking
    by regulating chemokine recognition. <i>Science</i>. American Association for
    the Advancement of Science. <a href="https://doi.org/10.1126/science.aad0512">https://doi.org/10.1126/science.aad0512</a>
  chicago: Kiermaier, Eva, Christine Moussion, Christopher Veldkamp, Rita Gerardy 
    Schahn, Ingrid de Vries, Larry Williams, Gary Chaffee, et al. “Polysialylation
    Controls Dendritic Cell Trafficking by Regulating Chemokine Recognition.” <i>Science</i>.
    American Association for the Advancement of Science, 2016. <a href="https://doi.org/10.1126/science.aad0512">https://doi.org/10.1126/science.aad0512</a>.
  ieee: E. Kiermaier <i>et al.</i>, “Polysialylation controls dendritic cell trafficking
    by regulating chemokine recognition,” <i>Science</i>, vol. 351, no. 6269. American
    Association for the Advancement of Science, pp. 186–190, 2016.
  ista: Kiermaier E, Moussion C, Veldkamp C, Gerardy  Schahn R, de Vries I, Williams
    L, Chaffee G, Phillips A, Freiberger F, Imre R, Taleski D, Payne R, Braun A, Förster
    R, Mechtler K, Mühlenhoff M, Volkman B, Sixt MK. 2016. Polysialylation controls
    dendritic cell trafficking by regulating chemokine recognition. Science. 351(6269),
    186–190.
  mla: Kiermaier, Eva, et al. “Polysialylation Controls Dendritic Cell Trafficking
    by Regulating Chemokine Recognition.” <i>Science</i>, vol. 351, no. 6269, American
    Association for the Advancement of Science, 2016, pp. 186–90, doi:<a href="https://doi.org/10.1126/science.aad0512">10.1126/science.aad0512</a>.
  short: E. Kiermaier, C. Moussion, C. Veldkamp, R. Gerardy  Schahn, I. de Vries,
    L. Williams, G. Chaffee, A. Phillips, F. Freiberger, R. Imre, D. Taleski, R. Payne,
    A. Braun, R. Förster, K. Mechtler, M. Mühlenhoff, B. Volkman, M.K. Sixt, Science
    351 (2016) 186–190.
corr_author: '1'
date_created: 2018-12-11T11:52:57Z
date_published: 2016-01-08T00:00:00Z
date_updated: 2025-09-18T11:01:30Z
day: '08'
department:
- _id: MiSi
doi: 10.1126/science.aad0512
ec_funded: 1
external_id:
  isi:
  - '000367806500045'
  pmid:
  - '26657283'
intvolume: '       351'
isi: 1
issue: '6269'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5583642/
month: '01'
oa: 1
oa_version: Submitted Version
page: 186 - 190
pmid: 1
project:
- _id: 25A603A2-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '281556'
  name: Cytoskeletal force generation and force transduction of migrating leukocytes
- _id: 25A76F58-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '289720'
  name: Stromal Cell-immune Cell Interactions in Health and Disease
- _id: 25A8E5EA-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Y 564-B12
  name: Cytoskeletal force generation and force transduction of migrating leukocytes
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '5570'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Polysialylation controls dendritic cell trafficking by regulating chemokine
  recognition
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 351
year: '2016'
...
---
_id: '1608'
abstract:
- lang: eng
  text: 'We show that the Anderson model has a transition from localization to delocalization
    at exactly 2 dimensional growth rate on antitrees with normalized edge weights
    which are certain discrete graphs. The kinetic part has a one-dimensional structure
    allowing a description through transfer matrices which involve some Schur complement.
    For such operators we introduce the notion of having one propagating channel and
    extend theorems from the theory of one-dimensional Jacobi operators that relate
    the behavior of transfer matrices with the spectrum. These theorems are then applied
    to the considered model. In essence, in a certain energy region the kinetic part
    averages the random potentials along shells and the transfer matrices behave similar
    as for a one-dimensional operator with random potential of decaying variance.
    At d dimensional growth for d&gt;2 this effective decay is strong enough to obtain
    absolutely continuous spectrum, whereas for some uniform d dimensional growth
    with d&lt;2 one has pure point spectrum in this energy region. At exactly uniform
    2 dimensional growth also some singular continuous spectrum appears, at least
    at small disorder. As a corollary we also obtain a change from singular spectrum
    (d≤2) to absolutely continuous spectrum (d≥3) for random operators of the type
    rΔdr+λ on ℤd, where r is an orthogonal radial projection, Δd the discrete
    adjacency operator (Laplacian) on ℤd and λ a random potential. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Christian
  full_name: Sadel, Christian
  id: 4760E9F8-F248-11E8-B48F-1D18A9856A87
  last_name: Sadel
  orcid: 0000-0001-8255-3968
citation:
  ama: Sadel C. Anderson transition at 2 dimensional growth rate on antitrees and
    spectral theory for operators with one propagating channel. <i>Annales Henri Poincare</i>.
    2016;17(7):1631-1675. doi:<a href="https://doi.org/10.1007/s00023-015-0456-3">10.1007/s00023-015-0456-3</a>
  apa: Sadel, C. (2016). Anderson transition at 2 dimensional growth rate on antitrees
    and spectral theory for operators with one propagating channel. <i>Annales Henri
    Poincare</i>. Birkhäuser. <a href="https://doi.org/10.1007/s00023-015-0456-3">https://doi.org/10.1007/s00023-015-0456-3</a>
  chicago: Sadel, Christian. “Anderson Transition at 2 Dimensional Growth Rate on
    Antitrees and Spectral Theory for Operators with One Propagating Channel.” <i>Annales
    Henri Poincare</i>. Birkhäuser, 2016. <a href="https://doi.org/10.1007/s00023-015-0456-3">https://doi.org/10.1007/s00023-015-0456-3</a>.
  ieee: C. Sadel, “Anderson transition at 2 dimensional growth rate on antitrees and
    spectral theory for operators with one propagating channel,” <i>Annales Henri
    Poincare</i>, vol. 17, no. 7. Birkhäuser, pp. 1631–1675, 2016.
  ista: Sadel C. 2016. Anderson transition at 2 dimensional growth rate on antitrees
    and spectral theory for operators with one propagating channel. Annales Henri
    Poincare. 17(7), 1631–1675.
  mla: Sadel, Christian. “Anderson Transition at 2 Dimensional Growth Rate on Antitrees
    and Spectral Theory for Operators with One Propagating Channel.” <i>Annales Henri
    Poincare</i>, vol. 17, no. 7, Birkhäuser, 2016, pp. 1631–75, doi:<a href="https://doi.org/10.1007/s00023-015-0456-3">10.1007/s00023-015-0456-3</a>.
  short: C. Sadel, Annales Henri Poincare 17 (2016) 1631–1675.
corr_author: '1'
date_created: 2018-12-11T11:53:00Z
date_published: 2016-07-01T00:00:00Z
date_updated: 2025-09-18T11:00:43Z
day: '01'
department:
- _id: LaEr
doi: 10.1007/s00023-015-0456-3
ec_funded: 1
external_id:
  arxiv:
  - '1501.04287'
  isi:
  - '000377994000003'
intvolume: '        17'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1501.04287
month: '07'
oa: 1
oa_version: Preprint
page: 1631 - 1675
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Annales Henri Poincare
publication_status: published
publisher: Birkhäuser
publist_id: '5558'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anderson transition at 2 dimensional growth rate on antitrees and spectral
  theory for operators with one propagating channel
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 17
year: '2016'
...
---
_id: '1612'
abstract:
- lang: eng
  text: We prove that whenever A is a 3-conservative relational structure with only
    binary and unary relations,then the algebra of polymorphisms of A either has no
    Taylor operation (i.e.,CSP(A)is NP-complete),or it generates an SD(∧) variety
    (i.e.,CSP(A)has bounded width).
article_processing_charge: No
arxiv: 1
author:
- first_name: Alexandr
  full_name: Kazda, Alexandr
  id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87
  last_name: Kazda
citation:
  ama: Kazda A. CSP for binary conservative relational structures. <i>Algebra Universalis</i>.
    2016;75(1):75-84. doi:<a href="https://doi.org/10.1007/s00012-015-0358-8">10.1007/s00012-015-0358-8</a>
  apa: Kazda, A. (2016). CSP for binary conservative relational structures. <i>Algebra
    Universalis</i>. Springer. <a href="https://doi.org/10.1007/s00012-015-0358-8">https://doi.org/10.1007/s00012-015-0358-8</a>
  chicago: Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” <i>Algebra
    Universalis</i>. Springer, 2016. <a href="https://doi.org/10.1007/s00012-015-0358-8">https://doi.org/10.1007/s00012-015-0358-8</a>.
  ieee: A. Kazda, “CSP for binary conservative relational structures,” <i>Algebra
    Universalis</i>, vol. 75, no. 1. Springer, pp. 75–84, 2016.
  ista: Kazda A. 2016. CSP for binary conservative relational structures. Algebra
    Universalis. 75(1), 75–84.
  mla: Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” <i>Algebra
    Universalis</i>, vol. 75, no. 1, Springer, 2016, pp. 75–84, doi:<a href="https://doi.org/10.1007/s00012-015-0358-8">10.1007/s00012-015-0358-8</a>.
  short: A. Kazda, Algebra Universalis 75 (2016) 75–84.
corr_author: '1'
date_created: 2018-12-11T11:53:01Z
date_published: 2016-02-01T00:00:00Z
date_updated: 2025-09-18T11:00:04Z
day: '01'
department:
- _id: VlKo
doi: 10.1007/s00012-015-0358-8
external_id:
  arxiv:
  - '1112.1099'
  isi:
  - '000375422500006'
intvolume: '        75'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1112.1099
month: '02'
oa: 1
oa_version: Preprint
page: 75 - 84
publication: Algebra Universalis
publication_status: published
publisher: Springer
publist_id: '5554'
quality_controlled: '1'
scopus_import: '1'
status: public
title: CSP for binary conservative relational structures
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 75
year: '2016'
...
---
_id: '1616'
abstract:
- lang: eng
  text: The hippocampus plays a key role in learning and memory. Previous studies
    suggested that the main types of principal neurons, dentate gyrus granule cells
    (GCs), CA3 pyramidal neurons, and CA1 pyramidal neurons, differ in their activity
    pattern, with sparse firing in GCs and more frequent firing in CA3 and CA1 pyramidal
    neurons. It has been assumed but never shown that such different activity may
    be caused by differential synaptic excitation. To test this hypothesis, we performed
    high-resolution whole-cell patch-clamp recordings in anesthetized rats in vivo.
    In contrast to previous in vitro data, both CA3 and CA1 pyramidal neurons fired
    action potentials spontaneously, with a frequency of ∼3–6 Hz, whereas GCs were
    silent. Furthermore, both CA3 and CA1 cells primarily fired in bursts. To determine
    the underlying mechanisms, we quantitatively assessed the frequency of spontaneous
    excitatory synaptic input, the passive membrane properties, and the active membrane
    characteristics. Surprisingly, GCs showed comparable synaptic excitation to CA3
    and CA1 cells and the highest ratio of excitation versus hyperpolarizing inhibition.
    Thus, differential synaptic excitation is not responsible for differences in firing.
    Moreover, the three types of hippocampal neurons markedly differed in their passive
    properties. While GCs showed the most negative membrane potential, CA3 pyramidal
    neurons had the highest input resistance and the slowest membrane time constant.
    The three types of neurons also differed in the active membrane characteristics.
    GCs showed the highest action potential threshold, but displayed the largest gain
    of the input-output curves. In conclusion, our results reveal that differential
    firing of the three main types of hippocampal principal neurons in vivo is not
    primarily caused by differences in the characteristics of the synaptic input,
    but by the distinct properties of synaptic integration and input-output transformation.
acknowledgement: "The authors thank Jose Guzman for critically reading prior versions
  of the manuscript. They also thank T. Asenov for\r\nengineering mechanical devices,
  A. Schlögl for efﬁcient pro-gramming, F. Marr for technical assistance, and E. Kramberger
  for manuscript editing."
article_processing_charge: No
author:
- first_name: Janina
  full_name: Kowalski, Janina
  id: 3F3CA136-F248-11E8-B48F-1D18A9856A87
  last_name: Kowalski
- first_name: Jian
  full_name: Gan, Jian
  id: 3614E438-F248-11E8-B48F-1D18A9856A87
  last_name: Gan
- first_name: Peter M
  full_name: Jonas, Peter M
  id: 353C1B58-F248-11E8-B48F-1D18A9856A87
  last_name: Jonas
  orcid: 0000-0001-5001-4804
- first_name: Alejandro
  full_name: Pernia-Andrade, Alejandro
  id: 36963E98-F248-11E8-B48F-1D18A9856A87
  last_name: Pernia-Andrade
citation:
  ama: Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. Intrinsic membrane properties
    determine hippocampal differential firing pattern in vivo in anesthetized rats.
    <i>Hippocampus</i>. 2016;26(5):668-682. doi:<a href="https://doi.org/10.1002/hipo.22550">10.1002/hipo.22550</a>
  apa: Kowalski, J., Gan, J., Jonas, P. M., &#38; Pernia-Andrade, A. (2016). Intrinsic
    membrane properties determine hippocampal differential firing pattern in vivo
    in anesthetized rats. <i>Hippocampus</i>. Wiley. <a href="https://doi.org/10.1002/hipo.22550">https://doi.org/10.1002/hipo.22550</a>
  chicago: Kowalski, Janina, Jian Gan, Peter M Jonas, and Alejandro Pernia-Andrade.
    “Intrinsic Membrane Properties Determine Hippocampal Differential Firing Pattern
    in Vivo in Anesthetized Rats.” <i>Hippocampus</i>. Wiley, 2016. <a href="https://doi.org/10.1002/hipo.22550">https://doi.org/10.1002/hipo.22550</a>.
  ieee: J. Kowalski, J. Gan, P. M. Jonas, and A. Pernia-Andrade, “Intrinsic membrane
    properties determine hippocampal differential firing pattern in vivo in anesthetized
    rats,” <i>Hippocampus</i>, vol. 26, no. 5. Wiley, pp. 668–682, 2016.
  ista: Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. 2016. Intrinsic membrane properties
    determine hippocampal differential firing pattern in vivo in anesthetized rats.
    Hippocampus. 26(5), 668–682.
  mla: Kowalski, Janina, et al. “Intrinsic Membrane Properties Determine Hippocampal
    Differential Firing Pattern in Vivo in Anesthetized Rats.” <i>Hippocampus</i>,
    vol. 26, no. 5, Wiley, 2016, pp. 668–82, doi:<a href="https://doi.org/10.1002/hipo.22550">10.1002/hipo.22550</a>.
  short: J. Kowalski, J. Gan, P.M. Jonas, A. Pernia-Andrade, Hippocampus 26 (2016)
    668–682.
corr_author: '1'
date_created: 2018-12-11T11:53:03Z
date_published: 2016-05-01T00:00:00Z
date_updated: 2025-09-18T10:58:31Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1002/hipo.22550
external_id:
  isi:
  - '000374666700011'
file:
- access_level: open_access
  checksum: 284b72b12fbe15474833ed3d4549f86b
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:13:47Z
  date_updated: 2020-07-14T12:45:07Z
  file_id: '5033'
  file_name: IST-2016-469-v1+1_Kowalski_et_al-Hippocampus.pdf
  file_size: 905348
  relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: '        26'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 668 - 682
publication: Hippocampus
publication_identifier:
  eissn:
  - 1098-1063
  issn:
  - 1050-9631
publication_status: published
publisher: Wiley
publist_id: '5550'
pubrep_id: '469'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Intrinsic membrane properties determine hippocampal differential firing pattern
  in vivo in anesthetized rats
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: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 26
year: '2016'
...
---
_id: '1617'
abstract:
- lang: eng
  text: 'We study the discrepancy of jittered sampling sets: such a set P⊂ [0,1]d
    is generated for fixed m∈ℕ by partitioning [0,1]d into md axis aligned cubes of
    equal measure and placing a random point inside each of the N=md cubes. We prove
    that, for N sufficiently large, 1/10 d/N1/2+1/2d ≤EDN∗(P)≤ √d(log N) 1/2/N1/2+1/2d,
    where the upper bound with an unspecified constant Cd was proven earlier by Beck.
    Our proof makes crucial use of the sharp Dvoretzky-Kiefer-Wolfowitz inequality
    and a suitably taylored Bernstein inequality; we have reasons to believe that
    the upper bound has the sharp scaling in N. Additional heuristics suggest that
    jittered sampling should be able to improve known bounds on the inverse of the
    star-discrepancy in the regime N≳dd. We also prove a partition principle showing
    that every partition of [0,1]d combined with a jittered sampling construction
    gives rise to a set whose expected squared L2-discrepancy is smaller than that
    of purely random points.'
acknowledgement: We are grateful to the referee whose suggestions greatly improved
  the quality and clarity of the exposition.
article_processing_charge: No
arxiv: 1
author:
- first_name: Florian
  full_name: Pausinger, Florian
  id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87
  last_name: Pausinger
  orcid: 0000-0002-8379-3768
- first_name: Stefan
  full_name: Steinerberger, Stefan
  last_name: Steinerberger
citation:
  ama: Pausinger F, Steinerberger S. On the discrepancy of jittered sampling. <i>Journal
    of Complexity</i>. 2016;33:199-216. doi:<a href="https://doi.org/10.1016/j.jco.2015.11.003">10.1016/j.jco.2015.11.003</a>
  apa: Pausinger, F., &#38; Steinerberger, S. (2016). On the discrepancy of jittered
    sampling. <i>Journal of Complexity</i>. Academic Press. <a href="https://doi.org/10.1016/j.jco.2015.11.003">https://doi.org/10.1016/j.jco.2015.11.003</a>
  chicago: Pausinger, Florian, and Stefan Steinerberger. “On the Discrepancy of Jittered
    Sampling.” <i>Journal of Complexity</i>. Academic Press, 2016. <a href="https://doi.org/10.1016/j.jco.2015.11.003">https://doi.org/10.1016/j.jco.2015.11.003</a>.
  ieee: F. Pausinger and S. Steinerberger, “On the discrepancy of jittered sampling,”
    <i>Journal of Complexity</i>, vol. 33. Academic Press, pp. 199–216, 2016.
  ista: Pausinger F, Steinerberger S. 2016. On the discrepancy of jittered sampling.
    Journal of Complexity. 33, 199–216.
  mla: Pausinger, Florian, and Stefan Steinerberger. “On the Discrepancy of Jittered
    Sampling.” <i>Journal of Complexity</i>, vol. 33, Academic Press, 2016, pp. 199–216,
    doi:<a href="https://doi.org/10.1016/j.jco.2015.11.003">10.1016/j.jco.2015.11.003</a>.
  short: F. Pausinger, S. Steinerberger, Journal of Complexity 33 (2016) 199–216.
date_created: 2018-12-11T11:53:03Z
date_published: 2016-04-01T00:00:00Z
date_updated: 2025-09-18T10:57:52Z
day: '01'
department:
- _id: HeEd
doi: 10.1016/j.jco.2015.11.003
external_id:
  arxiv:
  - '1510.00251'
  isi:
  - '000370090400011'
intvolume: '        33'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1510.00251
month: '04'
oa: 1
oa_version: Submitted Version
page: 199 - 216
publication: Journal of Complexity
publication_status: published
publisher: Academic Press
publist_id: '5549'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the discrepancy of jittered sampling
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 33
year: '2016'
...
---
_id: '1620'
abstract:
- lang: eng
  text: We consider the Bardeen–Cooper–Schrieffer free energy functional for particles
    interacting via a two-body potential on a microscopic scale and in the presence
    of weak external fields varying on a macroscopic scale. We study the influence
    of the external fields on the critical temperature. We show that in the limit
    where the ratio between the microscopic and macroscopic scale tends to zero, the
    next to leading order of the critical temperature is determined by the lowest
    eigenvalue of the linearization of the Ginzburg–Landau equation.
acknowledgement: The authors are grateful to I. M. Sigal for useful discussions. Financial
  support from the US National Science Foundation through Grants PHY-1347399 and DMS-1363432
  (R.L.F.), from the Danish council for independent research and from ERC Advanced
  Grant 321029 (J.P.S.) is acknowledged.
article_processing_charge: No
arxiv: 1
author:
- first_name: Rupert
  full_name: Frank, Rupert
  last_name: Frank
- first_name: Christian
  full_name: Hainzl, Christian
  last_name: Hainzl
- first_name: Robert
  full_name: Seiringer, Robert
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
- first_name: Jan
  full_name: Solovej, Jan
  last_name: Solovej
citation:
  ama: Frank R, Hainzl C, Seiringer R, Solovej J. The external field dependence of
    the BCS critical temperature. <i>Communications in Mathematical Physics</i>. 2016;342(1):189-216.
    doi:<a href="https://doi.org/10.1007/s00220-015-2526-2">10.1007/s00220-015-2526-2</a>
  apa: Frank, R., Hainzl, C., Seiringer, R., &#38; Solovej, J. (2016). The external
    field dependence of the BCS critical temperature. <i>Communications in Mathematical
    Physics</i>. Springer. <a href="https://doi.org/10.1007/s00220-015-2526-2">https://doi.org/10.1007/s00220-015-2526-2</a>
  chicago: Frank, Rupert, Christian Hainzl, Robert Seiringer, and Jan Solovej. “The
    External Field Dependence of the BCS Critical Temperature.” <i>Communications
    in Mathematical Physics</i>. Springer, 2016. <a href="https://doi.org/10.1007/s00220-015-2526-2">https://doi.org/10.1007/s00220-015-2526-2</a>.
  ieee: R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “The external field dependence
    of the BCS critical temperature,” <i>Communications in Mathematical Physics</i>,
    vol. 342, no. 1. Springer, pp. 189–216, 2016.
  ista: Frank R, Hainzl C, Seiringer R, Solovej J. 2016. The external field dependence
    of the BCS critical temperature. Communications in Mathematical Physics. 342(1),
    189–216.
  mla: Frank, Rupert, et al. “The External Field Dependence of the BCS Critical Temperature.”
    <i>Communications in Mathematical Physics</i>, vol. 342, no. 1, Springer, 2016,
    pp. 189–216, doi:<a href="https://doi.org/10.1007/s00220-015-2526-2">10.1007/s00220-015-2526-2</a>.
  short: R. Frank, C. Hainzl, R. Seiringer, J. Solovej, Communications in Mathematical
    Physics 342 (2016) 189–216.
date_created: 2018-12-11T11:53:04Z
date_published: 2016-02-01T00:00:00Z
date_updated: 2025-09-18T10:57:14Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s00220-015-2526-2
external_id:
  arxiv:
  - '1410.2352'
  isi:
  - '000369965600006'
intvolume: '       342'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1410.2352
month: '02'
oa: 1
oa_version: Submitted Version
page: 189 - 216
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '5546'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The external field dependence of the BCS critical temperature
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 342
year: '2016'
...
---
_id: '1622'
abstract:
- lang: eng
  text: We prove analogues of the Lieb–Thirring and Hardy–Lieb–Thirring inequalities
    for many-body quantum systems with fractional kinetic operators and homogeneous
    interaction potentials, where no anti-symmetry on the wave functions is assumed.
    These many-body inequalities imply interesting one-body interpolation inequalities,
    and we show that the corresponding one- and many-body inequalities are actually
    equivalent in certain cases.
acknowledgement: "We thank Jan  Philip  Solovej, Robert Seiringer and Vladimir Maz’ya
  for helpful discussions, as well as Rupert Frank\r\nand the anonymous referee for
  useful comments. Part of this work has been carried out during a visit at the Institut
  Mittag-Leffler (Stockholm). D.L. acknowledges financial support by the grant KAW
  2010.0063 from the Knut and Alice Wallenberg Foundation and the Swedish Research
  Council grant no. 2013-4734. P.T.N. is supported by the People Programme (Marie
  Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013)
  under REA grant agreement no. 291734. F.P. acknowledges support from the ERC project
  no. 321029 “The\r\nmathematics of the structure of matter”."
article_processing_charge: No
arxiv: 1
author:
- first_name: Douglas
  full_name: Lundholm, Douglas
  last_name: Lundholm
- first_name: Phan
  full_name: Nam, Phan
  id: 404092F4-F248-11E8-B48F-1D18A9856A87
  last_name: Nam
- first_name: Fabian
  full_name: Portmann, Fabian
  last_name: Portmann
citation:
  ama: Lundholm D, Nam P, Portmann F. Fractional Hardy–Lieb–Thirring and related Inequalities
    for interacting systems. <i>Archive for Rational Mechanics and Analysis</i>. 2016;219(3):1343-1382.
    doi:<a href="https://doi.org/10.1007/s00205-015-0923-5">10.1007/s00205-015-0923-5</a>
  apa: Lundholm, D., Nam, P., &#38; Portmann, F. (2016). Fractional Hardy–Lieb–Thirring
    and related Inequalities for interacting systems. <i>Archive for Rational Mechanics
    and Analysis</i>. Springer. <a href="https://doi.org/10.1007/s00205-015-0923-5">https://doi.org/10.1007/s00205-015-0923-5</a>
  chicago: Lundholm, Douglas, Phan Nam, and Fabian Portmann. “Fractional Hardy–Lieb–Thirring
    and Related Inequalities for Interacting Systems.” <i>Archive for Rational Mechanics
    and Analysis</i>. Springer, 2016. <a href="https://doi.org/10.1007/s00205-015-0923-5">https://doi.org/10.1007/s00205-015-0923-5</a>.
  ieee: D. Lundholm, P. Nam, and F. Portmann, “Fractional Hardy–Lieb–Thirring and
    related Inequalities for interacting systems,” <i>Archive for Rational Mechanics
    and Analysis</i>, vol. 219, no. 3. Springer, pp. 1343–1382, 2016.
  ista: Lundholm D, Nam P, Portmann F. 2016. Fractional Hardy–Lieb–Thirring and related
    Inequalities for interacting systems. Archive for Rational Mechanics and Analysis.
    219(3), 1343–1382.
  mla: Lundholm, Douglas, et al. “Fractional Hardy–Lieb–Thirring and Related Inequalities
    for Interacting Systems.” <i>Archive for Rational Mechanics and Analysis</i>,
    vol. 219, no. 3, Springer, 2016, pp. 1343–82, doi:<a href="https://doi.org/10.1007/s00205-015-0923-5">10.1007/s00205-015-0923-5</a>.
  short: D. Lundholm, P. Nam, F. Portmann, Archive for Rational Mechanics and Analysis
    219 (2016) 1343–1382.
corr_author: '1'
date_created: 2018-12-11T11:53:05Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2025-09-18T10:52:35Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s00205-015-0923-5
ec_funded: 1
external_id:
  arxiv:
  - '1501.04570'
  isi:
  - '000368535400010'
intvolume: '       219'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1501.04570
month: '03'
oa: 1
oa_version: Submitted Version
page: 1343 - 1382
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Archive for Rational Mechanics and Analysis
publication_status: published
publisher: Springer
publist_id: '5542'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 219
year: '2016'
...
---
_id: '1631'
abstract:
- lang: eng
  text: 'Ancestral processes are fundamental to modern population genetics and spatial
    structure has been the subject of intense interest for many years. Despite this
    interest, almost nothing is known about the distribution of the locations of pedigree
    or genetic ancestors. Using both spatially continuous and stepping-stone models,
    we show that the distribution of pedigree ancestors approaches a travelling wave,
    for which we develop two alternative approximations. The speed and width of the
    wave are sensitive to the local details of the model. After a short time, genetic
    ancestors spread far more slowly than pedigree ancestors, ultimately diffusing
    out with radius ## rather than spreading at constant speed. In contrast to the
    wave of pedigree ancestors, the spread of genetic ancestry is insensitive to the
    local details of the models.'
article_processing_charge: No
author:
- first_name: Jerome
  full_name: Kelleher, Jerome
  last_name: Kelleher
- first_name: Alison
  full_name: Etheridge, Alison
  last_name: Etheridge
- first_name: Amandine
  full_name: Véber, Amandine
  last_name: Véber
- first_name: Nicholas H
  full_name: Barton, Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
citation:
  ama: Kelleher J, Etheridge A, Véber A, Barton NH. Spread of pedigree versus genetic
    ancestry in spatially distributed populations. <i>Theoretical Population Biology</i>.
    2016;108:1-12. doi:<a href="https://doi.org/10.1016/j.tpb.2015.10.008">10.1016/j.tpb.2015.10.008</a>
  apa: Kelleher, J., Etheridge, A., Véber, A., &#38; Barton, N. H. (2016). Spread
    of pedigree versus genetic ancestry in spatially distributed populations. <i>Theoretical
    Population Biology</i>. Academic Press. <a href="https://doi.org/10.1016/j.tpb.2015.10.008">https://doi.org/10.1016/j.tpb.2015.10.008</a>
  chicago: Kelleher, Jerome, Alison Etheridge, Amandine Véber, and Nicholas H Barton.
    “Spread of Pedigree versus Genetic Ancestry in Spatially Distributed Populations.”
    <i>Theoretical Population Biology</i>. Academic Press, 2016. <a href="https://doi.org/10.1016/j.tpb.2015.10.008">https://doi.org/10.1016/j.tpb.2015.10.008</a>.
  ieee: J. Kelleher, A. Etheridge, A. Véber, and N. H. Barton, “Spread of pedigree
    versus genetic ancestry in spatially distributed populations,” <i>Theoretical
    Population Biology</i>, vol. 108. Academic Press, pp. 1–12, 2016.
  ista: Kelleher J, Etheridge A, Véber A, Barton NH. 2016. Spread of pedigree versus
    genetic ancestry in spatially distributed populations. Theoretical Population
    Biology. 108, 1–12.
  mla: Kelleher, Jerome, et al. “Spread of Pedigree versus Genetic Ancestry in Spatially
    Distributed Populations.” <i>Theoretical Population Biology</i>, vol. 108, Academic
    Press, 2016, pp. 1–12, doi:<a href="https://doi.org/10.1016/j.tpb.2015.10.008">10.1016/j.tpb.2015.10.008</a>.
  short: J. Kelleher, A. Etheridge, A. Véber, N.H. Barton, Theoretical Population
    Biology 108 (2016) 1–12.
corr_author: '1'
date_created: 2018-12-11T11:53:08Z
date_published: 2016-04-01T00:00:00Z
date_updated: 2025-09-18T10:51:58Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1016/j.tpb.2015.10.008
ec_funded: 1
external_id:
  isi:
  - '000372560000001'
file:
- access_level: open_access
  checksum: 6a65ba187994d4ad86c1c509e0ff482a
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:11:12Z
  date_updated: 2020-07-14T12:45:07Z
  file_id: '4865'
  file_name: IST-2016-465-v1+1_1-s2.0-S0040580915001094-main.pdf
  file_size: 1684043
  relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: '       108'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 1 - 12
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '250152'
  name: Limits to selection in biology and in evolutionary computation
publication: Theoretical Population Biology
publication_status: published
publisher: Academic Press
publist_id: '5524'
pubrep_id: '465'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spread of pedigree versus genetic ancestry in spatially distributed populations
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 108
year: '2016'
...
---
_id: '1641'
abstract:
- lang: eng
  text: The plant hormone auxin (indole-3-acetic acid) is a major regulator of plant
    growth and development including embryo and root patterning, lateral organ formation
    and growth responses to environmental stimuli. Auxin is directionally transported
    from cell to cell by the action of specific auxin influx [AUXIN-RESISTANT1 (AUX1)]
    and efflux [PIN-FORMED (PIN)] transport regulators, whose polar, subcellular localizations
    are aligned with the direction of the auxin flow. Auxin itself regulates its own
    transport by modulation of the expression and subcellular localization of the
    auxin transporters. Increased auxin levels promote the transcription of PIN2 and
    AUX1 genes as well as stabilize PIN proteins at the plasma membrane, whereas prolonged
    auxin exposure increases the turnover of PIN proteins and their degradation in
    the vacuole. In this study, we applied a forward genetic approach, to identify
    molecular components playing a role in the auxin-mediated degradation. We generated
    EMS-mutagenized Arabidopsis PIN2::PIN2:GFP, AUX1::AUX1:YFP eir1aux1 populations
    and designed a screen for mutants with persistently strong fluorescent signals
    of the tagged PIN2 and AUX1 after prolonged treatment with the synthetic auxin
    2,4-dichlorophenoxyacetic acid (2,4-D). This approach yielded novel auxin degradation
    mutants defective in trafficking and degradation of PIN2 and AUX1 proteins and
    established a role for auxin-mediated degradation in plant development.
acknowledgement: 'European Social Fund (CZ.1.07/2.3.00/20.0043) and the Czech Science
  Foundation GAČR (GA13-40637S) to JF. '
article_processing_charge: No
author:
- first_name: Radka
  full_name: Zemová, Radka
  last_name: Zemová
- first_name: Marta
  full_name: Zwiewka, Marta
  last_name: Zwiewka
- first_name: Agnieszka
  full_name: Bielach, Agnieszka
  last_name: Bielach
- first_name: Hélène
  full_name: Robert, Hélène
  last_name: Robert
- first_name: Jirí
  full_name: Friml, Jirí
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
citation:
  ama: Zemová R, Zwiewka M, Bielach A, Robert H, Friml J. A forward genetic screen
    for new regulators of auxin mediated degradation of auxin transport proteins in
    Arabidopsis thaliana. <i>Journal of Plant Growth Regulation</i>. 2016;35(2):465-476.
    doi:<a href="https://doi.org/10.1007/s00344-015-9553-2">10.1007/s00344-015-9553-2</a>
  apa: Zemová, R., Zwiewka, M., Bielach, A., Robert, H., &#38; Friml, J. (2016). A
    forward genetic screen for new regulators of auxin mediated degradation of auxin
    transport proteins in Arabidopsis thaliana. <i>Journal of Plant Growth Regulation</i>.
    Springer. <a href="https://doi.org/10.1007/s00344-015-9553-2">https://doi.org/10.1007/s00344-015-9553-2</a>
  chicago: Zemová, Radka, Marta Zwiewka, Agnieszka Bielach, Hélène Robert, and Jiří
    Friml. “A Forward Genetic Screen for New Regulators of Auxin Mediated Degradation
    of Auxin Transport Proteins in Arabidopsis Thaliana.” <i>Journal of Plant Growth
    Regulation</i>. Springer, 2016. <a href="https://doi.org/10.1007/s00344-015-9553-2">https://doi.org/10.1007/s00344-015-9553-2</a>.
  ieee: R. Zemová, M. Zwiewka, A. Bielach, H. Robert, and J. Friml, “A forward genetic
    screen for new regulators of auxin mediated degradation of auxin transport proteins
    in Arabidopsis thaliana,” <i>Journal of Plant Growth Regulation</i>, vol. 35,
    no. 2. Springer, pp. 465–476, 2016.
  ista: Zemová R, Zwiewka M, Bielach A, Robert H, Friml J. 2016. A forward genetic
    screen for new regulators of auxin mediated degradation of auxin transport proteins
    in Arabidopsis thaliana. Journal of Plant Growth Regulation. 35(2), 465–476.
  mla: Zemová, Radka, et al. “A Forward Genetic Screen for New Regulators of Auxin
    Mediated Degradation of Auxin Transport Proteins in Arabidopsis Thaliana.” <i>Journal
    of Plant Growth Regulation</i>, vol. 35, no. 2, Springer, 2016, pp. 465–76, doi:<a
    href="https://doi.org/10.1007/s00344-015-9553-2">10.1007/s00344-015-9553-2</a>.
  short: R. Zemová, M. Zwiewka, A. Bielach, H. Robert, J. Friml, Journal of Plant
    Growth Regulation 35 (2016) 465–476.
corr_author: '1'
date_created: 2018-12-11T11:53:12Z
date_published: 2016-06-01T00:00:00Z
date_updated: 2025-09-18T10:51:26Z
day: '01'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.1007/s00344-015-9553-2
external_id:
  isi:
  - '000376482300015'
file:
- access_level: open_access
  checksum: 0dc6a300cde6536ceedd2bcdd2060efb
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:08:34Z
  date_updated: 2020-07-14T12:45:08Z
  file_id: '4695'
  file_name: IST-2018-1001-v1+1_Zemova_JPlantGrowthRegul_2016_proofs.pdf
  file_size: 5637591
  relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: '        35'
isi: 1
issue: '2'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Preprint
page: 465 - 476
publication: Journal of Plant Growth Regulation
publication_status: published
publisher: Springer
publist_id: '5512'
pubrep_id: '1001'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A forward genetic screen for new regulators of auxin mediated degradation of
  auxin transport proteins in Arabidopsis thaliana
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 35
year: '2016'
...
---
_id: '1653'
abstract:
- lang: eng
  text: "A somewhere statistically binding (SSB) hash, introduced by Hubáček and Wichs
    (ITCS ’15), can be used to hash a long string x to a short digest y = H hk (x)
    using a public hashing-key hk. Furthermore, there is a way to set up the hash
    key hk to make it statistically binding on some arbitrary hidden position i, meaning
    that: (1) the digest y completely determines the i’th bit (or symbol) of x so
    that all pre-images of y have the same value in the i’th position, (2) it is computationally
    infeasible to distinguish the position i on which hk is statistically binding
    from any other position i’. Lastly, the hash should have a local opening property
    analogous to Merkle-Tree hashing, meaning that given x and y = H hk (x) it should
    be possible to create a short proof π that certifies the value of the i’th bit
    (or symbol) of x without having to provide the entire input x. A similar primitive
    called a positional accumulator, introduced by Koppula, Lewko and Waters (STOC
    ’15) further supports dynamic updates of the hashed value. These tools, which
    are interesting in their own right, also serve as one of the main technical components
    in several recent works building advanced applications from indistinguishability
    obfuscation (iO).\r\n\r\nThe prior constructions of SSB hashing and positional
    accumulators required fully homomorphic encryption (FHE) and iO respectively.
    In this work, we give new constructions of these tools based on well studied number-theoretic
    assumptions such as DDH, Phi-Hiding and DCR, as well as a general construction
    from lossy/injective functions."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Tatsuaki
  full_name: Okamoto, Tatsuaki
  last_name: Okamoto
- first_name: Krzysztof Z
  full_name: Pietrzak, Krzysztof Z
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
- first_name: Brent
  full_name: Waters, Brent
  last_name: Waters
- first_name: Daniel
  full_name: Wichs, Daniel
  last_name: Wichs
citation:
  ama: 'Okamoto T, Pietrzak KZ, Waters B, Wichs D. New realizations of somewhere statistically
    binding hashing and positional accumulators. In: Vol 9452. Springer; 2016:121-145.
    doi:<a href="https://doi.org/10.1007/978-3-662-48797-6_6">10.1007/978-3-662-48797-6_6</a>'
  apa: 'Okamoto, T., Pietrzak, K. Z., Waters, B., &#38; Wichs, D. (2016). New realizations
    of somewhere statistically binding hashing and positional accumulators (Vol. 9452,
    pp. 121–145). Presented at the ASIACRYPT: Theory and Application of Cryptology
    and Information Security, Auckland, New Zealand: Springer. <a href="https://doi.org/10.1007/978-3-662-48797-6_6">https://doi.org/10.1007/978-3-662-48797-6_6</a>'
  chicago: Okamoto, Tatsuaki, Krzysztof Z Pietrzak, Brent Waters, and Daniel Wichs.
    “New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators,”
    9452:121–45. Springer, 2016. <a href="https://doi.org/10.1007/978-3-662-48797-6_6">https://doi.org/10.1007/978-3-662-48797-6_6</a>.
  ieee: 'T. Okamoto, K. Z. Pietrzak, B. Waters, and D. Wichs, “New realizations of
    somewhere statistically binding hashing and positional accumulators,” presented
    at the ASIACRYPT: Theory and Application of Cryptology and Information Security,
    Auckland, New Zealand, 2016, vol. 9452, pp. 121–145.'
  ista: 'Okamoto T, Pietrzak KZ, Waters B, Wichs D. 2016. New realizations of somewhere
    statistically binding hashing and positional accumulators. ASIACRYPT: Theory and
    Application of Cryptology and Information Security, LNCS, vol. 9452, 121–145.'
  mla: Okamoto, Tatsuaki, et al. <i>New Realizations of Somewhere Statistically Binding
    Hashing and Positional Accumulators</i>. Vol. 9452, Springer, 2016, pp. 121–45,
    doi:<a href="https://doi.org/10.1007/978-3-662-48797-6_6">10.1007/978-3-662-48797-6_6</a>.
  short: T. Okamoto, K.Z. Pietrzak, B. Waters, D. Wichs, in:, Springer, 2016, pp.
    121–145.
conference:
  end_date: 2015-12-03
  location: Auckland, New Zealand
  name: 'ASIACRYPT: Theory and Application of Cryptology and Information Security'
  start_date: 2015-11-29
date_created: 2018-12-11T11:53:16Z
date_published: 2016-01-08T00:00:00Z
date_updated: 2025-09-23T09:40:30Z
day: '08'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.1007/978-3-662-48797-6_6
ec_funded: 1
external_id:
  isi:
  - '000375148100006'
file:
- access_level: open_access
  checksum: a57711cb660c5b17b42bb47275a00180
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:12:05Z
  date_updated: 2020-07-14T12:45:08Z
  file_id: '4923'
  file_name: IST-2016-677-v1+1_869.pdf
  file_size: 580088
  relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: '      9452'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 121 - 145
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '259668'
  name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5497'
pubrep_id: '677'
quality_controlled: '1'
scopus_import: '1'
status: public
title: New realizations of somewhere statistically binding hashing and positional
  accumulators
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9452
year: '2016'
...
---
_id: '1705'
abstract:
- lang: eng
  text: Hybrid systems represent an important and powerful formalism for modeling
    real-world applications such as embedded systems. A verification tool like SpaceEx
    is based on the exploration of a symbolic search space (the region space). As
    a verification tool, it is typically optimized towards proving the absence of
    errors. In some settings, e.g., when the verification tool is employed in a feedback-directed
    design cycle, one would like to have the option to call a version that is optimized
    towards finding an error trajectory in the region space. A recent approach in
    this direction is based on guided search. Guided search relies on a cost function
    that indicates which states are promising to be explored, and preferably explores
    more promising states first. In this paper, we propose an abstraction-based cost
    function based on coarse-grained space abstractions for guiding the reachability
    analysis. For this purpose, a suitable abstraction technique that exploits the
    flexible granularity of modern reachability analysis algorithms is introduced.
    The new cost function is an effective extension of pattern database approaches
    that have been successfully applied in other areas. The approach has been implemented
    in the SpaceEx model checker. The evaluation shows its practical potential.
article_processing_charge: Yes (via OA deal)
author:
- first_name: Sergiy
  full_name: Bogomolov, Sergiy
  id: 369D9A44-F248-11E8-B48F-1D18A9856A87
  last_name: Bogomolov
  orcid: 0000-0002-0686-0365
- first_name: Alexandre
  full_name: Donzé, Alexandre
  last_name: Donzé
- first_name: Goran
  full_name: Frehse, Goran
  last_name: Frehse
- first_name: Radu
  full_name: Grosu, Radu
  last_name: Grosu
- first_name: Taylor
  full_name: Johnson, Taylor
  last_name: Johnson
- first_name: Hamed
  full_name: Ladan, Hamed
  last_name: Ladan
- first_name: Andreas
  full_name: Podelski, Andreas
  last_name: Podelski
- first_name: Martin
  full_name: Wehrle, Martin
  last_name: Wehrle
citation:
  ama: Bogomolov S, Donzé A, Frehse G, et al. Guided search for hybrid systems based
    on coarse-grained space abstractions. <i>International Journal on Software Tools
    for Technology Transfer</i>. 2016;18(4):449-467. doi:<a href="https://doi.org/10.1007/s10009-015-0393-y">10.1007/s10009-015-0393-y</a>
  apa: Bogomolov, S., Donzé, A., Frehse, G., Grosu, R., Johnson, T., Ladan, H., …
    Wehrle, M. (2016). Guided search for hybrid systems based on coarse-grained space
    abstractions. <i>International Journal on Software Tools for Technology Transfer</i>.
    Springer. <a href="https://doi.org/10.1007/s10009-015-0393-y">https://doi.org/10.1007/s10009-015-0393-y</a>
  chicago: Bogomolov, Sergiy, Alexandre Donzé, Goran Frehse, Radu Grosu, Taylor Johnson,
    Hamed Ladan, Andreas Podelski, and Martin Wehrle. “Guided Search for Hybrid Systems
    Based on Coarse-Grained Space Abstractions.” <i>International Journal on Software
    Tools for Technology Transfer</i>. Springer, 2016. <a href="https://doi.org/10.1007/s10009-015-0393-y">https://doi.org/10.1007/s10009-015-0393-y</a>.
  ieee: S. Bogomolov <i>et al.</i>, “Guided search for hybrid systems based on coarse-grained
    space abstractions,” <i>International Journal on Software Tools for Technology
    Transfer</i>, vol. 18, no. 4. Springer, pp. 449–467, 2016.
  ista: Bogomolov S, Donzé A, Frehse G, Grosu R, Johnson T, Ladan H, Podelski A, Wehrle
    M. 2016. Guided search for hybrid systems based on coarse-grained space abstractions.
    International Journal on Software Tools for Technology Transfer. 18(4), 449–467.
  mla: Bogomolov, Sergiy, et al. “Guided Search for Hybrid Systems Based on Coarse-Grained
    Space Abstractions.” <i>International Journal on Software Tools for Technology
    Transfer</i>, vol. 18, no. 4, Springer, 2016, pp. 449–67, doi:<a href="https://doi.org/10.1007/s10009-015-0393-y">10.1007/s10009-015-0393-y</a>.
  short: S. Bogomolov, A. Donzé, G. Frehse, R. Grosu, T. Johnson, H. Ladan, A. Podelski,
    M. Wehrle, International Journal on Software Tools for Technology Transfer 18
    (2016) 449–467.
corr_author: '1'
date_created: 2018-12-11T11:53:34Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2025-09-18T10:50:19Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/s10009-015-0393-y
ec_funded: 1
external_id:
  isi:
  - '000379708300007'
file:
- access_level: open_access
  checksum: 31561d7705599a9bd4ea816accc0752e
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:15:26Z
  date_updated: 2020-07-14T12:45:13Z
  file_id: '5146'
  file_name: IST-2016-457-v1+1_s10009-015-0393-y.pdf
  file_size: 2296522
  relation: main_file
file_date_updated: 2020-07-14T12:45:13Z
has_accepted_license: '1'
intvolume: '        18'
isi: 1
issue: '4'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 449 - 467
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
publication: International Journal on Software Tools for Technology Transfer
publication_status: published
publisher: Springer
publist_id: '5431'
pubrep_id: '457'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Guided search for hybrid systems based on coarse-grained space abstractions
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 18
year: '2016'
...
---
_id: '1707'
abstract:
- lang: eng
  text: "Volunteer supporters play an important role in modern crisis and disaster
    management. In the times of mobile Internet devices, help from thousands of volunteers
    can be requested within a short time span, thus relieving professional helpers
    from minor chores or geographically spread-out tasks. However, the simultaneous
    availability of many volunteers also poses new problems. In particular, the volunteer
    efforts must be well coordinated, or otherwise situations might emerge in which
    too many idle volunteers at one location become more of a burden than a relief
    to the professionals.\r\nIn this work, we study the task of optimally assigning
    volunteers to selected locations, e.g. in order to perform regular measurements,
    to report on damage, or to distribute information or resources to the population
    in a crisis situation. We formulate the assignment tasks as an optimization problem
    and propose an effective and efficient solution procedure. Experiments on real
    data of the Team Österreich, consisting of over 36,000 Austrian volunteers, show
    the effectiveness and efficiency of our approach."
acknowledgement: The DRIVER FP7 project has received funding from the European Unions
  Seventh Framework Programme for research, technological development and demonstration
  under grant agreement no 607798. RE-ACTA was funded within the framework of the
  Austrian Security Research Programme KIRAS by the Federal Ministry for Transport,
  Innovation and Technology.
article_number: '7402041'
author:
- first_name: Jasmin
  full_name: Pielorz, Jasmin
  id: 49BC895A-F248-11E8-B48F-1D18A9856A87
  last_name: Pielorz
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
citation:
  ama: 'Pielorz J, Lampert C. Optimal geospatial allocation of volunteers for crisis
    management. In: IEEE; 2016. doi:<a href="https://doi.org/10.1109/ICT-DM.2015.7402041">10.1109/ICT-DM.2015.7402041</a>'
  apa: 'Pielorz, J., &#38; Lampert, C. (2016). Optimal geospatial allocation of volunteers
    for crisis management. Presented at the ICT-DM: Information and Communication
    Technologies for Disaster Management, Rennes, France: IEEE. <a href="https://doi.org/10.1109/ICT-DM.2015.7402041">https://doi.org/10.1109/ICT-DM.2015.7402041</a>'
  chicago: Pielorz, Jasmin, and Christoph Lampert. “Optimal Geospatial Allocation
    of Volunteers for Crisis Management.” IEEE, 2016. <a href="https://doi.org/10.1109/ICT-DM.2015.7402041">https://doi.org/10.1109/ICT-DM.2015.7402041</a>.
  ieee: 'J. Pielorz and C. Lampert, “Optimal geospatial allocation of volunteers for
    crisis management,” presented at the ICT-DM: Information and Communication Technologies
    for Disaster Management, Rennes, France, 2016.'
  ista: 'Pielorz J, Lampert C. 2016. Optimal geospatial allocation of volunteers for
    crisis management. ICT-DM: Information and Communication Technologies for Disaster
    Management, 7402041.'
  mla: Pielorz, Jasmin, and Christoph Lampert. <i>Optimal Geospatial Allocation of
    Volunteers for Crisis Management</i>. 7402041, IEEE, 2016, doi:<a href="https://doi.org/10.1109/ICT-DM.2015.7402041">10.1109/ICT-DM.2015.7402041</a>.
  short: J. Pielorz, C. Lampert, in:, IEEE, 2016.
conference:
  end_date: 2015-12-02
  location: Rennes, France
  name: 'ICT-DM: Information and Communication Technologies for Disaster Management'
  start_date: 2015-11-30
date_created: 2018-12-11T11:53:35Z
date_published: 2016-02-11T00:00:00Z
date_updated: 2021-01-12T06:52:39Z
day: '11'
department:
- _id: ChLa
doi: 10.1109/ICT-DM.2015.7402041
language:
- iso: eng
month: '02'
oa_version: None
publication_status: published
publisher: IEEE
publist_id: '5429'
quality_controlled: '1'
scopus_import: 1
status: public
title: Optimal geospatial allocation of volunteers for crisis management
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
