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.
10426 Publications
2000 | Journal Article | LibreCat-ID: 3248
Wehrheim, Heike. “Data Abstraction Techniques in the Validation of {CSP-OZ} Specifications.” Formal Asp. Comput., no. 3 (2000): 147--164. https://doi.org/10.1007/s001650070026.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 3249
Fischer, Clemens, and Heike Wehrheim. “Behavioural Subtyping Relations for Object-Oriented Formalisms.” In Algebraic Methodology and Software Technology. 8th International Conference, {AMAST} 2000, Iowa City, Iowa, USA, May 20-27, 2000, Proceedings, edited by Teodor Rus, 469--483. Lecture Notes in Computer Science, 2000. https://doi.org/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.” In 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, 334--348. Lecture Notes in Computer Science, 2000. https://doi.org/10.1007/3-540-46428-X_23.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 3251
Wehrheim, Heike. “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}, edited by Scott F. Smith and Carolyn L. Talcott, 213--231. {IFIP} Conference Proceedings, 2000. https://doi.org/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.” In Automata, Languages and Programming, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. https://doi.org/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. 33, no. 5/6 (2000): 337--391. https://doi.org/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. 30, no. 4 (2000): 1126--1155. https://doi.org/10.1137/S0097539799353431.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2146 | 
Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In 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.” In SODA, 30--39, 2000.
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 17, no. 3–4 (2000): 213--237.
LibreCat
2000 | Conference Paper | LibreCat-ID: 2149 |
Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.
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).” In STOC, 38--47. ACM, 2000.
LibreCat
| Files available
2000 | Report | LibreCat-ID: 17865
Wand, Michael, Matthias Fischer, and Friedhelm 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: 18962
Govindarajan, Sathish, Tamas Lukovszki, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 585–614, 2000. https://doi.org/10.1007/s00453-005-1197-3.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 1920
Karl, Holger, Andreas Polze, and Matthias 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: 17990
Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.” In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 4698:155–66. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2000. https://doi.org/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.” In SOFSEM 2000: Theory and Practice of Informatics, 1963:450–58. Berlin, Heidelberg: Springer, 2000. https://doi.org/10.1007/3-540-44411-4_34.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18150
Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 73–79, 2000.
LibreCat
2000 | Journal Article | LibreCat-ID: 18446
Lorys, Krzysztof, Rolf Wanka, Brigitte Oesterdiekhoff, and Miroslaw Kutylowski. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” Journal of the ACM 45 (2000): 944–67. https://doi.org/10.1145/355483.355490.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2211 |
Czumaj, Artur, and Christian 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, 38–47, 2000.
LibreCat
| Files available