--- _id: '18915' abstract: - lang: eng text: We present a simple two-person Bucket Game, based on throwing balls into buckets, and we
discuss possible players' strategies.

We use these strategies to create an approximation algorithm for a generalization of
the well known Set Cover problem, where we need to cover each element by at least $k$ sets.
Furthermore, we apply these strategies to construct a randomized algorithm for Dynamic Page Migration
problem achieving the optimal competitive ratio against an oblivious adversary. author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Jarosław full_name: Byrka, Jarosław last_name: Byrka citation: ama: 'Bienkowski M, Byrka J. Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. Berlin, Heidelberg: Springer ; 2005:815-826. doi:10.1007/11561071_72' apa: 'Bienkowski, M., & Byrka, J. (2005). Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 815–826). Berlin, Heidelberg: Springer . https://doi.org/10.1007/11561071_72' bibtex: '@inproceedings{Bienkowski_Byrka_2005, place={Berlin, Heidelberg}, title={Bucket Game with Applications to Set Multicover and Dynamic Page Migration}, volume={3669}, DOI={10.1007/11561071_72}, booktitle={Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, publisher={Springer }, author={Bienkowski, Marcin and Byrka, Jarosław}, year={2005}, pages={815–826} }' chicago: 'Bienkowski, Marcin, and Jarosław Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.” In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 3669:815–26. Berlin, Heidelberg: Springer , 2005. https://doi.org/10.1007/11561071_72.' ieee: M. Bienkowski and J. Byrka, “Bucket Game with Applications to Set Multicover and Dynamic Page Migration,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 815–826. mla: Bienkowski, Marcin, and Jarosław Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.” Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer , 2005, pp. 815–26, doi:10.1007/11561071_72. short: 'M. Bienkowski, J. Byrka, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer , Berlin, Heidelberg, 2005, pp. 815–826.' date_created: 2020-09-03T08:11:11Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/11561071_72 intvolume: ' 3669' language: - iso: eng page: 815-826 place: Berlin, Heidelberg publication: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) publication_identifier: isbn: - '9783540291183' - '9783540319511' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: 'Springer ' status: public title: Bucket Game with Applications to Set Multicover and Dynamic Page Migration type: conference user_id: '15415' volume: 3669 year: '2005' ... --- _id: '18917' abstract: - lang: eng text: The page migration problem is one of subproblems of data management in networks. It occurs
in a distributed network of processors sharing one indivisible memory page of size D. During runtime,
the processors access a unit of data from the page, and the system is allowed to migrate the page
between the processors. The problem is to compute (on-line) a schedule of page movements
to minimize the total communication cost.

The Dynamic Page Migration problem is an extension to the page migration.
It attempts to model the network dynamics, occurring, for example, in mobile networks.
However, the pace of changes is restricted, i.e. the distances between processors can
change only by a constant per round.

The movement of the nodes induce changes in the communication cost between each pair of nodes,
which is proportional to the distance between them raised to some power $alpha$.
This is typical for mobile wireless networks, where nodes can move with a constant speed,
and the cost of communication is measured in terms of energy used for sending the data.
Thus, by setting $alpha$ equal to the propagation exponent of the medium,
cost minimization becomes minimizing the total energy consumption in the system.

However, as proven in citedynamic-page-migration, if both network mobility and
request sequence are created by an adversary, then the competitive ratio is polynomially large in D and
in the number of the nodes. In our search for a reasonable, close-to-reality model, in this paper we
consider a scenario in which the network mobility is adversarial, but the requests are
generated randomly by a stochastic process. We design an algorithm MTFR for this scenario,
and prove that it is O(1)-competitive, on expectation and with high probability. author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski citation: ama: 'Bienkowski M. Dynamic Page Migration with Stochastic Requests. In: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005). ACM Press, NY, USA; 2005:270-278.' apa: 'Bienkowski, M. (2005). Dynamic Page Migration with Stochastic Requests. In Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005) (pp. 270–278). Las Vegas, Nevada, USA: ACM Press, NY, USA.' bibtex: '@inproceedings{Bienkowski_2005, title={Dynamic Page Migration with Stochastic Requests}, booktitle={Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)}, publisher={ACM Press, NY, USA}, author={Bienkowski, Marcin}, year={2005}, pages={270–278} }' chicago: Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” In Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), 270–78. ACM Press, NY, USA, 2005. ieee: M. Bienkowski, “Dynamic Page Migration with Stochastic Requests,” in Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), Las Vegas, Nevada, USA, 2005, pp. 270–278. mla: Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), ACM Press, NY, USA, 2005, pp. 270–78. short: 'M. Bienkowski, in: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), ACM Press, NY, USA, 2005, pp. 270–278.' conference: location: Las Vegas, Nevada, USA date_created: 2020-09-03T08:19:31Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' language: - iso: eng page: 270-278 publication: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005) publisher: ACM Press, NY, USA status: public title: Dynamic Page Migration with Stochastic Requests type: conference user_id: '15415' year: '2005' ... --- _id: '18924' abstract: - lang: eng text: Bluetooth is a wireless communication standard developed for personal area networks (PAN) that gained popularity in the last years. It was designed to connect a few devices together, however nowadays there is a need to build larger networks. Construction and maintenance algorithms have great effect on performance of the network. We present an algorithm based on Cube Connected Cycles (CCC) topology and show how to maintain the network so that it is easily scalable. Our design guarantees good properties such as constant degree and logarithmic dilation. Besides, the construction costs are proven to be at most constant times larger than any other algorithm would need. author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski - first_name: Orhan full_name: Orhan, Orhan last_name: Orhan citation: ama: 'Bienkowski M, Brinkmann A, Korzeniowski M, Orhan O. Cube Connected Cycles Based Bluetooth Scatternet Formation. In: Proceedings of the 4th International Conference on Networking. Vol 3420. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2005:413-420. doi:10.1007/978-3-540-31956-6_49' apa: 'Bienkowski, M., Brinkmann, A., Korzeniowski, M., & Orhan, O. (2005). Cube Connected Cycles Based Bluetooth Scatternet Formation. In Proceedings of the 4th International Conference on Networking (Vol. 3420, pp. 413–420). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-540-31956-6_49' bibtex: '@inproceedings{Bienkowski_Brinkmann_Korzeniowski_Orhan_2005, place={Berlin, Heidelberg}, series={ Lecture Notes in Computer Science}, title={Cube Connected Cycles Based Bluetooth Scatternet Formation}, volume={3420}, DOI={10.1007/978-3-540-31956-6_49}, booktitle={Proceedings of the 4th International Conference on Networking}, publisher={Springer}, author={Bienkowski, Marcin and Brinkmann, André and Korzeniowski, Miroslaw and Orhan, Orhan}, year={2005}, pages={413–420}, collection={ Lecture Notes in Computer Science} }' chicago: 'Bienkowski, Marcin, André Brinkmann, Miroslaw Korzeniowski, and Orhan Orhan. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” In Proceedings of the 4th International Conference on Networking, 3420:413–20. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2005. https://doi.org/10.1007/978-3-540-31956-6_49.' ieee: M. Bienkowski, A. Brinkmann, M. Korzeniowski, and O. Orhan, “Cube Connected Cycles Based Bluetooth Scatternet Formation,” in Proceedings of the 4th International Conference on Networking, 2005, vol. 3420, pp. 413–420. mla: Bienkowski, Marcin, et al. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” Proceedings of the 4th International Conference on Networking, vol. 3420, Springer, 2005, pp. 413–20, doi:10.1007/978-3-540-31956-6_49. short: 'M. Bienkowski, A. Brinkmann, M. Korzeniowski, O. Orhan, in: Proceedings of the 4th International Conference on Networking, Springer, Berlin, Heidelberg, 2005, pp. 413–420.' date_created: 2020-09-03T09:52:33Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/978-3-540-31956-6_49 intvolume: ' 3420' language: - iso: eng page: 413-420 place: Berlin, Heidelberg publication: Proceedings of the 4th International Conference on Networking publication_identifier: isbn: - '9783540253396' - '9783540319566' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer series_title: ' Lecture Notes in Computer Science' status: public title: Cube Connected Cycles Based Bluetooth Scatternet Formation type: conference user_id: '15415' volume: 3420 year: '2005' ... --- _id: '18925' abstract: - lang: eng text: 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 online a schedule of page movements
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: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Miroslaw full_name: Dynia, Miroslaw last_name: Dynia - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski citation: ama: 'Bienkowski M, Dynia M, Korzeniowski M. Improved Algorithms for Dynamic Page Migration. In: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science. ; 2005:365-376. doi:10.1007/978-3-540-31856-9_30' apa: Bienkowski, M., Dynia, M., & Korzeniowski, M. (2005). Improved Algorithms for Dynamic Page Migration. In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 365–376). https://doi.org/10.1007/978-3-540-31856-9_30 bibtex: '@inproceedings{Bienkowski_Dynia_Korzeniowski_2005, series={Lecture Notes in Computer Science}, title={Improved Algorithms for Dynamic Page Migration}, DOI={10.1007/978-3-540-31856-9_30}, booktitle={Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Bienkowski, Marcin and Dynia, Miroslaw and Korzeniowski, Miroslaw}, year={2005}, pages={365–376}, collection={Lecture Notes in Computer Science} }' chicago: Bienkowski, Marcin, Miroslaw Dynia, and Miroslaw Korzeniowski. “Improved Algorithms for Dynamic Page Migration.” In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 365–76. Lecture Notes in Computer Science, 2005. https://doi.org/10.1007/978-3-540-31856-9_30. ieee: M. Bienkowski, M. Dynia, and M. Korzeniowski, “Improved Algorithms for Dynamic Page Migration,” in Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–376. mla: Bienkowski, Marcin, et al. “Improved Algorithms for Dynamic Page Migration.” Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–76, doi:10.1007/978-3-540-31856-9_30. short: 'M. Bienkowski, M. Dynia, M. Korzeniowski, in: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–376.' date_created: 2020-09-03T10:01:03Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/978-3-540-31856-9_30 language: - iso: eng page: 365-376 publication: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) publication_identifier: isbn: - '9783540249986' - '9783540318569' issn: - 0302-9743 - 1611-3349 publication_status: published series_title: Lecture Notes in Computer Science status: public title: Improved Algorithms for Dynamic Page Migration type: conference user_id: '15415' year: '2005' ... --- _id: '18967' author: - first_name: Harald full_name: Räcke, Harald last_name: Räcke citation: ama: Räcke H. Data Management and Routing in General Networks. Vol 154. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005. apa: Räcke, H. (2005). Data Management and Routing in General Networks (Vol. 154). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Räcke_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Data Management and Routing in General Networks}, volume={154}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Räcke, Harald}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Räcke, Harald. Data Management and Routing in General Networks. Vol. 154. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. ieee: H. Räcke, Data Management and Routing in General Networks, vol. 154. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. mla: Räcke, Harald. Data Management and Routing in General Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. short: H. Räcke, Data Management and Routing in General Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. date_created: 2020-09-03T14:44:08Z date_updated: 2022-01-06T06:53:56Z department: - _id: '63' - _id: '26' intvolume: ' 154' language: - iso: eng publication_identifier: isbn: - 3-935433-63-8 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20030101262 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Data Management and Routing in General Networks type: dissertation user_id: '5786' volume: 154 year: '2005' ... --- _id: '23883' abstract: - lang: eng text: A dynamic geometric data stream is a sequence of m Add/Remove operations of points from a discrete geometric space (1,...,Δ)d [21]. Add(p) inserts a point p from (1,...,Δ)d into the current point set, Remove(p) deletes p from P. We develop low-storage data structures to (i) maintain ε-approximations of range spaces of P with constant VC-dimension and (ii) maintain an ε-approximation of the weight of the Euclidean minimum spanning tree of P. Our data structures use O(log3ε • log3(1/ε) • log(1/ε)/ε2) and O(log (1/δ) • (log Δ/ε)O(d)) bits of memory, respectively (we assume that the dimension d is a constant), and they are correct with probability 1-δ. These results are based on a new data structure that maintains a set of elements chosen (almost) uniformly at random from P. author: - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling - first_name: Piotr full_name: Indyk, Piotr last_name: Indyk - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Frahling G, Indyk P, Sohler C. Sampling in dynamic data streams and applications. In: Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05. ; 2005. doi:10.1145/1064092.1064116' apa: Frahling, G., Indyk, P., & Sohler, C. (2005). Sampling in dynamic data streams and applications. In Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05. https://doi.org/10.1145/1064092.1064116 bibtex: '@inproceedings{Frahling_Indyk_Sohler_2005, title={Sampling in dynamic data streams and applications}, DOI={10.1145/1064092.1064116}, booktitle={Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05}, author={Frahling, Gereon and Indyk, Piotr and Sohler, Christian}, year={2005} }' chicago: Frahling, Gereon, Piotr Indyk, and Christian Sohler. “Sampling in Dynamic Data Streams and Applications.” In Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05, 2005. https://doi.org/10.1145/1064092.1064116. ieee: G. Frahling, P. Indyk, and C. Sohler, “Sampling in dynamic data streams and applications,” in Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05, 2005. mla: Frahling, Gereon, et al. “Sampling in Dynamic Data Streams and Applications.” Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05, 2005, doi:10.1145/1064092.1064116. short: 'G. Frahling, P. Indyk, C. Sohler, in: Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05, 2005.' date_created: 2021-09-07T13:10:15Z date_updated: 2022-01-06T06:56:02Z department: - _id: '63' doi: 10.1145/1064092.1064116 language: - iso: eng publication: Proceedings of the twenty-first annual symposium on Computational geometry - SCG '05 publication_status: published status: public title: Sampling in dynamic data streams and applications type: conference user_id: '15415' year: '2005' ... --- _id: '17988' author: - first_name: Sven full_name: Köhler, Sven last_name: Köhler - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Köhler S, Schindelhauer C, Ziegler M. On Approximating Real-World Halting Problems. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 2005. doi:10.1007/11537311_40' apa: Köhler, S., Schindelhauer, C., & Ziegler, M. (2005). On Approximating Real-World Halting Problems. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/11537311_40 bibtex: '@inbook{Köhler_Schindelhauer_Ziegler_2005, place={Berlin, Heidelberg}, title={On Approximating Real-World Halting Problems}, DOI={10.1007/11537311_40}, booktitle={Fundamentals of Computation Theory}, author={Köhler, Sven and Schindelhauer, Christian and Ziegler, Martin}, year={2005} }' chicago: Köhler, Sven, Christian Schindelhauer, and Martin Ziegler. “On Approximating Real-World Halting Problems.” In Fundamentals of Computation Theory. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11537311_40. ieee: S. Köhler, C. Schindelhauer, and M. Ziegler, “On Approximating Real-World Halting Problems,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 2005. mla: Köhler, Sven, et al. “On Approximating Real-World Halting Problems.” Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_40. short: 'S. Köhler, C. Schindelhauer, M. Ziegler, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 2005.' date_created: 2020-08-14T13:44:48Z date_updated: 2022-01-06T06:53:24Z department: - _id: '63' doi: 10.1007/11537311_40 language: - iso: eng place: Berlin, Heidelberg publication: Fundamentals of Computation Theory publication_identifier: isbn: - '9783540281931' - '9783540318736' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: On Approximating Real-World Halting Problems type: book_chapter user_id: '15415' year: '2005' ... --- _id: '17989' author: - first_name: Klaus full_name: Meer, Klaus last_name: Meer - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Meer K, Ziegler M. An Explicit Solution to Post’s Problem over the Reals. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 2005. doi:10.1007/11537311_41' apa: Meer, K., & Ziegler, M. (2005). An Explicit Solution to Post’s Problem over the Reals. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/11537311_41 bibtex: '@inbook{Meer_Ziegler_2005, place={Berlin, Heidelberg}, title={An Explicit Solution to Post’s Problem over the Reals}, DOI={10.1007/11537311_41}, booktitle={Fundamentals of Computation Theory}, author={Meer, Klaus and Ziegler, Martin}, year={2005} }' chicago: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.” In Fundamentals of Computation Theory. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11537311_41. ieee: K. Meer and M. Ziegler, “An Explicit Solution to Post’s Problem over the Reals,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 2005. mla: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.” Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_41. short: 'K. Meer, M. Ziegler, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 2005.' date_created: 2020-08-14T13:46:23Z date_updated: 2022-01-06T06:53:24Z department: - _id: '63' doi: 10.1007/11537311_41 language: - iso: eng place: Berlin, Heidelberg publication: Fundamentals of Computation Theory publication_identifier: isbn: - '9783540281931' - '9783540318736' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: An Explicit Solution to Post’s Problem over the Reals type: book_chapter user_id: '15415' year: '2005' ... --- _id: '18280' abstract: - lang: eng text: The sometimes so-called Main Theorem of Recursive Analysis implies that any computable real function is necessarily continuous. We consider three relaxations of this common notion of real computability for the purpose of treating also discontinuous functions f:R->R:
*) 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: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Ziegler M. Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In: Proc. CiE 2005: New Computational Paradigms. Vol 3526. Springer; 2005:562-571. doi:10.1007/11494645_68' apa: 'Ziegler, M. (2005). Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In Proc. CiE 2005: New Computational Paradigms (Vol. 3526, pp. 562–571). Springer. https://doi.org/10.1007/11494645_68' bibtex: '@inproceedings{Ziegler_2005, title={Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism}, volume={3526}, DOI={10.1007/11494645_68}, booktitle={Proc. CiE 2005: New Computational Paradigms}, publisher={Springer}, author={Ziegler, Martin}, year={2005}, pages={562–571} }' chicago: 'Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.” In Proc. CiE 2005: New Computational Paradigms, 3526:562–71. Springer, 2005. https://doi.org/10.1007/11494645_68.' ieee: 'M. Ziegler, “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism,” in Proc. CiE 2005: New Computational Paradigms, 2005, vol. 3526, pp. 562–571.' mla: 'Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.” Proc. CiE 2005: New Computational Paradigms, vol. 3526, Springer, 2005, pp. 562–71, doi:10.1007/11494645_68.' short: 'M. Ziegler, in: Proc. CiE 2005: New Computational Paradigms, Springer, 2005, pp. 562–571.' date_created: 2020-08-25T12:38:49Z date_updated: 2022-01-06T06:53:28Z department: - _id: '63' doi: 10.1007/11494645_68 intvolume: ' 3526' language: - iso: eng page: 562-571 publication: 'Proc. CiE 2005: New Computational Paradigms' publication_identifier: isbn: - '9783540261797' - '9783540322665' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism type: conference user_id: '15415' volume: 3526 year: '2005' ... --- _id: '18282' author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: Ziegler M. Computational Power of Infinite Quantum Parallelism. International Journal of Theoretical Physics. 2005;44(11):2059-2071. doi:10.1007/s10773-005-8984-0 apa: Ziegler, M. (2005). Computational Power of Infinite Quantum Parallelism. International Journal of Theoretical Physics, 44(11), 2059–2071. https://doi.org/10.1007/s10773-005-8984-0 bibtex: '@article{Ziegler_2005, title={Computational Power of Infinite Quantum Parallelism}, volume={44}, DOI={10.1007/s10773-005-8984-0}, number={11}, journal={International Journal of Theoretical Physics}, author={Ziegler, Martin}, year={2005}, pages={2059–2071} }' chicago: 'Ziegler, Martin. “Computational Power of Infinite Quantum Parallelism.” International Journal of Theoretical Physics 44, no. 11 (2005): 2059–71. https://doi.org/10.1007/s10773-005-8984-0.' ieee: M. Ziegler, “Computational Power of Infinite Quantum Parallelism,” International Journal of Theoretical Physics, vol. 44, no. 11, pp. 2059–2071, 2005. mla: Ziegler, Martin. “Computational Power of Infinite Quantum Parallelism.” International Journal of Theoretical Physics, vol. 44, no. 11, 2005, pp. 2059–71, doi:10.1007/s10773-005-8984-0. short: M. Ziegler, International Journal of Theoretical Physics 44 (2005) 2059–2071. date_created: 2020-08-25T12:47:12Z date_updated: 2022-01-06T06:53:28Z department: - _id: '63' doi: 10.1007/s10773-005-8984-0 intvolume: ' 44' issue: '11' language: - iso: eng page: 2059-2071 publication: International Journal of Theoretical Physics publication_identifier: issn: - 0020-7748 - 1572-9575 publication_status: published status: public title: Computational Power of Infinite Quantum Parallelism type: journal_article user_id: '15415' volume: 44 year: '2005' ... --- _id: '18366' author: - first_name: Wilhelm full_name: Dangelmaier, Wilhelm last_name: Dangelmaier - first_name: Bengt full_name: Mueck, Bengt last_name: Mueck - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Kiran full_name: Mahajan, Kiran last_name: Mahajan - first_name: Christoph full_name: ' Laroque, Christoph' last_name: ' Laroque' citation: ama: 'Dangelmaier W, Mueck B, Fischer M, Mahajan K, Laroque C. Methods to lead the user to significant processes in a 3D material flow simulation. In: Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005. ; 2005:267-270.' apa: Dangelmaier, W., Mueck, B., Fischer, M., Mahajan, K., & Laroque, C. (2005). Methods to lead the user to significant processes in a 3D material flow simulation. In Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005 (pp. 267–270). bibtex: '@inproceedings{Dangelmaier_Mueck_Fischer_Mahajan_ Laroque_2005, title={Methods to lead the user to significant processes in a 3D material flow simulation}, booktitle={Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005}, author={Dangelmaier, Wilhelm and Mueck, Bengt and Fischer, Matthias and Mahajan, Kiran and Laroque, Christoph}, year={2005}, pages={267–270} }' chicago: Dangelmaier, Wilhelm, Bengt Mueck, Matthias Fischer, Kiran Mahajan, and Christoph Laroque. “Methods to Lead the User to Significant Processes in a 3D Material Flow Simulation.” In Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005, 267–70, 2005. ieee: W. Dangelmaier, B. Mueck, M. Fischer, K. Mahajan, and C. Laroque, “Methods to lead the user to significant processes in a 3D material flow simulation,” in Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005, 2005, pp. 267–270. mla: Dangelmaier, Wilhelm, et al. “Methods to Lead the User to Significant Processes in a 3D Material Flow Simulation.” Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005, 2005, pp. 267–70. short: 'W. Dangelmaier, B. Mueck, M. Fischer, K. Mahajan, C. Laroque, in: Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005, 2005, pp. 267–270.' date_created: 2020-08-26T12:36:33Z date_updated: 2022-01-06T06:53:30Z department: - _id: '63' language: - iso: eng page: 267-270 publication: Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005 status: public title: Methods to lead the user to significant processes in a 3D material flow simulation type: conference user_id: '15415' year: '2005' ... --- _id: '18449' author: - first_name: Christoph full_name: Loeser, Christoph last_name: Loeser - first_name: Isabell full_name: Drüke, Isabell last_name: Drüke - first_name: Brigitte full_name: Oesterdiekhoff, Brigitte last_name: Oesterdiekhoff citation: ama: 'Loeser C, Drüke I, Oesterdiekhoff B. Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario. In: IEEE International Conference on Industrial Informatics (INDIN). ; 2005.' apa: 'Loeser, C., Drüke, I., & Oesterdiekhoff, B. (2005). Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario. In IEEE International Conference on Industrial Informatics (INDIN).' bibtex: '@inproceedings{Loeser_Drüke_Oesterdiekhoff_2005, title={ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario}, booktitle={IEEE International Conference on Industrial Informatics (INDIN)}, author={Loeser, Christoph and Drüke, Isabell and Oesterdiekhoff, Brigitte}, year={2005} }' chicago: 'Loeser, Christoph, Isabell Drüke, and Brigitte Oesterdiekhoff. “ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario.” In IEEE International Conference on Industrial Informatics (INDIN), 2005.' ieee: 'C. Loeser, I. Drüke, and B. Oesterdiekhoff, “ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario,” in IEEE International Conference on Industrial Informatics (INDIN), 2005.' mla: 'Loeser, Christoph, et al. “ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario.” IEEE International Conference on Industrial Informatics (INDIN), 2005.' short: 'C. Loeser, I. Drüke, B. Oesterdiekhoff, in: IEEE International Conference on Industrial Informatics (INDIN), 2005.' date_created: 2020-08-27T12:04:12Z date_updated: 2022-01-06T06:53:32Z department: - _id: '63' language: - iso: eng publication: IEEE International Conference on Industrial Informatics (INDIN) status: public title: ' Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario' type: conference user_id: '15415' year: '2005' ... --- _id: '18450' author: - first_name: Brigitte full_name: Oesterdiekhoff, Brigitte last_name: Oesterdiekhoff citation: ama: 'Oesterdiekhoff B. Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices. In: IEEE International Conference on Emerging Technologies and Factory Automation (ETFA). ; 2005.' apa: Oesterdiekhoff, B. (2005). Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices. In IEEE International Conference on Emerging Technologies and Factory Automation (ETFA). bibtex: '@inproceedings{Oesterdiekhoff_2005, title={Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices}, booktitle={IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)}, author={Oesterdiekhoff, Brigitte}, year={2005} }' chicago: Oesterdiekhoff, Brigitte. “Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices.” In IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 2005. ieee: B. Oesterdiekhoff, “Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices,” in IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 2005. mla: Oesterdiekhoff, Brigitte. “Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices.” IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 2005. short: 'B. Oesterdiekhoff, in: IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 2005.' date_created: 2020-08-27T12:06:59Z date_updated: 2022-01-06T06:53:32Z department: - _id: '63' language: - iso: eng publication: IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) status: public title: Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices type: conference user_id: '15415' year: '2005' ... --- _id: '16468' author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Dynamic Load Balancing in Distributed Hash Tables. In: Peer-to-Peer Systems IV. Berlin, Heidelberg; 2005. doi:10.1007/11558989_20' apa: Bienkowski, M., Korzeniowski, M., & Meyer auf der Heide, F. (2005). Dynamic Load Balancing in Distributed Hash Tables. In Peer-to-Peer Systems IV. Berlin, Heidelberg. https://doi.org/10.1007/11558989_20 bibtex: '@inbook{Bienkowski_Korzeniowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg}, title={Dynamic Load Balancing in Distributed Hash Tables}, DOI={10.1007/11558989_20}, booktitle={Peer-to-Peer Systems IV}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, year={2005} }' chicago: Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. “Dynamic Load Balancing in Distributed Hash Tables.” In Peer-to-Peer Systems IV. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11558989_20. ieee: M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Dynamic Load Balancing in Distributed Hash Tables,” in Peer-to-Peer Systems IV, Berlin, Heidelberg, 2005. mla: Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.” Peer-to-Peer Systems IV, 2005, doi:10.1007/11558989_20. short: 'M. Bienkowski, M. Korzeniowski, F. Meyer auf der Heide, in: Peer-to-Peer Systems IV, Berlin, Heidelberg, 2005.' date_created: 2020-04-08T09:18:56Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11558989_20 language: - iso: eng place: Berlin, Heidelberg publication: Peer-to-Peer Systems IV publication_identifier: isbn: - '9783540290681' - '9783540319061' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Dynamic Load Balancing in Distributed Hash Tables type: book_chapter user_id: '15415' year: '2005' ... --- _id: '16469' author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Bienkowski M, Meyer auf der Heide F. Page Migration in Dynamic Networks. In: Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg; 2005. doi:10.1007/11549345_1' apa: Bienkowski, M., & Meyer auf der Heide, F. (2005). Page Migration in Dynamic Networks. In Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg. https://doi.org/10.1007/11549345_1 bibtex: '@inbook{Bienkowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg}, title={Page Migration in Dynamic Networks}, DOI={10.1007/11549345_1}, booktitle={Mathematical Foundations of Computer Science 2005}, author={Bienkowski, Marcin and Meyer auf der Heide, Friedhelm}, year={2005} }' chicago: Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” In Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11549345_1. ieee: M. Bienkowski and F. Meyer auf der Heide, “Page Migration in Dynamic Networks,” in Mathematical Foundations of Computer Science 2005, Berlin, Heidelberg, 2005. mla: Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” Mathematical Foundations of Computer Science 2005, 2005, doi:10.1007/11549345_1. short: 'M. Bienkowski, F. Meyer auf der Heide, in: Mathematical Foundations of Computer Science 2005, Berlin, Heidelberg, 2005.' date_created: 2020-04-08T09:23:36Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11549345_1 language: - iso: eng place: Berlin, Heidelberg publication: Mathematical Foundations of Computer Science 2005 publication_identifier: isbn: - '9783540287025' - '9783540318675' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Page Migration in Dynamic Networks type: book_chapter user_id: '15415' year: '2005' ... --- _id: '16470' abstract: - lang: eng text: "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.\r\nPUBWCL is realized as a peer-to-peer system and features migration and restoration of BSP processes executed on it.\r\nThe 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.\r\n" author: - first_name: Olaf full_name: Bonorden, Olaf last_name: Bonorden - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Bonorden O, Gehweiler J, Meyer auf der Heide F. A Web Computing Environment for Parallel Algorithms in Java. In: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM). ; 2005:801-808. doi:10.1007/11752578_96' apa: Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2005). A Web Computing Environment for Parallel Algorithms in Java. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 801–808). https://doi.org/10.1007/11752578_96 bibtex: '@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={A Web Computing Environment for Parallel Algorithms in Java}, DOI={10.1007/11752578_96}, booktitle={Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2005}, pages={801–808} }' chicago: Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “A Web Computing Environment for Parallel Algorithms in Java.” In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 801–8, 2005. https://doi.org/10.1007/11752578_96. ieee: O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “A Web Computing Environment for Parallel Algorithms in Java,” in Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–808. mla: Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.” Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–08, doi:10.1007/11752578_96. short: 'O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, in: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–808.' date_created: 2020-04-08T09:25:44Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11752578_96 language: - iso: eng page: 801-808 publication: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) publication_identifier: isbn: - '9783540341413' - '9783540341420' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: A Web Computing Environment for Parallel Algorithms in Java type: conference user_id: '15415' year: '2005' ... --- _id: '16471' abstract: - lang: eng text: "We compare different load balancing strategies for Bulk-Synchronous Parallel (BSP) programs in a web computing environment. In order to handle the influence of the fluctuating available computation power, we classify the external work load.\r\n\r\nWe evaluate the load balancing algorithms using our web computing library for BSP programs in Java (PUBWCL). Thereby we simulated the external work load in order to have repeatable testing conditions.\r\n\r\nWith the best performing load balancing strategy we could save 39% of the execution time averaged and even up to 50% in particular cases." author: - first_name: Olaf full_name: Bonorden, Olaf last_name: Bonorden - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Bonorden O, Gehweiler J, Meyer auf der Heide F. Load Balancing Strategies in a Web Computing Environment. In: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM). ; 2005:839-846. doi:10.1007/11752578_101' apa: Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2005). Load Balancing Strategies in a Web Computing Environment. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 839–846). https://doi.org/10.1007/11752578_101 bibtex: '@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={Load Balancing Strategies in a Web Computing Environment}, DOI={10.1007/11752578_101}, booktitle={Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2005}, pages={839–846} }' chicago: Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “Load Balancing Strategies in a Web Computing Environment.” In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 839–46, 2005. https://doi.org/10.1007/11752578_101. ieee: O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “Load Balancing Strategies in a Web Computing Environment,” in Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–846. mla: Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.” Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–46, doi:10.1007/11752578_101. short: 'O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, in: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–846.' date_created: 2020-04-08T09:30:12Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11752578_101 language: - iso: eng page: 839-846 publication: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) publication_identifier: isbn: - '9783540341413' - '9783540341420' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Load Balancing Strategies in a Web Computing Environment type: conference user_id: '15415' year: '2005' ... --- _id: '17112' author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Valentina full_name: Damerow, Valentina last_name: Damerow - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Bienkowski M, Damerow V, Meyer auf der Heide F, Sohler C. Average case complexity of Voronoi diagrams of n sites from the unit cube. In: Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005. Technische Universiteit Eindhoven; 2005.' apa: Bienkowski, M., Damerow, V., Meyer auf der Heide, F., & Sohler, C. (2005). Average case complexity of Voronoi diagrams of n sites from the unit cube. In Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005. Technische Universiteit Eindhoven. bibtex: '@inproceedings{Bienkowski_Damerow_Meyer auf der Heide_Sohler_2005, title={Average case complexity of Voronoi diagrams of n sites from the unit cube}, booktitle={Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005}, publisher={Technische Universiteit Eindhoven}, author={Bienkowski, Marcin and Damerow, Valentina and Meyer auf der Heide, Friedhelm and Sohler, Christian}, year={2005} }' chicago: Bienkowski, Marcin, Valentina Damerow, Friedhelm Meyer auf der Heide, and Christian Sohler. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” In Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005. Technische Universiteit Eindhoven, 2005. ieee: M. Bienkowski, V. Damerow, F. Meyer auf der Heide, and C. Sohler, “Average case complexity of Voronoi diagrams of n sites from the unit cube,” in Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, 2005. mla: Bienkowski, Marcin, et al. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, Technische Universiteit Eindhoven, 2005. short: 'M. Bienkowski, V. Damerow, F. Meyer auf der Heide, C. Sohler, in: Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, Technische Universiteit Eindhoven, 2005.' date_created: 2020-06-22T13:22:22Z date_updated: 2022-01-06T06:53:05Z department: - _id: '63' language: - iso: eng publication: Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005 publisher: Technische Universiteit Eindhoven related_material: link: - relation: confirmation url: http://www.win.tue.nl/EWCG2005/Proceedings/43.pdf status: public title: Average case complexity of Voronoi diagrams of n sites from the unit cube type: conference user_id: '15415' year: '2005' ... --- _id: '17113' citation: ama: Leonardi S, Meyer auf der Heide F, Wagner D, eds. Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks. Vol 05361.; 2005. apa: Leonardi, S., Meyer auf der Heide, F., & Wagner, D. (Eds.). (2005). Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks (Vol. 05361). Presented at the Dagstuhl Seminar Proceedings, Schloss Dagstuhl, Germany. bibtex: '@book{Leonardi_Meyer auf der Heide_Wagner_2005, series={Dagstuhl Seminar Proceedings}, title={Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks}, volume={05361}, year={2005}, collection={Dagstuhl Seminar Proceedings} }' chicago: Leonardi, Stefano, Friedhelm Meyer auf der Heide, and Dorothea Wagner, eds. Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks. Vol. 05361. Dagstuhl Seminar Proceedings, 2005. ieee: S. Leonardi, F. Meyer auf der Heide, and D. Wagner, Eds., Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks, vol. 05361. 2005. mla: Leonardi, Stefano, et al., editors. Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks. Vol. 05361, 2005. short: S. Leonardi, F. Meyer auf der Heide, D. Wagner, eds., Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks, 2005. conference: end_date: 2005-09-09 location: Schloss Dagstuhl, Germany name: Dagstuhl Seminar Proceedings start_date: 2005-09-04 date_created: 2020-06-22T13:52:52Z date_updated: 2022-01-06T06:53:05Z department: - _id: '63' editor: - first_name: Stefano full_name: Leonardi, Stefano last_name: Leonardi - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Dorothea full_name: Wagner, Dorothea last_name: Wagner intvolume: ' 5361' language: - iso: eng related_material: link: - relation: confirmation url: https://drops.dagstuhl.de/opus/volltexte/2006/570/ series_title: Dagstuhl Seminar Proceedings status: public title: Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks type: conference_editor user_id: '15415' volume: '05361' year: '2005' ... --- _id: '15058' author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: Ziegler M. Stability versus speed in a computable algebraic model. Theoretical Computer Science. 2005:14-26. doi:10.1016/j.tcs.2005.09.053 apa: Ziegler, M. (2005). Stability versus speed in a computable algebraic model. Theoretical Computer Science, 14–26. https://doi.org/10.1016/j.tcs.2005.09.053 bibtex: '@article{Ziegler_2005, title={Stability versus speed in a computable algebraic model}, DOI={10.1016/j.tcs.2005.09.053}, journal={Theoretical Computer Science}, author={Ziegler, Martin}, year={2005}, pages={14–26} }' chicago: Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” Theoretical Computer Science, 2005, 14–26. https://doi.org/10.1016/j.tcs.2005.09.053. ieee: M. Ziegler, “Stability versus speed in a computable algebraic model,” Theoretical Computer Science, pp. 14–26, 2005. mla: Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” Theoretical Computer Science, 2005, pp. 14–26, doi:10.1016/j.tcs.2005.09.053. short: M. Ziegler, Theoretical Computer Science (2005) 14–26. date_created: 2019-11-20T13:22:22Z date_updated: 2022-01-06T06:52:15Z department: - _id: '63' doi: 10.1016/j.tcs.2005.09.053 language: - iso: eng page: 14-26 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published status: public title: Stability versus speed in a computable algebraic model type: journal_article user_id: '15415' year: '2005' ...