Wissenschaftliche Publikationen

Albers, S.; Garg, N.; Leonardi, S.: Minimizing stall time in single and parallel disk systems. Journal of the ACM 47 (6), S. 969 - 986 (2000)

Albers, S.; Mitzenmacher, M.: Average-Case Analyses of First Fit and Random Fit Bin Packing. Random Structures & Algorithms 16 (3), S. 240 - 259 (2000)

Anderson, P.; Basin, D. A.: Program Development Schemata as Derived Rules. Journal of Symbolic Computation 30 (1), S. 5 - 36 (2000)

Andersson, A.; Hagerup, T.; Hastad, J.; Petersson, O.: Tight bounds for searching a sorted array of strings. SIAM Journal on Computing 30 (5), S. 1552 - 1578 (2000)

Arya, S.; Mount, D. M.: Approximate range searching. Computational Geometry 17 (3/4), S. 135 - 152 (2000)

Asano, T.; Obokata, K.; Mehlhorn, K.: LEDA + Algorithm = Program. Communications of the Operations Research Society of Japan 45 (3), S. 132 - 137 (2000)

Bast, H.: On Scheduling Parallel Tasks at Twilight. Theory of Computing Systems 33 (5), S. 489 - 563 (2000)

Bein, W. W.; Fleischer, R.; Larmore, L. L.: Limited bookmark randomized online algorithms for the paging problem. Information Processing Letters 76 (4-6), S. 155 - 162 (2000)

Boros, E.; Elbassioni, K. M.; Khachiyan, L.; Gurvich, V.: An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension. Parallel Processing Letters 10 (4) (2000)

Bugliesi, M.; Delzanno, G.; Liquori, L.; Martelli, M.: Object Calculi in Linear Logic. Journal of Logic and Computation 10 (1), S. 75 - 104 (2000)

Burnikel, C.; Fleischer, R.; Mehlhorn, K.; Schirra, S.: A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. Algorithmica 27 (1), S. 87 - 99 (2000)

Chaudhuri, S.; Subrahmanyam, K. V.; Wagner, F.; Zaroliagis, C.: Computing mimicking networks. Algorithmica 26 (1), S. 31 - 49 (2000)

Chaudhuri, S.; Zaroliagis, C.: Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms. Algorithmica 27 (3/4), S. 212 - 226 (2000)

Clee, S. M.; Kastelein, J.J.P.; van Dam, M.; Marcil, M.; Roomp, K.; Zwarts, K.Y.; Collins, J. A.; Roelants, R.; Tamasawa, N.; Stulc, T. et al.; Suda, T.; Ceska, R.; Boucher, B.; Rondeau, C.; DeSouich, C.; Brooks-Wilson, A.; Molhuizen, H.O.; Frohlich, J.; Genest, J. J.; Hayden, M. R.: Age and residual cholesterol efflux affect HDL cholesterol levels and coronary artery disease in ABCA1 heterozygotes. Journal of Clinical Investigation 106 (10), S. 1263 - 70 (2000)

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)