No photo of Yossi Azar

View Scopus Profile

Yossi Azar

Professor

Former affiliation
 https://orcid.org/0000-0002-5097-8993
1986 …2024

Research activity per year

Search results

  • 1994

    Local optimization of global objectives: Competitive distributed deadlock resolution and resource allocation

    Awerbuch, B. & Azar, Y., 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, p. 240-249 10 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

    49 Scopus citations

  • Lower Bounds for Insertion Methods for TSP

    Azar, Y., Sep 1994, In: Combinatorics Probability and Computing. 3, 3, p. 285-292 8 p.

    Research output: Contribution to journal › Article › peer-review

    10 Scopus citations

  • On-line load balancing

    Azar, Y., Broder, A. Z. & Karlin, A. R., 1 Aug 1994, In: Theoretical Computer Science. 130, 1, p. 73-84 12 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    58 Scopus citations

  • On the problem of approximating the number of bases of a matriod

    Azar, Y., Broder, A. Z. & Frieze, A. M., 8 Apr 1994, In: Information Processing Letters. 50, 1, p. 9-11 3 p.

    Research output: Contribution to journal › Article › peer-review

    9 Scopus citations
  • 1993

    On-line choice of on-line algorithms

    Azar, Y., Broder, A. Z. & Manasse, M. S., 1993, p. 432-440. 9 p.

    Research output: Contribution to conference › Paper › peer-review

    25 Scopus citations

  • Online load balancing of temporary tasks

    Azar, Y., Kalyanasundaram, B., Plotkin, S., Pruhs, K. R. & Waarts, O., 1993, Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings. Dehne, F., Sack, J.-R., Santoro, N. & Whitesides, S. (eds.). Springer Verlag, p. 119-130 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 709 LNCS).

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

    42 Scopus citations

  • On-line load balancing with applications to machine scheduling and virtual circuit routing

    Aspnes, J., Azar, Y., Fiat, A., Plotkin, S. & Waarts, O., 1 Jun 1993, Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Association for Computing Machinery, p. 623-631 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129585).

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

    Open Access
    111 Scopus citations

  • On-line steiner trees in the Euclidean plane

    Alon, N. & Azar, Y., Dec 1993, In: Discrete and Computational Geometry. 10, 1, p. 113-121 9 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    40 Scopus citations

  • Throughput-competitive on-line routing

    Awerbuch, B., Azar, Y. & Plotkin, S., 1993, Annual Symposium on Foundatons of Computer Science (Proceedings). Anon (ed.). Publ by IEEE, p. 32-41 10 p. (Annual Symposium on Foundatons of Computer Science (Proceedings)).

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

    250 Scopus citations
  • 1992

    Biased random walks

    Azar, Y., Broder, A. Z., Karlin, A. R., Linial, N. & Phillips, S., 1 Jul 1992, Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992. Association for Computing Machinery, p. 1-9 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129722).

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

    20 Scopus citations

  • Comparison-sorting and selecting m totally monotone matrices

    Alon, N. & Azar, Y., 1 Sep 1992, Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992. Association for Computing Machinery, p. 403-408 6 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. Part F129721).

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

    4 Scopus citations

  • On-line load balancing

    Azar, Y., Broder, A. Z. & Karlin, A. R., 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 218-225 8 p. 267770. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).

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

    62 Scopus citations

  • On-line Steiner trees in the Euclidean plane

    Alon, N. & Azar, Y., 1992, Eighth Annual Symposium On Computational Geometry. Association for Computing Machinery (ACM), p. 337-343 7 p. (Eighth Annual Symposium On Computational Geometry).

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

    Open Access
    27 Scopus citations

  • Routing strategies for fast networks

    Azar, Y., Naor, J. & Rom, R., 1992, Proceedings - IEEE INFOCOM'92: The Conference on Computer Communications. p. 170-179 10 p. 263551. (Proceedings - IEEE INFOCOM).

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

    1 Scopus citations

  • The competitiveness of on-line assignments

    Azar, Y., Naor, J. & Rom, R., 1 Sep 1992, Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992. Association for Computing Machinery, p. 203-210 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. Part F129721).

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

    67 Scopus citations
  • 1991

    Parallel comparison algorithms for approximation problems

    Alon, N. & Azar, Y., Jun 1991, In: Combinatorica. 11, 2, p. 97-122 26 p.

    Research output: Contribution to journal › Article › peer-review

    3 Scopus citations

  • Parallel comparison merging of many-ordered lists

    Azar, Y., 28 Jun 1991, In: Theoretical Computer Science. 83, 2, p. 275-285 11 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    1 Scopus citations
  • 1990

    Parallel selection

    Azar, Y. & Pippenger, N., May 1990, In: Discrete Applied Mathematics. 27, 1-2, p. 49-58 10 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    21 Scopus citations

  • Universal sequences for complete graphs

    Alon, N., Azar, Y. & Ravid, Y., May 1990, In: Discrete Applied Mathematics. 27, 1-2, p. 25-28 4 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    17 Scopus citations
  • 1989

    Finding an approximate maximum

    Alon, N. & Azar, Y., 1989, In: SIAM Journal on Computing. 18, 2, p. 258-267 10 p.

    Research output: Contribution to journal › Article › peer-review

    5 Scopus citations
  • 1988

    Average complexity of deterministic and randomized parallel comparison-sorting algorithms

    Alon, N. & Azar, Y., 1988, In: SIAM Journal on Computing. 17, 6, p. 1178-1192 15 p.

    Research output: Contribution to journal › Article › peer-review

    20 Scopus citations

  • Parallel comparison algorithms for approximation problems

    Alon, N. & Azar, Y., 1988, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 194-203 10 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

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

    Open Access
    5 Scopus citations
  • 1987

    The average complexity of deterministic and randomized parallel comparison sorting algorithms

    Alon, N. & Azar, Y., 14 Oct 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987). IEEE, p. 489-498 10 p. 4568305

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

  • TIGHT COMPARISON BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING.

    Azar, Y. & Vishkin, U., 1987, In: SIAM Journal on Computing. 16, 3, p. 458-464 7 p.

    Research output: Contribution to journal › Article › peer-review

    27 Scopus citations
  • 1986

    TIGHT COMPLEXITY BOUNDS FOR PARALLEL COMPARISON SORTING.

    Alon, N., Azar, Y. & Vishkin, U., 1986, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, p. 502-510 9 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

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

    Open Access
    12 Scopus citations