Science

Filter
Conference contribution

Search results

  • 1992

    Reading many variables in one atomic operation solutions with linear or sublinear complexity

    Kirousis, L. M., Spirakis, P. & Tsigas, P., 1992, Distributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings. Spirakis, P. G., Kirousis, L. & Toueg, S. (eds.). Springer Verlag, p. 229-241 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 579 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 1991

    A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible

    Bhattacharya, B. K., Mukhopadhyay, A. & Toussaint, G. T., 1991, Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings. Dehne, F., Sack, J.-R. & Santoro, N. (eds.). Springer Verlag, p. 412-424 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 519 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Computing shortest transversals

    Bhattacharya, B. & Toussaint, G., 1991, Automata, Languages and Programming - 18th International Colloquium, Proceedings. Albert, J. L., Artalejo, M. R. & Monien, B. (eds.). Springer Verlag, p. 649-660 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 510 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Computing shortest transversals of sets

    Bhattacharya, B., Czyzowicz, J., Egyed, P., Stojmenovic, I., Toussaint, G. & Urrutia, J., Jun 1 1991, Proceedings of the Annual Symposium on Computational Geometry. Association for Computing Machinery, p. 71-80 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access

  • Design assessment of Ada systems using static analysis

    Delis, A. & Thomas, W. M., 1991, Ada: The Choice for 1992 - Ada-Europe International Conference, Proceedings. Christodoulakis, D. (ed.). Springer Verlag, p. 227-250 24 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 499 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Simple atomic snapshots a linear complexity solution with unbounded time-stamps

    Kirousis, L. M., Spirakis, P. & Tsigas, P., 1991, Advances in Computing and Information – ICCI 1991 - International Conference on Computing and Information, Proceedings. Koczkodaj, W. W., Dehne, F. & Fiala, F. (eds.). Springer Verlag, p. 582-587 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 497 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • The Aquarium Keeper's problem

    Czyzowicz, J., Egyed, P., Everett, H., Rappaport, D., Shermer, T., Souvaine, D., Toussaint, G. & Urrutia, J., Mar 1 1991, Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. Association for Computing Machinery, p. 459-464 6 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • The complexity of the reliable connectivity problem

    Kavadias, D., Kirousis, L. M. & Spirakis, P., 1991, Mathematical Foundations of Computer Science 1991 - 16th International Symposium, Proceedings. Tarlecki, A. (ed.). Springer Verlag, p. 259-260 2 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 520 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 1989

    Determining sector visibility of a polygon

    Bhattacharya, B., Kirkpatrick, D. G. & Toussaint, G. T., Jun 5 1989, Proceedings of the 5th Annual Symposium on Computational Geometry, SCG 1989. Association for Computing Machinery, p. 247-254 8 p. (Proceedings of the Annual Symposium on Computational Geometry; vol. Part F130124).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access

  • Lower bounds and efficient algorithms for multiprocessor scheduling of dags with communication delays

    Jung, H., Kirousis, L. & Spirakis, P., Mar 1 1989, Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989. Leighton, F. T. (ed.). Association for Computing Machinery, Inc, p. 254-264 11 p. (Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Parallel complexity of the subgraph connectivity problem

    Kirousis, L., Serna, M. & Spirakis, P., 1989, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 294-299 6 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 1988

    A proof technique for register atomicity: Preliminary version

    Awerbuch, B., Kirousis, L. M., Kranakis, E. & Vitányi, P. M. B., 1988, Foundations of Software Technology and Theoretical Computer Science - 8th Conference, Proceedings. Nori, K. V. & Kumar, S. (eds.). Springer Verlag, p. 286-303 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 338 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Atomic multireader register

    Kirousis, L. M., Kranakis, E. & Vitányi, P. M. B., 1988, Distributed Algorithms - 2nd International Workshop, Proceedings. van Leeuwen, J. (ed.). Springer Verlag, p. 278-296 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 312 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Probabilistic log-space reductions and problems probabilistically hard for p

    Kirousis, L. M. & Spirakis, P., 1988, SWAT 88 - 1st Scandinavian Workshop on Algorithm Theory, Proceedings. Karlsson, R. & Lingas, A. (eds.). Springer Verlag, p. 163-175 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 318 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 1987

    Computing the link center of a simple polygon

    Lenhart, W., Pollack, R., Sack, J., Seidel, R., Shari, M., Suri, S., Toussaint, G., Whitesides, S. & Yap, C., Oct 1 1987, Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987. Soule, D. (ed.). Association for Computing Machinery, Inc, p. 1-10 10 p. (Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
  • 1986

    A polynomial algorithm for recognizing images of polyhedra

    Kirousis, L. M., 1986, VLSl Algorithms and Architectures - Aegean Workshop on Computing, Proceedings. Mehlhorn, K., Makedon, F., Papatheodorou, T. & Spirakis, P. (eds.). Springer Verlag, p. 194-204 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 227 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • On computing simple circuits on a set of line segments

    Rappaport, D., Imai, H. & Toussaint, G. T., Aug 1 1986, Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986. Association for Computing Machinery, Inc, p. 52-60 9 p. (Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access

  • ON HANKEL-NORM APPROXIMATION OF STATIONARY INCREMENT PROCESSES.

    Gombani, A., Pavon, M. & Coppo, B., 1986, Unknown Host Publication Title. North-Holland, p. 307-323 17 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 1985

    COMPLEXITY OF RECOGNIZING POLYHEDRAL SCENES.

    Kirousis, L. M. & Papadimitriou, C. H., 1985, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, p. 175-185 11 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Computing the width of a set

    Houle, M. B. & Toussaint, G. T., Jun 1 1985, Proceedings of the 1st Annual Symposium on Computational Geometry, SCG 1985. Association for Computing Machinery, Inc, p. 1-7 7 p. (Proceedings of the 1st Annual Symposium on Computational Geometry, SCG 1985).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access

  • RECENT RESULTS IN COLLISION AVOIDANCE PROBLEMS.

    Toussaint, G. T., 1985, Unknown Host Publication Title. IEEE, p. 194-197 4 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Translating polygons in the plane

    Sack, J. R. & Toussaint, G. T., 1985, STACS 85 - 2nd Annual Symposium on Theoretical Aspects of Computer Science. Mehlhorn, K. (ed.). Springer Verlag, p. 310-321 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 182 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 1984

    OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN TWO CROSSING CONVEX POLYGONS.

    Toussaint, G. T., 1984, Proceedings - International Conference on Pattern Recognition. IEEE, p. 465-467 3 p. (Proceedings - International Conference on Pattern Recognition).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution