---
_id: '10416'
abstract:
- lang: eng
text: 'A fundamental algorithmic problem at the heart of static analysis is Dyck
reachability. The input is a graph where the edges are labeled with different
types of opening and closing parentheses, and the reachability information is
computed via paths whose parentheses are properly matched. We present new results
for Dyck reachability problems with applications to alias analysis and data-dependence
analysis. Our main contributions, that include improved upper bounds as well as
lower bounds that establish optimality guarantees, are as follows: First, we consider
Dyck reachability on bidirected graphs, which is the standard way of performing
field-sensitive points-to analysis. Given a bidirected graph with n nodes and
m edges, we present: (i) an algorithm with worst-case running time O(m + n · α(n)),
where α(n) is the inverse Ackermann function, improving the previously known O(n2)
time bound; (ii) a matching lower bound that shows that our algorithm is optimal
wrt to worst-case complexity; and (iii) an optimal average-case upper bound of
O(m) time, improving the previously known O(m · logn) bound. Second, we consider
the problem of context-sensitive data-dependence analysis, where the task is to
obtain analysis summaries of library code in the presence of callbacks. Our algorithm
preprocesses libraries in almost linear time, after which the contribution of
the library in the complexity of the client analysis is only linear, and only
wrt the number of call sites. Third, we prove that combinatorial algorithms for
Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained
without obtaining sub-cubic combinatorial algorithms for Boolean Matrix Multiplication,
which is a long-standing open problem. Thus we establish that the existing combinatorial
algorithms for Dyck reachability are (conditionally) optimal for general graphs.
We also show that the same hardness holds for graphs of constant treewidth. Finally,
we provide a prototype implementation of our algorithms for both alias analysis
and data-dependence analysis. Our experimental evaluation demonstrates that the
new algorithms significantly outperform all existing methods on the two problems,
over real-world benchmarks.'
acknowledgement: "The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant
(279307: Graph Games).\r\n"
article_number: '30'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Bhavya
full_name: Choudhary, Bhavya
last_name: Choudhary
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence
and Alias analysis. Proceedings of the ACM on Programming Languages. 2017;2(POPL).
doi:10.1145/3158118
apa: 'Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck
reachability for data-dependence and Alias analysis. Proceedings of the ACM
on Programming Languages. Los Angeles, CA, United States: Association for
Computing Machinery. https://doi.org/10.1145/3158118'
chicago: Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal
Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the
ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158118.
ieee: K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability
for data-dependence and Alias analysis,” Proceedings of the ACM on Programming
Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.
ista: Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability
for data-dependence and Alias analysis. Proceedings of the ACM on Programming
Languages. 2(POPL), 30.
mla: Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence
and Alias Analysis.” Proceedings of the ACM on Programming Languages, vol.
2, no. POPL, 30, Association for Computing Machinery, 2017, doi:10.1145/3158118.
short: K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming
Languages 2 (2017).
conference:
end_date: 2018-01-13
location: Los Angeles, CA, United States
name: 'POPL: Programming Languages'
start_date: 2018-01-07
corr_author: '1'
date_created: 2021-12-05T23:01:48Z
date_published: 2017-12-27T00:00:00Z
date_updated: 2025-04-15T07:26:20Z
day: '27'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3158118
ec_funded: 1
external_id:
arxiv:
- '1910.00241'
file:
- access_level: open_access
checksum: faa3f7b3fe8aab84b50ed805c26a0ee5
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-07T08:06:28Z
date_updated: 2021-12-07T08:06:28Z
file_id: '10421'
file_name: 2017_ACMProgLang_Chatterjee.pdf
file_size: 460188
relation: main_file
success: 1
file_date_updated: 2021-12-07T08:06:28Z
has_accepted_license: '1'
intvolume: ' 2'
issue: POPL
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _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
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '5455'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Optimal Dyck reachability for data-dependence and Alias analysis
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 2
year: '2017'
...
---
_id: '10418'
abstract:
- lang: eng
text: We present a new proof rule for proving almost-sure termination of probabilistic
programs, including those that contain demonic non-determinism. An important question
for a probabilistic program is whether the probability mass of all its diverging
runs is zero, that is that it terminates "almost surely". Proving that can be
hard, and this paper presents a new method for doing so. It applies directly to
the program's source code, even if the program contains demonic choice. Like others,
we use variant functions (a.k.a. "super-martingales") that are real-valued and
decrease randomly on each loop iteration; but our key innovation is that the amount
as well as the probability of the decrease are parametric. We prove the soundness
of the new rule, indicate where its applicability goes beyond existing rules,
and explain its connection to classical results on denumerable (non-demonic) Markov
chains.
acknowledgement: "McIver and Morgan are grateful to David Basin and the Information
Security Group at ETH Zürich for hosting a six-month stay in Switzerland, during
part of which this work began. And thanks particularly to Andreas Lochbihler, who
shared with us the probabilistic termination problem that led to it. They acknowledge
the support of ARC grant DP140101119. Part of this work was carried out during the
Workshop on Probabilistic Programming Semantics\r\nat McGill University’s Bellairs
Research Institute on Barbados organised by Alexandra Silva and\r\nPrakash Panangaden.
Kaminski and Katoen are grateful to Sebastian Junges for spotting a flaw in §5.4."
article_number: '33'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Annabelle
full_name: Mciver, Annabelle
last_name: Mciver
- first_name: Carroll
full_name: Morgan, Carroll
last_name: Morgan
- first_name: Benjamin Lucien
full_name: Kaminski, Benjamin Lucien
last_name: Kaminski
- first_name: Joost P
full_name: Katoen, Joost P
id: 4524F760-F248-11E8-B48F-1D18A9856A87
last_name: Katoen
orcid: 0000-0002-6143-1926
citation:
ama: Mciver A, Morgan C, Kaminski BL, Katoen JP. A new proof rule for almost-sure
termination. Proceedings of the ACM on Programming Languages. 2017;2(POPL).
doi:10.1145/3158121
apa: 'Mciver, A., Morgan, C., Kaminski, B. L., & Katoen, J. P. (2017). A new
proof rule for almost-sure termination. Proceedings of the ACM on Programming
Languages. Los Angeles, CA, United States: Association for Computing Machinery.
https://doi.org/10.1145/3158121'
chicago: Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost
P Katoen. “A New Proof Rule for Almost-Sure Termination.” Proceedings of the
ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158121.
ieee: A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule
for almost-sure termination,” Proceedings of the ACM on Programming Languages,
vol. 2, no. POPL. Association for Computing Machinery, 2017.
ista: Mciver A, Morgan C, Kaminski BL, Katoen JP. 2017. A new proof rule for almost-sure
termination. Proceedings of the ACM on Programming Languages. 2(POPL), 33.
mla: Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.” Proceedings
of the ACM on Programming Languages, vol. 2, no. POPL, 33, Association for
Computing Machinery, 2017, doi:10.1145/3158121.
short: A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM
on Programming Languages 2 (2017).
conference:
end_date: 2018-01-13
location: Los Angeles, CA, United States
name: 'POPL: Programming Languages'
start_date: 2018-01-07
corr_author: '1'
date_created: 2021-12-05T23:01:49Z
date_published: 2017-12-07T00:00:00Z
date_updated: 2026-06-18T08:40:04Z
day: '07'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/3158121
external_id:
arxiv:
- '1711.03588'
intvolume: ' 2'
issue: POPL
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/doi/10.1145/3158121
month: '12'
oa: 1
oa_version: Published Version
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: A new proof rule for almost-sure termination
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2017'
...
---
_id: '1063'
abstract:
- lang: eng
text: Severe environmental change can drive a population extinct unless the population
adapts in time to the new conditions (“evolutionary rescue”). How does biparental
sexual reproduction influence the chances of population persistence compared to
clonal reproduction or selfing? In this article, we set up a one‐locus two‐allele
model for adaptation in diploid species, where rescue is contingent on the establishment
of the mutant homozygote. Reproduction can occur by random mating, selfing, or
clonally. Random mating generates and destroys the rescue mutant; selfing is efficient
at generating it but at the same time depletes the heterozygote, which can lead
to a low mutant frequency in the standing genetic variation. Due to these (and
other) antagonistic effects, we find a nontrivial dependence of population survival
on the rate of sex/selfing, which is strongly influenced by the dominance coefficient
of the mutation before and after the environmental change. Importantly, since
mating with the wild‐type breaks the mutant homozygote up, a slow decay of the
wild‐type population size can impede rescue in randomly mating populations.
article_processing_charge: No
author:
- first_name: Hildegard
full_name: Uecker, Hildegard
id: 2DB8F68A-F248-11E8-B48F-1D18A9856A87
last_name: Uecker
orcid: 0000-0001-9435-2813
biorxivid: 1
citation:
ama: Uecker H. Evolutionary rescue in randomly mating, selfing, and clonal populations.
Evolution. 2017;71(4):845-858. doi:10.1111/evo.13191
apa: Uecker, H. (2017). Evolutionary rescue in randomly mating, selfing, and clonal
populations. Evolution. Wiley. https://doi.org/10.1111/evo.13191
chicago: Uecker, Hildegard. “Evolutionary Rescue in Randomly Mating, Selfing, and
Clonal Populations.” Evolution. Wiley, 2017. https://doi.org/10.1111/evo.13191.
ieee: H. Uecker, “Evolutionary rescue in randomly mating, selfing, and clonal populations,”
Evolution, vol. 71, no. 4. Wiley, pp. 845–858, 2017.
ista: Uecker H. 2017. Evolutionary rescue in randomly mating, selfing, and clonal
populations. Evolution. 71(4), 845–858.
mla: Uecker, Hildegard. “Evolutionary Rescue in Randomly Mating, Selfing, and Clonal
Populations.” Evolution, vol. 71, no. 4, Wiley, 2017, pp. 845–58, doi:10.1111/evo.13191.
short: H. Uecker, Evolution 71 (2017) 845–858.
das_tickbox: '1'
date_created: 2018-12-11T11:49:57Z
date_published: 2017-04-01T00:00:00Z
date_updated: 2026-06-22T14:05:53Z
day: '01'
department:
- _id: NiBa
doi: 10.1111/evo.13191
ec_funded: 1
external_id:
biorxivid:
- 10.1101/081042
isi:
- '000398545200003'
intvolume: ' 71'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/081042
month: '04'
oa: 1
oa_version: Submitted Version
page: 845 - 858
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Evolution
publication_identifier:
issn:
- 0014-3820
publication_status: published
publisher: Wiley
publist_id: '6327'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolutionary rescue in randomly mating, selfing, and clonal populations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 71
year: '2017'
...
---
_id: '1065'
abstract:
- lang: eng
text: 'We consider the problem of reachability in pushdown graphs. We study the
problem for pushdown graphs with constant treewidth. Even for pushdown graphs
with treewidth 1, for the reachability problem we establish the following: (i)
the problem is PTIME-complete, and (ii) any subcubic algorithm for the problem
would contradict the k-clique conjecture and imply faster combinatorial algorithms
for cliques in graphs.'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
orcid: 0000-0002-8882-5116
citation:
ama: Chatterjee K, Osang GF. Pushdown reachability with constant treewidth. Information
Processing Letters. 2017;122:25-29. doi:10.1016/j.ipl.2017.02.003
apa: Chatterjee, K., & Osang, G. F. (2017). Pushdown reachability with constant
treewidth. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2017.02.003
chicago: Chatterjee, Krishnendu, and Georg F Osang. “Pushdown Reachability with
Constant Treewidth.” Information Processing Letters. Elsevier, 2017. https://doi.org/10.1016/j.ipl.2017.02.003.
ieee: K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,”
Information Processing Letters, vol. 122. Elsevier, pp. 25–29, 2017.
ista: Chatterjee K, Osang GF. 2017. Pushdown reachability with constant treewidth.
Information Processing Letters. 122, 25–29.
mla: Chatterjee, Krishnendu, and Georg F. Osang. “Pushdown Reachability with Constant
Treewidth.” Information Processing Letters, vol. 122, Elsevier, 2017, pp.
25–29, doi:10.1016/j.ipl.2017.02.003.
short: K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29.
date_created: 2018-12-11T11:49:57Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-07-10T11:49:53Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
- _id: HeEd
doi: 10.1016/j.ipl.2017.02.003
ec_funded: 1
external_id:
isi:
- '000399506600005'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:17Z
date_updated: 2019-10-15T07:44:51Z
file_id: '4998'
file_name: IST-2018-991-v1+2_2018_Chatterjee_Pushdown_PREPRINT.pdf
file_size: 247657
relation: main_file
file_date_updated: 2019-10-15T07:44:51Z
has_accepted_license: '1'
intvolume: ' 122'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 25 - 29
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Information Processing Letters
publication_identifier:
issn:
- 0020-0190
publication_status: published
publisher: Elsevier
publist_id: '6323'
pubrep_id: '991'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Pushdown reachability with constant treewidth
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 122
year: '2017'
...
---
OA_place: publisher
OA_type: free access
_id: '1066'
abstract:
- lang: eng
text: "Simulation is an attractive alternative to language inclusion for automata
as it is an under-approximation of language inclusion, but usually has much lower
complexity. Simulation has also been extended in two orthogonal directions, namely,
(1) fair simulation, for simulation over specified set of infinite runs; and (2)
quantitative simulation, for simulation between weighted automata. While fair
trace inclusion is PSPACE-complete, fair simulation can be computed in polynomial
time. For weighted automata, the (quantitative) language inclusion problem is
undecidable in general, whereas the (quantitative) simulation reduces to quantitative
games, which admit pseudo-polynomial time algorithms.\r\n\r\nIn this work, we
study (quantitative) simulation for weighted automata with Büchi acceptance conditions,
i.e., we generalize fair simulation from non-weighted automata to weighted automata.
We show that imposing Büchi acceptance conditions on weighted automata changes
many fundamental properties of the simulation games, yet they still admit pseudo-polynomial
time algorithms."
acknowledgement: This research was funded in part by the European Research Council
(ERC) under grant agreements 267989 (QUAREM), 279307 (Graph Games), by the Austrian
Science Fund (FWF) projects S11402-N23 (RiSE), S11407-N23 (RiSE), P23499-N23, and
Microsoft faculty fellows award.
article_processing_charge: No
article_type: original
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative fair simulation
games. Information and Computation. 2017;254(2):143-166. doi:10.1016/j.ic.2016.10.006
apa: Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2017). Quantitative
fair simulation games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2016.10.006
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner.
“Quantitative Fair Simulation Games.” Information and Computation. Elsevier,
2017. https://doi.org/10.1016/j.ic.2016.10.006.
ieee: K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, “Quantitative fair
simulation games,” Information and Computation, vol. 254, no. 2. Elsevier,
pp. 143–166, 2017.
ista: Chatterjee K, Henzinger TA, Otop J, Velner Y. 2017. Quantitative fair simulation
games. Information and Computation. 254(2), 143–166.
mla: Chatterjee, Krishnendu, et al. “Quantitative Fair Simulation Games.” Information
and Computation, vol. 254, no. 2, Elsevier, 2017, pp. 143–66, doi:10.1016/j.ic.2016.10.006.
short: K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Information and Computation
254 (2017) 143–166.
corr_author: '1'
date_created: 2018-12-11T11:49:58Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2026-06-18T08:47:01Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.ic.2016.10.006
ec_funded: 1
external_id:
isi:
- '000402025600002'
intvolume: ' 254'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.ic.2016.10.006
month: '06'
oa: 1
oa_version: Published Version
page: 143 - 166
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _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: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '6322'
quality_controlled: '1'
related_material:
record:
- id: '5428'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Quantitative fair simulation games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 254
year: '2017'
...
---
_id: '1067'
abstract:
- lang: eng
text: Embryo morphogenesis relies on highly coordinated movements of different tissues.
However, remarkably little is known about how tissues coordinate their movements
to shape the embryo. In zebrafish embryogenesis, coordinated tissue movements
first become apparent during “doming,” when the blastoderm begins to spread over
the yolk sac, a process involving coordinated epithelial surface cell layer expansion
and mesenchymal deep cell intercalations. Here, we find that active surface cell
expansion represents the key process coordinating tissue movements during doming.
By using a combination of theory and experiments, we show that epithelial surface
cells not only trigger blastoderm expansion by reducing tissue surface tension,
but also drive blastoderm thinning by inducing tissue contraction through radial
deep cell intercalations. Thus, coordinated tissue expansion and thinning during
doming relies on surface cells simultaneously controlling tissue surface tension
and radial tissue contraction.
acknowledged_ssus:
- _id: PreCl
article_processing_charge: No
author:
- first_name: Hitoshi
full_name: Morita, Hitoshi
id: 4C6E54C6-F248-11E8-B48F-1D18A9856A87
last_name: Morita
- first_name: Silvia
full_name: Grigolon, Silvia
last_name: Grigolon
- first_name: Martin
full_name: Bock, Martin
last_name: Bock
- first_name: Gabriel
full_name: Krens, Gabriel
id: 2B819732-F248-11E8-B48F-1D18A9856A87
last_name: Krens
orcid: 0000-0003-4761-5996
- first_name: Guillaume
full_name: Salbreux, Guillaume
last_name: Salbreux
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Morita H, Grigolon S, Bock M, Krens G, Salbreux G, Heisenberg C-PJ. The physical
basis of coordinated tissue spreading in zebrafish gastrulation. Developmental
Cell. 2017;40(4):354-366. doi:10.1016/j.devcel.2017.01.010
apa: Morita, H., Grigolon, S., Bock, M., Krens, G., Salbreux, G., & Heisenberg,
C.-P. J. (2017). The physical basis of coordinated tissue spreading in zebrafish
gastrulation. Developmental Cell. Cell Press. https://doi.org/10.1016/j.devcel.2017.01.010
chicago: Morita, Hitoshi, Silvia Grigolon, Martin Bock, Gabriel Krens, Guillaume
Salbreux, and Carl-Philipp J Heisenberg. “The Physical Basis of Coordinated Tissue
Spreading in Zebrafish Gastrulation.” Developmental Cell. Cell Press, 2017.
https://doi.org/10.1016/j.devcel.2017.01.010.
ieee: H. Morita, S. Grigolon, M. Bock, G. Krens, G. Salbreux, and C.-P. J. Heisenberg,
“The physical basis of coordinated tissue spreading in zebrafish gastrulation,”
Developmental Cell, vol. 40, no. 4. Cell Press, pp. 354–366, 2017.
ista: Morita H, Grigolon S, Bock M, Krens G, Salbreux G, Heisenberg C-PJ. 2017.
The physical basis of coordinated tissue spreading in zebrafish gastrulation.
Developmental Cell. 40(4), 354–366.
mla: Morita, Hitoshi, et al. “The Physical Basis of Coordinated Tissue Spreading
in Zebrafish Gastrulation.” Developmental Cell, vol. 40, no. 4, Cell Press,
2017, pp. 354–66, doi:10.1016/j.devcel.2017.01.010.
short: H. Morita, S. Grigolon, M. Bock, G. Krens, G. Salbreux, C.-P.J. Heisenberg,
Developmental Cell 40 (2017) 354–366.
corr_author: '1'
date_created: 2018-12-11T11:49:58Z
date_published: 2017-02-27T00:00:00Z
date_updated: 2025-07-10T11:49:55Z
day: '27'
ddc:
- '572'
- '597'
department:
- _id: CaHe
doi: 10.1016/j.devcel.2017.01.010
ec_funded: 1
external_id:
isi:
- '000395368300007'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:57Z
date_updated: 2018-12-12T10:10:57Z
file_id: '4849'
file_name: IST-2017-869-v1+1_1-s2.0-S1534580717300370-main.pdf
file_size: 6866187
relation: main_file
file_date_updated: 2018-12-12T10:10:57Z
has_accepted_license: '1'
intvolume: ' 40'
isi: 1
issue: '4'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 354 - 366
project:
- _id: 2524F500-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '201439'
name: Developing High-Throughput Bioassays for Human Cancers in Zebrafish
publication: Developmental Cell
publication_identifier:
issn:
- 1534-5807
publication_status: published
publisher: Cell Press
publist_id: '6320'
pubrep_id: '869'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The physical basis of coordinated tissue spreading in zebrafish gastrulation
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2017'
...
---
_id: '1072'
abstract:
- lang: eng
text: Given a finite set of points in Rn and a radius parameter, we study the Čech,
Delaunay–Čech, Delaunay (or alpha), and Wrap complexes in the light of generalized
discrete Morse theory. Establishing the Čech and Delaunay complexes as sublevel
sets of generalized discrete Morse functions, we prove that the four complexes
are simple-homotopy equivalent by a sequence of simplicial collapses, which are
explicitly described by a single discrete gradient field.
acknowledgement: This research has been supported by the EU project Toposys(FP7-ICT-318493-STREP),
by ESF under the ACAT Research Network Programme, by the Russian Government under
mega project 11.G34.31.0053, and by the DFG Collaborative Research Center SFB/TRR
109 “Discretization in Geometry and Dynamics”.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Bauer U, Edelsbrunner H. The Morse theory of Čech and delaunay complexes. Transactions
of the American Mathematical Society. 2017;369(5):3741-3762. doi:10.1090/tran/6991
apa: Bauer, U., & Edelsbrunner, H. (2017). The Morse theory of Čech and delaunay
complexes. Transactions of the American Mathematical Society. American
Mathematical Society. https://doi.org/10.1090/tran/6991
chicago: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and
Delaunay Complexes.” Transactions of the American Mathematical Society.
American Mathematical Society, 2017. https://doi.org/10.1090/tran/6991.
ieee: U. Bauer and H. Edelsbrunner, “The Morse theory of Čech and delaunay complexes,”
Transactions of the American Mathematical Society, vol. 369, no. 5. American
Mathematical Society, pp. 3741–3762, 2017.
ista: Bauer U, Edelsbrunner H. 2017. The Morse theory of Čech and delaunay complexes.
Transactions of the American Mathematical Society. 369(5), 3741–3762.
mla: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay
Complexes.” Transactions of the American Mathematical Society, vol. 369,
no. 5, American Mathematical Society, 2017, pp. 3741–62, doi:10.1090/tran/6991.
short: U. Bauer, H. Edelsbrunner, Transactions of the American Mathematical Society
369 (2017) 3741–3762.
date_created: 2018-12-11T11:49:59Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2025-04-15T08:37:54Z
day: '01'
department:
- _id: HeEd
doi: 10.1090/tran/6991
ec_funded: 1
external_id:
arxiv:
- '1312.1231'
isi:
- '000398030400024'
intvolume: ' 369'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1312.1231
month: '05'
oa: 1
oa_version: Preprint
page: 3741 - 3762
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Transactions of the American Mathematical Society
publication_status: published
publisher: American Mathematical Society
publist_id: '6311'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Morse theory of Čech and delaunay complexes
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 369
year: '2017'
...
---
_id: '1073'
abstract:
- lang: eng
text: Let X and Y be finite simplicial sets (e.g. finite simplicial complexes),
both equipped with a free simplicial action of a finite group G. Assuming that
Y is d-connected and dimX≤2d, for some d≥1, we provide an algorithm that computes
the set of all equivariant homotopy classes of equivariant continuous maps |X|→|Y|;
the existence of such a map can be decided even for dimX≤2d+1. This yields the
first algorithm for deciding topological embeddability of a k-dimensional finite
simplicial complex into Rn under the condition k≤23n−1. More generally, we present
an algorithm that, given a lifting-extension problem satisfying an appropriate
stability assumption, computes the set of all homotopy classes of solutions. This
result is new even in the non-equivariant situation.
article_processing_charge: No
arxiv: 1
author:
- first_name: Martin
full_name: Čadek, Martin
last_name: Čadek
- first_name: Marek
full_name: Krcál, Marek
id: 33E21118-F248-11E8-B48F-1D18A9856A87
last_name: Krcál
- first_name: Lukáš
full_name: Vokřínek, Lukáš
last_name: Vokřínek
citation:
ama: Čadek M, Krcál M, Vokřínek L. Algorithmic solvability of the lifting extension
problem. Discrete & Computational Geometry. 2017;54(4):915-965. doi:10.1007/s00454-016-9855-6
apa: Čadek, M., Krcál, M., & Vokřínek, L. (2017). Algorithmic solvability of
the lifting extension problem. Discrete & Computational Geometry. Springer.
https://doi.org/10.1007/s00454-016-9855-6
chicago: Čadek, Martin, Marek Krcál, and Lukáš Vokřínek. “Algorithmic Solvability
of the Lifting Extension Problem.” Discrete & Computational Geometry.
Springer, 2017. https://doi.org/10.1007/s00454-016-9855-6.
ieee: M. Čadek, M. Krcál, and L. Vokřínek, “Algorithmic solvability of the lifting
extension problem,” Discrete & Computational Geometry, vol. 54, no.
4. Springer, pp. 915–965, 2017.
ista: Čadek M, Krcál M, Vokřínek L. 2017. Algorithmic solvability of the lifting
extension problem. Discrete & Computational Geometry. 54(4), 915–965.
mla: Čadek, Martin, et al. “Algorithmic Solvability of the Lifting Extension Problem.”
Discrete & Computational Geometry, vol. 54, no. 4, Springer, 2017,
pp. 915–65, doi:10.1007/s00454-016-9855-6.
short: M. Čadek, M. Krcál, L. Vokřínek, Discrete & Computational Geometry 54
(2017) 915–965.
date_created: 2018-12-11T11:50:00Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-06-04T08:11:10Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s00454-016-9855-6
external_id:
arxiv:
- '1307.6444'
isi:
- '000400072700008'
intvolume: ' 54'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1307.6444
month: '06'
oa: 1
oa_version: Submitted Version
page: 915 - 965
publication: Discrete & Computational Geometry
publication_identifier:
issn:
- '01795376'
publication_status: published
publisher: Springer
publist_id: '6309'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithmic solvability of the lifting extension problem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2017'
...
---
_id: '1074'
abstract:
- lang: eng
text: Recently it has become feasible to detect long blocks of nearly identical
sequence shared between pairs of genomes. These IBD blocks are direct traces of
recent coalescence events and, as such, contain ample signal to infer recent demography.
Here, we examine sharing of such blocks in two-dimensional populations with local
migration. Using a diffusion approximation to trace genetic ancestry, we derive
analytical formulae for patterns of isolation by distance of IBD blocks, which
can also incorporate recent population density changes. We introduce an inference
scheme that uses a composite likelihood approach to fit these formulae. We then
extensively evaluate our theory and inference method on a range of scenarios using
simulated data. We first validate the diffusion approximation by showing that
the theoretical results closely match the simulated block sharing patterns. We
then demonstrate that our inference scheme can accurately and robustly infer dispersal
rate and effective density, as well as bounds on recent dynamics of population
density. To demonstrate an application, we use our estimation scheme to explore
the fit of a diffusion model to Eastern European samples in the POPRES data set.
We show that ancestry diffusing with a rate of σ ≈ 50–100 km/√gen during the last
centuries, combined with accelerating population growth, can explain the observed
exponential decay of block sharing with increasing pairwise sample distance.
article_processing_charge: No
author:
- first_name: Harald
full_name: Ringbauer, Harald
id: 417FCFF4-F248-11E8-B48F-1D18A9856A87
last_name: Ringbauer
orcid: 0000-0002-4884-9682
- first_name: Graham
full_name: Coop, Graham
last_name: Coop
- 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: Ringbauer H, Coop G, Barton NH. Inferring recent demography from isolation
by distance of long shared sequence blocks. Genetics. 2017;205(3):1335-1351.
doi:10.1534/genetics.116.196220
apa: Ringbauer, H., Coop, G., & Barton, N. H. (2017). Inferring recent demography
from isolation by distance of long shared sequence blocks. Genetics. Genetics
Society of America. https://doi.org/10.1534/genetics.116.196220
chicago: Ringbauer, Harald, Graham Coop, and Nicholas H Barton. “Inferring Recent
Demography from Isolation by Distance of Long Shared Sequence Blocks.” Genetics.
Genetics Society of America, 2017. https://doi.org/10.1534/genetics.116.196220.
ieee: H. Ringbauer, G. Coop, and N. H. Barton, “Inferring recent demography from
isolation by distance of long shared sequence blocks,” Genetics, vol. 205,
no. 3. Genetics Society of America, pp. 1335–1351, 2017.
ista: Ringbauer H, Coop G, Barton NH. 2017. Inferring recent demography from isolation
by distance of long shared sequence blocks. Genetics. 205(3), 1335–1351.
mla: Ringbauer, Harald, et al. “Inferring Recent Demography from Isolation by Distance
of Long Shared Sequence Blocks.” Genetics, vol. 205, no. 3, Genetics Society
of America, 2017, pp. 1335–51, doi:10.1534/genetics.116.196220.
short: H. Ringbauer, G. Coop, N.H. Barton, Genetics 205 (2017) 1335–1351.
date_created: 2018-12-11T11:50:00Z
date_published: 2017-03-01T00:00:00Z
date_updated: 2026-04-08T14:06:35Z
day: '01'
department:
- _id: NiBa
doi: 10.1534/genetics.116.196220
ec_funded: 1
external_id:
isi:
- '000395807200023'
intvolume: ' 205'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.biorxiv.org/content/early/2016/09/23/076810
month: '03'
oa: 1
oa_version: Preprint
page: 1335 - 1351
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Genetics
publication_identifier:
issn:
- 0016-6731
publication_status: published
publisher: Genetics Society of America
publist_id: '6307'
quality_controlled: '1'
related_material:
record:
- id: '200'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Inferring recent demography from isolation by distance of long shared sequence
blocks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 205
year: '2017'
...
---
_id: '1079'
abstract:
- lang: eng
text: We study the ionization problem in the Thomas-Fermi-Dirac-von Weizsäcker theory
for atoms and molecules. We prove the nonexistence of minimizers for the energy
functional when the number of electrons is large and the total nuclear charge
is small. This nonexistence result also applies to external potentials decaying
faster than the Coulomb potential. In the case of arbitrary nuclear charges, we
obtain the nonexistence of stable minimizers and radial minimizers.
article_number: '6'
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: Hanne
full_name: Van Den Bosch, Hanne
last_name: Van Den Bosch
citation:
ama: Nam P, Van Den Bosch H. Nonexistence in Thomas Fermi-Dirac-von Weizsäcker theory
with small nuclear charges. Mathematical Physics, Analysis and Geometry.
2017;20(2). doi:10.1007/s11040-017-9238-0
apa: Nam, P., & Van Den Bosch, H. (2017). Nonexistence in Thomas Fermi-Dirac-von
Weizsäcker theory with small nuclear charges. Mathematical Physics, Analysis
and Geometry. Springer. https://doi.org/10.1007/s11040-017-9238-0
chicago: Nam, Phan, and Hanne Van Den Bosch. “Nonexistence in Thomas Fermi-Dirac-von
Weizsäcker Theory with Small Nuclear Charges.” Mathematical Physics, Analysis
and Geometry. Springer, 2017. https://doi.org/10.1007/s11040-017-9238-0.
ieee: P. Nam and H. Van Den Bosch, “Nonexistence in Thomas Fermi-Dirac-von Weizsäcker
theory with small nuclear charges,” Mathematical Physics, Analysis and Geometry,
vol. 20, no. 2. Springer, 2017.
ista: Nam P, Van Den Bosch H. 2017. Nonexistence in Thomas Fermi-Dirac-von Weizsäcker
theory with small nuclear charges. Mathematical Physics, Analysis and Geometry.
20(2), 6.
mla: Nam, Phan, and Hanne Van Den Bosch. “Nonexistence in Thomas Fermi-Dirac-von
Weizsäcker Theory with Small Nuclear Charges.” Mathematical Physics, Analysis
and Geometry, vol. 20, no. 2, 6, Springer, 2017, doi:10.1007/s11040-017-9238-0.
short: P. Nam, H. Van Den Bosch, Mathematical Physics, Analysis and Geometry 20
(2017).
date_created: 2018-12-11T11:50:02Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-06-04T08:11:50Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s11040-017-9238-0
external_id:
arxiv:
- '1603.07368'
isi:
- '000401270000004'
intvolume: ' 20'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1603.07368
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _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: Mathematical Physics, Analysis and Geometry
publication_identifier:
issn:
- 1385-0172
publication_status: published
publisher: Springer
publist_id: '6300'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nonexistence in Thomas Fermi-Dirac-von Weizsäcker theory with small nuclear
charges
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20
year: '2017'
...
---
_id: '1080'
abstract:
- lang: eng
text: Reconstructing the evolutionary history of metastases is critical for understanding
their basic biological principles and has profound clinical implications. Genome-wide
sequencing data has enabled modern phylogenomic methods to accurately dissect
subclones and their phylogenies from noisy and impure bulk tumour samples at unprecedented
depth. However, existing methods are not designed to infer metastatic seeding
patterns. Here we develop a tool, called Treeomics, to reconstruct the phylogeny
of metastases and map subclones to their anatomic locations. Treeomics infers
comprehensive seeding patterns for pancreatic, ovarian, and prostate cancers.
Moreover, Treeomics correctly disambiguates true seeding patterns from sequencing
artifacts; 7% of variants were misclassified by conventional statistical methods.
These artifacts can skew phylogenies by creating illusory tumour heterogeneity
among distinct samples. In silico benchmarking on simulated tumour phylogenies
across a wide range of sample purities (15–95%) and sequencing depths (25-800
× ) demonstrates the accuracy of Treeomics compared with existing methods.
article_number: '14114'
article_processing_charge: No
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Alvin
full_name: Makohon Moore, Alvin
last_name: Makohon Moore
- first_name: Jeffrey
full_name: Gerold, Jeffrey
last_name: Gerold
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Christine
full_name: Iacobuzio Donahue, Christine
last_name: Iacobuzio Donahue
- first_name: Bert
full_name: Vogelstein, Bert
last_name: Vogelstein
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Reiter J, Makohon Moore A, Gerold J, et al. Reconstructing metastatic seeding
patterns of human cancers. Nature Communications. 2017;8. doi:10.1038/ncomms14114
apa: Reiter, J., Makohon Moore, A., Gerold, J., Božić, I., Chatterjee, K., Iacobuzio
Donahue, C., … Nowak, M. (2017). Reconstructing metastatic seeding patterns of
human cancers. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms14114
chicago: Reiter, Johannes, Alvin Makohon Moore, Jeffrey Gerold, Ivana Božić, Krishnendu
Chatterjee, Christine Iacobuzio Donahue, Bert Vogelstein, and Martin Nowak. “Reconstructing
Metastatic Seeding Patterns of Human Cancers.” Nature Communications. Nature
Publishing Group, 2017. https://doi.org/10.1038/ncomms14114.
ieee: J. Reiter et al., “Reconstructing metastatic seeding patterns of human
cancers,” Nature Communications, vol. 8. Nature Publishing Group, 2017.
ista: Reiter J, Makohon Moore A, Gerold J, Božić I, Chatterjee K, Iacobuzio Donahue
C, Vogelstein B, Nowak M. 2017. Reconstructing metastatic seeding patterns of
human cancers. Nature Communications. 8, 14114.
mla: Reiter, Johannes, et al. “Reconstructing Metastatic Seeding Patterns of Human
Cancers.” Nature Communications, vol. 8, 14114, Nature Publishing Group,
2017, doi:10.1038/ncomms14114.
short: J. Reiter, A. Makohon Moore, J. Gerold, I. Božić, K. Chatterjee, C. Iacobuzio
Donahue, B. Vogelstein, M. Nowak, Nature Communications 8 (2017).
date_created: 2018-12-11T11:50:02Z
date_published: 2017-01-31T00:00:00Z
date_updated: 2025-07-10T11:50:00Z
day: '31'
ddc:
- '004'
- '006'
department:
- _id: KrCh
doi: 10.1038/ncomms14114
ec_funded: 1
external_id:
isi:
- '000393096600001'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:15Z
date_updated: 2018-12-12T10:15:15Z
file_id: '5133'
file_name: IST-2017-786-v1+1_ncomms14114.pdf
file_size: 897050
relation: main_file
file_date_updated: 2018-12-12T10:15:15Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Nature Publishing Group
publist_id: '6301'
pubrep_id: '786'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reconstructing metastatic seeding patterns of human cancers
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2017'
...
---
_id: '791'
abstract:
- lang: eng
text: 'Consider the following random process: we are given n queues, into which
elements of increasing labels are inserted uniformly at random. To remove an element,
we pick two queues at random, and remove the element of lower label (higher priority)
among the two. The cost of a removal is the rank of the label removed, among labels
still present in any of the queues, that is, the distance from the optimal choice
at each step. Variants of this strategy are prevalent in state-of-the-art concurrent
priority queue implementations. Nonetheless, it is not known whether such implementations
provide any rank guarantees, even in a sequential model. We answer this question,
showing that this strategy provides surprisingly strong guarantees: Although the
single-choice process, where we always insert and remove from a single randomly
chosen queue, has degrading cost, going to infinity as we increase the number
of steps, in the two choice process, the expected rank of a removed element is
O(n) while the expected worst-case cost is O(n log n). These bounds are tight,
and hold irrespective of the number of steps for which we run the process. The
argument is based on a new technical connection between "heavily loaded"
balls-into-bins processes and priority scheduling. Our analytic results inspire
a new concurrent priority queue implementation, which improves upon the state
of the art in terms of practical performance.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Justin
full_name: Kopinsky, Justin
last_name: Kopinsky
- first_name: Jerry
full_name: Li, Jerry
last_name: Li
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
citation:
ama: 'Alistarh D-A, Kopinsky J, Li J, Nadiradze G. The power of choice in priority
scheduling. In: Proceedings of the ACM Symposium on Principles of Distributed
Computing. Vol Part F129314. ACM; 2017:283-292. doi:10.1145/3087801.3087810'
apa: 'Alistarh, D.-A., Kopinsky, J., Li, J., & Nadiradze, G. (2017). The power
of choice in priority scheduling. In Proceedings of the ACM Symposium on Principles
of Distributed Computing (Vol. Part F129314, pp. 283–292). Washington, WA,
USA: ACM. https://doi.org/10.1145/3087801.3087810'
chicago: Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Giorgi Nadiradze.
“The Power of Choice in Priority Scheduling.” In Proceedings of the ACM Symposium
on Principles of Distributed Computing, Part F129314:283–92. ACM, 2017. https://doi.org/10.1145/3087801.3087810.
ieee: D.-A. Alistarh, J. Kopinsky, J. Li, and G. Nadiradze, “The power of choice
in priority scheduling,” in Proceedings of the ACM Symposium on Principles
of Distributed Computing, Washington, WA, USA, 2017, vol. Part F129314, pp.
283–292.
ista: 'Alistarh D-A, Kopinsky J, Li J, Nadiradze G. 2017. The power of choice in
priority scheduling. Proceedings of the ACM Symposium on Principles of Distributed
Computing. PODC: Principles of Distributed Computing vol. Part F129314, 283–292.'
mla: Alistarh, Dan-Adrian, et al. “The Power of Choice in Priority Scheduling.”
Proceedings of the ACM Symposium on Principles of Distributed Computing,
vol. Part F129314, ACM, 2017, pp. 283–92, doi:10.1145/3087801.3087810.
short: D.-A. Alistarh, J. Kopinsky, J. Li, G. Nadiradze, in:, Proceedings of the
ACM Symposium on Principles of Distributed Computing, ACM, 2017, pp. 283–292.
conference:
end_date: 2017-07-27
location: Washington, WA, USA
name: 'PODC: Principles of Distributed Computing'
start_date: 2017-07-25
date_created: 2018-12-11T11:48:31Z
date_published: 2017-07-26T00:00:00Z
date_updated: 2025-06-04T09:44:47Z
day: '26'
department:
- _id: DaAl
doi: 10.1145/3087801.3087810
external_id:
arxiv:
- '1706.04178'
isi:
- '000462995000035'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1706.04178
month: '07'
oa: 1
oa_version: Submitted Version
page: 283 - 292
publication: Proceedings of the ACM Symposium on Principles of Distributed Computing
publication_identifier:
isbn:
- 978-145034992-5
publication_status: published
publisher: ACM
publist_id: '6864'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The power of choice in priority scheduling
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: Part F129314
year: '2017'
...
---
_id: '792'
abstract:
- lang: eng
text: The chaotic dynamics of low-dimensional systems, such as Lorenz or Rössler
flows, is guided by the infinity of periodic orbits embedded in their strange
attractors. Whether this is also the case for the infinite-dimensional dynamics
of Navier–Stokes equations has long been speculated, and is a topic of ongoing
study. Periodic and relative periodic solutions have been shown to be involved
in transitions to turbulence. Their relevance to turbulent dynamics – specifically,
whether periodic orbits play the same role in high-dimensional nonlinear systems
like the Navier–Stokes equations as they do in lower-dimensional systems – is
the focus of the present investigation. We perform here a detailed study of pipe
flow relative periodic orbits with energies and mean dissipations close to turbulent
values. We outline several approaches to reduction of the translational symmetry
of the system. We study pipe flow in a minimal computational cell at Re=2500,
and report a library of invariant solutions found with the aid of the method of
slices. Detailed study of the unstable manifolds of a sample of these solutions
is consistent with the picture that relative periodic orbits are embedded in the
chaotic saddle and that they guide the turbulent dynamics.
article_processing_charge: No
arxiv: 1
author:
- first_name: Nazmi B
full_name: Budanur, Nazmi B
id: 3EA1010E-F248-11E8-B48F-1D18A9856A87
last_name: Budanur
orcid: 0000-0003-0423-5010
- first_name: Kimberly
full_name: Short, Kimberly
last_name: Short
- first_name: Mohammad
full_name: Farazmand, Mohammad
last_name: Farazmand
- first_name: Ashley
full_name: Willis, Ashley
last_name: Willis
- first_name: Predrag
full_name: Cvitanović, Predrag
last_name: Cvitanović
citation:
ama: Budanur NB, Short K, Farazmand M, Willis A, Cvitanović P. Relative periodic
orbits form the backbone of turbulent pipe flow. Journal of Fluid Mechanics.
2017;833:274-301. doi:10.1017/jfm.2017.699
apa: Budanur, N. B., Short, K., Farazmand, M., Willis, A., & Cvitanović, P.
(2017). Relative periodic orbits form the backbone of turbulent pipe flow. Journal
of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2017.699
chicago: Budanur, Nazmi B, Kimberly Short, Mohammad Farazmand, Ashley Willis, and
Predrag Cvitanović. “Relative Periodic Orbits Form the Backbone of Turbulent Pipe
Flow.” Journal of Fluid Mechanics. Cambridge University Press, 2017. https://doi.org/10.1017/jfm.2017.699.
ieee: N. B. Budanur, K. Short, M. Farazmand, A. Willis, and P. Cvitanović, “Relative
periodic orbits form the backbone of turbulent pipe flow,” Journal of Fluid
Mechanics, vol. 833. Cambridge University Press, pp. 274–301, 2017.
ista: Budanur NB, Short K, Farazmand M, Willis A, Cvitanović P. 2017. Relative periodic
orbits form the backbone of turbulent pipe flow. Journal of Fluid Mechanics. 833,
274–301.
mla: Budanur, Nazmi B., et al. “Relative Periodic Orbits Form the Backbone of Turbulent
Pipe Flow.” Journal of Fluid Mechanics, vol. 833, Cambridge University
Press, 2017, pp. 274–301, doi:10.1017/jfm.2017.699.
short: N.B. Budanur, K. Short, M. Farazmand, A. Willis, P. Cvitanović, Journal of
Fluid Mechanics 833 (2017) 274–301.
date_created: 2018-12-11T11:48:32Z
date_published: 2017-12-25T00:00:00Z
date_updated: 2025-06-04T09:45:57Z
day: '25'
department:
- _id: BjHo
doi: 10.1017/jfm.2017.699
external_id:
arxiv:
- '1705.03720'
isi:
- '000414641700001'
intvolume: ' 833'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.03720
month: '12'
oa: 1
oa_version: Submitted Version
page: 274 - 301
project:
- _id: 25636330-B435-11E9-9278-68D0E5697425
grant_number: 11-NSF-1070
name: Genome-wide Analysis of Root Traits
publication: Journal of Fluid Mechanics
publication_identifier:
issn:
- 0022-1120
publication_status: published
publisher: Cambridge University Press
publist_id: '6862'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Relative periodic orbits form the backbone of turbulent pipe flow
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 833
year: '2017'
...
---
_id: '793'
abstract:
- lang: eng
text: 'Let P be a finite point set in the plane. A cordinary triangle in P is a
subset of P consisting of three non-collinear points such that each of the three
lines determined by the three points contains at most c points of P . Motivated
by a question of Erdös, and answering a question of de Zeeuw, we prove that there
exists a constant c > 0such that P contains a c-ordinary triangle, provided
that P is not contained in the union of two lines. Furthermore, the number of
c-ordinary triangles in P is Ω(| P |). '
article_processing_charge: No
arxiv: 1
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Hossein
full_name: Mojarrad, Hossein
last_name: Mojarrad
- first_name: Márton
full_name: Naszódi, Márton
last_name: Naszódi
- first_name: József
full_name: Solymosi, József
last_name: Solymosi
- first_name: Sebastian
full_name: Stich, Sebastian
last_name: Stich
- first_name: May
full_name: Szedlák, May
last_name: Szedlák
citation:
ama: 'Fulek R, Mojarrad H, Naszódi M, Solymosi J, Stich S, Szedlák M. On the existence
of ordinary triangles. Computational Geometry: Theory and Applications.
2017;66:28-31. doi:10.1016/j.comgeo.2017.07.002'
apa: 'Fulek, R., Mojarrad, H., Naszódi, M., Solymosi, J., Stich, S., & Szedlák,
M. (2017). On the existence of ordinary triangles. Computational Geometry:
Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2017.07.002'
chicago: 'Fulek, Radoslav, Hossein Mojarrad, Márton Naszódi, József Solymosi, Sebastian
Stich, and May Szedlák. “On the Existence of Ordinary Triangles.” Computational
Geometry: Theory and Applications. Elsevier, 2017. https://doi.org/10.1016/j.comgeo.2017.07.002.'
ieee: 'R. Fulek, H. Mojarrad, M. Naszódi, J. Solymosi, S. Stich, and M. Szedlák,
“On the existence of ordinary triangles,” Computational Geometry: Theory and
Applications, vol. 66. Elsevier, pp. 28–31, 2017.'
ista: 'Fulek R, Mojarrad H, Naszódi M, Solymosi J, Stich S, Szedlák M. 2017. On
the existence of ordinary triangles. Computational Geometry: Theory and Applications.
66, 28–31.'
mla: 'Fulek, Radoslav, et al. “On the Existence of Ordinary Triangles.” Computational
Geometry: Theory and Applications, vol. 66, Elsevier, 2017, pp. 28–31, doi:10.1016/j.comgeo.2017.07.002.'
short: 'R. Fulek, H. Mojarrad, M. Naszódi, J. Solymosi, S. Stich, M. Szedlák, Computational
Geometry: Theory and Applications 66 (2017) 28–31.'
date_created: 2018-12-11T11:48:32Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2026-04-16T09:57:17Z
day: '01'
department:
- _id: UlWa
doi: 10.1016/j.comgeo.2017.07.002
ec_funded: 1
external_id:
arxiv:
- '1701.08183'
isi:
- '000412039700003'
intvolume: ' 66'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1701.08183
month: '01'
oa: 1
oa_version: Submitted Version
page: 28 - 31
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: 'Computational Geometry: Theory and Applications'
publication_identifier:
issn:
- 0925-7721
publication_status: published
publisher: Elsevier
publist_id: '6861'
quality_controlled: '1'
status: public
title: On the existence of ordinary triangles
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 66
year: '2017'
...
---
_id: '794'
abstract:
- lang: eng
text: We show that c-planarity is solvable in quadratic time for flat clustered
graphs with three clusters if the combinatorial embedding of the underlying graph
is fixed. In simpler graph-theoretical terms our result can be viewed as follows.
Given a graph G with the vertex set partitioned into three parts embedded on a
2-sphere, our algorithm decides if we can augment G by adding edges without creating
an edge-crossing so that in the resulting spherical graph the vertices of each
part induce a connected sub-graph. We proceed by a reduction to the problem of
testing the existence of a perfect matching in planar bipartite graphs. We formulate
our result in a slightly more general setting of cyclic clustered graphs, i.e.,
the simple graph obtained by contracting each cluster, where we disregard loops
and multi-edges, is a cycle.
acknowledgement: I would like to thank Jan Kynčl, Dömötör Pálvölgyi and anonymous
referees for many comments and suggestions that helped to improve the presentation
of the result.
article_processing_charge: No
arxiv: 1
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
citation:
ama: 'Fulek R. C-planarity of embedded cyclic c-graphs. Computational Geometry:
Theory and Applications. 2017;66:1-13. doi:10.1016/j.comgeo.2017.06.016'
apa: 'Fulek, R. (2017). C-planarity of embedded cyclic c-graphs. Computational
Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2017.06.016'
chicago: 'Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs.” Computational
Geometry: Theory and Applications. Elsevier, 2017. https://doi.org/10.1016/j.comgeo.2017.06.016.'
ieee: 'R. Fulek, “C-planarity of embedded cyclic c-graphs,” Computational Geometry:
Theory and Applications, vol. 66. Elsevier, pp. 1–13, 2017.'
ista: 'Fulek R. 2017. C-planarity of embedded cyclic c-graphs. Computational Geometry:
Theory and Applications. 66, 1–13.'
mla: 'Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs.” Computational
Geometry: Theory and Applications, vol. 66, Elsevier, 2017, pp. 1–13, doi:10.1016/j.comgeo.2017.06.016.'
short: 'R. Fulek, Computational Geometry: Theory and Applications 66 (2017) 1–13.'
date_created: 2018-12-11T11:48:32Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2025-09-22T09:54:02Z
day: '01'
department:
- _id: UlWa
doi: 10.1016/j.comgeo.2017.06.016
external_id:
arxiv:
- '1602.01346'
isi:
- '000412039700001'
intvolume: ' 66'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.01346
month: '12'
oa: 1
oa_version: Preprint
page: 1 - 13
publication: 'Computational Geometry: Theory and Applications'
publication_status: published
publisher: Elsevier
publist_id: '6860'
quality_controlled: '1'
related_material:
record:
- id: '1165'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: C-planarity of embedded cyclic c-graphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2017'
...
---
_id: '796'
abstract:
- lang: eng
text: We present the fabrication and characterization of an aluminum transmon qubit
on a silicon-on-insulator substrate. Key to the qubit fabrication is the use of
an anhydrous hydrofluoric vapor process which selectively removes the lossy silicon
oxide buried underneath the silicon device layer. For a 5.6 GHz qubit measured
dispersively by a 7.1 GHz resonator, we find T1 = 3.5 μs and T∗2 = 2.2 μs. This
process in principle permits the co-fabrication of silicon photonic and mechanical
elements, providing a route towards chip-scale integration of electro-opto-mechanical
transducers for quantum networking of superconducting microwave quantum circuits.
The additional processing steps are compatible with established fabrication techniques
for aluminum transmon qubits on silicon.
acknowledgement: This work was supported by the AFOSR MURI Quantum Photonic Matter
(Grant No. 16RT0696), the AFOSR MURI Wiring Quantum Networks with Mechanical Transducers
(Grant No. FA9550-15-1-0015), the Institute for Quantum Information and Matter,
an NSF Physics Frontiers Center (Grant No. PHY-1125565) with the support of the
Gordon and Betty Moore Foundation, and the Kavli Nanoscience Institute at Caltech.
A.J.K. acknowledges the IQIM Postdoctoral Fellowship.
article_number: '042603'
article_processing_charge: No
arxiv: 1
author:
- first_name: Andrew J
full_name: Keller, Andrew J
last_name: Keller
- first_name: Paul
full_name: Dieterle, Paul
last_name: Dieterle
- first_name: Michael
full_name: Fang, Michael
last_name: Fang
- first_name: Brett
full_name: Berger, Brett
last_name: Berger
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: Oskar
full_name: Painter, Oskar
last_name: Painter
citation:
ama: Keller AJ, Dieterle P, Fang M, Berger B, Fink JM, Painter O. Al transmon qubits
on silicon on insulator for quantum device integration. Applied Physics Letters.
2017;111(4). doi:10.1063/1.4994661
apa: Keller, A. J., Dieterle, P., Fang, M., Berger, B., Fink, J. M., & Painter,
O. (2017). Al transmon qubits on silicon on insulator for quantum device integration.
Applied Physics Letters. American Institute of Physics. https://doi.org/10.1063/1.4994661
chicago: Keller, Andrew J, Paul Dieterle, Michael Fang, Brett Berger, Johannes M
Fink, and Oskar Painter. “Al Transmon Qubits on Silicon on Insulator for Quantum
Device Integration.” Applied Physics Letters. American Institute of Physics,
2017. https://doi.org/10.1063/1.4994661.
ieee: A. J. Keller, P. Dieterle, M. Fang, B. Berger, J. M. Fink, and O. Painter,
“Al transmon qubits on silicon on insulator for quantum device integration,” Applied
Physics Letters, vol. 111, no. 4. American Institute of Physics, 2017.
ista: Keller AJ, Dieterle P, Fang M, Berger B, Fink JM, Painter O. 2017. Al transmon
qubits on silicon on insulator for quantum device integration. Applied Physics
Letters. 111(4), 042603.
mla: Keller, Andrew J., et al. “Al Transmon Qubits on Silicon on Insulator for Quantum
Device Integration.” Applied Physics Letters, vol. 111, no. 4, 042603,
American Institute of Physics, 2017, doi:10.1063/1.4994661.
short: A.J. Keller, P. Dieterle, M. Fang, B. Berger, J.M. Fink, O. Painter, Applied
Physics Letters 111 (2017).
date_created: 2018-12-11T11:48:33Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2025-06-04T09:48:41Z
day: '01'
department:
- _id: JoFi
doi: 10.1063/1.4994661
external_id:
arxiv:
- '1703.10195'
isi:
- '000406779700031'
intvolume: ' 111'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.10195
month: '07'
oa: 1
oa_version: Submitted Version
publication: Applied Physics Letters
publication_identifier:
issn:
- 0003-6951
publication_status: published
publisher: American Institute of Physics
publist_id: '6857'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Al transmon qubits on silicon on insulator for quantum device integration
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 111
year: '2017'
...
---
_id: '797'
abstract:
- lang: ger
text: Phasenübergänge helfen beim Verständnis von Vielteilchensystemen in der Festkörperphysik
und Fluiddynamik bis hin zur Teilchenphysik. Unserer internationalen Kollaboration
ist es gelungen, einen neuartigen Phasenübergang in einem Quantensystem zu beobachten
[1]. In einem Mikrowellenresonator konnte erstmals die spontane Zustandsänderung
von undurchsichtig zu transparent nachgewiesen werden.
article_processing_charge: No
article_type: original
author:
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: Fink JM. Photonenblockade aufgelöst. Physik in unserer Zeit. 2017;48(3):111-113.
doi:10.1002/piuz.201770305
apa: Fink, J. M. (2017). Photonenblockade aufgelöst. Physik in Unserer Zeit.
Wiley. https://doi.org/10.1002/piuz.201770305
chicago: Fink, Johannes M. “Photonenblockade Aufgelöst.” Physik in Unserer Zeit.
Wiley, 2017. https://doi.org/10.1002/piuz.201770305.
ieee: J. M. Fink, “Photonenblockade aufgelöst,” Physik in unserer Zeit, vol.
48, no. 3. Wiley, pp. 111–113, 2017.
ista: Fink JM. 2017. Photonenblockade aufgelöst. Physik in unserer Zeit. 48(3),
111–113.
mla: Fink, Johannes M. “Photonenblockade Aufgelöst.” Physik in Unserer Zeit,
vol. 48, no. 3, Wiley, 2017, pp. 111–13, doi:10.1002/piuz.201770305.
short: J.M. Fink, Physik in Unserer Zeit 48 (2017) 111–113.
corr_author: '1'
date_created: 2018-12-11T11:48:33Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2024-10-09T20:57:34Z
day: '01'
department:
- _id: JoFi
doi: 10.1002/piuz.201770305
intvolume: ' 48'
issue: '3'
language:
- iso: eng
month: '05'
oa_version: None
page: 111 - 113
publication: Physik in unserer Zeit
publication_status: published
publisher: Wiley
publist_id: '6856'
quality_controlled: '1'
status: public
title: Photonenblockade aufgelöst
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2017'
...
---
_id: '798'
abstract:
- lang: eng
text: Nonreciprocal circuit elements form an integral part of modern measurement
and communication systems. Mathematically they require breaking of time-reversal
symmetry, typically achieved using magnetic materials and more recently using
the quantum Hall effect, parametric permittivity modulation or Josephson nonlinearities.
Here we demonstrate an on-chip magnetic-free circulator based on reservoir-engineered
electromechanic interactions. Directional circulation is achieved with controlled
phase-sensitive interference of six distinct electro-mechanical signal conversion
paths. The presented circulator is compact, its silicon-on-insulator platform
is compatible with both superconducting qubits and silicon photonics, and its
noise performance is close to the quantum limit. With a high dynamic range, a
tunable bandwidth of up to 30 MHz and an in situ reconfigurability as beam splitter
or wavelength converter, it could pave the way for superconducting qubit processors
with multiplexed on-chip signal processing and readout.
article_number: '1304'
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Shabir
full_name: Barzanjeh, Shabir
id: 2D25E1F6-F248-11E8-B48F-1D18A9856A87
last_name: Barzanjeh
orcid: 0000-0003-0415-1423
- first_name: Matthias
full_name: Wulf, Matthias
id: 45598606-F248-11E8-B48F-1D18A9856A87
last_name: Wulf
orcid: 0000-0001-6613-1378
- first_name: Matilda
full_name: Peruzzo, Matilda
id: 3F920B30-F248-11E8-B48F-1D18A9856A87
last_name: Peruzzo
orcid: 0000-0002-3415-4628
- first_name: Mahmoud
full_name: Kalaee, Mahmoud
last_name: Kalaee
- first_name: Paul
full_name: Dieterle, Paul
last_name: Dieterle
- first_name: Oskar
full_name: Painter, Oskar
last_name: Painter
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: Barzanjeh S, Wulf M, Peruzzo M, et al. Mechanical on chip microwave circulator.
Nature Communications. 2017;8(1). doi:10.1038/s41467-017-01304-x
apa: Barzanjeh, S., Wulf, M., Peruzzo, M., Kalaee, M., Dieterle, P., Painter, O.,
& Fink, J. M. (2017). Mechanical on chip microwave circulator. Nature Communications.
Nature Publishing Group. https://doi.org/10.1038/s41467-017-01304-x
chicago: Barzanjeh, Shabir, Matthias Wulf, Matilda Peruzzo, Mahmoud Kalaee, Paul
Dieterle, Oskar Painter, and Johannes M Fink. “Mechanical on Chip Microwave Circulator.”
Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/s41467-017-01304-x.
ieee: S. Barzanjeh et al., “Mechanical on chip microwave circulator,” Nature
Communications, vol. 8, no. 1. Nature Publishing Group, 2017.
ista: Barzanjeh S, Wulf M, Peruzzo M, Kalaee M, Dieterle P, Painter O, Fink JM.
2017. Mechanical on chip microwave circulator. Nature Communications. 8(1), 1304.
mla: Barzanjeh, Shabir, et al. “Mechanical on Chip Microwave Circulator.” Nature
Communications, vol. 8, no. 1, 1304, Nature Publishing Group, 2017, doi:10.1038/s41467-017-01304-x.
short: S. Barzanjeh, M. Wulf, M. Peruzzo, M. Kalaee, P. Dieterle, O. Painter, J.M.
Fink, Nature Communications 8 (2017).
corr_author: '1'
date_created: 2018-12-11T11:48:33Z
date_published: 2017-10-16T00:00:00Z
date_updated: 2025-07-10T11:54:54Z
day: '16'
ddc:
- '539'
department:
- _id: JoFi
doi: 10.1038/s41467-017-01304-x
ec_funded: 1
external_id:
isi:
- '000412999700021'
file:
- access_level: open_access
checksum: b68dafa71d1834c23b742cd9987a3d5f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:25Z
date_updated: 2020-07-14T12:48:06Z
file_id: '5145'
file_name: IST-2017-867-v1+1_s41467-017-01304-x.pdf
file_size: 1467696
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
issue: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 257EB838-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '732894'
name: Hybrid Optomechanical Technologies
- _id: 258047B6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '707438'
name: 'Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination
with cavity Optomechanics'
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Nature Publishing Group
publist_id: '6855'
pubrep_id: '867'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mechanical on chip microwave circulator
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2017'
...
---
_id: '799'
abstract:
- lang: eng
text: Membrane traffic at the trans-Golgi network (TGN) is crucial for correctly
distributing various membrane proteins to their destination. Polarly localized
auxin efflux proteins, including PIN-FORMED1 (PIN1), are dynamically transported
between the endosomes and the plasma membrane (PM) in the plant cells. The intracellular
trafficking of PIN1 protein is sensitive to a fungal toxin brefeldin A (BFA),
which is known to inhibit guanine-nucleotide exchange factors for ADP ribosylation
factors (ARF GEFs) such as GNOM. However, the molecular details of the BFA-sensitive
trafficking pathway have not been revealed fully. In a previous study, we have
identified an Arabidopsis mutant BFA-visualized endocytic trafficking defective
3 (ben3) which exhibited reduced sensitivity to BFA in terms of BFA-induced intracellular
PIN1 agglomeration. Here, we show that BEN3 encodes a member of BIG family ARF
GEFs, BIG2. Fluorescent proteins tagged BEN3/BIG2 co-localized with markers for
TGN / early endosome (EE). Inspection of conditionally induced de novo synthesized
PIN1 confirmed that its secretion to the PM is BFA-sensitive and established BEN3/BIG2
as a crucial component of this BFA action at the level of TGN/EE. Furthermore,
ben3 mutation alleviated BFA-induced agglomeration of another TGN-localized ARF
GEF BEN1/MIN7. Taken together our results suggest that BEN3/BIG2 is an ARF GEF
component, which confers BFA sensitivity to the TGN/EE in Arabidopsis.
article_number: 1801-1811
article_processing_charge: No
author:
- first_name: Saeko
full_name: Kitakura, Saeko
last_name: Kitakura
- first_name: Maciek
full_name: Adamowski, Maciek
id: 45F536D2-F248-11E8-B48F-1D18A9856A87
last_name: Adamowski
orcid: 0000-0001-6463-5257
- first_name: Yuki
full_name: Matsuura, Yuki
last_name: Matsuura
- first_name: Luca
full_name: Santuari, Luca
last_name: Santuari
- first_name: Hirotaka
full_name: Kouno, Hirotaka
last_name: Kouno
- first_name: Kohei
full_name: Arima, Kohei
last_name: Arima
- first_name: Christian
full_name: Hardtke, Christian
last_name: Hardtke
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Tatsuo
full_name: Kakimoto, Tatsuo
last_name: Kakimoto
- first_name: Hirokazu
full_name: Tanaka, Hirokazu
last_name: Tanaka
citation:
ama: Kitakura S, Adamowski M, Matsuura Y, et al. BEN3/BIG2 ARF GEF is involved in
brefeldin a-sensitive trafficking at the trans-Golgi network/early endosome in
Arabidopsis thaliana. Plant and Cell Physiology. 2017;58(10). doi:10.1093/pcp/pcx118
apa: Kitakura, S., Adamowski, M., Matsuura, Y., Santuari, L., Kouno, H., Arima,
K., … Tanaka, H. (2017). BEN3/BIG2 ARF GEF is involved in brefeldin a-sensitive
trafficking at the trans-Golgi network/early endosome in Arabidopsis thaliana.
Plant and Cell Physiology. Oxford University Press. https://doi.org/10.1093/pcp/pcx118
chicago: Kitakura, Saeko, Maciek Adamowski, Yuki Matsuura, Luca Santuari, Hirotaka
Kouno, Kohei Arima, Christian Hardtke, Jiří Friml, Tatsuo Kakimoto, and Hirokazu
Tanaka. “BEN3/BIG2 ARF GEF Is Involved in Brefeldin a-Sensitive Trafficking at
the Trans-Golgi Network/Early Endosome in Arabidopsis Thaliana.” Plant and
Cell Physiology. Oxford University Press, 2017. https://doi.org/10.1093/pcp/pcx118.
ieee: S. Kitakura et al., “BEN3/BIG2 ARF GEF is involved in brefeldin a-sensitive
trafficking at the trans-Golgi network/early endosome in Arabidopsis thaliana,”
Plant and Cell Physiology, vol. 58, no. 10. Oxford University Press, 2017.
ista: Kitakura S, Adamowski M, Matsuura Y, Santuari L, Kouno H, Arima K, Hardtke
C, Friml J, Kakimoto T, Tanaka H. 2017. BEN3/BIG2 ARF GEF is involved in brefeldin
a-sensitive trafficking at the trans-Golgi network/early endosome in Arabidopsis
thaliana. Plant and Cell Physiology. 58(10), 1801–1811.
mla: Kitakura, Saeko, et al. “BEN3/BIG2 ARF GEF Is Involved in Brefeldin a-Sensitive
Trafficking at the Trans-Golgi Network/Early Endosome in Arabidopsis Thaliana.”
Plant and Cell Physiology, vol. 58, no. 10, 1801–1811, Oxford University
Press, 2017, doi:10.1093/pcp/pcx118.
short: S. Kitakura, M. Adamowski, Y. Matsuura, L. Santuari, H. Kouno, K. Arima,
C. Hardtke, J. Friml, T. Kakimoto, H. Tanaka, Plant and Cell Physiology 58 (2017).
date_created: 2018-12-11T11:48:34Z
date_published: 2017-08-21T00:00:00Z
date_updated: 2025-07-10T11:54:55Z
day: '21'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.1093/pcp/pcx118
external_id:
isi:
- '000413220400019'
pmid:
- '29016942'
file:
- access_level: open_access
checksum: bd3e3a94d55416739cbb19624bb977f8
content_type: application/pdf
creator: dernst
date_created: 2019-04-17T07:52:34Z
date_updated: 2020-07-14T12:48:06Z
file_id: '6333'
file_name: 2017_PlantCellPhysio_Kitakura.pdf
file_size: 1352913
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 58'
isi: 1
issue: '10'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
pmid: 1
publication: Plant and Cell Physiology
publication_identifier:
issn:
- 0032-0781
publication_status: published
publisher: Oxford University Press
publist_id: '6854'
pubrep_id: '1009'
quality_controlled: '1'
scopus_import: '1'
status: public
title: BEN3/BIG2 ARF GEF is involved in brefeldin a-sensitive trafficking at the trans-Golgi
network/early endosome in Arabidopsis thaliana
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2017'
...
---
_id: '800'
abstract:
- lang: eng
text: Gamma oscillations (30–150 Hz) in neuronal networks are associated with the
processing and recall of information. We measured local field potentials in the
dentate gyrus of freely moving mice and found that gamma activity occurs in bursts,
which are highly heterogeneous in their spatial extensions, ranging from focal
to global coherent events. Synaptic communication among perisomatic-inhibitory
interneurons (PIIs) is thought to play an important role in the generation of
hippocampal gamma patterns. However, how neuronal circuits can generate synchronous
oscillations at different spatial scales is unknown. We analyzed paired recordings
in dentate gyrus slices and show that synaptic signaling at interneuron-interneuron
synapses is distance dependent. Synaptic strength declines whereas the duration
of inhibitory signals increases with axonal distance among interconnected PIIs.
Using neuronal network modeling, we show that distance-dependent inhibition generates
multiple highly synchronous focal gamma bursts allowing the network to process
complex inputs in parallel in flexibly organized neuronal centers.
article_number: '758'
article_processing_charge: No
author:
- first_name: Michael
full_name: Strüber, Michael
last_name: Strüber
- first_name: Jonas
full_name: Sauer, Jonas
last_name: Sauer
- 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: Marlene
full_name: Bartos, Marlene
last_name: Bartos
citation:
ama: Strüber M, Sauer J, Jonas PM, Bartos M. Distance-dependent inhibition facilitates
focality of gamma oscillations in the dentate gyrus. Nature Communications.
2017;8(1). doi:10.1038/s41467-017-00936-3
apa: Strüber, M., Sauer, J., Jonas, P. M., & Bartos, M. (2017). Distance-dependent
inhibition facilitates focality of gamma oscillations in the dentate gyrus. Nature
Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-017-00936-3
chicago: Strüber, Michael, Jonas Sauer, Peter M Jonas, and Marlene Bartos. “Distance-Dependent
Inhibition Facilitates Focality of Gamma Oscillations in the Dentate Gyrus.” Nature
Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/s41467-017-00936-3.
ieee: M. Strüber, J. Sauer, P. M. Jonas, and M. Bartos, “Distance-dependent inhibition
facilitates focality of gamma oscillations in the dentate gyrus,” Nature Communications,
vol. 8, no. 1. Nature Publishing Group, 2017.
ista: Strüber M, Sauer J, Jonas PM, Bartos M. 2017. Distance-dependent inhibition
facilitates focality of gamma oscillations in the dentate gyrus. Nature Communications.
8(1), 758.
mla: Strüber, Michael, et al. “Distance-Dependent Inhibition Facilitates Focality
of Gamma Oscillations in the Dentate Gyrus.” Nature Communications, vol.
8, no. 1, 758, Nature Publishing Group, 2017, doi:10.1038/s41467-017-00936-3.
short: M. Strüber, J. Sauer, P.M. Jonas, M. Bartos, Nature Communications 8 (2017).
date_created: 2018-12-11T11:48:34Z
date_published: 2017-10-02T00:00:00Z
date_updated: 2025-07-10T11:54:59Z
day: '02'
ddc:
- '571'
department:
- _id: PeJo
doi: 10.1038/s41467-017-00936-3
ec_funded: 1
external_id:
isi:
- '000412053100004'
file:
- access_level: open_access
checksum: 7e2c7621afd5f802338e92e8619f024d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:17Z
date_updated: 2020-07-14T12:48:07Z
file_id: '5135'
file_name: IST-2017-914-v1+1_s41467-017-00936-3.pdf
file_size: 4261832
relation: main_file
file_date_updated: 2020-07-14T12:48:07Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
issue: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25C0F108-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '268548'
name: Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Nature Publishing Group
publist_id: '6853'
pubrep_id: '914'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Distance-dependent inhibition facilitates focality of gamma oscillations in
the dentate gyrus
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2017'
...