---
_id: '7117'
abstract:
- lang: eng
text: We propose a novel generic shape optimization method for CAD models based
on the eXtended Finite Element Method (XFEM). Our method works directly on the
intersection between the model and a regular simulation grid, without the need
to mesh or remesh, thus removing a bottleneck of classical shape optimization
strategies. This is made possible by a novel hierarchical integration scheme that
accurately integrates finite element quantities with sub-element precision. For
optimization, we efficiently compute analytical shape derivatives of the entire
framework, from model intersection to integration rule generation and XFEM simulation.
Moreover, we describe a differentiable projection of shape parameters onto a constraint
manifold spanned by user-specified shape preservation, consistency, and manufacturability
constraints. We demonstrate the utility of our approach by optimizing mass distribution,
strength-to-weight ratio, and inverse elastic shape design objectives directly
on parameterized 3D CAD models.
article_number: '157'
article_processing_charge: No
article_type: original
author:
- first_name: Christian
full_name: Hafner, Christian
id: 400429CC-F248-11E8-B48F-1D18A9856A87
last_name: Hafner
- first_name: Christian
full_name: Schumacher, Christian
last_name: Schumacher
- first_name: Espen
full_name: Knoop, Espen
last_name: Knoop
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Moritz
full_name: Bächer, Moritz
last_name: Bächer
citation:
ama: 'Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. X-CAD: Optimizing
CAD Models with Extended Finite Elements. ACM Transactions on Graphics.
2019;38(6). doi:10.1145/3355089.3356576'
apa: 'Hafner, C., Schumacher, C., Knoop, E., Auzinger, T., Bickel, B., & Bächer,
M. (2019). X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM
Transactions on Graphics. ACM. https://doi.org/10.1145/3355089.3356576'
chicago: 'Hafner, Christian, Christian Schumacher, Espen Knoop, Thomas Auzinger,
Bernd Bickel, and Moritz Bächer. “X-CAD: Optimizing CAD Models with Extended Finite
Elements.” ACM Transactions on Graphics. ACM, 2019. https://doi.org/10.1145/3355089.3356576.'
ieee: 'C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, and M. Bächer,
“X-CAD: Optimizing CAD Models with Extended Finite Elements,” ACM Transactions
on Graphics, vol. 38, no. 6. ACM, 2019.'
ista: 'Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. 2019. X-CAD:
Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics.
38(6), 157.'
mla: 'Hafner, Christian, et al. “X-CAD: Optimizing CAD Models with Extended Finite
Elements.” ACM Transactions on Graphics, vol. 38, no. 6, 157, ACM, 2019,
doi:10.1145/3355089.3356576.'
short: C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, M. Bächer, ACM
Transactions on Graphics 38 (2019).
date_created: 2019-11-26T14:22:09Z
date_published: 2019-11-06T00:00:00Z
date_updated: 2024-03-27T23:30:46Z
day: '06'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1145/3355089.3356576
ec_funded: 1
external_id:
isi:
- '000498397300007'
file:
- access_level: open_access
checksum: 56a2fb019adcb556d2b022f5e5acb68c
content_type: application/pdf
creator: bbickel
date_created: 2019-11-26T14:24:26Z
date_updated: 2020-07-14T12:47:49Z
file_id: '7119'
file_name: xcad_sup_mat_siga19.pdf
file_size: 1673176
relation: supplementary_material
title: X-CAD Supplemental Material
- access_level: open_access
checksum: 5f29d76aceb5102e766cbab9b17d776e
content_type: application/pdf
creator: bbickel
date_created: 2019-11-26T14:24:27Z
date_updated: 2020-07-14T12:47:49Z
description: This is the author's version of the work.
file_id: '7120'
file_name: XCAD_authors_version.pdf
file_size: 14563618
relation: main_file
title: 'X-CAD: Optimizing CAD Models with Extended Finite Elements'
- access_level: open_access
checksum: 0d31e123286cbec9e28b2001c2bb0d55
content_type: video/mp4
creator: bbickel
date_created: 2019-11-26T14:27:37Z
date_updated: 2020-07-14T12:47:49Z
file_id: '7121'
file_name: XCAD_video.mp4
file_size: 259979129
relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
has_accepted_license: '1'
intvolume: ' 38'
isi: 1
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- 0730-0301
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '12897'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'X-CAD: Optimizing CAD Models with Extended Finite Elements'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 38
year: '2019'
...
---
_id: '6189'
abstract:
- lang: eng
text: 'Suspended particles can alter the properties of fluids and in particular
also affect the transition fromlaminar to turbulent flow. An earlier study [Mataset
al.,Phys. Rev. Lett.90, 014501 (2003)] reported howthe subcritical (i.e., hysteretic)
transition to turbulent puffs is affected by the addition of particles. Here weshow
that in addition to this known transition, with increasing concentration a supercritical
(i.e.,continuous) transition to a globally fluctuating state is found. At the
same time the Newtonian-typetransition to puffs is delayed to larger Reynolds
numbers. At even higher concentration only the globallyfluctuating state is found.
The dynamics of particle laden flows are hence determined by two competinginstabilities
that give rise to three flow regimes: Newtonian-type turbulence at low, a particle
inducedglobally fluctuating state at high, and a coexistence state at intermediate
concentrations.'
article_number: '114502'
article_processing_charge: No
author:
- first_name: Nishchal
full_name: Agrawal, Nishchal
id: 469E6004-F248-11E8-B48F-1D18A9856A87
last_name: Agrawal
- first_name: George H
full_name: Choueiri, George H
id: 448BD5BC-F248-11E8-B48F-1D18A9856A87
last_name: Choueiri
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Agrawal N, Choueiri GH, Hof B. Transition to turbulence in particle laden flows.
Physical Review Letters. 2019;122(11). doi:10.1103/PhysRevLett.122.114502
apa: Agrawal, N., Choueiri, G. H., & Hof, B. (2019). Transition to turbulence
in particle laden flows. Physical Review Letters. American Physical Society.
https://doi.org/10.1103/PhysRevLett.122.114502
chicago: Agrawal, Nishchal, George H Choueiri, and Björn Hof. “Transition to Turbulence
in Particle Laden Flows.” Physical Review Letters. American Physical Society,
2019. https://doi.org/10.1103/PhysRevLett.122.114502.
ieee: N. Agrawal, G. H. Choueiri, and B. Hof, “Transition to turbulence in particle
laden flows,” Physical Review Letters, vol. 122, no. 11. American Physical
Society, 2019.
ista: Agrawal N, Choueiri GH, Hof B. 2019. Transition to turbulence in particle
laden flows. Physical Review Letters. 122(11), 114502.
mla: Agrawal, Nishchal, et al. “Transition to Turbulence in Particle Laden Flows.”
Physical Review Letters, vol. 122, no. 11, 114502, American Physical Society,
2019, doi:10.1103/PhysRevLett.122.114502.
short: N. Agrawal, G.H. Choueiri, B. Hof, Physical Review Letters 122 (2019).
date_created: 2019-03-31T21:59:12Z
date_published: 2019-03-22T00:00:00Z
date_updated: 2024-03-27T23:30:47Z
day: '22'
department:
- _id: BjHo
doi: 10.1103/PhysRevLett.122.114502
external_id:
arxiv:
- '1809.06358'
isi:
- '000461922000006'
intvolume: ' 122'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.06358
month: '03'
oa: 1
oa_version: Preprint
publication: Physical Review Letters
publication_identifier:
eissn:
- '10797114'
issn:
- '00319007'
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
record:
- id: '9728'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Transition to turbulence in particle laden flows
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 122
year: '2019'
...
---
_id: '6371'
abstract:
- lang: eng
text: "Decades of studies have revealed the mechanisms of gene regulation in molecular
detail. We make use of such well-described regulatory systems to explore how the
molecular mechanisms of protein-protein and protein-DNA interactions shape the
dynamics and evolution of gene regulation. \r\n\r\ni) We uncover how the biophysics
of protein-DNA binding determines the potential of regulatory networks to evolve
and adapt, which can be captured using a simple mathematical model. \r\nii) The
evolution of regulatory connections can lead to a significant amount of crosstalk
between binding proteins. We explore the effect of crosstalk on gene expression
from a target promoter, which seems to be modulated through binding competition
at non-specific DNA sites. \r\niii) We investigate how the very same biophysical
characteristics as in i) can generate significant fitness costs for cells through
global crosstalk, meaning non-specific DNA binding across the genomic background.
\r\niv) Binding competition between proteins at a target promoter is a prevailing
regulatory feature due to the prevalence of co-regulation at bacterial promoters.
However, the dynamics of these systems are not always straightforward to determine
even if the molecular mechanisms of regulation are known. A detailed model of
the biophysical interactions reveals that interference between the regulatory
proteins can constitute a new, generic form of system memory that records the
history of the input signals at the promoter. \r\n\r\nWe demonstrate how the biophysics
of protein-DNA binding can be harnessed to investigate the principles that shape
and ultimately limit cellular gene regulation. These results provide a basis for
studies of higher-level functionality, which arises from the underlying regulation.
\ \r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Claudia
full_name: Igler, Claudia
id: 46613666-F248-11E8-B48F-1D18A9856A87
last_name: Igler
citation:
ama: Igler C. On the nature of gene regulatory design - The biophysics of transcription
factor binding shapes gene regulation. 2019. doi:10.15479/AT:ISTA:6371
apa: Igler, C. (2019). On the nature of gene regulatory design - The biophysics
of transcription factor binding shapes gene regulation. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:6371
chicago: Igler, Claudia. “On the Nature of Gene Regulatory Design - The Biophysics
of Transcription Factor Binding Shapes Gene Regulation.” Institute of Science
and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6371.
ieee: C. Igler, “On the nature of gene regulatory design - The biophysics of transcription
factor binding shapes gene regulation,” Institute of Science and Technology Austria,
2019.
ista: Igler C. 2019. On the nature of gene regulatory design - The biophysics of
transcription factor binding shapes gene regulation. Institute of Science and
Technology Austria.
mla: Igler, Claudia. On the Nature of Gene Regulatory Design - The Biophysics
of Transcription Factor Binding Shapes Gene Regulation. Institute of Science
and Technology Austria, 2019, doi:10.15479/AT:ISTA:6371.
short: C. Igler, On the Nature of Gene Regulatory Design - The Biophysics of Transcription
Factor Binding Shapes Gene Regulation, Institute of Science and Technology Austria,
2019.
date_created: 2019-05-03T11:55:51Z
date_published: 2019-05-03T00:00:00Z
date_updated: 2024-02-21T13:45:52Z
day: '03'
ddc:
- '576'
- '579'
degree_awarded: PhD
department:
- _id: CaGu
doi: 10.15479/AT:ISTA:6371
file:
- access_level: open_access
checksum: c0085d47c58c9cbcab1b0a783480f6da
content_type: application/pdf
creator: cigler
date_created: 2019-05-03T11:54:52Z
date_updated: 2021-02-11T11:17:13Z
embargo: 2020-05-02
file_id: '6373'
file_name: IglerClaudia_OntheNatureofGeneRegulatoryDesign.pdf
file_size: 12597663
relation: main_file
- access_level: closed
checksum: 2eac954de1c8bbf7e6fb35ed0221ae8c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: cigler
date_created: 2019-05-03T11:54:54Z
date_updated: 2020-07-14T12:47:28Z
embargo_to: open_access
file_id: '6374'
file_name: IglerClaudia_OntheNatureofGeneRegulatoryDesign.docx
file_size: 34644426
relation: source_file
file_date_updated: 2021-02-11T11:17:13Z
has_accepted_license: '1'
keyword:
- gene regulation
- biophysics
- transcription factor binding
- bacteria
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '152'
project:
- _id: 251EE76E-B435-11E9-9278-68D0E5697425
grant_number: '24573'
name: Design principles underlying genetic switch architecture (DOC Fellowship)
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '67'
relation: part_of_dissertation
status: public
- id: '5585'
relation: popular_science
status: public
status: public
supervisor:
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
title: On the nature of gene regulatory design - The biophysics of transcription factor
binding shapes gene regulation
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '10286'
abstract:
- lang: eng
text: 'In this paper, we evaluate clock signals generated in ring oscillators and
self-timed rings and the way their jitter can be transformed into random numbers.
We show that counting the periods of the jittery clock signal produces random
numbers of significantly better quality than the methods in which the jittery
signal is simply sampled (the case in almost all current methods). Moreover, we
use the counter values to characterize and continuously monitor the source of
randomness. However, instead of using the widely used statistical variance, we
propose to use Allan variance to do so. There are two main advantages: Allan variance
is insensitive to low frequency noises such as flicker noise that are known to
be autocorrelated and significantly less circuitry is required for its computation
than that used to compute commonly used variance. We also show that it is essential
to use a differential principle of randomness extraction from the jitter based
on the use of two identical oscillators to avoid autocorrelations originating
from external and internal global jitter sources and that this fact is valid for
both kinds of rings. Last but not least, we propose a method of statistical testing
based on high order Markov model to show the reduced dependencies when the proposed
randomness extraction is applied.'
article_processing_charge: No
article_type: original
author:
- first_name: Elie Noumon
full_name: Allini, Elie Noumon
last_name: Allini
- first_name: Maciej
full_name: Skórski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skórski
- first_name: Oto
full_name: Petura, Oto
last_name: Petura
- first_name: Florent
full_name: Bernard, Florent
last_name: Bernard
- first_name: Marek
full_name: Laban, Marek
last_name: Laban
- first_name: Viktor
full_name: Fischer, Viktor
last_name: Fischer
citation:
ama: Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and
monitoring of free running oscillators serving as source of randomness. IACR
Transactions on Cryptographic Hardware and Embedded Systems. 2018;2018(3):214-242.
doi:10.13154/tches.v2018.i3.214-242
apa: Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., & Fischer,
V. (2018). Evaluation and monitoring of free running oscillators serving as source
of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems.
International Association for Cryptologic Research. https://doi.org/10.13154/tches.v2018.i3.214-242
chicago: Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek
Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators
Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware
and Embedded Systems. International Association for Cryptologic Research,
2018. https://doi.org/10.13154/tches.v2018.i3.214-242.
ieee: E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer,
“Evaluation and monitoring of free running oscillators serving as source of randomness,”
IACR Transactions on Cryptographic Hardware and Embedded Systems, vol.
2018, no. 3. International Association for Cryptologic Research, pp. 214–242,
2018.
ista: Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation
and monitoring of free running oscillators serving as source of randomness. IACR
Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242.
mla: Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators
Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware
and Embedded Systems, vol. 2018, no. 3, International Association for Cryptologic
Research, 2018, pp. 214–42, doi:10.13154/tches.v2018.i3.214-242.
short: E.N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, V. Fischer, IACR
Transactions on Cryptographic Hardware and Embedded Systems 2018 (2018) 214–242.
date_created: 2021-11-14T23:01:25Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-11-15T10:48:49Z
day: '01'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.13154/tches.v2018.i3.214-242
file:
- access_level: open_access
checksum: b816b848f046c48a8357700d9305dce5
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-15T10:27:29Z
date_updated: 2021-11-15T10:27:29Z
file_id: '10289'
file_name: 2018_IACR_Allini.pdf
file_size: 955755
relation: main_file
success: 1
file_date_updated: 2021-11-15T10:27:29Z
has_accepted_license: '1'
intvolume: ' 2018'
issue: '3'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 214-242
publication: IACR Transactions on Cryptographic Hardware and Embedded Systems
publication_identifier:
eissn:
- 2569-2925
publication_status: published
publisher: International Association for Cryptologic Research
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evaluation and monitoring of free running oscillators serving as source of
randomness
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 2018
year: '2018'
...
---
_id: '10883'
abstract:
- lang: eng
text: 'Solving parity games, which are equivalent to modal μ-calculus model checking,
is a central algorithmic problem in formal methods, with applications in reactive
synthesis, program repair, verification of branching-time properties, etc. Besides
the standard compu- tation model with the explicit representation of games, another
important theoretical model of computation is that of set-based symbolic algorithms.
Set-based symbolic algorithms use basic set operations and one-step predecessor
operations on the implicit description of games, rather than the explicit representation.
The significance of symbolic algorithms is that they provide scalable algorithms
for large finite-state systems, as well as for infinite-state systems with finite
quotient. Consider parity games on graphs with n vertices and parity conditions
with d priorities. While there is a rich literature of explicit algorithms for
parity games, the main results for set-based symbolic algorithms are as follows:
(a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic
space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations
and O(n) symbolic space. In this work, our contributions are as follows: (1) We
present a black-box set-based symbolic algorithm based on the explicit progress
measure algorithm. Two important consequences of our algorithm are as follows:
(a) a set-based symbolic algorithm for parity games that requires quasi-polynomially
many symbolic operations and O(n) symbolic space; and (b) any future improvement
in progress measure based explicit algorithms immediately imply an efficiency
improvement in our set-based symbolic algorithm for parity games. (2) We present
a set-based symbolic algorithm that requires quasi-polynomially many symbolic
operations and O(d · log n) symbolic space. Moreover, for the important special
case of d ≤ log n, our algorithm requires only polynomially many symbolic operations
and poly-logarithmic symbolic space.'
acknowledgement: 'A. S. is fully supported by the Vienna Science and Technology Fund
(WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund
(FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph
Games). For M.H the research leading to these results has received funding from
the European Research Council under the European Union’s Seventh Framework Programme
(FP/2007-2013) /ERC Grant Agreement no. 340506.'
alternative_title:
- EPiC Series in Computing
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: Wolfgang
full_name: Dvořák, Wolfgang
last_name: Dvořák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Quasipolynomial set-based
symbolic algorithms for parity games. In: 22nd International Conference on
Logic for Programming, Artificial Intelligence and Reasoning. Vol 57. EasyChair;
2018:233-253. doi:10.29007/5z5k'
apa: 'Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2018). Quasipolynomial
set-based symbolic algorithms for parity games. In 22nd International Conference
on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57,
pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k'
chicago: Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander
Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd
International Conference on Logic for Programming, Artificial Intelligence and
Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k.
ieee: K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial
set-based symbolic algorithms for parity games,” in 22nd International Conference
on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia,
2018, vol. 57, pp. 233–253.
ista: 'Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2018. Quasipolynomial set-based
symbolic algorithms for parity games. 22nd International Conference on Logic for
Programming, Artificial Intelligence and Reasoning. LPAR: Conference on Logic
for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing,
vol. 57, 233–253.'
mla: Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms
for Parity Games.” 22nd International Conference on Logic for Programming,
Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53,
doi:10.29007/5z5k.
short: K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, in:, 22nd International
Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair,
2018, pp. 233–253.
conference:
end_date: 2018-11-21
location: Awassa, Ethiopia
name: 'LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning'
start_date: 2018-11-17
date_created: 2022-03-18T12:46:32Z
date_published: 2018-10-23T00:00:00Z
date_updated: 2022-07-29T09:24:31Z
day: '23'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.29007/5z5k
ec_funded: 1
external_id:
arxiv:
- '1909.04983'
file:
- access_level: open_access
checksum: 1229aa8640bd6db610c85decf2265480
content_type: application/pdf
creator: dernst
date_created: 2022-05-17T07:51:08Z
date_updated: 2022-05-17T07:51:08Z
file_id: '11392'
file_name: 2018_EPiCs_Chatterjee.pdf
file_size: 720893
relation: main_file
success: 1
file_date_updated: 2022-05-17T07:51:08Z
has_accepted_license: '1'
intvolume: ' 57'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 233-253
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: 22nd International Conference on Logic for Programming, Artificial Intelligence
and Reasoning
publication_identifier:
issn:
- 2398-7340
publication_status: published
publisher: EasyChair
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quasipolynomial set-based symbolic algorithms for parity games
type: conference
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 57
year: '2018'
...