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

  • 2021

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

  • 2020

    Palette sparsification beyond (∆ + 1) vertex coloring

    Alon, N. & Assadi, S., Aug 1 2020, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020. Byrka, J. & Meka, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, APPROX6. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 176).

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

    2 Scopus citations
  • The ε-T-net problem

    Alon, N., Jartoux, B., Keller, C., Smorodinsky, S. & Yuditsky, Y., Jun 1 2020, 36th International Symposium on Computational Geometry, SoCG 2020. Cabello, S. & Chen, D. Z. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, LIPIcs-SoCG-2020-5. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 164).

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

  • 2019

    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
  • Private PAC learning implies finite littlestone dimension

    Alon, N., Livni, R., Malliaris, M. & Moran, S., Jun 23 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (eds.). Association for Computing Machinery, p. 852-860 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    16 Scopus citations
  • The Hat Guessing Number of Graphs

    Alon, N., Ben-Eliezer, O., Shangguan, C. & Tamo, I., Jul 2019, 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., p. 490-494 5 p. 8849500. (IEEE International Symposium on Information Theory - Proceedings; vol. 2019-July).

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

    2 Scopus citations
  • 2018

    The price of bounded preemption

    Alon, N., Azar, Y. & Berlin, M., Jul 11 2018, SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 301-310 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

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

  • Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits

    Alon, N., Kumar, M. & Volk, B. L., Jun 1 2018, 33rd Computational Complexity Conference, CCC 2018. Servedio, R. A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 111-1116 1006 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 102).

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

    6 Scopus citations
  • 2017

    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
  • Optimal compression of approximate inner products and dimension reduction

    Alon, N. & Klartag, B., Nov 10 2017, Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017. IEEE Computer Society, p. 639-650 12 p. 8104097. (Annual Symposium on Foundations of Computer Science - Proceedings; vol. 2017-October).

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

    13 Scopus citations
  • Optimal induced universal graphs for bounded-degree graphs

    Alon, N. & Nenadov, R., Jan 1 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 1149-1157 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

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

    Open Access
    8 Scopus citations
  • Testing hereditary properties of ordered graphs and matrices

    Alon, N., Ben-Eliezer, O. & Fischer, E., Nov 10 2017, Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017. IEEE Computer Society, p. 848-858 11 p. 8104115. (Annual Symposium on Foundations of Computer Science - Proceedings; vol. 2017-October).

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

    4 Scopus citations
  • 2016

    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
  • On the duplication distance of binary strings

    Alon, N., Bruck, J., Farnoud, F. & Jain, S., Aug 10 2016, Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., p. 260-264 5 p. 7541301. (IEEE International Symposium on Information Theory - Proceedings; vol. 2016-August).

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

    1 Scopus citations
  • On the maximum quartet distance between phylogenetic trees

    Alon, N., Naves, H. & Sudakov, B., 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 2095-2106 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 3).

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

    Open Access
  • Reliable communication over highly connected noisy networks

    Alon, N., Braverman, M., Efremenko, K., Gelles, R. & Haeupler, B., Jul 25 2016, PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 165-173 9 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; vol. 25-28-July-2016).

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

    20 Scopus citations
  • 2015

    How robust is the wisdom of the crowds?

    Alon, N., Feldman, M., Lev, O. & Tennenholtz, M., 2015, IJCAI 2015 - Proceedings of the 24th International Joint Conference on Artificial Intelligence. Wooldridge, M. & Yang, Q. (eds.). International Joint Conferences on Artificial Intelligence, p. 2055-2061 7 p. (IJCAI International Joint Conference on Artificial Intelligence; vol. 2015-January).

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

    10 Scopus citations
  • Near-optimum universal graphs for graphs with bounded degrees (Extended abstract)

    Alon, N., Capalbo, M., Kohayakawa, Y., Rödl, V., Ruciński, A. & Szemerédi, E., 2015, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 4th International Workshop on Approximation, Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Proceedings. Trevisan, L., Jansen, K., Goemans, M. & Rolim, J. D. P. (eds.). Springer Verlag, p. 170-180 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2129).

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

    7 Scopus citations
  • Welfare Maximization with Limited Interaction

    Alon, N., Nisan, N., Raz, R. & Weinstein, O., Dec 11 2015, Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015. IEEE Computer Society, p. 1499-1512 14 p. 7354469. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2015-December).

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

    16 Scopus citations
  • 2014

    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
  • Linear Boolean classification, coding and 'the critical problem'

    Abbe, E. A., Alon, N. & Bandeira, A. S., 2014, 2014 IEEE International Symposium on Information Theory, ISIT 2014. Institute of Electrical and Electronics Engineers Inc., p. 1231-1235 5 p. 6875029. (IEEE International Symposium on Information Theory - Proceedings).

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

    3 Scopus citations
  • On the compatibility of quartet trees

    Alon, N., Snir, S. & Yuster, R., 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, p. 535-545 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    Open Access
    4 Scopus citations
  • The cover number of a matrix and its algorithmic applications

    Alon, N., Lee, T. & Shraibman, A., Sep 1 2014, Leibniz International Proceedings in Informatics, LIPIcs. Jansen, K., Rolim, J. D. P., Devanur, N. R. & Moore, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 34-47 14 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 28).

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

    3 Scopus citations
  • 2013

    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
  • 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
  • How to put through your agenda in collective binary decisions

    Alon, N., Bredereck, R., Chen, J., Kratsch, S., Niedermeier, R. & Woeginger, G. J., 2013, Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings. Springer Verlag, p. 30-44 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8176 LNAI).

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

    3 Scopus citations
  • On rigid matrices and U-polynomials

    Alon, N. & Cohen, G., 2013, Proceedings - 2013 IEEE Conference on Computational Complexity, CCC 2013. p. 197-206 10 p. 6597762. (Proceedings of the Annual IEEE Conference on Computational Complexity).

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

    3 Scopus citations
  • The approximate rank of a matrix and its algorithmic applications

    Alon, N., Lee, T., Shraibman, A. & Vempala, S., 2013, STOC 2013 - Proceedings of the 2013 ACM Symposium on Theory of Computing. p. 675-684 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    30 Scopus citations
  • The asymmetric matrix partition problem

    Alon, N., Feldman, M., Gamzu, I. & Tennenholtz, M., 2013, Web and Internet Economics - 9th International Conference, WINE 2013, Proceedings. p. 1-14 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8289 LNCS).

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

    3 Scopus citations
  • The value of ignorance about the number of players

    Alon, N., Meir, R. & Tennenholtz, M., Jan 1 2013, Late-Breaking Developments in the Field of Artificial Intelligence - Papers Presented at the 27th AAAI Conference on Artificial Intelligence, Technical Report. AI Access Foundation, p. 2-4 3 p. (AAAI Workshop - Technical Report; vol. WS-13-17).

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

    1 Scopus citations
  • 2012

    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
  • Nearly complete graphs decomposable into large induced matchings and their applications

    Alon, N., Moitra, A. & Sudakov, B., Jun 26 2012, STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. p. 1079-1089 11 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    29 Scopus citations
  • On sunflowers and matrix multiplication

    Alon, N., Shpilka, A. & Umans, C., 2012, Proceedings - 2012 IEEE 27th Conference on Computational Complexity, CCC 2012. p. 214-223 10 p. 6243397. (Proceedings of the Annual IEEE Conference on Computational Complexity).

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

    5 Scopus citations
  • Optimizing budget allocation among channels and influencers

    Alon, N., Gamzu, I. & Tennenholtz, M., 2012, WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web. p. 381-388 8 p. (WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web).

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

    51 Scopus citations
  • Sequential voting with externalities: Herding in social networks

    Alon, N., Babaioff, M., Karidi, R., Lavi, R. & Tennenholtz, M., 2012, EC '12 - Proceedings of the 13th ACM Conference on Electronic Commerce. p. 36 1 p. (Proceedings of the ACM Conference on Electronic Commerce).

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

    12 Scopus citations
  • Space-efficient local computation algorithms

    Alon, N., Rubinfeld, R., Vardi, S. & Xie, N., 2012, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. Association for Computing Machinery, p. 1132-1139 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    Open Access
    57 Scopus citations
  • 2011

    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
  • Pragmatic self-stabilization of atomic memory in message-passing systems

    Alon, N., Attiya, H., Dolev, S., Dubois, S., Potop-Butucaru, M. & Tixeuil, S., 2011, Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Proceedings. p. 19-31 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6976 LNCS).

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

    4 Scopus citations
  • Sum of us: Strategyproof selection from the selectors

    Alon, N., Fischer, F., Procaccia, A. & Tennenholtz, M., Aug 16 2011, TARK XIII: Theoretical Aspects of Rationality and Knowledge - Proceedings of the 13th Conference, TARK 2011. p. 101-110 10 p. (ACM International Conference Proceeding Series).

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

    45 Scopus citations
  • 2010

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

  • High degree graphs contain large-star factors

    Alon, N. & Wormald, N., 2010, Fete of Combinatorics and Computer Science. p. 9-21 13 p. (Bolyai Society Mathematical Studies; vol. 20).

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

    8 Scopus citations
  • On constant time approximation of parameters of bounded degree graphs

    Alon, N., 2010, Property Testing - Current Research and Surveys. p. 234-239 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6390 LNCS).

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

    9 Scopus citations
  • Solving linear systems through nested dissection

    Alon, N. & Yuster, R., 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. IEEE Computer Society, p. 225-234 10 p. 5671172. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

    7 Scopus citations
  • Solving MAX-r-SAT above a tight lower bound

    Alon, N., Gutin, G., Kim, E. J., Szeider, S. & Yeo, A., 2010, Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 511-517 7 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    Open Access
    25 Scopus citations
  • Testing Boolean function isomorphism

    Alon, N. & Blais, E., 2010, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings. p. 394-405 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6302 LNCS).

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

    18 Scopus citations