[{"date_created":"2021-09-13T13:07:57Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"conference","citation":{"apa":"Bienkowski, M., &#38; Kutyłowski, J. (2007). The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">https://doi.org/10.1007/978-3-540-73951-7_30</a>","ieee":"M. Bienkowski and J. Kutyłowski, “The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces,” 2007, doi: <a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>.","chicago":"Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">https://doi.org/10.1007/978-3-540-73951-7_30</a>.","short":"M. Bienkowski, J. Kutyłowski, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.","mla":"Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.” <i>Lecture Notes in Computer Science</i>, 2007, doi:<a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>.","ama":"Bienkowski M, Kutyłowski J. The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. In: <i>Lecture Notes in Computer Science</i>. ; 2007. doi:<a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>","bibtex":"@inproceedings{Bienkowski_Kutyłowski_2007, place={Berlin, Heidelberg}, title={The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>}, booktitle={Lecture Notes in Computer Science}, author={Bienkowski, Marcin and Kutyłowski, Jarosław}, year={2007} }"},"publication":"Lecture Notes in Computer Science","abstract":[{"text":"We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources. We give an asymptotically optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive deterministic one for the k-resource problem on uniform metric spaces consisting of n points. This extends known results for paging to the more general setting of k-resource.\r\nBasing on the results for uniform metric spaces, we develop a randomized algorithm solving the k-resource and the k-server problem on metric spaces which can be decomposed into components far away from each other. The algorithm achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra resources more than the optimal algorithm.\r\n","lang":"eng"}],"_id":"24276","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/978-3-540-73951-7_30","publication_identifier":{"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Bienkowski, Marcin","last_name":"Bienkowski","first_name":"Marcin"},{"first_name":"Jarosław","last_name":"Kutyłowski","full_name":"Kutyłowski, Jarosław"}],"title":"The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces","status":"public","year":"2007","publication_status":"published","date_updated":"2022-01-06T06:56:13Z"},{"year":"2007","title":"Peer-to-Peer-Netzwerke","status":"public","publication_identifier":{"isbn":["9783540339915"]},"author":[{"first_name":"Peter","last_name":"Mahlmann","full_name":"Mahlmann, Peter"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"publication_status":"published","date_updated":"2022-01-06T06:56:18Z","_id":"24366","publisher":"Springer","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/978-3-540-33992-2","citation":{"bibtex":"@book{Mahlmann_Schindelhauer_2007, place={Berlin}, title={Peer-to-Peer-Netzwerke}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-33992-2\">10.1007/978-3-540-33992-2</a>}, publisher={Springer}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2007} }","ama":"Mahlmann P, Schindelhauer C. <i>Peer-to-Peer-Netzwerke</i>. Springer; 2007. doi:<a href=\"https://doi.org/10.1007/978-3-540-33992-2\">10.1007/978-3-540-33992-2</a>","mla":"Mahlmann, Peter, and Christian Schindelhauer. <i>Peer-to-Peer-Netzwerke</i>. Springer, 2007, doi:<a href=\"https://doi.org/10.1007/978-3-540-33992-2\">10.1007/978-3-540-33992-2</a>.","chicago":"Mahlmann, Peter, and Christian Schindelhauer. <i>Peer-to-Peer-Netzwerke</i>. Berlin: Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-33992-2\">https://doi.org/10.1007/978-3-540-33992-2</a>.","short":"P. Mahlmann, C. Schindelhauer, Peer-to-Peer-Netzwerke, Springer, Berlin, 2007.","ieee":"P. Mahlmann and C. Schindelhauer, <i>Peer-to-Peer-Netzwerke</i>. Berlin: Springer, 2007.","apa":"Mahlmann, P., &#38; Schindelhauer, C. (2007). <i>Peer-to-Peer-Netzwerke</i>. Springer. <a href=\"https://doi.org/10.1007/978-3-540-33992-2\">https://doi.org/10.1007/978-3-540-33992-2</a>"},"abstract":[{"lang":"eng","text":"Dieses Buch beschäftigt sich mit Algorithmen und Methoden der Peer-to-Peer-Netzwerke und gibt einen Einblick in die aktuelle Forschung.\r\n\r\nUrsprünglich waren Peer-to-Peer-Netzwerke nur für File-Sharing konzipiert. Mittlerweile hat sich Peer-to-Peer zum Paradigma für Rechnernetzwerke entwickelt. Ziel dieses Buches ist es, dem Leser ein grundlegendes Verständnis der Techniken hinter den aktuellen Peer-to-Peer-Netzwerken aufzuzeigen und im nächsten Schritt Algorithmen vorzustellen, die vielleicht erst in einigen Jahren umgesetzt werden.\r\n\r\nDas Buch richtet sich in erster Linie an Informatiker (Studenten ab dem 5. Semester). Aber auch interessierte Nichtinformatiker können von diesem Buch profitieren, wobei grundlegende Kenntnisse aus den Bereichen der Mathematik und Informatik vorausgesetzt werden. Die Ziele, Kernaussagen und Ergebnisse sollten jedoch auch ohne akademischen Hintergrund klar werden."}],"date_created":"2021-09-14T10:29:29Z","place":"Berlin","type":"book","department":[{"_id":"63"}]},{"title":"On using data abstractions for model checking refinements","status":"public","year":"2007","author":[{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"date_updated":"2022-01-06T06:59:05Z","page":"41--71","_id":"3211","user_id":"29719","doi":"10.1007/s00236-007-0042-3","publication":"Acta Inf.","issue":"1","citation":{"ieee":"J. Derrick and H. Wehrheim, “On using data abstractions for model checking refinements,” <i>Acta Inf.</i>, no. 1, pp. 41--71, 2007.","apa":"Derrick, J., &#38; Wehrheim, H. (2007). On using data abstractions for model checking refinements. <i>Acta Inf.</i>, (1), 41--71. <a href=\"https://doi.org/10.1007/s00236-007-0042-3\">https://doi.org/10.1007/s00236-007-0042-3</a>","chicago":"Derrick, John, and Heike Wehrheim. “On Using Data Abstractions for Model Checking Refinements.” <i>Acta Inf.</i>, no. 1 (2007): 41--71. <a href=\"https://doi.org/10.1007/s00236-007-0042-3\">https://doi.org/10.1007/s00236-007-0042-3</a>.","short":"J. Derrick, H. Wehrheim, Acta Inf. (2007) 41--71.","mla":"Derrick, John, and Heike Wehrheim. “On Using Data Abstractions for Model Checking Refinements.” <i>Acta Inf.</i>, no. 1, 2007, pp. 41--71, doi:<a href=\"https://doi.org/10.1007/s00236-007-0042-3\">10.1007/s00236-007-0042-3</a>.","bibtex":"@article{Derrick_Wehrheim_2007, title={On using data abstractions for model checking refinements}, DOI={<a href=\"https://doi.org/10.1007/s00236-007-0042-3\">10.1007/s00236-007-0042-3</a>}, number={1}, journal={Acta Inf.}, author={Derrick, John and Wehrheim, Heike}, year={2007}, pages={41--71} }","ama":"Derrick J, Wehrheim H. On using data abstractions for model checking refinements. <i>Acta Inf</i>. 2007;(1):41--71. doi:<a href=\"https://doi.org/10.1007/s00236-007-0042-3\">10.1007/s00236-007-0042-3</a>"},"date_created":"2018-06-13T09:56:17Z","type":"journal_article","department":[{"_id":"77"}]},{"type":"journal_article","department":[{"_id":"77"}],"date_created":"2018-06-13T09:57:37Z","publication":"Electr. Notes Theor. Comput. Sci.","issue":"2","citation":{"ieee":"B. Metzler and H. Wehrheim, “Extending a Component Specification Language with Time,” <i>Electr. Notes Theor. Comput. Sci.</i>, no. 2, pp. 47--67, 2007.","apa":"Metzler, B., &#38; Wehrheim, H. (2007). Extending a Component Specification Language with Time. <i>Electr. Notes Theor. Comput. Sci.</i>, (2), 47--67. <a href=\"https://doi.org/10.1016/j.entcs.2006.02.031\">https://doi.org/10.1016/j.entcs.2006.02.031</a>","chicago":"Metzler, Björn, and Heike Wehrheim. “Extending a Component Specification Language with Time.” <i>Electr. Notes Theor. Comput. Sci.</i>, no. 2 (2007): 47--67. <a href=\"https://doi.org/10.1016/j.entcs.2006.02.031\">https://doi.org/10.1016/j.entcs.2006.02.031</a>.","short":"B. Metzler, H. Wehrheim, Electr. Notes Theor. Comput. Sci. (2007) 47--67.","mla":"Metzler, Björn, and Heike Wehrheim. “Extending a Component Specification Language with Time.” <i>Electr. Notes Theor. Comput. Sci.</i>, no. 2, 2007, pp. 47--67, doi:<a href=\"https://doi.org/10.1016/j.entcs.2006.02.031\">10.1016/j.entcs.2006.02.031</a>.","bibtex":"@article{Metzler_Wehrheim_2007, title={Extending a Component Specification Language with Time}, DOI={<a href=\"https://doi.org/10.1016/j.entcs.2006.02.031\">10.1016/j.entcs.2006.02.031</a>}, number={2}, journal={Electr. Notes Theor. Comput. Sci.}, author={Metzler, Björn and Wehrheim, Heike}, year={2007}, pages={47--67} }","ama":"Metzler B, Wehrheim H. Extending a Component Specification Language with Time. <i>Electr Notes Theor Comput Sci</i>. 2007;(2):47--67. doi:<a href=\"https://doi.org/10.1016/j.entcs.2006.02.031\">10.1016/j.entcs.2006.02.031</a>"},"doi":"10.1016/j.entcs.2006.02.031","user_id":"29719","page":"47--67","_id":"3212","date_updated":"2022-01-06T06:59:05Z","year":"2007","title":"Extending a Component Specification Language with Time","status":"public","author":[{"last_name":"Metzler","first_name":"Björn","full_name":"Metzler, Björn"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}]},{"date_created":"2018-06-13T09:59:12Z","department":[{"_id":"77"}],"type":"journal_article","citation":{"apa":"Estler, H. .-}Christian, Ruhroth, T., &#38; Wehrheim, H. (2007). Modelchecking Correctness of Refactorings - Some Experiments. <i>Electr. Notes Theor. Comput. Sci.</i>, 3--17. <a href=\"https://doi.org/10.1016/j.entcs.2006.08.041\">https://doi.org/10.1016/j.entcs.2006.08.041</a>","ieee":"H. .-}Christian Estler, T. Ruhroth, and H. Wehrheim, “Modelchecking Correctness of Refactorings - Some Experiments,” <i>Electr. Notes Theor. Comput. Sci.</i>, pp. 3--17, 2007.","chicago":"Estler, H.{-}Christian, Thomas Ruhroth, and Heike Wehrheim. “Modelchecking Correctness of Refactorings - Some Experiments.” <i>Electr. Notes Theor. Comput. Sci.</i>, 2007, 3--17. <a href=\"https://doi.org/10.1016/j.entcs.2006.08.041\">https://doi.org/10.1016/j.entcs.2006.08.041</a>.","short":"H..-}Christian Estler, T. Ruhroth, H. Wehrheim, Electr. Notes Theor. Comput. Sci. (2007) 3--17.","mla":"Estler, H. .. }Christian, et al. “Modelchecking Correctness of Refactorings - Some Experiments.” <i>Electr. Notes Theor. Comput. Sci.</i>, 2007, pp. 3--17, doi:<a href=\"https://doi.org/10.1016/j.entcs.2006.08.041\">10.1016/j.entcs.2006.08.041</a>.","ama":"Estler H.-}Christian, Ruhroth T, Wehrheim H. Modelchecking Correctness of Refactorings - Some Experiments. <i>Electr Notes Theor Comput Sci</i>. 2007:3--17. doi:<a href=\"https://doi.org/10.1016/j.entcs.2006.08.041\">10.1016/j.entcs.2006.08.041</a>","bibtex":"@article{Estler_Ruhroth_Wehrheim_2007, title={Modelchecking Correctness of Refactorings - Some Experiments}, DOI={<a href=\"https://doi.org/10.1016/j.entcs.2006.08.041\">10.1016/j.entcs.2006.08.041</a>}, journal={Electr. Notes Theor. Comput. Sci.}, author={Estler, H.{-}Christian and Ruhroth, Thomas and Wehrheim, Heike}, year={2007}, pages={3--17} }"},"publication":"Electr. Notes Theor. Comput. Sci.","_id":"3213","page":"3--17","user_id":"29719","doi":"10.1016/j.entcs.2006.08.041","author":[{"full_name":"Estler, H.{-}Christian","first_name":"H.{-}Christian","last_name":"Estler"},{"full_name":"Ruhroth, Thomas","first_name":"Thomas","last_name":"Ruhroth"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"status":"public","title":"Modelchecking Correctness of Refactorings - Some Experiments","year":"2007","date_updated":"2022-01-06T06:59:05Z"},{"department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-13T10:00:14Z","citation":{"ama":"Engels G, Güldali B, Soltenborn C, Wehrheim H. Assuring Consistency of Business Process Models and Web Services Using Visual Contracts. In: Sch{\\\"{u}}rr A, Nagl M, Z{\\\"{u}}ndorf A, eds. <i>Applications of Graph Transformations with Industrial Relevance, Third International Symposium, {AGTIVE} 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers</i>. Lecture Notes in Computer Science. ; 2007:17--31. doi:<a href=\"https://doi.org/10.1007/978-3-540-89020-1_2\">10.1007/978-3-540-89020-1_2</a>","bibtex":"@inproceedings{Engels_Güldali_Soltenborn_Wehrheim_2007, series={Lecture Notes in Computer Science}, title={Assuring Consistency of Business Process Models and Web Services Using Visual Contracts}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-89020-1_2\">10.1007/978-3-540-89020-1_2</a>}, booktitle={Applications of Graph Transformations with Industrial Relevance, Third International Symposium, {AGTIVE} 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers}, author={Engels, Gregor and Güldali, Baris and Soltenborn, Christian and Wehrheim, Heike}, editor={Sch{\\\"{u}}rr, Andy and Nagl, Manfred and Z{\\\"{u}}ndorf, AlbertEditors}, year={2007}, pages={17--31}, collection={Lecture Notes in Computer Science} }","mla":"Engels, Gregor, et al. “Assuring Consistency of Business Process Models and Web Services Using Visual Contracts.” <i>Applications of Graph Transformations with Industrial Relevance, Third International Symposium, {AGTIVE} 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers</i>, edited by Andy Sch{\\\"{u}}rr et al., 2007, pp. 17--31, doi:<a href=\"https://doi.org/10.1007/978-3-540-89020-1_2\">10.1007/978-3-540-89020-1_2</a>.","chicago":"Engels, Gregor, Baris Güldali, Christian Soltenborn, and Heike Wehrheim. “Assuring Consistency of Business Process Models and Web Services Using Visual Contracts.” In <i>Applications of Graph Transformations with Industrial Relevance, Third International Symposium, {AGTIVE} 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers</i>, edited by Andy Sch{\\\"{u}}rr, Manfred Nagl, and Albert Z{\\\"{u}}ndorf, 17--31. Lecture Notes in Computer Science, 2007. <a href=\"https://doi.org/10.1007/978-3-540-89020-1_2\">https://doi.org/10.1007/978-3-540-89020-1_2</a>.","short":"G. Engels, B. Güldali, C. Soltenborn, H. Wehrheim, in: A. Sch{\\\"{u}}rr, M. Nagl, A. Z{\\\"{u}}ndorf (Eds.), Applications of Graph Transformations with Industrial Relevance, Third International Symposium, {AGTIVE} 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers, 2007, pp. 17--31.","apa":"Engels, G., Güldali, B., Soltenborn, C., &#38; Wehrheim, H. (2007). Assuring Consistency of Business Process Models and Web Services Using Visual Contracts. In A. Sch{\\\"{u}}rr, M. Nagl, &#38; A. Z{\\\"{u}}ndorf (Eds.), <i>Applications of Graph Transformations with Industrial Relevance, Third International Symposium, {AGTIVE} 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers</i> (pp. 17--31). <a href=\"https://doi.org/10.1007/978-3-540-89020-1_2\">https://doi.org/10.1007/978-3-540-89020-1_2</a>","ieee":"G. Engels, B. Güldali, C. Soltenborn, and H. Wehrheim, “Assuring Consistency of Business Process Models and Web Services Using Visual Contracts,” in <i>Applications of Graph Transformations with Industrial Relevance, Third International Symposium, {AGTIVE} 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers</i>, 2007, pp. 17--31."},"publication":"Applications of Graph Transformations with Industrial Relevance, Third International Symposium, {AGTIVE} 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers","editor":[{"last_name":"Sch{\\\"{u}}rr","first_name":"Andy","full_name":"Sch{\\\"{u}}rr, Andy"},{"full_name":"Nagl, Manfred","first_name":"Manfred","last_name":"Nagl"},{"last_name":"Z{\\\"{u}}ndorf","first_name":"Albert","full_name":"Z{\\\"{u}}ndorf, Albert"}],"user_id":"14955","doi":"10.1007/978-3-540-89020-1_2","language":[{"iso":"eng"}],"_id":"3214","series_title":"Lecture Notes in Computer Science","page":"17--31","date_updated":"2022-01-06T06:59:05Z","author":[{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"},{"full_name":"Güldali, Baris","first_name":"Baris","last_name":"Güldali"},{"id":"1737","full_name":"Soltenborn, Christian","orcid":"0000-0002-0342-8227","last_name":"Soltenborn","first_name":"Christian"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"status":"public","title":"Assuring Consistency of Business Process Models and Web Services Using Visual Contracts","year":"2007"},{"citation":{"short":"G. Engels, C. Soltenborn, H. Wehrheim, in: M. M. Bonsangue, E. Broch Johnsen (Eds.), Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings, 2007, pp. 76--90.","chicago":"Engels, Gregor, Christian Soltenborn, and Heike Wehrheim. “Analysis of {UML} Activities Using Dynamic Meta Modeling.” In <i>Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings</i>, edited by Marcello M. Bonsangue and Einar Broch Johnsen, 76--90. Lecture Notes in Computer Science, 2007. <a href=\"https://doi.org/10.1007/978-3-540-72952-5_5\">https://doi.org/10.1007/978-3-540-72952-5_5</a>.","ieee":"G. Engels, C. Soltenborn, and H. Wehrheim, “Analysis of {UML} Activities Using Dynamic Meta Modeling,” in <i>Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings</i>, 2007, pp. 76--90.","apa":"Engels, G., Soltenborn, C., &#38; Wehrheim, H. (2007). Analysis of {UML} Activities Using Dynamic Meta Modeling. In M. M. Bonsangue &#38; E. Broch Johnsen (Eds.), <i>Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings</i> (pp. 76--90). <a href=\"https://doi.org/10.1007/978-3-540-72952-5_5\">https://doi.org/10.1007/978-3-540-72952-5_5</a>","bibtex":"@inproceedings{Engels_Soltenborn_Wehrheim_2007, series={Lecture Notes in Computer Science}, title={Analysis of {UML} Activities Using Dynamic Meta Modeling}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-72952-5_5\">10.1007/978-3-540-72952-5_5</a>}, booktitle={Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings}, author={Engels, Gregor and Soltenborn, Christian and Wehrheim, Heike}, editor={M. Bonsangue, Marcello and Broch Johnsen, EinarEditors}, year={2007}, pages={76--90}, collection={Lecture Notes in Computer Science} }","ama":"Engels G, Soltenborn C, Wehrheim H. Analysis of {UML} Activities Using Dynamic Meta Modeling. In: M. Bonsangue M, Broch Johnsen E, eds. <i>Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings</i>. Lecture Notes in Computer Science. ; 2007:76--90. doi:<a href=\"https://doi.org/10.1007/978-3-540-72952-5_5\">10.1007/978-3-540-72952-5_5</a>","mla":"Engels, Gregor, et al. “Analysis of {UML} Activities Using Dynamic Meta Modeling.” <i>Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings</i>, edited by Marcello M. Bonsangue and Einar Broch Johnsen, 2007, pp. 76--90, doi:<a href=\"https://doi.org/10.1007/978-3-540-72952-5_5\">10.1007/978-3-540-72952-5_5</a>."},"publication":"Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings","department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-13T10:01:31Z","date_updated":"2022-01-06T06:59:05Z","author":[{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"},{"id":"1737","last_name":"Soltenborn","first_name":"Christian","orcid":"0000-0002-0342-8227","full_name":"Soltenborn, Christian"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"year":"2007","title":"Analysis of {UML} Activities Using Dynamic Meta Modeling","status":"public","editor":[{"first_name":"Marcello","last_name":"M. Bonsangue","full_name":"M. Bonsangue, Marcello"},{"full_name":"Broch Johnsen, Einar","last_name":"Broch Johnsen","first_name":"Einar"}],"user_id":"14955","doi":"10.1007/978-3-540-72952-5_5","series_title":"Lecture Notes in Computer Science","_id":"3215","language":[{"iso":"eng"}],"page":"76--90"},{"page":"236--251","_id":"3216","series_title":"Lecture Notes in Computer Science","user_id":"29719","doi":"10.1007/978-3-540-72952-5_15","editor":[{"last_name":"M. Bonsangue","first_name":"Marcello","full_name":"M. Bonsangue, Marcello"},{"full_name":"Broch Johnsen, Einar","last_name":"Broch Johnsen","first_name":"Einar"}],"status":"public","title":"Refactoring Object-Oriented Specifications with Data and Processes","year":"2007","author":[{"first_name":"Thomas","last_name":"Ruhroth","full_name":"Ruhroth, Thomas"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"date_updated":"2022-01-06T06:59:05Z","date_created":"2018-06-13T10:03:09Z","type":"conference","department":[{"_id":"77"}],"publication":"Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings","citation":{"ama":"Ruhroth T, Wehrheim H. Refactoring Object-Oriented Specifications with Data and Processes. In: M. Bonsangue M, Broch Johnsen E, eds. <i>Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings</i>. Lecture Notes in Computer Science. ; 2007:236--251. doi:<a href=\"https://doi.org/10.1007/978-3-540-72952-5_15\">10.1007/978-3-540-72952-5_15</a>","bibtex":"@inproceedings{Ruhroth_Wehrheim_2007, series={Lecture Notes in Computer Science}, title={Refactoring Object-Oriented Specifications with Data and Processes}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-72952-5_15\">10.1007/978-3-540-72952-5_15</a>}, booktitle={Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings}, author={Ruhroth, Thomas and Wehrheim, Heike}, editor={M. Bonsangue, Marcello and Broch Johnsen, EinarEditors}, year={2007}, pages={236--251}, collection={Lecture Notes in Computer Science} }","mla":"Ruhroth, Thomas, and Heike Wehrheim. “Refactoring Object-Oriented Specifications with Data and Processes.” <i>Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings</i>, edited by Marcello M. Bonsangue and Einar Broch Johnsen, 2007, pp. 236--251, doi:<a href=\"https://doi.org/10.1007/978-3-540-72952-5_15\">10.1007/978-3-540-72952-5_15</a>.","chicago":"Ruhroth, Thomas, and Heike Wehrheim. “Refactoring Object-Oriented Specifications with Data and Processes.” In <i>Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings</i>, edited by Marcello M. Bonsangue and Einar Broch Johnsen, 236--251. Lecture Notes in Computer Science, 2007. <a href=\"https://doi.org/10.1007/978-3-540-72952-5_15\">https://doi.org/10.1007/978-3-540-72952-5_15</a>.","short":"T. Ruhroth, H. Wehrheim, in: M. M. Bonsangue, E. Broch Johnsen (Eds.), Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings, 2007, pp. 236--251.","apa":"Ruhroth, T., &#38; Wehrheim, H. (2007). Refactoring Object-Oriented Specifications with Data and Processes. In M. M. Bonsangue &#38; E. Broch Johnsen (Eds.), <i>Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings</i> (pp. 236--251). <a href=\"https://doi.org/10.1007/978-3-540-72952-5_15\">https://doi.org/10.1007/978-3-540-72952-5_15</a>","ieee":"T. Ruhroth and H. Wehrheim, “Refactoring Object-Oriented Specifications with Data and Processes,” in <i>Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings</i>, 2007, pp. 236--251."}},{"department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-14T06:30:41Z","citation":{"apa":"Schäfer, W., &#38; Wehrheim, H. (2007). The Challenges of Building Advanced Mechatronic Systems. In L. C. Briand &#38; A. L. Wolf (Eds.), <i>International Conference on Software Engineering, {ISCE} 2007, Workshop on the Future of Software Engineering, {FOSE} 2007, May 23-25, 2007, Minneapolis, MN, {USA}</i> (pp. 72--84). <a href=\"https://doi.org/10.1109/FOSE.2007.28\">https://doi.org/10.1109/FOSE.2007.28</a>","ieee":"W. Schäfer and H. Wehrheim, “The Challenges of Building Advanced Mechatronic Systems,” in <i>International Conference on Software Engineering, {ISCE} 2007, Workshop on the Future of Software Engineering, {FOSE} 2007, May 23-25, 2007, Minneapolis, MN, {USA}</i>, 2007, pp. 72--84.","chicago":"Schäfer, Wilhelm, and Heike Wehrheim. “The Challenges of Building Advanced Mechatronic Systems.” In <i>International Conference on Software Engineering, {ISCE} 2007, Workshop on the Future of Software Engineering, {FOSE} 2007, May 23-25, 2007, Minneapolis, MN, {USA}</i>, edited by Lionel C. Briand and Alexander L. Wolf, 72--84, 2007. <a href=\"https://doi.org/10.1109/FOSE.2007.28\">https://doi.org/10.1109/FOSE.2007.28</a>.","short":"W. Schäfer, H. Wehrheim, in: L. C. Briand, A. L. Wolf (Eds.), International Conference on Software Engineering, {ISCE} 2007, Workshop on the Future of Software Engineering, {FOSE} 2007, May 23-25, 2007, Minneapolis, MN, {USA}, 2007, pp. 72--84.","mla":"Schäfer, Wilhelm, and Heike Wehrheim. “The Challenges of Building Advanced Mechatronic Systems.” <i>International Conference on Software Engineering, {ISCE} 2007, Workshop on the Future of Software Engineering, {FOSE} 2007, May 23-25, 2007, Minneapolis, MN, {USA}</i>, edited by Lionel C. Briand and Alexander L. Wolf, 2007, pp. 72--84, doi:<a href=\"https://doi.org/10.1109/FOSE.2007.28\">10.1109/FOSE.2007.28</a>.","ama":"Schäfer W, Wehrheim H. The Challenges of Building Advanced Mechatronic Systems. In: C. Briand L, L. Wolf A, eds. <i>International Conference on Software Engineering, {ISCE} 2007, Workshop on the Future of Software Engineering, {FOSE} 2007, May 23-25, 2007, Minneapolis, MN, {USA}</i>. ; 2007:72--84. doi:<a href=\"https://doi.org/10.1109/FOSE.2007.28\">10.1109/FOSE.2007.28</a>","bibtex":"@inproceedings{Schäfer_Wehrheim_2007, title={The Challenges of Building Advanced Mechatronic Systems}, DOI={<a href=\"https://doi.org/10.1109/FOSE.2007.28\">10.1109/FOSE.2007.28</a>}, booktitle={International Conference on Software Engineering, {ISCE} 2007, Workshop on the Future of Software Engineering, {FOSE} 2007, May 23-25, 2007, Minneapolis, MN, {USA}}, author={Schäfer, Wilhelm and Wehrheim, Heike}, editor={C. Briand, Lionel and L. Wolf, AlexanderEditors}, year={2007}, pages={72--84} }"},"publication":"International Conference on Software Engineering, {ISCE} 2007, Workshop on the Future of Software Engineering, {FOSE} 2007, May 23-25, 2007, Minneapolis, MN, {USA}","editor":[{"full_name":"C. Briand, Lionel","last_name":"C. Briand","first_name":"Lionel"},{"first_name":"Alexander","last_name":"L. Wolf","full_name":"L. Wolf, Alexander"}],"user_id":"29719","doi":"10.1109/FOSE.2007.28","_id":"3221","page":"72--84","date_updated":"2022-01-06T06:59:05Z","author":[{"first_name":"Wilhelm","last_name":"Schäfer","full_name":"Schäfer, Wilhelm"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"status":"public","title":"The Challenges of Building Advanced Mechatronic Systems","year":"2007"},{"date_created":"2018-06-14T06:32:05Z","department":[{"_id":"77"}],"type":"conference","citation":{"mla":"Derrick, John, et al. “Proving Linearizability Via Non-Atomic Refinement.” <i>Integrated Formal Methods, 6th International Conference, {IFM} 2007, Oxford, UK, July 2-5, 2007, Proceedings</i>, edited by Jim Davies and Jeremy Gibbons, 2007, pp. 195--214, doi:<a href=\"https://doi.org/10.1007/978-3-540-73210-5_11\">10.1007/978-3-540-73210-5_11</a>.","ama":"Derrick J, Schellhorn G, Wehrheim H. Proving Linearizability Via Non-atomic Refinement. In: Davies J, Gibbons J, eds. <i>Integrated Formal Methods, 6th International Conference, {IFM} 2007, Oxford, UK, July 2-5, 2007, Proceedings</i>. Lecture Notes in Computer Science. ; 2007:195--214. doi:<a href=\"https://doi.org/10.1007/978-3-540-73210-5_11\">10.1007/978-3-540-73210-5_11</a>","bibtex":"@inproceedings{Derrick_Schellhorn_Wehrheim_2007, series={Lecture Notes in Computer Science}, title={Proving Linearizability Via Non-atomic Refinement}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-73210-5_11\">10.1007/978-3-540-73210-5_11</a>}, booktitle={Integrated Formal Methods, 6th International Conference, {IFM} 2007, Oxford, UK, July 2-5, 2007, Proceedings}, author={Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}, editor={Davies, Jim and Gibbons, JeremyEditors}, year={2007}, pages={195--214}, collection={Lecture Notes in Computer Science} }","apa":"Derrick, J., Schellhorn, G., &#38; Wehrheim, H. (2007). Proving Linearizability Via Non-atomic Refinement. In J. Davies &#38; J. Gibbons (Eds.), <i>Integrated Formal Methods, 6th International Conference, {IFM} 2007, Oxford, UK, July 2-5, 2007, Proceedings</i> (pp. 195--214). <a href=\"https://doi.org/10.1007/978-3-540-73210-5_11\">https://doi.org/10.1007/978-3-540-73210-5_11</a>","ieee":"J. Derrick, G. Schellhorn, and H. Wehrheim, “Proving Linearizability Via Non-atomic Refinement,” in <i>Integrated Formal Methods, 6th International Conference, {IFM} 2007, Oxford, UK, July 2-5, 2007, Proceedings</i>, 2007, pp. 195--214.","chicago":"Derrick, John, Gerhard Schellhorn, and Heike Wehrheim. “Proving Linearizability Via Non-Atomic Refinement.” In <i>Integrated Formal Methods, 6th International Conference, {IFM} 2007, Oxford, UK, July 2-5, 2007, Proceedings</i>, edited by Jim Davies and Jeremy Gibbons, 195--214. Lecture Notes in Computer Science, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73210-5_11\">https://doi.org/10.1007/978-3-540-73210-5_11</a>.","short":"J. Derrick, G. Schellhorn, H. Wehrheim, in: J. Davies, J. Gibbons (Eds.), Integrated Formal Methods, 6th International Conference, {IFM} 2007, Oxford, UK, July 2-5, 2007, Proceedings, 2007, pp. 195--214."},"publication":"Integrated Formal Methods, 6th International Conference, {IFM} 2007, Oxford, UK, July 2-5, 2007, Proceedings","_id":"3222","series_title":"Lecture Notes in Computer Science","page":"195--214","editor":[{"full_name":"Davies, Jim","last_name":"Davies","first_name":"Jim"},{"full_name":"Gibbons, Jeremy","first_name":"Jeremy","last_name":"Gibbons"}],"doi":"10.1007/978-3-540-73210-5_11","user_id":"29719","author":[{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"},{"first_name":"Gerhard","last_name":"Schellhorn","full_name":"Schellhorn, Gerhard"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"status":"public","title":"Proving Linearizability Via Non-atomic Refinement","year":"2007","date_updated":"2022-01-06T06:59:05Z"},{"date_updated":"2022-01-06T06:58:46Z","title":"Tamper Resistance of AES -- Models, Attacks and Countermeasures","year":"2007","status":"public","author":[{"full_name":"Krummel, Volker","first_name":"Volker","last_name":"Krummel"}],"user_id":"25078","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466-20080110018"}],"_id":"2912","publisher":"Universität Paderborn","citation":{"apa":"Krummel, V. (2007). <i>Tamper Resistance of AES -- Models, Attacks and Countermeasures</i>. Universität Paderborn.","mla":"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.","short":"V. Krummel, Tamper Resistance of AES -- Models, Attacks and Countermeasures, Universität Paderborn, 2007.","chicago":"Krummel, Volker. <i>Tamper Resistance of AES -- Models, Attacks and Countermeasures</i>. Universität Paderborn, 2007.","bibtex":"@book{Krummel_2007, title={Tamper Resistance of AES -- Models, Attacks and Countermeasures}, publisher={Universität Paderborn}, author={Krummel, Volker}, year={2007} }"},"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"type":"dissertation","department":[{"_id":"64"}],"date_created":"2018-05-25T10:49:53Z"},{"type":"book_chapter","department":[{"_id":"64"}],"oa":"1","date_created":"2018-06-05T08:12:18Z","place":"Berlin, Heidelberg","publication":"Selected Areas in Cryptography","citation":{"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} }","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>","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.","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>"},"user_id":"25078","doi":"10.1007/978-3-540-77360-3_7","page":"96-109","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2007/282"}],"_id":"3002","publisher":"Springer Berlin Heidelberg","publication_status":"published","date_updated":"2022-01-06T06:58:50Z","status":"public","year":"2007","title":"Analysis of Countermeasures Against Access Driven Cache Attacks on AES","author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"full_name":"Krummel, Volker","first_name":"Volker","last_name":"Krummel"}],"publication_identifier":{"isbn":["9783540773597"]}},{"place":"Berlin, Heidelberg","date_created":"2018-06-05T08:26:03Z","type":"book_chapter","department":[{"_id":"64"}],"publication":"Advances in Cryptology — CRYPTO 2002","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>.","short":"A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 242–256.","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.","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} }","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>","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>."},"page":"242-256","publisher":"Springer Berlin Heidelberg","_id":"3019","doi":"10.1007/3-540-45708-9_16","user_id":"25078","year":"2007","status":"public","title":"Cryptanalysis of Unbalanced RSA with Small CRT-Exponent","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540440505","9783540457084"]},"author":[{"last_name":"May","first_name":"Alexander","full_name":"May, Alexander"}],"date_updated":"2022-01-06T06:58:51Z","publication_status":"published"},{"date_updated":"2022-01-06T06:58:51Z","publication_status":"published","publication_identifier":{"isbn":["9783540424888","9783540446705"],"issn":["0302-9743"]},"author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"full_name":"May, Alexander","first_name":"Alexander","last_name":"May"}],"title":"Low Secret Exponent RSA Revisited","year":"2007","status":"public","doi":"10.1007/3-540-44670-2_2","user_id":"25078","publisher":"Springer Berlin Heidelberg","_id":"3020","page":"4-19","citation":{"short":"J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 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>.","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>","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>","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>."},"publication":"Lecture Notes in Computer Science","department":[{"_id":"64"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2018-06-05T08:26:29Z"},{"publication":"Selected Areas in Cryptography","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>","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.","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>.","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>","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."},"type":"book_chapter","department":[{"_id":"64"}],"place":"Berlin, Heidelberg","date_created":"2018-06-05T08:26:50Z","date_updated":"2022-01-06T06:58:51Z","publication_status":"published","title":"Key Revocation with Interval Cover Families","status":"public","year":"2007","author":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"},{"full_name":"May, Alexander","last_name":"May","first_name":"Alexander"}],"publication_identifier":{"isbn":["9783540430667","9783540455370"],"issn":["0302-9743"]},"doi":"10.1007/3-540-45537-x_26","user_id":"25078","page":"325-341","publisher":"Springer Berlin Heidelberg","_id":"3021"},{"page":"110-125","publisher":"Springer Berlin Heidelberg","_id":"3022","doi":"10.1007/3-540-44670-2_10","user_id":"25078","title":"Dimension Reduction Methods for Convolution Modular Lattices","year":"2007","status":"public","publication_identifier":{"isbn":["9783540424888","9783540446705"],"issn":["0302-9743"]},"author":[{"full_name":"May, Alexander","last_name":"May","first_name":"Alexander"},{"full_name":"Silverman, Joseph H.","first_name":"Joseph H.","last_name":"Silverman"}],"date_updated":"2022-01-06T06:58:51Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2018-06-05T08:27:10Z","type":"book_chapter","department":[{"_id":"64"}],"publication":"Lecture Notes in Computer Science","citation":{"chicago":"May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.” In <i>Lecture Notes in Computer Science</i>, 110–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-44670-2_10\">https://doi.org/10.1007/3-540-44670-2_10</a>.","short":"A. May, J.H. Silverman, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 110–125.","ieee":"A. May and J. H. Silverman, “Dimension Reduction Methods for Convolution Modular Lattices,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 110–125.","apa":"May, A., &#38; Silverman, J. H. (2007). Dimension Reduction Methods for Convolution Modular Lattices. In <i>Lecture Notes in Computer Science</i> (pp. 110–125). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-44670-2_10\">https://doi.org/10.1007/3-540-44670-2_10</a>","bibtex":"@inbook{May_Silverman_2007, place={Berlin, Heidelberg}, title={Dimension Reduction Methods for Convolution Modular Lattices}, DOI={<a href=\"https://doi.org/10.1007/3-540-44670-2_10\">10.1007/3-540-44670-2_10</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={May, Alexander and Silverman, Joseph H.}, year={2007}, pages={110–125} }","ama":"May A, Silverman JH. Dimension Reduction Methods for Convolution Modular Lattices. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:110-125. doi:<a href=\"https://doi.org/10.1007/3-540-44670-2_10\">10.1007/3-540-44670-2_10</a>","mla":"May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2007, pp. 110–25, doi:<a href=\"https://doi.org/10.1007/3-540-44670-2_10\">10.1007/3-540-44670-2_10</a>."}},{"department":[{"_id":"64"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2018-06-05T08:28:39Z","citation":{"bibtex":"@inbook{Blömer_2007, place={Berlin, Heidelberg}, title={A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers}, DOI={<a href=\"https://doi.org/10.1007/3-540-68530-8_13\">10.1007/3-540-68530-8_13</a>}, booktitle={Algorithms — ESA’ 98}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={2007}, pages={151–162} }","ama":"Blömer J. A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In: <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:151-162. doi:<a href=\"https://doi.org/10.1007/3-540-68530-8_13\">10.1007/3-540-68530-8_13</a>","mla":"Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” <i>Algorithms — ESA’ 98</i>, Springer Berlin Heidelberg, 2007, pp. 151–62, doi:<a href=\"https://doi.org/10.1007/3-540-68530-8_13\">10.1007/3-540-68530-8_13</a>.","short":"J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 151–162.","chicago":"Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” In <i>Algorithms — ESA’ 98</i>, 151–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-68530-8_13\">https://doi.org/10.1007/3-540-68530-8_13</a>.","ieee":"J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,” in <i>Algorithms — ESA’ 98</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 151–162.","apa":"Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In <i>Algorithms — ESA’ 98</i> (pp. 151–162). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-68530-8_13\">https://doi.org/10.1007/3-540-68530-8_13</a>"},"publication":"Algorithms — ESA’ 98","doi":"10.1007/3-540-68530-8_13","user_id":"25078","publisher":"Springer Berlin Heidelberg","_id":"3026","page":"151-162","date_updated":"2022-01-06T06:58:51Z","publication_status":"published","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783540648482","9783540685302"]},"status":"public","title":"A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers","year":"2007"},{"type":"conference","department":[{"_id":"76"}],"date_created":"2021-01-13T10:18:05Z","publication":"Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina","citation":{"chicago":"Delic, A., Z. Avdagic, Wilhelm Schäfer, Dusanka Boskovic, and Matthias Meyer. “Program Evaluation Using Fuzzy Logic with Bad Smells as Inputs.” In <i>Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina</i>. Faculty of Electrical Engineering, University of Sarajevo, 2007.","short":"A. Delic, Z. Avdagic, W. Schäfer, D. Boskovic, M. Meyer, in: Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina, Faculty of Electrical Engineering, University of Sarajevo, 2007.","ama":"Delic A, Avdagic Z, Schäfer W, Boskovic D, Meyer M. Program evaluation using fuzzy logic with bad smells as inputs. In: <i>Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina</i>. Faculty of Electrical Engineering, University of Sarajevo; 2007.","bibtex":"@inproceedings{Delic_Avdagic_Schäfer_Boskovic_Meyer_2007, title={Program evaluation using fuzzy logic with bad smells as inputs}, booktitle={Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina}, publisher={Faculty of Electrical Engineering, University of Sarajevo}, author={Delic, A. and Avdagic, Z. and Schäfer, Wilhelm and Boskovic, Dusanka and Meyer, Matthias}, year={2007} }","apa":"Delic, A., Avdagic, Z., Schäfer, W., Boskovic, D., &#38; Meyer, M. (2007). Program evaluation using fuzzy logic with bad smells as inputs. <i>Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina</i>.","mla":"Delic, A., et al. “Program Evaluation Using Fuzzy Logic with Bad Smells as Inputs.” <i>Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina</i>, Faculty of Electrical Engineering, University of Sarajevo, 2007.","ieee":"A. Delic, Z. Avdagic, W. Schäfer, D. Boskovic, and M. Meyer, “Program evaluation using fuzzy logic with bad smells as inputs,” 2007."},"user_id":"5786","publisher":"Faculty of Electrical Engineering, University of Sarajevo","_id":"20949","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:42Z","year":"2007","title":"Program evaluation using fuzzy logic with bad smells as inputs","status":"public","author":[{"full_name":"Delic, A.","first_name":"A.","last_name":"Delic"},{"full_name":"Avdagic, Z.","last_name":"Avdagic","first_name":"Z."},{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"},{"full_name":"Boskovic, Dusanka","first_name":"Dusanka","last_name":"Boskovic"},{"last_name":"Meyer","first_name":"Matthias","full_name":"Meyer, Matthias","id":"683"}]},{"date_created":"2020-08-03T14:26:31Z","type":"journal_article","department":[{"_id":"63"}],"publication":"e-Strategies, www.britishpublishers.com","citation":{"short":"S. Leonardi, P. Mahlmann, F. Meyer auf der Heide, P.G. Spirakis, G. Weikum, E-Strategies, Www.Britishpublishers.Com 3-10–2007 (2007).","ama":"Leonardi S, Mahlmann P, Meyer auf der Heide F, Spirakis PG, Weikum G. Guarding our digital society’s well-being. <i>e-Strategies, www.britishpublishers.com</i>. 2007;3-10-2007.","chicago":"Leonardi, Stefano, Peter Mahlmann, Friedhelm Meyer auf der Heide, Paul G. Spirakis, and Gerhard Weikum. “Guarding Our Digital Society’s Well-Being.” <i>E-Strategies, Www.Britishpublishers.Com</i> 3-10–2007 (2007).","bibtex":"@article{Leonardi_Mahlmann_Meyer auf der Heide_Spirakis_Weikum_2007, title={Guarding our digital society’s well-being}, volume={3-10–2007}, journal={e-Strategies, www.britishpublishers.com}, author={Leonardi, Stefano and Mahlmann, Peter and Meyer auf der Heide, Friedhelm and Spirakis, Paul G. and Weikum, Gerhard}, year={2007} }","apa":"Leonardi, S., Mahlmann, P., Meyer auf der Heide, F., Spirakis, P. G., &#38; Weikum, G. (2007). Guarding our digital society’s well-being. <i>E-Strategies, Www.Britishpublishers.Com</i>, <i>3</i>-<i>10</i>–<i>2007</i>.","mla":"Leonardi, Stefano, et al. “Guarding Our Digital Society’s Well-Being.” <i>E-Strategies, Www.Britishpublishers.Com</i>, vol. 3-10–2007, 2007.","ieee":"S. Leonardi, P. Mahlmann, F. Meyer auf der Heide, P. G. Spirakis, and G. Weikum, “Guarding our digital society’s well-being,” <i>e-Strategies, www.britishpublishers.com</i>, vol. 3-10–2007, 2007."},"language":[{"iso":"eng"}],"_id":"17567","user_id":"15415","volume":"3-10-2007","status":"public","year":"2007","title":"Guarding our digital society's well-being","author":[{"last_name":"Leonardi","first_name":"Stefano","full_name":"Leonardi, Stefano"},{"full_name":"Mahlmann, Peter","first_name":"Peter","last_name":"Mahlmann"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Paul G.","last_name":"Spirakis","full_name":"Spirakis, Paul G."},{"first_name":"Gerhard","last_name":"Weikum","full_name":"Weikum, Gerhard"}],"date_updated":"2022-01-06T06:53:15Z"},{"citation":{"mla":"Dynia, Miroslaw, et al. “Why Robots Need Maps.” <i>Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2007, pp. 37-- 46, doi:<a href=\"https://doi.org/10.1007/978-3-540-72951-8_5\">10.1007/978-3-540-72951-8_5</a>.","bibtex":"@inproceedings{Dynia_Łopuszański_Schindelhauer_2007, title={Why Robots Need Maps}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-72951-8_5\">10.1007/978-3-540-72951-8_5</a>}, booktitle={Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Dynia, Miroslaw and Łopuszański, Jakub and Schindelhauer, Christian}, year={2007}, pages={37-- 46} }","ama":"Dynia M, Łopuszański J, Schindelhauer C. Why Robots Need Maps. In: <i>Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>. ; 2007:37-- 46. doi:<a href=\"https://doi.org/10.1007/978-3-540-72951-8_5\">10.1007/978-3-540-72951-8_5</a>","ieee":"M. Dynia, J. Łopuszański, and C. Schindelhauer, “Why Robots Need Maps,” in <i>Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2007, pp. 37-- 46.","apa":"Dynia, M., Łopuszański, J., &#38; Schindelhauer, C. (2007). Why Robots Need Maps. In <i>Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)</i> (pp. 37-- 46). <a href=\"https://doi.org/10.1007/978-3-540-72951-8_5\">https://doi.org/10.1007/978-3-540-72951-8_5</a>","short":"M. Dynia, J. Łopuszański, C. Schindelhauer, in: Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO), 2007, pp. 37-- 46.","chicago":"Dynia, Miroslaw, Jakub Łopuszański, and Christian Schindelhauer. “Why Robots Need Maps.” In <i>Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 37-- 46, 2007. <a href=\"https://doi.org/10.1007/978-3-540-72951-8_5\">https://doi.org/10.1007/978-3-540-72951-8_5</a>."},"publication":"Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-03T10:24:29Z","publication_status":"published","date_updated":"2022-01-06T06:53:54Z","author":[{"full_name":"Dynia, Miroslaw","last_name":"Dynia","first_name":"Miroslaw"},{"first_name":"Jakub","last_name":"Łopuszański","full_name":"Łopuszański, Jakub"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"}],"publication_identifier":{"isbn":["9783540729181","9783540729518"]},"year":"2007","title":"Why Robots Need Maps","status":"public","user_id":"15415","doi":"10.1007/978-3-540-72951-8_5","_id":"18928","language":[{"iso":"eng"}],"page":"37-- 46"}]