---
_id: '45849'
abstract:
- lang: eng
text: 'AbstractDependence Logic was introduced
by Jouko Väänänen in 2007. We study a propositional variant of this logic(PDL)and
investigate a variety of parameterisations with respect to central decision problems.
The model checking problem (MC) ofPDLisNP-complete
(Ebbing and Lohmann, SOFSEM 2012). The subject of this research is to identify
a list of parameterisations (formula-size, formula-depth, treewidth, team-size,
number of variables) under which MC becomes fixed-parameter tractable. Furthermore,
we show that the number of disjunctions or the arity of dependence atoms (dep-arity)
as a parameter both yield a paraNP-completeness result. Then, we consider the
satisfiability problem (SAT) which classically is known to beNP-complete
as well (Lohmann and Vollmer, Studia Logica 2013). There we are presenting a different
picture: under team-size, or dep-arity SAT isparaNP-complete
whereas under all other mentioned parameters the problem isFPT.
Finally, we introduce a variant of the satisfiability problem, asking for a team
of a given size, and show for this problem an almost complete picture.'
author:
- first_name: Yasir
full_name: Mahmood, Yasir
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
citation:
ama: Mahmood Y, Meier A. Parameterised complexity of model checking and satisfiability
in propositional dependence logic. Annals of Mathematics and Artificial Intelligence.
2021;90(2-3):271-296. doi:10.1007/s10472-021-09730-w
apa: Mahmood, Y., & Meier, A. (2021). Parameterised complexity of model checking
and satisfiability in propositional dependence logic. Annals of Mathematics
and Artificial Intelligence, 90(2–3), 271–296. https://doi.org/10.1007/s10472-021-09730-w
bibtex: '@article{Mahmood_Meier_2021, title={Parameterised complexity of model checking
and satisfiability in propositional dependence logic}, volume={90}, DOI={10.1007/s10472-021-09730-w},
number={2–3}, journal={Annals of Mathematics and Artificial Intelligence}, publisher={Springer
Science and Business Media LLC}, author={Mahmood, Yasir and Meier, Arne}, year={2021},
pages={271–296} }'
chicago: 'Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking
and Satisfiability in Propositional Dependence Logic.” Annals of Mathematics
and Artificial Intelligence 90, no. 2–3 (2021): 271–96. https://doi.org/10.1007/s10472-021-09730-w.'
ieee: 'Y. Mahmood and A. Meier, “Parameterised complexity of model checking and
satisfiability in propositional dependence logic,” Annals of Mathematics and
Artificial Intelligence, vol. 90, no. 2–3, pp. 271–296, 2021, doi: 10.1007/s10472-021-09730-w.'
mla: Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking
and Satisfiability in Propositional Dependence Logic.” Annals of Mathematics
and Artificial Intelligence, vol. 90, no. 2–3, Springer Science and Business
Media LLC, 2021, pp. 271–96, doi:10.1007/s10472-021-09730-w.
short: Y. Mahmood, A. Meier, Annals of Mathematics and Artificial Intelligence 90
(2021) 271–296.
date_created: 2023-07-03T11:45:39Z
date_updated: 2023-07-03T11:45:47Z
doi: 10.1007/s10472-021-09730-w
intvolume: ' 90'
issue: 2-3
keyword:
- Applied Mathematics
- Artificial Intelligence
language:
- iso: eng
page: 271-296
publication: Annals of Mathematics and Artificial Intelligence
publication_identifier:
issn:
- 1012-2443
- 1573-7470
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Parameterised complexity of model checking and satisfiability in propositional
dependence logic
type: journal_article
user_id: '99353'
volume: 90
year: '2021'
...
---
_id: '45846'
author:
- first_name: Juha
full_name: Kontinen, Juha
last_name: Kontinen
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
- first_name: Yasir
full_name: Mahmood, Yasir
last_name: Mahmood
citation:
ama: 'Kontinen J, Meier A, Mahmood Y. A Parameterized View on the Complexity of
Dependence Logic. In: Logical Foundations of Computer Science. Springer
International Publishing; 2021. doi:10.1007/978-3-030-93100-1_9'
apa: Kontinen, J., Meier, A., & Mahmood, Y. (2021). A Parameterized View on
the Complexity of Dependence Logic. Logical Foundations of Computer Science.
https://doi.org/10.1007/978-3-030-93100-1_9
bibtex: '@inproceedings{Kontinen_Meier_Mahmood_2021, place={Cham}, title={A Parameterized
View on the Complexity of Dependence Logic}, DOI={10.1007/978-3-030-93100-1_9},
booktitle={Logical Foundations of Computer Science}, publisher={Springer International
Publishing}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2021}
}'
chicago: 'Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on
the Complexity of Dependence Logic.” In Logical Foundations of Computer Science.
Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-93100-1_9.'
ieee: 'J. Kontinen, A. Meier, and Y. Mahmood, “A Parameterized View on the Complexity
of Dependence Logic,” 2021, doi: 10.1007/978-3-030-93100-1_9.'
mla: Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence
Logic.” Logical Foundations of Computer Science, Springer International
Publishing, 2021, doi:10.1007/978-3-030-93100-1_9.
short: 'J. Kontinen, A. Meier, Y. Mahmood, in: Logical Foundations of Computer Science,
Springer International Publishing, Cham, 2021.'
date_created: 2023-07-03T11:36:33Z
date_updated: 2023-07-03T11:44:42Z
doi: 10.1007/978-3-030-93100-1_9
language:
- iso: eng
place: Cham
publication: Logical Foundations of Computer Science
publication_identifier:
isbn:
- '9783030930998'
- '9783030931001'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: A Parameterized View on the Complexity of Dependence Logic
type: conference
user_id: '99353'
year: '2021'
...
---
_id: '45640'
abstract:
- lang: eng
text: "I study a dynamic variant of the Dixitâ\x80\x93Stiglitz (Am Econ Rev 67(3),
1977) model of monopolistic competition by introducing price stickiness à la
Fershtman and Kamien (Econometrica 55(5), 1987). The analysis is restricted to
bounded quantity and price paths that fulfill the necessary conditions for an
open-loop Nash equilibrium. I show that there exists a symmetric steady state
and that its stability depends on the degree of product differentiation. When
moving from complements to perfect substitutes, the steady state is either a locally
asymptotically unstable (spiral) source, a stable (spiral) sink or a saddle point.
I further apply the Hopf bifurcation theorem and prove the existence of limit
cycles, when passing from a stable to an unstable steady state. Lastly, I provide
a numerical example and show that there exists a stable limit cycle."
author:
- first_name: Simon
full_name: Hoof, Simon
last_name: Hoof
citation:
ama: Hoof S. Dynamic Monopolistic Competition. Journal of Optimization Theory
and Applications. 2021;189(2).
apa: Hoof, S. (2021). Dynamic Monopolistic Competition. Journal of Optimization
Theory and Applications, 189(2).
bibtex: '@article{Hoof_2021, title={Dynamic Monopolistic Competition}, volume={189},
number={2}, journal={Journal of Optimization Theory and Applications}, publisher={Springer},
author={Hoof, Simon}, year={2021} }'
chicago: Hoof, Simon. “Dynamic Monopolistic Competition.” Journal of Optimization
Theory and Applications 189, no. 2 (2021).
ieee: S. Hoof, “Dynamic Monopolistic Competition,” Journal of Optimization Theory
and Applications, vol. 189, no. 2, 2021.
mla: Hoof, Simon. “Dynamic Monopolistic Competition.” Journal of Optimization
Theory and Applications, vol. 189, no. 2, Springer, 2021.
short: S. Hoof, Journal of Optimization Theory and Applications 189 (2021).
date_created: 2023-06-15T14:05:25Z
date_updated: 2023-07-05T07:23:54Z
department:
- _id: '205'
- _id: '475'
intvolume: ' 189'
issue: '2'
language:
- iso: eng
project:
- _id: '7'
grant_number: '160364472'
name: 'SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation
(Subproject A3)'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
publication: Journal of Optimization Theory and Applications
publication_identifier:
issn:
- 1573-2878
publication_status: published
publisher: Springer
quality_controlled: '1'
status: public
title: Dynamic Monopolistic Competition
type: journal_article
user_id: '477'
volume: 189
year: '2021'
...
---
_id: '45616'
abstract:
- lang: eng
text: Aggregation metrics in reputation systems are important for overcoming information
overload. When using these metrics, technical aggregation functions such as the
arithmetic mean are implemented to measure the valence of product ratings. However,
it is unclear whether the implemented aggregation functions match the inherent
aggregation patterns of customers. In our experiment, we elicit customers' aggregation
heuristics and contrast these with reference functions. Our findings indicate
that, overall, the arithmetic mean performs best in comparison with other aggregation
functions. However, our analysis on an individual level reveals heterogeneous
aggregation patterns. Major clusters exhibit a binary bias (i.e., an over-weighting
of moderate ratings and under-weighting of extreme ratings) in combination with
the arithmetic mean. Minor clusters focus on 1-star ratings or negative (i.e.,
1-star and 2-star) ratings. Thereby, inherent aggregation patterns are neither
affected by variation of provided information nor by individual characteristics
such as experience, risk attitudes, or demographics.
author:
- first_name: Dirk
full_name: van Straaten, Dirk
id: '10311'
last_name: van Straaten
- first_name: Vitalik
full_name: Melnikov, Vitalik
id: '58747'
last_name: Melnikov
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Behnud
full_name: Mir Djawadi, Behnud
id: '26032'
last_name: Mir Djawadi
orcid: 0000-0002-6271-5912
- first_name: René
full_name: Fahr, René
id: '111'
last_name: Fahr
citation:
ama: 'van Straaten D, Melnikov V, Hüllermeier E, Mir Djawadi B, Fahr R. Accounting
for Heuristics in Reputation Systems: An Interdisciplinary Approach on Aggregation
Processes. Vol 72.; 2021.'
apa: 'van Straaten, D., Melnikov, V., Hüllermeier, E., Mir Djawadi, B., & Fahr,
R. (2021). Accounting for Heuristics in Reputation Systems: An Interdisciplinary
Approach on Aggregation Processes (Vol. 72).'
bibtex: '@book{van Straaten_Melnikov_Hüllermeier_Mir Djawadi_Fahr_2021, series={Working
Papers Dissertations}, title={Accounting for Heuristics in Reputation Systems:
An Interdisciplinary Approach on Aggregation Processes}, volume={72}, author={van
Straaten, Dirk and Melnikov, Vitalik and Hüllermeier, Eyke and Mir Djawadi, Behnud
and Fahr, René}, year={2021}, collection={Working Papers Dissertations} }'
chicago: 'Straaten, Dirk van, Vitalik Melnikov, Eyke Hüllermeier, Behnud Mir Djawadi,
and René Fahr. Accounting for Heuristics in Reputation Systems: An Interdisciplinary
Approach on Aggregation Processes. Vol. 72. Working Papers Dissertations,
2021.'
ieee: 'D. van Straaten, V. Melnikov, E. Hüllermeier, B. Mir Djawadi, and R. Fahr,
Accounting for Heuristics in Reputation Systems: An Interdisciplinary Approach
on Aggregation Processes, vol. 72. 2021.'
mla: 'van Straaten, Dirk, et al. Accounting for Heuristics in Reputation Systems:
An Interdisciplinary Approach on Aggregation Processes. 2021.'
short: 'D. van Straaten, V. Melnikov, E. Hüllermeier, B. Mir Djawadi, R. Fahr, Accounting
for Heuristics in Reputation Systems: An Interdisciplinary Approach on Aggregation
Processes, 2021.'
date_created: 2023-06-15T08:23:33Z
date_updated: 2023-07-05T07:27:17Z
intvolume: ' 72'
language:
- iso: eng
project:
- _id: '8'
grant_number: '160364472'
name: 'SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen
(Subproject A4)'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
series_title: Working Papers Dissertations
status: public
title: 'Accounting for Heuristics in Reputation Systems: An Interdisciplinary Approach
on Aggregation Processes'
type: working_paper
user_id: '477'
volume: 72
year: '2021'
...
---
_id: '45617'
author:
- first_name: Dirk
full_name: van Straaten, Dirk
id: '10311'
last_name: van Straaten
citation:
ama: van Straaten D. Incentive Schemes in Customer Rating Systems - Comparing
the Effects of Unconditional and Conditional Rebates on Intrinsic Motivation.
Vol 71.; 2021.
apa: van Straaten, D. (2021). Incentive Schemes in Customer Rating Systems -
Comparing the Effects of Unconditional and Conditional Rebates on Intrinsic Motivation
(Vol. 71).
bibtex: '@book{van Straaten_2021, series={Working Papers Dissertations}, title={Incentive
Schemes in Customer Rating Systems - Comparing the Effects of Unconditional and
Conditional Rebates on Intrinsic Motivation}, volume={71}, author={van Straaten,
Dirk}, year={2021}, collection={Working Papers Dissertations} }'
chicago: Straaten, Dirk van. Incentive Schemes in Customer Rating Systems - Comparing
the Effects of Unconditional and Conditional Rebates on Intrinsic Motivation.
Vol. 71. Working Papers Dissertations, 2021.
ieee: D. van Straaten, Incentive Schemes in Customer Rating Systems - Comparing
the Effects of Unconditional and Conditional Rebates on Intrinsic Motivation,
vol. 71. 2021.
mla: van Straaten, Dirk. Incentive Schemes in Customer Rating Systems - Comparing
the Effects of Unconditional and Conditional Rebates on Intrinsic Motivation.
2021.
short: D. van Straaten, Incentive Schemes in Customer Rating Systems - Comparing
the Effects of Unconditional and Conditional Rebates on Intrinsic Motivation,
2021.
date_created: 2023-06-15T08:26:22Z
date_updated: 2023-07-05T07:26:14Z
intvolume: ' 71'
language:
- iso: eng
project:
- _id: '8'
grant_number: '160364472'
name: 'SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen
(Subproject A4)'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
series_title: Working Papers Dissertations
status: public
title: Incentive Schemes in Customer Rating Systems - Comparing the Effects of Unconditional
and Conditional Rebates on Intrinsic Motivation
type: working_paper
user_id: '477'
volume: 71
year: '2021'
...
---
_id: '45618'
author:
- first_name: Dirk
full_name: van Straaten, Dirk
id: '10311'
last_name: van Straaten
- first_name: René
full_name: Fahr, René
id: '111'
last_name: Fahr
citation:
ama: van Straaten D, Fahr R. Fighting Fire with Fire - Overcoming Ambiguity Aversion
by Introducing More Ambiguity. Vol 73.; 2021.
apa: van Straaten, D., & Fahr, R. (2021). Fighting Fire with Fire - Overcoming
Ambiguity Aversion by Introducing more Ambiguity (Vol. 73).
bibtex: '@book{van Straaten_Fahr_2021, series={Working Papers Dissertations}, title={Fighting
Fire with Fire - Overcoming Ambiguity Aversion by Introducing more Ambiguity},
volume={73}, author={van Straaten, Dirk and Fahr, René}, year={2021}, collection={Working
Papers Dissertations} }'
chicago: Straaten, Dirk van, and René Fahr. Fighting Fire with Fire - Overcoming
Ambiguity Aversion by Introducing More Ambiguity. Vol. 73. Working Papers
Dissertations, 2021.
ieee: D. van Straaten and R. Fahr, Fighting Fire with Fire - Overcoming Ambiguity
Aversion by Introducing more Ambiguity, vol. 73. 2021.
mla: van Straaten, Dirk, and René Fahr. Fighting Fire with Fire - Overcoming
Ambiguity Aversion by Introducing More Ambiguity. 2021.
short: D. van Straaten, R. Fahr, Fighting Fire with Fire - Overcoming Ambiguity
Aversion by Introducing More Ambiguity, 2021.
date_created: 2023-06-15T08:28:34Z
date_updated: 2023-07-05T07:27:57Z
intvolume: ' 73'
language:
- iso: eng
project:
- _id: '8'
grant_number: '160364472'
name: 'SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen
(Subproject A4)'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
series_title: Working Papers Dissertations
status: public
title: Fighting Fire with Fire - Overcoming Ambiguity Aversion by Introducing more
Ambiguity
type: working_paper
user_id: '477'
volume: 73
year: '2021'
...
---
_id: '45788'
author:
- first_name: Jonas
full_name: Bülling, Jonas
last_name: Bülling
citation:
ama: 'Bülling J. Political Speaker Transfer: Learning to Generate Text in the
Styles of Barack Obama and Donald Trump.; 2021.'
apa: 'Bülling, J. (2021). Political Speaker Transfer: Learning to Generate Text
in the Styles of Barack Obama and Donald Trump.'
bibtex: '@book{Bülling_2021, title={Political Speaker Transfer: Learning to Generate
Text in the Styles of Barack Obama and Donald Trump}, author={Bülling, Jonas},
year={2021} }'
chicago: 'Bülling, Jonas. Political Speaker Transfer: Learning to Generate Text
in the Styles of Barack Obama and Donald Trump, 2021.'
ieee: 'J. Bülling, Political Speaker Transfer: Learning to Generate Text in the
Styles of Barack Obama and Donald Trump. 2021.'
mla: 'Bülling, Jonas. Political Speaker Transfer: Learning to Generate Text in
the Styles of Barack Obama and Donald Trump. 2021.'
short: 'J. Bülling, Political Speaker Transfer: Learning to Generate Text in the
Styles of Barack Obama and Donald Trump, 2021.'
date_created: 2023-06-27T12:54:30Z
date_updated: 2023-07-05T07:32:18Z
department:
- _id: '600'
language:
- iso: eng
project:
- _id: '9'
grant_number: '160364472'
name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject
B1)'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
status: public
supervisor:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
title: 'Political Speaker Transfer: Learning to Generate Text in the Styles of Barack
Obama and Donald Trump'
type: mastersthesis
user_id: '477'
year: '2021'
...
---
_id: '45787'
author:
- first_name: Avishek
full_name: Mishra, Avishek
last_name: Mishra
citation:
ama: Mishra A. Computational Text Professionalization Using Neural Sequence-to-Sequence
Models.; 2021.
apa: Mishra, A. (2021). Computational Text Professionalization using Neural Sequence-to-Sequence
Models.
bibtex: '@book{Mishra_2021, title={Computational Text Professionalization using
Neural Sequence-to-Sequence Models}, author={Mishra, Avishek}, year={2021} }'
chicago: Mishra, Avishek. Computational Text Professionalization Using Neural
Sequence-to-Sequence Models, 2021.
ieee: A. Mishra, Computational Text Professionalization using Neural Sequence-to-Sequence
Models. 2021.
mla: Mishra, Avishek. Computational Text Professionalization Using Neural Sequence-to-Sequence
Models. 2021.
short: A. Mishra, Computational Text Professionalization Using Neural Sequence-to-Sequence
Models, 2021.
date_created: 2023-06-27T12:51:08Z
date_updated: 2023-07-05T07:32:50Z
department:
- _id: '600'
language:
- iso: eng
project:
- _id: '9'
grant_number: '160364472'
name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject
B1)'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
status: public
supervisor:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
title: Computational Text Professionalization using Neural Sequence-to-Sequence Models
type: mastersthesis
user_id: '477'
year: '2021'
...
---
_id: '30909'
author:
- first_name: Lennart
full_name: Clausing, Lennart
id: '74287'
last_name: Clausing
orcid: 0000-0003-3789-6034
citation:
ama: 'Clausing L. ReconOS64: High-Performance Embedded Computing for Industrial
Analytics on a Reconfigurable System-on-Chip. In: Proceedings of the 11th International
Symposium on Highly Efficient Accelerators and Reconfigurable Technologies.
ACM; 2021. doi:10.1145/3468044.3468056'
apa: 'Clausing, L. (2021). ReconOS64: High-Performance Embedded Computing for Industrial
Analytics on a Reconfigurable System-on-Chip. Proceedings of the 11th International
Symposium on Highly Efficient Accelerators and Reconfigurable Technologies.
https://doi.org/10.1145/3468044.3468056'
bibtex: '@inproceedings{Clausing_2021, title={ReconOS64: High-Performance Embedded
Computing for Industrial Analytics on a Reconfigurable System-on-Chip}, DOI={10.1145/3468044.3468056}, booktitle={Proceedings
of the 11th International Symposium on Highly Efficient Accelerators and Reconfigurable
Technologies}, publisher={ACM}, author={Clausing, Lennart}, year={2021} }'
chicago: 'Clausing, Lennart. “ReconOS64: High-Performance Embedded Computing for
Industrial Analytics on a Reconfigurable System-on-Chip.” In Proceedings of
the 11th International Symposium on Highly Efficient Accelerators and Reconfigurable
Technologies. ACM, 2021. https://doi.org/10.1145/3468044.3468056.'
ieee: 'L. Clausing, “ReconOS64: High-Performance Embedded Computing for Industrial
Analytics on a Reconfigurable System-on-Chip,” 2021, doi: 10.1145/3468044.3468056.'
mla: 'Clausing, Lennart. “ReconOS64: High-Performance Embedded Computing for Industrial
Analytics on a Reconfigurable System-on-Chip.” Proceedings of the 11th International
Symposium on Highly Efficient Accelerators and Reconfigurable Technologies,
ACM, 2021, doi:10.1145/3468044.3468056.'
short: 'L. Clausing, in: Proceedings of the 11th International Symposium on Highly
Efficient Accelerators and Reconfigurable Technologies, ACM, 2021.'
date_created: 2022-04-18T10:17:47Z
date_updated: 2023-07-09T13:09:11Z
department:
- _id: '78'
doi: 10.1145/3468044.3468056
language:
- iso: eng
project:
- _id: '83'
name: 'SFB 901 - T1: SFB 901 -Subproject T1'
- _id: '82'
name: 'SFB 901 - T: SFB 901 - Project Area T'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
publication: Proceedings of the 11th International Symposium on Highly Efficient Accelerators
and Reconfigurable Technologies
publication_status: published
publisher: ACM
status: public
title: 'ReconOS64: High-Performance Embedded Computing for Industrial Analytics on
a Reconfigurable System-on-Chip'
type: conference
user_id: '398'
year: '2021'
...
---
_id: '34673'
article_number: '96'
author:
- first_name: Tobias
full_name: Black, Tobias
id: '23686'
last_name: Black
orcid: 0000-0001-9963-0800
- first_name: Mario
full_name: Fuest, Mario
last_name: Fuest
- first_name: Johannes
full_name: Lankeit, Johannes
last_name: Lankeit
citation:
ama: Black T, Fuest M, Lankeit J. Relaxed parameter conditions for chemotactic collapse
in logistic-type parabolic–elliptic Keller–Segel systems. Zeitschrift für angewandte
Mathematik und Physik. 2021;72(3). doi:10.1007/s00033-021-01524-8
apa: Black, T., Fuest, M., & Lankeit, J. (2021). Relaxed parameter conditions
for chemotactic collapse in logistic-type parabolic–elliptic Keller–Segel systems.
Zeitschrift Für Angewandte Mathematik Und Physik, 72(3), Article
96. https://doi.org/10.1007/s00033-021-01524-8
bibtex: '@article{Black_Fuest_Lankeit_2021, title={Relaxed parameter conditions
for chemotactic collapse in logistic-type parabolic–elliptic Keller–Segel systems},
volume={72}, DOI={10.1007/s00033-021-01524-8},
number={396}, journal={Zeitschrift für angewandte Mathematik und Physik}, publisher={Springer
Science and Business Media LLC}, author={Black, Tobias and Fuest, Mario and Lankeit,
Johannes}, year={2021} }'
chicago: Black, Tobias, Mario Fuest, and Johannes Lankeit. “Relaxed Parameter Conditions
for Chemotactic Collapse in Logistic-Type Parabolic–Elliptic Keller–Segel Systems.”
Zeitschrift Für Angewandte Mathematik Und Physik 72, no. 3 (2021). https://doi.org/10.1007/s00033-021-01524-8.
ieee: 'T. Black, M. Fuest, and J. Lankeit, “Relaxed parameter conditions for chemotactic
collapse in logistic-type parabolic–elliptic Keller–Segel systems,” Zeitschrift
für angewandte Mathematik und Physik, vol. 72, no. 3, Art. no. 96, 2021, doi:
10.1007/s00033-021-01524-8.'
mla: Black, Tobias, et al. “Relaxed Parameter Conditions for Chemotactic Collapse
in Logistic-Type Parabolic–Elliptic Keller–Segel Systems.” Zeitschrift Für
Angewandte Mathematik Und Physik, vol. 72, no. 3, 96, Springer Science and
Business Media LLC, 2021, doi:10.1007/s00033-021-01524-8.
short: T. Black, M. Fuest, J. Lankeit, Zeitschrift Für Angewandte Mathematik Und
Physik 72 (2021).
date_created: 2022-12-21T09:48:36Z
date_updated: 2023-07-10T11:39:23Z
department:
- _id: '34'
- _id: '10'
- _id: '90'
doi: 10.1007/s00033-021-01524-8
intvolume: ' 72'
issue: '3'
keyword:
- Applied Mathematics
- General Physics and Astronomy
- General Mathematics
language:
- iso: eng
publication: Zeitschrift für angewandte Mathematik und Physik
publication_identifier:
issn:
- 0044-2275
- 1420-9039
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Relaxed parameter conditions for chemotactic collapse in logistic-type parabolic–elliptic
Keller–Segel systems
type: journal_article
user_id: '23686'
volume: 72
year: '2021'
...