Noga Mordechai Alon
Contact Expert

View Scopus Profile

Noga Mordechai Alon

Calculated based on number of publications stored in Pure and citations from Scopus
1981 …2024

Research activity per year

Filter
Conference contribution

Search results

  • 1994

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

    Alon, N., Yuster, R. & Zwick, U., May 23 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 proceeding › Conference contribution

    52 Scopus citations

  • Disjoint systems

    Alon, N. & Sudakov, B., 1994, Algebraic Coding - 1st French-Israeli Workshop, Proceedings. Cohen, G., Lobstein, A., Zemor, G. & Litsyn, S. (eds.). Springer Verlag, p. 159-163 5 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 781 LNCS).

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

  • 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 proceeding › Conference contribution

    Open Access
    30 Scopus citations

  • Matching nuts and bolts

    Alon, N., Blum, M., Fiat, A., Kannan, S., Naor, M. & Ostrovsky, R., 1994, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Publ by ACM, p. 690-696 7 p. (Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms).

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

    20 Scopus citations

  • Repeated communication and Ramsey graphs

    Alon, N. & Orlitsky, A., 1994, Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994. Institute of Electrical and Electronics Engineers Inc., p. 315 1 p. 394703. (IEEE International Symposium on Information Theory - Proceedings).

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

  • 1993

    Can visibility graphs be represented compactly?

    Agarwal, P. K., Alon, N., Aronov, B. & Suri, S., 1993, Proceedings of the 9th Annual Symposium on Computational Geometry. Publ by ACM, p. 338-347 10 p. (Proceedings of the 9th Annual Symposium on Computational Geometry).

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

    Open Access
    5 Scopus citations

  • Constructions of depth-2 majority circuits for comparison and addition using linear block codes

    Alon, N. & Bruck, J., 1993, Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE, p. 433 1 p. (Proceedings of the 1993 IEEE International Symposium on Information Theory).

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

  • Long non-crossing configurations in the plane

    Alon, N., Rajagopalan, S. & Suri, S., 1993, Proceedings of the 9th Annual Symposium on Computational Geometry. Publ by ACM, p. 257-263 7 p. (Proceedings of the 9th Annual Symposium on Computational Geometry).

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

    Open Access
    11 Scopus citations

  • Routing permutations on graphs via matchings (extended abstract)

    Alon, N., Chung, F. R. K. & Graham, R. L., Jun 1 1993, Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Association for Computing Machinery, p. 583-591 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

    Open Access
    11 Scopus citations

  • Scale-sensitive dimensions, uniform convergence, and learnability

    Alon, N., Ben-David, S., Cesa-Bianchi, N. & Haussler, D., 1993, Annual Symposium on Foundatons of Computer Science (Proceedings). Anon (ed.). Publ by IEEE, p. 292-301 10 p. (Annual Symposium on Foundatons of Computer Science (Proceedings)).

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

    51 Scopus citations
  • 1992

    Comparison-sorting and selecting m totally monotone matrices

    Alon, N. & Azar, Y., Sep 1 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

    4 Scopus citations

  • Fault tolerant graphs, perfect hash functions and disjoint paths

    Ajtai, M., Alon, N., Bruck, J., Cypher, R., Ho, C. T., Naor, M. & Szémeredi, E., 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 693-702 10 p. 267781. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).

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

    Open Access
    27 Scopus citations

  • Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling

    Alon, N., Kalai, G., Ricklin, M. & Stockmeyer, L., 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 334-343 10 p. 267757. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).

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

    Open Access
    14 Scopus citations

  • On-line Steiner trees in the Euclidean plane

    Alon, N. & Azar, Y., 1992, Eighth Annual Symposium On Computational Geometry. Publ by ACM, p. 337-343 7 p. (Eighth Annual Symposium On Computational Geometry).

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

    Open Access
    26 Scopus citations

  • Piercing convex sets

    Alon, N. & Kleitman, D. J., 1992, Eighth Annual Symposium On Computational Geometry. Publ by ACM, p. 157-160 4 p. (Eighth Annual Symposium On Computational Geometry).

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

    Open Access
    2 Scopus citations

  • The algorithmic aspects of the regularity lemma

    Alon, N., Duke, R. A., Lefmann, H., Rödl, V. & Yuster, R., 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 473-481 9 p. 267804. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).

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

    Open Access
    34 Scopus citations

  • Witnesses for Boolean matrix multiplication and for shortest paths

    Alon, N., Galil, Z., Margalit, O. & Naor, M., 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 417-426 10 p. 267748. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).

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

    56 Scopus citations
  • 1991

    A parallel algorithmic version of the local lemma

    Alon, N., Dec 1991, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 586-593 8 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

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

    19 Scopus citations

  • Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs

    Alon, N., Bruck, J., Naor, J., Naor, M. & Roth, R. M., 1991, Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991. Institute of Electrical and Electronics Engineers Inc., p. 139 1 p. 695195. (IEEE International Symposium on Information Theory - Proceedings).

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

  • On the exponent of the all pairs shortest path problem

    Alon, N., Galil, Z. & Margalit, O., Dec 1991, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 569-575 7 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

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

    43 Scopus citations
  • 1990

    Separator theorem for graphs with an excluded minor and its applications

    Alon, N., Seymour, P. & Thomas, R., 1990, Proc 22nd Annu ACM Symp Theory Comput. Publ by ACM, p. 293-299 7 p. (Proc 22nd Annu ACM Symp Theory Comput).

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

    139 Scopus citations
  • 1989

    On the complexity of radio communication

    Alon, N., Bar-Noy, A., Linial, N. & Peleg, D., 1989, Proc Twenty First Annu ACM Symp Theory Comput. Publ by ACM, p. 274-285 12 p. (Proc Twenty First Annu ACM Symp Theory Comput).

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

    Open Access
    31 Scopus citations
  • 1988

    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

    Open Access
    5 Scopus citations
  • 1987

    ON DISSEMINATING INFORMATION RELIABLY WITHOUT BROADCASTING.

    Alon, N., Barak, A. & Manber, U., 1987, Proceedings - International Conference on Distributed Computing Systems. Popescu-Zeletin, R., Le Lann, G. & Kim, K. H. (eds.). IEEE, p. 74-81 8 p. (Proceedings - International Conference on Distributed Computing Systems).

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

    31 Scopus citations

  • Partitioning and geometric embedding of range spaces of finite vapnik-chervonenkis dimension

    Alon, N., Haussler, D. & Welzl, E., Oct 1 1987, Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987. Soule, D. (ed.). Association for Computing Machinery, Inc, p. 331-340 10 p. (Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987).

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

    24 Scopus citations
  • 1986

    MEANDERS, RAMSEY THEORY AND LOWER BOUNDS FOR BRANCHING PROGRAMS.

    Alon, N. & Maass, W., 1986, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, p. 410-417 8 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

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

    17 Scopus citations

  • 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

    Open Access
    11 Scopus citations
  • 1985

    EXPANDERS, SORTING IN ROUNDS AND SUPERCONCENTRATORS OF LIMITED DEPTH.

    Alon, N., 1985, Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM (Order n 508850), p. 98-102 5 p. (Conference Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    15 Scopus citations

  • GEOMETRICAL REALIZATION OF SET SYSTEMS AND PROBABILISTIC COMMUNICATION COMPLEXITY.

    Alon, N., Frankl, P. & Roedl, V., 1985, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, p. 277-280 4 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

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

    Open Access
    74 Scopus citations
  • 1984

    Eigenvalues, expanders and superconcentrators

    Alon, N. & Milman, V. D., 1984, 25th Annual Symposium on Foundations of Computer Science, FOCS 1984. IEEE Computer Society, p. 320-322 3 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1984-October).

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

    4 Scopus citations

  • EIGENVALUES, EXPANDERS AND SUPERCONCENTRATORS.

    Alon, N. & Milman, V. D., 1984, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, p. 320-322 3 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

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

    46 Scopus citations