Cole, R.; Farach-Colton, M.; Hariharan, R.; Przytycka, T.; Thorup, M.: An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. SIAM Journal on Computing 30 (5), S. 1385 - 1404 (2000)

Cooper, C.; Frieze, A. M.; Mehlhorn, K.; Priebe, V.: Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. Random Structures & Algorithms 16, S. 33 - 46 (2000)

Daehlen, M.; Lyche, T.; Morken, K.; Schneider, R.; Seidel, H.-P.: Multiresolution analysis over triangles, based on quadratic Hermite interpolation. Journal of Computational and Applied Mathematics 119 (1/2), S. 97 - 114 (2000)

de Nivelle, H.: Deciding the E-plus class by an a posteriori, liftable order. Annals of Pure and Applied Logic 88 (1), S. 219 - 232 (2000)

de Nivelle, H.; Hustadt, U.; Schmidt, R. A.: Resolution-Based Methods for Modal Logics. Logic Journal of the IGPL 8 (3), S. 265 - 292 (2000)

Degtyarev, A.; Gurevich, Y.; Narendran, P.; Veanes, M.; Voronkov, A.: Decidability and Complexity of Simultaneous Rigid E-unification with One Variable and Related Results. Theoretical Computer Science 243 (1/2), S. 167 - 184 (2000)

Dey, T. K.; Mehlhorn, K.; Ramos, E. A.: Curve reconstruction: Connecting dots with good reason. Computational Geometry: Theory and Applications 15 (4), S. 229 - 244 (2000)

Djidjev, H. N.; Pantziou, G. E.; Zaroliagis, C.: Improved algorithms for dynamic shortest paths. Algorithmica 28 (4), S. 367 - 389 (2000)

El Kahoui, M.: Deciding Hopf bifurcations by quantifier elimination in a software-component architecture. Journal of Symbolic Computation 30 (2), S. 161 - 179 (2000)

Fabri, A.; Giezeman, G.-J.; Kettner, L.; Schirra, S.; Schönherr, S.: On the Design of CGAL, a computational geometry algorithms library. Software - Practice and Experience 30 (11), S. 1167 - 1202 (2000)

Fatourou, P.; Spirakis, P. G.: Efficient Scheduling of Strict Multithreaded Computations. Theory of Computing Systems 33 (3), S. 173 - 232 (2000)

Feldmann, A.: BLT: Bi-Layer Tracing of HTTP and TCP/IP. Computer Networks 33 (1-6), S. 321 - 335 (2000)

Fellner, D. W.; Haber, J.; Havemann, S.; Kobbelt, L.; Lensch, H. P. A.; Müller, G.; Peter, I.; Schneider, R.; Seidel, H.-P.; Straßer, W.: Beiträge der Computergraphik zur Realisierung eines verallgemeinerten Dokumentbegriffs. Information technology 42 (6), S. 8 - 18 (2000)

Ganzinger, H.; Jacquemard, F.; Veanes, M.: Rigid Reachability: The Non-Symmetric Form of Rigid E-unification. International Journal of Foundations of Computer Science 11 (1), S. 3 - 27 (2000)

Garg, N.; Konjevod, G.; Ravi, R.: Approximation algorithm for the group Steiner tree problem. Journal of Algorithms 37 (1), S. 66 - 84 (2000)

Goldberg, L. A.; MacKenzie, P. D.; Paterson, M.; Srinivasan, A.: Contention resolution with constant expected delay. Journal of the ACM 42 (6), S. 1048 - 1096 (2000)

Hagerup, T.: Dynamic algorithms for graphs of bounded treewidth. Algorithmica 27 (3/4), S. 292 - 315 (2000)

Hagerup, T.: Parallel preprocessing for path queries without concurrent reading. Information and Computation 158 (1), S. 18 - 28 (2000)

Jaeger, M.: On the complexity of inference about probabilistic relational models. Artificial Intelligence 117, S. 297 - 308 (2000)

Jung, B.; Lenhof, H.-P.; Müller, P.; Rüb, C.: Simulating synthetic polymer chains in parallel. Future Generation Computer Systems 16 (5), S. 513 - 522 (2000)