---
_id: '2988'
author:
- first_name: Marcel R.
  full_name: Ackermann, Marcel R.
  last_name: Ackermann
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
citation:
  ama: 'Ackermann MR, Blömer J. Bregman Clustering for Separable Instances. In: <i>SWAT
    2010</i>. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin
    Heidelberg; 2010:212-223. doi:<a href="https://doi.org/10.1007/978-3-642-13731-0_21">10.1007/978-3-642-13731-0_21</a>'
  apa: 'Ackermann, M. R., &#38; Blömer, J. (2010). Bregman Clustering for Separable
    Instances. In <i>SWAT 2010</i> (pp. 212–223). Berlin, Heidelberg: Springer Berlin
    Heidelberg. <a href="https://doi.org/10.1007/978-3-642-13731-0_21">https://doi.org/10.1007/978-3-642-13731-0_21</a>'
  bibtex: '@inbook{Ackermann_Blömer_2010, place={Berlin, Heidelberg}, series={Lecture
    Notes in Computer Science}, title={Bregman Clustering for Separable Instances},
    DOI={<a href="https://doi.org/10.1007/978-3-642-13731-0_21">10.1007/978-3-642-13731-0_21</a>},
    booktitle={SWAT 2010}, publisher={Springer Berlin Heidelberg}, author={Ackermann,
    Marcel R. and Blömer, Johannes}, year={2010}, pages={212–223}, collection={Lecture
    Notes in Computer Science} }'
  chicago: 'Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable
    Instances.” In <i>SWAT 2010</i>, 212–23. Lecture Notes in Computer Science. Berlin,
    Heidelberg: Springer Berlin Heidelberg, 2010. <a href="https://doi.org/10.1007/978-3-642-13731-0_21">https://doi.org/10.1007/978-3-642-13731-0_21</a>.'
  ieee: 'M. R. Ackermann and J. Blömer, “Bregman Clustering for Separable Instances,”
    in <i>SWAT 2010</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp.
    212–223.'
  mla: Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable
    Instances.” <i>SWAT 2010</i>, Springer Berlin Heidelberg, 2010, pp. 212–23, doi:<a
    href="https://doi.org/10.1007/978-3-642-13731-0_21">10.1007/978-3-642-13731-0_21</a>.
  short: 'M.R. Ackermann, J. Blömer, in: SWAT 2010, Springer Berlin Heidelberg, Berlin,
    Heidelberg, 2010, pp. 212–223.'
date_created: 2018-06-05T07:51:51Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/978-3-642-13731-0_21
page: 212-223
place: Berlin, Heidelberg
publication: SWAT 2010
publication_identifier:
  isbn:
  - '9783642137303'
  - '9783642137310'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
series_title: Lecture Notes in Computer Science
status: public
title: Bregman Clustering for Separable Instances
type: book_chapter
user_id: '25078'
year: '2010'
...
---
_id: '2990'
author:
- first_name: Marcel R.
  full_name: Ackermann, Marcel R.
  last_name: Ackermann
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
citation:
  ama: Ackermann MR, Blömer J, Sohler C. Clustering for Metric and Nonmetric Distance
    Measures. <i>ACM Trans Algorithms</i>. 2010;(4):59:1--59:26. doi:<a href="https://doi.org/10.1145/1824777.1824779">10.1145/1824777.1824779</a>
  apa: Ackermann, M. R., Blömer, J., &#38; Sohler, C. (2010). Clustering for Metric
    and Nonmetric Distance Measures. <i>ACM Trans. Algorithms</i>, (4), 59:1--59:26.
    <a href="https://doi.org/10.1145/1824777.1824779">https://doi.org/10.1145/1824777.1824779</a>
  bibtex: '@article{Ackermann_Blömer_Sohler_2010, title={Clustering for Metric and
    Nonmetric Distance Measures}, DOI={<a href="https://doi.org/10.1145/1824777.1824779">10.1145/1824777.1824779</a>},
    number={4}, journal={ACM Trans. Algorithms}, author={Ackermann, Marcel R. and
    Blömer, Johannes and Sohler, Christian}, year={2010}, pages={59:1--59:26} }'
  chicago: 'Ackermann, Marcel R., Johannes Blömer, and Christian Sohler. “Clustering
    for Metric and Nonmetric Distance Measures.” <i>ACM Trans. Algorithms</i>, no.
    4 (2010): 59:1--59:26. <a href="https://doi.org/10.1145/1824777.1824779">https://doi.org/10.1145/1824777.1824779</a>.'
  ieee: M. R. Ackermann, J. Blömer, and C. Sohler, “Clustering for Metric and Nonmetric
    Distance Measures,” <i>ACM Trans. Algorithms</i>, no. 4, pp. 59:1--59:26, 2010.
  mla: Ackermann, Marcel R., et al. “Clustering for Metric and Nonmetric Distance
    Measures.” <i>ACM Trans. Algorithms</i>, no. 4, 2010, pp. 59:1--59:26, doi:<a
    href="https://doi.org/10.1145/1824777.1824779">10.1145/1824777.1824779</a>.
  short: M.R. Ackermann, J. Blömer, C. Sohler, ACM Trans. Algorithms (2010) 59:1--59:26.
date_created: 2018-06-05T07:52:41Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1145/1824777.1824779
issue: '4'
keyword:
- k-means clustering
- k-median clustering
- Approximation algorithm
- Bregman divergences
- Itakura-Saito divergence
- Kullback-Leibler divergence
- Mahalanobis distance
- random sampling
page: 59:1--59:26
publication: ACM Trans. Algorithms
publication_identifier:
  issn:
  - 1549-6325
publication_status: published
status: public
title: Clustering for Metric and Nonmetric Distance Measures
type: journal_article
user_id: '25078'
year: '2010'
...
---
_id: '2991'
author:
- first_name: Alexander
  full_name: Krueger, Alexander
  last_name: Krueger
- first_name: Volker
  full_name: Leutnant, Volker
  last_name: Leutnant
- first_name: Reinhold
  full_name: Haeb-Umbach, Reinhold
  last_name: Haeb-Umbach
- first_name: Marcel
  full_name: Ackermann, Marcel
  last_name: Ackermann
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
citation:
  ama: Krueger A, Leutnant V, Haeb-Umbach R, Ackermann M, Blömer J. On the initialization
    of dynamic models for speech features. <i>Proc of ITG Fachtagung Sprachkommunikation
    ITG, Bochum, Germany</i>. 2010.
  apa: Krueger, A., Leutnant, V., Haeb-Umbach, R., Ackermann, M., &#38; Blömer, J.
    (2010). On the initialization of dynamic models for speech features. <i>Proc.
    of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany</i>.
  bibtex: '@article{Krueger_Leutnant_Haeb-Umbach_Ackermann_Blömer_2010, title={On
    the initialization of dynamic models for speech features}, journal={Proc. of ITG
    Fachtagung Sprachkommunikation. ITG, Bochum, Germany}, author={Krueger, Alexander
    and Leutnant, Volker and Haeb-Umbach, Reinhold and Ackermann, Marcel and Blömer,
    Johannes}, year={2010} }'
  chicago: Krueger, Alexander, Volker Leutnant, Reinhold Haeb-Umbach, Marcel Ackermann,
    and Johannes Blömer. “On the Initialization of Dynamic Models for Speech Features.”
    <i>Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany</i>, 2010.
  ieee: A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, and J. Blömer, “On
    the initialization of dynamic models for speech features,” <i>Proc. of ITG Fachtagung
    Sprachkommunikation. ITG, Bochum, Germany</i>, 2010.
  mla: Krueger, Alexander, et al. “On the Initialization of Dynamic Models for Speech
    Features.” <i>Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany</i>,
    2010.
  short: A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, J. Blömer, Proc. of
    ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany (2010).
date_created: 2018-06-05T07:53:41Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
publication: Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany
publication_status: published
status: public
title: On the initialization of dynamic models for speech features
type: journal_article
user_id: '25078'
year: '2010'
...
---
_id: '2993'
author:
- first_name: Jonas
  full_name: Schrieb, Jonas
  last_name: Schrieb
citation:
  ama: Schrieb J. Efficient and Compact CCA Security from Partitioned IBKEM. 2010.
  apa: Schrieb, J. (2010). Efficient and Compact CCA Security from Partitioned IBKEM.
  bibtex: '@article{Schrieb_2010, series={Proceedings of the 3rd Western European
    Workshop on Research in Cryptology}, title={Efficient and Compact CCA Security
    from Partitioned IBKEM}, author={Schrieb, Jonas}, year={2010}, collection={Proceedings
    of the 3rd Western European Workshop on Research in Cryptology} }'
  chicago: Schrieb, Jonas. “Efficient and Compact CCA Security from Partitioned IBKEM.”
    Proceedings of the 3rd Western European Workshop on Research in Cryptology, 2010.
  ieee: J. Schrieb, “Efficient and Compact CCA Security from Partitioned IBKEM.” 2010.
  mla: Schrieb, Jonas. <i>Efficient and Compact CCA Security from Partitioned IBKEM</i>.
    2010.
  short: J. Schrieb, (2010).
date_created: 2018-06-05T08:02:25Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
series_title: Proceedings of the 3rd Western European Workshop on Research in Cryptology
status: public
title: Efficient and Compact CCA Security from Partitioned IBKEM
type: conference
user_id: '25078'
year: '2010'
...
---
_id: '2994'
author:
- first_name: Wilhelm
  full_name: Schäfer, Wilhelm
  last_name: Schäfer
- first_name: Ansgar
  full_name: Trächtler, Ansgar
  last_name: Trächtler
- first_name: Mauro
  full_name: Birattari, Mauro
  last_name: Birattari
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Marco
  full_name: Dorigo, Marco
  last_name: Dorigo
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Rehan
  full_name: O'Grady, Rehan
  last_name: O'Grady
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
- first_name: Franz
  full_name: Rammig, Franz
  last_name: Rammig
- first_name: Wolfgang
  full_name: Reif, Wolfgang
  last_name: Reif
citation:
  ama: 'Schäfer W, Trächtler A, Birattari M, et al. Engineering self-coordinating
    software intensive systems. In: <i>Proceedings of the FSE/SDP Workshop on Future
    of Software Engineering Research - FoSER ’10</i>. ACM Press; 2010. doi:<a href="https://doi.org/10.1145/1882362.1882428">10.1145/1882362.1882428</a>'
  apa: Schäfer, W., Trächtler, A., Birattari, M., Blömer, J., Dorigo, M., Engels,
    G., … Reif, W. (2010). Engineering self-coordinating software intensive systems.
    In <i>Proceedings of the FSE/SDP workshop on Future of software engineering research
    - FoSER ’10</i>. ACM Press. <a href="https://doi.org/10.1145/1882362.1882428">https://doi.org/10.1145/1882362.1882428</a>
  bibtex: '@inproceedings{Schäfer_Trächtler_Birattari_Blömer_Dorigo_Engels_O’Grady_Platzner_Rammig_Reif_2010,
    title={Engineering self-coordinating software intensive systems}, DOI={<a href="https://doi.org/10.1145/1882362.1882428">10.1145/1882362.1882428</a>},
    booktitle={Proceedings of the FSE/SDP workshop on Future of software engineering
    research - FoSER ’10}, publisher={ACM Press}, author={Schäfer, Wilhelm and Trächtler,
    Ansgar and Birattari, Mauro and Blömer, Johannes and Dorigo, Marco and Engels,
    Gregor and O’Grady, Rehan and Platzner, Marco and Rammig, Franz and Reif, Wolfgang},
    year={2010} }'
  chicago: Schäfer, Wilhelm, Ansgar Trächtler, Mauro Birattari, Johannes Blömer, Marco
    Dorigo, Gregor Engels, Rehan O’Grady, Marco Platzner, Franz Rammig, and Wolfgang
    Reif. “Engineering Self-Coordinating Software Intensive Systems.” In <i>Proceedings
    of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10</i>.
    ACM Press, 2010. <a href="https://doi.org/10.1145/1882362.1882428">https://doi.org/10.1145/1882362.1882428</a>.
  ieee: W. Schäfer <i>et al.</i>, “Engineering self-coordinating software intensive
    systems,” in <i>Proceedings of the FSE/SDP workshop on Future of software engineering
    research - FoSER ’10</i>, 2010.
  mla: Schäfer, Wilhelm, et al. “Engineering Self-Coordinating Software Intensive
    Systems.” <i>Proceedings of the FSE/SDP Workshop on Future of Software Engineering
    Research - FoSER ’10</i>, ACM Press, 2010, doi:<a href="https://doi.org/10.1145/1882362.1882428">10.1145/1882362.1882428</a>.
  short: 'W. Schäfer, A. Trächtler, M. Birattari, J. Blömer, M. Dorigo, G. Engels,
    R. O’Grady, M. Platzner, F. Rammig, W. Reif, in: Proceedings of the FSE/SDP Workshop
    on Future of Software Engineering Research - FoSER ’10, ACM Press, 2010.'
date_created: 2018-06-05T08:03:49Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1145/1882362.1882428
publication: Proceedings of the FSE/SDP workshop on Future of software engineering
  research - FoSER '10
publication_identifier:
  isbn:
  - '9781450304276'
publication_status: published
publisher: ACM Press
status: public
title: Engineering self-coordinating software intensive systems
type: conference
user_id: '25078'
year: '2010'
...
---
_id: '47684'
author:
- first_name: Tim
  full_name: Postler, Tim
  last_name: Postler
citation:
  ama: Postler T. <i>Smart Card basierte Berechnung einer Gruppensignatur als Teil
    einer biometrischen Authentisierung</i>.; 2010.
  apa: Postler, T. (2010). <i>Smart Card basierte Berechnung einer Gruppensignatur
    als Teil einer biometrischen Authentisierung</i>.
  bibtex: '@book{Postler_2010, title={Smart Card basierte Berechnung einer Gruppensignatur
    als Teil einer biometrischen Authentisierung}, author={Postler, Tim}, year={2010}
    }'
  chicago: Postler, Tim. <i>Smart Card basierte Berechnung einer Gruppensignatur als
    Teil einer biometrischen Authentisierung</i>, 2010.
  ieee: T. Postler, <i>Smart Card basierte Berechnung einer Gruppensignatur als Teil
    einer biometrischen Authentisierung</i>. 2010.
  mla: Postler, Tim. <i>Smart Card basierte Berechnung einer Gruppensignatur als Teil
    einer biometrischen Authentisierung</i>. 2010.
  short: T. Postler, Smart Card basierte Berechnung einer Gruppensignatur als Teil
    einer biometrischen Authentisierung, 2010.
date_created: 2023-10-05T16:23:48Z
date_updated: 2023-10-05T16:55:11Z
ddc:
- '000'
department:
- _id: '34'
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: bhenrik
  date_created: 2023-10-05T16:21:25Z
  date_updated: 2023-10-05T16:55:11Z
  file_id: '47706'
  file_name: 2010_Postler_SmartCardBasierteBerechnungEinerGruppensignatur.pdf
  file_size: 1192529
  relation: main_file
file_date_updated: 2023-10-05T16:55:11Z
has_accepted_license: '1'
keyword:
- Diplomarbeit
language:
- iso: ger
oa: '1'
status: public
title: Smart Card basierte Berechnung einer Gruppensignatur als Teil einer biometrischen
  Authentisierung
type: misc
user_id: '41047'
year: '2010'
...
---
_id: '2880'
author:
- first_name: Carsten
  full_name: Schröer, Carsten
  last_name: Schröer
citation:
  ama: Schröer C. <i>Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern</i>.;
    2009.
  apa: Schröer, C. (2009). <i>Hierarchisches Clustering mit minimalen Cluster-Durchmessern</i>.
  bibtex: '@book{Schröer_2009, title={Hierarchisches Clustering mit minimalen Cluster-Durchmessern},
    author={Schröer, Carsten}, year={2009} }'
  chicago: Schröer, Carsten. <i>Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern</i>,
    2009.
  ieee: C. Schröer, <i>Hierarchisches Clustering mit minimalen Cluster-Durchmessern</i>.
    2009.
  mla: Schröer, Carsten. <i>Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern</i>.
    2009.
  short: C. Schröer, Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern,
    2009.
date_created: 2018-05-25T09:07:25Z
date_updated: 2022-01-06T06:58:25Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: feidens
  date_created: 2018-05-25T09:07:18Z
  date_updated: 2018-05-25T09:07:18Z
  file_id: '2881'
  file_name: 2009_Schroeer_HierarchischesDurchmesserClustering.pdf
  file_size: 626531
  relation: main_file
  success: 1
file_date_updated: 2018-05-25T09:07:18Z
has_accepted_license: '1'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Hierarchisches Clustering mit minimalen Cluster-Durchmessern
type: bachelorsthesis
user_id: '25078'
year: '2009'
...
---
_id: '2896'
author:
- first_name: Gennadij
  full_name: Liske, Gennadij
  last_name: Liske
citation:
  ama: Liske G. <i>Analyse Und Evaluation Eines Identitätsbasierten Signcryption-Verfahrens</i>.;
    2009.
  apa: Liske, G. (2009). <i>Analyse und Evaluation eines identitätsbasierten Signcryption-Verfahrens</i>.
  bibtex: '@book{Liske_2009, title={Analyse und Evaluation eines identitätsbasierten
    Signcryption-Verfahrens}, author={Liske, Gennadij}, year={2009} }'
  chicago: Liske, Gennadij. <i>Analyse Und Evaluation Eines Identitätsbasierten Signcryption-Verfahrens</i>,
    2009.
  ieee: G. Liske, <i>Analyse und Evaluation eines identitätsbasierten Signcryption-Verfahrens</i>.
    2009.
  mla: Liske, Gennadij. <i>Analyse Und Evaluation Eines Identitätsbasierten Signcryption-Verfahrens</i>.
    2009.
  short: G. Liske, Analyse Und Evaluation Eines Identitätsbasierten Signcryption-Verfahrens,
    2009.
date_created: 2018-05-25T09:31:04Z
date_updated: 2022-01-06T06:58:42Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: feidens
  date_created: 2018-05-25T09:30:58Z
  date_updated: 2018-07-12T09:41:46Z
  file_id: '2897'
  file_name: 2009_Liske_AnalyseUndEvaluationEinesIdentitaetsbasiertenSigncryptionVerfahrens.pdf
  file_size: 1196648
  relation: main_file
file_date_updated: 2018-07-12T09:41:46Z
has_accepted_license: '1'
oa: '1'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  last_name: Blömer
title: Analyse und Evaluation eines identitätsbasierten Signcryption-Verfahrens
type: bachelorsthesis
urn: '28960'
user_id: '25078'
year: '2009'
...
---
_id: '2904'
author:
- first_name: Christoph
  full_name: Scholz, Christoph
  last_name: Scholz
citation:
  ama: Scholz C. <i>Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen</i>.;
    2009.
  apa: Scholz, C. (2009). <i>Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen</i>.
  bibtex: '@book{Scholz_2009, title={Die Schwierigkeit des k-Median Clusterings für
    Bregman-Divergenzen}, author={Scholz, Christoph}, year={2009} }'
  chicago: Scholz, Christoph. <i>Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen</i>,
    2009.
  ieee: C. Scholz, <i>Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen</i>.
    2009.
  mla: Scholz, Christoph. <i>Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen</i>.
    2009.
  short: C. Scholz, Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen,
    2009.
date_created: 2018-05-25T09:48:17Z
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:48:10Z
  date_updated: 2018-05-25T09:48:10Z
  file_id: '2905'
  file_name: 2009_Scholz_DieSchwierigkeitDesKMedianClusteringsFuerBregmanDivergenzen.pdf
  file_size: 844164
  relation: main_file
  success: 1
file_date_updated: 2018-05-25T09:48:10Z
has_accepted_license: '1'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen
type: mastersthesis
user_id: '25078'
year: '2009'
...
---
_id: '2911'
author:
- first_name: Marcel Rudolf
  full_name: Ackermann, Marcel Rudolf
  last_name: Ackermann
citation:
  ama: Ackermann MR. <i>Algorithms for the Bregman K-Median Problem</i>. Universität
    Paderborn; 2009.
  apa: Ackermann, M. R. (2009). <i>Algorithms for the Bregman k-Median Problem</i>.
    Universität Paderborn.
  bibtex: '@book{Ackermann_2009, title={Algorithms for the Bregman k-Median Problem},
    publisher={Universität Paderborn}, author={Ackermann, Marcel Rudolf}, year={2009}
    }'
  chicago: Ackermann, Marcel Rudolf. <i>Algorithms for the Bregman K-Median Problem</i>.
    Universität Paderborn, 2009.
  ieee: M. R. Ackermann, <i>Algorithms for the Bregman k-Median Problem</i>. Universität
    Paderborn, 2009.
  mla: Ackermann, Marcel Rudolf. <i>Algorithms for the Bregman K-Median Problem</i>.
    Universität Paderborn, 2009.
  short: M.R. Ackermann, Algorithms for the Bregman K-Median Problem, Universität
    Paderborn, 2009.
date_created: 2018-05-25T10:48:51Z
date_updated: 2022-01-06T06:58:46Z
department:
- _id: '64'
main_file_link:
- url: http://digital.ub.uni-paderborn.de/hs/content/titleinfo/1561
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Algorithms for the Bregman k-Median Problem
type: dissertation
user_id: '25078'
year: '2009'
...
---
_id: '2995'
author:
- first_name: Marcel R.
  full_name: Ackermann, Marcel R.
  last_name: Ackermann
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
citation:
  ama: 'Ackermann MR, Blömer J. Coresets and Approximate Clustering for Bregman Divergences.
    In: <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i>.
    Philadelphia, PA: Society for Industrial and Applied Mathematics; 2009:1088-1097.
    doi:<a href="https://doi.org/10.1137/1.9781611973068.118">10.1137/1.9781611973068.118</a>'
  apa: 'Ackermann, M. R., &#38; Blömer, J. (2009). Coresets and Approximate Clustering
    for Bregman Divergences. In <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium
    on Discrete Algorithms</i> (pp. 1088–1097). Philadelphia, PA: Society for Industrial
    and Applied Mathematics. <a href="https://doi.org/10.1137/1.9781611973068.118">https://doi.org/10.1137/1.9781611973068.118</a>'
  bibtex: '@inbook{Ackermann_Blömer_2009, place={Philadelphia, PA}, title={Coresets
    and Approximate Clustering for Bregman Divergences}, DOI={<a href="https://doi.org/10.1137/1.9781611973068.118">10.1137/1.9781611973068.118</a>},
    booktitle={Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete
    Algorithms}, publisher={Society for Industrial and Applied Mathematics}, author={Ackermann,
    Marcel R. and Blömer, Johannes}, year={2009}, pages={1088–1097} }'
  chicago: 'Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering
    for Bregman Divergences.” In <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium
    on Discrete Algorithms</i>, 1088–97. Philadelphia, PA: Society for Industrial
    and Applied Mathematics, 2009. <a href="https://doi.org/10.1137/1.9781611973068.118">https://doi.org/10.1137/1.9781611973068.118</a>.'
  ieee: 'M. R. Ackermann and J. Blömer, “Coresets and Approximate Clustering for Bregman
    Divergences,” in <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on
    Discrete Algorithms</i>, Philadelphia, PA: Society for Industrial and Applied
    Mathematics, 2009, pp. 1088–1097.'
  mla: Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering
    for Bregman Divergences.” <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium
    on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2009,
    pp. 1088–97, doi:<a href="https://doi.org/10.1137/1.9781611973068.118">10.1137/1.9781611973068.118</a>.
  short: 'M.R. Ackermann, J. Blömer, in: Proceedings of the Twentieth Annual ACM-SIAM
    Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics,
    Philadelphia, PA, 2009, pp. 1088–1097.'
date_created: 2018-06-05T08:05:17Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1137/1.9781611973068.118
language:
- iso: eng
page: 1088-1097
place: Philadelphia, PA
publication: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
  isbn:
  - '9780898716801'
  - '9781611973068'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
status: public
title: Coresets and Approximate Clustering for Bregman Divergences
type: book_chapter
user_id: '25078'
year: '2009'
...
---
_id: '3000'
author:
- first_name: Jonas
  full_name: Schrieb, Jonas
  last_name: Schrieb
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
- first_name: Daniel
  full_name: Wonisch, Daniel
  last_name: Wonisch
citation:
  ama: 'Schrieb J, Wehrheim H, Wonisch D. Three-Valued Spotlight Abstractions. In:
    <i>FM 2009: Formal Methods</i>. Berlin, Heidelberg: Springer Berlin Heidelberg;
    2009:106-122. doi:<a href="https://doi.org/10.1007/978-3-642-05089-3_8">10.1007/978-3-642-05089-3_8</a>'
  apa: 'Schrieb, J., Wehrheim, H., &#38; Wonisch, D. (2009). Three-Valued Spotlight
    Abstractions. In <i>FM 2009: Formal Methods</i> (pp. 106–122). Berlin, Heidelberg:
    Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-642-05089-3_8">https://doi.org/10.1007/978-3-642-05089-3_8</a>'
  bibtex: '@inbook{Schrieb_Wehrheim_Wonisch_2009, place={Berlin, Heidelberg}, title={Three-Valued
    Spotlight Abstractions}, DOI={<a href="https://doi.org/10.1007/978-3-642-05089-3_8">10.1007/978-3-642-05089-3_8</a>},
    booktitle={FM 2009: Formal Methods}, publisher={Springer Berlin Heidelberg}, author={Schrieb,
    Jonas and Wehrheim, Heike and Wonisch, Daniel}, year={2009}, pages={106–122} }'
  chicago: 'Schrieb, Jonas, Heike Wehrheim, and Daniel Wonisch. “Three-Valued Spotlight
    Abstractions.” In <i>FM 2009: Formal Methods</i>, 106–22. Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2009. <a href="https://doi.org/10.1007/978-3-642-05089-3_8">https://doi.org/10.1007/978-3-642-05089-3_8</a>.'
  ieee: 'J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,”
    in <i>FM 2009: Formal Methods</i>, Berlin, Heidelberg: Springer Berlin Heidelberg,
    2009, pp. 106–122.'
  mla: 'Schrieb, Jonas, et al. “Three-Valued Spotlight Abstractions.” <i>FM 2009:
    Formal Methods</i>, Springer Berlin Heidelberg, 2009, pp. 106–22, doi:<a href="https://doi.org/10.1007/978-3-642-05089-3_8">10.1007/978-3-642-05089-3_8</a>.'
  short: 'J. Schrieb, H. Wehrheim, D. Wonisch, in: FM 2009: Formal Methods, Springer
    Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 106–122.'
date_created: 2018-06-05T08:09:11Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/978-3-642-05089-3_8
page: 106-122
place: Berlin, Heidelberg
publication: 'FM 2009: Formal Methods'
publication_identifier:
  isbn:
  - '9783642050886'
  - '9783642050893'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Three-Valued Spotlight Abstractions
type: book_chapter
user_id: '25078'
year: '2009'
...
---
_id: '2999'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Stefanie
  full_name: ' Naewe, Stefanie'
  id: '1971'
  last_name: ' Naewe'
citation:
  ama: Blömer J,  Naewe S. Sampling methods for shortest vectors, closest vectors
    and successive minima. <i>Theoretical Computer Science</i>. 2009;410(18):1648-1665.
    doi:<a href="https://doi.org/10.1016/j.tcs.2008.12.045">10.1016/j.tcs.2008.12.045</a>
  apa: Blömer, J., &#38;  Naewe, S. (2009). Sampling methods for shortest vectors,
    closest vectors and successive minima. <i>Theoretical Computer Science</i>, <i>410</i>(18),
    1648–1665. <a href="https://doi.org/10.1016/j.tcs.2008.12.045">https://doi.org/10.1016/j.tcs.2008.12.045</a>
  bibtex: '@article{Blömer_ Naewe_2009, title={Sampling methods for shortest vectors,
    closest vectors and successive minima}, volume={410}, DOI={<a href="https://doi.org/10.1016/j.tcs.2008.12.045">10.1016/j.tcs.2008.12.045</a>},
    number={18}, journal={Theoretical Computer Science}, author={Blömer, Johannes
    and  Naewe, Stefanie}, year={2009}, pages={1648–1665} }'
  chicago: 'Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest
    Vectors, Closest Vectors and Successive Minima.” <i>Theoretical Computer Science</i>
    410, no. 18 (2009): 1648–65. <a href="https://doi.org/10.1016/j.tcs.2008.12.045">https://doi.org/10.1016/j.tcs.2008.12.045</a>.'
  ieee: 'J. Blömer and S.  Naewe, “Sampling methods for shortest vectors, closest
    vectors and successive minima,” <i>Theoretical Computer Science</i>, vol. 410,
    no. 18, pp. 1648–1665, 2009, doi: <a href="https://doi.org/10.1016/j.tcs.2008.12.045">10.1016/j.tcs.2008.12.045</a>.'
  mla: Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest Vectors,
    Closest Vectors and Successive Minima.” <i>Theoretical Computer Science</i>, vol.
    410, no. 18, 2009, pp. 1648–65, doi:<a href="https://doi.org/10.1016/j.tcs.2008.12.045">10.1016/j.tcs.2008.12.045</a>.
  short: J. Blömer, S.  Naewe, Theoretical Computer Science 410 (2009) 1648–1665.
date_created: 2018-06-05T08:07:24Z
date_updated: 2024-08-08T12:18:04Z
department:
- _id: '64'
doi: 10.1016/j.tcs.2008.12.045
intvolume: '       410'
issue: '18'
keyword:
- Geometry of numbers
- Lattices
- Shortest vectors
language:
- iso: eng
page: 1648 - 1665
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: Sampling methods for shortest vectors, closest vectors and successive minima
type: journal_article
user_id: '49063'
volume: 410
year: '2009'
...
---
_id: '3001'
author:
- first_name: Claudius
  full_name: Stern, Claudius
  last_name: Stern
- first_name: Philipp
  full_name: Adelt, Philipp
  last_name: Adelt
- first_name: Volker
  full_name: Krummel, Volker
  last_name: Krummel
- first_name: Marcel Rudolf
  full_name: Ackermann, Marcel Rudolf
  last_name: Ackermann
citation:
  ama: 'Stern C, Adelt P, Krummel V, Ackermann MR. Reliable Evidence of Data Integrity
    from an Untrusted Storage Service. In: <i>Fourth International Conference on Networking
    and Services (Icns 2008)</i>. IEEE; 2008. doi:<a href="https://doi.org/10.1109/icns.2008.28">10.1109/icns.2008.28</a>'
  apa: Stern, C., Adelt, P., Krummel, V., &#38; Ackermann, M. R. (2008). Reliable
    Evidence of Data Integrity from an Untrusted Storage Service. In <i>Fourth International
    Conference on Networking and Services (icns 2008)</i>. IEEE. <a href="https://doi.org/10.1109/icns.2008.28">https://doi.org/10.1109/icns.2008.28</a>
  bibtex: '@inproceedings{Stern_Adelt_Krummel_Ackermann_2008, title={Reliable Evidence
    of Data Integrity from an Untrusted Storage Service}, DOI={<a href="https://doi.org/10.1109/icns.2008.28">10.1109/icns.2008.28</a>},
    booktitle={Fourth International Conference on Networking and Services (icns 2008)},
    publisher={IEEE}, author={Stern, Claudius and Adelt, Philipp and Krummel, Volker
    and Ackermann, Marcel Rudolf}, year={2008} }'
  chicago: Stern, Claudius, Philipp Adelt, Volker Krummel, and Marcel Rudolf Ackermann.
    “Reliable Evidence of Data Integrity from an Untrusted Storage Service.” In <i>Fourth
    International Conference on Networking and Services (Icns 2008)</i>. IEEE, 2008.
    <a href="https://doi.org/10.1109/icns.2008.28">https://doi.org/10.1109/icns.2008.28</a>.
  ieee: C. Stern, P. Adelt, V. Krummel, and M. R. Ackermann, “Reliable Evidence of
    Data Integrity from an Untrusted Storage Service,” in <i>Fourth International
    Conference on Networking and Services (icns 2008)</i>, 2008.
  mla: Stern, Claudius, et al. “Reliable Evidence of Data Integrity from an Untrusted
    Storage Service.” <i>Fourth International Conference on Networking and Services
    (Icns 2008)</i>, IEEE, 2008, doi:<a href="https://doi.org/10.1109/icns.2008.28">10.1109/icns.2008.28</a>.
  short: 'C. Stern, P. Adelt, V. Krummel, M.R. Ackermann, in: Fourth International
    Conference on Networking and Services (Icns 2008), IEEE, 2008.'
date_created: 2018-06-05T08:10:19Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
- _id: '70'
doi: 10.1109/icns.2008.28
publication: Fourth International Conference on Networking and Services (icns 2008)
publication_identifier:
  isbn:
  - '9780769530949'
publication_status: published
publisher: IEEE
status: public
title: Reliable Evidence of Data Integrity from an Untrusted Storage Service
type: conference
user_id: '25078'
year: '2008'
...
---
_id: '47685'
author:
- first_name: Jonas
  full_name: Schrieb, Jonas
  last_name: Schrieb
citation:
  ama: Schrieb J. <i>Construction and Applications of Identity-Based Encryption without
    Pairings</i>.; 2008.
  apa: Schrieb, J. (2008). <i>Construction and Applications of Identity-Based Encryption
    without Pairings</i>.
  bibtex: '@book{Schrieb_2008, title={Construction and Applications of Identity-Based
    Encryption without Pairings}, author={Schrieb, Jonas}, year={2008} }'
  chicago: Schrieb, Jonas. <i>Construction and Applications of Identity-Based Encryption
    without Pairings</i>, 2008.
  ieee: J. Schrieb, <i>Construction and Applications of Identity-Based Encryption
    without Pairings</i>. 2008.
  mla: Schrieb, Jonas. <i>Construction and Applications of Identity-Based Encryption
    without Pairings</i>. 2008.
  short: J. Schrieb, Construction and Applications of Identity-Based Encryption without
    Pairings, 2008.
date_created: 2023-10-05T16:29:40Z
date_updated: 2023-10-05T16:55:04Z
ddc:
- '000'
department:
- _id: '34'
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: bhenrik
  date_created: 2023-10-05T16:29:32Z
  date_updated: 2023-10-05T16:55:04Z
  file_id: '47710'
  file_name: 2008_Schrieb_ConstructionAndApplicationsOfIBEWithoutPairings.pdf
  file_size: 1055931
  relation: main_file
file_date_updated: 2023-10-05T16:55:04Z
has_accepted_license: '1'
keyword:
- Diplomarbeit
language:
- iso: eng
oa: '1'
status: public
title: Construction and Applications of Identity-Based Encryption without Pairings
type: misc
user_id: '41047'
year: '2008'
...
---
_id: '2912'
author:
- first_name: Volker
  full_name: Krummel, Volker
  last_name: Krummel
citation:
  ama: Krummel V. <i>Tamper Resistance of AES -- Models, Attacks and Countermeasures</i>.
    Universität Paderborn; 2007.
  apa: Krummel, V. (2007). <i>Tamper Resistance of AES -- Models, Attacks and Countermeasures</i>.
    Universität Paderborn.
  bibtex: '@book{Krummel_2007, title={Tamper Resistance of AES -- Models, Attacks
    and Countermeasures}, publisher={Universität Paderborn}, author={Krummel, Volker},
    year={2007} }'
  chicago: Krummel, Volker. <i>Tamper Resistance of AES -- Models, Attacks and Countermeasures</i>.
    Universität Paderborn, 2007.
  ieee: V. Krummel, <i>Tamper Resistance of AES -- Models, Attacks and Countermeasures</i>.
    Universität Paderborn, 2007.
  mla: Krummel, Volker. <i>Tamper Resistance of AES -- Models, Attacks and Countermeasures</i>.
    Universität Paderborn, 2007.
  short: V. Krummel, Tamper Resistance of AES -- Models, Attacks and Countermeasures,
    Universität Paderborn, 2007.
date_created: 2018-05-25T10:49:53Z
date_updated: 2022-01-06T06:58:46Z
department:
- _id: '64'
main_file_link:
- url: http://nbn-resolving.de/urn:nbn:de:hbz:466-20080110018
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Tamper Resistance of AES -- Models, Attacks and Countermeasures
type: dissertation
user_id: '25078'
year: '2007'
...
---
_id: '3002'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Volker
  full_name: Krummel, Volker
  last_name: Krummel
citation:
  ama: 'Blömer J, Krummel V. Analysis of Countermeasures Against Access Driven Cache
    Attacks on AES. In: <i>Selected Areas in Cryptography</i>. Berlin, Heidelberg:
    Springer Berlin Heidelberg; 2007:96-109. doi:<a href="https://doi.org/10.1007/978-3-540-77360-3_7">10.1007/978-3-540-77360-3_7</a>'
  apa: 'Blömer, J., &#38; Krummel, V. (2007). Analysis of Countermeasures Against
    Access Driven Cache Attacks on AES. In <i>Selected Areas in Cryptography</i> (pp.
    96–109). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-540-77360-3_7">https://doi.org/10.1007/978-3-540-77360-3_7</a>'
  bibtex: '@inbook{Blömer_Krummel_2007, place={Berlin, Heidelberg}, title={Analysis
    of Countermeasures Against Access Driven Cache Attacks on AES}, DOI={<a href="https://doi.org/10.1007/978-3-540-77360-3_7">10.1007/978-3-540-77360-3_7</a>},
    booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes and Krummel, Volker}, year={2007}, pages={96–109} }'
  chicago: 'Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against
    Access Driven Cache Attacks on AES.” In <i>Selected Areas in Cryptography</i>,
    96–109. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href="https://doi.org/10.1007/978-3-540-77360-3_7">https://doi.org/10.1007/978-3-540-77360-3_7</a>.'
  ieee: 'J. Blömer and V. Krummel, “Analysis of Countermeasures Against Access Driven
    Cache Attacks on AES,” in <i>Selected Areas in Cryptography</i>, Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2007, pp. 96–109.'
  mla: Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against
    Access Driven Cache Attacks on AES.” <i>Selected Areas in Cryptography</i>, Springer
    Berlin Heidelberg, 2007, pp. 96–109, doi:<a href="https://doi.org/10.1007/978-3-540-77360-3_7">10.1007/978-3-540-77360-3_7</a>.
  short: 'J. Blömer, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin
    Heidelberg, Berlin, Heidelberg, 2007, pp. 96–109.'
date_created: 2018-06-05T08:12:18Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/978-3-540-77360-3_7
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2007/282
oa: '1'
page: 96-109
place: Berlin, Heidelberg
publication: Selected Areas in Cryptography
publication_identifier:
  isbn:
  - '9783540773597'
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Analysis of Countermeasures Against Access Driven Cache Attacks on AES
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '3019'
author:
- first_name: Alexander
  full_name: May, Alexander
  last_name: May
citation:
  ama: 'May A. Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In: <i>Advances
    in Cryptology — CRYPTO 2002</i>. Berlin, Heidelberg: Springer Berlin Heidelberg;
    2007:242-256. doi:<a href="https://doi.org/10.1007/3-540-45708-9_16">10.1007/3-540-45708-9_16</a>'
  apa: 'May, A. (2007). Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In
    <i>Advances in Cryptology — CRYPTO 2002</i> (pp. 242–256). Berlin, Heidelberg:
    Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/3-540-45708-9_16">https://doi.org/10.1007/3-540-45708-9_16</a>'
  bibtex: '@inbook{May_2007, place={Berlin, Heidelberg}, title={Cryptanalysis of Unbalanced
    RSA with Small CRT-Exponent}, DOI={<a href="https://doi.org/10.1007/3-540-45708-9_16">10.1007/3-540-45708-9_16</a>},
    booktitle={Advances in Cryptology — CRYPTO 2002}, publisher={Springer Berlin Heidelberg},
    author={May, Alexander}, year={2007}, pages={242–256} }'
  chicago: 'May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.”
    In <i>Advances in Cryptology — CRYPTO 2002</i>, 242–56. Berlin, Heidelberg: Springer
    Berlin Heidelberg, 2007. <a href="https://doi.org/10.1007/3-540-45708-9_16">https://doi.org/10.1007/3-540-45708-9_16</a>.'
  ieee: 'A. May, “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent,” in <i>Advances
    in Cryptology — CRYPTO 2002</i>, Berlin, Heidelberg: Springer Berlin Heidelberg,
    2007, pp. 242–256.'
  mla: May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.”
    <i>Advances in Cryptology — CRYPTO 2002</i>, Springer Berlin Heidelberg, 2007,
    pp. 242–56, doi:<a href="https://doi.org/10.1007/3-540-45708-9_16">10.1007/3-540-45708-9_16</a>.
  short: 'A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg,
    Berlin, Heidelberg, 2007, pp. 242–256.'
date_created: 2018-06-05T08:26:03Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-45708-9_16
page: 242-256
place: Berlin, Heidelberg
publication: Advances in Cryptology — CRYPTO 2002
publication_identifier:
  isbn:
  - '9783540440505'
  - '9783540457084'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '3020'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Alexander
  full_name: May, Alexander
  last_name: May
citation:
  ama: 'Blömer J, May A. Low Secret Exponent RSA Revisited. In: <i>Lecture Notes in
    Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:4-19.
    doi:<a href="https://doi.org/10.1007/3-540-44670-2_2">10.1007/3-540-44670-2_2</a>'
  apa: 'Blömer, J., &#38; May, A. (2007). Low Secret Exponent RSA Revisited. In <i>Lecture
    Notes in Computer Science</i> (pp. 4–19). Berlin, Heidelberg: Springer Berlin
    Heidelberg. <a href="https://doi.org/10.1007/3-540-44670-2_2">https://doi.org/10.1007/3-540-44670-2_2</a>'
  bibtex: '@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Low Secret
    Exponent RSA Revisited}, DOI={<a href="https://doi.org/10.1007/3-540-44670-2_2">10.1007/3-540-44670-2_2</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes and May, Alexander}, year={2007}, pages={4–19} }'
  chicago: 'Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.”
    In <i>Lecture Notes in Computer Science</i>, 4–19. Berlin, Heidelberg: Springer
    Berlin Heidelberg, 2007. <a href="https://doi.org/10.1007/3-540-44670-2_2">https://doi.org/10.1007/3-540-44670-2_2</a>.'
  ieee: 'J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in <i>Lecture
    Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg,
    2007, pp. 4–19.'
  mla: Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” <i>Lecture
    Notes in Computer Science</i>, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:<a
    href="https://doi.org/10.1007/3-540-44670-2_2">10.1007/3-540-44670-2_2</a>.
  short: 'J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin
    Heidelberg, Berlin, Heidelberg, 2007, pp. 4–19.'
date_created: 2018-06-05T08:26:29Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-44670-2_2
page: 4-19
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540424888'
  - '9783540446705'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Low Secret Exponent RSA Revisited
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '3021'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Alexander
  full_name: May, Alexander
  last_name: May
citation:
  ama: 'Blömer J, May A. Key Revocation with Interval Cover Families. In: <i>Selected
    Areas in Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:325-341.
    doi:<a href="https://doi.org/10.1007/3-540-45537-x_26">10.1007/3-540-45537-x_26</a>'
  apa: 'Blömer, J., &#38; May, A. (2007). Key Revocation with Interval Cover Families.
    In <i>Selected Areas in Cryptography</i> (pp. 325–341). Berlin, Heidelberg: Springer
    Berlin Heidelberg. <a href="https://doi.org/10.1007/3-540-45537-x_26">https://doi.org/10.1007/3-540-45537-x_26</a>'
  bibtex: '@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Key Revocation
    with Interval Cover Families}, DOI={<a href="https://doi.org/10.1007/3-540-45537-x_26">10.1007/3-540-45537-x_26</a>},
    booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes and May, Alexander}, year={2007}, pages={325–341} }'
  chicago: 'Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover
    Families.” In <i>Selected Areas in Cryptography</i>, 325–41. Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2007. <a href="https://doi.org/10.1007/3-540-45537-x_26">https://doi.org/10.1007/3-540-45537-x_26</a>.'
  ieee: 'J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in <i>Selected
    Areas in Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007,
    pp. 325–341.'
  mla: Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.”
    <i>Selected Areas in Cryptography</i>, Springer Berlin Heidelberg, 2007, pp. 325–41,
    doi:<a href="https://doi.org/10.1007/3-540-45537-x_26">10.1007/3-540-45537-x_26</a>.
  short: 'J. Blömer, A. May, in: Selected Areas in Cryptography, Springer Berlin Heidelberg,
    Berlin, Heidelberg, 2007, pp. 325–341.'
date_created: 2018-06-05T08:26:50Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-45537-x_26
page: 325-341
place: Berlin, Heidelberg
publication: Selected Areas in Cryptography
publication_identifier:
  isbn:
  - '9783540430667'
  - '9783540455370'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Key Revocation with Interval Cover Families
type: book_chapter
user_id: '25078'
year: '2007'
...