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, Clemens, and Heike Wehrheim. “Failure-Divergence Semantics as a Formal Basis for an Object-Oriented Integrated Formal Method.” Bulletin of the {EATCS}, 2000, pp. 92--101.
LibreCat
2000 | Journal Article | LibreCat-ID: 3248
Wehrheim, Heike. “Data Abstraction Techniques in the Validation of {CSP-OZ} Specifications.” Formal Asp. Comput., no. 3, 2000, pp. 147--164, doi:10.1007/s001650070026.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 3249
Fischer, Clemens, and Heike Wehrheim. “Behavioural Subtyping Relations for Object-Oriented Formalisms.” Algebraic Methodology and Software Technology. 8th International Conference, {AMAST} 2000, Iowa City, Iowa, USA, May 20-27, 2000, Proceedings, edited by Teodor Rus, 2000, pp. 469--483, doi:10.1007/3-540-45499-3_33.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 3250
Wehrheim, Heike. “Specification of an Automatic Manufacturing System: {A} Case Study in Using Integrated Formal Methods.” 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, edited by T. S. E. Maibaum, 2000, pp. 334--348, doi:10.1007/3-540-46428-X_23.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 3251
Wehrheim, Heike. “Behavioural Subtyping and Property Preservation.” 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}, edited by Scott F. Smith and Carolyn L. Talcott, 2000, pp. 213--231, doi:10.1007/978-0-387-35520-7_11.
LibreCat
| DOI
2000 | Book Chapter | LibreCat-ID: 3023
Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.” Automata, Languages and Programming, Springer Berlin Heidelberg, 2000, pp. 248–59, doi:10.1007/3-540-45022-x_22.
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 2143
Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst., vol. 33, no. 5/6, 2000, pp. 337--391, doi:10.1007/s002240010006.
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 2145
Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput., vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2146 | 
Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” PDPTA, 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2147 |
Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000, pp. 30--39.
LibreCat
| Files available
2000 | Journal Article | LibreCat-ID: 2148
Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.
LibreCat
2000 | Conference Paper | LibreCat-ID: 2149 |
Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2150 |
Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” STOC, ACM, 2000, pp. 38--47.
LibreCat
| Files available
2000 | Report | LibreCat-ID: 17865
Wand, Michael, et al. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 18962
Govindarajan, Sathish, et al. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614, doi:10.1007/s00453-005-1197-3.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 1920
Karl, Holger, et al. “Predictable Network Computing Using Message-Driven Scheduling.” Proc. the Workshop on Run-Time Systems for Parallel Programming, 2000.
LibreCat
2000 | Conference Paper | LibreCat-ID: 17990
Czumaj, Artur, et al. “Property Testing in Computational Geometry.” Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), vol. 4698, Springer, 2000, pp. 155–66, doi:10.1007/3-540-45253-2_15.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18146
Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” SOFSEM 2000: Theory and Practice of Informatics, vol. 1963, Springer, 2000, pp. 450–58, doi:10.1007/3-540-44411-4_34.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18150
Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.
LibreCat
2000 | Journal Article | LibreCat-ID: 18446
Lorys, Krzysztof, et al. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” Journal of the ACM, vol. 45, 2000, pp. 944–67, doi:10.1145/355483.355490.
LibreCat
| DOI