Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
9907 Publications
2000 | Conference Paper | LibreCat-ID: 3251
H. Wehrheim, “Behavioural Subtyping and Property Preservation,” in Formal Methods for Open Object-Based Distributed Systems IV, {IFIF} {TC6/WG6.1} Fourth International Conference on Formal Methods for Open Object-Based Distributed Systems {(FMOODS} 2000), September 6-8, 2000, Stanford, California, {USA}, 2000, pp. 213--231.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2146 |
![Open access file OA](https://ris.uni-paderborn.de/images/access_open.png)
P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2147 |
![Open access file OA](https://ris.uni-paderborn.de/images/access_open.png)
A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39.
LibreCat
| Files available
2000 | Journal Article | LibreCat-ID: 2148
A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000.
LibreCat
2000 | Conference Paper | LibreCat-ID: 2149 |
![Open access file OA](https://ris.uni-paderborn.de/images/access_open.png)
A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2150 |
![Open access file OA](https://ris.uni-paderborn.de/images/access_open.png)
A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in STOC, 2000, pp. 38--47.
LibreCat
| Files available
2000 | Report | LibreCat-ID: 17865
M. Wand, M. Fischer, and F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn, 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 1920
H. Karl, A. Polze, and M. Werner, “Predictable Network Computing using Message-driven Scheduling,” in Proc. the Workshop on Run-Time Systems for Parallel Programming, 2000.
LibreCat
2000 | Conference Paper | LibreCat-ID: 18150
M. Ziegler and C. Sohler, “Computing Cut Numbers,” in Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.
LibreCat
2000 | Journal Article | LibreCat-ID: 18446
K. Lorys, R. Wanka, B. Oesterdiekhoff, and M. Kutylowski, “Periodification Scheme: Constructing Sorting Networks with Constant Period,” Journal of the ACM, vol. 45, pp. 944–967, 2000, doi: 10.1145/355483.355490.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2211 |
![Open access file OA](https://ris.uni-paderborn.de/images/access_open.png)
A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 21783
S. Volbracht and G. Domik, “Developing Effective Navigation Techniques in Virtual 3D Environments,” in Virtual Environments 2000, 2000, pp. 55–64.
LibreCat
2000 | Conference (Editor) | LibreCat-ID: 7790
H. Ehrig, G. Engels, H.-J. Kreowksi, and G. Taentzer, Eds., Special Issue: Selected Papers of GRATRA 2000, vol. 44, no. 2. Amsterdam, The Netherlands: Elsevier, 2000.
LibreCat