---
_id: '6378'
abstract:
- lang: eng
text: 'In today''s cryptocurrencies, Hashcash proof of work is the most commonly-adopted
approach to mining. In Hashcash, when a miner decides to add a block to the chain,
she has to solve the difficult computational puzzle of inverting a hash function.
While Hashcash has been successfully adopted in both Bitcoin and Ethereum, it
has attracted significant and harsh criticism due to its massive waste of electricity,
its carbon footprint and environmental effects, and the inherent lack of usefulness
in inverting a hash function. Various other mining protocols have been suggested,
including proof of stake, in which a miner''s chance of adding the next block
is proportional to her current balance. However, such protocols lead to a higher
entry cost for new miners who might not still have any stake in the cryptocurrency,
and can in the worst case lead to an oligopoly, where the rich have complete control
over mining. In this paper, we propose Hybrid Mining: a new mining protocol that
combines solving real-world useful problems with Hashcash. Our protocol allows
new miners to join the network by taking part in Hashcash mining without having
to own an initial stake. It also allows nodes of the network to submit hard computational
problems whose solutions are of interest in the real world, e.g.~protein folding
problems. Then, miners can choose to compete in solving these problems, in lieu
of Hashcash, for adding a new block. Hence, Hybrid Mining incentivizes miners
to solve useful problems, such as hard computational problems arising in biology,
in a distributed manner. It also gives researchers in other areas an easy-to-use
tool to outsource their hard computations to the blockchain network, which has
enormous computational power, by paying a reward to the miner who solves the problem
for them. Moreover, our protocol provides strong security guarantees and is at
least as resilient to double spending as Bitcoin.'
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: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Arash
full_name: Pourdamghani, Arash
last_name: Pourdamghani
citation:
ama: 'Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s
computational power for distributed problem solving. In: Proceedings of the
34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; 2019:374-381.
doi:10.1145/3297280.3297319'
apa: 'Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining:
Exploiting blockchain’s computational power for distributed problem solving. In
Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772,
pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319'
chicago: 'Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani.
“Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem
Solving.” In Proceedings of the 34th ACM Symposium on Applied Computing,
Part F147772:374–81. ACM, 2019. https://doi.org/10.1145/3297280.3297319.'
ieee: 'K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting
blockchain’s computational power for distributed problem solving,” in Proceedings
of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol.
Part F147772, pp. 374–381.'
ista: 'Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting
blockchain’s computational power for distributed problem solving. Proceedings
of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing
vol. Part F147772, 374–381.'
mla: 'Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational
Power for Distributed Problem Solving.” Proceedings of the 34th ACM Symposium
on Applied Computing, vol. Part F147772, ACM, 2019, pp. 374–81, doi:10.1145/3297280.3297319.'
short: K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the
34th ACM Symposium on Applied Computing, ACM, 2019, pp. 374–381.
conference:
end_date: 2019-04-12
location: Limassol, Cyprus
name: ACM Symposium on Applied Computing
start_date: 2019-04-08
date_created: 2019-05-06T12:11:36Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2024-03-28T23:30:34Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1145/3297280.3297319
ec_funded: 1
external_id:
isi:
- '000474685800049'
file:
- access_level: open_access
checksum: fbfbcd5a0c7a743862bfc3045539a614
content_type: application/pdf
creator: dernst
date_created: 2019-05-06T12:09:27Z
date_updated: 2020-07-14T12:47:29Z
file_id: '6379'
file_name: 2019_ACM_Chatterjee.pdf
file_size: 1023934
relation: main_file
file_date_updated: 2020-07-14T12:47:29Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 374-381
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Proceedings of the 34th ACM Symposium on Applied Computing
publication_identifier:
isbn:
- '9781450359337'
publication_status: published
publisher: ACM
pubrep_id: '1069'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Hybrid Mining: Exploiting blockchain’s computational power for distributed
problem solving'
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: Part F147772
year: '2019'
...
---
_id: '6175'
abstract:
- lang: eng
text: "We consider the problem of expected cost analysis over nondeterministic probabilistic
programs,\r\nwhich aims at automated methods for analyzing the resource-usage
of such programs.\r\nPrevious approaches for this problem could only handle nonnegative
bounded costs.\r\nHowever, in many scenarios, such as queuing networks or analysis
of cryptocurrency protocols,\r\nboth positive and negative costs are necessary
and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and
efficient approach to obtain polynomial bounds on the\r\nexpected accumulated
cost of nondeterministic probabilistic programs.\r\nOur approach can handle (a)
general positive and negative costs with bounded updates in\r\nvariables; and
(b) nonnegative costs with general updates to variables.\r\nWe show that several
natural examples which could not be\r\nhandled by previous approaches are captured
in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time
algorithm, while no\r\nprevious approach for cost analysis of probabilistic programs
could guarantee polynomial runtime.\r\nFinally, we show the effectiveness of our
approach using experimental results on a variety of programs for which we efficiently
synthesize tight resource-usage bounds."
article_processing_charge: No
author:
- first_name: Peixin
full_name: Wang, Peixin
last_name: Wang
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Xudong
full_name: Qin, Xudong
last_name: Qin
- first_name: Wenjun
full_name: Shi, Wenjun
last_name: Shi
citation:
ama: 'Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of
nondeterministic probabilistic programs. In: PLDI 2019: Proceedings of the
40th ACM SIGPLAN Conference on Programming Language Design and Implementation.
Association for Computing Machinery; 2019:204-220. doi:10.1145/3314221.3314581'
apa: 'Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W.
(2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019:
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design
and Implementation (pp. 204–220). Phoenix, AZ, United States: Association
for Computing Machinery. https://doi.org/10.1145/3314221.3314581'
chicago: 'Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee,
Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.”
In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming
Language Design and Implementation, 204–20. Association for Computing Machinery,
2019. https://doi.org/10.1145/3314221.3314581.'
ieee: 'P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost
analysis of nondeterministic probabilistic programs,” in PLDI 2019: Proceedings
of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation,
Phoenix, AZ, United States, 2019, pp. 204–220.'
ista: 'Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis
of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th
ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI:
Conference on Programming Language Design and Implementation, 204–220.'
mla: 'Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.”
PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language
Design and Implementation, Association for Computing Machinery, 2019, pp.
204–20, doi:10.1145/3314221.3314581.'
short: 'P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, PLDI
2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design
and Implementation, Association for Computing Machinery, 2019, pp. 204–220.'
conference:
end_date: 2019-06-26
location: Phoenix, AZ, United States
name: 'PLDI: Conference on Programming Language Design and Implementation'
start_date: 2019-06-22
date_created: 2019-03-25T10:13:25Z
date_published: 2019-06-08T00:00:00Z
date_updated: 2024-03-28T23:30:34Z
day: '08'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3314221.3314581
ec_funded: 1
external_id:
arxiv:
- '1902.04659'
isi:
- '000523190300014'
file:
- access_level: open_access
checksum: 703a5e9b8c8587f2a44085ffd9a4db64
content_type: application/pdf
creator: akafshda
date_created: 2019-03-25T10:11:22Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6176'
file_name: paper.pdf
file_size: 4051066
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
isi: 1
keyword:
- Program Cost Analysis
- Program Termination
- Probabilistic Programs
- Martingales
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 204-220
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
publication: 'PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming
Language Design and Implementation'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '5457'
relation: earlier_version
status: public
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Cost analysis of nondeterministic probabilistic programs
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '6490'
abstract:
- lang: eng
text: "Smart contracts are programs that are stored and executed on the Blockchain
and can receive, manage and transfer money (cryptocurrency units). Two important
problems regarding smart contracts are formal analysis and compiler optimization.
Formal analysis is extremely important, because smart contracts hold funds worth
billions of dollars and their code is immutable after deployment. Hence, an undetected
bug can cause significant financial losses. Compiler optimization is also crucial,
because every action of a smart contract has to be executed by every node in the
Blockchain network. Therefore, optimizations in compiling smart contracts can
lead to significant savings in computation, time and energy.\r\n\r\nTwo classical
approaches in program analysis and compiler optimization are intraprocedural and
interprocedural analysis. In intraprocedural analysis, each function is analyzed
separately, while interprocedural analysis considers the entire program. In both
cases, the analyses are usually reduced to graph problems over the control flow
graph (CFG) of the program. These graph problems are often computationally expensive.
Hence, there has been ample research on exploiting structural properties of CFGs
for efficient algorithms. One such well-studied property is the treewidth, which
is a measure of tree-likeness of graphs. It is known that intraprocedural CFGs
of structured programs have treewidth at most 6, whereas the interprocedural treewidth
cannot be bounded. This result has been used as a basis for many efficient intraprocedural
analyses.\r\n\r\nIn this paper, we explore the idea of exploiting the treewidth
of smart contracts for formal analysis and compiler optimization. First, similar
to classical programs, we show that the intraprocedural treewidth of structured
Solidity and Vyper smart contracts is at most 9. Second, for global analysis,
we prove that the interprocedural treewidth of structured smart contracts is bounded
by 10 and, in sharp contrast with classical programs, treewidth-based algorithms
can be easily applied for interprocedural analysis. Finally, we supplement our
theoretical results with experiments using a tool we implemented for computing
treewidth of smart contracts and show that the treewidth is much lower in practice.
We use 36,764 real-world Ethereum smart contracts as benchmarks and find that
they have an average treewidth of at most 3.35 for the intraprocedural case and
3.65 for the interprocedural case.\r\n"
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: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Ehsan Kafshdar
full_name: Goharshady, Ehsan Kafshdar
last_name: Goharshady
citation:
ama: 'Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts.
In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part
F147772. ACM; :400-408. doi:10.1145/3297280.3297322'
apa: 'Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth
of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing
(Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322'
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady.
“The Treewidth of Smart Contracts.” In Proceedings of the 34th ACM Symposium
on Applied Computing, Part F147772:400–408. ACM, n.d. https://doi.org/10.1145/3297280.3297322.
ieee: K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart
contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing,
Limassol, Cyprus, vol. Part F147772, pp. 400–408.
ista: 'Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts.
Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on
Applied Computing vol. Part F147772, 400–408.'
mla: Chatterjee, Krishnendu, et al. “The Treewidth of Smart Contracts.” Proceedings
of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, pp.
400–08, doi:10.1145/3297280.3297322.
short: K. Chatterjee, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the
34th ACM Symposium on Applied Computing, ACM, n.d., pp. 400–408.
conference:
end_date: 2019-04-12
location: Limassol, Cyprus
name: 'SAC: Symposium on Applied Computing'
start_date: 2019-04-08
date_created: 2019-05-26T21:59:15Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2024-03-28T23:30:34Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3297280.3297322
external_id:
isi:
- '000474685800052'
file:
- access_level: open_access
checksum: dddc20f6d9881f23b8755eb720ec9d6f
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T09:50:11Z
date_updated: 2020-07-14T12:47:32Z
file_id: '7827'
file_name: 2019_ACM_Chatterjee.pdf
file_size: 6937138
relation: main_file
file_date_updated: 2020-07-14T12:47:32Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 400-408
publication: Proceedings of the 34th ACM Symposium on Applied Computing
publication_identifier:
isbn:
- '9781450359337'
publication_status: submitted
publisher: ACM
pubrep_id: '1070'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: The treewidth of smart contracts
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: Part F147772
year: '2019'
...
---
_id: '7158'
abstract:
- lang: eng
text: "Interprocedural analysis is at the heart of numerous applications in programming
languages, such as alias analysis, constant propagation, and so on. Recursive
state machines (RSMs) are standard models for interprocedural analysis. We consider
a general framework with RSMs where the transitions are labeled from a semiring
and path properties are algebraic with semiring operations. RSMs with algebraic
path properties can model interprocedural dataflow analysis problems, the shortest
path problem, the most probable path problem, and so on. The traditional algorithms
for interprocedural analysis focus on path properties where the starting point
is fixed as the entry point of a specific method. In this work, we consider possible
multiple queries as required in many applications such as in alias analysis. The
study of multiple queries allows us to bring in an important algorithmic distinction
between the resource usage of the one-time preprocessing vs for each individual
query. The second aspect we consider is that the control flow graphs for most
programs have constant treewidth.\r\n\r\nOur main contributions are simple and
implementable algorithms that support multiple queries for algebraic path properties
for RSMs that have constant treewidth. Our theoretical results show that our algorithms
have small additional one-time preprocessing but can answer subsequent queries
significantly faster as compared to the current algorithmic solutions for interprocedural
dataflow analysis. We have also implemented our algorithms and evaluated their
performance for performing on-demand interprocedural dataflow analysis on various
domains, such as for live variable analysis and reaching definitions, on a standard
benchmark set. Our experimental results align with our theoretical statements
and show that after a lightweight preprocessing, on-demand queries are answered
much faster than the standard existing algorithmic approaches.\r\n"
article_number: '23'
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: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Prateesh
full_name: Goyal, Prateesh
last_name: Goyal
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- 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, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster
algorithms for dynamic algebraic queries in basic RSMs with constant treewidth.
ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3363525
apa: Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis,
A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with
constant treewidth. ACM Transactions on Programming Languages and Systems.
ACM. https://doi.org/10.1145/3363525
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus
Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic
Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming
Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525.
ieee: K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis,
“Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,”
ACM Transactions on Programming Languages and Systems, vol. 41, no. 4.
ACM, 2019.
ista: Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019.
Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth.
ACM Transactions on Programming Languages and Systems. 41(4), 23.
mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries
in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages
and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525.
short: K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis,
ACM Transactions on Programming Languages and Systems 41 (2019).
date_created: 2019-12-09T08:33:33Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2024-03-28T23:30:34Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3363525
ec_funded: 1
external_id:
isi:
- '000564108400004'
file:
- access_level: open_access
checksum: 291cc86a07bd010d4815e177dac57b70
content_type: application/pdf
creator: dernst
date_created: 2020-10-08T12:58:10Z
date_updated: 2020-10-08T12:58:10Z
file_id: '8632'
file_name: 2019_ACMTransactions_Chatterjee.pdf
file_size: 667357
relation: main_file
success: 1
file_date_updated: 2020-10-08T12:58:10Z
has_accepted_license: '1'
intvolume: ' 41'
isi: 1
issue: '4'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
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: ACM Transactions on Programming Languages and Systems
publication_identifier:
issn:
- 0164-0925
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Faster algorithms for dynamic algebraic queries in basic RSMs with constant
treewidth
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 41
year: '2019'
...
---
_id: '7014'
abstract:
- lang: eng
text: "We study the problem of developing efficient approaches for proving\r\nworst-case
bounds of non-deterministic recursive programs. Ranking functions\r\nare sound
and complete for proving termination and worst-case bounds of\r\nnonrecursive
programs. First, we apply ranking functions to recursion,\r\nresulting in measure
functions. We show that measure functions provide a sound\r\nand complete approach
to prove worst-case bounds of non-deterministic recursive\r\nprograms. Our second
contribution is the synthesis of measure functions in\r\nnonpolynomial forms.
We show that non-polynomial measure functions with\r\nlogarithm and exponentiation
can be synthesized through abstraction of\r\nlogarithmic or exponentiation terms,
Farkas' Lemma, and Handelman's Theorem\r\nusing linear programming. While previous
methods obtain worst-case polynomial\r\nbounds, our approach can synthesize bounds
of the form $\\mathcal{O}(n\\log n)$\r\nas well as $\\mathcal{O}(n^r)$ where $r$
is not an integer. We present\r\nexperimental results to demonstrate that our
approach can obtain efficiently\r\nworst-case bounds of classical recursive algorithms
such as (i) Merge-Sort, the\r\ndivide-and-conquer algorithm for the Closest-Pair
problem, where we obtain\r\n$\\mathcal{O}(n \\log n)$ worst-case bound, and (ii)
Karatsuba's algorithm for\r\npolynomial multiplication and Strassen's algorithm
for matrix multiplication,\r\nwhere we obtain $\\mathcal{O}(n^r)$ bound such that
$r$ is not an integer and\r\nclose to the best-known bounds for the respective
algorithms."
article_number: '20'
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: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
citation:
ama: Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst-case analysis of recursive
programs. ACM Transactions on Programming Languages and Systems. 2019;41(4).
doi:10.1145/3339984
apa: Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case
analysis of recursive programs. ACM Transactions on Programming Languages and
Systems. ACM. https://doi.org/10.1145/3339984
chicago: Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial
Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming
Languages and Systems. ACM, 2019. https://doi.org/10.1145/3339984.
ieee: K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis
of recursive programs,” ACM Transactions on Programming Languages and Systems,
vol. 41, no. 4. ACM, 2019.
ista: Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis
of recursive programs. ACM Transactions on Programming Languages and Systems.
41(4), 20.
mla: Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive
Programs.” ACM Transactions on Programming Languages and Systems, vol.
41, no. 4, 20, ACM, 2019, doi:10.1145/3339984.
short: K. Chatterjee, H. Fu, A.K. Goharshady, ACM Transactions on Programming Languages
and Systems 41 (2019).
date_created: 2019-11-13T08:33:43Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2024-03-28T23:30:34Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/3339984
ec_funded: 1
external_id:
arxiv:
- '1705.00317'
isi:
- '000564108400001'
intvolume: ' 41'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.00317
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 267066CE-B435-11E9-9278-68D0E5697425
name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
publication: ACM Transactions on Programming Languages and Systems
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '639'
relation: earlier_version
status: public
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Non-polynomial worst-case analysis of recursive programs
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 41
year: '2019'
...
---
_id: '6486'
abstract:
- lang: eng
text: Based on a novel control scheme, where a steady modification of the streamwise
velocity profile leads to complete relaminarization of initially fully turbulent
pipe flow, we investigate the applicability and usefulness of custom-shaped honeycombs
for such control. The custom-shaped honeycombs are used as stationary flow management
devices which generate specific modifications of the streamwise velocity profile.
Stereoscopic particle image velocimetry and pressure drop measurements are used
to investigate and capture the development of the relaminarizing flow downstream
these devices. We compare the performance of straight (constant length across
the radius of the pipe) honeycombs with custom-shaped ones (variable length across
the radius) and try to determine the optimal shape for maximal relaminarization
at minimal pressure loss. The optimally modified streamwise velocity profile is
found to be M-shaped, and the maximum attainable Reynolds number for total relaminarization
is found to be of the order of 10,000. Consequently, the respective reduction
in skin friction downstream of the device is almost by a factor of 5. The break-even
point, where the additional pressure drop caused by the device is balanced by
the savings due to relaminarization and a net gain is obtained, corresponds to
a downstream stretch of distances as low as approximately 100 pipe diameters of
laminar flow.
acknowledged_ssus:
- _id: M-Shop
article_number: '111105'
article_processing_charge: No
article_type: original
author:
- first_name: Jakob
full_name: Kühnen, Jakob
id: 3A47AE32-F248-11E8-B48F-1D18A9856A87
last_name: Kühnen
orcid: 0000-0003-4312-0179
- first_name: Davide
full_name: Scarselli, Davide
id: 40315C30-F248-11E8-B48F-1D18A9856A87
last_name: Scarselli
orcid: 0000-0001-5227-4271
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Kühnen J, Scarselli D, Hof B. Relaminarization of pipe flow by means of 3D-printed
shaped honeycombs. Journal of Fluids Engineering. 2019;141(11). doi:10.1115/1.4043494
apa: Kühnen, J., Scarselli, D., & Hof, B. (2019). Relaminarization of pipe flow
by means of 3D-printed shaped honeycombs. Journal of Fluids Engineering.
ASME. https://doi.org/10.1115/1.4043494
chicago: Kühnen, Jakob, Davide Scarselli, and Björn Hof. “Relaminarization of Pipe
Flow by Means of 3D-Printed Shaped Honeycombs.” Journal of Fluids Engineering.
ASME, 2019. https://doi.org/10.1115/1.4043494.
ieee: J. Kühnen, D. Scarselli, and B. Hof, “Relaminarization of pipe flow by means
of 3D-printed shaped honeycombs,” Journal of Fluids Engineering, vol. 141,
no. 11. ASME, 2019.
ista: Kühnen J, Scarselli D, Hof B. 2019. Relaminarization of pipe flow by means
of 3D-printed shaped honeycombs. Journal of Fluids Engineering. 141(11), 111105.
mla: Kühnen, Jakob, et al. “Relaminarization of Pipe Flow by Means of 3D-Printed
Shaped Honeycombs.” Journal of Fluids Engineering, vol. 141, no. 11, 111105,
ASME, 2019, doi:10.1115/1.4043494.
short: J. Kühnen, D. Scarselli, B. Hof, Journal of Fluids Engineering 141 (2019).
date_created: 2019-05-26T21:59:13Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2024-03-28T23:30:36Z
day: '01'
department:
- _id: BjHo
doi: 10.1115/1.4043494
ec_funded: 1
external_id:
arxiv:
- '1809.07625'
isi:
- '000487748600005'
intvolume: ' 141'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.07625
month: '11'
oa: 1
oa_version: Preprint
project:
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
publication: Journal of Fluids Engineering
publication_identifier:
eissn:
- 1528901X
issn:
- '00982202'
publication_status: published
publisher: ASME
quality_controlled: '1'
related_material:
record:
- id: '7258'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Relaminarization of pipe flow by means of 3D-printed shaped honeycombs
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 141
year: '2019'
...
---
_id: '6228'
abstract:
- lang: eng
text: Following the recent observation that turbulent pipe flow can be relaminarised bya relatively simple modification of the mean velocity profile, we here carry out aquantitative experimental investigation of this phenomenon. Our study confirms thata flat velocity profile leads to a collapse of turbulence and in order to achieve theblunted profile shape, we employ a moving pipe segment that is briefly and rapidlyshifted in the streamwise direction. The relaminarisation threshold and the minimumshift length and speeds are determined as a function of Reynolds number. Althoughturbulence is still active after the acceleration phase, the modulated profile possessesa severely decreased lift-up potential as measured by transient growth. As shown,this results in an exponential decay of fluctuations and the flow relaminarises. Whilethis method can be easily applied at low to moderate flow speeds, the minimumstreamwise length over which the acceleration needs to act increases linearly with theReynolds number.
article_processing_charge: No
author:
- first_name: Davide
full_name: Scarselli, Davide
id: 40315C30-F248-11E8-B48F-1D18A9856A87
last_name: Scarselli
orcid: 0000-0001-5227-4271
- first_name: Jakob
full_name: Kühnen, Jakob
id: 3A47AE32-F248-11E8-B48F-1D18A9856A87
last_name: Kühnen
orcid: 0000-0003-4312-0179
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Scarselli D, Kühnen J, Hof B. Relaminarising pipe flow by wall movement. Journal
of Fluid Mechanics. 2019;867:934-948. doi:10.1017/jfm.2019.191
apa: Scarselli, D., Kühnen, J., & Hof, B. (2019). Relaminarising pipe flow by
wall movement. Journal of Fluid Mechanics. Cambridge University Press.
https://doi.org/10.1017/jfm.2019.191
chicago: Scarselli, Davide, Jakob Kühnen, and Björn Hof. “Relaminarising Pipe Flow
by Wall Movement.” Journal of Fluid Mechanics. Cambridge University Press,
2019. https://doi.org/10.1017/jfm.2019.191.
ieee: D. Scarselli, J. Kühnen, and B. Hof, “Relaminarising pipe flow by wall movement,”
Journal of Fluid Mechanics, vol. 867. Cambridge University Press, pp. 934–948,
2019.
ista: Scarselli D, Kühnen J, Hof B. 2019. Relaminarising pipe flow by wall movement.
Journal of Fluid Mechanics. 867, 934–948.
mla: Scarselli, Davide, et al. “Relaminarising Pipe Flow by Wall Movement.” Journal
of Fluid Mechanics, vol. 867, Cambridge University Press, 2019, pp. 934–48,
doi:10.1017/jfm.2019.191.
short: D. Scarselli, J. Kühnen, B. Hof, Journal of Fluid Mechanics 867 (2019) 934–948.
date_created: 2019-04-07T21:59:14Z
date_published: 2019-05-25T00:00:00Z
date_updated: 2024-03-28T23:30:36Z
day: '25'
department:
- _id: BjHo
doi: 10.1017/jfm.2019.191
ec_funded: 1
external_id:
arxiv:
- '1807.05357'
isi:
- '000462606100001'
intvolume: ' 867'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1807.05357
month: '05'
oa: 1
oa_version: Preprint
page: 934-948
project:
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
- _id: 25104D44-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '737549'
name: Eliminating turbulence in oil pipelines
publication: Journal of Fluid Mechanics
publication_identifier:
eissn:
- '14697645'
issn:
- '00221120'
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
link:
- relation: supplementary_material
url: https://doi.org/10.1017/jfm.2019.191
record:
- id: '7258'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Relaminarising pipe flow by wall movement
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 867
year: '2019'
...
---
_id: '6260'
abstract:
- lang: eng
text: Polar auxin transport plays a pivotal role in plant growth and development.
PIN auxin efflux carriers regulate directional auxin movement by establishing
local auxin maxima, minima, and gradients that drive multiple developmental processes
and responses to environmental signals. Auxin has been proposed to modulate its
own transport by regulating subcellular PIN trafficking via processes such as
clathrin-mediated PIN endocytosis and constitutive recycling. Here, we further
investigated the mechanisms by which auxin affects PIN trafficking by screening
auxin analogs and identified pinstatic acid (PISA) as a positive modulator of
polar auxin transport in Arabidopsis thaliana. PISA had an auxin-like effect on
hypocotyl elongation and adventitious root formation via positive regulation of
auxin transport. PISA did not activate SCFTIR1/AFB signaling and yet induced PIN
accumulation at the cell surface by inhibiting PIN internalization from the plasma
membrane. This work demonstrates PISA to be a promising chemical tool to dissect
the regulatory mechanisms behind subcellular PIN trafficking and auxin transport.
acknowledgement: "We thank Dr. H. Fukaki (University of Kobe), Dr. R. Offringa (Leiden
University), Dr. Jianwei Pan (Zhejiang Normal University), and Dr. M. Estelle (University
of California at San Diego) for providing mutants and transgenic line seeds.\r\nThis
work was supported by the Ministry of Education, Culture, Sports, Science, and Technology
(Grant-in-Aid for Scientific Research no. JP25114518 to K.H.), the Biotechnology
and Biological Sciences Research Council (award no. BB/L009366/1 to R.N. and S.K.),
and the European Union’s Horizon2020 program (European Research Council grant agreement
no. 742985 to J.F.)."
article_processing_charge: No
article_type: original
author:
- first_name: A
full_name: Oochi, A
last_name: Oochi
- first_name: Jakub
full_name: Hajny, Jakub
id: 4800CC20-F248-11E8-B48F-1D18A9856A87
last_name: Hajny
orcid: 0000-0003-2140-7195
- first_name: K
full_name: Fukui, K
last_name: Fukui
- first_name: Y
full_name: Nakao, Y
last_name: Nakao
- first_name: Michelle C
full_name: Gallei, Michelle C
id: 35A03822-F248-11E8-B48F-1D18A9856A87
last_name: Gallei
orcid: 0000-0003-1286-7368
- first_name: M
full_name: Quareshy, M
last_name: Quareshy
- first_name: K
full_name: Takahashi, K
last_name: Takahashi
- first_name: T
full_name: Kinoshita, T
last_name: Kinoshita
- first_name: SR
full_name: Harborough, SR
last_name: Harborough
- first_name: S
full_name: Kepinski, S
last_name: Kepinski
- first_name: H
full_name: Kasahara, H
last_name: Kasahara
- first_name: RM
full_name: Napier, RM
last_name: Napier
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: KI
full_name: Hayashi, KI
last_name: Hayashi
citation:
ama: Oochi A, Hajny J, Fukui K, et al. Pinstatic acid promotes auxin transport by
inhibiting PIN internalization. Plant Physiology. 2019;180(2):1152-1165.
doi:10.1104/pp.19.00201
apa: Oochi, A., Hajny, J., Fukui, K., Nakao, Y., Gallei, M. C., Quareshy, M., …
Hayashi, K. (2019). Pinstatic acid promotes auxin transport by inhibiting PIN
internalization. Plant Physiology. ASPB. https://doi.org/10.1104/pp.19.00201
chicago: Oochi, A, Jakub Hajny, K Fukui, Y Nakao, Michelle C Gallei, M Quareshy,
K Takahashi, et al. “Pinstatic Acid Promotes Auxin Transport by Inhibiting PIN
Internalization.” Plant Physiology. ASPB, 2019. https://doi.org/10.1104/pp.19.00201.
ieee: A. Oochi et al., “Pinstatic acid promotes auxin transport by inhibiting
PIN internalization,” Plant Physiology, vol. 180, no. 2. ASPB, pp. 1152–1165,
2019.
ista: Oochi A, Hajny J, Fukui K, Nakao Y, Gallei MC, Quareshy M, Takahashi K, Kinoshita
T, Harborough S, Kepinski S, Kasahara H, Napier R, Friml J, Hayashi K. 2019. Pinstatic
acid promotes auxin transport by inhibiting PIN internalization. Plant Physiology.
180(2), 1152–1165.
mla: Oochi, A., et al. “Pinstatic Acid Promotes Auxin Transport by Inhibiting PIN
Internalization.” Plant Physiology, vol. 180, no. 2, ASPB, 2019, pp. 1152–65,
doi:10.1104/pp.19.00201.
short: A. Oochi, J. Hajny, K. Fukui, Y. Nakao, M.C. Gallei, M. Quareshy, K. Takahashi,
T. Kinoshita, S. Harborough, S. Kepinski, H. Kasahara, R. Napier, J. Friml, K.
Hayashi, Plant Physiology 180 (2019) 1152–1165.
date_created: 2019-04-09T08:38:20Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2024-03-28T23:30:38Z
day: '01'
department:
- _id: JiFr
doi: 10.1104/pp.19.00201
ec_funded: 1
external_id:
isi:
- '000470086100045'
pmid:
- '30936248'
intvolume: ' 180'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1104/pp.19.00201
month: '06'
oa: 1
oa_version: Published Version
page: 1152-1165
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
publication: Plant Physiology
publication_identifier:
eissn:
- 1532-2548
issn:
- 0032-0889
publication_status: published
publisher: ASPB
quality_controlled: '1'
related_material:
record:
- id: '11626'
relation: dissertation_contains
status: public
- id: '8822'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Pinstatic acid promotes auxin transport by inhibiting PIN internalization
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 180
year: '2019'
...
---
_id: '6508'
abstract:
- lang: eng
text: Segregation of maternal determinants within the oocyte constitutes the first
step in embryo patterning. In zebrafish oocytes, extensive ooplasmic streaming
leads to the segregation of ooplasm from yolk granules along the animal-vegetal
axis of the oocyte. Here, we show that this process does not rely on cortical
actin reorganization, as previously thought, but instead on a cell-cycle-dependent
bulk actin polymerization wave traveling from the animal to the vegetal pole of
the oocyte. This wave functions in segregation by both pulling ooplasm animally
and pushing yolk granules vegetally. Using biophysical experimentation and theory,
we show that ooplasm pulling is mediated by bulk actin network flows exerting
friction forces on the ooplasm, while yolk granule pushing is achieved by a mechanism
closely resembling actin comet formation on yolk granules. Our study defines a
novel role of cell-cycle-controlled bulk actin polymerization waves in oocyte
polarization via ooplasmic segregation.
acknowledged_ssus:
- _id: Bio
- _id: PreCl
acknowledgement: We would like to thank Pierre Recho, Guillaume Salbreux, and Silvia
Grigolon for advice on the theory, Lila Solnica-Krezel for kindly providing us with
zebrafish dachsous mutants, members of the Heisenberg and Hannezo groups for fruitful
discussions, and the Bioimaging and zebrafish facilities at IST Austria for their
continuous support. This project has received funding from the European Union (European
Research Council Advanced Grant 742573 to C.P.H.) and from the Austrian Science
Fund (FWF) (P 31639 to E.H.).
article_processing_charge: No
article_type: original
author:
- first_name: Shayan
full_name: Shamipour, Shayan
id: 40B34FE2-F248-11E8-B48F-1D18A9856A87
last_name: Shamipour
- first_name: Roland
full_name: Kardos, Roland
id: 4039350E-F248-11E8-B48F-1D18A9856A87
last_name: Kardos
- first_name: Shi-lei
full_name: Xue, Shi-lei
id: 31D2C804-F248-11E8-B48F-1D18A9856A87
last_name: Xue
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- 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: Shamipour S, Kardos R, Xue S, Hof B, Hannezo EB, Heisenberg C-PJ. Bulk actin
dynamics drive phase segregation in zebrafish oocytes. Cell. 2019;177(6):1463-1479.e18.
doi:10.1016/j.cell.2019.04.030
apa: Shamipour, S., Kardos, R., Xue, S., Hof, B., Hannezo, E. B., & Heisenberg,
C.-P. J. (2019). Bulk actin dynamics drive phase segregation in zebrafish oocytes.
Cell. Elsevier. https://doi.org/10.1016/j.cell.2019.04.030
chicago: Shamipour, Shayan, Roland Kardos, Shi-lei Xue, Björn Hof, Edouard B Hannezo,
and Carl-Philipp J Heisenberg. “Bulk Actin Dynamics Drive Phase Segregation in
Zebrafish Oocytes.” Cell. Elsevier, 2019. https://doi.org/10.1016/j.cell.2019.04.030.
ieee: S. Shamipour, R. Kardos, S. Xue, B. Hof, E. B. Hannezo, and C.-P. J. Heisenberg,
“Bulk actin dynamics drive phase segregation in zebrafish oocytes,” Cell,
vol. 177, no. 6. Elsevier, p. 1463–1479.e18, 2019.
ista: Shamipour S, Kardos R, Xue S, Hof B, Hannezo EB, Heisenberg C-PJ. 2019. Bulk
actin dynamics drive phase segregation in zebrafish oocytes. Cell. 177(6), 1463–1479.e18.
mla: Shamipour, Shayan, et al. “Bulk Actin Dynamics Drive Phase Segregation in Zebrafish
Oocytes.” Cell, vol. 177, no. 6, Elsevier, 2019, p. 1463–1479.e18, doi:10.1016/j.cell.2019.04.030.
short: S. Shamipour, R. Kardos, S. Xue, B. Hof, E.B. Hannezo, C.-P.J. Heisenberg,
Cell 177 (2019) 1463–1479.e18.
date_created: 2019-06-02T21:59:12Z
date_published: 2019-05-30T00:00:00Z
date_updated: 2024-03-28T23:30:39Z
day: '30'
ddc:
- '570'
department:
- _id: CaHe
- _id: EdHa
- _id: BjHo
doi: 10.1016/j.cell.2019.04.030
ec_funded: 1
external_id:
isi:
- '000469415100013'
pmid:
- '31080065'
file:
- access_level: open_access
checksum: aea43726d80e35ce3885073a5f05c3e3
content_type: application/pdf
creator: dernst
date_created: 2020-10-21T07:22:34Z
date_updated: 2020-10-21T07:22:34Z
file_id: '8686'
file_name: 2019_Cell_Shamipour_accepted.pdf
file_size: 3356292
relation: main_file
success: 1
file_date_updated: 2020-10-21T07:22:34Z
has_accepted_license: '1'
intvolume: ' 177'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.cell.2019.04.030
month: '05'
oa: 1
oa_version: Published Version
page: 1463-1479.e18
pmid: 1
project:
- _id: 260F1432-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742573'
name: Interaction and feedback between cell mechanics and fate specification in
vertebrate gastrulation
- _id: 268294B6-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31639
name: Active mechano-chemical description of the cell cytoskeleton
publication: Cell
publication_identifier:
eissn:
- '10974172'
issn:
- '00928674'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/how-the-cytoplasm-separates-from-the-yolk/
record:
- id: '8350'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Bulk actin dynamics drive phase segregation in zebrafish oocytes
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 177
year: '2019'
...
---
_id: '7001'
acknowledged_ssus:
- _id: PreCl
- _id: Bio
article_processing_charge: No
article_type: original
author:
- first_name: Cornelia
full_name: Schwayer, Cornelia
id: 3436488C-F248-11E8-B48F-1D18A9856A87
last_name: Schwayer
orcid: 0000-0001-5130-2226
- first_name: Shayan
full_name: Shamipour, Shayan
id: 40B34FE2-F248-11E8-B48F-1D18A9856A87
last_name: Shamipour
- first_name: Kornelija
full_name: Pranjic-Ferscha, Kornelija
id: 4362B3C2-F248-11E8-B48F-1D18A9856A87
last_name: Pranjic-Ferscha
- first_name: Alexandra
full_name: Schauer, Alexandra
id: 30A536BA-F248-11E8-B48F-1D18A9856A87
last_name: Schauer
orcid: 0000-0001-7659-9142
- first_name: M
full_name: Balda, M
last_name: Balda
- first_name: M
full_name: Tada, M
last_name: Tada
- first_name: K
full_name: Matter, K
last_name: Matter
- 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: Schwayer C, Shamipour S, Pranjic-Ferscha K, et al. Mechanosensation of tight
junctions depends on ZO-1 phase separation and flow. Cell. 2019;179(4):937-952.e18.
doi:10.1016/j.cell.2019.10.006
apa: Schwayer, C., Shamipour, S., Pranjic-Ferscha, K., Schauer, A., Balda, M., Tada,
M., … Heisenberg, C.-P. J. (2019). Mechanosensation of tight junctions depends
on ZO-1 phase separation and flow. Cell. Cell Press. https://doi.org/10.1016/j.cell.2019.10.006
chicago: Schwayer, Cornelia, Shayan Shamipour, Kornelija Pranjic-Ferscha, Alexandra
Schauer, M Balda, M Tada, K Matter, and Carl-Philipp J Heisenberg. “Mechanosensation
of Tight Junctions Depends on ZO-1 Phase Separation and Flow.” Cell. Cell
Press, 2019. https://doi.org/10.1016/j.cell.2019.10.006.
ieee: C. Schwayer et al., “Mechanosensation of tight junctions depends on
ZO-1 phase separation and flow,” Cell, vol. 179, no. 4. Cell Press, p.
937–952.e18, 2019.
ista: Schwayer C, Shamipour S, Pranjic-Ferscha K, Schauer A, Balda M, Tada M, Matter
K, Heisenberg C-PJ. 2019. Mechanosensation of tight junctions depends on ZO-1
phase separation and flow. Cell. 179(4), 937–952.e18.
mla: Schwayer, Cornelia, et al. “Mechanosensation of Tight Junctions Depends on
ZO-1 Phase Separation and Flow.” Cell, vol. 179, no. 4, Cell Press, 2019,
p. 937–952.e18, doi:10.1016/j.cell.2019.10.006.
short: C. Schwayer, S. Shamipour, K. Pranjic-Ferscha, A. Schauer, M. Balda, M. Tada,
K. Matter, C.-P.J. Heisenberg, Cell 179 (2019) 937–952.e18.
date_created: 2019-11-12T12:51:06Z
date_published: 2019-10-31T00:00:00Z
date_updated: 2024-03-28T23:30:39Z
day: '31'
ddc:
- '570'
department:
- _id: CaHe
- _id: BjHo
doi: 10.1016/j.cell.2019.10.006
ec_funded: 1
external_id:
isi:
- '000493898000012'
pmid:
- '31675500'
file:
- access_level: open_access
checksum: 33dac4bb77ee630e2666e936b4d57980
content_type: application/pdf
creator: dernst
date_created: 2020-10-21T07:09:45Z
date_updated: 2020-10-21T07:09:45Z
file_id: '8684'
file_name: 2019_Cell_Schwayer_accepted.pdf
file_size: 8805878
relation: main_file
success: 1
file_date_updated: 2020-10-21T07:09:45Z
has_accepted_license: '1'
intvolume: ' 179'
isi: 1
issue: '4'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 937-952.e18
pmid: 1
project:
- _id: 260F1432-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742573'
name: Interaction and feedback between cell mechanics and fate specification in
vertebrate gastrulation
publication: Cell
publication_identifier:
eissn:
- 1097-4172
issn:
- 0092-8674
publication_status: published
publisher: Cell Press
quality_controlled: '1'
related_material:
link:
- description: News auf IST Website
relation: press_release
url: https://ist.ac.at/en/news/biochemistry-meets-mechanics-the-sensitive-nature-of-cell-cell-contact-formation-in-embryo-development/
record:
- id: '7186'
relation: dissertation_contains
status: public
- id: '8350'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Mechanosensation of tight junctions depends on ZO-1 phase separation and flow
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 179
year: '2019'
...