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.
5792 Publications
2000 | Journal Article | LibreCat-ID: 3247
Fischer C, Wehrheim H. Failure-Divergence Semantics as a Formal Basis for an Object-Oriented Integrated Formal Method. Bulletin of the {EATCS}. 2000:92--101.
LibreCat
2000 | Journal Article | LibreCat-ID: 3248
Wehrheim H. Data Abstraction Techniques in the Validation of {CSP-OZ} Specifications. Formal Asp Comput. 2000;(3):147--164. doi:10.1007/s001650070026
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 3249
Fischer C, Wehrheim H. Behavioural Subtyping Relations for Object-Oriented Formalisms. In: Rus T, ed. Algebraic Methodology and Software Technology. 8th International Conference, {AMAST} 2000, Iowa City, Iowa, USA, May 20-27, 2000, Proceedings. Lecture Notes in Computer Science. ; 2000:469--483. doi:10.1007/3-540-45499-3_33
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 3250
Wehrheim H. Specification of an Automatic Manufacturing System: {A} Case Study in Using Integrated Formal Methods. In: S. E. Maibaum T, ed. Fundamental Approaches to Software Engineering, Third Internationsl Conference, {FASE} 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, {ETAPS} 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings. Lecture Notes in Computer Science. ; 2000:334--348. doi:10.1007/3-540-46428-X_23
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 3251
Wehrheim H. Behavioural Subtyping and Property Preservation. In: F. Smith S, L. Talcott C, eds. 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}. {IFIP} Conference Proceedings. ; 2000:213--231. doi:10.1007/978-0-387-35520-7_11
LibreCat
| DOI
2000 | Book Chapter | LibreCat-ID: 3023
Blömer J. Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In: Automata, Languages and Programming. Berlin, Heidelberg: Springer Berlin Heidelberg; 2000:248-259. doi:10.1007/3-540-45022-x_22
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 2143
Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput Syst. 2000;33(5/6):337--391. doi:10.1007/s002240010006
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 2145
Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J Comput. 2000;30(4):1126--1155. doi:10.1137/S0097539799353431
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2146 | 
Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage Networks. In: PDPTA. ; 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2147 |
Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.
LibreCat
| Files available
2000 | Journal Article | LibreCat-ID: 2148
Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.
LibreCat
2000 | Conference Paper | LibreCat-ID: 2149 |
Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2150 |
Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In: STOC. ACM; 2000:38--47.
LibreCat
| Files available
2000 | Report | LibreCat-ID: 17865
Wand M, Fischer M, Meyer auf der Heide F. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn; 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 18962
Govindarajan S, Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Well-Separated Pair Decomposition and Applications. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS. ; 2000:585-614. doi:10.1007/s00453-005-1197-3
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 1920
Karl H, Polze A, Werner M. 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: 17990
Czumaj A, Sohler C, Ziegler M. Property Testing in Computational Geometry. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00). Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2000:155-166. doi:10.1007/3-540-45253-2_15
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18146
Ziegler M, Brattka V. Computing the Dimension of Linear Subspaces. In: SOFSEM 2000: Theory and Practice of Informatics. Vol 1963. Berlin, Heidelberg: Springer; 2000:450-458. doi:10.1007/3-540-44411-4_34
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18150
Ziegler M, Sohler C. Computing Cut Numbers. In: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00). ; 2000:73-79.
LibreCat
2000 | Journal Article | LibreCat-ID: 18446
Lorys K, Wanka R, Oesterdiekhoff B, Kutylowski M. Periodification Scheme: Constructing Sorting Networks with Constant Period. Journal of the ACM. 2000;45:944-967. doi:10.1145/355483.355490
LibreCat
| DOI