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