Noga Mordechai Alon

  • Source: Scopus
  • Calculated based on no. of publications stored in Pure and citations from Scopus
1981 …2021

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 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 proceedingConference contribution

    1 Scopus citations
  • EIGENVALUES, EXPANDERS AND SUPERCONCENTRATORS.

    Alon, N. & Milman, V. D., Dec 1 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 proceedingConference contribution

    44 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 proceedingConference contribution

    12 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 proceedingConference contribution

    65 Scopus citations
  • 1986

    MEANDERS, RAMSEY THEORY AND LOWER BOUNDS FOR BRANCHING PROGRAMS.

    Alon, N. & Maass, W., Jan 1 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 proceedingConference contribution

    16 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 proceedingConference contribution

    7 Scopus citations
  • 1987

    ON DISSEMINATING INFORMATION RELIABLY WITHOUT BROADCASTING.

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

    Research output: Chapter in Book/Report/Conference proceedingConference 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 proceedingConference contribution

    19 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 proceedingConference contribution

    5 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 proceedingConference contribution

    30 Scopus citations
  • 1990

    Separator theorem for graphs with an excluded minor and its applications

    Alon, N., Seymour, P. & Thomas, R., Jan 1 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 proceedingConference contribution

    128 Scopus citations
  • 1991

    A parallel algorithmic version of the local lemma

    Alon, N., Dec 1 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 proceedingConference contribution

    18 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 proceedingConference 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 proceedingConference contribution

    41 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 proceedingConference 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 proceedingConference contribution

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

    Alon, N., Kalai, G., Ricklin, M. & Stockmeyer, L., Jan 1 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 proceedingConference contribution

    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 proceedingConference contribution

    23 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 proceedingConference contribution

    1 Scopus citations
  • The algorithmic aspects of the regularity lemma

    Alon, N., Duke, R. A., Lefmann, H., Rödl, V. & Yuster, R., Jan 1 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 proceedingConference contribution

    30 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 proceedingConference contribution

    46 Scopus citations
  • 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 proceedingConference contribution

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

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

    Research output: Chapter in Book/Report/Conference proceedingConference 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 proceedingConference contribution

    9 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 proceedingConference contribution

    10 Scopus citations
  • Scale-sensitive dimensions, uniform convergence, and learnability

    Alon, N., Ben-David, S., Cesa-Bianchi, N. & Haussler, D., Dec 1 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 proceedingConference contribution

    50 Scopus citations
  • 1994

    A lower bound on the expected length of one-to-one codes

    Alon, N. M. & Orlitsky, A., Dec 1 1994, Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994. 1 p. 394765

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    11 Scopus citations
  • A spectral technique for coloring random 3-colorable graphs (Preliminary version)

    Alon, N. & Kahale, N., May 23 1994, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994. Association for Computing Machinery, p. 346-355 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129502).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    28 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., 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 proceedingConference contribution

    45 Scopus citations
  • Disjoint systems

    Alon, N. M. & Sudakov, B., Jan 1 1994, Algebraic Coding - 1st French-Israeli Workshop, Proceedings. 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 proceedingConference 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 proceedingConference contribution

    27 Scopus citations
  • Matching nuts and bolts

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

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    14 Scopus citations
  • Repeated communication and Ramsey graphs

    Alon, N. M. & Orlitsky, A., Dec 1 1994, Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994. 1 p. 394703

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 1995

    Efficient dynamic-resharing “verifiable secret sharing” against mobile adversary

    Alon, N., Galil, Z. & Yung, M., Jan 1 1995, Algorithms - ESA 1995 - 3rd Annual European Symposium, Proceedings. Spirakis, P. (ed.). Springer Verlag, p. 523-537 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 979).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    18 Scopus citations
  • 1996

    Derandomization via small sample spaces

    Alon, N., 1996, Algorithm Theory - SWAT 1996 - 5th Scandinavian Workshop on Algorithm Theory, Proceedings. Karlsson, R. & Lingas, A. (eds.). Springer Verlag, p. 1-3 3 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1097).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Improved parallel approximation of a class of integer programming problems

    Alon, N. & Srinivasan, A., 1996, Automata, Languages and Programming - 23rd International Colloquium, ICALP 1996, Proceedings. Meyer auf der Heide, F. & Monien, B. (eds.). Springer Verlag, p. 562-573 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1099).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations
  • On-line and off-line approximation algorithms for vector covering problems

    Alon, N., Csirik, J., Sevastianov, S. V., Vestjens, A. P. A. & Woeginger, G. J., 1996, Algorithms - ESA 1996 - 4th Annual European Symposium, Proceedings. Diaz, J. & Serna, M. (eds.). Springer Verlag, p. 406-418 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1136).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Scopus citations
  • The space complexity of approximating the frequency moments

    Alon, N., Matias, Y. & Szegedy, M., Jul 1 1996, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996. Association for Computing Machinery, p. 20-29 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129452).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    519 Scopus citations
  • 1998

    Spectral techniques in graph algorithms

    Alon, N., 1998, LATIN 1998: Theoretical Informatics - 3rd Latin American Symposium, Proceedings. Lucchesi, C. L. & Moura, A. V. (eds.). Springer Verlag, p. 206-215 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1380).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    44 Scopus citations
  • 1999

    Independent sets in hypergraphs with applications to routing via fixed paths

    Alon, N., Arad, U. & Azar, Y., 1999, Randomization, Approximation, and Combinatorial Optimization: Algorithms and Techniques - 3rd International Workshop on Randomization and Approximation Techniques in Computer Science and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX 1999, Proceedings. Rolim, J. D. P., Sinclair, A., Hochbaum, D. & Jansen, K. (eds.). Springer Verlag, p. 16-27 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1671).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    13 Scopus citations
  • 2000

    Scalable secure storage when half the system is faulty

    Alon, N., Kaplan, H., Krivelevich, M., Malkhi, D. & Stern, J., 2000, Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings. Montanari, U., Rolim, J. D. P. & Welzl, E. (eds.). Springer Verlag, p. 576-587 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1853).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    24 Scopus citations
  • 2001

    Constructing worst case instances for semidefinite programming based approximation algorithms

    Alon, N., Sudakov, B. & Zwick, U., Dec 1 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 contribution

    1 Scopus citations
  • 2002

    Guessing secrets efficiently via list decoding (extended abstract)

    Alon, N., Guruswami, V., Kaufman, T. & Sudan, M., Jan 1 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 254-262 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    20 Scopus citations
  • Testing satisfiability

    Alon, N. & Shapira, A., Jan 1 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 645-654 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    15 Scopus citations
  • 2005

    A characterization of the (natural) graph properties testable with one-sided error

    Alon, N. & Shapira, A., 2005, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005. p. 429-438 10 p. 1530735. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2005).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    50 Scopus citations
  • Additive approximation for edge-deletion problems

    Alon, N., Shapira, A. & Sudakov, B., 2005, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005. p. 419-428 10 p. 1530734. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2005).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    26 Scopus citations
  • Generalization error bounds for collaborative prediction with low-rank matrices

    Srebro, N., Alon, N. & Jaakkola, T. S., Jan 1 2005, Advances in Neural Information Processing Systems 17 - Proceedings of the 2004 Conference, NIPS 2004. Neural information processing systems foundation, (Advances in Neural Information Processing Systems).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    40 Scopus citations
  • 2006

    A combinatorial characterization of the testable graph properties: It's all about regularity

    Alon, N., Fischer, E., Newman, I. & Shapira, A., 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. p. 251-260 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    85 Scopus citations
  • Additive approximation for edge-deletion problems (abstract)

    Alon, N., Shapira, A. & Sudakov, B., Jan 1 2006, Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings. Springer Verlag, p. 1-2 2 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4051 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Conflict-free colorings of shallow discs

    Alon, N. & Smorodinsky, S., 2006, Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. Association for Computing Machinery (ACM), p. 41-43 3 p. (Proceedings of the Annual Symposium on Computational Geometry; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    25 Scopus citations