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

  • Conference contribution

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

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

  • Adversarial laws of large numbers and optimal regret in online classification

    Alon, N., Ben-Eliezer, O., Dagan, Y., Moran, S., Naor, M. & Yogev, E., Jun 15 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, p. 447-455 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    Open Access
    1 Scopus citations
  • Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions

    Alon, N. & Lovett, S., 2012, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Proceedings. p. 350-361 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7408 LNCS).

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

    4 Scopus citations
  • 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
  • An elementary construction of constant-degree expanders

    Alon, N., Schwartz, O. & Shapira, A., Jan 1 2007, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, p. 454-458 5 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 07-09-January-2007).

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

    4 Scopus citations
  • A non-linear lower bound for planar epsilon-nets

    Alon, N., 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. IEEE Computer Society, p. 341-346 6 p. 5671197. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

    7 Scopus citations
  • 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
  • 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
  • Balanced families of perfect hash functions and their applications

    Alon, N. & Gutner, S., 2007, Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings. Springer Verlag, p. 435-446 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4596 LNCS).

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

    9 Scopus citations
  • Balanced hashing, color coding and approximate counting

    Alon, N. & Gutner, S., 2009, Parameterized and Exact Computation - 4th International Workshop, IWPEC 2009, Revised Selected Papers. p. 1-16 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5917 LNCS).

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

    17 Scopus citations
  • Basic network creation games

    Alon, N., Demaine, E. D., Hajiaghayi, M. T. & Leighton, T., 2010, SPAA'10 - Proceedings of the 22nd Annual Symposium on Parallelism in Algorithms and Architectures. p. 106-113 8 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

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

    36 Scopus citations
  • Bayesian ignorance

    Alon, N., Emek, Y., Feldman, M. & Tennenholtz, M., 2010, PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing. p. 384-391 8 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

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

    4 Scopus citations
  • Beeping a maximal independent set

    Afek, Y., Alon, N., Bar-Joseph, Z., Cornejo, A., Haeupler, B. & Kuhn, F., Nov 2 2011, Distributed Computing - 25th International Symposium, DISC 2011, Proceedings. p. 32-50 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6950 LNCS).

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

    34 Scopus citations
  • Better algorithms and bounds for directed maximum leaf problems

    Alon, N., Fomin, F. V., Gutin, G., Krivelevich, M. & Saurabh, S., 2007, FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - 27th International Conference, Proceedings. Springer Verlag, p. 316-327 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4855 LNCS).

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

    11 Scopus citations
  • Boosting simple learners

    Alon, N., Gonen, A., Hazan, E. & Moran, S., Jun 15 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, p. 481-489 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    Open Access
  • Brief announcement: Sharing memory in a self-stabilizing manner

    Alon, N., Attiya, H., Dolev, S., Dubois, S., Gradinariu, M. & Tixeuil, S., 2010, Distributed Computing - 24th International Symposium, DISC 2010, Proceedings. p. 525-527 3 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6343 LNCS).

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

  • Broadcasting with side information

    Alon, N., Hassidim, A., Lubetzky, E., Stav, U. & Weinstein, A., 2008, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. p. 823-832 10 p. 4691014. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

    123 Scopus citations
  • Broadcast throughput in radio networks: Routing vs. Network coding

    Alon, N., Ghaffari, M., Haeupler, B. & Khabbazian, M., 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, p. 1831-1843 13 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    8 Scopus citations
  • Bundling attacks in judgment aggregation

    Alon, N., Falik, D., Meir, R. & Tennenholtz, M., Dec 1 2013, Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013. p. 39-45 7 p. (Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013).

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

    7 Scopus citations
  • Can a graph have distinct regular partitions?

    Alon, N., Shapira, A. & Stav, U., 2007, Computing and Combinatorics - 13th Annual International Conference, COCOON 2007, Proceedings. Springer Verlag, p. 428-438 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4598 LNCS).

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

  • 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
  • Choice-memory tradeoff in allocations

    Alon, N., Lubetzky, E. & Gurel-Gurevich, O., 2009, Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009. p. 230-238 9 p. 5438628. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

    3 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
  • 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
  • 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
  • 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
  • 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

  • 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

  • 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

  • Deterministic approximation algorithms for the nearest codeword problem

    Alon, N., Panigrahy, R. & Yekhanin, S., 2009, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, Proceedings. p. 339-351 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5687 LNCS).

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

    23 Scopus citations
  • Deterministic combinatorial replacement paths and distance sensitivity oracles

    Alon, N., Chechik, S. & Cohen, S., Jul 1 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).

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

    10 Scopus citations
  • Differential pricing with inequity aversion in social networks

    Alon, N., Mansour, Y. & Tenneholtz, M., 2013, EC 2013 - Proceedings of the 14th ACM Conference on Electronic Commerce. Association for Computing Machinery, p. 9-23 15 p. (Proceedings of the ACM Conference on Electronic Commerce).

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

    14 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

  • Dynamics of evolving social groups

    Alon, N., Feldman, M., Mansour, Y., Oren, S. & Tennenholtz, M., Jul 21 2016, EC 2016 - Proceedings of the 2016 ACM Conference on Economics and Computation. Association for Computing Machinery, Inc, p. 637-654 18 p. (EC 2016 - Proceedings of the 2016 ACM Conference on Economics and Computation).

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

    2 Scopus citations
  • 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
  • Efficient removal lemmas for matrices

    Alon, N. & Ben-Eliezer, O., Aug 1 2017, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017. Rolim, J. D. P., Jansen, K., Williamson, D. P. & Vempala, S. S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 25. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 81).

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

    1 Scopus citations
  • Efficient splitting of necklaces

    Alon, N. & Graur, A., Jul 1 2021, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021. Bansal, N., Merelli, E. & Worrell, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 198).

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

  • 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
  • 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
  • Fast algorithms for maximum subset matching and all-pairs shortest paths in graphs with a (not so) small vertex cover

    Alon, N. & Yustcr, R., 2007, Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag, p. 175-186 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4698 LNCS).

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

    8 Scopus citations
  • Fast FAST

    Alon, N., Lokshtanov, D. & Saurabh, S., Nov 12 2009, Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1 ed. p. 49-58 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5555 LNCS, no. PART 1).

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

    73 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
  • 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
  • Finding disjoint paths in expanders deterministically and online

    Alon, N. & Capalbo, M., 2007, Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007. p. 518-524 7 p. 4389521. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

    9 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
  • 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