@inbook{17983,
author = {{Meer, Klaus and Ziegler, Martin}},
booktitle = {{Mathematical Foundations of Computer Science 2007}},
isbn = {{9783540744559}},
issn = {{0302-9743}},
title = {{{Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation}}},
doi = {{10.1007/978-3-540-74456-6_64}},
year = {{2007}},
}
@inbook{16640,
author = {{Monien, Burkhard and Preis, Robert}},
booktitle = {{Mathematical Foundations of Computer Science 2001}},
isbn = {{9783540424963}},
issn = {{0302-9743}},
title = {{{Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs}}},
doi = {{10.1007/3-540-44683-4_46}},
year = {{2007}},
}
@inproceedings{15144,
author = {{Böttcher, Stefan and Steinmetz, Rita}},
booktitle = {{Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24}},
isbn = {{9783540733898}},
issn = {{0302-9743}},
pages = {{101--113}},
publisher = {{Springer}},
title = {{{Evaluating XPath Queries on XML Data Streams}}},
doi = {{10.1007/978-3-540-73390-4_10}},
year = {{2007}},
}
@inproceedings{15146,
author = {{Böttcher, Stefan and Steinmetz, Rita}},
booktitle = {{Database and Expert Systems Applications, 18th International Conference, DEXA 2007}},
isbn = {{9783540744672}},
issn = {{0302-9743}},
pages = {{424--433}},
publisher = {{Springer}},
title = {{{Data Management for Mobile Ajax Web 2.0 Applications}}},
doi = {{10.1007/978-3-540-74469-6_42}},
year = {{2007}},
}
@inproceedings{19838,
author = {{Rührup, Stefan and Schindelhauer, Christian}},
booktitle = {{Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)}},
isbn = {{9783540496946}},
issn = {{0302-9743}},
title = {{{Online Multi-path Routing in a Maze}}},
doi = {{10.1007/11940128_65}},
year = {{2006}},
}
@inproceedings{24277,
abstract = {{We propose a dynamic, ad-hoc communication network consisting of mobile units that can warn about traffic jams on motorways.
Our goal is to provide a practical, low cost solution. Therefore we consider very simple wireless communication hardware, without collision detection, with very small bandwidth and a probabilistic model of link failure.
We provide a complete system architecture. For this purpose we design and analyze solutions for size approximation, leader election and broadcasting. Our algorithms are fine-tuned for fast operation in a practical setting. We provide both a theoretical and experimental evaluation of our solutions.
Our contribution is much different from the previous work, where either pure theoretical models with a pure theoretical analysis are provided or algorithms working in practical models are evaluated only through simulations.}},
author = {{Kutyłowski, Jarosław and Zagórski, Filip}},
booktitle = {{SOFSEM 2006: Theory and Practice of Computer Science}},
issn = {{0302-9743}},
title = {{{Reliable Broadcasting Without Collision Detection}}},
doi = {{10.1007/11611257_37}},
year = {{2006}},
}
@inbook{3004,
author = {{Blömer, Johannes and Krummel, Volker}},
booktitle = {{Lecture Notes in Computer Science}},
isbn = {{9783540462507}},
issn = {{0302-9743}},
pages = {{106--120}},
publisher = {{Springer Berlin Heidelberg}},
title = {{{Fault Based Collision Attacks on AES}}},
doi = {{10.1007/11889700_11}},
year = {{2006}},
}
@inbook{3005,
author = {{Blömer, Johannes and Otto, Martin}},
booktitle = {{Lecture Notes in Computer Science}},
isbn = {{9783540462507}},
issn = {{0302-9743}},
pages = {{13--23}},
publisher = {{Springer Berlin Heidelberg}},
title = {{{Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered}}},
doi = {{10.1007/11889700_2}},
year = {{2006}},
}
@inbook{3007,
author = {{Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}},
booktitle = {{Lecture Notes in Computer Science}},
isbn = {{9783540462507}},
issn = {{0302-9743}},
pages = {{36--52}},
publisher = {{Springer Berlin Heidelberg}},
title = {{{Sign Change Fault Attacks on Elliptic Curve Cryptosystems}}},
doi = {{10.1007/11889700_4}},
year = {{2006}},
}
@inproceedings{18926,
author = {{Dynia, Miroslaw and Korzeniowski, Miroslaw and Schindelhauer, Christian}},
booktitle = {{Architecture of Computing Systems - ARCS}},
isbn = {{9783540327653}},
issn = {{0302-9743}},
number = {{3894}},
pages = {{341----351}},
title = {{{Power-Aware Collective Tree Exploration}}},
doi = {{10.1007/11682127_24}},
year = {{2006}},
}
@inbook{17987,
author = {{Meer, Klaus and Ziegler, Martin}},
booktitle = {{Logical Approaches to Computational Barriers}},
isbn = {{9783540354666}},
issn = {{0302-9743}},
title = {{{Uncomputability Below the Real Halting Problem}}},
doi = {{10.1007/11780342_39}},
year = {{2006}},
}
@inbook{16472,
author = {{Demaine, Erik D. and Meyer auf der Heide, Friedhelm and Pagh, Rasmus and Pǎtraşcu, Mihai}},
booktitle = {{LATIN 2006: Theoretical Informatics}},
isbn = {{9783540327554}},
issn = {{0302-9743}},
title = {{{De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space)}}},
doi = {{10.1007/11682462_34}},
year = {{2006}},
}
@inbook{16473,
author = {{Dynia, M. and Kutyłowski, J. and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}},
booktitle = {{Lecture Notes in Computer Science}},
isbn = {{9783540377917}},
issn = {{0302-9743}},
title = {{{Smart Robot Teams Exploring Sparse Trees}}},
doi = {{10.1007/11821069_29}},
year = {{2006}},
}
@inproceedings{15150,
author = {{Böttcher, Stefan and Steinmetz, Rita}},
booktitle = {{Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23}},
isbn = {{9783540359692}},
issn = {{0302-9743}},
pages = {{266--269}},
title = {{{DTD-Driven Structure Preserving XML Compression}}},
doi = {{10.1007/11788911_27}},
year = {{2006}},
}
@inproceedings{15152,
author = {{Böttcher, Stefan and Steinmetz, Rita}},
booktitle = {{Secure Data Management, Third VLDB Workshop, SDM 2006}},
isbn = {{9783540389842}},
issn = {{0302-9743}},
pages = {{160--174}},
publisher = {{Springer}},
title = {{{Information Disclosure by XPath Queries}}},
doi = {{10.1007/11844662_12}},
year = {{2006}},
}
@inbook{53181,
author = {{Geiselmann, Willi and Januszewski, Fabian and Köpfer, Hubert and Pelzl, Jan and Steinwandt, Rainer}},
booktitle = {{Information Security and Cryptology – ICISC 2006}},
isbn = {{9783540491125}},
issn = {{0302-9743}},
publisher = {{Springer Berlin Heidelberg}},
title = {{{A Simpler Sieving Device: Combining ECM and TWIRL}}},
doi = {{10.1007/11927587_12}},
year = {{2006}},
}
@inbook{35958,
abstract = {{We establish a link between some heuristic asymptotic formulas (due to Cohen and Lenstra) concerning the moments of the p–part of the class groups of quadratic fields and formulas giving the frequency of the values of the p–rank of these class groups.}},
author = {{Fouvry, Étienne and Klüners, Jürgen}},
booktitle = {{Lecture Notes in Computer Science}},
isbn = {{9783540360759}},
issn = {{0302-9743}},
publisher = {{Springer Berlin Heidelberg}},
title = {{{Cohen–Lenstra Heuristics of Quadratic Number Fields}}},
doi = {{10.1007/11792086_4}},
year = {{2006}},
}
@inproceedings{19835,
abstract = {{The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with
variable transmission ranges. It was introduced and analyzed by Meyer auf der Heide et al. 2004.
In this paper we present a distributed, localized and resource-efficient algorithm for constructing this graph. The qualtiy of the HL graph depends on the domination radius and the publication radius, which affect the amount of interference in the network. These parameters also determine whether the HL graph is a c-spanner, which implies an energy-efficient topology. We investigate the performance on randomly distributed node sets and show that the restrictions on these parameters derived from a worst case analysis are not so tight using realistic settings.
Here, we present the results of our extensive experimental evaluation, measuring congestion, dilation and energy. Congestion includes the load that is induced by interfering edges. We distinguish between congestion and realistic congestion where we also take the signal-to-interference ratio into account.
Our experiments show that the HL graph contains energy-efficient paths as well as paths with a few number of hops while preserving a low congestion.}},
author = {{Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}},
booktitle = {{Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005)}},
isbn = {{9783540291329}},
issn = {{0302-9743}},
pages = {{244--257}},
title = {{{Performance Analysis of the Hierarchical Layer Graph for Wireless Networks}}},
doi = {{10.1007/11561354_21}},
volume = {{3738}},
year = {{2005}},
}
@inbook{19836,
author = {{Schindelhauer, Christian and Voß, Kerstin}},
booktitle = {{Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005)}},
isbn = {{9783540291329}},
issn = {{0302-9743}},
pages = {{271--284}},
title = {{{Probability Distributions for Channel Utilisation}}},
doi = {{10.1007/11561354_23}},
year = {{2005}},
}
@inproceedings{19912,
author = {{Loeser, Chris and Schomaker, Gunnar and Brinkmann, André and Vodisek, Mario and Heidebuer, Michael}},
booktitle = {{Proceedings of the 4th International Conference on Networking}},
isbn = {{9783540253389}},
issn = {{0302-9743}},
pages = {{800--810}},
title = {{{Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts}}},
doi = {{10.1007/978-3-540-31957-3_90}},
volume = {{3421}},
year = {{2005}},
}