---
_id: '8089'
abstract:
- lang: eng
text: "We consider the classical problem of invariant generation for programs with
polynomial assignments and focus on synthesizing invariants that are a conjunction
of strict polynomial inequalities. We present a sound and semi-complete method
based on positivstellensaetze, i.e. theorems in semi-algebraic geometry that characterize
positive polynomials over a semi-algebraic set.\r\n\r\nOn the theoretical side,
the worst-case complexity of our approach is subexponential, whereas the worst-case
complexity of the previous complete method (Kapur, ACA 2004) is doubly-exponential.
Even when restricted to linear invariants, the best previous complexity for complete
invariant generation is exponential (Colon et al, CAV 2003). On the practical
side, we reduce the invariant generation problem to quadratic programming (QCLP),
which is a classical optimization problem with many industrial solvers. We demonstrate
the applicability of our approach by providing experimental results on several
academic benchmarks. To the best of our knowledge, the only previous invariant
generation method that provides completeness guarantees for invariants consisting
of polynomial inequalities is (Kapur, ACA 2004), which relies on quantifier elimination
and cannot even handle toy programs such as our running example."
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: 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: Ehsan Kafshdar
full_name: Goharshady, Ehsan Kafshdar
last_name: Goharshady
citation:
ama: 'Chatterjee K, Fu H, Goharshady AK, Goharshady EK. Polynomial invariant generation
for non-deterministic recursive programs. In: Proceedings of the 41st ACM SIGPLAN
Conference on Programming Language Design and Implementation. Association
for Computing Machinery; 2020:672-687. doi:10.1145/3385412.3385969'
apa: 'Chatterjee, K., Fu, H., Goharshady, A. K., & Goharshady, E. K. (2020).
Polynomial invariant generation for non-deterministic recursive programs. In Proceedings
of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation
(pp. 672–687). London, United Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3385412.3385969'
chicago: Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Ehsan
Kafshdar Goharshady. “Polynomial Invariant Generation for Non-Deterministic Recursive
Programs.” In Proceedings of the 41st ACM SIGPLAN Conference on Programming
Language Design and Implementation, 672–87. Association for Computing Machinery,
2020. https://doi.org/10.1145/3385412.3385969.
ieee: K. Chatterjee, H. Fu, A. K. Goharshady, and E. K. Goharshady, “Polynomial
invariant generation for non-deterministic recursive programs,” in Proceedings
of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation,
London, United Kingdom, 2020, pp. 672–687.
ista: 'Chatterjee K, Fu H, Goharshady AK, Goharshady EK. 2020. Polynomial invariant
generation for non-deterministic recursive programs. Proceedings of the 41st ACM
SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming
Language Design and Implementation, 672–687.'
mla: Chatterjee, Krishnendu, et al. “Polynomial Invariant Generation for Non-Deterministic
Recursive Programs.” Proceedings of the 41st ACM SIGPLAN Conference on Programming
Language Design and Implementation, Association for Computing Machinery, 2020,
pp. 672–87, doi:10.1145/3385412.3385969.
short: K. Chatterjee, H. Fu, A.K. Goharshady, E.K. Goharshady, in:, Proceedings
of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation,
Association for Computing Machinery, 2020, pp. 672–687.
conference:
end_date: 2020-06-20
location: London, United Kingdom
name: 'PLDI: Programming Language Design and Implementation'
start_date: 2020-06-15
date_created: 2020-07-05T22:00:45Z
date_published: 2020-06-11T00:00:00Z
date_updated: 2024-03-28T23:30:34Z
day: '11'
department:
- _id: KrCh
doi: 10.1145/3385412.3385969
external_id:
arxiv:
- '1902.04373'
isi:
- '000614622300045'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.04373
month: '06'
oa: 1
oa_version: Preprint
page: 672-687
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language
Design and Implementation
publication_identifier:
isbn:
- '9781450376136'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Polynomial invariant generation for non-deterministic recursive programs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '6918'
abstract:
- lang: eng
text: "We consider the classic problem of Network Reliability. A network is given
together with a source vertex, one or more target vertices, and probabilities
assigned to each of the edges. Each edge of the network is operable with its associated
probability and the problem is to determine the probability of having at least
one source-to-target path that is entirely composed of operable edges. This problem
is known to be NP-hard.\r\n\r\nWe provide a novel scalable algorithm to solve
the Network Reliability problem when the treewidth of the underlying network is
small. We also show our algorithm’s applicability for real-world transit networks
that have small treewidth, including the metro networks of major cities, such
as London and Tokyo. Our algorithm leverages tree decompositions to shrink the
original graph into much smaller graphs, for which reliability can be efficiently
and exactly computed using a brute force method. To the best of our knowledge,
this is the first exact algorithm for Network Reliability that can scale to handle
real-world instances of the problem."
acknowledgement: We are grateful to the anonymous reviewers for their comments, which
significantly improved the present work. The research was partially supported by
the EPSRC Early Career Fellowship EP/R023379/1, grant no. SC7-1718-01 of the London
Mathematical Society, an IBM PhD Fellowship, and a DOC Fellowship of the Austrian
Academy of Sciences (ÖAW).
article_number: '106665'
article_processing_charge: No
article_type: original
author:
- 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: Fatemeh
full_name: Mohammadi, Fatemeh
last_name: Mohammadi
citation:
ama: Goharshady AK, Mohammadi F. An efficient algorithm for computing network reliability
in small treewidth. Reliability Engineering and System Safety. 2020;193.
doi:10.1016/j.ress.2019.106665
apa: Goharshady, A. K., & Mohammadi, F. (2020). An efficient algorithm for computing
network reliability in small treewidth. Reliability Engineering and System
Safety. Elsevier. https://doi.org/10.1016/j.ress.2019.106665
chicago: Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm
for Computing Network Reliability in Small Treewidth.” Reliability Engineering
and System Safety. Elsevier, 2020. https://doi.org/10.1016/j.ress.2019.106665.
ieee: A. K. Goharshady and F. Mohammadi, “An efficient algorithm for computing network
reliability in small treewidth,” Reliability Engineering and System Safety,
vol. 193. Elsevier, 2020.
ista: Goharshady AK, Mohammadi F. 2020. An efficient algorithm for computing network
reliability in small treewidth. Reliability Engineering and System Safety. 193,
106665.
mla: Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for
Computing Network Reliability in Small Treewidth.” Reliability Engineering
and System Safety, vol. 193, 106665, Elsevier, 2020, doi:10.1016/j.ress.2019.106665.
short: A.K. Goharshady, F. Mohammadi, Reliability Engineering and System Safety
193 (2020).
date_created: 2019-09-29T22:00:44Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2024-03-28T23:30:34Z
day: '01'
department:
- _id: KrCh
doi: 10.1016/j.ress.2019.106665
external_id:
arxiv:
- '1712.09692'
isi:
- '000501641400050'
intvolume: ' 193'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.09692
month: '01'
oa: 1
oa_version: Preprint
project:
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
publication: Reliability Engineering and System Safety
publication_identifier:
issn:
- '09518320'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: An efficient algorithm for computing network reliability in small treewidth
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 193
year: '2020'
...
---
_id: '7161'
abstract:
- lang: eng
text: In this paper, we introduce an inertial projection-type method with different
updating strategies for solving quasi-variational inequalities with strongly monotone
and Lipschitz continuous operators in real Hilbert spaces. Under standard assumptions,
we establish different strong convergence results for the proposed algorithm.
Primary numerical experiments demonstrate the potential applicability of our scheme
compared with some related methods in the literature.
acknowledgement: We are grateful to the anonymous referees and editor whose insightful
comments helped to considerably improve an earlier version of this paper. The research
of the first author is supported by an ERC Grant from the Institute of Science and
Technology (IST).
article_processing_charge: No
article_type: original
author:
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
- first_name: Aviv
full_name: Gibali, Aviv
last_name: Gibali
- first_name: Simone
full_name: Sagratella, Simone
last_name: Sagratella
citation:
ama: Shehu Y, Gibali A, Sagratella S. Inertial projection-type methods for solving
quasi-variational inequalities in real Hilbert spaces. Journal of Optimization
Theory and Applications. 2020;184:877–894. doi:10.1007/s10957-019-01616-6
apa: Shehu, Y., Gibali, A., & Sagratella, S. (2020). Inertial projection-type
methods for solving quasi-variational inequalities in real Hilbert spaces. Journal
of Optimization Theory and Applications. Springer Nature. https://doi.org/10.1007/s10957-019-01616-6
chicago: Shehu, Yekini, Aviv Gibali, and Simone Sagratella. “Inertial Projection-Type
Methods for Solving Quasi-Variational Inequalities in Real Hilbert Spaces.” Journal
of Optimization Theory and Applications. Springer Nature, 2020. https://doi.org/10.1007/s10957-019-01616-6.
ieee: Y. Shehu, A. Gibali, and S. Sagratella, “Inertial projection-type methods
for solving quasi-variational inequalities in real Hilbert spaces,” Journal
of Optimization Theory and Applications, vol. 184. Springer Nature, pp. 877–894,
2020.
ista: Shehu Y, Gibali A, Sagratella S. 2020. Inertial projection-type methods for
solving quasi-variational inequalities in real Hilbert spaces. Journal of Optimization
Theory and Applications. 184, 877–894.
mla: Shehu, Yekini, et al. “Inertial Projection-Type Methods for Solving Quasi-Variational
Inequalities in Real Hilbert Spaces.” Journal of Optimization Theory and Applications,
vol. 184, Springer Nature, 2020, pp. 877–894, doi:10.1007/s10957-019-01616-6.
short: Y. Shehu, A. Gibali, S. Sagratella, Journal of Optimization Theory and Applications
184 (2020) 877–894.
date_created: 2019-12-09T21:33:44Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2023-09-06T11:27:15Z
day: '01'
ddc:
- '518'
- '510'
- '515'
department:
- _id: VlKo
doi: 10.1007/s10957-019-01616-6
ec_funded: 1
external_id:
isi:
- '000511805200009'
file:
- access_level: open_access
checksum: 9f6dc6c6bf2b48cb3a2091a9ed5feaf2
content_type: application/pdf
creator: dernst
date_created: 2020-10-12T10:40:27Z
date_updated: 2021-03-16T23:30:04Z
embargo: 2021-03-15
file_id: '8647'
file_name: 2020_JourOptimizationTheoryApplic_Shehu.pdf
file_size: 332641
relation: main_file
file_date_updated: 2021-03-16T23:30:04Z
has_accepted_license: '1'
intvolume: ' 184'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 877–894
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Journal of Optimization Theory and Applications
publication_identifier:
eissn:
- 1573-2878
issn:
- 0022-3239
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inertial projection-type methods for solving quasi-variational inequalities
in real Hilbert spaces
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 184
year: '2020'
...
---
_id: '7652'
abstract:
- lang: eng
text: Organisms cope with change by taking advantage of transcriptional regulators.
However, when faced with rare environments, the evolution of transcriptional regulators
and their promoters may be too slow. Here, we investigate whether the intrinsic
instability of gene duplication and amplification provides a generic alternative
to canonical gene regulation. Using real-time monitoring of gene-copy-number mutations
in Escherichia coli, we show that gene duplications and amplifications enable
adaptation to fluctuating environments by rapidly generating copy-number and,
therefore, expression-level polymorphisms. This amplification-mediated gene expression
tuning (AMGET) occurs on timescales that are similar to canonical gene regulation
and can respond to rapid environmental changes. Mathematical modelling shows that
amplifications also tune gene expression in stochastic environments in which transcription-factor-based
schemes are hard to evolve or maintain. The fleeting nature of gene amplifications
gives rise to a generic population-level mechanism that relies on genetic heterogeneity
to rapidly tune the expression of any gene, without leaving any genomic signature.
acknowledgement: We thank L. Hurst, N. Barton, M. Pleska, M. Steinrück, B. Kavcic
and A. Staron for input on the manuscript, and To. Bergmiller and R. Chait for help
with microfluidics experiments. I.T. is a recipient the OMV fellowship. R.G. is
a recipient of a DOC (Doctoral Fellowship Programme of the Austrian Academy of Sciences)
Fellowship of the Austrian Academy of Sciences.
article_processing_charge: No
article_type: original
author:
- first_name: Isabella
full_name: Tomanek, Isabella
id: 3981F020-F248-11E8-B48F-1D18A9856A87
last_name: Tomanek
orcid: 0000-0001-6197-363X
- first_name: Rok
full_name: Grah, Rok
id: 483E70DE-F248-11E8-B48F-1D18A9856A87
last_name: Grah
orcid: 0000-0003-2539-3560
- first_name: M.
full_name: Lagator, M.
last_name: Lagator
- first_name: A. M. C.
full_name: Andersson, A. M. C.
last_name: Andersson
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Tomanek I, Grah R, Lagator M, et al. Gene amplification as a form of population-level
gene expression regulation. Nature Ecology & Evolution. 2020;4(4):612-625.
doi:10.1038/s41559-020-1132-7
apa: Tomanek, I., Grah, R., Lagator, M., Andersson, A. M. C., Bollback, J. P., Tkačik,
G., & Guet, C. C. (2020). Gene amplification as a form of population-level
gene expression regulation. Nature Ecology & Evolution. Springer Nature.
https://doi.org/10.1038/s41559-020-1132-7
chicago: Tomanek, Isabella, Rok Grah, M. Lagator, A. M. C. Andersson, Jonathan P
Bollback, Gašper Tkačik, and Calin C Guet. “Gene Amplification as a Form of Population-Level
Gene Expression Regulation.” Nature Ecology & Evolution. Springer Nature,
2020. https://doi.org/10.1038/s41559-020-1132-7.
ieee: I. Tomanek et al., “Gene amplification as a form of population-level
gene expression regulation,” Nature Ecology & Evolution, vol. 4, no.
4. Springer Nature, pp. 612–625, 2020.
ista: Tomanek I, Grah R, Lagator M, Andersson AMC, Bollback JP, Tkačik G, Guet CC.
2020. Gene amplification as a form of population-level gene expression regulation.
Nature Ecology & Evolution. 4(4), 612–625.
mla: Tomanek, Isabella, et al. “Gene Amplification as a Form of Population-Level
Gene Expression Regulation.” Nature Ecology & Evolution, vol. 4, no.
4, Springer Nature, 2020, pp. 612–25, doi:10.1038/s41559-020-1132-7.
short: I. Tomanek, R. Grah, M. Lagator, A.M.C. Andersson, J.P. Bollback, G. Tkačik,
C.C. Guet, Nature Ecology & Evolution 4 (2020) 612–625.
date_created: 2020-04-08T15:20:53Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2024-03-28T23:30:37Z
day: '01'
ddc:
- '570'
department:
- _id: GaTk
- _id: CaGu
doi: 10.1038/s41559-020-1132-7
external_id:
isi:
- '000519008300005'
file:
- access_level: open_access
checksum: ef3bbf42023e30b2c24a6278025d2040
content_type: application/pdf
creator: dernst
date_created: 2020-10-09T09:56:01Z
date_updated: 2020-10-09T09:56:01Z
file_id: '8640'
file_name: 2020_NatureEcolEvo_Tomanek.pdf
file_size: 745242
relation: main_file
success: 1
file_date_updated: 2020-10-09T09:56:01Z
has_accepted_license: '1'
intvolume: ' 4'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 612-625
project:
- _id: 267C84F4-B435-11E9-9278-68D0E5697425
name: Biophysically realistic genotype-phenotype maps for regulatory networks
publication: Nature Ecology & Evolution
publication_identifier:
issn:
- 2397-334X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/how-to-thrive-without-gene-regulation/
record:
- id: '8155'
relation: dissertation_contains
status: public
- id: '7383'
relation: research_data
status: public
- id: '7016'
relation: research_data
status: public
- id: '8653'
relation: used_in_publication
status: public
scopus_import: '1'
status: public
title: Gene amplification as a form of population-level gene expression regulation
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 4
year: '2020'
...
---
_id: '7258'
abstract:
- lang: eng
text: Many flows encountered in nature and applications are characterized by a chaotic
motion known as turbulence. Turbulent flows generate intense friction with pipe
walls and are responsible for considerable amounts of energy losses at world scale.
The nature of turbulent friction and techniques aimed at reducing it have been
subject of extensive research over the last century, but no definite answer has
been found yet. In this thesis we show that in pipes at moderate turbulent Reynolds
numbers friction is better described by the power law first introduced by Blasius
and not by the Prandtl–von Kármán formula. At higher Reynolds numbers, large scale
motions gradually become more important in the flow and can be related to the
change in scaling of friction. Next, we present a series of new techniques that
can relaminarize turbulence by suppressing a key mechanism that regenerates it
at walls, the lift–up effect. In addition, we investigate the process of turbulence
decay in several experiments and discuss the drag reduction potential. Finally,
we examine the behavior of friction under pulsating conditions inspired by the
human heart cycle and we show that under such circumstances turbulent friction
can be reduced to produce energy savings.
alternative_title:
- ISTA Thesis
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
citation:
ama: Scarselli D. New approaches to reduce friction in turbulent pipe flow. 2020.
doi:10.15479/AT:ISTA:7258
apa: Scarselli, D. (2020). New approaches to reduce friction in turbulent pipe
flow. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7258
chicago: Scarselli, Davide. “New Approaches to Reduce Friction in Turbulent Pipe
Flow.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7258.
ieee: D. Scarselli, “New approaches to reduce friction in turbulent pipe flow,”
Institute of Science and Technology Austria, 2020.
ista: Scarselli D. 2020. New approaches to reduce friction in turbulent pipe flow.
Institute of Science and Technology Austria.
mla: Scarselli, Davide. New Approaches to Reduce Friction in Turbulent Pipe Flow.
Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7258.
short: D. Scarselli, New Approaches to Reduce Friction in Turbulent Pipe Flow, Institute
of Science and Technology Austria, 2020.
date_created: 2020-01-12T16:07:26Z
date_published: 2020-01-13T00:00:00Z
date_updated: 2023-09-15T12:20:08Z
day: '13'
ddc:
- '532'
degree_awarded: PhD
department:
- _id: BjHo
doi: 10.15479/AT:ISTA:7258
ec_funded: 1
file:
- access_level: closed
checksum: 4df1ab24e9896635106adde5a54615bf
content_type: application/zip
creator: dscarsel
date_created: 2020-01-12T15:57:14Z
date_updated: 2021-01-13T23:30:05Z
embargo_to: open_access
file_id: '7259'
file_name: 2020_Scarselli_Thesis.zip
file_size: 26640830
relation: source_file
- access_level: open_access
checksum: 48659ab98e3414293c7a721385c2fd1c
content_type: application/pdf
creator: dscarsel
date_created: 2020-01-12T15:56:14Z
date_updated: 2021-01-13T23:30:05Z
embargo: 2021-01-12
file_id: '7260'
file_name: 2020_Scarselli_Thesis.pdf
file_size: 8515844
relation: main_file
file_date_updated: 2021-01-13T23:30:05Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: None
page: '174'
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
- _id: 25136C54-B435-11E9-9278-68D0E5697425
grant_number: HO 4393/1-2
name: Experimental studies of the turbulence transition and transport processes
in turbulent Taylor-Couette currents
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '6228'
relation: part_of_dissertation
status: public
- id: '6486'
relation: part_of_dissertation
status: public
- id: '461'
relation: part_of_dissertation
status: public
- id: '422'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
title: New approaches to reduce friction in turbulent pipe flow
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2020'
...