---
_id: '60189'
abstract:
- lang: eng
text: AbstractSeveral state‐of‐the‐art algorithms
for semi‐structured hexahedral meshing involve a so called quantization
step to decide on the integer DoFs of the meshing problem, corresponding to the
number of hexahedral elements to embed into certain regions of the domain. Existing
reliable methods for quantization are based on solving a sequence of integer
quadratic programs (IQP). Solving these in a timely and predictable
manner with general‐purpose solvers is a challenge, even more so in the open‐source
field. We present here an alternative robust and efficient quantization scheme
that is instead based on solving a series of continuous linear programs
(LP), for which solver availability and efficiency are not an issue. In our formulation,
such LPs are used to determine where inflation or deflation of virtual hexahedral
sheets are favorable. We compare our method to two implementations of the former
IQP formulation (using a commercial and an open‐source MIP solver, respectively),
finding that (a) the solutions found by our method are near‐optimal or optimal
in most cases, (b) these solutions are found within a much more predictable time
frame, and (c) the state of the art run time is outperformed, in the case of using
the open‐source solver by orders of magnitude.
author:
- first_name: Hendrik
full_name: Brückler, Hendrik
id: '115694'
last_name: Brückler
- first_name: David
full_name: Bommes, David
last_name: Bommes
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
citation:
ama: Brückler H, Bommes D, Campen M. Integer‐Sheet‐Pump Quantization for Hexahedral
Meshing. Comput Graph Forum. 2024;43(5). doi:10.1111/cgf.15131
apa: Brückler, H., Bommes, D., & Campen, M. (2024). Integer‐Sheet‐Pump Quantization
for Hexahedral Meshing. Comput. Graph. Forum, 43(5). https://doi.org/10.1111/cgf.15131
bibtex: '@article{Brückler_Bommes_Campen_2024, title={Integer‐Sheet‐Pump Quantization
for Hexahedral Meshing}, volume={43}, DOI={10.1111/cgf.15131},
number={5}, journal={Comput. Graph. Forum}, publisher={Wiley}, author={Brückler,
Hendrik and Bommes, David and Campen, Marcel}, year={2024} }'
chicago: Brückler, Hendrik, David Bommes, and Marcel Campen. “Integer‐Sheet‐Pump
Quantization for Hexahedral Meshing.” Comput. Graph. Forum 43, no. 5 (2024).
https://doi.org/10.1111/cgf.15131.
ieee: 'H. Brückler, D. Bommes, and M. Campen, “Integer‐Sheet‐Pump Quantization for
Hexahedral Meshing,” Comput. Graph. Forum, vol. 43, no. 5, 2024, doi: 10.1111/cgf.15131.'
mla: Brückler, Hendrik, et al. “Integer‐Sheet‐Pump Quantization for Hexahedral Meshing.”
Comput. Graph. Forum, vol. 43, no. 5, Wiley, 2024, doi:10.1111/cgf.15131.
short: H. Brückler, D. Bommes, M. Campen, Comput. Graph. Forum 43 (2024).
date_created: 2025-06-11T13:47:29Z
date_updated: 2025-06-23T09:01:46Z
department:
- _id: '969'
doi: 10.1111/cgf.15131
extern: '1'
intvolume: ' 43'
issue: '5'
language:
- iso: eng
publication: Comput. Graph. Forum
publication_identifier:
issn:
- 0167-7055
- 1467-8659
publication_status: published
publisher: Wiley
status: public
title: Integer‐Sheet‐Pump Quantization for Hexahedral Meshing
type: journal_article
user_id: '114904'
volume: 43
year: '2024'
...
---
_id: '60240'
author:
- first_name: Ingmar
full_name: Ludwig, Ingmar
id: '116667'
last_name: Ludwig
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
citation:
ama: Ludwig I, Campen M. Strictly Conservative Neural Implicits. Comput Graph
Forum. 2024;43(7):i–xxii. doi:10.1111/CGF.15241
apa: Ludwig, I., & Campen, M. (2024). Strictly Conservative Neural Implicits.
Comput. Graph. Forum, 43(7), i–xxii. https://doi.org/10.1111/CGF.15241
bibtex: '@article{Ludwig_Campen_2024, title={Strictly Conservative Neural Implicits},
volume={43}, DOI={10.1111/CGF.15241},
number={7}, journal={Comput. Graph. Forum}, author={Ludwig, Ingmar and Campen,
Marcel}, year={2024}, pages={i–xxii} }'
chicago: 'Ludwig, Ingmar, and Marcel Campen. “Strictly Conservative Neural Implicits.”
Comput. Graph. Forum 43, no. 7 (2024): i–xxii. https://doi.org/10.1111/CGF.15241.'
ieee: 'I. Ludwig and M. Campen, “Strictly Conservative Neural Implicits,” Comput.
Graph. Forum, vol. 43, no. 7, pp. i–xxii, 2024, doi: 10.1111/CGF.15241.'
mla: Ludwig, Ingmar, and Marcel Campen. “Strictly Conservative Neural Implicits.”
Comput. Graph. Forum, vol. 43, no. 7, 2024, pp. i–xxii, doi:10.1111/CGF.15241.
short: I. Ludwig, M. Campen, Comput. Graph. Forum 43 (2024) i–xxii.
date_created: 2025-06-17T07:46:09Z
date_updated: 2025-06-23T09:01:59Z
department:
- _id: '969'
doi: 10.1111/CGF.15241
extern: '1'
intvolume: ' 43'
issue: '7'
language:
- iso: eng
page: i–xxii
publication: Comput. Graph. Forum
status: public
title: Strictly Conservative Neural Implicits
type: journal_article
user_id: '114904'
volume: 43
year: '2024'
...
---
_id: '60314'
abstract:
- lang: eng
text: A method for the construction of bijective volumetric maps between
3D shapes is presented. Arbitrary shapes of ball-topology are supported, overcoming
restrictions of previous methods to convex or star-shaped targets. In essence,
the mapping problem is decomposed into a set of simpler mapping problems, each
of which can be solved with previous methods for discrete star-shaped mapping
problems. Addressing the key challenges in this endeavor, algorithms are described
to reliably construct structurally compatible partitions of two shapes with constraints
regarding star-shapedness and to compute a parsimonious common refinement of two
triangulations.
author:
- first_name: Steffen
full_name: Hinderink, Steffen
id: '116615'
last_name: Hinderink
- first_name: Hendrik
full_name: Brückler, Hendrik
id: '115694'
last_name: Brückler
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
citation:
ama: Hinderink S, Brückler H, Campen M. Bijective Volumetric Mapping via Star Decomposition.
ACM Transactions on Graphics. 2024;43(6):1-11. doi:10.1145/3687950
apa: Hinderink, S., Brückler, H., & Campen, M. (2024). Bijective Volumetric
Mapping via Star Decomposition. ACM Transactions on Graphics, 43(6),
1–11. https://doi.org/10.1145/3687950
bibtex: '@article{Hinderink_Brückler_Campen_2024, title={Bijective Volumetric Mapping
via Star Decomposition}, volume={43}, DOI={10.1145/3687950},
number={6}, journal={ACM Transactions on Graphics}, publisher={Association for
Computing Machinery (ACM)}, author={Hinderink, Steffen and Brückler, Hendrik and
Campen, Marcel}, year={2024}, pages={1–11} }'
chicago: 'Hinderink, Steffen, Hendrik Brückler, and Marcel Campen. “Bijective Volumetric
Mapping via Star Decomposition.” ACM Transactions on Graphics 43, no. 6
(2024): 1–11. https://doi.org/10.1145/3687950.'
ieee: 'S. Hinderink, H. Brückler, and M. Campen, “Bijective Volumetric Mapping via
Star Decomposition,” ACM Transactions on Graphics, vol. 43, no. 6, pp.
1–11, 2024, doi: 10.1145/3687950.'
mla: Hinderink, Steffen, et al. “Bijective Volumetric Mapping via Star Decomposition.”
ACM Transactions on Graphics, vol. 43, no. 6, Association for Computing
Machinery (ACM), 2024, pp. 1–11, doi:10.1145/3687950.
short: S. Hinderink, H. Brückler, M. Campen, ACM Transactions on Graphics 43 (2024)
1–11.
date_created: 2025-06-23T09:09:51Z
date_updated: 2025-07-14T12:33:54Z
department:
- _id: '969'
doi: 10.1145/3687950
extern: '1'
intvolume: ' 43'
issue: '6'
language:
- iso: eng
page: 1-11
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- 0730-0301
- 1557-7368
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Bijective Volumetric Mapping via Star Decomposition
type: journal_article
user_id: '117512'
volume: 43
year: '2024'
...
---
_id: '60331'
abstract:
- lang: eng
text: "\r\n We present a novel algorithm to map ball-topology
tetrahedral meshes onto star-shaped domains with guarantees regarding bijectivity.
Our algorithm is based on the recently introduced idea of Shrink-and-Expand, where
images of interior vertices are initially clustered at one point (Shrink-), before
being sequentially moved to non-degenerate positions yielding a bijective map
(-and-Expand). In this context, we introduce the concept of the\r\n cluster
mesh\r\n , i.e. the unexpanded interior mesh consisting
of geometrically degenerate simplices. Using local, per-vertex connectivity information
solely from the cluster mesh, we show that a viable expansion sequence guaranteed
to produce a bijective map can always be found as long as the mesh is\r\n shellable.\r\n
\ In addition to robustness guarantees for this ubiquitous class of
inputs, other practically relevant benefits include improved parsimony and reduced
algorithmic complexity. While inheriting some of the worst-case high run time
requirements of the state of the art, significant acceleration for the average
case is experimentally demonstrated.\r\n "
author:
- first_name: Valentin Zénon
full_name: Nigolian, Valentin Zénon
last_name: Nigolian
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
- first_name: David
full_name: Bommes, David
last_name: Bommes
citation:
ama: Nigolian VZ, Campen M, Bommes D. A Progressive Embedding Approach to Bijective
Tetrahedral Maps driven by Cluster Mesh Topology. ACM Transactions on Graphics.
2024;43(6):1-14. doi:10.1145/3687992
apa: Nigolian, V. Z., Campen, M., & Bommes, D. (2024). A Progressive Embedding
Approach to Bijective Tetrahedral Maps driven by Cluster Mesh Topology. ACM
Transactions on Graphics, 43(6), 1–14. https://doi.org/10.1145/3687992
bibtex: '@article{Nigolian_Campen_Bommes_2024, title={A Progressive Embedding Approach
to Bijective Tetrahedral Maps driven by Cluster Mesh Topology}, volume={43}, DOI={10.1145/3687992}, number={6}, journal={ACM
Transactions on Graphics}, publisher={Association for Computing Machinery (ACM)},
author={Nigolian, Valentin Zénon and Campen, Marcel and Bommes, David}, year={2024},
pages={1–14} }'
chicago: 'Nigolian, Valentin Zénon, Marcel Campen, and David Bommes. “A Progressive
Embedding Approach to Bijective Tetrahedral Maps Driven by Cluster Mesh Topology.”
ACM Transactions on Graphics 43, no. 6 (2024): 1–14. https://doi.org/10.1145/3687992.'
ieee: 'V. Z. Nigolian, M. Campen, and D. Bommes, “A Progressive Embedding Approach
to Bijective Tetrahedral Maps driven by Cluster Mesh Topology,” ACM Transactions
on Graphics, vol. 43, no. 6, pp. 1–14, 2024, doi: 10.1145/3687992.'
mla: Nigolian, Valentin Zénon, et al. “A Progressive Embedding Approach to Bijective
Tetrahedral Maps Driven by Cluster Mesh Topology.” ACM Transactions on Graphics,
vol. 43, no. 6, Association for Computing Machinery (ACM), 2024, pp. 1–14, doi:10.1145/3687992.
short: V.Z. Nigolian, M. Campen, D. Bommes, ACM Transactions on Graphics 43 (2024)
1–14.
date_created: 2025-06-23T10:32:28Z
date_updated: 2025-07-14T12:48:45Z
department:
- _id: '969'
doi: 10.1145/3687992
extern: '1'
intvolume: ' 43'
issue: '6'
language:
- iso: eng
page: 1-14
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- 0730-0301
- 1557-7368
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: A Progressive Embedding Approach to Bijective Tetrahedral Maps driven by Cluster
Mesh Topology
type: journal_article
user_id: '117512'
volume: 43
year: '2024'
...
---
_id: '55637'
author:
- first_name: Anastassija
full_name: Kostan, Anastassija
last_name: Kostan
- first_name: Sara
full_name: Olschar, Sara
last_name: Olschar
- first_name: Lucy
full_name: Simko, Lucy
last_name: Simko
- first_name: Yasemin
full_name: Acar, Yasemin
id: '94636'
last_name: Acar
citation:
ama: 'Kostan A, Olschar S, Simko L, Acar Y. Exploring digital security and privacy
in relative poverty in Germany through qualitative interviews. In: Balzarotti
D, Xu W, eds. 33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia,
PA, USA, August 14-16, 2024. USENIX Association; 2024.'
apa: Kostan, A., Olschar, S., Simko, L., & Acar, Y. (2024). Exploring digital
security and privacy in relative poverty in Germany through qualitative interviews.
In D. Balzarotti & W. Xu (Eds.), 33rd USENIX Security Symposium, USENIX
Security 2024, Philadelphia, PA, USA, August 14-16, 2024. USENIX Association.
bibtex: '@inproceedings{Kostan_Olschar_Simko_Acar_2024, title={Exploring digital
security and privacy in relative poverty in Germany through qualitative interviews},
booktitle={33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia,
PA, USA, August 14-16, 2024}, publisher={USENIX Association}, author={Kostan,
Anastassija and Olschar, Sara and Simko, Lucy and Acar, Yasemin}, editor={Balzarotti,
Davide and Xu, Wenyuan}, year={2024} }'
chicago: Kostan, Anastassija, Sara Olschar, Lucy Simko, and Yasemin Acar. “Exploring
Digital Security and Privacy in Relative Poverty in Germany through Qualitative
Interviews.” In 33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia,
PA, USA, August 14-16, 2024, edited by Davide Balzarotti and Wenyuan Xu. USENIX
Association, 2024.
ieee: A. Kostan, S. Olschar, L. Simko, and Y. Acar, “Exploring digital security
and privacy in relative poverty in Germany through qualitative interviews,” in
33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA,
August 14-16, 2024, 2024.
mla: Kostan, Anastassija, et al. “Exploring Digital Security and Privacy in Relative
Poverty in Germany through Qualitative Interviews.” 33rd USENIX Security Symposium,
USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024, edited by
Davide Balzarotti and Wenyuan Xu, USENIX Association, 2024.
short: 'A. Kostan, S. Olschar, L. Simko, Y. Acar, in: D. Balzarotti, W. Xu (Eds.),
33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August
14-16, 2024, USENIX Association, 2024.'
date_created: 2024-08-19T08:27:57Z
date_updated: 2025-09-04T11:19:24Z
department:
- _id: '740'
editor:
- first_name: Davide
full_name: Balzarotti, Davide
last_name: Balzarotti
- first_name: Wenyuan
full_name: Xu, Wenyuan
last_name: Xu
language:
- iso: eng
publication: 33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA,
USA, August 14-16, 2024
publisher: USENIX Association
status: public
title: Exploring digital security and privacy in relative poverty in Germany through
qualitative interviews
type: conference
user_id: '15458'
year: '2024'
...
---
_id: '61172'
article_number: '114352'
author:
- first_name: Sam
full_name: Coy, Sam
last_name: Coy
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Philipp
full_name: Schneider, Philipp
last_name: Schneider
- first_name: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: Coy S, Czumaj A, Scheideler C, Schneider P, Werthmann J. Routing Schemes for
Hybrid Communication Networks. Theoretical Computer Science. 2024;985.
doi:10.1016/j.tcs.2023.114352
apa: Coy, S., Czumaj, A., Scheideler, C., Schneider, P., & Werthmann, J. (2024).
Routing Schemes for Hybrid Communication Networks. Theoretical Computer Science,
985, Article 114352. https://doi.org/10.1016/j.tcs.2023.114352
bibtex: '@article{Coy_Czumaj_Scheideler_Schneider_Werthmann_2024, title={Routing
Schemes for Hybrid Communication Networks}, volume={985}, DOI={10.1016/j.tcs.2023.114352},
number={114352}, journal={Theoretical Computer Science}, publisher={Elsevier BV},
author={Coy, Sam and Czumaj, Artur and Scheideler, Christian and Schneider, Philipp
and Werthmann, Julian}, year={2024} }'
chicago: Coy, Sam, Artur Czumaj, Christian Scheideler, Philipp Schneider, and Julian
Werthmann. “Routing Schemes for Hybrid Communication Networks.” Theoretical
Computer Science 985 (2024). https://doi.org/10.1016/j.tcs.2023.114352.
ieee: 'S. Coy, A. Czumaj, C. Scheideler, P. Schneider, and J. Werthmann, “Routing
Schemes for Hybrid Communication Networks,” Theoretical Computer Science,
vol. 985, Art. no. 114352, 2024, doi: 10.1016/j.tcs.2023.114352.'
mla: Coy, Sam, et al. “Routing Schemes for Hybrid Communication Networks.” Theoretical
Computer Science, vol. 985, 114352, Elsevier BV, 2024, doi:10.1016/j.tcs.2023.114352.
short: S. Coy, A. Czumaj, C. Scheideler, P. Schneider, J. Werthmann, Theoretical
Computer Science 985 (2024).
date_created: 2025-09-10T14:26:11Z
date_updated: 2025-09-10T14:52:21Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2023.114352
intvolume: ' 985'
language:
- iso: eng
project:
- _id: '5'
name: 'SFB 901; TP A1: Möglichkeiten und Grenzen lokaler Strategien in dynamischen
Netzen'
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier BV
status: public
title: Routing Schemes for Hybrid Communication Networks
type: journal_article
user_id: '50024'
volume: 985
year: '2024'
...
---
_id: '58377'
abstract:
- lang: eng
text: "The connection between inconsistent databases and Dung's abstract\r\nargumentation
framework has recently drawn growing interest. Specifically, an\r\ninconsistent
database, involving certain types of integrity constraints such as\r\nfunctional
and inclusion dependencies, can be viewed as an argumentation\r\nframework in
Dung's setting. Nevertheless, no prior work has explored the exact\r\nexpressive
power of Dung's theory of argumentation when compared to\r\ninconsistent databases
and integrity constraints. In this paper, we close this\r\ngap by arguing that
an argumentation framework can also be viewed as an\r\ninconsistent database.
We first establish a connection between subset-repairs\r\nfor databases and extensions
for AFs, considering conflict-free, naive,\r\nadmissible, and preferred semantics.
Further, we define a new family of\r\nattribute-based repairs based on the principle
of maximal content preservation.\r\nThe effectiveness of these repairs is then
highlighted by connecting them to\r\nstable, semi-stable, and stage semantics.
Our main contributions include\r\ntranslating an argumentation framework into
a database together with integrity\r\nconstraints. Moreover, this translation
can be achieved in polynomial time,\r\nwhich is essential in transferring complexity
results between the two\r\nformalisms."
author:
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Markus
full_name: Hecher, Markus
last_name: Hecher
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Mahmood Y, Hecher M, Ngonga Ngomo A-C. Dung’s Argumentation Framework: Unveiling
the Expressive Power with Inconsistent Databases. In: ; 2024. doi:10.1609/AAAI.V39I14.33651'
apa: 'Mahmood, Y., Hecher, M., & Ngonga Ngomo, A.-C. (2024). Dung’s Argumentation
Framework: Unveiling the Expressive Power with Inconsistent Databases. https://doi.org/10.1609/AAAI.V39I14.33651'
bibtex: '@inproceedings{Mahmood_Hecher_Ngonga Ngomo_2024, title={Dung’s Argumentation
Framework: Unveiling the Expressive Power with Inconsistent Databases}, DOI={10.1609/AAAI.V39I14.33651},
author={Mahmood, Yasir and Hecher, Markus and Ngonga Ngomo, Axel-Cyrille}, year={2024}
}'
chicago: 'Mahmood, Yasir, Markus Hecher, and Axel-Cyrille Ngonga Ngomo. “Dung’s
Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases,”
2024. https://doi.org/10.1609/AAAI.V39I14.33651.'
ieee: 'Y. Mahmood, M. Hecher, and A.-C. Ngonga Ngomo, “Dung’s Argumentation Framework:
Unveiling the Expressive Power with Inconsistent Databases,” 2024, doi: 10.1609/AAAI.V39I14.33651.'
mla: 'Mahmood, Yasir, et al. Dung’s Argumentation Framework: Unveiling the Expressive
Power with Inconsistent Databases. 2024, doi:10.1609/AAAI.V39I14.33651.'
short: 'Y. Mahmood, M. Hecher, A.-C. Ngonga Ngomo, in: 2024.'
date_created: 2025-01-27T15:30:41Z
date_updated: 2025-09-11T10:01:11Z
department:
- _id: '574'
doi: 10.1609/AAAI.V39I14.33651
external_id:
arxiv:
- '2412.11617'
language:
- iso: eng
project:
- _id: '121'
name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
maschinellen Lernens'
status: public
title: 'Dung''s Argumentation Framework: Unveiling the Expressive Power with Inconsistent
Databases'
type: conference
user_id: '99353'
year: '2024'
...
---
_id: '57238'
abstract:
- lang: eng
text: Abstract argumentation is a popular toolkit for modeling, evaluating,
and comparing arguments. Relationships between arguments are specified in argumentation
frameworks (AFs), and conditions are placed on sets (extensions) of arguments
that allow AFs to be evaluated. For more expressiveness, AFs are augmented with
acceptance conditions on directly interacting arguments or a constraint on the
admissible sets of arguments, resulting in dialectic frameworks or constrained
argumentation frameworks. In this paper, we consider flexible conditions for rejecting
an argument from an extension, which we call rejection conditions (RCs). On the
technical level, we associate each argument with a specific logic program. We
analyze the resulting complexity, including the structural parameter treewidth.
Rejection AFs are highly expressive, giving rise to natural problems on higher
levels of the polynomial hierarchy.
author:
- first_name: Johannes K.
full_name: Fichte, Johannes K.
last_name: Fichte
- first_name: Markus
full_name: Hecher, Markus
last_name: Hecher
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
citation:
ama: 'Fichte JK, Hecher M, Mahmood Y, Meier A. Rejection in Abstract Argumentation:
Harder Than Acceptance? In: Frontiers in Artificial Intelligence and Applications.
IOS Press; 2024. doi:10.3233/faia240867'
apa: 'Fichte, J. K., Hecher, M., Mahmood, Y., & Meier, A. (2024). Rejection
in Abstract Argumentation: Harder Than Acceptance? In Frontiers in Artificial
Intelligence and Applications. ECAI} 2024 - 27th European Conference on Artificial
Intelligence, Santiago de Compostela, Spain. IOS Press. https://doi.org/10.3233/faia240867'
bibtex: '@inbook{Fichte_Hecher_Mahmood_Meier_2024, title={Rejection in Abstract
Argumentation: Harder Than Acceptance?}, DOI={10.3233/faia240867},
booktitle={Frontiers in Artificial Intelligence and Applications}, publisher={IOS
Press}, author={Fichte, Johannes K. and Hecher, Markus and Mahmood, Yasir and
Meier, Arne}, year={2024} }'
chicago: 'Fichte, Johannes K., Markus Hecher, Yasir Mahmood, and Arne Meier. “Rejection
in Abstract Argumentation: Harder Than Acceptance?” In Frontiers in Artificial
Intelligence and Applications. IOS Press, 2024. https://doi.org/10.3233/faia240867.'
ieee: 'J. K. Fichte, M. Hecher, Y. Mahmood, and A. Meier, “Rejection in Abstract
Argumentation: Harder Than Acceptance?,” in Frontiers in Artificial Intelligence
and Applications, IOS Press, 2024.'
mla: 'Fichte, Johannes K., et al. “Rejection in Abstract Argumentation: Harder Than
Acceptance?” Frontiers in Artificial Intelligence and Applications, IOS
Press, 2024, doi:10.3233/faia240867.'
short: 'J.K. Fichte, M. Hecher, Y. Mahmood, A. Meier, in: Frontiers in Artificial
Intelligence and Applications, IOS Press, 2024.'
conference:
location: Santiago de Compostela, Spain
name: ECAI} 2024 - 27th European Conference on Artificial Intelligence
date_created: 2024-11-19T11:46:55Z
date_updated: 2025-09-11T10:01:52Z
department:
- _id: '574'
doi: 10.3233/faia240867
language:
- iso: eng
project:
- _id: '121'
name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
maschinellen Lernens'
publication: Frontiers in Artificial Intelligence and Applications
publication_identifier:
isbn:
- '9781643685489'
issn:
- 0922-6389
- 1879-8314
publication_status: published
publisher: IOS Press
status: public
title: 'Rejection in Abstract Argumentation: Harder Than Acceptance?'
type: book_chapter
user_id: '99353'
year: '2024'
...
---
_id: '55655'
abstract:
- lang: eng
text: Argumentation is a well-established formalism for nonmonotonic reasoning,
with popular frameworks being Dung’s abstract argumentation (AFs) or logic-based
argumentation (Besnard-Hunter’s framework). Structurally, a set of formulas forms
support for a claim if it is consistent, subset-minimal, and implies the claim.
Then, an argument comprises support and a claim. We observe that the computational
task (ARG) of asking for support of a claim in a knowledge base is “brave”, since
many claims with a single support are accepted. As a result, ARG falls short when
it comes to the question of confidence in a claim, or claim strength. In this
paper, we propose a concept for measuring the (acceptance) strength of claims,
based on counting supports for a claim. Further, we settle classical and structural
complexity of counting arguments favoring a given claim in propositional knowledge
bases (KBs). We introduce quantitative reasoning to measure the strength of claims
in a KB and to determine the relevance strength of a formula for a claim.
author:
- first_name: Markus
full_name: Hecher, Markus
last_name: Hecher
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
- first_name: Johannes
full_name: Schmidt, Johannes
last_name: Schmidt
citation:
ama: 'Hecher M, Mahmood Y, Meier A, Schmidt J. Quantitative Claim-Centric Reasoning
in Logic-Based Argumentation. In: Proceedings of the Thirty-ThirdInternational
Joint Conference on Artificial Intelligence. International Joint Conferences
on Artificial Intelligence Organization; 2024. doi:10.24963/ijcai.2024/377'
apa: Hecher, M., Mahmood, Y., Meier, A., & Schmidt, J. (2024). Quantitative
Claim-Centric Reasoning in Logic-Based Argumentation. Proceedings of the Thirty-ThirdInternational
Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/377
bibtex: '@inproceedings{Hecher_Mahmood_Meier_Schmidt_2024, title={Quantitative Claim-Centric
Reasoning in Logic-Based Argumentation}, DOI={10.24963/ijcai.2024/377},
booktitle={Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial
Intelligence}, publisher={International Joint Conferences on Artificial Intelligence
Organization}, author={Hecher, Markus and Mahmood, Yasir and Meier, Arne and Schmidt,
Johannes}, year={2024} }'
chicago: Hecher, Markus, Yasir Mahmood, Arne Meier, and Johannes Schmidt. “Quantitative
Claim-Centric Reasoning in Logic-Based Argumentation.” In Proceedings of the
Thirty-ThirdInternational Joint Conference on Artificial Intelligence. International
Joint Conferences on Artificial Intelligence Organization, 2024. https://doi.org/10.24963/ijcai.2024/377.
ieee: 'M. Hecher, Y. Mahmood, A. Meier, and J. Schmidt, “Quantitative Claim-Centric
Reasoning in Logic-Based Argumentation,” 2024, doi: 10.24963/ijcai.2024/377.'
mla: Hecher, Markus, et al. “Quantitative Claim-Centric Reasoning in Logic-Based
Argumentation.” Proceedings of the Thirty-ThirdInternational Joint Conference
on Artificial Intelligence, International Joint Conferences on Artificial
Intelligence Organization, 2024, doi:10.24963/ijcai.2024/377.
short: 'M. Hecher, Y. Mahmood, A. Meier, J. Schmidt, in: Proceedings of the Thirty-ThirdInternational
Joint Conference on Artificial Intelligence, International Joint Conferences on
Artificial Intelligence Organization, 2024.'
date_created: 2024-08-19T16:21:51Z
date_updated: 2025-09-11T10:02:03Z
department:
- _id: '574'
doi: 10.24963/ijcai.2024/377
language:
- iso: eng
project:
- _id: '121'
name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
maschinellen Lernens'
publication: Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial
Intelligence
publication_status: published
publisher: International Joint Conferences on Artificial Intelligence Organization
status: public
title: Quantitative Claim-Centric Reasoning in Logic-Based Argumentation
type: conference
user_id: '99353'
year: '2024'
...
---
_id: '57814'
abstract:
- lang: eng
text: "We study consistent query answering via different graph representations.\r\nFirst,
we introduce solution-conflict hypergraphs in which nodes represent\r\nfacts and
edges represent either conflicts or query solutions. Considering a\r\nmonotonic
query and a set of antimonotonic constraints, we present an explicit\r\nalgorithm
for counting the number of repairs satisfying the query based on a\r\ntree decomposition
of the solution-conflict hypergraph. The algorithm not only\r\nprovides fixed-parameter
tractability results for data complexity over\r\nexpressive query and constraint
classes, but also introduces a novel and\r\npotentially implementable approach
to repair counting. Second, we consider the\r\nGaifman graphs arising from MSO
descriptions of consistent query answering.\r\nUsing a generalization of Courcelle's
theorem, we then present fixed-parameter\r\ntractability results for combined
complexity over expressive query and\r\nconstraint classes."
author:
- first_name: Teemu
full_name: Hankala, Teemu
last_name: Hankala
- first_name: Miika
full_name: Hannula, Miika
last_name: Hannula
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
citation:
ama: Hankala T, Hannula M, Mahmood Y, Meier A. Parameterised Complexity of Consistent
Query Answering via Graph Representations. arXiv:241208324. Published
online 2024.
apa: Hankala, T., Hannula, M., Mahmood, Y., & Meier, A. (2024). Parameterised
Complexity of Consistent Query Answering via Graph Representations. In arXiv:2412.08324.
bibtex: '@article{Hankala_Hannula_Mahmood_Meier_2024, title={Parameterised Complexity
of Consistent Query Answering via Graph Representations}, journal={arXiv:2412.08324},
author={Hankala, Teemu and Hannula, Miika and Mahmood, Yasir and Meier, Arne},
year={2024} }'
chicago: Hankala, Teemu, Miika Hannula, Yasir Mahmood, and Arne Meier. “Parameterised
Complexity of Consistent Query Answering via Graph Representations.” ArXiv:2412.08324,
2024.
ieee: T. Hankala, M. Hannula, Y. Mahmood, and A. Meier, “Parameterised Complexity
of Consistent Query Answering via Graph Representations,” arXiv:2412.08324.
2024.
mla: Hankala, Teemu, et al. “Parameterised Complexity of Consistent Query Answering
via Graph Representations.” ArXiv:2412.08324, 2024.
short: T. Hankala, M. Hannula, Y. Mahmood, A. Meier, ArXiv:2412.08324 (2024).
date_created: 2024-12-15T20:12:56Z
date_updated: 2025-09-11T10:01:35Z
department:
- _id: '574'
external_id:
arxiv:
- '2412.08324'
language:
- iso: eng
project:
- _id: '121'
name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
maschinellen Lernens'
publication: arXiv:2412.08324
status: public
title: Parameterised Complexity of Consistent Query Answering via Graph Representations
type: preprint
user_id: '99353'
year: '2024'
...
---
_id: '56140'
abstract:
- lang: eng
text: " Android apps collecting data from users must comply with legal frameworks
to ensure data protection. This requirement has become even more important since
the implementation of the General Data Protection Regulation (GDPR) by the European
Union in 2018. Moreover, with the proposed Cyber Resilience Act on the horizon,
stakeholders will soon need to assess software against even more stringent security
and privacy standards. Effective privacy assessments require collaboration among
groups with diverse expertise to function effectively as a cohesive unit.\r\n
\ This paper motivates the need for an automated approach that enhances understanding
of data protection in Android apps and improves communication between the various
parties involved in privacy assessments. We propose the Assessor View, a tool
designed to bridge the knowledge gap between these parties, facilitating more
effective privacy assessments of Android applications. "
author:
- first_name: Mugdha
full_name: Khedkar, Mugdha
id: '88024'
last_name: Khedkar
- first_name: Michael
full_name: Schlichtig, Michael
id: '32312'
last_name: Schlichtig
orcid: 0000-0001-6600-6171
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Khedkar M, Schlichtig M, Bodden E. Advancing Android Privacy Assessments with
Automation. In: In Proceedings of the 39th IEEE/ACM International Conference
on Automated Software Engineering Workshops (ASEW ’24). ; 2024. doi:10.1145/3691621.3694953'
apa: Khedkar, M., Schlichtig, M., & Bodden, E. (2024). Advancing Android Privacy
Assessments with Automation. In Proceedings of the 39th IEEE/ACM International
Conference on Automated Software Engineering Workshops (ASEW ’24). 39th IEEE/ACM
International Conference on Automated Software Engineering (ASE 2024), Sacramento,
California. https://doi.org/10.1145/3691621.3694953
bibtex: '@inproceedings{Khedkar_Schlichtig_Bodden_2024, title={Advancing Android
Privacy Assessments with Automation}, DOI={10.1145/3691621.3694953},
booktitle={In Proceedings of the 39th IEEE/ACM International Conference on Automated
Software Engineering Workshops (ASEW ’24)}, author={Khedkar, Mugdha and Schlichtig,
Michael and Bodden, Eric}, year={2024} }'
chicago: Khedkar, Mugdha, Michael Schlichtig, and Eric Bodden. “Advancing Android
Privacy Assessments with Automation.” In In Proceedings of the 39th IEEE/ACM
International Conference on Automated Software Engineering Workshops (ASEW ’24),
2024. https://doi.org/10.1145/3691621.3694953.
ieee: 'M. Khedkar, M. Schlichtig, and E. Bodden, “Advancing Android Privacy Assessments
with Automation,” presented at the 39th IEEE/ACM International Conference on Automated
Software Engineering (ASE 2024), Sacramento, California, 2024, doi: 10.1145/3691621.3694953.'
mla: Khedkar, Mugdha, et al. “Advancing Android Privacy Assessments with Automation.”
In Proceedings of the 39th IEEE/ACM International Conference on Automated Software
Engineering Workshops (ASEW ’24), 2024, doi:10.1145/3691621.3694953.
short: 'M. Khedkar, M. Schlichtig, E. Bodden, in: In Proceedings of the 39th IEEE/ACM
International Conference on Automated Software Engineering Workshops (ASEW ’24),
2024.'
conference:
end_date: 2024-11-01
location: Sacramento, California
name: 39th IEEE/ACM International Conference on Automated Software Engineering (ASE
2024)
start_date: 2024-10-27
date_created: 2024-09-16T08:55:34Z
date_updated: 2026-03-13T12:12:45Z
ddc:
- '000'
department:
- _id: '76'
doi: 10.1145/3691621.3694953
external_id:
arxiv:
- '2409.06564'
file:
- access_level: closed
content_type: application/pdf
creator: khedkarm
date_created: 2024-09-16T08:55:23Z
date_updated: 2024-09-16T08:55:23Z
file_id: '56141'
file_name: 2409.06564v1.pdf
file_size: 1207856
relation: main_file
success: 1
file_date_updated: 2024-09-16T08:55:23Z
has_accepted_license: '1'
language:
- iso: eng
publication: In Proceedings of the 39th IEEE/ACM International Conference on Automated
Software Engineering Workshops (ASEW ’24)
status: public
title: Advancing Android Privacy Assessments with Automation
type: conference
user_id: '32312'
year: '2024'
...
---
_id: '63658'
author:
- first_name: Simon
full_name: Klüttermann, Simon
last_name: Klüttermann
- first_name: Jérôme
full_name: Rutinowski, Jérôme
last_name: Rutinowski
- first_name: Frederik
full_name: Polachowski, Frederik
last_name: Polachowski
- first_name: Anh
full_name: Nguyen, Anh
last_name: Nguyen
- first_name: Britta
full_name: Grimme, Britta
last_name: Grimme
- first_name: Moritz
full_name: Roidl, Moritz
last_name: Roidl
- first_name: Emmanuel
full_name: Müller, Emmanuel
last_name: Müller
citation:
ama: 'Klüttermann S, Rutinowski J, Polachowski F, et al. On the Effectiveness of
Heterogeneous Ensemble Methods for Re-identification. In: 2024 International
Conference on Machine Learning and Applications (ICMLA). ; 2024:1705–1711.'
apa: Klüttermann, S., Rutinowski, J., Polachowski, F., Nguyen, A., Grimme, B., Roidl,
M., & Müller, E. (2024). On the Effectiveness of Heterogeneous Ensemble Methods
for Re-identification. 2024 International Conference on Machine Learning and
Applications (ICMLA), 1705–1711.
bibtex: '@inproceedings{Klüttermann_Rutinowski_Polachowski_Nguyen_Grimme_Roidl_Müller_2024,
title={On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification},
booktitle={2024 International Conference on Machine Learning and Applications
(ICMLA)}, author={Klüttermann, Simon and Rutinowski, Jérôme and Polachowski, Frederik
and Nguyen, Anh and Grimme, Britta and Roidl, Moritz and Müller, Emmanuel}, year={2024},
pages={1705–1711} }'
chicago: Klüttermann, Simon, Jérôme Rutinowski, Frederik Polachowski, Anh Nguyen,
Britta Grimme, Moritz Roidl, and Emmanuel Müller. “On the Effectiveness of Heterogeneous
Ensemble Methods for Re-Identification.” In 2024 International Conference on
Machine Learning and Applications (ICMLA), 1705–1711, 2024.
ieee: S. Klüttermann et al., “On the Effectiveness of Heterogeneous Ensemble
Methods for Re-identification,” in 2024 International Conference on Machine
Learning and Applications (ICMLA), 2024, pp. 1705–1711.
mla: Klüttermann, Simon, et al. “On the Effectiveness of Heterogeneous Ensemble
Methods for Re-Identification.” 2024 International Conference on Machine Learning
and Applications (ICMLA), 2024, pp. 1705–1711.
short: 'S. Klüttermann, J. Rutinowski, F. Polachowski, A. Nguyen, B. Grimme, M.
Roidl, E. Müller, in: 2024 International Conference on Machine Learning and Applications
(ICMLA), 2024, pp. 1705–1711.'
date_created: 2026-01-19T11:29:47Z
date_updated: 2026-03-19T07:47:29Z
department:
- _id: '819'
language:
- iso: eng
page: 1705–1711
publication: 2024 International Conference on Machine Learning and Applications (ICMLA)
status: public
title: On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification
type: conference
user_id: '103682'
year: '2024'
...
---
_id: '52587'
author:
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Jens
full_name: Pottebaum, Jens
id: '405'
last_name: Pottebaum
orcid: http://orcid.org/0000-0001-8778-2989
- first_name: Markus
full_name: Fockel, Markus
id: '8472'
last_name: Fockel
orcid: 0000-0002-1269-0702
- first_name: Iris
full_name: Gräßler, Iris
id: '47565'
last_name: Gräßler
orcid: 0000-0001-5765-971X
citation:
ama: Bodden E, Pottebaum J, Fockel M, Gräßler I. Evaluating Security Through Isolation
and Defense in Depth. IEEE Security & Privacy. 2024;22(1):69-72. doi:10.1109/msec.2023.3336028
apa: Bodden, E., Pottebaum, J., Fockel, M., & Gräßler, I. (2024). Evaluating
Security Through Isolation and Defense in Depth. IEEE Security & Privacy,
22(1), 69–72. https://doi.org/10.1109/msec.2023.3336028
bibtex: '@article{Bodden_Pottebaum_Fockel_Gräßler_2024, title={Evaluating Security
Through Isolation and Defense in Depth}, volume={22}, DOI={10.1109/msec.2023.3336028},
number={1}, journal={IEEE Security & Privacy}, publisher={Institute of Electrical
and Electronics Engineers (IEEE)}, author={Bodden, Eric and Pottebaum, Jens and
Fockel, Markus and Gräßler, Iris}, year={2024}, pages={69–72} }'
chicago: 'Bodden, Eric, Jens Pottebaum, Markus Fockel, and Iris Gräßler. “Evaluating
Security Through Isolation and Defense in Depth.” IEEE Security & Privacy
22, no. 1 (2024): 69–72. https://doi.org/10.1109/msec.2023.3336028.'
ieee: 'E. Bodden, J. Pottebaum, M. Fockel, and I. Gräßler, “Evaluating Security
Through Isolation and Defense in Depth,” IEEE Security & Privacy, vol.
22, no. 1, pp. 69–72, 2024, doi: 10.1109/msec.2023.3336028.'
mla: Bodden, Eric, et al. “Evaluating Security Through Isolation and Defense in
Depth.” IEEE Security & Privacy, vol. 22, no. 1, Institute of Electrical
and Electronics Engineers (IEEE), 2024, pp. 69–72, doi:10.1109/msec.2023.3336028.
short: E. Bodden, J. Pottebaum, M. Fockel, I. Gräßler, IEEE Security & Privacy
22 (2024) 69–72.
date_created: 2024-03-15T20:16:18Z
date_updated: 2026-03-31T02:19:49Z
department:
- _id: '152'
- _id: '76'
- _id: '662'
doi: 10.1109/msec.2023.3336028
intvolume: ' 22'
issue: '1'
keyword:
- Law
- Electrical and Electronic Engineering
- Computer Networks and Communications
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/10411721
page: 69-72
publication: IEEE Security & Privacy
publication_identifier:
issn:
- 1540-7993
- 1558-4046
publication_status: published
publisher: Institute of Electrical and Electronics Engineers (IEEE)
quality_controlled: '1'
status: public
title: Evaluating Security Through Isolation and Defense in Depth
type: journal_article
user_id: '405'
volume: 22
year: '2024'
...
---
_id: '56481'
author:
- first_name: Christoph
full_name: Berganski, Christoph
id: '98854'
last_name: Berganski
- first_name: Felix
full_name: Jentzsch, Felix
id: '55631'
last_name: Jentzsch
orcid: 0000-0003-4987-5708
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Max
full_name: Kuhmichel, Max
last_name: Kuhmichel
- first_name: Heiner
full_name: Giefers, Heiner
last_name: Giefers
citation:
ama: 'Berganski C, Jentzsch F, Platzner M, Kuhmichel M, Giefers H. FINN-T: Compiling
Custom Dataflow Accelerators for Quantized Transformers. In: ; 2024.'
apa: 'Berganski, C., Jentzsch, F., Platzner, M., Kuhmichel, M., & Giefers, H.
(2024). FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers.
International Conference on Field Programmable Technology, Sydney.'
bibtex: '@inproceedings{Berganski_Jentzsch_Platzner_Kuhmichel_Giefers_2024, title={FINN-T:
Compiling Custom Dataflow Accelerators for Quantized Transformers}, author={Berganski,
Christoph and Jentzsch, Felix and Platzner, Marco and Kuhmichel, Max and Giefers,
Heiner}, year={2024} }'
chicago: 'Berganski, Christoph, Felix Jentzsch, Marco Platzner, Max Kuhmichel, and
Heiner Giefers. “FINN-T: Compiling Custom Dataflow Accelerators for Quantized
Transformers,” 2024.'
ieee: 'C. Berganski, F. Jentzsch, M. Platzner, M. Kuhmichel, and H. Giefers, “FINN-T:
Compiling Custom Dataflow Accelerators for Quantized Transformers,” presented
at the International Conference on Field Programmable Technology, Sydney, 2024.'
mla: 'Berganski, Christoph, et al. FINN-T: Compiling Custom Dataflow Accelerators
for Quantized Transformers. 2024.'
short: 'C. Berganski, F. Jentzsch, M. Platzner, M. Kuhmichel, H. Giefers, in: 2024.'
conference:
end_date: 2024-12-12
location: Sydney
name: International Conference on Field Programmable Technology
start_date: 2024-12-10
date_created: 2024-10-10T07:49:13Z
date_updated: 2026-04-27T14:14:40Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
status: public
title: 'FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers'
type: conference
user_id: '55631'
year: '2024'
...
---
_id: '54245'
author:
- first_name: Luca-Sebastian
full_name: Henke, Luca-Sebastian
last_name: Henke
citation:
ama: Henke L-S. Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting.;
2024.
apa: Henke, L.-S. (2024). Exploring Custom FPGA Accelerators for DNN-based RF
Fingerprinting.
bibtex: '@book{Henke_2024, title={Exploring Custom FPGA Accelerators for DNN-based
RF Fingerprinting}, author={Henke, Luca-Sebastian}, year={2024} }'
chicago: Henke, Luca-Sebastian. Exploring Custom FPGA Accelerators for DNN-Based
RF Fingerprinting, 2024.
ieee: L.-S. Henke, Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting.
2024.
mla: Henke, Luca-Sebastian. Exploring Custom FPGA Accelerators for DNN-Based
RF Fingerprinting. 2024.
short: L.-S. Henke, Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting,
2024.
date_created: 2024-05-13T14:00:01Z
date_updated: 2026-04-27T14:20:23Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
status: public
supervisor:
- first_name: Felix
full_name: Jentzsch, Felix
id: '55631'
last_name: Jentzsch
orcid: 0000-0003-4987-5708
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting
type: mastersthesis
user_id: '55631'
year: '2024'
...
---
_id: '50273'
abstract:
- lang: eng
text: "The Polynomial-Time Hierarchy ($\\mathsf{PH}$) is a staple of classical\r\ncomplexity
theory, with applications spanning randomized computation to circuit\r\nlower
bounds to ''quantum advantage'' analyses for near-term quantum computers.\r\nQuantumly,
however, despite the fact that at least \\emph{four} definitions of\r\nquantum
$\\mathsf{PH}$ exist, it has been challenging to prove analogues for\r\nthese
of even basic facts from $\\mathsf{PH}$. This work studies three\r\nquantum-verifier
based generalizations of $\\mathsf{PH}$, two of which are from\r\n[Gharibian,
Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings\r\n($\\mathsf{QCPH}$)
and quantum mixed states ($\\mathsf{QPH}$) as proofs, and one\r\nof which is new
to this work, utilizing quantum pure states\r\n($\\mathsf{pureQPH}$) as proofs.
We first resolve several open problems from\r\n[GSSSY22], including a collapse
theorem and a Karp-Lipton theorem for\r\n$\\mathsf{QCPH}$. Then, for our new class
$\\mathsf{pureQPH}$, we show one-sided\r\nerror reduction for $\\mathsf{pureQPH}$,
as well as the first bounds relating\r\nthese quantum variants of $\\mathsf{PH}$,
namely $\\mathsf{QCPH}\\subseteq\r\n\\mathsf{pureQPH} \\subseteq \\mathsf{EXP}^{\\mathsf{PP}}$."
author:
- first_name: Avantika
full_name: Agarwal, Avantika
last_name: Agarwal
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Venkata
full_name: Koppula, Venkata
last_name: Koppula
- first_name: Dorian
full_name: Rudolph, Dorian
id: '57863'
last_name: Rudolph
citation:
ama: 'Agarwal A, Gharibian S, Koppula V, Rudolph D. Quantum Polynomial Hierarchies:
Karp-Lipton, error reduction, and lower bounds. In: Proceedings of 49th International
Symposium on Mathematical Foundations of Computer Science (MFCS). Vol 306.
; 2024:7-17. doi:10.4230/LIPIcs.MFCS.2024.7'
apa: 'Agarwal, A., Gharibian, S., Koppula, V., & Rudolph, D. (2024). Quantum
Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds. Proceedings
of 49th International Symposium on Mathematical Foundations of Computer Science
(MFCS), 306(7), 7–17. https://doi.org/10.4230/LIPIcs.MFCS.2024.7'
bibtex: '@inproceedings{Agarwal_Gharibian_Koppula_Rudolph_2024, title={Quantum Polynomial
Hierarchies: Karp-Lipton, error reduction, and lower bounds}, volume={306}, DOI={10.4230/LIPIcs.MFCS.2024.7},
number={7}, booktitle={Proceedings of 49th International Symposium on Mathematical
Foundations of Computer Science (MFCS)}, author={Agarwal, Avantika and Gharibian,
Sevag and Koppula, Venkata and Rudolph, Dorian}, year={2024}, pages={7–17} }'
chicago: 'Agarwal, Avantika, Sevag Gharibian, Venkata Koppula, and Dorian Rudolph.
“Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds.”
In Proceedings of 49th International Symposium on Mathematical Foundations
of Computer Science (MFCS), 306:7–17, 2024. https://doi.org/10.4230/LIPIcs.MFCS.2024.7.'
ieee: 'A. Agarwal, S. Gharibian, V. Koppula, and D. Rudolph, “Quantum Polynomial
Hierarchies: Karp-Lipton, error reduction, and lower bounds,” in Proceedings
of 49th International Symposium on Mathematical Foundations of Computer Science
(MFCS), 2024, vol. 306, no. 7, pp. 7–17, doi: 10.4230/LIPIcs.MFCS.2024.7.'
mla: 'Agarwal, Avantika, et al. “Quantum Polynomial Hierarchies: Karp-Lipton, Error
Reduction, and Lower Bounds.” Proceedings of 49th International Symposium
on Mathematical Foundations of Computer Science (MFCS), vol. 306, no. 7, 2024,
pp. 7–17, doi:10.4230/LIPIcs.MFCS.2024.7.'
short: 'A. Agarwal, S. Gharibian, V. Koppula, D. Rudolph, in: Proceedings of 49th
International Symposium on Mathematical Foundations of Computer Science (MFCS),
2024, pp. 7–17.'
date_created: 2024-01-07T20:09:32Z
date_updated: 2026-05-15T08:39:23Z
department:
- _id: '7'
- _id: '623'
doi: 10.4230/LIPIcs.MFCS.2024.7
external_id:
arxiv:
- '2401.01633'
intvolume: ' 306'
issue: '7'
language:
- iso: eng
page: 7-17
publication: Proceedings of 49th International Symposium on Mathematical Foundations
of Computer Science (MFCS)
publication_status: published
status: public
title: 'Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds'
type: conference
user_id: '71541'
volume: 306
year: '2024'
...
---
_id: '50406'
abstract:
- lang: eng
text: "What is the power of polynomial-time quantum computation with access to an
NP\r\noracle? In this work, we focus on two fundamental tasks from the study of\r\nBoolean
satisfiability (SAT) problems: search-to-decision reductions, and\r\napproximate
counting. We first show that, in strong contrast to the classical\r\nsetting where
a poly-time Turing machine requires $\\Theta(n)$ queries to an NP\r\noracle to
compute a witness to a given SAT formula, quantumly $\\Theta(\\log n)$\r\nqueries
suffice. We then show this is tight in the black-box model - any\r\nquantum algorithm
with \"NP-like\" query access to a formula requires\r\n$\\Omega(\\log n)$ queries
to extract a solution with constant probability.\r\nMoving to approximate counting
of SAT solutions, by exploiting a quantum link\r\nbetween search-to-decision reductions
and approximate counting, we show that\r\nexisting classical approximate counting
algorithms are likely optimal. First,\r\nwe give a lower bound in the \"NP-like\"
black-box query setting: Approximate\r\ncounting requires $\\Omega(\\log n)$ queries,
even on a quantum computer. We then\r\ngive a \"white-box\" lower bound (i.e.
where the input formula is not hidden in\r\nthe oracle) - if there exists a randomized
poly-time classical or quantum\r\nalgorithm for approximate counting making $o(log
n)$ NP queries, then\r\n$\\text{BPP}^{\\text{NP}[o(n)]}$ contains a $\\text{P}^{\\text{NP}}$-complete\r\nproblem
if the algorithm is classical and $\\text{FBQP}^{\\text{NP}[o(n)]}$\r\ncontains
an $\\text{FP}^{\\text{NP}}$-complete problem if the algorithm is\r\nquantum."
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Jonas
full_name: Kamminga, Jonas
last_name: Kamminga
citation:
ama: 'Gharibian S, Kamminga J. BQP, meet NP: Search-to-decision reductions and approximate
counting. In: Proceedings of 51st EATCS International Colloquium on Automata,
Languages and Programming (ICALP). Vol 297. ; 2024:1-19.'
apa: 'Gharibian, S., & Kamminga, J. (2024). BQP, meet NP: Search-to-decision
reductions and approximate counting. Proceedings of 51st EATCS International
Colloquium on Automata, Languages and Programming (ICALP), 297(70),
1–19.'
bibtex: '@inproceedings{Gharibian_Kamminga_2024, title={BQP, meet NP: Search-to-decision
reductions and approximate counting}, volume={297}, number={70}, booktitle={Proceedings
of 51st EATCS International Colloquium on Automata, Languages and Programming
(ICALP)}, author={Gharibian, Sevag and Kamminga, Jonas}, year={2024}, pages={1–19}
}'
chicago: 'Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision
Reductions and Approximate Counting.” In Proceedings of 51st EATCS International
Colloquium on Automata, Languages and Programming (ICALP), 297:1–19, 2024.'
ieee: 'S. Gharibian and J. Kamminga, “BQP, meet NP: Search-to-decision reductions
and approximate counting,” in Proceedings of 51st EATCS International Colloquium
on Automata, Languages and Programming (ICALP), 2024, vol. 297, no. 70, pp.
1–19.'
mla: 'Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision Reductions
and Approximate Counting.” Proceedings of 51st EATCS International Colloquium
on Automata, Languages and Programming (ICALP), vol. 297, no. 70, 2024, pp.
1–19.'
short: 'S. Gharibian, J. Kamminga, in: Proceedings of 51st EATCS International Colloquium
on Automata, Languages and Programming (ICALP), 2024, pp. 1–19.'
date_created: 2024-01-09T13:59:44Z
date_updated: 2026-05-15T08:41:59Z
department:
- _id: '7'
- _id: '623'
external_id:
arxiv:
- '2401.03943'
intvolume: ' 297'
issue: '70'
language:
- iso: eng
page: 1-19
publication: Proceedings of 51st EATCS International Colloquium on Automata, Languages
and Programming (ICALP)
publication_status: published
status: public
title: 'BQP, meet NP: Search-to-decision reductions and approximate counting'
type: conference
user_id: '71541'
volume: 297
year: '2024'
...
---
_id: '56944'
abstract:
- lang: eng
text: "Quantum Max Cut (QMC), also known as the quantum anti-ferromagnetic\r\nHeisenberg
model, is a QMA-complete problem relevant to quantum many-body\r\nphysics and
computer science. Semidefinite programming relaxations have been\r\nfruitful in
designing theoretical approximation algorithms for QMC, but are\r\ncomputationally
expensive for systems beyond tens of qubits. We give a second\r\norder cone relaxation
for QMC, which optimizes over the set of mutually\r\nconsistent three-qubit reduced
density matrices. In combination with Pauli\r\nlevel-$1$ of the quantum Lasserre
hierarchy, the relaxation achieves an\r\napproximation ratio of $0.526$ to the
ground state energy. Our relaxation is\r\nsolvable on systems with hundreds of
qubits and paves the way to\r\ncomputationally efficient lower and upper bounds
on the ground state energy of\r\nlarge-scale quantum spin systems."
author:
- first_name: Felix
full_name: Huber, Felix
last_name: Huber
- first_name: Kevin
full_name: Thompson, Kevin
last_name: Thompson
- first_name: Ojas
full_name: Parekh, Ojas
last_name: Parekh
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
citation:
ama: Huber F, Thompson K, Parekh O, Gharibian S. Second order cone relaxations for
quantum Max Cut. arXiv:241104120. Published online 2024.
apa: Huber, F., Thompson, K., Parekh, O., & Gharibian, S. (2024). Second order
cone relaxations for quantum Max Cut. In arXiv:2411.04120.
bibtex: '@article{Huber_Thompson_Parekh_Gharibian_2024, title={Second order cone
relaxations for quantum Max Cut}, journal={arXiv:2411.04120}, author={Huber, Felix
and Thompson, Kevin and Parekh, Ojas and Gharibian, Sevag}, year={2024} }'
chicago: Huber, Felix, Kevin Thompson, Ojas Parekh, and Sevag Gharibian. “Second
Order Cone Relaxations for Quantum Max Cut.” ArXiv:2411.04120, 2024.
ieee: F. Huber, K. Thompson, O. Parekh, and S. Gharibian, “Second order cone relaxations
for quantum Max Cut,” arXiv:2411.04120. 2024.
mla: Huber, Felix, et al. “Second Order Cone Relaxations for Quantum Max Cut.” ArXiv:2411.04120,
2024.
short: F. Huber, K. Thompson, O. Parekh, S. Gharibian, ArXiv:2411.04120 (2024).
date_created: 2024-11-07T12:09:37Z
date_updated: 2026-05-15T08:41:38Z
department:
- _id: '7'
- _id: '623'
external_id:
arxiv:
- '2411.04120'
language:
- iso: eng
publication: arXiv:2411.04120
status: public
title: Second order cone relaxations for quantum Max Cut
type: preprint
user_id: '71541'
year: '2024'
...
---
_id: '48544'
abstract:
- lang: eng
text: 'When it comes to NP, its natural definition, its wide applicability across
scientific disciplines, and its timeless relevance, the writing is on the wall:
There can be only one. Quantum NP, on the other hand, is clearly the apple that
fell far from the tree of NP. Two decades since the first definitions of quantum
NP started rolling in, quantum complexity theorists face a stark reality: There''s
QMA, QCMA, QMA1, QMA(2), StoqMA, and NQP. In this article aimed at a general theoretical
computer science audience, I survey these various definitions of quantum NP, their
strengths and weaknesses, and why most of them, for better or worse, actually
appear to fit naturally into the complexity zoo.'
article_type: review
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
citation:
ama: 'Gharibian S. Guest Column: The 7 faces of quantum NP. ACM SIGACT News.
2024;54(4):54-91.'
apa: 'Gharibian, S. (2024). Guest Column: The 7 faces of quantum NP. ACM SIGACT
News, 54(4), 54–91.'
bibtex: '@article{Gharibian_2024, title={Guest Column: The 7 faces of quantum NP},
volume={54}, number={4}, journal={ACM SIGACT News}, author={Gharibian, Sevag},
year={2024}, pages={54–91} }'
chicago: 'Gharibian, Sevag. “Guest Column: The 7 Faces of Quantum NP.” ACM SIGACT
News 54, no. 4 (2024): 54–91.'
ieee: 'S. Gharibian, “Guest Column: The 7 faces of quantum NP,” ACM SIGACT News,
vol. 54, no. 4, pp. 54–91, 2024.'
mla: 'Gharibian, Sevag. “Guest Column: The 7 Faces of Quantum NP.” ACM SIGACT
News, vol. 54, no. 4, 2024, pp. 54–91.'
short: S. Gharibian, ACM SIGACT News 54 (2024) 54–91.
date_created: 2023-10-30T12:19:11Z
date_updated: 2026-05-15T08:42:54Z
department:
- _id: '7'
- _id: '623'
intvolume: ' 54'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2310.18010
oa: '1'
page: 54-91
publication: ACM SIGACT News
publication_status: published
related_material:
link:
- relation: confirmation
url: https://dl.acm.org/doi/abs/10.1145/3639528.3639535
status: public
title: 'Guest Column: The 7 faces of quantum NP'
type: journal_article
user_id: '71541'
volume: 54
year: '2024'
...
---
_id: '62702'
abstract:
- lang: eng
text: 'Clifford algebras are a natural extension of division algebras, including
real numbers, complex numbers, quaternions, and octonions. Previous research in
knowledge graph embeddings has focused exclusively on Clifford algebras of a specific
type, which do not include nilpotent base vectors—elements that square to zero.
In this work, we introduce a novel approach by incorporating nilpotent base vectors
with a nilpotency index of two, leading to a more general form of Clifford algebras
named degenerate Clifford algebras. This generalization to degenerate Clifford
algebras does allow for covering dual numbers and as such include translations
and rotations models under the same generalization paradigm for the first time.
We develop two models to determine the parameters that define the algebra: one
using a greedy search and another predicting the parameters based on neural network
embeddings of the input knowledge graph. Our evaluation on seven benchmark datasets
demonstrates that this incorporation of nilpotent vectors enhances the quality
of embeddings. Additionally, our method outperforms state-of-the-art approaches
in terms of generalization, particularly regarding the mean reciprocal rank achieved
on validation data. Finally, we show that even a simple greedy search can effectively
discover optimal or near-optimal parameters for the algebra.'
author:
- first_name: Louis Mozart
full_name: Kamdem Teyou, Louis Mozart
id: '101165'
last_name: Kamdem Teyou
- first_name: Caglar
full_name: Demir, Caglar
id: '43817'
last_name: Demir
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Kamdem Teyou LM, Demir C, Ngonga Ngomo A-C. Embedding Knowledge Graphs in
Degenerate Clifford Algebras. In: Frontiers in Artificial Intelligence and
Applications. IOS Press; 2024. doi:10.3233/faia240627'
apa: Kamdem Teyou, L. M., Demir, C., & Ngonga Ngomo, A.-C. (2024). Embedding
Knowledge Graphs in Degenerate Clifford Algebras. In Frontiers in Artificial
Intelligence and Applications. 27TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE,
Santiago de Compostela. IOS Press. https://doi.org/10.3233/faia240627
bibtex: '@inbook{Kamdem Teyou_Demir_Ngonga Ngomo_2024, title={Embedding Knowledge
Graphs in Degenerate Clifford Algebras}, DOI={10.3233/faia240627},
booktitle={Frontiers in Artificial Intelligence and Applications}, publisher={IOS
Press}, author={Kamdem Teyou, Louis Mozart and Demir, Caglar and Ngonga Ngomo,
Axel-Cyrille}, year={2024} }'
chicago: Kamdem Teyou, Louis Mozart, Caglar Demir, and Axel-Cyrille Ngonga Ngomo.
“Embedding Knowledge Graphs in Degenerate Clifford Algebras.” In Frontiers
in Artificial Intelligence and Applications. IOS Press, 2024. https://doi.org/10.3233/faia240627.
ieee: L. M. Kamdem Teyou, C. Demir, and A.-C. Ngonga Ngomo, “Embedding Knowledge
Graphs in Degenerate Clifford Algebras,” in Frontiers in Artificial Intelligence
and Applications, IOS Press, 2024.
mla: Kamdem Teyou, Louis Mozart, et al. “Embedding Knowledge Graphs in Degenerate
Clifford Algebras.” Frontiers in Artificial Intelligence and Applications,
IOS Press, 2024, doi:10.3233/faia240627.
short: 'L.M. Kamdem Teyou, C. Demir, A.-C. Ngonga Ngomo, in: Frontiers in Artificial
Intelligence and Applications, IOS Press, 2024.'
conference:
end_date: 2024-10-24
location: Santiago de Compostela
name: 27TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE
start_date: 2024-10-19
date_created: 2025-11-28T14:32:43Z
date_updated: 2026-05-29T14:34:11Z
department:
- _id: '34'
- _id: '574'
doi: 10.3233/faia240627
language:
- iso: eng
popular_science: '1'
publication: Frontiers in Artificial Intelligence and Applications
publication_identifier:
isbn:
- '9781643685489'
issn:
- 0922-6389
- 1879-8314
publication_status: published
publisher: IOS Press
quality_controlled: '1'
status: public
title: Embedding Knowledge Graphs in Degenerate Clifford Algebras
type: book_chapter
user_id: '101165'
year: '2024'
...