@inproceedings{5862,
  author       = {{Jager, Tibor and Kurek, Rafael and Pan, Jiaxin}},
  booktitle    = {{Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part III}},
  pages        = {{490--518}},
  title        = {{{Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH}}},
  doi          = {{10.1007/978-3-030-03332-3_18}},
  year         = {{2018}},
}

@misc{5936,
  author       = {{Scheibl, Manuel}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Learning about learning curves from dataset properties}}},
  year         = {{2018}},
}

@article{5984,
  author       = {{Scheideler, Christian}},
  journal      = {{Theor. Comput. Sci.}},
  pages        = {{1}},
  title        = {{{Preface}}},
  doi          = {{10.1016/j.tcs.2018.11.004}},
  volume       = {{751}},
  year         = {{2018}},
}

@inproceedings{5985,
  author       = {{Scheideler, Christian}},
  booktitle    = {{Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018}},
  pages        = {{1--2}},
  title        = {{{Relays: Towards a Link Layer for Robust and Secure Fog Computing}}},
  doi          = {{10.1145/3229774.3229781}},
  year         = {{2018}},
}

@inproceedings{5986,
  author       = {{Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian}},
  booktitle    = {{43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK}},
  pages        = {{52:1--52:15}},
  title        = {{{Shape Recognition by a Finite Automaton Robot}}},
  doi          = {{10.4230/LIPIcs.MFCS.2018.52}},
  year         = {{2018}},
}

@inproceedings{6016,
  author       = {{Peuster, Manuel and Karl, Holger}},
  booktitle    = {{IEEE/IFIP 14th International Conference on Network and Service Management (CNSM)}},
  location     = {{Rome}},
  publisher    = {{IEEE/IFIP}},
  title        = {{{Understand your chains and keep your deadlines: Introducing time-constrained profiling for NFV}}},
  year         = {{2018}},
}

@inproceedings{6236,
  author       = {{Yigitbas, Enes and Anjorin, Anthony and Jovanovikj, Ivan and Kern, Thomas and Sauer, Stefan and Engels, Gregor}},
  booktitle    = {{Proceedings of the 7th International Working Conference on Human-Centered Software Engineering (HCSE'18)}},
  pages        = {{231--247}},
  publisher    = {{Springer, LNCS }},
  title        = {{{Usability Evaluation of Model-Driven Cross-Device Web User Interfaces}}},
  year         = {{2018}},
}

@inproceedings{6252,
  author       = {{Senft, Björn and Oberthür, Simon and Fischer, Holger Gerhard}},
  booktitle    = {{Schriften zur allgemeinen Hochschuldidaktik - Band 3. Tagungsband Forschendes Lernen - The wider view}},
  isbn         = {{978 3-95987-088-7}},
  title        = {{{Forschendes Lernen in der Informatik - In praxisnaher Projektgruppe einen Softwareentwicklungsprozess erforschen}}},
  year         = {{2018}},
}

@inbook{6253,
  author       = {{Senft, Björn and Fischer, Holger Gerhard and Oberthür, Simon and Patkar, Nitish}},
  booktitle    = {{Design, User Experience, and Usability: Theory and Practice}},
  isbn         = {{9783319917962}},
  issn         = {{0302-9743}},
  location     = {{Las Vegas, USA}},
  pages        = {{758--770}},
  publisher    = {{Springer International Publishing}},
  title        = {{{Assist Users to Straightaway Suggest and Describe Experienced Problems}}},
  doi          = {{10.1007/978-3-319-91797-9_52}},
  volume       = {{10918}},
  year         = {{2018}},
}

@inbook{6254,
  author       = {{Fischer, Holger Gerhard and Senft, Björn and Rittmeier, Florian and Sauer, Stefan}},
  booktitle    = {{Design, User Experience, and Usability: Theory and Practice. Proceedings of the 20th International Conference on Human-Computer Interaktion (HCI International 2018)}},
  editor       = {{Marcus, Aaron and Wang, Wentao}},
  isbn         = {{9783319917962}},
  issn         = {{0302-9743}},
  location     = {{Las Vegas, USA}},
  pages        = {{711--724}},
  publisher    = {{Springer International Publishing}},
  title        = {{{A Canvas Method to Foster Interdisciplinary Discussions on Digital Assistance Systems}}},
  doi          = {{10.1007/978-3-319-91797-9_49}},
  volume       = {{10918}},
  year         = {{2018}},
}

@article{63,
  author       = {{Althaus, Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}},
  journal      = {{Journal of Scheduling}},
  number       = {{1}},
  pages        = {{77--92}},
  publisher    = {{Springer}},
  title        = {{{Scheduling Shared Continuous Resources on Many-Cores}}},
  doi          = {{10.1007/s10951-017-0518-0}},
  volume       = {{21}},
  year         = {{2018}},
}

@inbook{6423,
  author       = {{Schäfer, Dirk and Hüllermeier, Eyke}},
  booktitle    = {{Discovery Science}},
  isbn         = {{9783030017705}},
  issn         = {{0302-9743}},
  pages        = {{161--175}},
  publisher    = {{Springer International Publishing}},
  title        = {{{Preference-Based Reinforcement Learning Using Dyad Ranking}}},
  doi          = {{10.1007/978-3-030-01771-2_11}},
  year         = {{2018}},
}

@inproceedings{4411,
  abstract     = {{While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures.
Considering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.
In this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.
The data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.
Especially, longest prefix matching for $x$ can be done in $\mathcal{O}(\log |x|)$ hash table read accesses.
We show how to maintain the structure in a self-stabilizing way.
Our protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys.}},
  author       = {{Knollmann, Till and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}},
  editor       = {{Izumi, Taisuke and Kuznetsov, Petr}},
  keywords     = {{Self-Stabilizing, Prefix Search, Distributed Data Structure}},
  location     = {{Tokyo}},
  publisher    = {{Springer, Cham}},
  title        = {{{A Self-Stabilizing Hashed Patricia Trie}}},
  doi          = {{10.1007/978-3-030-03232-6_1}},
  volume       = {{11201}},
  year         = {{2018}},
}

@inproceedings{4563,
  abstract     = {{Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.

In this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\mathcal{O}\left(\log ^2 n\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.
}},
  author       = {{Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}},
  booktitle    = {{Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) }},
  keywords     = {{greedy routing, ad hoc networks, convex hulls, c-competitiveness}},
  location     = {{Helsinki}},
  publisher    = {{Springer}},
  title        = {{{Competitive Routing in Hybrid Communication Networks}}},
  year         = {{2018}},
}

@inproceedings{4565,
  author       = {{Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}},
  booktitle    = {{Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)}},
  isbn         = {{9781450357999}},
  location     = {{Wien}},
  publisher    = {{ACM Press}},
  title        = {{{Brief Announcement: Competitive Routing in Hybrid Communication Networks}}},
  doi          = {{10.1145/3210377.3210663}},
  year         = {{2018}},
}

@inproceedings{7570,
  author       = {{Meyer auf der Heide, Friedhelm and Schaefer, Johannes Sebastian}},
  booktitle    = {{Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA '18}},
  isbn         = {{9781450357999}},
  location     = {{Vienna}},
  publisher    = {{ACM Press}},
  title        = {{{Brief Announcement: Communication in Systems of Home Based Mobile Agents}}},
  doi          = {{10.1145/3210377.3210662}},
  year         = {{2018}},
}

@misc{8844,
  author       = {{Jovanovikj, Ivan and Güldali, Baris}},
  title        = {{{Presentation: Who Guards the Guards? On the Validation of Test Case Migration}}},
  year         = {{2018}},
}

@article{9606,
  author       = {{Liu, Jia and Jager, Tibor and Kakvi, Saqib and Warinschi, Bogdan}},
  issn         = {{0925-1022}},
  journal      = {{Designs, Codes and Cryptography}},
  pages        = {{2549--2586}},
  title        = {{{How to build time-lock encryption}}},
  doi          = {{10.1007/s10623-018-0461-x}},
  year         = {{2018}},
}

@inproceedings{4236,
  author       = {{Wachsmuth, Henning and Stede, Manfred and El Baff, Roxanne and Al Khatib, Khalid and Skeppstedt, Maria and Stein, Benno}},
  booktitle    = {{Proceedings of the 27th International Conference on Computational Linguistics}},
  keywords     = {{argument}},
  pages        = {{3753--3765}},
  title        = {{{Argumentation Synthesis following Rhetorical Strategies}}},
  year         = {{2018}},
}

@inproceedings{4344,
  author       = {{Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}},
  booktitle    = {{29th International Symposium on Algorithms and Computation  (ISAAC 2018)}},
  isbn         = {{978-3-95977-094-1}},
  location     = {{Jiaoxi, Yilan County, Taiwan}},
  pages        = {{46:1----46:12}},
  publisher    = {{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}},
  title        = {{{Coresets for Fuzzy K-Means with Applications}}},
  doi          = {{10.4230/LIPIcs.ISAAC.2018.46}},
  year         = {{2018}},
}