*) non-deterministic computation;

*) relativized computation, specifically given access to oracles like 0' or 0'';

*) encoding input x and/or output y=f(x) in weaker ways according to the Real Arithmetic Hierarchy.

It turns out that, among these approaches, only the first one provides the required power.}, author = {Ziegler, Martin}, booktitle = {Proc. CiE 2005: New Computational Paradigms}, isbn = {9783540261797}, issn = {0302-9743}, pages = {562--571}, publisher = {Springer}, title = {{Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism}}, doi = {10.1007/11494645_68}, volume = {3526}, year = {2005}, } @inproceedings{18867, abstract = {Modern computer graphics systems are able to render sophisticated 3D szenes consisting of millions of polygons. In this paper we address the problem of occlusion culling. Aila, Miettinen, and Nordlund suggested to implement a FIFO buffer on graphics cards which is able to delay the polygons before drawing them. When one of the polygons within the buffer is occluded or masked by another polygon arriving later from the application, the rendering engine can drop the occluded one without rendering, saving important rendering time.

We introduce a theoretical online model to analyse these problems in theory using competitive analysis. For different cost measures addressed we invent the first competitive algorithms for online occlusion culling. Our implementation shows that these algorithms outperform known ones for real 3D scenes as well.}, author = {Frahling, Gereon and Krokowski, Jens}, booktitle = {Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, isbn = {9783540291183}, issn = {0302-9743}, pages = {758--769}, publisher = {Springer}, title = {{Online Occlusion Culling}}, doi = {10.1007/11561071_67}, volume = {3669}, year = {2005}, } @inproceedings{18925, abstract = {The dynamic page migration problem citedynamic-page-migration is defined in

a distributed network of $n$ mobile nodes sharing one indivisible memory page

of size $D$. During runtime, the nodes can both access a unit of data from

the page and move with a constant speed, thus changing the costs of communication.

The problem is to compute

to minimize the total communication cost.

In this paper we construct and analyze the first deterministic algorithm for this problem.

We prove that it achieves an (up to a constant factor) optimal competitive ratio

$O(n cdot sqrtD)$. We show that the randomization of this algorithm

improves this ratio to $O(sqrtD cdot log n)$ (against an oblivious adversary).

This substantially improves an $O(n cdot sqrtD)$ upper bound from citedynamic-page-migration.

We also give an almost matching lower bound of $Omega(sqrtD cdot sqrtlog n)$ for this problem.}, author = {Bienkowski, Marcin and Dynia, Miroslaw and Korzeniowski, Miroslaw}, booktitle = {Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)}, isbn = {9783540249986}, issn = {0302-9743}, pages = {365--376}, title = {{Improved Algorithms for Dynamic Page Migration}}, doi = {10.1007/978-3-540-31856-9_30}, year = {2005}, } @inbook{16468, author = {Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, booktitle = {Peer-to-Peer Systems IV}, isbn = {9783540290681}, issn = {0302-9743}, title = {{Dynamic Load Balancing in Distributed Hash Tables}}, doi = {10.1007/11558989_20}, year = {2005}, } @inbook{3006, author = {Blömer, Johannes and May, Alexander}, booktitle = {EUROCRYPT 2005}, isbn = {9783540259107}, issn = {0302-9743}, pages = {251--267}, publisher = {Springer Berlin Heidelberg}, title = {{A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers}}, doi = {10.1007/11426639_15}, year = {2005}, } @inproceedings{16470, abstract = {We present a web computing library (PUBWCL) in Java that allows to execute strongly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed over the internet whose owners are willing to donate their unused computation power. PUBWCL is realized as a peer-to-peer system and features migration and restoration of BSP processes executed on it. The use of Java guarantees a high level of security and makes PUBWCL platform independent. In order to estimate the loss of efficiency inherent in such a Java-based system, we have compared it to our C-based PUB-Library. }, author = {Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, booktitle = {Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, isbn = {9783540341413}, issn = {0302-9743}, pages = {801--808}, title = {{A Web Computing Environment for Parallel Algorithms in Java}}, doi = {10.1007/11752578_96}, year = {2005}, } @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}, } @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}, } @inproceedings{15156, author = {Böttcher, Stefan and Steinmetz, Rita}, booktitle = {Secure Data Management, Second VLDB Workshop, SDM 2005}, isbn = {9783540287988}, issn = {0302-9743}, pages = {143--154}, publisher = {Springer}, title = {{Detecting Privacy Violations in Sensitive XML Databases}}, doi = {10.1007/11552338_10}, year = {2005}, }