TY - CONF
AU - Steiger, Christoph
AU - Walder, Herbert
AU - Platzner, Marco
ID - 13615
SN - 0302-9743
T2 - Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL)
TI - Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices
ER -
TY - CONF
AU - Böttcher, Stefan
AU - Steinmetz, Rita
ID - 15077
SN - 0302-9743
T2 - Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003
TI - Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients
ER -
TY - CHAP
AU - Schütze, Oliver
ID - 16664
SN - 0302-9743
T2 - Lecture Notes in Computer Science
TI - A New Data Structure for the Nondominance Problem in Multi-objective Optimization
ER -
TY - CONF
AB - 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.
AU - Ziegler, Martin
ID - 18196
SN - 0302-9743
T2 - Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC'03)
TI - Quasi-optimal Arithmetic for Quaternion Polynomials
ER -
TY - CONF
AU - Böttcher, Stefan
AU - Steinmetz, Rita
ID - 15078
SN - 0302-9743
T2 - Database and XML Technologies, First International XML Database Symposium, XSym 2003
TI - A DTD Graph Based XPath Query Subsumption Test
ER -
TY - CHAP
AU - Blömer, Johannes
AU - Seifert, Jean-Pierre
ID - 3018
SN - 0302-9743
T2 - Financial Cryptography
TI - Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)
ER -
TY - CHAP
AU - Schütze, Oliver
AU - Mostaghim, Sanaz
AU - Dellnitz, Michael
AU - Teich, Jürgen
ID - 16665
SN - 0302-9743
T2 - Lecture Notes in Computer Science
TI - Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques
ER -
TY - CHAP
AU - Meyer auf der Heide, Friedhelm
AU - Kumar, Mohan
AU - Nikoletseas, Sotiris
AU - Spirakis, Paul
ID - 16723
SN - 0302-9743
T2 - Euro-Par 2002 Parallel Processing
TI - Mobile Computing, Mobile Networks
ER -
TY - CONF
AB - We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter and a rabbit. Let G be any connected, undirected graph with n nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph. Between rounds both the hunter and the rabbit can stay at the current node or move to another node. The hunter is assumed to be restricted to the graph G: in every round, the hunter can move using at most one edge. For the rabbit we investigate two models: in one model the rabbit is restricted to the same graph as the hunter, and in the other model the rabbit is unrestricted, i.e., it can jump to an arbitrary node in every round.
We say that the rabbit is caught as soon as hunter and rabbit are located at the same node in a round. The goal of the hunter is to catch the rabbit in as few rounds as possible, whereas the rabbit aims to maximize the number of rounds until it is caught. Given a randomized hunter strategy for G, the escape length for that strategy is the worst case expected number of rounds it takes the hunter to catch the rabbit, where the worst case is with regards to all (possibly randomized) rabbit strategies. Our main result is a hunter strategy for general graphs with an escape length of only O
(n log (diam(G))) against restricted as well as unrestricted rabbits. This bound is close to optimal since Ω(n) is a trivial lower bound on the escape length in both models. Furthermore, we prove that our upper bound is optimal up to constant factors against unrestricted rabbits.
AU - Adler, Micah
AU - Räcke, Harald
AU - Sivadasan, Naveen
AU - Sohler, Christian
AU - Vöcking, Berthold
ID - 18566
SN - 0302-9743
T2 - Proceedings of the 29th International Colloquium on Automata, Languages and Programming
TI - Randomized Pursuit-Evasion in Graphs
ER -
TY - CONF
AB - Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them suffer from instabilities when applied to degenerate matrices, i.e., those having multiple eigenvalues. We investigate the spectral representation's effectivity properties on the sound formal basis of computable analysis. It turns out that in general the eigenvectors cannot be computed from a given matrix. If however the size of the matrix' spectrum (=number of different eigenvalues) is known in advance, it can be diagonalized effectively. Thus, in principle the spectral decomposition can be computed under remarkably weak non-degeneracy conditions.
AU - Ziegler, Martin
AU - Brattka, Vasco
ID - 18152
SN - 0302-9743
T2 - Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA'2000)
TI - A Computable Spectral Theorem
VL - 2064
ER -