---
_id: '19521'
author:
- first_name: Karlson
full_name: Pfannschmidt, Karlson
last_name: Pfannschmidt
- first_name: Eyke
full_name: Hüllermeier, Eyke
last_name: Hüllermeier
citation:
ama: 'Pfannschmidt K, Hüllermeier E. Learning Choice Functions via Pareto-Embeddings.
In: Lecture Notes in Computer Science. Cham; 2020. doi:10.1007/978-3-030-58285-2_30'
apa: Pfannschmidt, K., & Hüllermeier, E. (2020). Learning Choice Functions via
Pareto-Embeddings. In Lecture Notes in Computer Science. Cham. https://doi.org/10.1007/978-3-030-58285-2_30
bibtex: '@inbook{Pfannschmidt_Hüllermeier_2020, place={Cham}, title={Learning Choice
Functions via Pareto-Embeddings}, DOI={10.1007/978-3-030-58285-2_30},
booktitle={Lecture Notes in Computer Science}, author={Pfannschmidt, Karlson and
Hüllermeier, Eyke}, year={2020} }'
chicago: Pfannschmidt, Karlson, and Eyke Hüllermeier. “Learning Choice Functions
via Pareto-Embeddings.” In Lecture Notes in Computer Science. Cham, 2020.
https://doi.org/10.1007/978-3-030-58285-2_30.
ieee: K. Pfannschmidt and E. Hüllermeier, “Learning Choice Functions via Pareto-Embeddings,”
in Lecture Notes in Computer Science, Cham, 2020.
mla: Pfannschmidt, Karlson, and Eyke Hüllermeier. “Learning Choice Functions via
Pareto-Embeddings.” Lecture Notes in Computer Science, 2020, doi:10.1007/978-3-030-58285-2_30.
short: 'K. Pfannschmidt, E. Hüllermeier, in: Lecture Notes in Computer Science,
Cham, 2020.'
date_created: 2020-09-17T10:52:41Z
date_updated: 2022-01-06T06:54:06Z
department:
- _id: '7'
- _id: '355'
doi: 10.1007/978-3-030-58285-2_30
language:
- iso: eng
place: Cham
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783030582845'
- '9783030582852'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Learning Choice Functions via Pareto-Embeddings
type: book_chapter
user_id: '13472'
year: '2020'
...
---
_id: '19606'
abstract:
- lang: eng
text: Mobile shopping apps have been using Augmented Reality (AR) in the last years
to place their products in the environment of the customer. While this is possible
with atomic 3D objects, there is is still a lack in the runtime configuration of
3D object compositions based on user needs and environmental constraints. For
this, we previously developed an approach for model-based AR-assisted product
configuration based on the concept of Dynamic Software Product Lines. In this demonstration
paper, we present the corresponding tool support ProConAR in the form of a Product
Modeler and a Product Configurator. While the Product Modeler is an Angular web
app that splits products (e.g. table) up into atomic parts (e.g. tabletop, table
legs, funnier) and saves it within a configuration model, the Product Configurator
is an Android client that uses the configuration model to place different product
configurations within the environment of the customer. We show technical details
of our ready to use tool-chain ProConAR by describing its implementation and usage
as well as pointing out future research directions.
author:
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Eugen
full_name: Schmidt, Eugen
last_name: Schmidt
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Gottschalk S, Yigitbas E, Schmidt E, Engels G. ProConAR: A Tool Support for
Model-based AR Product Configuration. In: Bernhaupt R, Ardito C, Sauer S, eds.
Human-Centered Software Engineering. HCSE 2020. Vol 12481. Lecture Notes
in Computer Science. Cham: Springer; 2020. doi:10.1007/978-3-030-64266-2_14'
apa: 'Gottschalk, S., Yigitbas, E., Schmidt, E., & Engels, G. (2020). ProConAR:
A Tool Support for Model-based AR Product Configuration. In R. Bernhaupt, C. Ardito,
& S. Sauer (Eds.), Human-Centered Software Engineering. HCSE 2020 (Vol.
12481). Cham: Springer. https://doi.org/10.1007/978-3-030-64266-2_14'
bibtex: '@inproceedings{Gottschalk_Yigitbas_Schmidt_Engels_2020, place={Cham}, series={Lecture
Notes in Computer Science}, title={ProConAR: A Tool Support for Model-based AR
Product Configuration}, volume={12481}, DOI={10.1007/978-3-030-64266-2_14},
booktitle={Human-Centered Software Engineering. HCSE 2020}, publisher={Springer},
author={Gottschalk, Sebastian and Yigitbas, Enes and Schmidt, Eugen and Engels,
Gregor}, editor={Bernhaupt, Regina and Ardito, Carmelo and Sauer, StefanEditors},
year={2020}, collection={Lecture Notes in Computer Science} }'
chicago: 'Gottschalk, Sebastian, Enes Yigitbas, Eugen Schmidt, and Gregor Engels.
“ProConAR: A Tool Support for Model-Based AR Product Configuration.” In Human-Centered
Software Engineering. HCSE 2020, edited by Regina Bernhaupt, Carmelo Ardito,
and Stefan Sauer, Vol. 12481. Lecture Notes in Computer Science. Cham: Springer,
2020. https://doi.org/10.1007/978-3-030-64266-2_14.'
ieee: 'S. Gottschalk, E. Yigitbas, E. Schmidt, and G. Engels, “ProConAR: A Tool
Support for Model-based AR Product Configuration,” in Human-Centered Software
Engineering. HCSE 2020, Eindhoven, 2020, vol. 12481.'
mla: 'Gottschalk, Sebastian, et al. “ProConAR: A Tool Support for Model-Based AR
Product Configuration.” Human-Centered Software Engineering. HCSE 2020,
edited by Regina Bernhaupt et al., vol. 12481, Springer, 2020, doi:10.1007/978-3-030-64266-2_14.'
short: 'S. Gottschalk, E. Yigitbas, E. Schmidt, G. Engels, in: R. Bernhaupt, C.
Ardito, S. Sauer (Eds.), Human-Centered Software Engineering. HCSE 2020, Springer,
Cham, 2020.'
conference:
end_date: 2020-12-02
location: Eindhoven
name: 8th International Working Conference on Human-Centered Software Engineering
(HCSE'20)
start_date: 2020-11-30
date_created: 2020-09-21T17:01:11Z
date_updated: 2022-01-06T06:54:07Z
ddc:
- '000'
department:
- _id: '66'
- _id: '534'
doi: 10.1007/978-3-030-64266-2_14
editor:
- first_name: Regina
full_name: Bernhaupt, Regina
last_name: Bernhaupt
- first_name: Carmelo
full_name: Ardito, Carmelo
last_name: Ardito
- first_name: Stefan
full_name: Sauer, Stefan
last_name: Sauer
file:
- access_level: open_access
content_type: application/pdf
creator: sego
date_created: 2020-11-30T08:39:18Z
date_updated: 2020-11-30T08:39:18Z
file_id: '20542'
file_name: HCSE20_demo.pdf
file_size: 3913885
relation: main_file
file_date_updated: 2020-11-30T08:39:18Z
has_accepted_license: '1'
intvolume: ' 12481'
keyword:
- Product Configuration
- Augmented Reality
- Model-based
- Tool Support
language:
- iso: eng
oa: '1'
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Human-Centered Software Engineering. HCSE 2020
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'ProConAR: A Tool Support for Model-based AR Product Configuration'
type: conference
user_id: '47208'
volume: 12481
year: '2020'
...
---
_id: '19607'
abstract:
- lang: eng
text: "Modern services consist of modular, interconnected\r\ncomponents, e.g., microservices
forming a service mesh. To\r\ndynamically adjust to ever-changing service demands,
service\r\ncomponents have to be instantiated on nodes across the network.\r\nIncoming
flows requesting a service then need to be routed\r\nthrough the deployed instances
while considering node and link\r\ncapacities. Ultimately, the goal is to maximize
the successfully\r\nserved flows and Quality of Service (QoS) through online service\r\ncoordination.
Current approaches for service coordination are\r\nusually centralized, assuming
up-to-date global knowledge and\r\nmaking global decisions for all nodes in the
network. Such global\r\nknowledge and centralized decisions are not realistic
in practical\r\nlarge-scale networks.\r\n\r\nTo solve this problem, we propose
two algorithms for fully\r\ndistributed service coordination. The proposed algorithms
can be\r\nexecuted individually at each node in parallel and require only\r\nvery
limited global knowledge. We compare and evaluate both\r\nalgorithms with a state-of-the-art
centralized approach in extensive\r\nsimulations on a large-scale, real-world
network topology.\r\nOur results indicate that the two algorithms can compete
with\r\ncentralized approaches in terms of solution quality but require\r\nless
global knowledge and are magnitudes faster (more than\r\n100x)."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Lars Dietrich
full_name: Klenner, Lars Dietrich
last_name: Klenner
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schneider SB, Klenner LD, Karl H. Every Node for Itself: Fully Distributed
Service Coordination. In: IEEE International Conference on Network and Service
Management (CNSM). IEEE; 2020.'
apa: 'Schneider, S. B., Klenner, L. D., & Karl, H. (2020). Every Node for Itself:
Fully Distributed Service Coordination. In IEEE International Conference on
Network and Service Management (CNSM). IEEE.'
bibtex: '@inproceedings{Schneider_Klenner_Karl_2020, title={Every Node for Itself:
Fully Distributed Service Coordination}, booktitle={IEEE International Conference
on Network and Service Management (CNSM)}, publisher={IEEE}, author={Schneider,
Stefan Balthasar and Klenner, Lars Dietrich and Karl, Holger}, year={2020} }'
chicago: 'Schneider, Stefan Balthasar, Lars Dietrich Klenner, and Holger Karl. “Every
Node for Itself: Fully Distributed Service Coordination.” In IEEE International
Conference on Network and Service Management (CNSM). IEEE, 2020.'
ieee: 'S. B. Schneider, L. D. Klenner, and H. Karl, “Every Node for Itself: Fully
Distributed Service Coordination,” in IEEE International Conference on Network
and Service Management (CNSM), 2020.'
mla: 'Schneider, Stefan Balthasar, et al. “Every Node for Itself: Fully Distributed
Service Coordination.” IEEE International Conference on Network and Service
Management (CNSM), IEEE, 2020.'
short: 'S.B. Schneider, L.D. Klenner, H. Karl, in: IEEE International Conference
on Network and Service Management (CNSM), IEEE, 2020.'
date_created: 2020-09-22T06:23:40Z
date_updated: 2022-01-06T06:54:08Z
ddc:
- '006'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2020-09-22T06:25:57Z
date_updated: 2020-09-22T06:36:25Z
file_id: '19608'
file_name: ris_with_copyright.pdf
file_size: 500948
relation: main_file
file_date_updated: 2020-09-22T06:36:25Z
has_accepted_license: '1'
keyword:
- distributed management
- service coordination
- network coordination
- nfv
- softwarization
- orchestration
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE International Conference on Network and Service Management (CNSM)
publisher: IEEE
status: public
title: 'Every Node for Itself: Fully Distributed Service Coordination'
type: conference
user_id: '35343'
year: '2020'
...
---
_id: '19609'
abstract:
- lang: eng
text: "Modern services comprise interconnected components,\r\ne.g., microservices
in a service mesh, that can scale and\r\nrun on multiple nodes across the network
on demand. To process\r\nincoming traffic, service components have to be instantiated
and\r\ntraffic assigned to these instances, taking capacities and changing\r\ndemands
into account. This challenge is usually solved with\r\ncustom approaches designed
by experts. While this typically\r\nworks well for the considered scenario, the
models often rely\r\non unrealistic assumptions or on knowledge that is not available\r\nin
practice (e.g., a priori knowledge).\r\n\r\nWe propose a novel deep reinforcement
learning approach that\r\nlearns how to best coordinate services and is geared
towards\r\nrealistic assumptions. It interacts with the network and relies on\r\navailable,
possibly delayed monitoring information. Rather than\r\ndefining a complex model
or an algorithm how to achieve an\r\nobjective, our model-free approach adapts
to various objectives\r\nand traffic patterns. An agent is trained offline without
expert\r\nknowledge and then applied online with minimal overhead. Compared\r\nto
a state-of-the-art heuristic, it significantly improves flow\r\nthroughput and
overall network utility on real-world network\r\ntopologies and traffic traces.
It also learns to optimize different\r\nobjectives, generalizes to scenarios with
unseen, stochastic traffic\r\npatterns, and scales to large real-world networks."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Adnan
full_name: Manzoor, Adnan
last_name: Manzoor
- first_name: Haydar
full_name: Qarawlus, Haydar
last_name: Qarawlus
- first_name: Rafael
full_name: Schellenberg, Rafael
last_name: Schellenberg
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Ramin
full_name: Khalili, Ramin
last_name: Khalili
- first_name: Artur
full_name: Hecker, Artur
last_name: Hecker
citation:
ama: 'Schneider SB, Manzoor A, Qarawlus H, et al. Self-Driving Network and Service
Coordination Using Deep Reinforcement Learning. In: IEEE International Conference
on Network and Service Management (CNSM). IEEE; 2020.'
apa: Schneider, S. B., Manzoor, A., Qarawlus, H., Schellenberg, R., Karl, H., Khalili,
R., & Hecker, A. (2020). Self-Driving Network and Service Coordination Using
Deep Reinforcement Learning. In IEEE International Conference on Network and
Service Management (CNSM). IEEE.
bibtex: '@inproceedings{Schneider_Manzoor_Qarawlus_Schellenberg_Karl_Khalili_Hecker_2020,
title={Self-Driving Network and Service Coordination Using Deep Reinforcement
Learning}, booktitle={IEEE International Conference on Network and Service Management
(CNSM)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Manzoor, Adnan
and Qarawlus, Haydar and Schellenberg, Rafael and Karl, Holger and Khalili, Ramin
and Hecker, Artur}, year={2020} }'
chicago: Schneider, Stefan Balthasar, Adnan Manzoor, Haydar Qarawlus, Rafael Schellenberg,
Holger Karl, Ramin Khalili, and Artur Hecker. “Self-Driving Network and Service
Coordination Using Deep Reinforcement Learning.” In IEEE International Conference
on Network and Service Management (CNSM). IEEE, 2020.
ieee: S. B. Schneider et al., “Self-Driving Network and Service Coordination
Using Deep Reinforcement Learning,” in IEEE International Conference on Network
and Service Management (CNSM), 2020.
mla: Schneider, Stefan Balthasar, et al. “Self-Driving Network and Service Coordination
Using Deep Reinforcement Learning.” IEEE International Conference on Network
and Service Management (CNSM), IEEE, 2020.
short: 'S.B. Schneider, A. Manzoor, H. Qarawlus, R. Schellenberg, H. Karl, R. Khalili,
A. Hecker, in: IEEE International Conference on Network and Service Management
(CNSM), IEEE, 2020.'
date_created: 2020-09-22T06:28:22Z
date_updated: 2022-01-06T06:54:08Z
ddc:
- '006'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2020-09-22T06:29:16Z
date_updated: 2020-09-22T06:36:00Z
file_id: '19610'
file_name: ris_with_copyright.pdf
file_size: 642999
relation: main_file
file_date_updated: 2020-09-22T06:36:00Z
has_accepted_license: '1'
keyword:
- self-driving networks
- self-learning
- network coordination
- service coordination
- reinforcement learning
- deep learning
- nfv
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE International Conference on Network and Service Management (CNSM)
publisher: IEEE
status: public
title: Self-Driving Network and Service Coordination Using Deep Reinforcement Learning
type: conference
user_id: '35343'
year: '2020'
...
---
_id: '19632'
author:
- first_name: Ivan
full_name: Jovanovikj, Ivan
id: '39187'
last_name: Jovanovikj
orcid: https://orcid.org/0000-0002-1838-794X
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Jovanovikj I, Yigitbas E, Sauer S, Engels G. Augmented and Virtual Reality
Object Repository for Rapid Prototyping . In: Proceedings of the 8th International
Working Conference on Human-Centered Software Engineering (HCSE’20). Springer;
2020:216-224.'
apa: Jovanovikj, I., Yigitbas, E., Sauer, S., & Engels, G. (2020). Augmented
and Virtual Reality Object Repository for Rapid Prototyping . In Proceedings
of the 8th International Working Conference on Human-Centered Software Engineering
(HCSE’20) (pp. 216–224). Springer.
bibtex: '@inproceedings{Jovanovikj_Yigitbas_Sauer_Engels_2020, title={Augmented
and Virtual Reality Object Repository for Rapid Prototyping }, booktitle={Proceedings
of the 8th International Working Conference on Human-Centered Software Engineering
(HCSE’20)}, publisher={Springer}, author={Jovanovikj, Ivan and Yigitbas, Enes
and Sauer, Stefan and Engels, Gregor}, year={2020}, pages={216–224} }'
chicago: Jovanovikj, Ivan, Enes Yigitbas, Stefan Sauer, and Gregor Engels. “Augmented
and Virtual Reality Object Repository for Rapid Prototyping .” In Proceedings
of the 8th International Working Conference on Human-Centered Software Engineering
(HCSE’20), 216–24. Springer, 2020.
ieee: I. Jovanovikj, E. Yigitbas, S. Sauer, and G. Engels, “Augmented and Virtual
Reality Object Repository for Rapid Prototyping ,” in Proceedings of the 8th
International Working Conference on Human-Centered Software Engineering (HCSE’20),
2020, pp. 216–224.
mla: Jovanovikj, Ivan, et al. “Augmented and Virtual Reality Object Repository for
Rapid Prototyping .” Proceedings of the 8th International Working Conference
on Human-Centered Software Engineering (HCSE’20), Springer, 2020, pp. 216–24.
short: 'I. Jovanovikj, E. Yigitbas, S. Sauer, G. Engels, in: Proceedings of the
8th International Working Conference on Human-Centered Software Engineering (HCSE’20),
Springer, 2020, pp. 216–224.'
date_created: 2020-09-22T12:44:51Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '66'
- _id: '534'
language:
- iso: eng
page: 216-224
publication: Proceedings of the 8th International Working Conference on Human-Centered
Software Engineering (HCSE'20)
publisher: Springer
status: public
title: 'Augmented and Virtual Reality Object Repository for Rapid Prototyping '
type: conference
user_id: '8447'
year: '2020'
...
---
_id: '19656'
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Sharma A, Wehrheim H. Automatic Fairness Testing of Machine Learning Models.
In: Proceedings of the 32th IFIP International Conference on Testing Software
and Systems (ICTSS). LNCS. Springer.'
apa: Sharma, A., & Wehrheim, H. (n.d.). Automatic Fairness Testing of Machine
Learning Models. In Proceedings of the 32th IFIP International Conference on
Testing Software and Systems (ICTSS). Springer.
bibtex: '@inproceedings{Sharma_Wehrheim, series={LNCS}, title={Automatic Fairness
Testing of Machine Learning Models}, booktitle={Proceedings of the 32th IFIP International
Conference on Testing Software and Systems (ICTSS)}, publisher={Springer}, author={Sharma,
Arnab and Wehrheim, Heike}, collection={LNCS} }'
chicago: Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine
Learning Models.” In Proceedings of the 32th IFIP International Conference
on Testing Software and Systems (ICTSS). LNCS. Springer, n.d.
ieee: A. Sharma and H. Wehrheim, “Automatic Fairness Testing of Machine Learning
Models,” in Proceedings of the 32th IFIP International Conference on Testing
Software and Systems (ICTSS).
mla: Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning
Models.” Proceedings of the 32th IFIP International Conference on Testing Software
and Systems (ICTSS), Springer.
short: 'A. Sharma, H. Wehrheim, in: Proceedings of the 32th IFIP International Conference
on Testing Software and Systems (ICTSS), Springer, n.d.'
date_created: 2020-09-24T12:53:02Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '7'
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 32th IFIP International Conference on Testing Software
and Systems (ICTSS)
publication_status: accepted
publisher: Springer
series_title: LNCS
status: public
title: Automatic Fairness Testing of Machine Learning Models
type: conference
user_id: '477'
year: '2020'
...
---
_id: '19864'
article_type: original
author:
- first_name: Maurice
full_name: Meyer, Maurice
id: '77201'
last_name: Meyer
orcid: 0000-0003-0606-7321
- first_name: Maximilian
full_name: Frank, Maximilian
last_name: Frank
- first_name: Melina
full_name: Massmann, Melina
last_name: Massmann
- first_name: Roman
full_name: Dumitrescu, Roman
id: '16190'
last_name: Dumitrescu
citation:
ama: Meyer M, Frank M, Massmann M, Dumitrescu R. Research and Consulting in Data-Driven
Strategic Product Planning. Proceedings of The 11th International Multi-Conference
on Complexity, Informatics and Cybernetics (IMCIC 2020). 2020.
apa: Meyer, M., Frank, M., Massmann, M., & Dumitrescu, R. (2020). Research and
Consulting in Data-Driven Strategic Product Planning. Proceedings of The 11th
International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC
2020).
bibtex: '@article{Meyer_Frank_Massmann_Dumitrescu_2020, title={Research and Consulting
in Data-Driven Strategic Product Planning}, journal={Proceedings of The 11th International
Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)}, author={Meyer,
Maurice and Frank, Maximilian and Massmann, Melina and Dumitrescu, Roman}, year={2020}
}'
chicago: Meyer, Maurice, Maximilian Frank, Melina Massmann, and Roman Dumitrescu.
“Research and Consulting in Data-Driven Strategic Product Planning.” Proceedings
of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics
(IMCIC 2020), 2020.
ieee: M. Meyer, M. Frank, M. Massmann, and R. Dumitrescu, “Research and Consulting
in Data-Driven Strategic Product Planning,” Proceedings of The 11th International
Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020),
2020.
mla: Meyer, Maurice, et al. “Research and Consulting in Data-Driven Strategic Product
Planning.” Proceedings of The 11th International Multi-Conference on Complexity,
Informatics and Cybernetics (IMCIC 2020), 2020.
short: M. Meyer, M. Frank, M. Massmann, R. Dumitrescu, Proceedings of The 11th International
Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020) (2020).
date_created: 2020-10-02T16:19:50Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '563'
language:
- iso: eng
publication: Proceedings of The 11th International Multi-Conference on Complexity,
Informatics and Cybernetics (IMCIC 2020)
status: public
title: Research and Consulting in Data-Driven Strategic Product Planning
type: journal_article
user_id: '77201'
year: '2020'
...
---
_id: '19866'
article_type: original
author:
- first_name: Maurice
full_name: Meyer, Maurice
id: '77201'
last_name: Meyer
orcid: 0000-0003-0606-7321
- first_name: Maximilian
full_name: Frank, Maximilian
last_name: Frank
- first_name: Melina
full_name: Massmann, Melina
last_name: Massmann
- first_name: Roman
full_name: Dumitrescu, Roman
id: '16190'
last_name: Dumitrescu
citation:
ama: Meyer M, Frank M, Massmann M, Dumitrescu R. Research and Consulting in Data-Driven
Strategic Product Planning. Journal of Systemics, Cybernetics and Informatics.
2020;18(2):55-61.
apa: Meyer, M., Frank, M., Massmann, M., & Dumitrescu, R. (2020). Research and
Consulting in Data-Driven Strategic Product Planning. Journal of Systemics,
Cybernetics and Informatics, 18(2), 55–61.
bibtex: '@article{Meyer_Frank_Massmann_Dumitrescu_2020, title={Research and Consulting
in Data-Driven Strategic Product Planning}, volume={18}, number={2}, journal={Journal
of Systemics, Cybernetics and Informatics}, author={Meyer, Maurice and Frank,
Maximilian and Massmann, Melina and Dumitrescu, Roman}, year={2020}, pages={55–61}
}'
chicago: 'Meyer, Maurice, Maximilian Frank, Melina Massmann, and Roman Dumitrescu.
“Research and Consulting in Data-Driven Strategic Product Planning.” Journal
of Systemics, Cybernetics and Informatics 18, no. 2 (2020): 55–61.'
ieee: M. Meyer, M. Frank, M. Massmann, and R. Dumitrescu, “Research and Consulting
in Data-Driven Strategic Product Planning,” Journal of Systemics, Cybernetics
and Informatics, vol. 18, no. 2, pp. 55–61, 2020.
mla: Meyer, Maurice, et al. “Research and Consulting in Data-Driven Strategic Product
Planning.” Journal of Systemics, Cybernetics and Informatics, vol. 18,
no. 2, 2020, pp. 55–61.
short: M. Meyer, M. Frank, M. Massmann, R. Dumitrescu, Journal of Systemics, Cybernetics
and Informatics 18 (2020) 55–61.
date_created: 2020-10-02T16:21:47Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '563'
intvolume: ' 18'
issue: '2'
language:
- iso: eng
page: 55-61
publication: Journal of Systemics, Cybernetics and Informatics
status: public
title: Research and Consulting in Data-Driven Strategic Product Planning
type: journal_article
user_id: '77201'
volume: 18
year: '2020'
...
---
_id: '19899'
abstract:
- lang: eng
text: "Most existing robot formation problems seek a target formation of a certain\r\nminimal
and, thus, efficient structure. Examples include the Gathering\r\nand the Chain-Formation
problem. In this work, we study formation problems that\r\ntry to reach a maximal
structure, supporting for example an efficient\r\ncoverage in exploration scenarios.
A recent example is the NASA Shapeshifter\r\nproject, which describes how the
robots form a relay chain along which gathered\r\ndata from extraterrestrial cave
explorations may be sent to a home base.\r\n As a first step towards understanding
such maximization tasks, we introduce\r\nand study the Max-Chain-Formation problem,
where $n$ robots are ordered along a\r\nwinding, potentially self-intersecting
chain and must form a connected,\r\nstraight line of maximal length connecting
its two endpoints. We propose and\r\nanalyze strategies in a discrete and in a
continuous time model. In the\r\ndiscrete case, we give a complete analysis if
all robots are initially\r\ncollinear, showing that the worst-case time to reach
an\r\n$\\varepsilon$-approximation is upper bounded by $\\mathcal{O}(n^2 \\cdot
\\log\r\n(n/\\varepsilon))$ and lower bounded by $\\Omega(n^2 \\cdot~\\log\r\n(1/\\varepsilon))$.
If one endpoint of the chain remains stationary, this result\r\ncan be extended
to the non-collinear case. If both endpoints move, we identify\r\na family of
instances whose runtime is unbounded. For the continuous model, we\r\ngive a strategy
with an optimal runtime bound of $\\Theta(n)$. Avoiding an\r\nunbounded runtime
similar to the discrete case relies crucially on a\r\ncounter-intuitive aspect
of the strategy: slowing down the endpoints while all\r\nother robots move at
full speed. Surprisingly, we can show that a similar trick\r\ndoes not work in
the discrete model."
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous
Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In: Devismes S,
Mittal N, eds. Stabilization, Safety, and Security of Distributed Systems -
22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020,
Proceedings. Vol 12514. Lecture Notes in Computer Science (LNCS). Springer;
2020:65-80. doi:10.1007/978-3-030-64348-5_6'
apa: Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2020).
A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down
to Speed Up. In S. Devismes & N. Mittal (Eds.), Stabilization, Safety,
and Security of Distributed Systems - 22nd International Symposium, SSS 2020,
Austin, Texas, USA, November 18-21, 2020, Proceedings (Vol. 12514, pp. 65–80).
Springer. https://doi.org/10.1007/978-3-030-64348-5_6
bibtex: '@inproceedings{Castenow_Kling_Knollmann_Meyer auf der Heide_2020, series={Lecture
Notes in Computer Science (LNCS)}, title={A Discrete and Continuous Study of the
Max-Chain-Formation Problem – Slow Down to Speed Up}, volume={12514}, DOI={10.1007/978-3-030-64348-5_6},
booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings}, publisher={Springer},
author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der
Heide, Friedhelm}, editor={Devismes , Stéphane and Mittal, Neeraj Editors}, year={2020},
pages={65–80}, collection={Lecture Notes in Computer Science (LNCS)} }'
chicago: Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf
der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem
– Slow Down to Speed Up.” In Stabilization, Safety, and Security of Distributed
Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November
18-21, 2020, Proceedings, edited by Stéphane Devismes and Neeraj Mittal,
12514:65–80. Lecture Notes in Computer Science (LNCS). Springer, 2020. https://doi.org/10.1007/978-3-030-64348-5_6.
ieee: J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete
and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up,”
in Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings,
2020, vol. 12514, pp. 65–80.
mla: Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation
Problem – Slow Down to Speed Up.” Stabilization, Safety, and Security of Distributed
Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November
18-21, 2020, Proceedings, edited by Stéphane Devismes and Neeraj Mittal,
vol. 12514, Springer, 2020, pp. 65–80, doi:10.1007/978-3-030-64348-5_6.
short: 'J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes
, N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems
- 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21,
2020, Proceedings, Springer, 2020, pp. 65–80.'
date_created: 2020-10-06T07:27:10Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1007/978-3-030-64348-5_6
editor:
- first_name: 'Stéphane '
full_name: 'Devismes , Stéphane '
last_name: 'Devismes '
- first_name: 'Neeraj '
full_name: 'Mittal, Neeraj '
last_name: Mittal
external_id:
arxiv:
- '2010.02043 '
intvolume: ' 12514'
language:
- iso: eng
page: 65-80
publication: Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings
publication_identifier:
isbn:
- 978-3-030-64347-8
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science (LNCS)
status: public
title: A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down
to Speed Up
type: conference
user_id: '38705'
volume: 12514
year: '2020'
...
---
_id: '19953'
abstract:
- lang: eng
text: Current GNN architectures use a vertex neighborhood aggregation scheme, which
limits their discriminative power to that of the 1-dimensional Weisfeiler-Lehman
(WL) graph isomorphism test. Here, we propose a novel graph convolution operator
that is based on the 2-dimensional WL test. We formally show that the resulting
2-WL-GNN architecture is more discriminative than existing GNN approaches. This
theoretical result is complemented by experimental studies using synthetic and
real data. On multiple common graph classification benchmarks, we demonstrate
that the proposed model is competitive with state-of-the-art graph kernels and
GNNs.
author:
- first_name: Clemens
full_name: Damke, Clemens
id: '48192'
last_name: Damke
orcid: 0000-0002-0455-0048
- first_name: Vitaly
full_name: Melnikov, Vitaly
id: '58747'
last_name: Melnikov
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Damke C, Melnikov V, Hüllermeier E. A Novel Higher-order Weisfeiler-Lehman
Graph Convolution. In: Jialin Pan S, Sugiyama M, eds. Proceedings of the 12th
Asian Conference on Machine Learning (ACML 2020). Vol 129. Proceedings of
Machine Learning Research. Bangkok, Thailand: PMLR; 2020:49-64.'
apa: 'Damke, C., Melnikov, V., & Hüllermeier, E. (2020). A Novel Higher-order
Weisfeiler-Lehman Graph Convolution. In S. Jialin Pan & M. Sugiyama (Eds.),
Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)
(Vol. 129, pp. 49–64). Bangkok, Thailand: PMLR.'
bibtex: '@inproceedings{Damke_Melnikov_Hüllermeier_2020, place={Bangkok, Thailand},
series={Proceedings of Machine Learning Research}, title={A Novel Higher-order
Weisfeiler-Lehman Graph Convolution}, volume={129}, booktitle={Proceedings of
the 12th Asian Conference on Machine Learning (ACML 2020)}, publisher={PMLR},
author={Damke, Clemens and Melnikov, Vitaly and Hüllermeier, Eyke}, editor={Jialin
Pan, Sinno and Sugiyama, MasashiEditors}, year={2020}, pages={49–64}, collection={Proceedings
of Machine Learning Research} }'
chicago: 'Damke, Clemens, Vitaly Melnikov, and Eyke Hüllermeier. “A Novel Higher-Order
Weisfeiler-Lehman Graph Convolution.” In Proceedings of the 12th Asian Conference
on Machine Learning (ACML 2020), edited by Sinno Jialin Pan and Masashi Sugiyama,
129:49–64. Proceedings of Machine Learning Research. Bangkok, Thailand: PMLR,
2020.'
ieee: C. Damke, V. Melnikov, and E. Hüllermeier, “A Novel Higher-order Weisfeiler-Lehman
Graph Convolution,” in Proceedings of the 12th Asian Conference on Machine
Learning (ACML 2020), Bangkok, Thailand, 2020, vol. 129, pp. 49–64.
mla: Damke, Clemens, et al. “A Novel Higher-Order Weisfeiler-Lehman Graph Convolution.”
Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020),
edited by Sinno Jialin Pan and Masashi Sugiyama, vol. 129, PMLR, 2020, pp. 49–64.
short: 'C. Damke, V. Melnikov, E. Hüllermeier, in: S. Jialin Pan, M. Sugiyama (Eds.),
Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020), PMLR,
Bangkok, Thailand, 2020, pp. 49–64.'
conference:
end_date: 2020-11-20
location: Bangkok, Thailand
name: Asian Conference on Machine Learning
start_date: 2020-11-18
date_created: 2020-10-08T10:48:38Z
date_updated: 2022-01-06T06:54:17Z
ddc:
- '006'
department:
- _id: '355'
editor:
- first_name: Sinno
full_name: Jialin Pan, Sinno
last_name: Jialin Pan
- first_name: Masashi
full_name: Sugiyama, Masashi
last_name: Sugiyama
external_id:
arxiv:
- '2007.00346'
file:
- access_level: open_access
content_type: application/pdf
creator: cdamke
date_created: 2020-10-08T10:54:48Z
date_updated: 2020-10-08T11:21:00Z
file_id: '19954'
file_name: damke20.pdf
file_size: 771137
relation: main_file
- access_level: open_access
content_type: application/pdf
creator: cdamke
date_created: 2020-10-08T10:54:59Z
date_updated: 2020-10-08T11:24:29Z
file_id: '19955'
file_name: damke20-supp.pdf
file_size: 613163
relation: supplementary_material
file_date_updated: 2020-10-08T11:24:29Z
has_accepted_license: '1'
intvolume: ' 129'
keyword:
- graph neural networks
- Weisfeiler-Lehman test
- cycle detection
language:
- iso: eng
oa: '1'
page: 49-64
place: Bangkok, Thailand
publication: Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)
publication_status: published
publisher: PMLR
quality_controlled: '1'
series_title: Proceedings of Machine Learning Research
status: public
title: A Novel Higher-order Weisfeiler-Lehman Graph Convolution
type: conference
user_id: '48192'
volume: 129
year: '2020'
...
---
_id: '19999'
author:
- first_name: Stefan
full_name: Mayer, Stefan
last_name: Mayer
citation:
ama: Mayer S. Optimierung von JMCTest Beim Testen von Inter Method Contracts.
Universität Paderborn; 2020.
apa: Mayer, S. (2020). Optimierung von JMCTest beim Testen von Inter Method Contracts.
Universität Paderborn.
bibtex: '@book{Mayer_2020, title={Optimierung von JMCTest beim Testen von Inter
Method Contracts}, publisher={Universität Paderborn}, author={Mayer, Stefan},
year={2020} }'
chicago: Mayer, Stefan. Optimierung von JMCTest Beim Testen von Inter Method
Contracts. Universität Paderborn, 2020.
ieee: S. Mayer, Optimierung von JMCTest beim Testen von Inter Method Contracts.
Universität Paderborn, 2020.
mla: Mayer, Stefan. Optimierung von JMCTest Beim Testen von Inter Method Contracts.
Universität Paderborn, 2020.
short: S. Mayer, Optimierung von JMCTest Beim Testen von Inter Method Contracts,
Universität Paderborn, 2020.
date_created: 2020-10-15T05:15:46Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '7'
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Optimierung von JMCTest beim Testen von Inter Method Contracts
type: bachelorsthesis
user_id: '477'
year: '2020'
...
---
_id: '20116'
author:
- first_name: Zahra
full_name: Nouri, Zahra
id: '35802'
last_name: Nouri
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Nouri Z, Wachsmuth H, Engels G. Mining Crowdsourcing Problems from Discussion
Forums of Workers. In: Proceedings of COLING 2020, the 28th International Conference
on Computational Linguistics. ; :6264-6276.'
apa: Nouri, Z., Wachsmuth, H., & Engels, G. (n.d.). Mining Crowdsourcing Problems
from Discussion Forums of Workers. In Proceedings of COLING 2020, the 28th
International Conference on Computational Linguistics (pp. 6264–6276). Barcelona,
Spain.
bibtex: '@inproceedings{Nouri_Wachsmuth_Engels, title={Mining Crowdsourcing Problems
from Discussion Forums of Workers}, booktitle={Proceedings of COLING 2020, the
28th International Conference on Computational Linguistics}, author={Nouri, Zahra
and Wachsmuth, Henning and Engels, Gregor}, pages={6264–6276} }'
chicago: Nouri, Zahra, Henning Wachsmuth, and Gregor Engels. “Mining Crowdsourcing
Problems from Discussion Forums of Workers.” In Proceedings of COLING 2020,
the 28th International Conference on Computational Linguistics, 6264–76, n.d.
ieee: Z. Nouri, H. Wachsmuth, and G. Engels, “Mining Crowdsourcing Problems from
Discussion Forums of Workers,” in Proceedings of COLING 2020, the 28th International
Conference on Computational Linguistics, Barcelona, Spain, pp. 6264–6276.
mla: Nouri, Zahra, et al. “Mining Crowdsourcing Problems from Discussion Forums
of Workers.” Proceedings of COLING 2020, the 28th International Conference
on Computational Linguistics, pp. 6264–76.
short: 'Z. Nouri, H. Wachsmuth, G. Engels, in: Proceedings of COLING 2020, the 28th
International Conference on Computational Linguistics, n.d., pp. 6264–6276.'
conference:
end_date: 2020-12-13
location: Barcelona, Spain
name: The 28th International Conference on Computational Linguistics
start_date: 2020-12-08
date_created: 2020-10-18T12:21:34Z
date_updated: 2022-01-06T06:54:19Z
ddc:
- '000'
department:
- _id: '600'
file:
- access_level: closed
content_type: application/pdf
creator: znouri
date_created: 2020-11-10T14:25:56Z
date_updated: 2020-11-10T14:25:56Z
file_id: '20334'
file_name: Mining Crowdsourcing Problems from Discussion Forums of Workers.pdf
file_size: 610246
relation: main_file
success: 1
file_date_updated: 2020-11-10T14:25:56Z
has_accepted_license: '1'
language:
- iso: eng
page: 6264-6276
publication: Proceedings of COLING 2020, the 28th International Conference on Computational
Linguistics
publication_status: accepted
status: public
title: Mining Crowdsourcing Problems from Discussion Forums of Workers
type: conference
user_id: '82920'
year: '2020'
...
---
_id: '20122'
author:
- first_name: Roxanne
full_name: El Baff, Roxanne
last_name: El Baff
- first_name: Khalid
full_name: Al-Khatib, Khalid
last_name: Al-Khatib
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: 'El Baff R, Al-Khatib K, Stein B, Wachsmuth H. Persuasiveness of News Editorials
depending on Ideology and Personality. In: Third Workshop on Computational
Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES
2020). ; 2020:29-40.'
apa: El Baff, R., Al-Khatib, K., Stein, B., & Wachsmuth, H. (2020). Persuasiveness
of News Editorials depending on Ideology and Personality. In Third Workshop
on Computational Modeling of People’s Opinions, Personality, and Emotions in Social
Media (PEOPLES 2020) (pp. 29–40).
bibtex: '@inproceedings{El Baff_Al-Khatib_Stein_Wachsmuth_2020, title={Persuasiveness
of News Editorials depending on Ideology and Personality}, booktitle={Third Workshop
on Computational Modeling of People’s Opinions, Personality, and Emotions in Social
Media (PEOPLES 2020)}, author={El Baff, Roxanne and Al-Khatib, Khalid and Stein,
Benno and Wachsmuth, Henning}, year={2020}, pages={29–40} }'
chicago: El Baff, Roxanne, Khalid Al-Khatib, Benno Stein, and Henning Wachsmuth.
“Persuasiveness of News Editorials Depending on Ideology and Personality.” In
Third Workshop on Computational Modeling of People’s Opinions, Personality,
and Emotions in Social Media (PEOPLES 2020), 29–40, 2020.
ieee: R. El Baff, K. Al-Khatib, B. Stein, and H. Wachsmuth, “Persuasiveness of News
Editorials depending on Ideology and Personality,” in Third Workshop on Computational
Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES
2020), 2020, pp. 29–40.
mla: El Baff, Roxanne, et al. “Persuasiveness of News Editorials Depending on Ideology
and Personality.” Third Workshop on Computational Modeling of People’s Opinions,
Personality, and Emotions in Social Media (PEOPLES 2020), 2020, pp. 29–40.
short: 'R. El Baff, K. Al-Khatib, B. Stein, H. Wachsmuth, in: Third Workshop on
Computational Modeling of People’s Opinions, Personality, and Emotions in Social
Media (PEOPLES 2020), 2020, pp. 29–40.'
date_created: 2020-10-19T08:49:05Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/2020.peoples-1.4.pdf
page: 29-40
publication: Third Workshop on Computational Modeling of People's Opinions, Personality,
and Emotions in Social Media (PEOPLES 2020)
status: public
title: Persuasiveness of News Editorials depending on Ideology and Personality
type: conference
user_id: '82920'
year: '2020'
...
---
_id: '20139'
author:
- first_name: Maximilian
full_name: Spliethöver, Maximilian
id: '84035'
last_name: Spliethöver
orcid: 0000-0003-4364-1409
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: 'Spliethöver M, Wachsmuth H. Argument from Old Man’s View: Assessing Social
Bias in Argumentation. In: Proceedings of the 7th Workshop on Argument Mining
(ArgMining 2020). ; 2020:76-87.'
apa: 'Spliethöver, M., & Wachsmuth, H. (2020). Argument from Old Man’s View:
Assessing Social Bias in Argumentation. In Proceedings of the 7th Workshop
on Argument Mining (ArgMining 2020) (pp. 76–87).'
bibtex: '@inproceedings{Spliethöver_Wachsmuth_2020, title={Argument from Old Man’s
View: Assessing Social Bias in Argumentation}, booktitle={Proceedings of the 7th
Workshop on Argument Mining (ArgMining 2020)}, author={Spliethöver, Maximilian
and Wachsmuth, Henning}, year={2020}, pages={76–87} }'
chicago: 'Spliethöver, Maximilian, and Henning Wachsmuth. “Argument from Old Man’s
View: Assessing Social Bias in Argumentation.” In Proceedings of the 7th Workshop
on Argument Mining (ArgMining 2020), 76–87, 2020.'
ieee: 'M. Spliethöver and H. Wachsmuth, “Argument from Old Man’s View: Assessing
Social Bias in Argumentation,” in Proceedings of the 7th Workshop on Argument
Mining (ArgMining 2020), 2020, pp. 76–87.'
mla: 'Spliethöver, Maximilian, and Henning Wachsmuth. “Argument from Old Man’s View:
Assessing Social Bias in Argumentation.” Proceedings of the 7th Workshop on
Argument Mining (ArgMining 2020), 2020, pp. 76–87.'
short: 'M. Spliethöver, H. Wachsmuth, in: Proceedings of the 7th Workshop on Argument
Mining (ArgMining 2020), 2020, pp. 76–87.'
date_created: 2020-10-20T13:03:08Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.aclweb.org/anthology/2020.argmining-1.9
oa: '1'
page: 76-87
publication: Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)
status: public
title: 'Argument from Old Man''s View: Assessing Social Bias in Argumentation'
type: conference
user_id: '84035'
year: '2020'
...
---
_id: '20140'
author:
- first_name: Jonas
full_name: Dorsch, Jonas
last_name: Dorsch
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: 'Dorsch J, Wachsmuth H. Semi-Supervised Cleansing of Web Argument Corpora.
In: Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020).
; 2020:19-29.'
apa: Dorsch, J., & Wachsmuth, H. (2020). Semi-Supervised Cleansing of Web Argument
Corpora. In Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)
(pp. 19–29).
bibtex: '@inproceedings{Dorsch_Wachsmuth_2020, title={Semi-Supervised Cleansing
of Web Argument Corpora}, booktitle={Proceedings of the 7th Workshop on Argument
Mining (ArgMining 2020)}, author={Dorsch, Jonas and Wachsmuth, Henning}, year={2020},
pages={19–29} }'
chicago: Dorsch, Jonas, and Henning Wachsmuth. “Semi-Supervised Cleansing of Web
Argument Corpora.” In Proceedings of the 7th Workshop on Argument Mining (ArgMining
2020), 19–29, 2020.
ieee: J. Dorsch and H. Wachsmuth, “Semi-Supervised Cleansing of Web Argument Corpora,”
in Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020),
2020, pp. 19–29.
mla: Dorsch, Jonas, and Henning Wachsmuth. “Semi-Supervised Cleansing of Web Argument
Corpora.” Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020),
2020, pp. 19–29.
short: 'J. Dorsch, H. Wachsmuth, in: Proceedings of the 7th Workshop on Argument
Mining (ArgMining 2020), 2020, pp. 19–29.'
date_created: 2020-10-20T13:04:15Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/2020.argmining-1.3.pdf
page: 19-29
publication: Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)
status: public
title: Semi-Supervised Cleansing of Web Argument Corpora
type: conference
user_id: '82920'
year: '2020'
...
---
_id: '20159'
abstract:
- lang: eng
text: "Let G = (V,E) be an undirected graph on n vertices with non-negative capacities
on its edges. The mincut sensitivity problem for the insertion of an edge is defined
as follows. Build a compact data structure for G and a given set S ⊆ V of vertices
that, on receiving any edge (x,y) ∈ S×S of positive capacity as query input, can
efficiently report the set of all pairs from S× S whose mincut value increases
upon insertion of the edge (x,y) to G. The only result that exists for this problem
is for a single pair of vertices (Picard and Queyranne, Mathematical Programming
Study, 13 (1980), 8-16). We present the following results for the single source
and the all-pairs versions of this problem. \r\n1) Single source: Given any designated
source vertex s, there exists a data structure of size \U0001D4AA(|S|) that can
output all those vertices from S whose mincut value to s increases upon insertion
of any given edge. The time taken by the data structure to answer any query is
\U0001D4AA(|S|). \r\n2) All-pairs: There exists an \U0001D4AA(|S|²) size data
structure that can output all those pairs of vertices from S× S whose mincut value
gets increased upon insertion of any given edge. The time taken by the data structure
to answer any query is \U0001D4AA(k), where k is the number of pairs of vertices
whose mincut increases. \r\nFor both these versions, we also address the problem
of reporting the values of the mincuts upon insertion of any given edge. To derive
our results, we use interesting insights into the nearest and the farthest mincuts
for a pair of vertices. In addition, a crucial result, that we establish and use
in our data structures, is that there exists a directed acyclic graph of \U0001D4AA(n)
size that compactly stores the farthest mincuts from all vertices of V to a designated
vertex s in the graph. We believe that this result is of independent interest,
especially, because it also complements a previously existing result by Hariharan
et al. (STOC 2007) that the nearest mincuts from all vertices of V to s is a laminar
family, and hence, can be stored compactly in a tree of \U0001D4AA(n) size."
author:
- first_name: Surender
full_name: Baswana, Surender
last_name: Baswana
- first_name: Shiv
full_name: Gupta, Shiv
last_name: Gupta
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
citation:
ama: 'Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the
Insertion of an Edge. In: Grandoni F, Herman G, Sanders P, eds. 28th Annual
European Symposium on Algorithms (ESA 2020). Vol 173. Leibniz International
Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum
für Informatik; 2020:12:1-12:14. doi:10.4230/LIPIcs.ESA.2020.12'
apa: 'Baswana, S., Gupta, S., & Knollmann, T. (2020). Mincut Sensitivity Data
Structures for the Insertion of an Edge. In F. Grandoni, G. Herman, & P. Sanders
(Eds.), 28th Annual European Symposium on Algorithms (ESA 2020) (Vol. 173,
pp. 12:1-12:14). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.ESA.2020.12'
bibtex: '@inproceedings{Baswana_Gupta_Knollmann_2020, place={Dagstuhl, Germany},
series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Mincut
Sensitivity Data Structures for the Insertion of an Edge}, volume={173}, DOI={10.4230/LIPIcs.ESA.2020.12},
booktitle={28th Annual European Symposium on Algorithms (ESA 2020)}, publisher={Schloss
Dagstuhl -- Leibniz-Zentrum für Informatik}, author={Baswana, Surender and Gupta,
Shiv and Knollmann, Till}, editor={Grandoni, Fabrizio and Herman, Grzegorz and
Sanders, PeterEditors}, year={2020}, pages={12:1-12:14}, collection={Leibniz International
Proceedings in Informatics (LIPIcs)} }'
chicago: 'Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity
Data Structures for the Insertion of an Edge.” In 28th Annual European Symposium
on Algorithms (ESA 2020), edited by Fabrizio Grandoni, Grzegorz Herman, and
Peter Sanders, 173:12:1-12:14. Leibniz International Proceedings in Informatics
(LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik,
2020. https://doi.org/10.4230/LIPIcs.ESA.2020.12.'
ieee: S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures
for the Insertion of an Edge,” in 28th Annual European Symposium on Algorithms
(ESA 2020), 2020, vol. 173, pp. 12:1-12:14.
mla: Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion
of an Edge.” 28th Annual European Symposium on Algorithms (ESA 2020), edited
by Fabrizio Grandoni et al., vol. 173, Schloss Dagstuhl -- Leibniz-Zentrum für
Informatik, 2020, pp. 12:1-12:14, doi:10.4230/LIPIcs.ESA.2020.12.
short: 'S. Baswana, S. Gupta, T. Knollmann, in: F. Grandoni, G. Herman, P. Sanders
(Eds.), 28th Annual European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl
-- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pp. 12:1-12:14.'
date_created: 2020-10-21T12:00:20Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.ESA.2020.12
editor:
- first_name: Fabrizio
full_name: Grandoni, Fabrizio
last_name: Grandoni
- first_name: Grzegorz
full_name: Herman, Grzegorz
last_name: Herman
- first_name: Peter
full_name: Sanders, Peter
last_name: Sanders
intvolume: ' 173'
keyword:
- Mincut
- Sensitivity
- Data Structure
language:
- iso: eng
page: 12:1-12:14
place: Dagstuhl, Germany
publication: 28th Annual European Symposium on Algorithms (ESA 2020)
publication_identifier:
isbn:
- 978-3-95977-162-7
issn:
- 1868-8969
publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Mincut Sensitivity Data Structures for the Insertion of an Edge
type: conference
user_id: '39241'
volume: 173
year: '2020'
...
---
_id: '20166'
author:
- first_name: Alexander
full_name: Bondarenko, Alexander
last_name: Bondarenko
- first_name: Maik
full_name: Fröbe, Maik
last_name: Fröbe
- first_name: Meriem
full_name: Beloucif, Meriem
last_name: Beloucif
- first_name: Lukas
full_name: Gienapp, Lukas
last_name: Gienapp
- first_name: Yamen
full_name: Ajjour, Yamen
last_name: Ajjour
- first_name: Alexander
full_name: Panchenko, Alexander
last_name: Panchenko
- first_name: Chris
full_name: Biemann, Chris
last_name: Biemann
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Martin
full_name: Potthast, Martin
last_name: Potthast
- first_name: Matthias
full_name: Hagen, Matthias
last_name: Hagen
citation:
ama: 'Bondarenko A, Fröbe M, Beloucif M, et al. Overview of Touché 2020: Argument
Retrieval. In: CEUR Workshop Proceedings. Vol 2696. ; 2020:384-395.'
apa: 'Bondarenko, A., Fröbe, M., Beloucif, M., Gienapp, L., Ajjour, Y., Panchenko,
A., … Hagen, M. (2020). Overview of Touché 2020: Argument Retrieval. In CEUR
Workshop Proceedings (Vol. 2696, pp. 384–395).'
bibtex: '@inproceedings{Bondarenko_Fröbe_Beloucif_Gienapp_Ajjour_Panchenko_Biemann_Stein_Wachsmuth_Potthast_et
al._2020, title={Overview of Touché 2020: Argument Retrieval}, volume={2696},
booktitle={CEUR Workshop Proceedings}, author={Bondarenko, Alexander and Fröbe,
Maik and Beloucif, Meriem and Gienapp, Lukas and Ajjour, Yamen and Panchenko,
Alexander and Biemann, Chris and Stein, Benno and Wachsmuth, Henning and Potthast,
Martin and et al.}, year={2020}, pages={384–395} }'
chicago: 'Bondarenko, Alexander, Maik Fröbe, Meriem Beloucif, Lukas Gienapp, Yamen
Ajjour, Alexander Panchenko, Chris Biemann, et al. “Overview of Touché 2020: Argument
Retrieval.” In CEUR Workshop Proceedings, 2696:384–95, 2020.'
ieee: 'A. Bondarenko et al., “Overview of Touché 2020: Argument Retrieval,”
in CEUR Workshop Proceedings, 2020, vol. 2696, pp. 384–395.'
mla: 'Bondarenko, Alexander, et al. “Overview of Touché 2020: Argument Retrieval.”
CEUR Workshop Proceedings, vol. 2696, 2020, pp. 384–95.'
short: 'A. Bondarenko, M. Fröbe, M. Beloucif, L. Gienapp, Y. Ajjour, A. Panchenko,
C. Biemann, B. Stein, H. Wachsmuth, M. Potthast, M. Hagen, in: CEUR Workshop Proceedings,
2020, pp. 384–395.'
date_created: 2020-10-22T07:22:52Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '600'
intvolume: ' 2696'
language:
- iso: eng
main_file_link:
- url: http://ceur-ws.org/Vol-2696/paper_261.pdf
page: 384-395
publication: CEUR Workshop Proceedings
status: public
title: 'Overview of Touché 2020: Argument Retrieval'
type: conference
user_id: '82920'
volume: 2696
year: '2020'
...
---
_id: '20185'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Brief Announcement:
Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots
with Limited Visibility . In: Devismes S, Mittal N, eds. Stabilization, Safety,
and Security of Distributed Systems - 22nd International Symposium, SSS 2020,
Austin, Texas, USA, November 18-21, 2020, Proceedings . Vol 12514. Lecture
Notes in Computer Science (LNCS). Springer; 2020:60-64. doi:10.1007/978-3-030-64348-5_5'
apa: 'Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide,
F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented
& Luminous Robots with Limited Visibility . In S. Devismes & N. Mittal
(Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings
(Vol. 12514, pp. 60–64). Springer. https://doi.org/10.1007/978-3-030-64348-5_5'
bibtex: '@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2020,
series={Lecture Notes in Computer Science (LNCS)}, title={Brief Announcement:
Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots
with Limited Visibility }, volume={12514}, DOI={10.1007/978-3-030-64348-5_5},
booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings },
publisher={Springer}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel
and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes, Stéphane and Mittal,
NeerajEditors}, year={2020}, pages={60–64}, collection={Lecture Notes in Computer
Science (LNCS)} }'
chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm
Meyer auf der Heide. “Brief Announcement: Gathering in Linear Time: A Closed Chain
of Disoriented & Luminous Robots with Limited Visibility .” In Stabilization,
Safety, and Security of Distributed Systems - 22nd International Symposium, SSS
2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphane Devismes
and Neeraj Mittal, 12514:60–64. Lecture Notes in Computer Science (LNCS). Springer,
2020. https://doi.org/10.1007/978-3-030-64348-5_5.'
ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide,
“Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &
Luminous Robots with Limited Visibility ,” in Stabilization, Safety, and Security
of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas,
USA, November 18-21, 2020, Proceedings , 2020, vol. 12514, pp. 60–64.'
mla: 'Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A
Closed Chain of Disoriented & Luminous Robots with Limited Visibility .” Stabilization,
Safety, and Security of Distributed Systems - 22nd International Symposium, SSS
2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphane Devismes
and Neeraj Mittal, vol. 12514, Springer, 2020, pp. 60–64, doi:10.1007/978-3-030-64348-5_5.'
short: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in:
S. Devismes, N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed
Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November
18-21, 2020, Proceedings , Springer, 2020, pp. 60–64.'
date_created: 2020-10-23T08:50:28Z
date_updated: 2022-01-06T06:54:21Z
department:
- _id: '63'
doi: 10.1007/978-3-030-64348-5_5
editor:
- first_name: 'Stéphane '
full_name: 'Devismes, Stéphane '
last_name: Devismes
- first_name: Neeraj
full_name: ' Mittal, Neeraj'
last_name: ' Mittal'
external_id:
arxiv:
- '2010.04424 '
intvolume: ' 12514'
language:
- iso: eng
page: 60-64
publication: 'Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings '
publication_identifier:
isbn:
- 978-3-030-64347-8
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science (LNCS)
status: public
title: 'Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented
& Luminous Robots with Limited Visibility '
type: conference
user_id: '38705'
volume: 12514
year: '2020'
...
---
_id: '20221'
author:
- first_name: Paresh Kishor
full_name: Yeole, Paresh Kishor
last_name: Yeole
citation:
ama: Yeole PK. Plurality Consensus in Hybrid Networks.; 2020.
apa: Yeole, P. K. (2020). Plurality Consensus in Hybrid Networks.
bibtex: '@book{Yeole_2020, title={Plurality Consensus in Hybrid Networks}, author={Yeole,
Paresh Kishor}, year={2020} }'
chicago: Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks, 2020.
ieee: P. K. Yeole, Plurality Consensus in Hybrid Networks. 2020.
mla: Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks. 2020.
short: P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020.
date_created: 2020-10-29T07:45:57Z
date_updated: 2022-01-06T06:54:23Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Plurality Consensus in Hybrid Networks
type: mastersthesis
user_id: '15504'
year: '2020'
...
---
_id: '20274'
author:
- first_name: Eleni
full_name: Bila, Eleni
last_name: Bila
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Bila E, Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Defining
and Verifying Durable Opacity: Correctness for Persistent Software Transactional
Memory. In: Gotsman A, Sokolova A, eds. Formal Techniques for Distributed Objects,
Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE}
2020, Held as Part of the 15th International Federated Conference on Distributed
Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings.
Vol 12136. Lecture Notes in Computer Science. Springer; 2020:39-58. doi:10.1007/978-3-030-50086-3\_3'
apa: 'Bila, E., Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., & Wehrheim,
H. (2020). Defining and Verifying Durable Opacity: Correctness for Persistent
Software Transactional Memory. In A. Gotsman & A. Sokolova (Eds.), Formal
Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG}
6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International
Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta,
Malta, June 15-19, 2020, Proceedings (Vol. 12136, pp. 39–58). Springer. https://doi.org/10.1007/978-3-030-50086-3\_3'
bibtex: '@inproceedings{Bila_Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2020, series={Lecture
Notes in Computer Science}, title={Defining and Verifying Durable Opacity: Correctness
for Persistent Software Transactional Memory}, volume={12136}, DOI={10.1007/978-3-030-50086-3\_3},
booktitle={Formal Techniques for Distributed Objects, Components, and Systems
- 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of
the 15th International Federated Conference on Distributed Computing Techniques,
DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings}, publisher={Springer},
author={Bila, Eleni and Doherty, Simon and Dongol, Brijesh and Derrick, John and
Schellhorn, Gerhard and Wehrheim, Heike}, editor={Gotsman, Alexey and Sokolova,
AnaEditors}, year={2020}, pages={39–58}, collection={Lecture Notes in Computer
Science} }'
chicago: 'Bila, Eleni, Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn,
and Heike Wehrheim. “Defining and Verifying Durable Opacity: Correctness for Persistent
Software Transactional Memory.” In Formal Techniques for Distributed Objects,
Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE}
2020, Held as Part of the 15th International Federated Conference on Distributed
Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings,
edited by Alexey Gotsman and Ana Sokolova, 12136:39–58. Lecture Notes in Computer
Science. Springer, 2020. https://doi.org/10.1007/978-3-030-50086-3\_3.'
ieee: 'E. Bila, S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim,
“Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional
Memory,” in Formal Techniques for Distributed Objects, Components, and Systems
- 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of
the 15th International Federated Conference on Distributed Computing Techniques,
DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings, 2020, vol.
12136, pp. 39–58.'
mla: 'Bila, Eleni, et al. “Defining and Verifying Durable Opacity: Correctness for
Persistent Software Transactional Memory.” Formal Techniques for Distributed
Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference,
{FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed
Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings,
edited by Alexey Gotsman and Ana Sokolova, vol. 12136, Springer, 2020, pp. 39–58,
doi:10.1007/978-3-030-50086-3\_3.'
short: 'E. Bila, S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim,
in: A. Gotsman, A. Sokolova (Eds.), Formal Techniques for Distributed Objects,
Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE}
2020, Held as Part of the 15th International Federated Conference on Distributed
Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings,
Springer, 2020, pp. 39–58.'
date_created: 2020-11-04T08:27:09Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '77'
doi: 10.1007/978-3-030-50086-3\_3
editor:
- first_name: Alexey
full_name: Gotsman, Alexey
last_name: Gotsman
- first_name: Ana
full_name: Sokolova, Ana
last_name: Sokolova
intvolume: ' 12136'
language:
- iso: eng
page: 39-58
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: Formal Techniques for Distributed Objects, Components, and Systems -
40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the
15th International Federated Conference on Distributed Computing Techniques, DisCoTec
2020, Valletta, Malta, June 15-19, 2020, Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Defining and Verifying Durable Opacity: Correctness for Persistent Software
Transactional Memory'
type: conference
user_id: '29719'
volume: 12136
year: '2020'
...