Gasieniec, L.; Karpinski, M.; Plandowski, W.; Rytter, W.: Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach. In: Combinatorial Pattern Matching, S. 39 - 49 (Hg. Hirschberg, D.; Myers, G.). 7th Annual Symposium on Combinatorial Pattern Matching, Laguna Beach, CA, USA, 10. Juni 1996 - 12. Juni 1996. Springer, Berlin (1996)

Gasieniec, L.; Kranakis, E.; Krizanc, D.; Pelc, A.: Minimizing Congestion of Layouts for ATM Networks with Faulty Links. In: Mathematical Foundations of Computer Science 1996, S. 372 - 381 (Hg. Penczek, W.; Szalas, A.). 21st International Symposium on Mathematical Foundations of Computer Science, Cracow, Poland, 02. September 1996 - 06. September 1996. Springer, Berlin (1996)

Gergov, J.: Approximation Algorithms for Dynamic Storage Allocation. In: Algorithms - ESA '96, S. 52 - 61 (Hg. Diaz, J.; Serna, M.). 4th Annual European Symposium on Algorithms , Barcelona, Spain, 25. September 1996 - 27. September 1996. Springer, Berlin (1996)

Graf, P.: Path Indexing for AC-theories. In: Automated Deduction - CADE-13, S. 718 - 732 (Hg. McRobbie, M. A.; Slaney, J. K.). 13th International Conference on Automated Deduction, New Brunswick, New Jersey, USA, 30. Juli 1996 - 03. August 1996. Springer, Berlin, Germany (1996)

Graf, P.; Meyer, C.: Advanced Indexing Operations on Substitution Trees. In: Automated Deduction - CADE-13, S. 553 - 567 (Hg. McRobbie, M. A.; Slaney, J. K.). 13th International Conference on Automated Deduction, New Brunswick, New Jersey, USA, 30. Juli 1996 - 03. August 1996. Springer, Berlin, Germany (1996)

Gupta, A.; Kaller, D.; Mahajan, S.; Shermer, T. C.: Vertex Partitioning Problems on Partial k-Trees. In: Algorithm Theory - SWAT '96, S. 161 - 172 (Hg. Karlsson, R.; Lingas, A.). 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, 03. Juli 1996 - 05. Juli 1996. Springer, Berlin (1996)

Gupta, P.; Janardan, R.; Smid, M.: Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. In: Proceedings of the 8th Canadian Conference on Computational Geometry, S. 8 - 13 (Hg. Fiala, F.; Kranakis, E.). 8th Canadian Conference on Computational Geometry, Ottawa, Canada, 12. August 1996 - 15. August 1996. Carleton University Press, Ottawa (1996)

Hagerup, T.: Allocating Independent Tasks to Parallel Processors: An Experimental Study. In: Parallel Algorithms for Irregularly Structured Problems, S. 1 - 33 (Hg. Ferreira, A.; Rolim, J.; Saad, Y.; Yang, T.). 3rd International Workshop on Parallel Algorithms for Irregularly Structured Problems, Santa Barbara, CA, USA, 19. August 1996 - 21. August 1996. Springer, Berlin (1996)

Hariharan, R.; Kelsen, P.; Mahajan, S.: Coloring 2-colorable hypergraphs with a sublinear number of colors. In: Scandinavian Workshop on Algorithm Theory (SWAT96), S. 41 - 52 (Hg. Karlsson, R.; Lingas, A.). Untitled Event, Reykjavik, Iceland, 03. Juli 1996 - 05. Juli 1996. Springer, Berlin, Germany (1996)

Hopf, J.; Rau, R.: Decision Making in an Economy Exploiting Fuzzy Rules Obtained from a Genetic Algorithm. In: Soft Computing with Industrial Applications, S. 331 - 336 (Hg. Jamshidi, M.; Fathi, M.; Pierrot, F.). Untitled Event, Montpellier, France, 1996. TSI Press, Albuquerque, USA (1996)

Jaeger, M.: Representation Independence of Nonmonotonic Inference Relations. In: Principles of Knowledge Representation and Reasoning, S. 461 - 472 (Hg. Carlucci-Aiello, L.; Doyle, J.; Shapiro, S.). 5th International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, Massachusetts, 1996. Morgan Kaufmann, San Francisco, USA (1996)

Jaeger, M.; Mannila, H.; Weydert, E.: Data Mining as Selective Theory Extraction in Probabilistic Logic. In: Proceedings of the 1996 SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (Hg. Ng, R.). Untitled Event, Montreal, Canada, 1996. Department of Computer Science, University of British Columbia, Montreal, Canada (1996)

Jünger, M.; Mutzel, P.: Exact and heuristic algorithms for 2-layer straightline crossing minimization. In: Graph Drawing, S. 337 - 348 (Hg. Brandenburg, F. J.). 1995 Symposium on Graph Drawing , Passau, Germany, 20. September 1995 - 22. September 1995. Springer, Berlin, Germany (1996)

Juurlink, B.; Sibeyn, J. F.; Rao, P. S.: Worm-Hole Gossiping on Meshes. In: Euro-Par '96, Parallel Processing, S. 361 - 369 (Hg. Bougé, L.; Fraigniaud, P.; Mignotte, A.; Robert, Y.). Second International Euro-Par Conference, Lyon, France, 26. August 1996 - 29. August 1996. Springer, Berlin, Germany (1996)

Kapoor, S.: On minimum 3-cuts and approximating k-cuts using cut trees. In: Integer Programming and Combinatorial Optimization, S. 132 - 146 (Hg. Cunningham, W. H.; McCormick, T. S.; Queyranne, M.). 5th International IPCO Conference , Vancouver, BC, Canada, 03. Juni 1996 - 05. Juni 1996. Springer, Berlin, Germany (1996)

Kelsen, P.: Neighborhood graphs and distributed "^" + 1-coloring. In: Algorithm Theory - SWAT '96, S. 223 - 233 (Hg. Karlsson, R.; Lingas, A.). 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, 03. Juli 1996 - 05. Juli 1996. Springer, Berlin, Germany (1996)

Kelsen, P.; Mahajan, S.; Hariharan, R.: Approximate Hypergraph Coloring. In: Algorithm Theory - SWAT '96, S. 41 - 52 (Hg. Karlsson, R.; Lingas, A.). 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, 03. Juli 1996 - 05. Juli 1996. Springer, Berlin, Germany (1996)

Keßler, C. W.; Träff, J. L.: A Library of basic PRAM Algorithms and its Implementation in FORK. In: 8th Annual ACM Symposium on Parallel Algorithms and Architechtures (SPAA'96), S. 193 - 195. 8th Annual ACM Symposium on Parallel Algorithms and Architechtures , Padua, Italy, 24. Juni 1996 - 26. Juni 1996. ACM, New York, USA (1996)

Krishna Rao, M. R. K.: A class of Prolog programs inferable from positive data. In: Algorithmic Learning Theory, S. 272 - 284 (Hg. Arikawa, S.; Sharma, A.). 7th International Workshop on Algorithmic Learning Theory, Sydney, Australia, 23. Oktober 1996 - 25. Oktober 1996. Springer, Berlin, Germany (1996)

Krishna Rao, M. R. K.: Completeness results for basic narrowing in non-copying implementations. In: Logic Programming, S. 393 - 407 (Hg. Maher, M.). Untitled Event, Bonn, Germany, 1996. MIT Press, Cambridge, USA (1996)