@inproceedings{26181,
  abstract     = {{The paradigm shift from purchasing monolithic software solutions to a dynamic composition of individual solutions entails many new possibilities yet great challenges, too. In order to satisfy user requirements, complex services have to be automatically composed of elementary services. Multiple possibilities of composing a complex service inevitably emerge. The problem of selecting the most appropriate services has to be solved by comparing the different service candidates with respect to their quality in terms of inherent non-functional properties while simultaneously taking the user requirements into account.We are aiming for an integrated service rating and ranking methodology in order to support the automation of the underlying decision-making process. The main contribution of this paper is a first decomposition of the quality-based service selection process, while emphasizing major issues and challenges, which we are addressing in the On-The-Fly Computing project.}},
  author       = {{Jungmann, Alexander and Kleinjohann, Bernd}},
  booktitle    = {{Proceedings of the Fourth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}},
  pages        = {{43--47}},
  publisher    = {{Xpert Publishing Services}},
  title        = {{{Towards an Integrated Service Rating and Ranking Methodology for Quality Based Service Selection in Automatic Service Composition}}},
  year         = {{2012}},
}

@inproceedings{26190,
  abstract     = {{A major goal of the On-The-Fly Computing project is the automated composition of individual services based on services that are available in dynamic markets. Dependent on the granularity of a market, different alternatives that satisfy the requested functional requirements may emerge. In order to select the best solution, services are usually selected with respect to their quality in terms of inherent non-functional properties. In this paper, we describe our idea of how to model this service selection process as a Markov Decision Process, which we in turn intend to solve by means of Reinforcement Learning techniques in order to control the underlying service composition process. In addition, some initial issues with respect to our approach are addressed.}},
  author       = {{Jungmann, Alexander and Kleinjohann, Bernd}},
  booktitle    = {{Proceedings of the 9th IEEE International Conference on Services Computing (SCC)}},
  publisher    = {{IEEE}},
  title        = {{{Towards the Application of Reinforcement Learning Techniques for Quality-Based Service Selection in Automated Service Composition}}},
  year         = {{2012}},
}

@inproceedings{26212,
  author       = {{Khaluf, Yara and Weiss, Fabian and Micus, Sebastian}},
  booktitle    = {{The 10th IEEE International Symposium on Parallel and Distributed Processing with Applications}},
  title        = {{{Master Election for Time Synchronization in Swarm Robotic Systems}}},
  year         = {{2012}},
}

@inproceedings{26264,
  author       = {{Mathews, Emi and Mathew, Ciby}},
  booktitle    = {{Third International Conference on Networks & Communications, LNICST}},
  publisher    = {{Springer}},
  title        = {{{Connectivity of Autonomous Agents Using Ad-hoc Mobile Router Networks}}},
  year         = {{2012}},
}

@inproceedings{3812,
  author       = {{Wachsmuth, Henning and Stein, Benno}},
  booktitle    = {{Proceedings of COLING 2012: Posters}},
  pages        = {{1281--1290}},
  title        = {{{Optimal Scheduling of Information Extraction Algorithms}}},
  year         = {{2012}},
}

@inbook{2918,
  author       = {{Kakvi, Saqib and Kiltz, Eike and May, Alexander}},
  booktitle    = {{Advances in Cryptology – ASIACRYPT 2012}},
  isbn         = {{9783642349607}},
  issn         = {{0302-9743}},
  pages        = {{404--414}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Certifying RSA}}},
  doi          = {{10.1007/978-3-642-34961-4_25}},
  year         = {{2012}},
}

@inbook{2919,
  author       = {{Kakvi, Saqib and Kiltz, Eike}},
  booktitle    = {{Advances in Cryptology – EUROCRYPT 2012}},
  isbn         = {{9783642290107}},
  issn         = {{0302-9743}},
  pages        = {{537--553}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Optimal Security Proofs for Full Domain Hash, Revisited}}},
  doi          = {{10.1007/978-3-642-29011-4_32}},
  year         = {{2012}},
}

@inproceedings{2982,
  author       = {{Ackermann, Marcel Rudolf and Märtens, Marcus and Raupach, Christoph and Swierkot, Kamil and Lammersen, Christiane and Sohler, Christian}},
  publisher    = {{ACM}},
  title        = {{{StreamKM++: A clustering algorithm for data streams}}},
  doi          = {{10.1145/2133803.2184450}},
  volume       = {{17}},
  year         = {{2012}},
}

@article{2984,
  abstract     = {{Ich beschreibe die deutsche Enigma-VerschlÃ¼sselungsmaschine und skizziere, wie sie von den Codebrechern von Bletchely Park um Alan Turing gebrochen wurde. Besonderes Augenmerk lege ich auf die BeitrÃ¤ge Alan Turings und die Bedeutung seiner Leistung fÃ¼r die Entwicklung moderner Kryptografie. }},
  author       = {{Blömer, Johannes}},
  issn         = {{1432-122X}},
  journal      = {{Informatik-Spektrum}},
  number       = {{4}},
  title        = {{{Turing und Kryptografie}}},
  doi          = {{10.1007/s00287-012-0622-7}},
  volume       = {{35}},
  year         = {{2012}},
}

@phdthesis{3132,
  author       = {{Jager, Tibor}},
  isbn         = {{978-3-8348-1989-5}},
  publisher    = {{Ruhr University Bochum}},
  title        = {{{On black-box models of computation in cryptology}}},
  year         = {{2012}},
}

@inproceedings{3133,
  author       = {{Jager, Tibor and Kohlar, Florian and Schäge, Sven and Schwenk, Jörg}},
  booktitle    = {{Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings}},
  pages        = {{273----293}},
  title        = {{{On the Security of TLS-DHE in the Standard Model}}},
  doi          = {{10.1007/978-3-642-32009-5_17}},
  year         = {{2012}},
}

@inproceedings{3134,
  author       = {{Hofheinz, Dennis and Jager, Tibor}},
  booktitle    = {{Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings}},
  pages        = {{590----607}},
  title        = {{{Tightly Secure Signatures and Public-Key Encryption}}},
  doi          = {{10.1007/978-3-642-32009-5_35}},
  year         = {{2012}},
}

@inproceedings{3135,
  author       = {{Jager, Tibor and Schinzel, Sebastian and Somorovsky, Juraj}},
  booktitle    = {{Computer Security - ESORICS 2012 - 17th European Symposium on Research in Computer Security, Pisa, Italy, September 10-12, 2012. Proceedings}},
  pages        = {{752----769}},
  title        = {{{Bleichenbacher's Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption}}},
  doi          = {{10.1007/978-3-642-33167-1_43}},
  year         = {{2012}},
}

@inproceedings{3136,
  author       = {{Hofheinz, Dennis and Jager, Tibor and Knapp, Edward}},
  booktitle    = {{Public Key Cryptography - PKC 2012 - 15th International Conference on Practice and Theory in Public Key Cryptography, Darmstadt, Germany, May 21-23, 2012. Proceedings}},
  pages        = {{66----83}},
  title        = {{{Waters Signatures with Optimal Security Reduction}}},
  doi          = {{10.1007/978-3-642-30057-8_5}},
  year         = {{2012}},
}

@article{3180,
  author       = {{Travkin, Oleg and Wehrheim, Heike and Schellhorn, Gerhard}},
  journal      = {{{ECEASST}}},
  title        = {{{Proving Linearizability of Multiset with Local Proof Obligations}}},
  year         = {{2012}},
}

@article{3181,
  author       = {{Ruhroth, Thomas and Wehrheim, Heike}},
  journal      = {{Sci. Comput. Program.}},
  number       = {{3}},
  pages        = {{270----289}},
  title        = {{{Model evolution and refinement}}},
  doi          = {{10.1016/j.scico.2011.04.007}},
  year         = {{2012}},
}

@inproceedings{3182,
  author       = {{Schellhorn, Gerhard and Wehrheim, Heike and Derrick, John}},
  booktitle    = {{Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings}},
  editor       = {{Madhusudan, P. and A. Seshia, Sanjit}},
  pages        = {{243----259}},
  title        = {{{How to Prove Algorithms Linearisable}}},
  doi          = {{10.1007/978-3-642-31424-7_21}},
  year         = {{2012}},
}

@inproceedings{27176,
  abstract     = {{In this article we report on the experiences of a redesigned teaching in the field of computer science and society (IuG). The reasons for the redesign and the concept are outlined. We have condensed our experiences into theses: 1. Computer science and society should be a compulsory course in the bachelor's degree, in which students get an overview of which social framework conditions are relevant for them and how they can be incorporated into practice. 2. Historical contents of computer science are to be processed here by considering current developments in the context of their genesis.
}},
  author       = {{Engbring, Dieter and Selke, Harald}},
  editor       = {{Forbrig, Peter and  Rick, Detlef and  Schmolitzky, Axel}},
  pages        = {{111--116}},
  publisher    = {{Universit { \ "a} tsverlag Potsda}},
  title        = {{{Computer science and society as a field of computer science}}},
  volume       = {{5}},
  year         = {{2012}},
}

@inproceedings{27177,
  author       = {{Klompmaker, Florian and  Workowski,  Anke  and Thronicke, Wolfgang  and Ostermair, Florian and Willemsen, Detlev and Hoffmann, D}},
  title        = {{{User Centered Design of an Interactive Mobile Assistance and Supervision System for Rehabilitation Purposes}}},
  year         = {{2012}},
}

@inproceedings{27179,
  author       = {{Klompmaker, Florian and  Nebe, Karsten and Eschenlohr, Julien}},
  publisher    = {{Springer}},
  title        = {{{Towards Multimodal 3D Tabletop Interaction using Sensor Equipped Mobile Devices }}},
  year         = {{2012}},
}

