@inbook{3012, author = {{Blömer, Johannes and May, Alexander}}, booktitle = {{Public Key Cryptography – PKC 2004}}, isbn = {{9783540210184}}, issn = {{0302-9743}}, pages = {{1--13}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{A Generalized Wiener Attack on RSA}}}, doi = {{10.1007/978-3-540-24632-9_1}}, year = {{2004}}, } @inbook{3014, author = {{May, Alexander}}, booktitle = {{Public Key Cryptography – PKC 2004}}, isbn = {{9783540210184}}, issn = {{0302-9743}}, pages = {{218--230}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q}}}, doi = {{10.1007/978-3-540-24632-9_16}}, year = {{2004}}, } @inbook{3015, author = {{May, Alexander}}, booktitle = {{Advances in Cryptology – CRYPTO 2004}}, isbn = {{9783540226680}}, issn = {{0302-9743}}, pages = {{213--219}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring}}}, doi = {{10.1007/978-3-540-28628-8_13}}, year = {{2004}}, } @inproceedings{18778, abstract = {{Given a point set P in the d-dimensional unit hypercube, we give upper bounds on the maximal expected number of extreme points when each point is perturbed by small random noise chosen independently for each point from the same noise distribution Δ. Our results are parametrized by the variance of the noise distribution. For large variance we essentially consider the average case for distribution Δ while for variance 0 we consider the worst case. Hence our results give upper bounds on the number of extreme points where our input distributions range from average case to worst case.
Our main contribution is a rather general lemma that can be used to obtain upper bounds on the expected number of extreme points for a large class of noise distributions. We then apply this lemma to obtain explicit bounds for random noise coming from the Gaussian normal distribution of variance σ² and the uniform distribution in a hypercube of side length &epsilon. For these noise distributions we show upper bounds of O( (1/ σ )^d * log^3/2 * d - 1 n ) and O( ( (n log n) / ε )^d/(d+1) ), respectively. Besides its theoretical motivation our model is also motivated by the observation that in many applications of convex hull algorithms the input data is inherently noisy, e.g. when the data comes from physical measurement or imprecise arithmetic is used.}}, author = {{Damerow, Valentina and Sohler, Christian}}, booktitle = {{Proceedings of the 12th European Symposium on Algorithms (ESA'04)}}, isbn = {{9783540230250}}, issn = {{0302-9743}}, title = {{{Extreme Points Under Random Noise}}}, doi = {{10.1007/978-3-540-30140-0_25}}, year = {{2004}}, } @inproceedings{18263, abstract = {{We generalize univariate multipoint evaluation of polynomials of degree n at sublinear amortized cost per point. More precisely, it is shown how to evaluate a bivariate polynomial p of maximum degree less than n, specified by its n^2 coefficients, simultaneously at n^2 given points using a total of O(n^2.667) arithmetic operations. In terms of the input size N being quadratic in n, this amounts to an amortized cost of O(N^0.334) per point.}}, author = {{Nüsken, Michael and Ziegler, Martin}}, booktitle = {{Proc. 12th Annual Symposium on Algorithms (ESA'04)}}, isbn = {{9783540230250}}, issn = {{0302-9743}}, pages = {{544--555}}, publisher = {{Springer}}, title = {{{Fast Multipoint Evaluation of Bivariate Polynomials}}}, doi = {{10.1007/978-3-540-30140-0_49}}, volume = {{3221}}, year = {{2004}}, } @inproceedings{18279, abstract = {{For $c in REAL$, a $c$-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most $c$ times their geometric distance. Based on this property to approximate a complete weighted graph, sparse spanners have found many applications, e.g., in FPTAS, geometric searching, and radio networks. For geometric searching, it turned out to suffice whether the radius rather than the length of some path between any two vertices is bounded relatively to their geometric distance; this is the defining property of weak spanners. Finally regarding radio network applications, a power spanner accounts for the total energy afforded for a wireless transmission with the requirement that the sum of the squares of the lengths of some path between any two planar vertices must be bounded relatively to the square of their geometric distance (or higher powers up to 6 or even 8).

While it is known that any $c$-spanner is also both a weak $C_1$-spanner and a $C_2$-power spanner (for appropriate $C_1,C_2$ depending only on $c$ but not on the graph under consideration), we show that the converse fails: There exists a family of $c_1$-power spanners that are no weak $C$-spanners and also a family of weak $c_2$-spanners that are no $C$-spanners for any fixed $C$ (and thus no uniform spanners, either). However the deepest result of the present work reveals that, surprisingly, any weak spanner is also a uniform power spanner. We further generalize the latter notion by considering $(c,delta)$-power spanners where the sum of the $delta$-th powers of the lengths has to be bounded; so $(cdot,2)$-power spanners coincide with the usual power spanners and $(cdot,1)$-power spanners are classical spanners. Interestingly, these $(cdot,delta)$-power spanners form a strict hierarchy where the above results still hold for any $deltageq2$; some even hold for $delta>1$ while counterexamples reveal others to fail for $delta<2$. In fact we show that in general every self-similar curve of fractal dimension $d>delta$ is no $(C,delta)$-power spanner for any fixed $C$. }}, author = {{Schindelhauer, Christian and Volbert, Klaus and Ziegler, Martin}}, booktitle = {{Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC'04)}}, isbn = {{9783540241317}}, issn = {{0302-9743}}, pages = {{805--821}}, publisher = {{Springer }}, title = {{{Spanners, Weak Spanners, and Power Spanners for Wireless Networks}}}, doi = {{10.1007/978-3-540-30551-4_69}}, volume = {{3341}}, year = {{2004}}, } @inproceedings{16474, abstract = {{Given n distinct points p1, p2, ... , pn in the plane, the map labeling problem with four squares is to place n axis-parallel equi-sized squares Q1, ... ,Qn of maximum possible size such that pi is a corner of Qi and no two squares overlap. This problem is NP-hard and no algorithm with approximation ratio better than 1/2 exists unless P = NP [10]. In this paper, we consider a scenario where we want to visualize the information gathered by smart dust, i.e. by a large set of simple devices, each consisting of a sensor and a sender that can gather sensor data and send it to a central station. Our task is to label (the positions of) these sensors in a way described by the labeling problem above. Since these devices are not positioned accurately (for example, they might be dropped from an airplane), this gives rise to consider the map labeling problem under the assumption, that the positions of the points are not fixed precisely, but perturbed by random noise. In other words, we consider the smoothed complexity of the map labeling problem. We present an algorithm that, under such an assumption and Gaussian random noise with sufficiently large variance, has linear smoothed complexity.}}, author = {{Bansal, Vikas and Meyer auf der Heide, Friedhelm and Sohler, Christian}}, booktitle = {{12th Annual European Symposium on Algorithms (ESA 2004)}}, isbn = {{9783540230250}}, issn = {{0302-9743}}, title = {{{Labeling Smart Dust}}}, doi = {{10.1007/978-3-540-30140-0_9}}, volume = {{3221}}, year = {{2004}}, } @inproceedings{13618, author = {{Walder, Herbert and Platzner, Marco}}, booktitle = {{Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL)}}, isbn = {{9783540229896}}, issn = {{0302-9743}}, pages = {{831--835}}, publisher = {{Springer}}, title = {{{A Runtime Environment for Reconfigurable Hardware Operating Systems}}}, doi = {{10.1007/978-3-540-30117-2_84}}, year = {{2004}}, } @article{19785, author = {{Salzwedel, Kay A.}}, isbn = {{9783540008835}}, issn = {{0302-9743}}, journal = {{Algorithms for Memory Hierarchies}}, title = {{{Algorithmic Approaches for Storage Networks}}}, doi = {{10.1007/3-540-36574-5_12}}, volume = {{2625}}, year = {{2003}}, } @inbook{3016, author = {{Blömer, Johannes and May, Alexander}}, booktitle = {{Advances in Cryptology - CRYPTO 2003}}, isbn = {{9783540406747}}, issn = {{0302-9743}}, pages = {{27--43}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{New Partial Key Exposure Attacks on RSA}}}, doi = {{10.1007/978-3-540-45146-4_2}}, year = {{2003}}, } @inbook{3018, author = {{Blömer, Johannes and Seifert, Jean-Pierre}}, booktitle = {{Financial Cryptography}}, isbn = {{9783540406631}}, issn = {{0302-9743}}, pages = {{162--181}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)}}}, doi = {{10.1007/978-3-540-45126-6_12}}, year = {{2003}}, } @inproceedings{18196, abstract = {{Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on FAST FOURIER TRANSFORM, they for instance multiply two polynomials of degree up to N or multi-evaluate one at N points simultaneously within quasi-linear time O(N polylog N). An extension to (and in fact the mere definition of) polynomials over fields R and C to the SKEW-field H of quaternions is promising but still missing. The present work proposes three approaches which in the commutative case coincide but for H turn out to differ, each one satisfying some desirable properties while lacking others. For each notion, we devise algorithms for according arithmetic; these are quasi-optimal in that their running times match lower complexity bounds up to polylogarithmic factors.}}, author = {{Ziegler, Martin}}, booktitle = {{Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC'03)}}, isbn = {{9783540206958}}, issn = {{0302-9743}}, pages = {{705--715}}, title = {{{Quasi-optimal Arithmetic for Quaternion Polynomials}}}, doi = {{10.1007/978-3-540-24587-2_72}}, year = {{2003}}, } @inbook{18258, abstract = {{Multi-evaluation of the Coulomb potential induced by N particles is a central part of N-body simulations. In 3D, known subquadratic time algorithms return approximations up to given ABSOLUTE precision. By combining data structures from Computational Geometry with fast polynomial arithmetic, the present work obtains approximations of prescribable RELATIVE error e>0 in time O(1/e*N*polylog N).}}, author = {{Ziegler, Martin}}, booktitle = {{Lecture Notes in Computer Science}}, editor = {{Dehne, F. and Sack, JR. and Smid, M.}}, isbn = {{9783540405450}}, issn = {{0302-9743}}, publisher = {{Springer}}, title = {{{Fast Relative Approximation of Potential Fields}}}, doi = {{10.1007/978-3-540-45078-8_13}}, volume = {{2748}}, year = {{2003}}, } @inbook{16543, author = {{Dellnitz, Michael and Preis, Robert}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540405542}}, issn = {{0302-9743}}, title = {{{Congestion and Almost Invariant Sets in Dynamical Systems}}}, doi = {{10.1007/3-540-45084-x_8}}, year = {{2003}}, } @inbook{16664, author = {{Schütze, Oliver}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540018698}}, issn = {{0302-9743}}, title = {{{A New Data Structure for the Nondominance Problem in Multi-objective Optimization}}}, doi = {{10.1007/3-540-36970-8_36}}, year = {{2003}}, } @inbook{16665, author = {{Schütze, Oliver and Mostaghim, Sanaz and Dellnitz, Michael and Teich, Jürgen}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540018698}}, issn = {{0302-9743}}, title = {{{Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques}}}, doi = {{10.1007/3-540-36970-8_9}}, year = {{2003}}, } @inproceedings{15077, author = {{Böttcher, Stefan and Steinmetz, Rita}}, booktitle = {{Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003}}, isbn = {{9783540200475}}, issn = {{0302-9743}}, pages = {{400--410}}, publisher = {{Springer}}, title = {{{Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients}}}, doi = {{10.1007/978-3-540-39403-7_30}}, year = {{2003}}, } @inproceedings{15078, author = {{Böttcher, Stefan and Steinmetz, Rita}}, booktitle = {{Database and XML Technologies, First International XML Database Symposium, XSym 2003}}, isbn = {{9783540200550}}, issn = {{0302-9743}}, pages = {{85--99}}, title = {{{A DTD Graph Based XPath Query Subsumption Test}}}, doi = {{10.1007/978-3-540-39429-7_6}}, year = {{2003}}, } @inproceedings{13615, author = {{Steiger, Christoph and Walder, Herbert and Platzner, Marco}}, booktitle = {{Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL)}}, isbn = {{9783540408222}}, issn = {{0302-9743}}, pages = {{575--584}}, publisher = {{Springer}}, title = {{{Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices}}}, doi = {{10.1007/978-3-540-45234-8_56}}, year = {{2003}}, } @inproceedings{19850, author = {{Wanka, Rolf}}, booktitle = {{Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)}}, isbn = {{9783540003311}}, issn = {{0302-9743}}, pages = {{413--420}}, title = {{{Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal}}}, doi = {{10.1007/3-540-36379-3_36}}, year = {{2002}}, }