1989 …2024

Research activity per year

Filter
Conference contribution

Search results

  • 2002

    Roundtrip spanners and roundtrip routing in directed graphs

    Roditty, L., Thorup, M. & Zwick, U., 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 844-851 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    24 Scopus citations
  • 2001

    A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems

    Halperin, E. & Zwick, U., 2001, Integer Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings. Aardal, K. & Gerards, B. (eds.). Springer Verlag, p. 210-225 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2081).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    15 Scopus citations
  • Coloring k-colorable graphs using smaller palettes

    Halperin, E., Nathaniel, R. & Zwick, U., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 319-326 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    14 Scopus citations
  • Combinatorial approximation algorithms for the maximum directed cut problem

    Halperjn, E. & Zwick, U., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 1-7 7 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    33 Scopus citations
  • Competitive analysis of the LRFU paging algorithm

    Cohen, E., Kaplan, H. & Zwick, U., 2001, Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings. Dehne, F., Sack, J-R. & Tamassia, R. (eds.). Springer Verlag, p. 148-154 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2125).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Constructing worst case instances for semidefinite programming based approximation algorithms

    Alon, N., Sudakov, B. & Zwick, U., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 92-100 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • Exact and approximate distances in graphs – A survey

    Zwick, U., 2001, Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings. auf der Heide, F. M. (ed.). Springer Verlag, p. 33-48 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2161).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    125 Scopus citations
  • Semidefinite programming based approximation algorithms

    Zwick, U., 2001, FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings. Hariharan, R., Vinay, V. & Mukund, M. (eds.). Springer Verlag, p. 57 1 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2245).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Which formulae shrink under random restrictions?

    Chockler, H. & Zwick, U., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 702-708 7 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • 1999

    Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs

    Halperin, E. & Zwick, U., 1999, Integer Programming and Combinatorial Optimization - 7th International IPCO Conference, 1999, Proceedings. Cornuejols, G., Burkard, R. E. & Woeginger, G. J. (eds.). Springer Verlag, p. 202-217 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1610).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    5 Scopus citations
  • 1997

    The communication complexity of the universal relation

    Tardos, G. & Zwick, U., 1997, Proceedings - 12th Annual IEEE Conference on Computational Complexity, CCC 1997 (Formerly: Structure in Complexity Theory Conference). IEEE Computer Society, p. 247-259 13 p. 612320. (Proceedings of the Annual IEEE Conference on Computational Complexity).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    15 Scopus citations
  • 1996

    Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems

    Halperin, S. & Zwick, U., 28 Jan 1996, Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996. Association for Computing Machinery, p. 438-447 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. Part F129447).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    21 Scopus citations
  • 1995

    Finding percentile elements

    Dor, D. & Zwick, U., 1995, Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems. Institute of Electrical and Electronics Engineers Inc., p. 88-97 10 p. 377042. (Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • Looking for MUM and DAD: Text-text comparisons do help

    Paterson, M., Tassa, S. & Zwick, U., 1995, Foundations of Software Technology and Theoretical Computer Science - 15th Conference, Proceedings. Thiagarajan, P. S. (ed.). Springer Verlag, p. 1-10 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1026).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • Optimal deterministic approximate parallel prefix sums and their applications

    Goldberg, T. & Zwick, U., 1995, Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems. Institute of Electrical and Electronics Engineers Inc., p. 220-228 9 p. 377028. (Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    18 Scopus citations
  • Selecting the median

    Dor, D. & Zwick, U., 22 Jan 1995, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Association for Computing Machinery, p. 28-37 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    20 Scopus citations
  • The complexity of mean payoff games

    Zwick, U. & Paterson, M. S., 1995, Computing and Combinatorics - 1st Annual International Conference, COCOON 1995, Proceedings. Du, D-Z., Li, M. & Du, D-Z. (eds.). Springer Verlag, p. 1-10 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 959).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    21 Scopus citations
  • 1994

    An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)

    Halperin, S. & Zwick, U., 1 Aug 1994, Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994. Association for Computing Machinery, Inc, p. 1-10 10 p. (Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    14 Scopus citations
  • Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs

    Alon, N., Yuster, R. & Zwick, U., 23 May 1994, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994. Association for Computing Machinery, p. 326-335 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129502).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    50 Scopus citations
  • Finding and counting given length cycles

    Alon, N., Yusfer, R. & Zwick, U., 1994, Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. van Leeuwen, J. (ed.). Springer Verlag, p. 354-364 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 855 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    30 Scopus citations
  • Finding even cycles even faster

    Yuster, R. & Zwick, U., 1994, Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings. Abiteboul, S. & Shamir, E. (eds.). Springer Verlag, p. 532-543 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 820 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    12 Scopus citations
  • 1992

    Amplification and percolation (probabilistic Boolean functions)

    Dubiner, M. & Zwick, U., 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 258-267 10 p. 267766. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    9 Scopus citations
  • Shallow multiplication circuits and wise financial investments

    Paterson, M. S. & Zwick, U., 1 Jul 1992, Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992. Association for Computing Machinery, p. 429-437 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129722).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    1 Scopus citations
  • 1991

    Shallow multiplication circuits

    Paterson, M. S. & Zwick, U., Jun 1991, Proceedings - Symposium on Computer Arithmetic. Publ by IEEE, p. 28-34 7 p. (Proceedings - Symposium on Computer Arithmetic).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • Shrinkage of de Morgan formulae under restriction

    Paterson, M. S. & Zwick, U., Dec 1991, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 324-333 10 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    4 Scopus citations