---
_id: '379'
abstract:
- lang: eng
text: In the leasing variant of Set Cover presented by Anthony et al.[1], elements
U arrive over time and must be covered by sets from a familyF of subsets of U.
Each set can be leased for K different periods of time.Let |U| = n and |F| = m.
Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements
for the next lk time steps. The objectiveis to minimize the total cost of the
sets leased, such that elements arrivingat any time t are covered by sets which
contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log
n)-approximation forthe problem in the offline setting, unless P = NP [22]. In
this paper, wegive randomized algorithms for variants of Set Cover Leasing in
the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented
by Alon et al. [2], where elements appear multiple times andmust be covered by
a different set at each arrival. Our results improve theO(log2(mn)) competitive
factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)),
where d is the maximum numberof sets an element belongs to.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Markarian C, Meyer auf der Heide F. Randomized Online Algorithms
for Set Cover Leasing Problems. In: Proceedings of the 8th Annual International
Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ;
2014:25-34. doi:10.1007/978-3-319-12691-3_3'
apa: Abshoff, S., Markarian, C., & Meyer auf der Heide, F. (2014). Randomized
Online Algorithms for Set Cover Leasing Problems. In Proceedings of the 8th
Annual International Conference on Combinatorial Optimization and Applications
(COCOA) (pp. 25–34). https://doi.org/10.1007/978-3-319-12691-3_3
bibtex: '@inproceedings{Abshoff_Markarian_Meyer auf der Heide_2014, series={LNCS},
title={Randomized Online Algorithms for Set Cover Leasing Problems}, DOI={10.1007/978-3-319-12691-3_3},
booktitle={Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Abshoff, Sebastian and Markarian,
Christine and Meyer auf der Heide, Friedhelm}, year={2014}, pages={25–34}, collection={LNCS}
}'
chicago: Abshoff, Sebastian, Christine Markarian, and Friedhelm Meyer auf der Heide.
“Randomized Online Algorithms for Set Cover Leasing Problems.” In Proceedings
of the 8th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 25–34. LNCS, 2014. https://doi.org/10.1007/978-3-319-12691-3_3.
ieee: S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms
for Set Cover Leasing Problems,” in Proceedings of the 8th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp.
25–34.
mla: Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing
Problems.” Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA), 2014, pp. 25–34, doi:10.1007/978-3-319-12691-3_3.
short: 'S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the
8th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 2014, pp. 25–34.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-12691-3_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:12:57Z
date_updated: 2018-03-20T07:12:57Z
file_id: '1395'
file_name: 379-COCOA14.pdf
file_size: 214299
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:12:57Z
has_accepted_license: '1'
page: 25-34
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Randomized Online Algorithms for Set Cover Leasing Problems
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '380'
abstract:
- lang: eng
text: 'Network creation games model the creation and usage costs of networks formed
by n selfish nodes. Each node v can buy a set of edges, each for a fixed price
α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant
et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances
from v to all other nodes plus the prices of the bought edges. The above papers
show the existence of Nash equilibria as well as upper and lower bounds for the
prices of anarchy and stability. In several subsequent papers, these bounds were
improved for a wide range of prices α. In this paper, we extend these models by
incorporating quality-of-service aspects: Each edge cannot only be bought at a
fixed quality (edge length one) for a fixed price α. Instead, we assume that quality
levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series
= {LNCS}'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network
Creation Games. In: Proceedings of the 10th International Conference on Web
and Internet Economics (WINE). ; 2014:423-428. doi:10.1007/978-3-319-13129-0_34'
apa: Cord-Landwehr, A., Mäcker, A., & Meyer auf der Heide, F. (2014). Quality
of Service in Network Creation Games. In Proceedings of the 10th International
Conference on Web and Internet Economics (WINE) (pp. 423–428). https://doi.org/10.1007/978-3-319-13129-0_34
bibtex: '@inproceedings{Cord-Landwehr_Mäcker_Meyer auf der Heide_2014, title={Quality
of Service in Network Creation Games}, DOI={10.1007/978-3-319-13129-0_34},
booktitle={Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)}, author={Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer
auf der Heide, Friedhelm}, year={2014}, pages={423–428} }'
chicago: Cord-Landwehr, Andreas, Alexander Mäcker, and Friedhelm Meyer auf der Heide.
“Quality of Service in Network Creation Games.” In Proceedings of the 10th
International Conference on Web and Internet Economics (WINE), 423–28, 2014.
https://doi.org/10.1007/978-3-319-13129-0_34.
ieee: A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service
in Network Creation Games,” in Proceedings of the 10th International Conference
on Web and Internet Economics (WINE), 2014, pp. 423–428.
mla: Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.”
Proceedings of the 10th International Conference on Web and Internet Economics
(WINE), 2014, pp. 423–28, doi:10.1007/978-3-319-13129-0_34.
short: 'A. Cord-Landwehr, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of
the 10th International Conference on Web and Internet Economics (WINE), 2014,
pp. 423–428.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-13129-0_34
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:05:59Z
date_updated: 2018-03-20T07:05:59Z
file_id: '1394'
file_name: 380-WINE2014.pdf
file_size: 166640
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:05:59Z
has_accepted_license: '1'
page: 423-428
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)
status: public
title: Quality of Service in Network Creation Games
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '3805'
author:
- first_name: Frank
full_name: Brüseke, Frank
last_name: Brüseke
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Gregor
full_name: Engels, Gregor
last_name: Engels
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
citation:
ama: 'Brüseke F, Wachsmuth H, Engels G, Becker S. PBlaman: performance blame analysis
based on Palladio contracts. In: Proceedings of the 4th International Symposium
on Autonomous Minirobots for Research and Edutainment. ; 2014:1975-2004.'
apa: 'Brüseke, F., Wachsmuth, H., Engels, G., & Becker, S. (2014). PBlaman:
performance blame analysis based on Palladio contracts. In Proceedings of the
4th International Symposium on Autonomous Minirobots for Research and Edutainment
(pp. 1975–2004).'
bibtex: '@inproceedings{Brüseke_Wachsmuth_Engels_Becker_2014, title={PBlaman: performance
blame analysis based on Palladio contracts}, number={12}, booktitle={Proceedings
of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment},
author={Brüseke, Frank and Wachsmuth, Henning and Engels, Gregor and Becker, Steffen},
year={2014}, pages={1975–2004} }'
chicago: 'Brüseke, Frank, Henning Wachsmuth, Gregor Engels, and Steffen Becker.
“PBlaman: Performance Blame Analysis Based on Palladio Contracts.” In Proceedings
of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment,
1975–2004, 2014.'
ieee: 'F. Brüseke, H. Wachsmuth, G. Engels, and S. Becker, “PBlaman: performance
blame analysis based on Palladio contracts,” in Proceedings of the 4th International
Symposium on Autonomous Minirobots for Research and Edutainment, 2014, no.
12, pp. 1975–2004.'
mla: 'Brüseke, Frank, et al. “PBlaman: Performance Blame Analysis Based on Palladio
Contracts.” Proceedings of the 4th International Symposium on Autonomous Minirobots
for Research and Edutainment, no. 12, 2014, pp. 1975–2004.'
short: 'F. Brüseke, H. Wachsmuth, G. Engels, S. Becker, in: Proceedings of the 4th
International Symposium on Autonomous Minirobots for Research and Edutainment,
2014, pp. 1975–2004.'
date_created: 2018-08-02T13:38:28Z
date_updated: 2022-01-06T06:59:36Z
department:
- _id: '600'
issue: '12'
language:
- iso: eng
page: 1975-2004
publication: Proceedings of the 4th International Symposium on Autonomous Minirobots
for Research and Edutainment
status: public
title: 'PBlaman: performance blame analysis based on Palladio contracts'
type: conference
user_id: '82920'
year: '2014'
...
---
_id: '382'
abstract:
- lang: eng
text: This paper explores how cloud provider competition influences instance pricing
in an IaaS (Infrastructure-as-a-Service) market. When reserved instance pricing
includes an on-demand price component in addition to a reservation fee (two-part
tariffs), different providers might offer different price combinations, where
the client’s choice depends on its load profile. We investigate a duopoly of providers
and analyze stable market prices in two-part tariffs. Further, we study offers
that allow a specified amount of included usage (three-part tariffs). Neither two-part
nor three-part tariffs produce an equilibrium market outcome other than a service
pricing that equals production cost, i.e., complex price structures do not significantly
affect the results from ordinary Bertrand competition.
author:
- first_name: Jörn
full_name: Künsemöller, Jörn
last_name: Künsemöller
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
citation:
ama: 'Künsemöller J, Brangewitz S, Karl H, Haake C-J. Provider Competition in Infrastructure-as-a-Service.
In: Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC). ; 2014:203-210. doi:10.1109/SCC.2014.35'
apa: Künsemöller, J., Brangewitz, S., Karl, H., & Haake, C.-J. (2014). Provider
Competition in Infrastructure-as-a-Service. In Proceedings of the 2014 IEEE
International Conference on Services Computing (SCC) (pp. 203–210). https://doi.org/10.1109/SCC.2014.35
bibtex: '@inproceedings{Künsemöller_Brangewitz_Karl_Haake_2014, title={Provider
Competition in Infrastructure-as-a-Service}, DOI={10.1109/SCC.2014.35},
booktitle={Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC)}, author={Künsemöller, Jörn and Brangewitz, Sonja and Karl, Holger and Haake,
Claus-Jochen}, year={2014}, pages={203–210} }'
chicago: Künsemöller, Jörn, Sonja Brangewitz, Holger Karl, and Claus-Jochen Haake.
“Provider Competition in Infrastructure-as-a-Service.” In Proceedings of the
2014 IEEE International Conference on Services Computing (SCC), 203–10, 2014.
https://doi.org/10.1109/SCC.2014.35.
ieee: J. Künsemöller, S. Brangewitz, H. Karl, and C.-J. Haake, “Provider Competition
in Infrastructure-as-a-Service,” in Proceedings of the 2014 IEEE International
Conference on Services Computing (SCC), 2014, pp. 203–210.
mla: Künsemöller, Jörn, et al. “Provider Competition in Infrastructure-as-a-Service.”
Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC), 2014, pp. 203–10, doi:10.1109/SCC.2014.35.
short: 'J. Künsemöller, S. Brangewitz, H. Karl, C.-J. Haake, in: Proceedings of
the 2014 IEEE International Conference on Services Computing (SCC), 2014, pp.
203–210.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:37Z
ddc:
- '004'
department:
- _id: '75'
- _id: '205'
doi: 10.1109/SCC.2014.35
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:34:46Z
date_updated: 2018-11-02T13:34:46Z
file_id: '5250'
file_name: 06930535.pdf
file_size: 228172
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:34:46Z
has_accepted_license: '1'
language:
- iso: eng
page: 203-210
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC)
status: public
title: Provider Competition in Infrastructure-as-a-Service
type: conference
user_id: '477'
year: '2014'
...
---
_id: '383'
abstract:
- lang: eng
text: Proof-carrying code approaches aim at safe execution of untrusted code by
having the code producer attach a safety proof to the code which the code consumer
only has to validate. Depending on the type of safety property, proofs can however
become quite large and their validation - though faster than their construction
- still time consuming. In this paper we introduce a new concept for safe execution
of untrusted code. It keeps the idea of putting the time consuming part of proving
on the side of the code producer, however, attaches no proofs to code anymore
but instead uses the proof to transform the program into an equivalent but more
efficiently verifiable program. Code consumers thus still do proving themselves,
however, on a computationally inexpensive level only. Experimental results show
that the proof effort can be reduced by several orders of magnitude, both with
respect to time and space.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs -- Approach and Applications.
In: Proceedings of the Software Engineering Conference (SE). Lecture Notes
in Informatics (LNI). ; 2014:67-68.'
apa: Wonisch, D., Schremmer, A., & Wehrheim, H. (2014). Programs from Proofs
-- Approach and Applications. In Proceedings of the Software Engineering Conference
(SE) (pp. 67–68).
bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2014, series={Lecture Notes in
Informatics (LNI)}, title={Programs from Proofs -- Approach and Applications},
booktitle={Proceedings of the Software Engineering Conference (SE)}, author={Wonisch,
Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2014}, pages={67–68},
collection={Lecture Notes in Informatics (LNI)} }'
chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from
Proofs -- Approach and Applications.” In Proceedings of the Software Engineering
Conference (SE), 67–68. Lecture Notes in Informatics (LNI), 2014.
ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs -- Approach
and Applications,” in Proceedings of the Software Engineering Conference (SE),
2014, pp. 67–68.
mla: Wonisch, Daniel, et al. “Programs from Proofs -- Approach and Applications.”
Proceedings of the Software Engineering Conference (SE), 2014, pp. 67–68.
short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the Software Engineering
Conference (SE), 2014, pp. 67–68.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:38Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:04:52Z
date_updated: 2018-03-20T07:04:52Z
file_id: '1392'
file_name: 383-programmsFromProofsSE.pdf
file_size: 66474
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:04:52Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://eprints.uni-kiel.de/23752/
page: 67-68
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the Software Engineering Conference (SE)
series_title: Lecture Notes in Informatics (LNI)
status: public
title: Programs from Proofs -- Approach and Applications
type: conference
user_id: '477'
year: '2014'
...
---
_id: '387'
abstract:
- lang: eng
text: This article studies the design of medium access control (MAC) protocols for
wireless networks that are provably robust against arbitrary and unpredictable
disruptions (e.g., due to unintentional external interference from co-existing
networks or due to jamming). We consider a wireless network consisting of a set
of n honest and reliable nodes within transmission (and interference) range of
each other, and we model the external disruptions with a powerful adaptive adversary.
This adversary may know the protocol and its entire history and can use this knowledge
to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction
of the timesteps, for an arbitrary constant > 0 unknown to the nodes. The nodes
cannot distinguish between the adversarial jamming or a collision of two or more
messages that are sent at the same time. We demonstrate, for the first time, that
there is a local-control MAC protocol requiring only very limited knowledge about
the adversary and the network that achieves a constant (asymptotically optimal)
throughput for the nonjammed time periods under any of the aforementioned adversarial
strategies. The derived principles are also useful to build robust applications
on top of the MAC layer, and we present an exemplary study for leader election,
one of the most fundamental tasks in distributed computing.
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: Awerbuch B, Richa AW, Scheideler C, Schmid S, Zhang J. Principles of Robust
Medium Access and an Application to Leader Election. Transactions on Algorithms.
2014;(4). doi:10.1145/2635818
apa: Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2014).
Principles of Robust Medium Access and an Application to Leader Election. Transactions
on Algorithms, (4). https://doi.org/10.1145/2635818
bibtex: '@article{Awerbuch_Richa_Scheideler_Schmid_Zhang_2014, title={Principles
of Robust Medium Access and an Application to Leader Election}, DOI={10.1145/2635818},
number={4}, journal={Transactions on Algorithms}, publisher={ACM}, author={Awerbuch,
Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang,
Jin}, year={2014} }'
chicago: Awerbuch, Baruch, Andrea W. Richa, Christian Scheideler, Stefan Schmid,
and Jin Zhang. “Principles of Robust Medium Access and an Application to Leader
Election.” Transactions on Algorithms, no. 4 (2014). https://doi.org/10.1145/2635818.
ieee: B. Awerbuch, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Principles
of Robust Medium Access and an Application to Leader Election,” Transactions
on Algorithms, no. 4, 2014.
mla: Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application
to Leader Election.” Transactions on Algorithms, no. 4, ACM, 2014, doi:10.1145/2635818.
short: B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions
on Algorithms (2014).
date_created: 2017-10-17T12:42:07Z
date_updated: 2022-01-06T06:59:47Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2635818
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:02:33Z
date_updated: 2018-03-20T07:02:33Z
file_id: '1388'
file_name: 387-a24-awerbuch_2_.pdf
file_size: 521454
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:02:33Z
has_accepted_license: '1'
issue: '4'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Transactions on Algorithms
publisher: ACM
status: public
title: Principles of Robust Medium Access and an Application to Leader Election
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '3877'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Martin
full_name: Trenkmann, Martin
last_name: Trenkmann
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
- first_name: Gregor
full_name: Engels, Gregor
last_name: Engels
citation:
ama: 'Wachsmuth H, Trenkmann M, Stein B, Engels G. Modeling Review Argumentation
for Robust Sentiment Analysis. In: Proceedings of COLING 2014, the 25th International
Conference on Computational Linguistics: Technical Papers. ; 2014:553-564.'
apa: 'Wachsmuth, H., Trenkmann, M., Stein, B., & Engels, G. (2014). Modeling
Review Argumentation for Robust Sentiment Analysis. In Proceedings of COLING
2014, the 25th International Conference on Computational Linguistics: Technical
Papers (pp. 553–564).'
bibtex: '@inproceedings{Wachsmuth_Trenkmann_Stein_Engels_2014, title={Modeling Review
Argumentation for Robust Sentiment Analysis}, booktitle={Proceedings of COLING
2014, the 25th International Conference on Computational Linguistics: Technical
Papers}, author={Wachsmuth, Henning and Trenkmann, Martin and Stein, Benno and
Engels, Gregor}, year={2014}, pages={553–564} }'
chicago: 'Wachsmuth, Henning, Martin Trenkmann, Benno Stein, and Gregor Engels.
“Modeling Review Argumentation for Robust Sentiment Analysis.” In Proceedings
of COLING 2014, the 25th International Conference on Computational Linguistics:
Technical Papers, 553–64, 2014.'
ieee: 'H. Wachsmuth, M. Trenkmann, B. Stein, and G. Engels, “Modeling Review Argumentation
for Robust Sentiment Analysis,” in Proceedings of COLING 2014, the 25th International
Conference on Computational Linguistics: Technical Papers, 2014, pp. 553–564.'
mla: 'Wachsmuth, Henning, et al. “Modeling Review Argumentation for Robust Sentiment
Analysis.” Proceedings of COLING 2014, the 25th International Conference on
Computational Linguistics: Technical Papers, 2014, pp. 553–64.'
short: 'H. Wachsmuth, M. Trenkmann, B. Stein, G. Engels, in: Proceedings of COLING
2014, the 25th International Conference on Computational Linguistics: Technical
Papers, 2014, pp. 553–564.'
date_created: 2018-08-11T16:13:24Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/C14-1053.pdf
page: 553-564
publication: 'Proceedings of COLING 2014, the 25th International Conference on Computational
Linguistics: Technical Papers'
status: public
title: Modeling Review Argumentation for Robust Sentiment Analysis
type: conference
user_id: '82920'
year: '2014'
...
---
_id: '3890'
abstract:
- lang: eng
text: "The incidenceofthin-film-guided, in-planeunguidedwavesatobliqueanglesonstraightdiscontinuities
of dielectricslabwaveguides,anearlyproblemofintegratedoptics,isbeingre-considered.The3-D
frequencydomainMaxwellequationsreducetoaparametrizedinhomogeneousvectorialproblemona\r\n2-D
computationaldomain,withtransparent-influx boundaryconditions.Weproposearigorousvec-\r\ntorial
solverbasedonsimultaneousexpansionsintopolarizedlocalslabeigenmodesalongthetwo\r\northogonal
crosssectioncoordinates(quadridirectionaleigenmodepropagationQUEP).Thequasi-ana-\r\nlytical
schemeisapplicabletoconfigurations with — in principle — arbitrary crosssectiongeometries.\r\nExamples
forahigh-contrastfacetofanasymmetricslabwaveguide,forthelateralexcitationofa\r\nchannel
waveguide,andforastepdiscontinuitybetweenslabwaveguidesofdifferentthicknessesare\r\ndiscussed."
article_type: original
author:
- first_name: Manfred
full_name: Hammer, Manfred
id: '48077'
last_name: Hammer
orcid: 0000-0002-6331-9348
citation:
ama: 'Hammer M. Oblique incidence of semi-guided waves on rectangular slab waveguide
discontinuities: A vectorial QUEP solver. Optics Communications. 2014;338:447-456.
doi:10.1016/j.optcom.2014.09.087'
apa: 'Hammer, M. (2014). Oblique incidence of semi-guided waves on rectangular slab
waveguide discontinuities: A vectorial QUEP solver. Optics Communications,
338, 447–456. https://doi.org/10.1016/j.optcom.2014.09.087'
bibtex: '@article{Hammer_2014, title={Oblique incidence of semi-guided waves on
rectangular slab waveguide discontinuities: A vectorial QUEP solver}, volume={338},
DOI={10.1016/j.optcom.2014.09.087},
journal={Optics Communications}, publisher={Elsevier BV}, author={Hammer, Manfred},
year={2014}, pages={447–456} }'
chicago: 'Hammer, Manfred. “Oblique Incidence of Semi-Guided Waves on Rectangular
Slab Waveguide Discontinuities: A Vectorial QUEP Solver.” Optics Communications
338 (2014): 447–56. https://doi.org/10.1016/j.optcom.2014.09.087.'
ieee: 'M. Hammer, “Oblique incidence of semi-guided waves on rectangular slab waveguide
discontinuities: A vectorial QUEP solver,” Optics Communications, vol.
338, pp. 447–456, 2014.'
mla: 'Hammer, Manfred. “Oblique Incidence of Semi-Guided Waves on Rectangular Slab
Waveguide Discontinuities: A Vectorial QUEP Solver.” Optics Communications,
vol. 338, Elsevier BV, 2014, pp. 447–56, doi:10.1016/j.optcom.2014.09.087.'
short: M. Hammer, Optics Communications 338 (2014) 447–456.
date_created: 2018-08-13T09:28:01Z
date_updated: 2022-01-06T06:59:50Z
ddc:
- '530'
department:
- _id: '61'
doi: 10.1016/j.optcom.2014.09.087
file:
- access_level: closed
content_type: application/pdf
creator: hclaudia
date_created: 2018-08-13T09:29:14Z
date_updated: 2018-08-13T09:29:14Z
file_id: '3891'
file_name: 2015 Hammer_Oblique incidence of semi-guided waves on rectangular slab
waveguide discontinuities_A vectorial QUEP solver_Optics communications.pdf
file_size: 1872449
relation: main_file
success: 1
file_date_updated: 2018-08-13T09:29:14Z
has_accepted_license: '1'
intvolume: ' 338'
keyword:
- tet_topic_waveguide
- tet_topic_numerics
language:
- iso: eng
page: 447-456
publication: Optics Communications
publication_identifier:
issn:
- 0030-4018
publication_status: published
publisher: Elsevier BV
status: public
title: 'Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities:
A vectorial QUEP solver'
type: journal_article
user_id: '55706'
volume: 338
year: '2014'
...
---
_id: '390'
abstract:
- lang: eng
text: 'In software markets of the future, customer-specific software will be developed
on demand based on distributed software and hardware services. Based on a customer-specific
request, available service offers have to be discovered and composed into sophisticated
IT services that fulfill the customer''s request.A prerequisite of this vision
are rich service descriptions, which comprise structural as well as behavioral
aspects of the services, otherwise an accurate service discovery and composition
is not possible. However, automatic matching of service requests and offers specified
in rich service descriptions for the purpose of service discovery is a complex
task, due to the multifaceted heterogeneity of the service partners. This heterogeneity
includes the use of different specification languages, different underlying ontologies,
or different levels of granularity in the specification itself.In this article,
we present a comprehensive approach for service discovery and composition, which
overcomes the underlying heterogeneity of the service partners. Based on a realistic
case study of our industrial partner from the e-tourism domain, we first introduce
an automatic matching mechanism for service requests and offers specified in a
rich service description language. In addition, we propose an automatic service
composition approach, which determines possible service compositions by composing
the service protocols through a composition strategy based on labeled transition
systems. '
author:
- first_name: Zille
full_name: Huma, Zille
last_name: Huma
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Huma Z, Gerth C, Engels G. On-the-Fly Computing: Automatic Service Discovery
and Composition in Heterogeneous Domains. Computer Science - Research and Development.
2014;(3-4):333-361. doi:10.1007/s00450-014-0254-z'
apa: 'Huma, Z., Gerth, C., & Engels, G. (2014). On-the-Fly Computing: Automatic
Service Discovery and Composition in Heterogeneous Domains. Computer Science
- Research and Development, (3–4), 333–361. https://doi.org/10.1007/s00450-014-0254-z'
bibtex: '@article{Huma_Gerth_Engels_2014, title={On-the-Fly Computing: Automatic
Service Discovery and Composition in Heterogeneous Domains}, DOI={10.1007/s00450-014-0254-z},
number={3–4}, journal={Computer Science - Research and Development}, publisher={Springer},
author={Huma, Zille and Gerth, Christian and Engels, Gregor}, year={2014}, pages={333–361}
}'
chicago: 'Huma, Zille, Christian Gerth, and Gregor Engels. “On-the-Fly Computing:
Automatic Service Discovery and Composition in Heterogeneous Domains.” Computer
Science - Research and Development, no. 3–4 (2014): 333–61. https://doi.org/10.1007/s00450-014-0254-z.'
ieee: 'Z. Huma, C. Gerth, and G. Engels, “On-the-Fly Computing: Automatic Service
Discovery and Composition in Heterogeneous Domains,” Computer Science - Research
and Development, no. 3–4, pp. 333–361, 2014.'
mla: 'Huma, Zille, et al. “On-the-Fly Computing: Automatic Service Discovery and
Composition in Heterogeneous Domains.” Computer Science - Research and Development,
no. 3–4, Springer, 2014, pp. 333–61, doi:10.1007/s00450-014-0254-z.'
short: Z. Huma, C. Gerth, G. Engels, Computer Science - Research and Development
(2014) 333–361.
date_created: 2017-10-17T12:42:08Z
date_updated: 2022-01-06T06:59:52Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1007/s00450-014-0254-z
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:00:58Z
date_updated: 2018-03-20T07:00:58Z
file_id: '1385'
file_name: 390-HGE14.pdf
file_size: 4644980
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:00:58Z
has_accepted_license: '1'
issue: 3-4
language:
- iso: eng
page: 333-361
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Computer Science - Research and Development
publisher: Springer
status: public
title: 'On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous
Domains'
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '3905'
author:
- first_name: Chamsi
full_name: Abu Quba Rana, Chamsi
last_name: Abu Quba Rana
- first_name: Salima
full_name: Hassas, Salima
last_name: Hassas
- first_name: Fayyad
full_name: Usama, Fayyad
last_name: Usama
- first_name: Milad
full_name: Alshomary, Milad
id: '73059'
last_name: Alshomary
- first_name: Christine
full_name: Gertosio, Christine
last_name: Gertosio
citation:
ama: 'Abu Quba Rana C, Hassas S, Usama F, Alshomary M, Gertosio C. iSoNTRE: The
Social Network Transformer into Recommendation Engine. 2014 IEEE/ACS 11th International
Conference on Computer Systems and Applications (AICCSA). 2014:169-175.'
apa: 'Abu Quba Rana, C., Hassas, S., Usama, F., Alshomary, M., & Gertosio, C.
(2014). iSoNTRE: The Social Network Transformer into Recommendation Engine. 2014
IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA),
169–175.'
bibtex: '@article{Abu Quba Rana_Hassas_Usama_Alshomary_Gertosio_2014, title={iSoNTRE:
The Social Network Transformer into Recommendation Engine}, journal={2014 IEEE/ACS
11th International Conference on Computer Systems and Applications (AICCSA)},
author={Abu Quba Rana, Chamsi and Hassas, Salima and Usama, Fayyad and Alshomary,
Milad and Gertosio, Christine}, year={2014}, pages={169–175} }'
chicago: 'Abu Quba Rana, Chamsi, Salima Hassas, Fayyad Usama, Milad Alshomary, and
Christine Gertosio. “ISoNTRE: The Social Network Transformer into Recommendation
Engine.” 2014 IEEE/ACS 11th International Conference on Computer Systems and
Applications (AICCSA), 2014, 169–75.'
ieee: 'C. Abu Quba Rana, S. Hassas, F. Usama, M. Alshomary, and C. Gertosio, “iSoNTRE:
The Social Network Transformer into Recommendation Engine,” 2014 IEEE/ACS 11th
International Conference on Computer Systems and Applications (AICCSA), pp.
169–175, 2014.'
mla: 'Abu Quba Rana, Chamsi, et al. “ISoNTRE: The Social Network Transformer into
Recommendation Engine.” 2014 IEEE/ACS 11th International Conference on Computer
Systems and Applications (AICCSA), 2014, pp. 169–75.'
short: C. Abu Quba Rana, S. Hassas, F. Usama, M. Alshomary, C. Gertosio, 2014 IEEE/ACS
11th International Conference on Computer Systems and Applications (AICCSA) (2014)
169–175.
date_created: 2018-08-14T13:35:39Z
date_updated: 2022-01-06T06:59:54Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/7073195
page: 169-175
publication: 2014 IEEE/ACS 11th International Conference on Computer Systems and Applications
(AICCSA)
status: public
title: 'iSoNTRE: The Social Network Transformer into Recommendation Engine'
type: journal_article
user_id: '73059'
year: '2014'
...
---
_id: '2900'
author:
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
citation:
ama: Brauer S. A Probabilistic Expectation Maximization Algorithm for Multivariate
Laplacian Mixtures.; 2014.
apa: Brauer, S. (2014). A Probabilistic Expectation Maximization Algorithm for
Multivariate Laplacian Mixtures.
bibtex: '@book{Brauer_2014, title={A Probabilistic Expectation Maximization Algorithm
for Multivariate Laplacian Mixtures}, author={Brauer, Sascha}, year={2014} }'
chicago: Brauer, Sascha. A Probabilistic Expectation Maximization Algorithm for
Multivariate Laplacian Mixtures, 2014.
ieee: S. Brauer, A Probabilistic Expectation Maximization Algorithm for Multivariate
Laplacian Mixtures. 2014.
mla: Brauer, Sascha. A Probabilistic Expectation Maximization Algorithm for Multivariate
Laplacian Mixtures. 2014.
short: S. Brauer, A Probabilistic Expectation Maximization Algorithm for Multivariate
Laplacian Mixtures, 2014.
date_created: 2018-05-25T09:45:38Z
date_updated: 2022-01-06T06:58:44Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-05-25T09:45:33Z
date_updated: 2018-05-25T09:45:33Z
file_id: '2901'
file_name: 2014_Brauer_AProbabilisticExpectationMaximizationAlgorithmForMultivariateLaplacianMixtures.pdf
file_size: 971935
relation: main_file
success: 1
file_date_updated: 2018-05-25T09:45:33Z
has_accepted_license: '1'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian
Mixtures
type: mastersthesis
user_id: '25078'
year: '2014'
...
---
_id: '2976'
author:
- first_name: Marcel Rudolf
full_name: Ackermann, Marcel Rudolf
last_name: Ackermann
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Daniel
full_name: Kuntze, Daniel
last_name: Kuntze
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: Ackermann MR, Blömer J, Kuntze D, Sohler C. Analysis of Agglomerative Clustering.
Algorithmica. 2014;69. doi:10.1007/s00453-012-9717-4
apa: Ackermann, M. R., Blömer, J., Kuntze, D., & Sohler, C. (2014). Analysis
of Agglomerative Clustering. Algorithmica, 69. https://doi.org/10.1007/s00453-012-9717-4
bibtex: '@article{Ackermann_Blömer_Kuntze_Sohler_2014, title={Analysis of Agglomerative
Clustering}, volume={69}, DOI={10.1007/s00453-012-9717-4},
journal={Algorithmica}, publisher={Springer US}, author={Ackermann, Marcel Rudolf
and Blömer, Johannes and Kuntze, Daniel and Sohler, Christian}, year={2014} }'
chicago: Ackermann, Marcel Rudolf, Johannes Blömer, Daniel Kuntze, and Christian
Sohler. “Analysis of Agglomerative Clustering.” Algorithmica 69 (2014).
https://doi.org/10.1007/s00453-012-9717-4.
ieee: M. R. Ackermann, J. Blömer, D. Kuntze, and C. Sohler, “Analysis of Agglomerative
Clustering,” Algorithmica, vol. 69, 2014.
mla: Ackermann, Marcel Rudolf, et al. “Analysis of Agglomerative Clustering.” Algorithmica,
vol. 69, Springer US, 2014, doi:10.1007/s00453-012-9717-4.
short: M.R. Ackermann, J. Blömer, D. Kuntze, C. Sohler, Algorithmica 69 (2014).
date_created: 2018-06-05T07:28:52Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
doi: 10.1007/s00453-012-9717-4
intvolume: ' 69'
publication: Algorithmica
publication_identifier:
eissn:
- 0178-4617
publication_status: published
publisher: Springer US
status: public
title: Analysis of Agglomerative Clustering
type: journal_article
user_id: '25078'
volume: 69
year: '2014'
...
---
_id: '2977'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Kathrin
full_name: Bujna, Kathrin
last_name: Bujna
- first_name: Daniel
full_name: Kuntze, Daniel
last_name: Kuntze
citation:
ama: 'Blömer J, Bujna K, Kuntze D. A Theoretical and Experimental Comparison of
the EM and SEM Algorithm. In: 2014 22nd International Conference on Pattern
Recognition. IEEE; 2014. doi:10.1109/icpr.2014.253'
apa: Blömer, J., Bujna, K., & Kuntze, D. (2014). A Theoretical and Experimental
Comparison of the EM and SEM Algorithm. In 2014 22nd International Conference
on Pattern Recognition. IEEE. https://doi.org/10.1109/icpr.2014.253
bibtex: '@inproceedings{Blömer_Bujna_Kuntze_2014, title={A Theoretical and Experimental
Comparison of the EM and SEM Algorithm}, DOI={10.1109/icpr.2014.253},
booktitle={2014 22nd International Conference on Pattern Recognition}, publisher={IEEE},
author={Blömer, Johannes and Bujna, Kathrin and Kuntze, Daniel}, year={2014} }'
chicago: Blömer, Johannes, Kathrin Bujna, and Daniel Kuntze. “A Theoretical and
Experimental Comparison of the EM and SEM Algorithm.” In 2014 22nd International
Conference on Pattern Recognition. IEEE, 2014. https://doi.org/10.1109/icpr.2014.253.
ieee: J. Blömer, K. Bujna, and D. Kuntze, “A Theoretical and Experimental Comparison
of the EM and SEM Algorithm,” in 2014 22nd International Conference on Pattern
Recognition, 2014.
mla: Blömer, Johannes, et al. “A Theoretical and Experimental Comparison of the
EM and SEM Algorithm.” 2014 22nd International Conference on Pattern Recognition,
IEEE, 2014, doi:10.1109/icpr.2014.253.
short: 'J. Blömer, K. Bujna, D. Kuntze, in: 2014 22nd International Conference on
Pattern Recognition, IEEE, 2014.'
date_created: 2018-06-05T07:29:15Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
doi: 10.1109/icpr.2014.253
publication: 2014 22nd International Conference on Pattern Recognition
publication_identifier:
isbn:
- '9781479952090'
publication_status: published
publisher: IEEE
status: public
title: A Theoretical and Experimental Comparison of the EM and SEM Algorithm
type: conference
user_id: '25078'
year: '2014'
...
---
_id: '3127'
author:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
citation:
ama: Jager T. Die Zukunft der Kryptographie. Datenschutz und Datensicherheit.
2014;(7):445--451. doi:10.1007/s11623-014-0204-8
apa: Jager, T. (2014). Die Zukunft der Kryptographie. Datenschutz Und Datensicherheit,
(7), 445--451. https://doi.org/10.1007/s11623-014-0204-8
bibtex: '@article{Jager_2014, title={Die Zukunft der Kryptographie}, DOI={10.1007/s11623-014-0204-8},
number={7}, journal={Datenschutz und Datensicherheit}, author={Jager, Tibor},
year={2014}, pages={445--451} }'
chicago: 'Jager, Tibor. “Die Zukunft Der Kryptographie.” Datenschutz Und Datensicherheit,
no. 7 (2014): 445--451. https://doi.org/10.1007/s11623-014-0204-8.'
ieee: T. Jager, “Die Zukunft der Kryptographie,” Datenschutz und Datensicherheit,
no. 7, pp. 445--451, 2014.
mla: Jager, Tibor. “Die Zukunft Der Kryptographie.” Datenschutz Und Datensicherheit,
no. 7, 2014, pp. 445--451, doi:10.1007/s11623-014-0204-8.
short: T. Jager, Datenschutz Und Datensicherheit (2014) 445--451.
date_created: 2018-06-07T09:21:18Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/s11623-014-0204-8
extern: '1'
issue: '7'
page: 445--451
publication: Datenschutz und Datensicherheit
status: public
title: Die Zukunft der Kryptographie
type: journal_article
user_id: '38235'
year: '2014'
...
---
_id: '3128'
author:
- first_name: Nils
full_name: Fleischhacker, Nils
last_name: Fleischhacker
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Dominique
full_name: Schröder, Dominique
last_name: Schröder
citation:
ama: 'Fleischhacker N, Jager T, Schröder D. On Tight Security Proofs for Schnorr
Signatures. In: Advances in Cryptology - ASIACRYPT 2014 - 20th International
Conference on the Theory and Application of Cryptology and Information Security,
Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I. ; 2014:512--531.
doi:10.1007/978-3-662-45611-8_27'
apa: Fleischhacker, N., Jager, T., & Schröder, D. (2014). On Tight Security
Proofs for Schnorr Signatures. In Advances in Cryptology - ASIACRYPT 2014 -
20th International Conference on the Theory and Application of Cryptology and
Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings,
Part I (pp. 512--531). https://doi.org/10.1007/978-3-662-45611-8_27
bibtex: '@inproceedings{Fleischhacker_Jager_Schröder_2014, title={On Tight Security
Proofs for Schnorr Signatures}, DOI={10.1007/978-3-662-45611-8_27},
booktitle={Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference
on the Theory and Application of Cryptology and Information Security, Kaoshiung,
Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I}, author={Fleischhacker,
Nils and Jager, Tibor and Schröder, Dominique}, year={2014}, pages={512--531}
}'
chicago: Fleischhacker, Nils, Tibor Jager, and Dominique Schröder. “On Tight Security
Proofs for Schnorr Signatures.” In Advances in Cryptology - ASIACRYPT 2014
- 20th International Conference on the Theory and Application of Cryptology and
Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings,
Part I, 512--531, 2014. https://doi.org/10.1007/978-3-662-45611-8_27.
ieee: N. Fleischhacker, T. Jager, and D. Schröder, “On Tight Security Proofs for
Schnorr Signatures,” in Advances in Cryptology - ASIACRYPT 2014 - 20th International
Conference on the Theory and Application of Cryptology and Information Security,
Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I, 2014,
pp. 512--531.
mla: Fleischhacker, Nils, et al. “On Tight Security Proofs for Schnorr Signatures.”
Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on
the Theory and Application of Cryptology and Information Security, Kaoshiung,
Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I, 2014, pp. 512--531,
doi:10.1007/978-3-662-45611-8_27.
short: 'N. Fleischhacker, T. Jager, D. Schröder, in: Advances in Cryptology - ASIACRYPT
2014 - 20th International Conference on the Theory and Application of Cryptology
and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings,
Part I, 2014, pp. 512--531.'
date_created: 2018-06-07T09:21:46Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/978-3-662-45611-8_27
extern: '1'
page: 512--531
publication: Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference
on the Theory and Application of Cryptology and Information Security, Kaoshiung,
Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I
status: public
title: On Tight Security Proofs for Schnorr Signatures
type: conference
user_id: '38235'
year: '2014'
...
---
_id: '3167'
author:
- first_name: Steve
full_name: Schneider, Steve
last_name: Schneider
- first_name: Helen
full_name: Treharne, Helen
last_name: Treharne
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Schneider S, Treharne H, Wehrheim H. The behavioural semantics of Event-B refinement.
Formal Asp Comput. 2014;(2):251--280. doi:10.1007/s00165-012-0265-0
apa: Schneider, S., Treharne, H., & Wehrheim, H. (2014). The behavioural semantics
of Event-B refinement. Formal Asp. Comput., (2), 251--280. https://doi.org/10.1007/s00165-012-0265-0
bibtex: '@article{Schneider_Treharne_Wehrheim_2014, title={The behavioural semantics
of Event-B refinement}, DOI={10.1007/s00165-012-0265-0},
number={2}, journal={Formal Asp. Comput.}, author={Schneider, Steve and Treharne,
Helen and Wehrheim, Heike}, year={2014}, pages={251--280} }'
chicago: 'Schneider, Steve, Helen Treharne, and Heike Wehrheim. “The Behavioural
Semantics of Event-B Refinement.” Formal Asp. Comput., no. 2 (2014): 251--280.
https://doi.org/10.1007/s00165-012-0265-0.'
ieee: S. Schneider, H. Treharne, and H. Wehrheim, “The behavioural semantics of
Event-B refinement,” Formal Asp. Comput., no. 2, pp. 251--280, 2014.
mla: Schneider, Steve, et al. “The Behavioural Semantics of Event-B Refinement.”
Formal Asp. Comput., no. 2, 2014, pp. 251--280, doi:10.1007/s00165-012-0265-0.
short: S. Schneider, H. Treharne, H. Wehrheim, Formal Asp. Comput. (2014) 251--280.
date_created: 2018-06-13T07:55:10Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/s00165-012-0265-0
issue: '2'
page: 251--280
publication: Formal Asp. Comput.
status: public
title: The behavioural semantics of Event-B refinement
type: journal_article
user_id: '29719'
year: '2014'
...
---
_id: '3168'
author:
- first_name: Bogdan
full_name: Tofan, Bogdan
last_name: Tofan
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Tofan B, Travkin O, Schellhorn G, Wehrheim H. Two approaches for proving linearizability
of multiset. Sci Comput Program. 2014:297--314. doi:10.1016/j.scico.2014.04.001
apa: Tofan, B., Travkin, O., Schellhorn, G., & Wehrheim, H. (2014). Two approaches
for proving linearizability of multiset. Sci. Comput. Program., 297--314.
https://doi.org/10.1016/j.scico.2014.04.001
bibtex: '@article{Tofan_Travkin_Schellhorn_Wehrheim_2014, title={Two approaches
for proving linearizability of multiset}, DOI={10.1016/j.scico.2014.04.001},
journal={Sci. Comput. Program.}, author={Tofan, Bogdan and Travkin, Oleg and Schellhorn,
Gerhard and Wehrheim, Heike}, year={2014}, pages={297--314} }'
chicago: Tofan, Bogdan, Oleg Travkin, Gerhard Schellhorn, and Heike Wehrheim. “Two
Approaches for Proving Linearizability of Multiset.” Sci. Comput. Program.,
2014, 297--314. https://doi.org/10.1016/j.scico.2014.04.001.
ieee: B. Tofan, O. Travkin, G. Schellhorn, and H. Wehrheim, “Two approaches for
proving linearizability of multiset,” Sci. Comput. Program., pp. 297--314,
2014.
mla: Tofan, Bogdan, et al. “Two Approaches for Proving Linearizability of Multiset.”
Sci. Comput. Program., 2014, pp. 297--314, doi:10.1016/j.scico.2014.04.001.
short: B. Tofan, O. Travkin, G. Schellhorn, H. Wehrheim, Sci. Comput. Program. (2014)
297--314.
date_created: 2018-06-13T07:56:12Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1016/j.scico.2014.04.001
page: 297--314
publication: Sci. Comput. Program.
status: public
title: Two approaches for proving linearizability of multiset
type: journal_article
user_id: '29719'
year: '2014'
...
---
_id: '3169'
author:
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Schellhorn G, Derrick J, Wehrheim H. A Sound and Complete Proof Technique for
Linearizability of Concurrent Data Structures. {ACM} Trans Comput Log.
2014;(4):31:1--31:37. doi:10.1145/2629496
apa: Schellhorn, G., Derrick, J., & Wehrheim, H. (2014). A Sound and Complete
Proof Technique for Linearizability of Concurrent Data Structures. {ACM} Trans.
Comput. Log., (4), 31:1--31:37. https://doi.org/10.1145/2629496
bibtex: '@article{Schellhorn_Derrick_Wehrheim_2014, title={A Sound and Complete
Proof Technique for Linearizability of Concurrent Data Structures}, DOI={10.1145/2629496},
number={4}, journal={{ACM} Trans. Comput. Log.}, author={Schellhorn, Gerhard and
Derrick, John and Wehrheim, Heike}, year={2014}, pages={31:1--31:37} }'
chicago: 'Schellhorn, Gerhard, John Derrick, and Heike Wehrheim. “A Sound and Complete
Proof Technique for Linearizability of Concurrent Data Structures.” {ACM} Trans.
Comput. Log., no. 4 (2014): 31:1--31:37. https://doi.org/10.1145/2629496.'
ieee: G. Schellhorn, J. Derrick, and H. Wehrheim, “A Sound and Complete Proof Technique
for Linearizability of Concurrent Data Structures,” {ACM} Trans. Comput. Log.,
no. 4, pp. 31:1--31:37, 2014.
mla: Schellhorn, Gerhard, et al. “A Sound and Complete Proof Technique for Linearizability
of Concurrent Data Structures.” {ACM} Trans. Comput. Log., no. 4, 2014,
pp. 31:1--31:37, doi:10.1145/2629496.
short: G. Schellhorn, J. Derrick, H. Wehrheim, {ACM} Trans. Comput. Log. (2014)
31:1--31:37.
date_created: 2018-06-13T07:57:31Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1145/2629496
issue: '4'
page: 31:1--31:37
publication: '{ACM} Trans. Comput. Log.'
status: public
title: A Sound and Complete Proof Technique for Linearizability of Concurrent Data
Structures
type: journal_article
user_id: '29719'
year: '2014'
...
---
_id: '3170'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Bogdan
full_name: Tofan, Bogdan
last_name: Tofan
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Derrick J, Dongol B, Schellhorn G, Tofan B, Travkin O, Wehrheim H. Quiescent
Consistency: Defining and Verifying Relaxed Linearizability. In: B. Jones C, Pihlajasaari
P, Sun J, eds. {FM} 2014: Formal Methods - 19th International Symposium, Singapore,
May 12-16, 2014. Proceedings. Lecture Notes in Computer Science. ; 2014:200--214.
doi:10.1007/978-3-319-06410-9_15'
apa: 'Derrick, J., Dongol, B., Schellhorn, G., Tofan, B., Travkin, O., & Wehrheim,
H. (2014). Quiescent Consistency: Defining and Verifying Relaxed Linearizability.
In C. B. Jones, P. Pihlajasaari, & J. Sun (Eds.), {FM} 2014: Formal Methods
- 19th International Symposium, Singapore, May 12-16, 2014. Proceedings (pp.
200--214). https://doi.org/10.1007/978-3-319-06410-9_15'
bibtex: '@inproceedings{Derrick_Dongol_Schellhorn_Tofan_Travkin_Wehrheim_2014, series={Lecture
Notes in Computer Science}, title={Quiescent Consistency: Defining and Verifying
Relaxed Linearizability}, DOI={10.1007/978-3-319-06410-9_15},
booktitle={{FM} 2014: Formal Methods - 19th International Symposium, Singapore,
May 12-16, 2014. Proceedings}, author={Derrick, John and Dongol, Brijesh and Schellhorn,
Gerhard and Tofan, Bogdan and Travkin, Oleg and Wehrheim, Heike}, editor={B. Jones,
Cliff and Pihlajasaari, Pekka and Sun, JunEditors}, year={2014}, pages={200--214},
collection={Lecture Notes in Computer Science} }'
chicago: 'Derrick, John, Brijesh Dongol, Gerhard Schellhorn, Bogdan Tofan, Oleg
Travkin, and Heike Wehrheim. “Quiescent Consistency: Defining and Verifying Relaxed
Linearizability.” In {FM} 2014: Formal Methods - 19th International Symposium,
Singapore, May 12-16, 2014. Proceedings, edited by Cliff B. Jones, Pekka Pihlajasaari,
and Jun Sun, 200--214. Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-319-06410-9_15.'
ieee: 'J. Derrick, B. Dongol, G. Schellhorn, B. Tofan, O. Travkin, and H. Wehrheim,
“Quiescent Consistency: Defining and Verifying Relaxed Linearizability,” in {FM}
2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014.
Proceedings, 2014, pp. 200--214.'
mla: 'Derrick, John, et al. “Quiescent Consistency: Defining and Verifying Relaxed
Linearizability.” {FM} 2014: Formal Methods - 19th International Symposium,
Singapore, May 12-16, 2014. Proceedings, edited by Cliff B. Jones et al.,
2014, pp. 200--214, doi:10.1007/978-3-319-06410-9_15.'
short: 'J. Derrick, B. Dongol, G. Schellhorn, B. Tofan, O. Travkin, H. Wehrheim,
in: C. B. Jones, P. Pihlajasaari, J. Sun (Eds.), {FM} 2014: Formal Methods - 19th
International Symposium, Singapore, May 12-16, 2014. Proceedings, 2014, pp. 200--214.'
date_created: 2018-06-13T07:58:40Z
date_updated: 2022-01-06T06:59:02Z
department:
- _id: '77'
doi: 10.1007/978-3-319-06410-9_15
editor:
- first_name: Cliff
full_name: B. Jones, Cliff
last_name: B. Jones
- first_name: Pekka
full_name: Pihlajasaari, Pekka
last_name: Pihlajasaari
- first_name: Jun
full_name: Sun, Jun
last_name: Sun
page: 200--214
publication: '{FM} 2014: Formal Methods - 19th International Symposium, Singapore,
May 12-16, 2014. Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: 'Quiescent Consistency: Defining and Verifying Relaxed Linearizability'
type: conference
user_id: '29719'
year: '2014'
...
---
_id: '3171'
author:
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Travkin O, Wehrheim H. Handling {TSO} in Mechanized Linearizability Proofs.
In: Yahav E, ed. Hardware and Software: Verification and Testing - 10th International
Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014.
Proceedings. Lecture Notes in Computer Science. ; 2014:132--147. doi:10.1007/978-3-319-13338-6_11'
apa: 'Travkin, O., & Wehrheim, H. (2014). Handling {TSO} in Mechanized Linearizability
Proofs. In E. Yahav (Ed.), Hardware and Software: Verification and Testing
- 10th International Haifa Verification Conference, {HVC} 2014, Haifa, Israel,
November 18-20, 2014. Proceedings (pp. 132--147). https://doi.org/10.1007/978-3-319-13338-6_11'
bibtex: '@inproceedings{Travkin_Wehrheim_2014, series={Lecture Notes in Computer
Science}, title={Handling {TSO} in Mechanized Linearizability Proofs}, DOI={10.1007/978-3-319-13338-6_11},
booktitle={Hardware and Software: Verification and Testing - 10th International
Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014.
Proceedings}, author={Travkin, Oleg and Wehrheim, Heike}, editor={Yahav, EranEditor},
year={2014}, pages={132--147}, collection={Lecture Notes in Computer Science}
}'
chicago: 'Travkin, Oleg, and Heike Wehrheim. “Handling {TSO} in Mechanized Linearizability
Proofs.” In Hardware and Software: Verification and Testing - 10th International
Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014.
Proceedings, edited by Eran Yahav, 132--147. Lecture Notes in Computer Science,
2014. https://doi.org/10.1007/978-3-319-13338-6_11.'
ieee: 'O. Travkin and H. Wehrheim, “Handling {TSO} in Mechanized Linearizability
Proofs,” in Hardware and Software: Verification and Testing - 10th International
Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014.
Proceedings, 2014, pp. 132--147.'
mla: 'Travkin, Oleg, and Heike Wehrheim. “Handling {TSO} in Mechanized Linearizability
Proofs.” Hardware and Software: Verification and Testing - 10th International
Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014.
Proceedings, edited by Eran Yahav, 2014, pp. 132--147, doi:10.1007/978-3-319-13338-6_11.'
short: 'O. Travkin, H. Wehrheim, in: E. Yahav (Ed.), Hardware and Software: Verification
and Testing - 10th International Haifa Verification Conference, {HVC} 2014, Haifa,
Israel, November 18-20, 2014. Proceedings, 2014, pp. 132--147.'
date_created: 2018-06-13T07:59:46Z
date_updated: 2022-01-06T06:59:02Z
department:
- _id: '77'
doi: 10.1007/978-3-319-13338-6_11
editor:
- first_name: Eran
full_name: Yahav, Eran
last_name: Yahav
page: 132--147
publication: 'Hardware and Software: Verification and Testing - 10th International
Haifa Verification Conference, {HVC} 2014, Haifa, Israel, November 18-20, 2014.
Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Handling {TSO} in Mechanized Linearizability Proofs
type: conference
user_id: '29719'
year: '2014'
...