Conference Paper (80)

61.
Conference Paper
Barth, P.; Kleine Büning, H.; Weidenbach, C.: Workshop CPL Computational Propositional Logic. In: KI-95 Activities: Workshops, Posters, Demos, pp. 71 - 72 (Eds. Dreschler-Fischer, L.; Pribbenow, S.). KI-95 Activities: Workshops, Posters, Demos, Bielefeld, Germany, September 11, 1995 - September 15, 1995. Gesellschaft für Informatik, Bonn, Germany (1995)
62.
Conference Paper
Barve, R. D.; Grove, E.; Vitter, J. S.: An Application-Controlled Paging Algorithm for a Shared Cache. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 204 - 213. 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, October 23, 1995 - October 25, 1995. IEEE, Los Alamitos (1995)
63.
Conference Paper
Basin, D.; Klarlund, N.: Hardware Verification using Monadic Second‐order Logic. In: Computer Aided Verification, pp. 31 - 41 (Ed. Wolper, P.). 7th International Conference on Computer Aided Verification, Liège, Belgium, July 03, 1995 - July 05, 1995. Springer, Berlin (1995)
64.
Conference Paper
Baumeister, H.: Relations as Abstract Datatypes: An Institution to Specify Relations between Algebras. In: TAPSOFT '95: Theory and Practice of Software Development, pp. 756 - 771 (Eds. Mosses, P. D.; Nielsen, M.; Schwartzbach, M. I.). 6th Joint Conference on Theory and Practice of Software Development, Århus, Denmark, May 22, 1995 - May 26, 1995. Springer, Berlin, Germany (1995)
65.
Conference Paper
Berg, M. d.; Kreveld, M. v.; Schirra, S.: A new approach to subdivision simplification. In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, pp. 79 - 88. Untitled Event, Charlotte, North Carolina, USA, 1995. ACSM, Bethesda, USA (1995)
66.
Conference Paper
Berthomé, P.; Duboux, T.; Hagerup, T.; Newman, I.; Schuster, A.: Self-Simulation for the Passive Optical Star Model. In: Algorithms - ESA '95, pp. 369 - 380 (Ed. Spirakis, P.). 3rd Annual European Symposium on Algorithms, Corfu, Greece, September 25, 1995 - September 27, 1995. Springer, Berlin (1995)
67.
Conference Paper
Bodlaender, H. L.; Hagerup, T.: Parallel Algorithms with Optimal Speedup for Bounded Treewidth. In: Automata, Languages, and Programming, pp. 268 - 279 (Eds. Fülöp, Z.; Gecseg, F.). ICALP 1995, Szeged, Hungary, July 10, 1995 - July 14, 1995. Springer, Berlin (1995)
68.
Conference Paper
Bradford, P. G.; Choppela, V.; Rawlins, G. J.E.: Lower Bounds for the Matrix Chain Ordering Problem. In: LATIN '95: Theoretical Informatics, pp. 112 - 130 (Eds. Baeza-Yates, R.; Goles, E.; Poblete, P. V.). 2nd Latin American Symposium on Theoretical Informatics, Valparaiso, Chile, April 03, 1995 - April 07, 1995. Springer, Berlin (1995)
69.
Conference Paper
Bradford, P. G.; Fleischer, R.: Matching nuts and bolts faster. In: Algorithms and Computation, pp. 402 - 408 (Eds. Staples, J.; Eades, P.; Katoh, N.; Moffat, A.). 6th International Symposium on Algorithms and Computation, Cairns, Australia, December 04, 1995 - December 06, 1995. Springer, Berlin, Germany (1995)
70.
Conference Paper
Burnikel, C.; Könemann, J.; Mehlhorn, K.; Näher, S.; Schirra, S.; Uhrig, C.: Exact Geometric Computation in LEDA. In: Proceedings of the 11th ACM Symposium on Computational Geometry, pp. C18 - C19. 11th ACM Symposium on Computational Geometry, Vancouver, British Columbia, Canada, June 05, 1995 - June 07, 1995. ACM, New York, NY (1995)
71.
Conference Paper
Chaudhuri, S.; Dubhashi, D.: (Probabilistic) Recurrence Relations Revisited. In: LATIN' 95: Theoretical Informatics, pp. 207 - 219 (Eds. Baeza-Yates, R.; Goles, E.; Poblete, P. V.). Second Latin American Symposium, Valparaiso, Chile, April 03, 1995 - April 07, 1995. Springer, Berlin (1995)
72.
Conference Paper
Chaudhuri, S.; Hagerup, T.: Prefix Graphs and their Applications. In: Graph-theoretic Concepts in Computer Science, pp. 206 - 218 (Eds. Mayr, E. W.; Schmidt, G.; Tinhofer, G.). 20th International Workshop on Graph-theoretic Concepts in Computer Science, Hersching, Germany, June 16, 1994 - June 18, 1994. Springer, Berlin (1995)
73.
Conference Paper
Chaudhuri, S.; Zaroliagis, C.: Optimal Parallel Shortest Paths in Small Treewidth Digraphs. In: Algorithms - ESA'95: 3rd Annual European Symposium, pp. 31 - 45 (Ed. Spirakis, P.). Untitled Event, Corfu, Greece, 1995. Springer, Berlin (1995)
74.
Conference Paper
Chaudhuri, S.; Zaroliagis, C.: Shortest Path Queries in Digraphs of Small Treewidth. In: Automata, Languages, and Programming, pp. 244 - 255 (Eds. Fülöp, Z.; Gecseg, F.). 22nd International Colloquium on Automata, Languages, and Programming, Szeged, Hungary, July 10, 1995 - July 14, 1995. Springer, Berlin (1995)
75.
Conference Paper
Chiang, Y.-F.; Goodrich, M. T.; Grove, E.; Tamassia, R.; Vengroff, D. E.; Vitter, J. S.: External-Memory Graph Algorithms. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 139 - 149. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, USA, January 22, 1995 - January 24, 1995. SIAM, Philadelphia, PA (1995)
76.
Conference Paper
Dedorath, J.; Gergov, J.; Hagerup, T.: More Efficient Parallel Flow Algorithms. In: Algorithms and Computation: 6th International Symposium (ISAAC95), pp. 234 - 243 (Eds. Staples, J.; Eades, P.; Katoh, N.; Moffat, A.). Untitled Event, Cairns, Australia, 1995. Springer, Berlin (1995)
77.
Conference Paper
Djidjev, H. N.; Pantziou, G. E.; Zaroliagis, C.: Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs. In: Fundamentals of Computation Theory, pp. 191 - 200 (Ed. Reichel, H.). 10th International Conference on Fundamentals of Computation Theory, Dresden, Germany, August 22, 1995 - August 25, 1995. Springer, Berlin (1995)
78.
Conference Paper
Djidjev, H. N.; Pantziou, G. E.; Zaroliagis, C.: On-line and Dynamic Algorithms for Shortest Path Problems. In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, pp. 193 - 204 (Eds. Mayr, E. W.; Puech, C.). Untitled Event, Munich, Germany, 1995. Springer, Berlin (1995)
79.
Conference Paper
Djidjev, H. N.; Pantziou, G. E.; Zaroliagis, C.: On-line and Dynamic Algorithms for Shortest Path Problems. In: STACS 95, pp. 193 - 204 (Eds. Mayr, E. W.; Puech, C.). 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 02, 1995 - March 04, 1995. Springer, Berlin (1995)
80.
Conference Paper
Evans, B.; Schwarz, C.; Teich, J.; Vainshtein, A.; Welzl, E.: Minimal enclosing parallelogram with application. In: 11th Annual ACM Symposium on Computational Geometry (SCG95), pp. C34 - C35. Untitled Event, Vancouver, British Columbia, Canada, 1995. acm-Press, New York (1995)
Go to Editor View