Wissenschaftliche Publikationen

Albers, S.: A competitive analysis of the list update problem with lookahead. Theoretical Computer Science 197 (1/2), S. 95 - 109 (1998)

Albers, S.: Improved randomized on-line algorithms for the list update problem. SIAM Journal on Computing 27 (3), S. 682 - 693 (1998)

Albers, S.; Koga, H.: New on-line algorithms for the page replication problem. Journal of Algorithms 27, S. 75 - 96 (1998)

Albers, S.; Mitzenmacher, M.: Average case analyses of list update algorithms, with applications to data compression. Algorithmica 21 (3), S. 312 - 329 (1998)

Althaus, E.; Mehlhorn, K.: Maximum Network Flow with Floating Point Arithmetic. Information Processing Letters 66 (3), S. 109 - 113 (1998)

Arikati, S. R.; Chaudhuri, S.; Zaroliagis, C.: All-Pairs Min-Cut in Sparse Networks. Journal of Algorithms 29, S. 82 - 110 (1998)

Bachmair, L.; Ganzinger, H.: Ordered Chaining Calculi for First-Order Theories of Transitive Relations. Journal of the ACM 45 (6), S. 1007 - 1049 (1998)

Barnes, G.; Edmonds, J. A.: Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models. SIAM Journal on Computing 27 (4), S. 1190 - 1202 (1998)

Barth, P.; Bockmayr, A.: Modelling Discrete Optimisation Problems in Constraint Logic Programming. Annals of Operations Research 81, S. 467 - 496 (1998)

Basin, D. A.; Klarlund, N.: Automata Based Symbolic Reasoning in Hardware Verification. Formal Methods in Systems Design 13 (3), S. 255 - 288 (1998)

Basin, D. A.; Matthews, S.; Viganò, L.: Labelled Modal Logics: quantifiers. Journal of Logic, Language and Information 7 (3), S. 237 - 263 (1998)

Basin, D. A.; Matthews, S.; Viganò, L.: Natural Deduction for Non-Classical Logics. Studia Logica 60 (1), S. 119 - 160 (1998)

Blackburn, P.; Tzakova, M.: Hybrid Completeness. Logic Journal of the IGPL 6 (4), S. 625 - 650 (1998)

Blackburn, P.; Tzakova, M.: Hybridizing Concept Languages. Annals of Mathematics and Artificial Intelligence 24 (1/4), S. 23 - 49 (1998)

Bockmayr, A.; Kasper, T.: Branch-and-Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming. INFORMS Journal on Computing 10 (3), S. 287 - 300 (1998)

Bodlaender, H. L.; Deogun, J. S.; Jansen, K.; Kloks, T.; Kratsch, D.; Müller, H.; Tuza, Z.: Ranking of Graphs. SIAM Journal on Discrete Mathematics 11 (1), S. 168 - 181 (1998)

Bodlaender, H. L.; Hagerup, T.: Parallel Algorithms with Optimal Speedup for Bounded Treewidth. SIAM Journal on Computing 27 (6), S. 1725 - 1746 (1998)

Bradford, P. G.; Rawlins, G. J.E.; Shannon, G. E.: Efficient Matrix Chain Ordering in Polylog Time. SIAM Journal on Computing 27 (2), S. 466 - 490 (1998)

Brodal, G. S.; Träff, J. L.; Zaroliagis, C.: A Parallel Priority Queue with Constant Time Operations. Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures 49 (1), S. 4 - 21 (1998)

Cáceres, R.; Douglis, F.; Feldmann, A.; Glass, G.; Rabinovich, M.: Web Proxy Caching: The Devil is in the Details. ACM SIGMETRICS Performance Evaluation Review 26 (3), S. 11 - 15 (1998)