@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}}, } @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{13608, author = {{Eisenring, Michael and Platzner, Marco and Thiele, Lothar}}, booktitle = {{Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL)}}, isbn = {{9783540664574}}, issn = {{0302-9743}}, pages = {{205--214}}, publisher = {{Springer}}, title = {{{Communication Synthesis for Reconfigurable Embedded Systems}}}, doi = {{10.1007/978-3-540-48302-1_21}}, volume = {{1673}}, year = {{1999}}, } @inbook{16562, author = {{Meyer auf der Heide, Friedhelm and Martinez, Gabriel Terán}}, booktitle = {{LATIN'98: Theoretical Informatics}}, isbn = {{9783540642756}}, issn = {{0302-9743}}, title = {{{Communication-efficient parallel multiway and approximate minimum cut computation}}}, doi = {{10.1007/bfb0054332}}, year = {{1998}}, } @inproceedings{13606, author = {{Platzner, Marco and De Micheli, Giovanni}}, booktitle = {{Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) }}, isbn = {{9783540649489}}, issn = {{0302-9743}}, pages = {{69--78}}, publisher = {{Springer }}, title = {{{Acceleration of satisfiability algorithms by reconfigurable hardware}}}, doi = {{10.1007/bfb0055234}}, year = {{1998}}, } @inproceedings{19869, abstract = {{Given a connected graph $G$, let a $dT$-spanning tree of $G$ be a spanning tree of $G$ of maximum degree bounded by $dT$. It is well known that for each $dT ge 2$ the problem of deciding whether a connected graph has a $dT$-spanning tree is NP-complete. In this paper we investigate this problem when additionally connectivity and maximum degree of the graph are given. A complete characterization of this problem for 2- and 3-connected graphs, for planar graphs, and for $dT=2$ is provided. Our first result is that given a biconnected graph of maximum degree $2dT-2$, we can find its $dT$-spanning tree in time $O(m+n^3/2)$. For graphs of higher connectivity we design a polynomial-time algorithm that finds a $dT$-spanning tree in any $k$-connected graph of maximum degree $k(dT-2)+2$. On the other hand, we prove that deciding whether a $k$-connected graph of maximum degree $k(dT-2)+3$ has a $dT$-spanning tree is NP-complete, provided $k le 3$. For arbitrary $k ge 3$ we show that verifying whether a $k$-connected graph of maximum degree $k(dT-1)$ has a $dT$-spanning tree is NP-complete. In particular, we prove that the Hamiltonian path (cycle) problem is NP-complete for $k$-connected $k$-regular graphs, if $k>2$. This extends the well known result for $k=3$ and fully characterizes the case $dT=2$. For planar graphs it is NP-complete to decide whether a $k$-connected planar graph of maximum degree $dG$ has a $dT$-spanning tree for $k=1$ and $dG > dT ge 2$, for $k=2$ and $dG > 2(dT-1) ge 2$, and for $k=3$ and $dG > dT = 2$. On the other hand, we show how to find in polynomial (linear or almost linear) time a $dT$-spanning tree for all other parameters of $k$, $dG$, and $dT$.}}, author = {{Czumaj, Artur and Strothmann, Willy-Bernhard}}, booktitle = {{Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)}}, isbn = {{9783540633976}}, issn = {{0302-9743}}, title = {{{Bounded degree spanning trees}}}, doi = {{10.1007/3-540-63397-9_9}}, year = {{1997}}, } @inbook{3029, author = {{Blömer, Johannes}}, booktitle = {{Algorithms — ESA '97}}, isbn = {{9783540633976}}, issn = {{0302-9743}}, pages = {{53--63}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Denesting by bounded degree radicals}}}, doi = {{10.1007/3-540-63397-9_5}}, year = {{1997}}, } @inbook{16569, author = {{Meyer auf der Heide, Friedhelm and Vöcking, Berthold}}, booktitle = {{Euro-Par'97 Parallel Processing}}, isbn = {{9783540634409}}, issn = {{0302-9743}}, title = {{{Static and dynamic data management in networks}}}, doi = {{10.1007/bfb0002716}}, year = {{1997}}, } @inbook{16605, author = {{Bäumker, Armin and Meyer auf der Heide, Friedhelm}}, booktitle = {{Solving Irregularly Structured Problems in Parallel}}, isbn = {{9783540631385}}, issn = {{0302-9743}}, title = {{{Communication efficient parallel searching}}}, doi = {{10.1007/3-540-63138-0_21}}, year = {{1997}}, } @inbook{16687, author = {{Karaivazoglou, Efstratios and Meyer auf der Heide, Friedhelm}}, booktitle = {{Euro-Par'97 Parallel Processing}}, isbn = {{9783540634409}}, issn = {{0302-9743}}, title = {{{Routing on asyncronous processor networks}}}, doi = {{10.1007/bfb0002741}}, year = {{1997}}, } @inproceedings{16568, abstract = {{We present a data structure problem which describes the requirements of a simple variant of fully dynamic walk-through animation: We assume the scene to consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily large and has to be stored in secondary memory (discs) with relatively slow access. We allow a visitor to walk in the scene, and a modeler to update the scene by insertions and deletions of balls. We focus on the realtime requirement of animation systems: For some t (specified by the computation power of (the rendering hardware of) the graphic workstation) the data structure has to guarantee that the balls within distance t of the current visitor's position are presented to the rendering hardware, 20 times per second. Insertions and deletions should also be available to the visitor with small delay, independent of the size of the scene. We present a data structure that fulfills the above task in realtime. Its runtime is output-sensitive, i.e. linear in a quantity close to the output size of the query. We further present (preliminary) experimental results indicating that our structure is efficient in practice. }}, author = {{Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard}}, booktitle = {{5th Annual European Symposium on Algorithms (ESA '97)}}, isbn = {{9783540633976}}, issn = {{0302-9743}}, pages = {{157--170}}, publisher = {{Springer}}, title = {{{Dynamic data structures for realtime management of large geometric scenes}}}, doi = {{10.1007/3-540-63397-9_13}}, volume = {{1284}}, year = {{1997}}, } @inbook{19816, author = {{Kleine Büning, Hans and Lettmann, Theodor}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540618638}}, issn = {{0302-9743}}, title = {{{Learning a representation for optimizable formulas}}}, doi = {{10.1007/3-540-61863-5_33}}, year = {{1996}}, } @inbook{17564, author = {{Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm and Rieping, Ingo}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540616276}}, issn = {{0302-9743}}, pages = {{369--376}}, title = {{{Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model}}}, doi = {{10.1007/bfb0024725}}, year = {{1996}}, } @book{16702, editor = {{Meyer auf der Heide, Friedhelm and Monien, Burkhard}}, isbn = {{9783540614401}}, issn = {{0302-9743}}, title = {{{Automata, Languages and Programming, 23rd International Colloquium, ICALP96}}}, doi = {{10.1007/3-540-61440-0}}, year = {{1996}}, } @inbook{16703, author = {{Berenbrink, Petra and Meyer auf der Heide, Friedhelm and Stemann, Volker}}, booktitle = {{STACS 96}}, isbn = {{9783540609223}}, issn = {{0302-9743}}, title = {{{Fault-tolerant shared memory simulations}}}, doi = {{10.1007/3-540-60922-9_16}}, year = {{1996}}, } @inbook{16704, author = {{Meyer auf der Heide, Friedhelm and Vöcking, Berthold}}, booktitle = {{STACS 95}}, isbn = {{9783540590422}}, issn = {{0302-9743}}, title = {{{A packet routing protocol for arbitrary networks}}}, doi = {{10.1007/3-540-59042-0_81}}, year = {{1995}}, }